Allergic rhinitis is a prevalent disease throughout the world. Electrodermal screening devices (EDSD) are devices that can measure the electrical properties of acupuncture points. This paper performs a series of experiments based on machine learning algorithms to study the feasibility of utilizing EDSD to diagnose allergic rhinitis. The experimental result shows that, to assess the presence of allergic rhinitis, using the k-nearest neighbor classification algorithm, the accuracy can achieve 93.26%, and using the support vector machine classification algorithm, the average accuracy can achieve 97.78%. The experimental result also shows that using, respectively, the k-means clustering algorithm and the Ward's hierarchical clustering algorithm to cluster the data into three clusters, 87% of the data are consistently clustered. The average total symptom scores in these three clusters are also very consistent. Based on the 87% consistently clustered data, using the support vector machine algorithm to assess the severity (mild and moderate/severe) of allergic rhinitis, the average accuracy can achieve 99.57%. In particular, the experimental result also shows that the disordered EDSD values at acupuncture points of spleen meridian and liver meridian coincides with the clinic experiences of standard traditional Chinese medicine.

A novel mechanism that flexibly adapts data flows and configures computational units is proposed to establish an application-specific data path in the digital signal processor (DSP) that can efficiently perform multistandard video codecs. Based on this mechanism, the proposed application-specific data path, using the very long instruction word (VLIW) architecture with eight computational units of five arithmetic logic units (ALUs), one multiplier and two load/store units, is designed to perform five adaptive operations according to the characteristics of the low-level functions of MPEG-2, MPEG-4 and H.264/AVC video codecs. Using these adaptive operations, the proposed application-specific data path reduces the number of clock cycles required by the TI TMS320C64x data path to perform the low-level functions of the MPEG-2 video encoder and the H.264/AVC video decoder by 23.10% and 28.43%, respectively, for 30 352times288-pixel Foreman frames. Additionally, considering the operating frequency, the proposed application-specific data path reduces the computation time required by the TI TMS320C64x data path to realize the abovementioned encoder and decoder by 19.86% and 25.41%, respectively. Based on the TSMC 0.18-mum CMOS cell library, the proposed application-specific data path is implemented, and exhibits the highest ratio of computational power to hardware cost among all of the data paths associated with the conventional DSPs in implementing the low-level functions of video codecs

Syntax-directed editors can perform syntax analysis during program editing. This capability allows programmers to correct syntax errors in a much more efficient way. Because of this, syntax-directed editors have become an integral component in current integrated development environments. This paper describes a tool that is designed to facilitate the construction of syntax-directed editors. This tool consists of two components: a generator for incremental parsers and a simple application program interface that facilitates the integration of incremental parsers and editors. The application program interface is based on a simple editing model that can be applied in most editors.

The paper reports the design of a runtime library for data-parallel programming on clusters of symmetric multiprocessors (SMP clusters). Our design algorithms exploit a hybrid methodology which maps directly to the underlying hierarchical memory system in SMP clusters, by combining two styles of programming methodologies-threads (shared memory programming) within a SMP node and message passing between SMP nodes. This hybrid approach has been used in the implementation of a library for collective communications. The prototype library is implemented based on standard interfaces for threads (pthread) and message passing (MPI). Experimental results on a cluster of Sun UltraSparc-II workstations are reported.

Cost analysis of programs has been studied in the context of imperative and functional programming languages. For logic programs, the problem is complicated by the fact that programs may be nondeterministic and produce multiple solutions. A related problem is that because failure of execution is not an abnormal situation, it is possible to write programs where implicit failures have to be dealt with explicitly in order to get meaningful results. This paper addresses these problems and develops a method for (semi-)automatic analysis of the worst-case cost of a large class of logic programs. The primary contribution of this paper is the development of techniques to deal with nondeterminism and the generation of multiple solutions via backtracking. Applications include program transformation and synthesis, software engineering, and in parallelizing compilers. Categories and Subject Descriptors: D.1 [Software]: Programming Techniques; D.1.6 [Program- ming Techniques]: Logic Progra...

While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the work involved in task creation and scheduling. In practice, therefore, the “granularity” of a goal, i.e. an estimate of the work available under it, should be taken into account when deciding whether or not to execute a goal concurrently as a separate task. This paper describes a method for estimating the granularity of a goal at compile time. The runtime overhead associated with our approach is usually quite small, and the performance improvements resulting from the incorporation of grainsize control can be quite good. This is shown by means of experimental results.