Hand-drawn diagrams are frequently used as the first visualization of a model. Converting these preliminary diagrams into a specific formal format is time consuming. Computer based sketch-tools can offer support durin...
详细信息
ISBN:
(纸本)9781920682743
Hand-drawn diagrams are frequently used as the first visualization of a model. Converting these preliminary diagrams into a specific formal format is time consuming. Computer based sketch-tools can offer support during the informal sketching stage and automatic conversion to formal representations. Entity Relationship diagrams are particularly difficult to convert because of their characteristics such as cardinality notations. We extend the general diagram sketching tool InkKit with domain semantics to successfully recognize and automatically convert Entity Relationship diagrams. This approach takes advantage of sketching as the preferred initial design realization while minimizing the effort required to translate the initial design to a functional prototype.
Recently, D. Corneil found a simple 3-sweep lexicographic breadth first search (LexBFS) algorithm for the recognition of proper interval graphs. We point out how to modify Corneil's algorithm to make it a certifyi...
详细信息
Recently, D. Corneil found a simple 3-sweep lexicographic breadth first search (LexBFS) algorithm for the recognition of proper interval graphs. We point out how to modify Corneil's algorithm to make it a certifying algorithm, and then describe a similar certifying 3-sweep LexBFS algorithm for the recognition of proper interval bigraphs. It follows from an earlier paper that the class of proper interval bigraphs is equal to the better known class of bipartite permutation graphs, and so we have a certifying algorithm for that class as well. All our algorithms run in time O(m+n), including the certification phase. The certificates of representability (the intervals) can be authenticated in time O(m+n). The certificates of nonrepresentability (the forbidden subgraphs) can be authenticated in time O(n).
Frequency recognition is an important task in many engineering fields such as audio signal processing and telecommunications engineering, for example in applications like Dual-Tone Multi-Frequency (DTMF) detection or ...
详细信息
ISBN:
(纸本)0780385268
Frequency recognition is an important task in many engineering fields such as audio signal processing and telecommunications engineering, for example in applications like Dual-Tone Multi-Frequency (DTMF) detection or the recognition of the carrier frequency of a Global Positioning, System (GPS) signal. This paper will present results of investigations on several common Fourier Transform-based frequency recognition algorithms implemented in real time on a Texas Instruments (TI) TMS320C6713 Digital Signal Processor (DSP) core. In addition, suitable metrics are going to be evaluated in order to ascertain which of these selected algorithms is appropriate for audio signal processing(1).
Partially ordered sets of small width and graphs of small Dilworth number have many interesting properties and have been well studied. Here we show that recognition of such orders and graphs can be done more efficient...
详细信息
Partially ordered sets of small width and graphs of small Dilworth number have many interesting properties and have been well studied. Here we show that recognition of such orders and graphs can be done more efficiently than by using the well-known algorithms based on bipartite matching and matrix multiplication. In particular, we show that deciding deciding if an order has width k can be done in O(kn(2)) time and whether a graph has Dilworth number k can be done in O(k(2)n(2)) time. For very small k we have even better results. We show that orders of width at most 3 can be recognized in O(n) time and of width at most 4 in O(n log n).
A graph is (P-5,gem)-free, when it does not contain P-5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P-4) as an ...
详细信息
A graph is (P-5,gem)-free, when it does not contain P-5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P-4) as an induced subgraph. We present O(n(2)) time recognition algorithms for chordal gem-free graphs and for (P-5,gem)-free graphs. Using a characterization of (P-5,gem)-free graphs by their prime graphs with respect to modular decomposition and their modular decomposition trees [A. Brandstadt, D. Kratsch, On the structure of (P-5,gem)-free graphs, Discrete Appl. Math. 145 (2005), 155-166], we give linear time algorithms for the following NP-complete problems on (P-5,gem)-free graphs: Minimum Coloring;Maximum Weight Stable Set;Maximum Weight Clique;and Minimum Clique Cover. (c) 2005 Elsevier B.V. All rights reserved.
A graph is (P-5,gem)-free, when it does not contain P-5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P-4) as an ...
详细信息
A graph is (P-5,gem)-free, when it does not contain P-5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P-4) as an induced subgraph. We present O(n(2)) time recognition algorithms for chordal gem-free graphs and for (P-5,gem)-free graphs. Using a characterization of (P-5,gem)-free graphs by their prime graphs with respect to modular decomposition and their modular decomposition trees [A. Brandstadt, D. Kratsch, On the structure of (P-5,gem)-free graphs, Discrete Appl. Math. 145 (2005), 155-166], we give linear time algorithms for the following NP-complete problems on (P-5,gem)-free graphs: Minimum Coloring;Maximum Weight Stable Set;Maximum Weight Clique;and Minimum Clique Cover. (c) 2005 Elsevier B.V. All rights reserved.
This paper proposes some solutions to improve on recognition algorithms of RoboCup, which is including methods to improve recognition efficiency, recognition precision, and to restrain effect caused by reflex. Multire...
详细信息
ISBN:
(纸本)0780372689
This paper proposes some solutions to improve on recognition algorithms of RoboCup, which is including methods to improve recognition efficiency, recognition precision, and to restrain effect caused by reflex. Multiresolution scanning and dynamic window technique can be used to improve efficiency and precision. In order to restrain effect of reflex, gray-level threshold will be self-adaptive. This paper also proposes a method helping to geometric calibration of image.
A neural network with assembly organization is described, The network is artificially partitioned into several sub-networks according to the number of classes that the network has to recognize. The features extracted ...
详细信息
A neural network with assembly organization is described, The network is artificially partitioned into several sub-networks according to the number of classes that the network has to recognize. The features extracted from input data are encoded into activation of certain patterns of neurons in the sub-networks. During a process of primary learning, Hebb's neural assemblies are formed in the sub-networks by means of modification of connections' weights. A procedure of secondary learning, which is named as that of differentiation, is described. The procedure is intended to improve a recognition accuracy of the network by means of additional modification of connections' weights between the neurons of the same sub-networks. A computer simulation of the network is performed. The differentiation process is studied in a set of experiments on a character recognition task using two types of objects: Ukrainian letters and Arabic numerals of modified US National Institute of Standards and Technology (MNIST) database. (C) 2004 Elsevier B.V. All rights reserved.
In this work we introduce, characterize, and provide algorithmic results for (k, +)-distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networks with desirable connectivity properties...
详细信息
暂无评论