The class of hhds-free graphs properly generalizes the classes of strongly chordal graphs and distance-hereditary graphs, and forms a restriction of the class of perfectly orderable graphs. The problem of recognizing ...
详细信息
The class of hhds-free graphs properly generalizes the classes of strongly chordal graphs and distance-hereditary graphs, and forms a restriction of the class of perfectly orderable graphs. The problem of recognizing hhds-free graphs in polynomial time was posed by Brandstadt (Problem session, Dagstuhl seminor No. 04221, 2004), and Nikolopoulos and Palios (Proceedings of the 31st International Workshop on Graph Theoretic Concepts in Computer Science, 2005) gave an O(mn(2)) algorithm. We present an O(n(3))-time algorithm for the problem. Our algorithm demonstrates a relationship between hhds-free graphs and strongly chordal graphs similar to that which is known to exist between hhd-free graphs and chordal graphs.
Because traditional correlation pattern recognition algorithm cannot accurately identify low-resolution images, a low-resolution image correlation pattern recognition algorithm based on block-centric symmetric local b...
详细信息
Because traditional correlation pattern recognition algorithm cannot accurately identify low-resolution images, a low-resolution image correlation pattern recognition algorithm based on block-centric symmetric local binary model and weighted principal component analysis algorithm is proposed. Firstly, the feature of low-resolution image is extracted by using block CS-LBP operator. The weighted PCA operator is used to reduce the feature, and the classification feature is obtained. Secondly, the optimal classification class is selected by the nearest neighbor classifier, the recognition rate is calculated, and the whole algorithm is analyzed. Finally, the experiment is carried out. The experimental results showed that the algorithm has good recognition effect on ORL, and it is robust to the change of light and weather.
A 0, +/- 1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti et al. (J. Combin. Theory B 77 (1999) 292;B ...
详细信息
A 0, +/- 1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti et al. (J. Combin. Theory B 77 (1999) 292;B 81 (2001) 275), provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduced by Chudnovsky and Seymour (Combinatorica, to appear) for Berge graphs. (C) 2005 Elsevier Inc. All rights reserved.
A key issue in technical analysis is to obtain good and possibly stable profits. Various trading rules for financial markets do exist for this task. This paper describes a pattern recognition algorithm to optimally ma...
详细信息
ISBN:
(纸本)9788847014800
A key issue in technical analysis is to obtain good and possibly stable profits. Various trading rules for financial markets do exist for this task. This paper describes a pattern recognition algorithm to optimally match training and trading periods for technical analysis rules. Among the filter techniques, we use the Dual Moving Average Crossover (DMAC) rule. This technique is applied to hourly observations of Euro-Dollar exchange rates. The matching method is accomplished using ten chart patterns very popular in technical analysis. Moreover, in order for the results to have a statistical sense, we use the bootstrap technique. The results show that the algorithm proposed is a good starting point to obtain positive and stable profits.
This paper introduces a new class of strings on {a, b}, called two-pattern strings, that constitute a substantial generalization of Sturmian strings while at the same time sharing many of their nice properties. In par...
详细信息
In a previous paper the authors described an algorithm to determine whether a group of matrices over a finite field, generated by a given set of matrices, contains one of the classical groups or the special linear gro...
详细信息
In a previous paper the authors described an algorithm to determine whether a group of matrices over a finite field, generated by a given set of matrices, contains one of the classical groups or the special linear group. The algorithm was designed to work for all sufficiently large field sizes and dimensions of the matrix group. However, it did not apply to certain small cases. Here we present an algorithm to handle the remaining cases. The theoretical background of the algorithm presented in this paper is a substantial extension of that needed for the original algorithm.
The ability to accurately and continuously monitor seeding quality allows farmers to improve their seeding practices, maintain appropriate seed spacing, and maximize crop productivity. The precise detection and counti...
详细信息
The ability to accurately and continuously monitor seeding quality allows farmers to improve their seeding practices, maintain appropriate seed spacing, and maximize crop productivity. The precise detection and counting of individual seeds, especially those that pass through and overlap in pairs or multiples, is a major challenge in developing seed monitoring systems. In this research, a novel shape-based algorithm is presented that utilizes seven pairs of 3-mm infrared LEDs to efficiently recognize and count both single seeds and overlapping seeds. The outputs of the receivers were converted to binary signals by comparing them to samples taken when no seed flow was present. Each infrared receiver acted as a pixel, and to recognize and count multiple seeds, their outputs were temporarily stored in a matrix with seven columns. When the seeds passed the sensor, their outputs were analyzed together using an innovative and systematic clustering algorithm. This enables shape-based processing and recognition of passing seeds regardless of type and size, effectively reducing counting errors. The developed system was subjected to testing using seven different seed types on a conveyor belt, while one seed type underwent testing on a precision corn seeder in the laboratory. The results indicated a high level of agreement between the sensor data and the actual seed rates. The average counting accuracy for popcorn, hybrid corn, chickpea, pinto beans, coated tomato, mung beans, and soybean seeds on the conveyor belt platform was 0.99, 0.99, 0.98, 0.96, 0.8, 0.99, and 0.99, respectively. The results showed that the accuracy of the algorithm increases with increasing sphericity and size of the seeds relative to the distance between the adjacent LEDs. Moreover, the counting accuracy exceeded 97% for all rates on the precision corn seeder platform, with an average accuracy of 0.986.
Early defibrillation plays very important role to survive patients suffering from sudden cardiac arrest. Thus, there are lots of recognition algorithms for electrocardiogram, and we have also proposed recognition algo...
详细信息
ISBN:
(纸本)9781728121949
Early defibrillation plays very important role to survive patients suffering from sudden cardiac arrest. Thus, there are lots of recognition algorithms for electrocardiogram, and we have also proposed recognition algorithms based on spectrum feature parameters of electrocardiograms (ECGs). In this paper, we show the detailed analysis result of our recognition algorithm, and in particular the degree of similarity between Ventricular Tachycardia (VF) and PEA (Pulseless Electrical Activity) is evaluated.
This paper proposes a new recognition algorithm for shockable arrhythmias for patients suffering from sudden cardiac arrest. In this paper, by using gabor wavelet transform (GWT), useful and effective spectrum feature...
详细信息
ISBN:
(纸本)9781509066841
This paper proposes a new recognition algorithm for shockable arrhythmias for patients suffering from sudden cardiac arrest. In this paper, by using gabor wavelet transform (GWT), useful and effective spectrum features for electrocardiogram (ECG) are extracted. The proposed recognition algorithm based on spectrum features can achieve good performance comparing with the existing results, i.e. the result of this paper is useful.
暂无评论