27 Result(s)
within
Chapter
Minghui **ao
Computer Communication Networks
Discrete Mathematics in Computer Science
-
Chapter and Conference Paper
Edge-Disjoint Packing of Stars and Cycles
We study the parameterized complexity of two graph packing problems, Edge-Disjoint \(k\) ...
-
Chapter and Conference Paper
Trees, Paths, Stars, Caterpillars and Spiders
For any \(k \ge 2\) k ≥ ...
-
Chapter and Conference Paper
Shortest Color-Spanning Intervals
Given a set of n points on a line, where each point has one of k colors, and given an integer s i ≥ 1 for each color i, 1 ≤ i ≤ k, the problem Shortest Color-Sp...
-
Chapter and Conference Paper
H ∞ Synchronization Control in Nonlinear Time-Delay Complex Dynamical Network
On the basis of Lyapunov stability theory and LMI technique, this paper investigates H ∞ synchronization control of time-varying synchronization state in general complex networks with time-delay...
-
Chapter and Conference Paper
Flip** Triangles and Rectangles
We study the chromatic number of the flip graph of triangles determined by n points in convex position in the plane, and present new or improved bounds on several related parameters for this graph. We also find t...
-
Chapter and Conference Paper
Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy
We present new results on the parameterized complexities of k - Vertex Clique Partition and k -Separating Vertices in multiple-interval graphs and their complements, and present a very...
-
Chapter and Conference Paper
Opaque Sets
The problem of finding “small” sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We co...
-
Chapter and Conference Paper
Minimum-Perimeter Intersecting Polygons
Given a set \({\mathcal S}\) of segments in the plane, a polygon P is an intersecting polygon of
-
Chapter and Conference Paper
Approximability of Constrained LCS
The problem Constrained Longest Common Subsequence is a natural extension to the classical problem Longest Common Subsequence, and has important applications to bioinformatics. Given k input sequences A ...
-
Chapter and Conference Paper
A Modified Projection Neural Network for Linear Variational Inequalities and Quadratic Optimization Problems
Variational inequalities provide us with a tool to study a wide class of optimization arising in pure and applied sciences. In the paper,we present a neural network for solving linear variational inequalities ...
-
Chapter and Conference Paper
Global and Local Synchronization of General Multi-linked Delayed Complex Dynamical Networks
This paper investigates the phenomena of a new and general multi-linked complex network with delayed nodes and couplings. Via constructing Lyapunov-Krasovskii function and using inequality technique, the crite...
-
Chapter and Conference Paper
Credit Risk Assessment Model of Commercial Banks Based on Fuzzy Neural Network
A commercial bank credit risk assessment model based on fuzzy neural network has been established using the credit assessment index system established for commercial banks. This network is a 6 layered structur...
-
Chapter and Conference Paper
Adaptive Neural-Based Fuzzy Inference System Approach Applied to Steering Control
We applied adaptive neural-based fuzzy inference system (ANFIS) approach to the process control of ship automation manipulating systems. This paper studied the design of ANFIS controller for ship steering cont...
-
Chapter and Conference Paper
On Covering Problems of Rado
T. Rado conjectured in 1928 that if \({\mathcal S}\) is a finite set of axis-parallel squares in the plane, then there ...
-
Chapter and Conference Paper
On Recovering Syntenic Blocks from Comparative Maps
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic block) is a sequence of distinct ...
-
Chapter and Conference Paper
Improved Results on Solving Quadratic Programming Problems with Delayed Neural Network
In this paper, in terms of a linear matrix inequality (LMI), using a delayed Lagrangian network to solve quadratic programming problems, sufficient conditions on delay-dependent and delay-independent are given...
-
Chapter and Conference Paper
Existence and Stability of Periodic Solution of Non-autonomous Neural Networks with Delay
The paper investigates the existence and global stability of periodic solution of non-autonomous neural networks with delay. Then the existence and uniqueness of periodic solutions of the neural networks are d...
-
Chapter and Conference Paper
A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
The 2-Interval Pattern problem over its various models and restrictions was proposed by Vialette for RNA secondary structure prediction, and has attracted a lot of attention from the theoretical computer scien...
-
Chapter and Conference Paper
Active Learning of Support Vector Machine for Fault Diagnosis of Bearings
Based on traditional Active Support Vector Machine (ASVM), the learning method of Probabilistic Active SVM (ProASVM) is introduced to detect fault of bearings. Compared with the general SVM, the active learnin...
-
Chapter and Conference Paper
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m + n 6/ε 12) time (1+ε)-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minim...
