ppxscal/embedding_network huggingface dataset:
A Voice Recognition System for Speech Impaired People
Authors: José Leonardo Plaza-Aguilar, David Báez-López, Luis Guerrero-Ojeda, Jorge Rodríguez Asomoza
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

On this paper, we will show how MATLAB canbe used to realize Voice Recognition; for people withCerebral Paralysis. The first part of this paper is aboutwhat is the Cerebral Paralysis, and its consequences inthe way of talk of the people with this illness. After this,we will mention the mathematic background needed torealize this project besides of explaining a first stage ofthe system, on this stage we could recognize somephonemes. Next, we will describe the functioning of thesecond stage of the project. On this part, we couldrecognize words. At the end of the paper, we will givesome results and we will discuss them
A visual modality for the augmentation of paper
Authors: David R. McGee, Misha Pavel, Adriana Adami, Guoping Wang, Philip R. Cohen
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

In this paper we describe how we have enhanced our multimodal paper-based system, Rasa, with visual perceptual input. We briefly explain how Rasa improves upon current decision-support tools by augmenting, rather than replacing, the paper-based tools that people in command and control centers have come to rely upon. We note shortcomings in our initial approach, discuss how we have added computer-vision as another input modality in our multimodal fusion system, and characterize the advantages that it has to offer. We conclude by discussing our current limitations and the work we intend to pursue to overcome them in the future.
Random Program Generator for Java JIT Compiler Test System
Authors: Takahide Yoshikawa, Kouya Shimura, Toshihiro Ozawa
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Java has been used widely, from servers to cellularphones. In order to test those Java runtime systems, manytest tools have been provided. However these tools arenot enough for Java JIT compilers. They should be testedby various executable bytecode sequences. Most test toolsdon't cover such kinds of a combination test. Thereforewe developed a random test program generator and aJava JIT compiler test system. This test systemautomatically 1) generates Java class files which arerandom, executable and finite; 2) inserts codes thatoutput execution-process-dependent results; 3) runs theseon the target JIT compiler and other tested Javaruntimes; 4) compares results. In this paper, we describehow to generate random test programs, and how to test aJava JIT compiler, and then we evaluate quality(coverage) of generated random test programs.
Music scale modeling for melody matching
Authors: Yongwei Zhu, Mohan Kankanhalli
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Several time series matching techniques have been proposed for content-based music retrieval. These techniques have shown to be robust and effective for music retrieval by acoustic inputs, such as query-by-humming. However, due to the key transposition issue, all the current methods need to search a large space for the proper key in melody matching. This computation can be prohibitive for a practical music retrieval system with a large database.In this paper, we present a music scale modeling technique for melody matching. The root note of music scale (Major or Minor) of a melody is estimated by fitting the notes to a music scale model. The estimated root note can then be used as the key in melody matching. To the best of our knowledge, this is the first approach that utilizes music scale knowledge for retrieval. In our experiments, 96% of the songs in the database (3000 melodies) can fit into the music scale model. Promising results for query-by-humming retrieval have been obtained by using this novel approach.
The Haplotyping problem: an overview of computational models and solutions
Authors: Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Jing Li
Venue: Journal of Computer Science and Technology (2003)

The investigation of genetic differences among humans has given evidence that mutations in DNA sequences are responsible for some genetic diseases. The most common mutation is the one that involves only a single nucleotide of the DNA sequence, which is called a single nucleotide polymorphism (SNP). As a consequence, computing a complete map of all SNPs occurring in the human populations is one of the primary goals of recent studies in human genomics. The construction of such a map requires to determine the DNA sequences that from all chromosomes. In diploid organisms like humans, each chromosome consists of two sequences called haplotypes. Distinguishing the information contained in both haplotypes when analyzing chromosome sequences poses several new computational issues which collectively form a new emerging topic of Computational Biology known as Haplotyping.This paper is a comprehensive study of some new combinatorial approaches proposed in this research area and it mainly focuses on the formulations and algorithmic solutions of some basic biological problems. Three statistical approaches are briefly discussed at the end of the paper.
Riccati Equations for Stable Well-Posed Linear Systems: The Generic Case
Authors: Ruth F. Curtain
Venue: SIAM Journal on Control and Optimization (2003)

Under the generic assumption that zero is in the resolvent set of the generator, we show that the optimal control problem for a stable well-posed linear system is equivalent to a control problem for its reciprocal system which has bounded generating operators. Consequently, the operator X that defines the optimal cost satisfies a Riccati equation with bounded operators. Previous results needed various regularity assumptions to obtain X as a solution to a Riccati equation resembling that in the finite-dimensional theory.
On the synchronization mechanism of the ADA language
Authors: Abraham Silberschatz
Venue: ACM SIGPLAN Notices (1981)

The synchronization mechanism of the Ada Language is intended to provide a facility for tasks to synchronize their actions. Accept and select statements are the two main features of the language that deal with the issue of synchronization This paper points out one major problem that arises in connection with these features and proposes a possible solution to it.
Expanding contexts for computer music: one composer's experience
Authors: Warren Burt
Venue: Organised Sound (2001)

Using his own experience of forty-three professional engagements over a period of a year, most of which involved performances on a laptop computer, the author examines the nature of the &lsquo;musical scenes&rsquo; into which involvement with computer music has led him. The author contends that the social nature of &lsquo;computer music&rsquo; is changing not only because of changes in the technology, but also because of a number of social factors, some of which are examined in this article.
Systems architecture for pervasive retail
Authors: George Roussos, Panos Kourouthanasis, Diomidis Spinellis, Eugene Gryazin, Mike Pryzbliski, George Kalpogiannis, George Giaglis
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Recent developments in mobile technologies and associated economics of scale via mature manufacturing processes have made possible the construction of pervasive systems in specific application areas. In this paper we discuss a novel type of retail service based on wireless and mobile technologies for the automated replenishment of home product supplies. The primary motivation for this work is the optimization of the efficiency and effectiveness of the fast moving consumer goods Box 407, FIN-00045, Helsinki, Finland
Addressing the Problems of Bayesian Network Classification of Video Using High-Dimensional Features
Authors: Ankush Mittal, Loong-Fah Cheong
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Bayesian theory is of great interest in pattern classification. In this paper, we present an approach to aid in the effective application of Bayesian networks in tasks like video classification, where descriptors originate from varied sources and are large in number. In order to extend the application of conventional Bayesian theory to the case of continuous and nonparametric descriptor space, dimension partitioning into attributes by minimizing the discrete Bayes error is proposed. The partitioning output goes to the dimensionality reduction module. A new algorithm for dimensionality reduction for improving the classification accuracy is proposed based on the class pair discriminative capacity of the dimensions. It is also shown how attributes can be weighed automatically in a single-label assignment based on comparing the class pairs. A computationally efficient method to assign multiple labels on the samples is also presented. Comparison with standard classification tools on video data of more than 4,000 segments shows the potential of our approach in pattern classification.
Functional Level Power Analysis: An Efficient Approach for Modeling the Power Consumption of Complex Processors
Authors: Johann Laurent, Nathalie Julien, Eric Senn, Eric Martin
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

A high-level consumption estimation methodology and its associated tool, SoftExplorer, are presented. The estimation methodology uses a functional modeling of the processor combined with a parametric model to allow the designer to estimate the power consumption when the embedded software is executed on the target. SoftExplorer uses as input the assembly code generated by the compiler; its efficiency is compared to SimplePower's approach. Results for different processors (TI C62, C67, C55 and ARM7) and for several DSP applications provide an average error less than 5%.
Incremental, Online, and Merge Mining of Partial Periodic Patterns in Time-Series Databases
Authors: Walid G. Aref, Mohamed G. Elfeky, Ahmed K. Elmagarmid
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Mining of periodic patterns in time-series databases is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of time-series data. Incremental mining refers to the issue of maintaining the discovered patterns over time in the presence of more items being added into the database. Because of the mostly append only nature of updating time-series data, incremental mining would be very effective and efficient. Several algorithms for incremental mining of partial periodic patterns in time-series databases are proposed and are analyzed empirically. The new algorithms allow for online adaptation of the thresholds in order to produce interactive mining of partial periodic patterns. The storage overhead of the incremental online mining algorithms is analyzed. Results show that the storage overhead for storing the intermediate data structures pays off as the incremental online mining of partial periodic patterns proves to be significantly more efficient than the nonincremental nononline versions. Moreover, a new problem, termed merge mining, is introduced as a generalization of incremental mining. Merge mining can be defined as merging the discovered patterns of two or more databases that are mined independently of each other. An algorithm for merge mining of partial periodic patterns in time-series databases is proposed and analyzed.
On the security of cryptosystem using automorphism groups
Authors: Seong-Hun Paeng
Venue: Information Processing Letters (2003)

A public key cryptosystem using the discrete logarithm problem (DLP) in inner automorphism groups was proposed by Paeng et al. [Advances in Cryptology-Crypto, 2001, pp. 470-485; Preprint, 2001]. We show that there are subexponential time algorithms to solve the DLP in inner automorphism groups of suggested non-abelian groups.
Towards general and exact distributed invalidation
Authors: M. F. P. O'Boyle, R. W. Ford, E. A. Stohr
Venue: Journal of Parallel and Distributed Computing (2003)

This paper develops and proves an exact distributed invalidation algorithm for programs with general array accesses, arbitrary parallelisation and migratory writes. We present an efficient constructive algorithm that globally combines locally gathered information to insert coherence calls in such a manner to eliminate invalidation traffic without loss of locality and places the minimal number of coherence calls. Experimental results across a range of benchmarks show that it outperforms hardware based sequential and release consistency approaches and decreases application execution time by up to 12%. This is due to eliminating over 99% of the invalidation traffic in all benchmarks. This dramatic reduction in invalidation traffic reduces the total amount of network traffic by up to 28% and the number of network words transmitted by up to 19%.
A self-checking PLA automatic generator tool based on unordered codes encoding
Authors: K. Torki, M. Nicolaidis, A. O. Fernandes
Venue: Proceedings of the conference on European design automation (1991)

Self-checking circuits ensure concurrent error detection by means of hardware redundancy. An important drawback of self-checking circuits is the fact that they involve a significant increasing of the design time. Specific CAD tools are needed in order to cope with this drawback. In this paper we present a tool allowing automatic generation of self-checking PLAs. Then we validate this tool by transforming a set of PLA benchmarks into self-checking PLAs and we give statistics concerning the required area overhead.
Towards an Ontology for Software Metrics and Indicators as the Foundation for a Cataloging Web System
Authors: M. de los Angeles Martín, Luis Olsina
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

So that the software and web measurement field can become a more robust engineering discipline, it is mandatory to start reaching a common agreement between researchers and other stakeholders about primitive concepts such as attribute, metric, measure, measurement and calculation method, scale, elementary and global indicator, calculable concept, among others. There are various useful recently-issued ISO standards related to software quality models, measurement and evaluation processes, however, we observe sometimes a lack of a sound consensus among the same terms in different documents or sometimes absent terms. In this work we present an ontology for software metrics and indicators -based as much as possible on the concepts of those standards, which can be useful to support different assurance processes, methods and tools in addition to being the foundation for our cataloging web system [12]. Without sound and consensuated definitions it is difficult to assure metadata consistency and, ultimately, data values are comparable on the same basis.
Hybrid system approach to optimum design of a ship
Authors: Dongkon Lee
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

To obtain optimal design efficiently in the initial design stage of a ship, a hybrid system is developed by integrating the optimization algorithm and knowledge-based system. The hybrid system can manipulate numeric and symbolic data simultaneously. To increase search efficiency in a design space, the optimization algorithm (optimizer) is implemented by coupling a genetic algorithm (GA) and search method. The optimizer determines a candidate region around the optimum point by using the GA, then searches the optimum point by the search method concentrating in this region, thus reducing calculation time and increasing search efficiency. To generate input data for the optimizer, a rule-based system is developed. Some domain knowledge for ship optimization in the initial design stage is retrieved from a database of existing ship and design experts. The obtained knowledge is stored in the knowledge base. The optimizer incorporates a knowledge-based system with heuristic and analytic knowledge, thereby narrowing the feasible space of the design variables. Therefore, search speed and the capability of finding an optimum point will be increased in comparison with conventional approach. The developed system is applied principally to particulars of optimization of ships with multicriteria. Through application ship design, it shows that the hybrid system can be a useful tool for optimum design.
Influencing generative design through continuous evaluation: Associating costs with the coffeemaker shape grammar
Authors: Manish Agarwal, Jonathan Cagan, Katherine G. Constantine
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

A grammatical approach to product design is demonstrated. In particular, shape grammars are shown to be especially useful for products that are differentiated primarily on the basis of form yet driven by function; they allow products to be designed as a sequence of well-defined steps. However, it is not always clear how to choose the sequence of rules that should be applied to generate the final shape. In this paper we demonstrate that at each stage during the process, partial designs of the final product can be used to provide feedback to the designer based on specific design objectives and thus suggest possible rule choices. We take advantage of the shape grammar for the generation of coffeemakers introduced by Agarwal and Cagan, and associate with the grammar rules expressions that model manufacturing costs. With each application of a shape grammar rule, an understanding of the overall cost of manufacturing the product is incrementally improved. Thus, at each stage of the design process the designer has an indication of what the overall cost of the product will be and how the selection of one grammar rule over another influences the final cost. Once the complete product is generated, an appraisal of its manufacturing cost is given to the designer. This evaluation methodology helps the designer understand the implications of decisions made early on in the design process. We have also verified the accuracy of this approach through the costs of some commercially available coffeemakers, generated by this method, which are comparable to the costs for those designs listed in the literature.
Predicting Maintainability with Object-Oriented Metrics - An Empirical Comparison
Authors: Melis Dagpinar, Jens H. Jahnke
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

A large number of metrics have been proposed formeasuring properties of object-oriented software such assize, inheritance, cohesion and coupling. We have beeninvestigating which of these object-oriented metrics canbe used as significant predictors for the maintainability ofsoftware. For this purpose, we have designed andconducted an empirical study based on historical datacollected from the maintenance history of a medium-sizedobject-oriented system. Unlike most related studies,indirect coupling has also been taken into account in ourwork in order to evaluate its impact. Our study uses themaintenance history of two software systems as evidencebase for linking software quality attributes to metricssuggested for object-oriented software. Our resultsindicate that size and import direct coupling metrics aresignificant predictors for measuring maintainability ofclasses while inheritance, cohesion, and indirect/exportcoupling measures are not.
A Pattern Language Model for Framework Development
Authors: Liu Wu-dong, He Ke-qing, Xu Hui, Jing Yi-xing
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Pattern language has long been paid attention for itsintrinsic characters such as its domain-orientation,problem-orientation and solution-orientation. Much ofdomain knowledge has been captured in well establishedpattern language. This paper, based on an investigationand study on patterns and relation between them, proposeda Pattern Relation Model, to formalize the semanticstructure of a pattern language. We also utilize this modelto facilitate the development of a framework, to show aconcrete example of this useful model.
Image retrieval with embedded region relationships
Authors: Sharat Chandran, Naga Kiran
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Image retrieval based on content from digital libraries, multimedia databases, the Internet, and other sources has been an important problem addressed by several researchers. In this regard, one cannot overestimate the use of appropriate features such as color, texture, and shape. It has also become increasingly evident that the decomposition of images into regions is critical for useful results.In this paper we further study region-based image retrieval. We argue that a relationship between regions (such as a tiger amongst yellowish-green grass, or a plane against the blue sky with mountains in the background) is also important. Our local segmentation algorithm is used to detect regions a priori. Further, while searching for a match for an 'object' in the database, we allow for probabilistic 'multiple matches,' which are later pruned based on global consistent information. We provide a simple, fast algorithm implemented as an internet thin client connecting to a web server. Experimental results indicate that our method has high precision, is robust towards translation, rotation, and scale changes, can handle partial occlusion, as well as many popular image transformations (such as shear and blur) much the way humans can.
Interactive Cosimulation with Partial Evaluation
Authors: Patrick Schaumont, Ingrid Verbauwhede
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We present a technique to improve the efficiency of hardware-software cosimulation, using design information known at simulator compile-time. The generic term for such optimization is partial evaluation. Our contribution is that we apply the optimization transparantly to the user, and at multiple abstraction levels in the simulation.We use the technique to create an interactive codesign environment, and evaluate it on several designs including an AES encryption coprocessor and a Viterbi decoder, and for several instruction-set simulators. Compared to SystemC-based cosimulation, we achieve comparable cosimulation performance at only a fraction of the model-build time.
Cesàro means of integrable functions with respect to unbounded Vilenkin systems
Authors: György Gát
Venue: Journal of Approximation Theory (2003)

One of the most celebrated problems in dyadic harmonic analysis is the pointwise convergence of the Fejér (or (C, 1)) means of functions on unbounded Vilenkin groups. In 1999 the author proved that if f ∈ Lp(Gm), where p > 1, then σnf → f almost everywhere. This was the very first "positive" result with respect to the a.e. convergence of the Fejér means of functions on unbounded Vilenkin groups. One of the main difficulties is that the sequence of the L1 norm of the Fejér kernels is not bounded. This is a sharp contrast between the unbounded and the bounded Vilenkin systems. The aim of this paper is to discuss the L1 case. We prove for f ∈ L1(Gm) that the relation σMnf → f holds a.e. (Mn is the nth generalized power).