51 Result(s)
within
Discrete Mathematics in Computer Science
Minghui **ao
Chapter
-
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
Inapproximability of Maximal Strip Recovery: II
Maximal Strip Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff for reliably recovering syntenic blocks from genomic maps in the midst of noise and ambiguities. Given d genomic maps...
-
Chapter and Conference Paper
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval on each track. As generalizatio...
-
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
On Reconfiguration of Disks in the Plane and Related Problems
We revisit two natural reconfiguration models for systems of disjoint objects in the plane: translation and sliding. Consider a set of n pairwise interior-disjoint objects in the plane that need to be brought fro...
-
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
On the Red/Blue Spanning Tree Problem
A geometric spanning tree of a point set S is a tree whose vertex set is S and whose edge set is a set of non-crossing straight line segments with endpoints in S. Given a set of red points and a set of blue point...
-
Chapter and Conference Paper
Dynamic Epistemic Logic of Finite Identification
Following the approach given by Nina Gierasimczuk [2009] to bridge dynamic epistemic logic and learning theory, the logic of finite identification in the limit in the process of learning has been explored in t...
-
Chapter and Conference Paper
Inapproximability of Maximal Strip Recovery
In comparative genomic, the first step of sequence analysis is usually to decompose two or more genomes into syntenic blocks that are segments of homologous chromosomes. For the reliable recovery of syntenic b...
-
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
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance. In this paper, for the first time, we consider the problem of simplifying 3D polygonal chains under t...
-
Chapter and Conference Paper
Swee** Points
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is placed at a start position somewh...
-
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...
