ppxscal/embedding_network huggingface dataset:
Mappings and metaphors in auditory displays: An experimental assessment
Authors: Bruce N. Walker, Gregory Kramer
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Auditory displays are becoming more and more common, but there are still no general guidelines for mapping data dimensions (e.g., temperature) onto display dimensions (e.g., pitch). This paper presents experimental research on different mappings and metaphors, in a generic process-control task environment, with reaction time and accuracy as dependent measures. It is hoped that this area of investigation will lead to the development of mapping guidelines applicable to auditory displays in a wide range of task domains.
Scheduling Distributed Real-Time Systems by Satisfiability Checking
Authors: Alexander Metzner, Martin Franzle, Christian Herde, Ingo Stierand
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

We present a SAT-based approach to the task and message allocation problem of distributed real-time systems. In contrast to the heuristic approaches usually applied to this problem, our approach is guaranteed to find an optimal allocation for realistic task systems running on complex target architectures. Our method is based on the transformation of such scheduling problems into nonlinear integer optimization problems. The core of the numerical optimization procedure we use to discharge those problems is a solver for arbitrary Boolean combinations of integer constraints. Optimal solutions are obtained by imposing a binary search scheme on top of that solver. Experiments show the applicability of our approach to industrial-size task systems.
Genetic programming as a method to develop powerful predictive models for clinical diagnosis
Authors: Ivar Siccama, Maarten Keijzer
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In the field of medicine it is of vital importance to accurately predict the presence of a disease (diagnostic prediction) or the future occurrence of a certain event (prognostic prediction). Genetic programming provides a method to develop such prediction models in an optimal way. In this paper we discuss as an example the diagnostic prediction of pulmonary embolism (PE), and compare the method of genetic programming with the logistic regression technique, which is well-known in the medical field.
Physical Design for 3D System on Package
Authors: Sung Kyu Lim
Venue: IEEE Design Test (2005)

Systems on package constitute a specific class of 3D designs wherein multiple manufactured die are stacked atop one another in a package that embeds both active and passive components. This article considers the problem of physical design for such an environment.
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
Authors: Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith, Keith Wansbrough
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de facto one of the common implementations, including, for example, the 15,000--20,000 lines of C in the BSD implementation. Dealing rigorously with the behaviour of such bodies of code is challenging.We have recently developed a post-hoc specification of TCP, UDP, and Sockets that is rigorous, detailed, readable, has broad coverage, and is remarkably accurate. In this paper we describe the novel techniques that were required.Working within a general-purpose proof assistant (HOL), we developed language idioms (within higher-order logic) in which to write the specification: operational semantics with nondeterminism, time, system calls, monadic relational programming, etc. We followed an experimental semantics approach, validating the specification against several thousand traces captured from three implementations (FreeBSD, Linux, and WinXP). Many differences between these were identified, and a number of bugs. Validation was done using a special-purpose symbolic model checker programmed above HOL.We suggest that similar logic engineering techniques could be applied to future critical software infrastructure at design time, leading to cleaner designs and (via specification-based testing using a similar checker) more predictable implementations.
Evaluation of 3D Face Recognition in the presence of facial expressions: an Annotated Deformable Model approach
Authors: G. Passalis, I. A. Kakadiaris, T. Theoharis, G. Toderici, N. Murtuza
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

From a user¿s perspective, face recognition is one of the most desirable biometrics, due to its non-intrusive nature; however, variables such as face expression tend to severely affect recognition rates. We have applied to this problem our previous work on elastically adaptive deformable models to obtain parametric representations of the geometry of selected localized face areas using an annotated face model. We then use wavelet analysis to extract a compact biometric signature, thus allowing us to perform rapid comparisons on either a global or a per area basis. To evaluate the performance of our algorithm, we have conducted experiments using data from the Face Recognition Grand Challenge data corpus, the largest and most established data corpus for face recognition currently available. Our results indicate that our algorithm exhibits high levels of accuracy and robustness, and is not gender biased. In addition, it is minimally affected by facial expressions.
A CMOS Quality Factor Enhanced Parallel Resonant LC-Tank with Independent Q and Frequency Tuning for RF Integrated Filters
Authors: Joshua K. Nakaska, James W. Haslett
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

A new quality factor enhanced resonator core is presented and used to design a bandpass filter at 2.4GHz. The new Q-enhanced LC-tank has independent Q tuning capability, which substantially simplifies the automatic Q-tuning problem. In simulation, the unloaded Q-enhanced core consumes 7.05mA from a 1.8V supply in 0.18um CMOS and can be tuned from 2.1GHz to 3.5GHz using varactors. A brief discussion of the proposed automatic Q-tuning system is presented. The synthesized 2.45GHz filter has a bandwidth of 148MHz, 0dB insertion loss over a 10% tuning range, and a 1st order compression point of -0.5dBm at 2.35GHz.
Transient Phenomena in Learning and Evolution: Genetic Assimilation and Genetic Redistribution
Authors: Janet Wiles, James Watson, Bradley Tonkes, Terrence Deacon
Venue: Artificial Life (2005)

Deacon has recently proposed that complexes of genes can be integrated into functional groups as a result of environmental changes that mask and unmask selection pressures. For example, many animals endogenously synthesize ascorbic acid (vitamin C), but anthropoid primates have only a nonfunctional version of the crucial gene for this pathway. It is hypothesized that the loss of functionality occurred in the evolutionary past when a diet rich in vitamin C masked the effect of the gene, and its loss effectively trapped the animals in a fruit-eating lifestyle. As a result, the complex of abilities that support this lifestyle were evolutionarily bound together, forming a multilocus complex. In this study we use evolutionary computation simulations to explore the thesis that masking and unmasking can transfer dependence from one set of genes to many sets, and thereby integrate the whole complex of genes. We used a framework based on Hinton and Nowlan's 1987 simulation of the Baldwin effect. Additional gene complexes and an environmental parameter were added to their basic model, and the fitness function extended. The simulation clearly demonstrates that the genetic redistribution effect can occur in silico, showing an initial advantage of endogenously synthesized vitamin C, followed by transfer of the fitness contribution to the complex of genes that together allow the acquisition of vitamin C from the environment. As is well known in the modeling community, the Baldwin effect only occurs in simulations when the population of agents is ''poised on the brink'' of discovering the genetically specified solution. Similarly, the redistribution effect occurs in simulations under specific initial conditions: too little vitamin C in the environment, and its synthesis it is never fully masked; too much vitamin C, and the abilities required to acquire it are not tightly integrated. The Baldwin effect has been hypothesized as a potential mechanism for developing language-specific adaptations like innate universal grammar and other highly modular capacities. We conclude with a discussion of the relevance of genetic assimilation and genetic redistribution to the evolution of language and other cognitive adaptations.
The CAN microcluster: Parallel processing over the controller area network
Authors: Paul A. Kuban, Rammohan K. Ragade
Venue: Journal on Educational Resources in Computing (JERIC) (2005)

Most electrical engineering and computer science undergraduate programs include at least one course on microcontrollers and assembly language programming. Some departments offer legacy courses in C programming, but few include C programming from an embedded systems perspective, where it is still regularly used. Distributed computing and parallel processing are subjects generally reserved for graduate programs or specialized degrees. And although it is common to provide undergraduate courses on computer networks, the typical curriculum focuses on TCP/IP and Ethernet LANs, rarely venturing into the lesser known but commonly used networks such as the controller area network. By developing a computer cluster using simple microcontroller cards which communicate over a CAN, students are exposed to the intricacies of network communication, basic parallel and distributed processing concepts, and real-time embedded systems development. This paper presents the design of a <i<CAN Microcluster</i<, constructed using low-cost hardware components commonly available in ECE and CECS microcontroller laboratories. The software implementation is evaluated for both assembly language and C, and development issues are discussed.
The Sensitivity Study on Investment Expenditures and ICF of the Listed Company in China IT Industry
Authors: Li Yanxi, Yao Hong, Zhang Qiuying
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

In the recent years, IT industry develops rapidly in China and has become an important force to push the domestic economy. For China IT companies, their investment scale is limited by the financing constraint, and the ICF (ICF) holds a great influence to their investment expenditures. The paper takes ICF as the indicator to evaluate the internal financing ability of the company, and in terms of the various kinds of financing constraints that the listed company in China IT industry faces conducts a sensitivity study on the investment expenditure and ICF. The conclusion of the study shows that the greater financing constraint the listed company in China IT industry faces, the greater influence ICF holds on its investment expenditures.
On the Performance of Reliable Server Pooling Systems
Authors: Thomas Dreibholz, Erwin P. Rathgeb
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Reliable Server Pooling (RSerPool) is a protocol framework for server redundancy and session failover, currently under standardization by the IETF RSerPool WG. While the basic ideas of RSerPool are not new, their combination into one architecture is. Some research into the performance of RSerPool for certain specific applications has been made, but a detailed, application-independent sensitivity analysis of the system parameters is still missing. The goal of this paper, after an application-independent, generic quantification of RSerPool systems and definition of performance metrics for both service provider and user, is to systematically investigate RSerPool's behavior on changes of workload and system parameters to give basic guidelines on designing efficient RSerPool systems.
Determining Inspection Cost-Effectiveness by Combining Project Data and Expert Opinion
Authors: Bernd Freimut Lionel C. Briand
Venue: IEEE Transactions on Software Engineering (2005)

There is a general agreement among software engineering practitioners that software inspections are an important technique to achieve high software quality at a reasonable cost. However, there are many ways to perform such inspections and many factors that affect their cost-effectiveness. It is therefore important to be able to estimate this cost-effectiveness in order to monitor it, improve it, and convince developers and management that the technology and related investments are worthwhile. This work proposes a rigorous but practical way to do so. In particular, a meaningful model to measure cost-effectiveness is proposed and a method to determine cost-effectiveness by combining project data and expert opinion is described. To demonstrate the feasibility of the proposed approach, the results of a large-scale industrial case study are presented and an initial validation is performed.
Seven key interventions for data warehouse success
Authors: Tim Chenoweth, Karen Corral, Haluk Demirkan
Venue: Communications of the ACM (2006)

The success of data warehouses depends on the interaction of technology and social context. We present new insights into the implementation process and interventions that can lead to success.
Unconstrained Numeral Pair Recognition Using Enhanced Error Correcting Output Coding: A Holistic Approach
Authors: Jie Zhou, Ching Y. Suen
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes a new approach to recognize touching numeral strings. Currently most methods for numeral string recognition require segmenting the string image into separate numerals. As a result, the recognition system heavily depends on the reliability of the segmentation module. This study explores the holistic strategy directly on the string images without segmentation. It builds the novel classifier by combining binary classi- fiers based on Data-driven Error Correcting Output Coding (DECOC). The dimensions of input images are reduced using principal components analysis. Support vector machines are used as base learners. Experiments on NIST SD19 touching numeral pairs confirm that DECOC can achieve favorable performance compared with other multi-class holistic classifiers. The method provides the flexibility of controlling the computational complexity versus accuracy. We also discuss an implementation suitable for distributing computing by decomposing the ensemble into subtasks.
Performance Evaluation of Fingerprint Verification Systems
Authors: Raffaele Cappelli Dario Maio, Davide Maltoni, James L. Wayman Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

This paper is concerned with the performance evaluation of fingerprint verification systems. After an initial classification of biometric testing initiatives, we explore both the theoretical and practical issues related to performance evaluation by presenting the outcome of the recent Fingerprint Verification Competition (FVC2004). FVC2004 was organized by the authors of this work for the purpose of assessing the state-of-the-art in this challenging pattern recognition application and making available a new common benchmark for an unambiguous comparison of fingerprint-based biometric systems. FVC2004 is an independent, strongly supervised evaluation performed at the evaluators' site on evaluators' hardware. This allowed the test to be completely controlled and the computation times of different algorithms to be fairly compared. The experience and feedback received from previous, similar competitions (FVC2000 and FVC2002) allowed us to improve the organization and methodology of FVC2004 and to capture the attention of a significantly higher number of academic and commercial organizations (67 algorithms were submitted for FVC2004). A new, "Light” competition category was included to estimate the loss of matching performance caused by imposing computational constraints. This paper discusses data collection and testing protocols, and includes a detailed analysis of the results. We introduce a simple but effective method for comparing algorithms at the score level, allowing us to isolate difficult cases (images) and to study error correlations and algorithm "fusion.” The huge amount of information obtained, including a structured classification of the submitted algorithms on the basis of their features, makes it possible to better understand how current fingerprint recognition systems work and to delineate useful research directions for the future.
A Step Towards a Multimodal AR Interface: A New Handheld Device for 3D Interaction
Authors: Raphael Grasset, Julian Looser, Mark Billinghurst
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

In this paper, we describe the AR Mask, a novel handheld Augmented Reality (AR) input and display device that not only provides support for a full range of traditional interaction techniques, but also facilitates new metaphors. Unlike other AR display and input technologies, our device consolidates input and output within a single piece of hardware. We demonstrate how this design provides a closed control loop between the user's input modalities and natural sensory receptors.
The Effect of On-Off Scheduling to the Required Transmit Power in Systems with Fast Power Control
Authors: Jyri Hämäläinen, Risto Wichman
Venue: Wireless Personal Communications: An International Journal (2005)

Physical layer channel-aware scheduling may significantly improve coverage and throughput of IP based services in wireless cellular networks, and the feasibility of such schedulers is actively studied within 3G and 4G systems. A channel-aware scheduler requires access to instantaneous channel state information in order to direct transmission to users with favorable channel conditions. In frequency division duplex (FDD) systems, this requires a fast feedback channel between mobile and base stations, and the overhead of the feedback control channel should be kept as low as possible.In this paper, we study the effect of control channel overhead to on-off scheduling (OOS) when fast transmit power control is applied in data and control channels. On-off scheduling is a simple channel-aware scheduling algorithm, where transmission to a user is suspended if the transmit power exceeds a given threshold. On-off scheduling is applied on the data channel while control channel is always on so that the scheduler is able to obtain channel state information from active users. The gain of OOS strongly depends on the power ratio between control and data channels, and increased interference due to control signaling and decreased interference due to channel-aware scheduling should be jointly considered in system design. Gains in the required transmit power are translated into gains in coverage and capacity assuming WCDMA parameters, and the results can be applied, e.g., when designing scheduling algorithms and corresponding signaling formats for WCDMA uplink.
Structural Data Mining on Secondary Genomic Structure
Authors: Winnie W. M. Lam, Keith C. C. Chan
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

There exist many methods for classifying genomic data by aligning, comparing, and analyzing primary nucleotide sequences using such algorithms as decision tree and HMM. These methods are, however, not always effective as motifs are more conserved in structures than in sequences. Instead of performing classification based on primary sequences, we therefore propose to perform the task from structure, exploiting the phenomenon in which molecules form from a sequence of nucleotides, beginning with a primary sequence that can fold back onto itself to form a secondary structure. The algorithm we propose is able to perform data mining in structural data and is called Random Multi-Level Attributed (RMLA) graph algorithm for mining and representing secondary genomic structure from such biomolecule as tRNA. The identification of structural similarity is implemented with information measure concept to characterize the resultant class. Experiments are based on known tRNA structural data. The results show that our approach is able to effectively classify different class of tRNA secondary structure. We also compare our result with other classification algorithms to prove the effectiveness. The result shows our approach can classify structural data in a better way. In fact, RMLA graph is not suitable only for the classification of genomic data, wherever graphs are used to model data, it is useful for discovering patterns in the databases.
Fast and Memory Efficient Mining of Frequent Closed Itemsets
Authors: Claudio Lucchese, Salvatore Orlando, Raffaele Perego
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This paper presents a new scalable algorithm for discovering closed frequent itemsets, a lossless and condensed representation of all the frequent itemsets that can be mined from a transactional database. Our algorithm exploits a divide-and-conquer approach and a bitwise vertical representation of the database and adopts a particular visit and partitioning strategy of the search space based on an original theoretical framework, which formalizes the problem of closed itemsets mining in detail. The algorithm adopts several optimizations aimed to save both space and time in computing itemset closures and their supports. In particular, since one of the main problems in this type of algorithms is the multiple generation of the same closed itemset, we propose a new effective and memory-efficient pruning technique, which, unlike other previous proposals, does not require the whole set of closed patterns mined so far to be kept in the main memory. This technique also permits each visited partition of the search space to be mined independently in any order and, thus, also in parallel. The tests conducted on many publicly available data sets show that our algorithm is scalable and outperforms other state-of-the-art algorithms like Closet+ and FP-Close, in some cases by more than one order of magnitude. More importantly, the performance improvements become more and more significant as the support threshold is decreased.
An improved back propagation algorithm topredict episodes of poor air quality
Authors: G. Nunnari
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

This paper deals with the problem of modelling air pollution time series recorded at a given point by using a multi-layer perceptron based approach. In particular it is shown that the traditional back propagation (BP) algorithm, widely considered in the literature for this kind of application, can be improved to predict episodes of poor air quality. A novel version of the BP algorithm is developed and its performance is compared with that of the traditional algorithm in a case study which refers to the modelling of 1&#x00a0;h average maximum daily ozone concentration recorded in the industrial area of Melilli (Siracusa, Italy). The results obtained so far indicate that the proposed algorithm outperforms the traditional BP algorithm.