DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this paper, we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn graphs;in particular, the...
详细信息
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this paper, we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn graphs;in particular, the recognition of DNA graphs is shown to be NP-hard. As a consequence, two open questions from a recent paper by Blazewicz et al. (Discrete Appl. Math. 98, (1999) 1) are answered in the negative. (C) 2002 Elsevier Science B.V. All rights reserved.
In this work, we investigated the benefit of head gestures as a user interface to control hearing instruments (HIs). We developed a prototype of a head-gesture-controlled HI, which was based on a customised wireless a...
详细信息
In this work, we investigated the benefit of head gestures as a user interface to control hearing instruments (HIs). We developed a prototype of a head-gesture-controlled HI, which was based on a customised wireless acceleration sensor for unconstrained and continuous real-time monitoring of the user's head movements. We evaluated the system from a technical point of view and achieved a precision of 96% and a recall of 97% for spotting the two head gestures used: tilting the head to the left and right side. We further evaluated the system from the user's point of view based on the feedback from 6 hearing-impaired HI users (4 men, 2 women, age 27-60). We compared our head-gesture-based control to existing HI user interfaces: HI-integrated buttons and HI remote control. We found that the benefit of the different HI interaction solutions depends on the user's current situations and that all participating HI users would appreciate head gesture control as an additional, complementing user interface.
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are...
详细信息
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity O(n(7)) to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class.
At present, there is less software related to sport technical behavior recognition, and there are few studies on the classification and identification of detailed actions. By introducing computer technology to analyze...
详细信息
At present, there is less software related to sport technical behavior recognition, and there are few studies on the classification and identification of detailed actions. By introducing computer technology to analyze the efficiency and regularity of sports, not only the characteristics of athletes can be excavated, but also the visibility and dynamic tracking of sport training can be provided. The process of sports education is a fast and complex systematic process. Through the interactive system of physical education, we can use different methods to collect sports data and make a comparative analysis of athletes' movements. Through the data mining of the relationship between athletes' physiological indexes and sports load, the unreasonable link in sports training can be avoided. Also, in sports training, we can use computer vision and modern biomechanics to construct a virtual sports education situation. With the classification accuracy as the fitness function, this paper collects the data through the network database, and returns the corresponding sport training parameters on this basis. The results showed that the accuracy of the model was nearly 98%, which met the actual demand. Therefore, the development of sports education assistant system can provide strong support for the process control of sports training and education.
Conforti, Cornuejols, Kapoor, and Vuskovic (Even-hole-free graphs. Part II: recognition algorithm, J Graph Theory 40 (2002), 238-266) gave a 73-page polynomial time algorithm to test whether a graph has an induced sub...
详细信息
Conforti, Cornuejols, Kapoor, and Vuskovic (Even-hole-free graphs. Part II: recognition algorithm, J Graph Theory 40 (2002), 238-266) gave a 73-page polynomial time algorithm to test whether a graph has an induced subgraph that is a cycle of even length. Here, we provide another algorithm to solve the same problem. The differences are: (1) our algorithm is simpler-we are able to search directly for even holes, while the algorithm of Conforti et al. made use of a structure theorem for even-hole-free graphs, proved in an earlier paper (Conforti, Cornuejols, Kapoor, and Vuskovic, Even-hole-free graphs: Part I: Decomposition theorem, J Graph Theory 39 (2002), 6-49);(2) our algorithm is marginally faster-O(n(31)) for an n-vertex graph (and we sketch another more complicated algorithm that runs in time O(n(15))) while the earlier algorithm appears to take about O(n(40));and (3) we can permit 0/1 weights on the edges and look for an induced cycle of even weight. Consequently, we can test whether a graph is "odd signable." (C) 2004 Wiley Periodicals, Inc.
In recent years, median filtering detection has a widely application in many fields such as images' processing history tracking, image editing detection, image anti-forensics analyzing and anti-steganalysis analyz...
详细信息
In recent years, median filtering detection has a widely application in many fields such as images' processing history tracking, image editing detection, image anti-forensics analyzing and anti-steganalysis analyzing. In this paper, we propose two median filtering detection algorithms. The algorithm I is a recognition algorithm that can identify whether a given image has undergone median filtering. The algorithm II is a discriminating algorithm that can distinguish a median (average, Gaussian) filtered image from unfiltered images. Differing from the general framework of existing median filtering detectors, the contribution of our work is that the presented methods are not based on the statistical learning model. The proposed methods do not need any classifier, or any threshold. These methods are implemented by counting the number of specific Local Binary Pattern encoding patterns of a single image. Experimental results demonstrate that the proposed methods provide high accuracy and broad-spectrum robustness for tolerating content-preserving manipulations. Compared to state-of-the-art methods, the proposed methods exhibit high efficiency, high accuracy, and strong robustness.
Recently new classes of directed, acyclic graphs with n vertices, namely A(m)-orders where m is a larger than I integer, have been presented. These classes contain the interval orders, but are incomparable to trees. H...
详细信息
Recently new classes of directed, acyclic graphs with n vertices, namely A(m)-orders where m is a larger than I integer, have been presented. These classes contain the interval orders, but are incomparable to trees. Here it is shown that the complexity of recognizing the A(m)-order class is O(n(9)), hence independent of m. However, recognizing if a graph is in A(m)-orders for all m might be done in O(n(3)) time. These classes have an application in the preemptive multiprocessor scheduling problem. This problem is NP-hard if the number of processors is arbitrary but open for a fixed number of processors m. When the task graph is an A(m)-order, the problem is polynomial on m processors. Hence it is interesting to recognize such task graphs in a polynomial, independent of m time, especially when the number of processors is large, for instance on a computation grid. (C) 2009 Published by Elsevier B.V.
This paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P-4-simplicial graphs are recognized in O(n(3.376)) time, improving the previous bounds of O(n(4)) an...
详细信息
This paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P-4-simplicial graphs are recognized in O(n(3.376)) time, improving the previous bounds of O(n(4)) and O(n(5)), respectively. Brittle and semi-simplicial graphs are recognized in O(n(3)) time using a randomized algorithm, and O(n(3) log(2) n) time if a deterministic algorithm is required. The best previous time bound for recognizing these classes of graphs is O(m(2)). Welsh-Powell opposition graphs are recognized in O(n(3)) time, improving the previous bound of O(n(4)). HHP-free graphs and maxibrittle graphs are recognized in O(mn) and O(n(3.376)) time, respectively. (C) 2003 Elsevier Science B.V. All rights reserved.
Let G be a cube-free median graph. It is proved that k/2 >= root n-1 >= m/2 root n- >= root n >= root s >= r-1, where n, m, s, k, and r are the number of vertices, edges, squares, Theta-classes, and the...
详细信息
Let G be a cube-free median graph. It is proved that k/2 >= root n-1 >= m/2 root n- >= root n >= root s >= r-1, where n, m, s, k, and r are the number of vertices, edges, squares, Theta-classes, and the number of edges in a smallest Theta-class of G, respectively. Moreover, the equalities characterize Cartesian products of two trees of the same order. The cube polynomial of cube-free median graphs is also considered and it is shown that planar cube-free median graphs can be recognized in linear time. (c) 2006 Elsevier B.V. All rights reserved.
The respiratory health and comfort of animals are closely associated with the air quality of their living environment. The aim of the present work is to identify the relationship between animal sounds and air quality ...
详细信息
The respiratory health and comfort of animals are closely associated with the air quality of their living environment. The aim of the present work is to identify the relationship between animal sounds and air quality of their living environment. Cough sounds of 84 weaners and four important aerial factors (i.e., air temperature, relative humidity, ammonia concentration, and dust concentration) were measured. The resulting power spectral density (PSD) showed a significant difference in cough sounds from weaners under different air qualities. Moreover, the developed recognition algorithm, using mel frequency cepstrum coefficients (MFCCs), principal component analysis (PCA), and support vector machine (SVM), provided an average recognition rate of 95% for sound samples collected in different pig houses. The results indicate that the cough sound analysis can provide qualitative information about the situation of the air quality in commercial livestock buildings.
暂无评论