ppxscal/embedding_network huggingface dataset:
Error thresholds in genetic algorithms
Authors: Gabriela Ochoa
Venue: Evolutionary Computation (2006)

The error threshold of replication is an important notion in the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an evolutionary process are destroyed more frequently than selection can reproduce them. With mutation rates above this critical value, an error catastrophe occurs and the genomic information is irretrievably lost. Therefore, studying the factors that alter this magnitude has important implications in the study of evolution. Here we use a genetic algorithm, instead of the quasispecies model, as the underlying model of evolution, and explore whether the phenomenon of error thresholds is found on finite populations of bit strings evolving on complex landscapes. Our empirical results verify the occurrence of error thresholds in genetic algorithms. In this way, this notion is brought from molecular evolution to evolutionary computation. We also study the effect of modifying the most prominent evolutionary parameters on the magnitude of this critical value, and found that error thresholds depend mainly on the selection pressure and genotype length.
Data consistency in a large-scale runtime infrastructure
Authors: Buquan Liu, Huaimin Wang, Yiping Yao
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In order to support large-scale distributed simulation, we have developed a RTI called StarLink+ with particular architecture which is compliant with IEEE 1516. StarLink+ is composed of a Central RTI server and multiple Local RTI servers. Each Local RTI server manages multiple federates. Data consistency has great influence on RTI's performance and scale. In StarLink+, only a small portion of data must be globally consistent for all Local RTI servers. However, a great amount of data is not consistent for different Local RTI servers. This paper focuses on the research of data consistency about a variety of data in Star-Link+. On the one hand, we introduce the fully consistent data such as object name designation and handle assignment; on the other hand, we also study the partly consistent data such as publication and subscription, ownership transfer, and time management.
PageRank revisited
Authors: Michael Brinkmeier
Venue: ACM Transactions on Internet Technology (TOIT) (2006)

PageRank, one part of the search engine Google, is one of the most prominent link-based rankings of documents in the World Wide Web. Usually it is described as a Markov chain modeling a specific random surfer. In this article, an alternative representation as a power series is given. Nonetheless, it is possible to interpret the values as probabilities in a random surfer setting, differing from the usual one.Using the new description we restate and extend some results concerning the convergence of the standard iteration used for PageRank. Furthermore we take a closer look at sinks and sources, leading to some suggestions for faster implementations.
Design Guides for a Correct DC Operation in RTD-based Threshold Gates
Authors: Jose M. Quintana, Maria J. Avedillo, Juan Nunez
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

A correct DC operation is essential before analyzing other aspects of the circuit behavior. This paper analyzes how the presence of the HFET transistor modifies the DC operation of follower circuits based on MOBILE, and can prevent its correct operation. On the basis of this analysis, guidelines for the design of threshold gates which are implemented as a generalization of the follower circuit topology are derived.
Generalized Predictive Control for a Pneumatic System Based on an Optimized ARMAX Model with an Artificial Neural Network
Authors: Qiang Song, Fang Liu, Raymond D. Findlay
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Pneumatic systems play an important role in applications of robotics, industrial automation, and manufacturing fields. However, accurate control performance on such systems is very difficult to be achieved due to nonlinearity of the system, dead time and parameter variations in the control process. This paper has developed an effective approach to the precise control on a pneumatic system through the combination of an artificial neural network and generalized predictive control (GPC) algorithm. An ARMAX model of the pneumatic system is derived from the weights of a multilayer feed-forward neural network trained with Levenberg-Marquardt method. Nelder-Mead downhill simplex method was applied in this paper to optimize the built ARMAX model, and the better results were obtained through the generalized predictive control for this pneumatic system. The performance of the designed GPC controller is very impressive for the fast response and high accuracy tracking.
Inductive inference of approximations for recursive concepts
Authors: Steffen Lange, Gunter Grieser, Thomas Zeugmann
Venue: Theoretical Computer Science (2005)

This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios where the learner is successful if its final hypothesis describes a finite variant of the target concept, i.e., learning with anomalies. Learning from positive data only and from both positive and negative data is distinguished.The following learning models are studied: learning in the limit, finite identification, set-driven learning, conservative inference, and behaviorally correct learning.The attention is focused on the case that the number of allowed anomalies is finite but not a priori bounded. However, results for the special case of learning with an a priori bounded number of anomalies are presented, too. Characterizations of the learning models with anomalies in terms of finite tell-tale sets are provided. The observed varieties in the degree of recursiveness of the relevant tell-tale sets are already sufficient to quantify the differences in the corresponding learning models with anomalies. Finally, a complete picture concerning the relations of all models of learning with and without anomalies mentioned above is derived.
Metadata Challenges for Situational Properties of Learning Objects
Authors: Baden Hughes, Roderick A. Farmer
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The abstraction of free-standing metadata describing learning objects is typified by an analytical model which primarily focuses on the encoding of discrete properties pertaining to the learning object itself. This process often neglects the contextual properties derived from the situations in which the learning object can be used optimally. We report the derivation of situated properties for learning objects through the use of the CASE framework and explore how these properties are best encoded.
Compression of LC/MS Proteomic Data
Authors: Agnieszka C. Miguel, John F. Keane, Jeffrey Whiteaker, Heidi Zhang, Amanda Paulovich
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The unrelenting growth ofmass spectrometry (MS) based proteomic data to gigabytes per sample and terabytes per experiment motivates this investigation into compression methods suited to MS signal sources. The data for this study was derived from peptides of hand-mixed protein samples passed through a high performance liquid chromatography system (HPLC) and an electrospray ionization time-of-flight (ESI-TOF) mass spectrometer. Several lossless data compression methods were applied and yielded up to a 25:1 compression ratio relative to the original files containing base64 encoding of the data.
A simple proof of Graham and Pollak's theorem
Authors: Weigen Yan, Yeong-Nan Yeh
Venue: Journal of Combinatorial Theory Series A (2006)

Graham and Pollak [Bell System Tech. J. 50 (1971) 2495-2519] obtained a beautiful formula on the determinant of distance matrices of trees, which is independent of the structure of the trees. In this paper we give a simple proof of Graham and Pollak's result.
Face Recognition Memory and Configural Processing: A Developmental ERP Study using Upright, Inverted, and Contrast-Reversed Faces
Authors: Roxane J. Itier, Margot J. Taylor
Venue: Journal of Cognitive Neuroscience (2004)

The effects of configural changes on faces were investigated in children to determine their role in encoding and recognition processes. Upright, inverted, and contrast-reversed unfamiliar faces were presented in blocks in which one-third of the pictures repeated immediately or after one intervening face. Subjects (8-16 years) responded to repeated faces; event-related potentials were recorded throughout the procedure. Recognition improved steadily with age and all components studied showed age effects reflecting differing maturation processes occurring until adulthood. All children were affected by inversion and contrast-reversal, and face-type effects were seen on latencies and amplitudes of early components (P1 and N170), as well as on later frontal amplitudes. The "old-new" repetition effects (larger amplitude for repeated stimuli) were found at frontal sites and were similar across age groups and face types, suggesting a general working memory system comparably involved in all age groups. These data demonstrate that (1) there is quantitative development in face processing, (2) both face encoding and recognition improve with age, but (3) only encoding is affected by configural changes. The data also suggest a gradual tuning of face processing towards the upright orientation.
A Cost-Space Approach to Distributed Query Optimization in Stream Based Overlays
Authors: Jeffrey Shneidman, Peter Pietzuch, Matt Welsh, Margo Seltzer, Mema Roussopoulos
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimization. The optimization sub-problems of plan generation and service placement should be integrated to meet these challenges. These tasks have typically been treated as independent sub-problems because of the complexity of their integration. We suggest cost spaces as one way to mitigate this complexity. We further consider how cost spaces can be used to allow tractable multi-query optimization.
Measurement-error detection: international evidence on industrial production: Research Articles
Authors: Kosei Fukuda
Venue: Applied Stochastic Models in Business and Industry (2006)

The existence or non-existence of measurement error (ME) in observed time series is examined not by hypothesis testing but by model selection using the values of information criteria of a battery of alternative models with and without ME. Whether the time series contains ME is determined as a result of model selection. This method is compared with recently proposed hypothesis-testing method. Simulation results suggest that the performances of the proposed method are usually comparable to and sometimes better than those of the hypothesis-testing method. The proposed method is applied to monthly time series of industrial production for fifteen developed countries. Obtained results indicate that MEs are detected for at least one and at most seven countries. Copyright &copy; 2006 John Wiley & Sons, Ltd.
CoCoFlash: Conzilla, Confolio, and FlashMeeting Integration for Enhanced Professonal Learning
Authors: Ambjorn Naeve, Matthias Palmer, Mikael Nilsson, Fredrik Paulsson, Kevin Quick, Peter Scott
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper describes the integration of the Conzilla concept browser and the Confolio portfolio management system with the FlashMeeting videoconferencing tool. The result of this integration is expected to produce a combined tool, CoCoFlash, which can support a powerful e-learning mo
Assessing the Value of Computer Science Course Material Repositories
Authors: Susan M. Mitchell, Wayne G. Lutters
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

Finding new course materials is a continual challenge for computer science faculty. Although some free, online collections exist, they are largely under utilized. This study is a work-in-progress that examines the utility of these repositories via a survey of North American faculty. It explores both their current practices for identifying new course materials and probes their perceptions of online repositories. Preliminary results indicate both low visibility and marginal utility. Suggestions for improvement are provided.
Program Chair's Message
Authors: L. K. John
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

The following topics are dealt with: performance analysis of systems and software; benchmarking and workload characterization; simulation; architecture and performance evaluation; memory and caches; Java; and power estimation and reduction.
Energy efficient broadcast in wireless ad hoc networks with hitch-hiking
Authors: Manish Agarwal, Lixin Gao, Joon Ho Cho, Jie Wu
Venue: Mobile Networks and Applications (2005)

In this paper, we propose a novel concept called Hitch-hiking in order to reduce the energy consumption of broadcast application for wireless networks. Hitch-hiking takes advantage of the physical layer design that facilitates the combining of partial signals to obtain the complete information. The concept of combining partial signals using maximal ratio combiner [15] has been used to improve the reliability of the communication link but has never been exploited to reduce energy consumption in broadcasting over wireless ad hoc networks. We study the advantage of Hitch-hiking for the scenario when the transmission power level of nodes is fixed as well as the scenario when the nodes can adjust their power level. For both scenarios, we show that Hitch-hiking is advantageous and have proposed algorithms to construct broadcast tree with Hitch-hiking taken into consideration. For fixed transmission power case, we propose and analyze a centralized heuristic algorithm called SPWMH (Single Power Wireless Multicast with Hitch-hiking) to construct a broadcast tree with minimum forwarding nodes. For the latter case, we propose a centralized heuristic algorithm called Wireless Multicast with Hitch-hiking (WMH) to construct an energy efficient tree using Hitch-hiking and also present a distributed version of the heuristic. We also evaluate the proposed heuristics through simulation. Simulation results show that Hitch-hiking can reduce the transmission cost of broadcast by as much as 50%. Further, we propose and evaluate a protocol called Power Saving with Broadcast Tree (PSBT) that reduces energy consumption of broadcast by eliminating redundancy in receive operation. Finally, we propose an algorithm that takes advantage of both Hitch-hiking and PSBT in conserving energy.
Uncertainty Measure of Covering Generated Rough Set
Authors: Jun Hu, Guoyin Wang, Qinghua Zhang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Uncertainty measure is a key issue of knowledge discovery based on covering approximation space. Information entropy was applied into both classical rough set and extended rough set to measure the uncertainty respectively, but their relationship has not been studied. Based on equal domain relation, a covering approximation space is converted into a partition approximation space in this paper, and uncertainty measures of covering generated rough set are developed. Their properties are analyzed with the generated partition approximation space fined, and these properties are still kept with the original covering approximation spacer fined.
GA-Gammon: A Backgammon Player Program Based on Evolutionary Algorithms
Authors: Oscar Irineo-Fuentes, Nareli Cruz-Cortes, Francisco Rodriguez-Henriquez, Daniel Ortiz-Arroyo, Henrik Legind Larsen
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

In this paper we describe a genetic algorithm approach able to confection strong backgammon automata players. We first prepared an initial vector of weights representing a set of heuristic strategies suggested by expert human players. Then, employing a genetic algorithm approach we were able to fine tune such initial vector of weights by repeatedly testing it against Pubeval, a strong benchmark player program. The vector of weights was therefore used as an evaluation function for performing a genetic heuristic selection of the best board positions during a game. Best GA-Gammon individuals so obtained were tested in separated 5000-game tournaments against Pubeval itself, and Fuzzeval, a fuzzy controllerbased player. Our experimental results indicate that the best individuals generated by GAGammon show similar performance than Pubeval. Furthermore, GA-Gammon consistently outperforms Fuzzeval.
An Unsupervised Fluoroscopic Analysis of Knee Joint Kinematics
Authors: Charles Scott, Elisa H. Barney Smith
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Knowledge of the three dimensional positions of bones at a joint as a function of time is required to accurately model joint kinematics. 3-D bone geometry data from a static computer tomography (CT) images can be combined with time sequence information from 2-D video fluoroscopy images to produce 3-D position data over time. The process involves creating virtual X-rays from the CT image through digitally reconstructed radiograph (DRR) projections. Historically, the process of matching the 3-D and 2-D data has required human interaction. We have eliminated the need for manual initialization using a Monte Carlo technique with a variable search range. The search range decreases as the matching improves, avoiding the inherent problems of local minima in the optimization search. Experiments demonstrate that image positions can be matched to within 1 degree rotation, azimuth and elevation without human intervention.
Structure and dimension of multivariate spline space of lower degree on arbitrary triangulation
Authors: Zhongxuan Luo, Renhong Wang
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, we discuss the structure of multivariate spline spaces on arbitrary triangulation by using the methods and results of smoothing cofactor and generator basis of modules. On the base of analyzing the algebraic and geometric results about singularity of S21 (ΔMS), we build the structure of triangulation and give some useful geometric conditions such that Sµ+1µ (Δ) space is singular, and we obtain an algebraic condition which is necessary and sufficient for the singularity of Sµ+1µ (Δ) spaces as well as their dimension formulae. Moreover, the structure matrix of spline spaces over any given partition is defined, which has been used to discuss the structure of S31 (Δ) and S21 (Δ) spaces over arbitrary triangulation and to prove the nonsingularity of S31 (Δ) spaces. This partially settles a conjecture on the singularity of spline spaces in Wang et al., [Multivariate Spline and its Applications, Kluwer Press, Dordrecht, 2002; Academic Press, Beijing, 1994 (in Chinese)]. Meanwhile, the dimension formulae of S31 (Δ), S21 (Δ) spaces and the dimension formulae of Sµ+1µ (Δ)(µ≥1) spaces are also given in this paper.
AirGrabber: virtual keyboard using miniature infrared camera and tilt sensor
Authors: Masataka Imura, Masahiro Fujimoto, Yoshihiro Yasumuro, Yoshitsugu Manabe, Kunihiro Chihara
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents the "AirGrabber", a virtual keyboard suitable for wearable computers, by which a user can enter characters by "typing" in the air on a virtual keyboard. The AirGrabber detects keystrokes by monitoring the motions of the fingers and hand through a miniature camera and a tilt sensor on the user's wrist.
Wide dynamic range parallel feedback transimpedance amplifier for 10 Gb/s optical links
Authors: Ricardo A. Aroca, C. Andre Salama
Venue: Analog Integrated Circuits and Signal Processing (2006)

This paper presents the design and implementation of a new wide dynamic range parallel feedback (PF) transimpedance amplifier (TIA) for 10 Gb/s optical links. The wide dynamic range is attributed to the novel TIA architecture employing both shunt-shunt and shunt-series feedback networks. The outstanding features of the TIA are wide dynamic range, high gain, low power consumption and design simplicity. A prototype implemented in a 0.5 ¿m SiGe BiCMOS technology and operating at ¿3.3 V power supply features an 18.4 dBm dynamic range with a BER less than 10¿12, an optical sensitivity of ¿16 dBm, optical overload of +2.4 dBm, a bandwidth of 8.27 GHz, a gain of 950 ¿ and a power consumption of 189 mW. The new parallel feedback architecture offers improved overload and noise performance when compared to previously reported, state of the art, single feedback TIA designs and meets all the 10 Gigabit Ethernet and short-reach OC-192 SONET specifications.
A Study on Sketch Input Technique by Surface of 3D Object for Collaboration.
Authors: Eun- Joo Sin, Yoon-Chul Choy, Soon-Bum Lim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The sketch technique, which can quickly and easily make expressions, is very useful in effectively adapting 3D virtual space technology to the collaboration. In order for the sketch technique to apply to the 3D virtual space, we need to solve the problem of inputting 2D sketch to a 3D virtual space and the phase difference that can occur during input. This research studies the input method of the 2D sketch to a targeted 3D object by selecting and creating a sketch plane of the section to sketch. We also tried to find the solution to the phase difference that occurs during input through the shifting of the View-point and the View-plane.
Left Auditory Cortex and Amygdala, but Right Insula Dominance for Human Laughing and Crying
Authors: Kerstin Sander, Henning Scheich
Venue: Journal of Cognitive Neuroscience (2005)

Evidence suggests that in animals their own species-specific communication sounds are processed predominantly in the left hemisphere. In contrast, processing linguistic aspects of human speech involves the left hemisphere, whereas processing some prosodic aspects of speech as well as other not yet well-defined attributes of human voices predominantly involves the right hemisphere. This leaves open the question of hemispheric processing of universal (species-specific) human vocalizations that are more directly comparable to animal vocalizations. The present functional magnetic resonance imaging study addresses this question. Twenty subjects listened to human laughing and crying presented either in an original or time-reversed version while performing a pitch-shift detection task to control attention. Time-reversed presentation of these sounds is a suitable auditory control because it does not change the overall spectral content. The auditory cortex, amygdala, and insula in the left hemisphere were more strongly activated by original than by time-reversed laughing and crying. Thus, similar to speech, these nonspeech vocalizations involve predominantly left-hemisphere auditory processing. Functional data suggest that this lateralization effect is more likely based on acoustical similarities between speech and laughing or crying than on similarities with respect to communicative functions. Both the original and time-reversed laughing and crying activated more strongly the right insula, which may be compatible with its assumed function in emotional self-awareness.