ppxscal/embedding_network huggingface dataset:
Predicting fault-prone components in a java legacy system
Authors: Erik Arisholm, Lionel C. Briand
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

This paper reports on the construction and validation of faultproneness prediction models in the context of an object-oriented, evolving, legacy system. The goal is to help QA engineers focus their limited verification resources on parts of the system likely to contain faults. A number of measures including code quality, class structure, changes in class structure, and the history of class-level changes and faults are included as candidate predictors of class fault-proneness. A cross-validated classification analysis shows that the obtained model has less than 20% of false positives and false negatives, respectively. However, as shown in this paper, statistics regarding the classification accuracy tend to inflate the potential usefulness of the fault-proneness prediction models. We thus propose a simple and pragmatic methodology for assessing the costeffectiveness of the predictions to focus verification effort. On the basis of the cost-effectiveness analysis we show that change and fault data from previous releases is paramount to developing a practically useful prediction model. When our model is applied to predict faults in a new release, the estimated potential savings in verification effort is about 29%. In contrast, the estimated savings in verification effort drops to 0% when history data is not included.
Multiple target detection for an antenna array using outlier rejection methods
Authors: D. P. Michal, D. R. Fuhrmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

When there are multiple targets in a Gaussian noise background, single target detection methods can cause missed detections. The missed detections result because targets are present in the data used to estimate the covariance. Range bins containing targets differ from target-free range bins and are considered to be outliers. Different outlier rejection methods for multivariate data are developed. These methods include single outlier detection via hypothesis testing and multiple outlier detection using model order methods. Range bins detected as outliers are removed from the covariance estimate and target detection is performed. Simulation results for the various outlier rejection methods are presented.
Adaptive Power Management for the On-Chip Communication Network
Authors: Guang Liang, Axel Jantsch
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

An on-chip communication network is most power efficient when it operates just below the saturation point. For any given traffic load the network can be operated in this region by adjusting frequency and voltage. For a deflective routing network we propose the design of a central controller for dynamic frequency and voltage scaling. Given history information including the load and frequency in the network, the controller adjusts the frequency and voltage such that the network operates just below the saturation point. We provide control mechanisms for continuous and discrete frequency ranges. With a discrete frequency range and taking into account voltage switching delays, we evaluate the control mechanism under stochastic, smoothly varying and very bursty traffic. Experiments demonstrate that adaptive control is very effective in minimizing power consumption at reasonable performance. Compared with a fixed high frequency network, the adaptively controlled network is significantly more power efficient. We compare it to fixed frequency networks, which are either too slow exhibiting unbounded delays, or are dimensioned for the worst case with very high frequency and are very power hungry.
Modeling events as entities in object-oriented conceptual modeling languages
Authors: Antoni Olivé, Ruth Raventós
Venue: Data Knowledge Engineering (2006)

Most current conceptual modeling languages and methods do not model events as entities. We argue that, at least in object-oriented (O-O) languages, modeling events as entities provides substantial benefits. We show that a method for behavioral modeling that deals with event and entity types in a uniform way may yield better behavioral schemas. The proposed method makes extensive use of language constructs such as constraints, derived types, derivation rules, type specializations and operations, which are present in all complete O-O conceptual modeling languages. The method can be adapted to most O-O languages. In this paper we explain its adaptation to the UML.
Detection of doors using a genetic visual fuzzy system for mobile robots
Authors: Rafael Muñoz-Salinas, Eugenio Aguirre, Miguel García-Silvente
Venue: Autonomous Robots (2006)

Doors are common objects in indoor environments and their detection can be used in robotic tasks such as map-building, navigation and positioning. This work presents a new approach to door-detection in indoor environments using computer vision. Doors are found in gray-level images by detecting the borders of their architraves. A variation of the Hough Transform is used in order to extract the segments in the image after applying the Canny edge detector. Features like length, direction, or distance between segments are used by a fuzzy system to analyze whether the relationship between them reveals the existence of doors. The system has been designed to detect rectangular doors typical of many indoor environments by the use of expert knowledge. Besides, a tuning mechanism based on a genetic algorithm is proposed to improve the performance of the system according to the particularities of the environment in which it is going to be employed. A large database of images containing doors of our building, seen from different angles and distances, has been created to test the performance of the system before and after the tuning process. The system has shown the ability to detect rectangular doors under heavy perspective deformations and it is fast enough to be used for real-time applications in a mobile robot.
Proper minor-closed families are small
Authors: Serguei Norine, Paul Seymour, Robin Thomas, Paul Wollan
Venue: Journal of Combinatorial Theory Series B (2006)

We prove that for every proper minor-closed class I of graphs there exists a constant c such that for every integer n the class I includes at most n!cn graphs with vertex-set {1, 2,...,n}. This answers a question of Welsh.
Understanding the cultural foundations of children's biological knowledge: insights from everyday cognition research
Authors: Philip Bell, Leah A. Bricker, Tiffany R. Lee, Suzanne Reeve, Heather Toomey Zimmerman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This session explores the cultural foundations of children's knowledge of the living world. Cognitive research on students' conceptual understandings has overly relied upon sequestered tasks and structured interviews; we argue that participant observation can provide insight into important particulars of everyday life to answer fundamental questions about the nature of children's learning of biology. These papers report on studies of the everyday cultural and social contexts in which children's informal ideas about the living world develop and are applied. The research employs a learner-centered focus and a cognitive ethnographic approach to explore children's knowledge as they utilize it in their homes, at school, and in an interactive science center. Research focuses on personally consequential biology topics including health, nutrition, and ecology. The papers report on the cultural experiences that shape children's biological knowledge and decision-making, similarities and differences between cultural groups, and implications for coordinating home and school experiences.
Action Representation for Natural Language Interfaces to Agent Systems
Authors: Christel Kemke
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In this paper, we outline a framework for the development of natural language interfaces to agent systems, with a focus on action representation. The architecture comprises a natural language parser and case frame based analysis for semantic representation for the linguistic content of the input. The knowledge base, used as core instance of the mapping and interpretation process, features a representation of actions and related objects in a conceptual hierarchy, which is suited to provide a connection to the artificial agent's repertoire of actions. The framework thus features representations of actions, specifically designed to link linguistic inputs of the human user to the action set of an artificial agent. The framework has been employed in the development of various agent systems and their natural language interfaces, including simulated household robots, an interior design system, a travel planner, a cook, and a remote controlled toy car..
Tight Bounds for Critical Sections in Processor Consistent Platforms
Authors: Lisa Higham
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Most weak memory consistency models are incapable of supporting a solution to mutual exclusion using only read and write operations to shared variables. Processor Consistency-Goodman's version (PC-G) is an exception. Ahamad et al. showed that Peterson's mutual exclusion algorithm is correct for PC-G, but Lamport's bakery algorithm is not. This paper derives a lower bound on the number of and type of (single or multiwriter) variables that a mutual exclusion algorithm must use in order to be correct for PC-G. Specifically, any such solution for n processes must use at least one multiwriter variable and n single-writer variables. Peterson's algorithm for two processes uses one multiwriter and two single-writer variables, and therefore establishes that this bound is tight for two processes. This paper presents a new n{\hbox{-}}{\rm{process}} algorithm for mutual exclusion that is correct for PC-G and achieves the bound for any n. While Peterson's algorithm is fair, this extension to arbitrary n is not fair. Six known algorithms that use the same number and type of variables are shown to fail to guarantee mutual exclusion when the memory consistency model is only PC-G, as opposed to the Sequential Consistency model for which they were designed. A corollary of our investigation is that, in contrast to Sequential Consistency, multiwriter variables cannot be implemented from single-writer variables in a PC-G system.
Efficient Performance Models in Component-Based Software Engineering
Authors: Simonetta Balsamo, Moreno Marzolla, Raffaela Mirandola
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Performance evaluation of Component-Based software systems should be performed as early as possible during the software development life cycle. Unfortunately, a detailed quantitative analysis is often not possible during such stages, as only the system outline is available, with very little quantitative knowledge. In this paper we propose an approach based on Queueing Network analysis for performance evaluation of component-based software systems at the software architectural level. Our approach provides performance bounds which can be efficiently computed. Starting from annotated UML diagrams we compute bounds on the system throughput and response time without explicitly deriving or solving the underlying multichain and multiclass Queueing Network model. We illustrate with an example how the technique can be applied to answer many performance-related questions which may arise during the software design phase.
Phase Synchronization Analysis of EEG during Attentional Blink
Authors: Chie Nakatani, Junji Ito, Andrey R. Nikolaev, Pulin Gong, Cees Van Leeuwen
Venue: Journal of Cognitive Neuroscience (2005)

The attentional blink (AB) phenomenon occurs when perceivers must report two targets embedded in a sequence of distracters; if the first target precedes the second by 200&ndash;600 msec, the second one is often missed. We investigated AB by measuring dynamic cross-lag phase synchronization for 565 electrode pairs in 40-Hz&ndash;range EEG. Phase synchrony, on average, was higher in experimental conditions, where two targets are reported, than in control conditions, where only the second target is reported. The effect occurred in electrode pairs covering the whole head. Timing of the synchrony was crucial: Brief episodes of enhanced synchrony occurred 100&ndash;500 msec before expected target onset in AB conditions where the second target was correctly reported. These results show that intrinsic brain dynamics produce anticipatory synchronization in transient assemblies of cortical areas. Enhanced levels of anticipatory synchronization occur in response to the demands of the task in conditions where the system's limited capacity is under strain.
Web image indexing by using associated texts
Authors: Zhiguo Gong, Leong Hou U., Chan Wa Cheang
Venue: Knowledge and Information Systems (2006)

In order to index Web images, the whole associated texts are partitioned into a sequence of text blocks, then the local relevance of a term to the corresponding image is calculated with respect to both its local occurrence in the block and the distance of the block to the image. Thus, the overall relevance of a term is determined as the sum of all its local weight values multiplied by the corresponding distance factors of the text blocks. In the present approach, the associated text of a Web image is firstly partitioned into three parts, including a page-oriented text (TM), a link-oriented text (LT), and a caption-oriented text (BT). Since the big size and semantic divergence, the caption-oriented text is further partitioned into finer blocks based on the tree structure of the tag elements within the BT text. During the processing, all heading nodes are pulled up in order to correlate with their semantic scopes, and a collapse algorithm is also exploited to remove the empty blocks. In our system, the relevant factors of the text blocks are determined by using a greedy Two-Way-Merging algorithm.
3D Model Generation by Morphing
Authors: Kosuke Kaneko, Yoshihiro Okada, Koichi Niijima
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper proposes a 3D model generation system that outputs intermediate3D shape models between two already existing 3D models by morphing. Although there have been a lot of computer animation software, it takes a long time to create a 3D shape model even using such computer animation software. Morphing is one of the techniques used to easily create 3D models. If we have two different 3D shape models, it is possible to generate intermediate 3D shape models between them by morphing. However, there are two main problems in the morphing of polygonal models. Those are vertex mismatch and semantic topology mismatch. In this paper, the authors propose an algorithm that is free from the vertex mismatch problem and that automatically determines the semantic topology match. The proposed system based on the algorithm decomposes both two polygonal models, makes decomposed element pairs between them, and then generates intermediate 3D shape models by morphing as for the decomposed element pairs automatically.
Using Perspective in 3D File Management: Rotating Windows and Billboarded Icons
Authors: John R. Maltby
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

The evaluation and comparison of 2D and 3D workspace environments is a hot topic. Much has been said concerning the promise of 3D workspaces but much less has been realised. Part of the problem appears to be the difficulty of developing 3D GUIs with high usabilities and effective navigation mechanisms. Many early environments simulated a 3D office but all suffered from a range of problems, from poor navigation to issues of spatial cognition. Indeed, most researchers now consider an office to be an inappropriate metaphor for an effective 3D computer environment. This paper describes the development of a 3D workspace based directly on the WIMP metaphor as opposed to a desktop or office metaphor. The environment uses rotating transparent 2D windows in a 3D world and presents icons as billboards.
Bootstrapping simultaneous confidence bands
Authors: Russell C. H. Cheng
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Once a regression has been fitted to data, it is usually necessary to add confidence intervals to indicate the accuracy of the fitted regression line. This can easily be done for individual explanatory variable values. However sometimes confidence limits are needed simultaneously for the whole range of explanatory variable values of interest. In other words the problem is to construct a confidence band within which the entire unknown true regression line lies with given confidence. This article discusses computer intensive methods for doing this. The advantage of such methods compared with classical asymptotic methods is that accurate coverages can be obtained quite easily using bootstrap resampling.
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
Authors: Ivan Vermeulen, Sander Bohte, Koye Somefun, Han La Poutre
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects the decentralization of scheduling authorities and is capable of continuously adjusting the different patient schedules in response to the dynamic environment. We present models of the hospital patient scheduling problem in terms of the "health care cycle" where a doctor repeatedly orders sets of activities (partial plans) to diagnose and/or treat a patient. We introduce the Theil index to the health care domain to characterize different hospital patient scheduling problems in terms of the degree of relative workload inequality between required resources. In experiments that simulate a broad range of stylized hospital patient scheduling problems, we extensively compare the performance of MPAEX to a set of heuristics. The distributed and dynamic MPAEX has performances almost as good as the best centralized and static scheduling heuristics.
Probabilistic Non-linear Principal Component Analysis with Gaussian Process Latent Variable Models
Authors: Neil Lawrence
Venue: The Journal of Machine Learning Research (2005)

Summarising a high dimensional data set with a low dimensional embedding is a standard approach for exploring its structure. In this paper we provide an overview of some existing techniques for discovering such embeddings. We then introduce a novel probabilistic interpretation of principal component analysis (PCA) that we term dual probabilistic PCA (DPPCA). The DPPCA model has the additional advantage that the linear mappings from the embedded space can easily be non-linearised through Gaussian processes. We refer to this model as a Gaussian process latent variable model (GP-LVM). Through analysis of the GP-LVM objective function, we relate the model to popular spectral techniques such as kernel PCA and multidimensional scaling. We then review a practical algorithm for GP-LVMs in the context of large data sets and develop it to also handle discrete valued data and missing attributes. We demonstrate the model on a range of real-world and artificially generated data sets.
A subspace GLRT for vector-sensor array detection
Authors: K. A. Burgess, B. D. Van Veen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Signal detection using the generalized likelihood ratio test is examined for data obtained from an arbitrary array of vector sensors. Vector sensors are sensing devices that simultaneously measure all six time-dependent, electromagnetic field quantities at a point in space. A signal model is developed for a point narrowband source with unknown amplitude. The maximum likelihood estimator for the signal amplitude is derived in the presence of colored multivariate Gaussian noise. The detection test statistic and its probabilities of false alarm and detection are obtained in closed form. A non-adaptive transformation is derived that compresses a high dimensional detection problem into a two-dimensional detection problem with no signal loss.
Managing bounded code caches in dynamic binary optimization systems
Authors: Kim Hazelwood, Michael D. Smith
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2006)

Dynamic binary optimizers store altered copies of original program instructions in software-managed code caches in order to maximize reuse of transformed code. Code caches store code blocks that may vary in size, reference other code blocks, and carry a high replacement overhead. These unique constraints reduce the effectiveness of conventional cache management policies. Our work directly addresses these unique constraints and presents several contributions to the code-cache management problem. First, we show that evicting more than the minimum number of code blocks from the code cache results in less run-time overhead than the existing alternatives. Such granular evictions reduce overall execution time, as the fixed costs of invoking the eviction mechanism are amortized across multiple cache insertions. Second, a study of the ideal lifetimes of dynamically generated code blocks illustrates the benefit of a replacement algorithm based on a generational heuristic. We describe and evaluate a generational approach to code cache management that makes it easy to identify long-lived code blocks and simultaneously avoid any fragmentation because of the eviction of short-lived blocks. Finally, we present results from an implementation of our generational approach in the DynamoRIO framework and illustrate that, as dynamic optimization systems become more prevalent, effective code cache-management policies will be essential for reliable, scalable performance of modern applications.
Asynchronous chess competition
Authors: Nathaniel Gemelli, Robert Wright, James Lawton, Andrew Boes
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Asynchronous Chess (AChess) is a platform for the development and evaluation of real-time adversarial agent technologies. It is a two-player game using the basic rules of chess with the modification that agents may move as many pieces as they want at any time. Modifying chess in this way creates a new robust, asynchronous, real-time game in which agents must carefully balance their time between reasoning and acting in order to out-perform their opponent. As a fast-paced adversarial game, many challenges relevant to real-world applications arise which give it merit for study and use.