This paper tries to fill the gap between Traditional Chinese Pulse Diagnosis (TCPD) and Doppler diagnosis by applying digital signal analysis and pattern classification techniques to wrist radial arterial Doppler bloo...
详细信息
ISBN:
(纸本)9781424475421
This paper tries to fill the gap between Traditional Chinese Pulse Diagnosis (TCPD) and Doppler diagnosis by applying digital signal analysis and pattern classification techniques to wrist radial arterial Doppler blood flow signals. Doppler blood flows signals (DBFS) of patients with cholecystitis, gastritis and healthy people are classified by L2-soft margin SVM and 5 linear classifiers using the proposed feature - piecewise axially integrated bispectra (PAIB). A 5-fold cross validation is used for performance evaluation. The classification accuracies between either two groups of subjects are greater than 93%. Gastritis can be recognized with higher accuracy than cholecystitis. Cholecystitis can be recognized with higher accuracy on left hand data than right. The findings in this paper partly conform to the theory of TCPD. Though the sample size is relatively small, we could still argue that the methods proposed here are effective and could serve as an assistive tool for TCPD.
In order to improve the accuracy of the image annotation, an automatic image annotation method based on mutual K-nearest neighbor graph (MKNN) is proposed. The proposed algorithm describes the relationship between low...
详细信息
In order to improve the accuracy of the image annotation, an automatic image annotation method based on mutual K-nearest neighbor graph (MKNN) is proposed. The proposed algorithm describes the relationship between low-level features, annotation words and image by a mutual K-nearest neighbor graph. Semantic information is extracted by exploiting the mutual relationship of two nodes in the mutual K-nearest neighbor graph. Inverse document frequency (IDF) is introduced to adjust the weights of edges between the image node and its annotation word's node, which overcomes the deviation caused by high-frequency words. Experimental results in Corel image dataset show that the proposed algorithm improves effectively the image annotation performance..
The Mel-frequency cepstral coefficients (MFCC) are commonly used in speech recognition systems. But, they are highly sensitive to presence of external noise. In this paper, we propose a two-step method to compensate n...
详细信息
With the development of the 3G technology, M-learning enters a period of rapid development. But meanwhile 3G also restrains the development of M-learning due to several drawbacks in its early days. According to the ap...
详细信息
With the development of the 3G technology, M-learning enters a period of rapid development. But meanwhile 3G also restrains the development of M-learning due to several drawbacks in its early days. According to the application analysis, it comes out Flash has its unique features: small capacity, easy to develop high-quality and etc, which can make up for 3G initial stage's disadvantages. Through case design, this paper proves that Flash can be a new effective approach and way for M-learning in the 3G network. In the end, from the aspects of technical and artistic, this paper makes a further research on how to improve the flash animation to serve the M-learning better.
Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the...
详细信息
Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP). Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15~73.02%) and improvement on packet delivery ratio (99.76%) are observed.
Mobile agent is a suitable paradigm to collect information from multiple sites in a distributed environment. As compare to other technologies, mobile agents can be used beneficially for Automatic Meter Reading (AMR) a...
详细信息
Mobile agent is a suitable paradigm to collect information from multiple sites in a distributed environment. As compare to other technologies, mobile agents can be used beneficially for Automatic Meter Reading (AMR) and to measure power quality information at each energy meter. Since meter contains embedded system, so the choice of agent platform for such an application is very important. This article investigates different methods from literature that use mobile agent paradigm for AMR process. It proposes a method that reduces the total security computation cost which is incurred in AMR process. In this method, energy meters are organized in the form of a group based upon the geographical location. In such one location energy meters perform their jobs under a security manager. In this method, the concept of local mobile agent is proposed to avoid the visit of external mobile agent to energy meters directly. Local mobile agent carries the acceptable queries from security manager and visits energy meters. This article uses mathematical modeling to represent the security computation cost incurred by each method from literature and compare it with the propose method. It is concluded that the proposed mechanism reduces the security computation cost considerably, compared to other methods.
Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with ti...
详细信息
Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n 2 ), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species.
This paper presents a fast connected component labeling algorithm based on line description method and optimized tree Union-Find strategy. The algorithm transforms the pixel-connected issue, which most of proposed alg...
详细信息
This paper presents a fast connected component labeling algorithm based on line description method and optimized tree Union-Find strategy. The algorithm transforms the pixel-connected issue, which most of proposed algorithms focus on, into line-connected issue. This algorithm is comprised of three phrases, line extraction, connected component identification and label assignment. The line description method transforms the connected pixels into line form for reducing the scan time. While the new tree Union-Find strategy diminishes the redundant root compare operations. A comparison analysis is performed with other optimized famous component labeling algorithms. Our algorithm has shown an outstanding performance with respect to the processing time, which achieves 1.1~8 times as fast as the other algorithms in various test cases.
Constructing green innovation system is the science and technology development strategy which the nation is trying to advocate. Scientific research, teaching research and industrial development must impose green-orien...
详细信息
Constructing green innovation system is the science and technology development strategy which the nation is trying to advocate. Scientific research, teaching research and industrial development must impose green-oriented in university, to meet the national green technology development strategy. To form green teaching atmosphere, constructing the green campus culture and infiltrating it into the teaching activities are the main ways, it is necessary to explore new ideas for the construction of green laboratories. According to the requirements of green engineering experiment, we proposed to create a green laboratory used virtual instrument (VI) technology, and optimized the experimental teaching. VI with high technical content, ease of configuration and maintenance easy to save, effective experimental, can provide a comfortable experiment environment, better for the research and teaching.
The paper focuses on a special nonlinear bilevel programming problem (BLPP), and its characteristic is that the follower's programming is convex and quadratic, whereas there are no any additional requirements for ...
详细信息
The paper focuses on a special nonlinear bilevel programming problem (BLPP), and its characteristic is that the follower's programming is convex and quadratic, whereas there are no any additional requirements for the leader's functions. In order to solve the complex problem efficiently, it is first converted into an equivalent single-level programming by using Karush-Kuhn-Tucher (K-K-T) conditions, and then a hybrid genetic algorithm(HGA), combined with an enumeration technique of the bases, is proposed to solve the equivalent problem. At first, a mixed encoding scheme is given, involving the leader's variables and the bases of the follower's linear complementarity system, In addition, we present a fitness function which consists of the leader's objective and a penalty term, and by which the feasible and infeasible individuals can be identified. In order to illustrate the efficiency of HGA, 10 test problems selected from literature are solved, and the computational results show that the proposed algorithm is efficient and robust.
暂无评论