ppxscal/embedding_network huggingface dataset:
Minimal Counterexamples in O(n log n) Memory and O(n^2) Time
Authors: Henri Hansen, Antti Kervinen
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

This article presents a new algorithm for finding a minimal counterexample in explicit state model checking with Büchi automata. The algorithm is an interleaved breadthfirst search that explores some transitions backwards. We prove the correctness of our algorithm, along with complexity results. The worst-case time consumption of a simple version of our algorithm is proportional to the number of states and transitions, times the number of Büchi states. We also derive some simple yet efficient ways of reducing the search using the mathematical properties of minimal counterexamples. The properties are very general, and should be applicable to other approaches as well.
Ultra wideband impulse beamforming: it is a different world
Authors: Sigmar Ries, Thomas Kaiser
Venue: Signal Processing (2006)

Aim of this contribution is to closer investigate the behavior of a delay and sum beamformer for impinging ultra wideband (UWB) signal wavefronts. Because the duration of UWB signals is shorter than the travel time to cross the array, several atypical properties can be observed. For example, the grating lobes disappear, the sidelobe level is constant and the peak gain is squared compared to conventional narrow- or broadband beamforming.
ASASI: An Environment for Addressing Software Application Security Issues
Authors: Mehrez Essafi, Lamia Labed, Henda Ben Ghezala
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Security is an emergent property of a software system. Several efforts are undertaken, to improve software security. However, developers still miss or misuse acquired knowledge. This is mainly due to domain immaturity, newness of the field, process complexity and absence of environments supporting such development. This paper presents our environment denoted ASASI for Addressing Software Application Security Issues. The main feature of the proposed environment is that it is based on a strategy oriented process model that provides a two level guidance. The first level guidance is strategic helping developers choosing one among compilations of the existing methods, standards and best practices. The second level guidance is tactical helping developers achieving their selection for producing secure software. The supported process model is easily extensible and allows building customized processes adapted to context, developer's finalities and product state. This flexibility allows the environment evolving through time to support new security requirements. Keywords-environment;
Perseus: An Educational Support Tool for Systematic Software Design and Algorithm Construction
Authors: Tetsuro Kakeshita, Tomomi Fujisaki
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

Software design is an essential component in software engineering education. We propose an educational support tool Perseus in order to facilitate systematic software design. Perseus supports students in module and routine level design, data structure design, and algorithm design. Various design components are modeled by tree structures and Perseus provides editing and checking facilities for the tree structures. When a student completes to build the software design, Perseus generates a skeleton program composed of structured comments corresponding to the design. Thus the student can develop a program following a coding standard. The usefulness of Perseus increases according to the level of the exercises.
On the Blind SNR Estimation for IF Signals
Authors: Dan Sui, Lindong Ge
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

Signal-to-Noise Ratio (SNR) is a widely used significant parameter in communication systems. An eigenvector decomposition and subspace approach is employed for the blind SNR estimation for Intermediate Frequency (IF) signals in additive white Gaussian noise (AWGN) channel. The signal subspace dimension is determined by the eigenvector decomposition of the sample correlation matrix of the received signals and the Minimum Description Length (MDL) criteria. Then the estimated SNR can be obtained by the computation of the power of the desired signal and the noise, respectively. The proposed algorithm requires no information on the modulation scheme and the parameters of the received signals. Computer simulations are performed for commonly used IF signals, such as MPSK, MFSK and MQAM. The results show that when the true SNR varies from -5dB to 20dB the estimation bias is within 0.6dB and the corresponding standard deviation (STD) is under 0.55.
A Critical Review of Virtual Reality and Geographical Information Systems for Management of the Built Environment
Authors: Richard Franklin, David Heesom, Anthony Felton
Venue: Proceedings of the conference on Information Visualization (2006)

In the field of urban planning, virtual reality systems are currently used as a consultation tool providing the ability to demonstrate the impact of a proposal on the environment. VR simulation models can be driven in real time by the client and adapted by the designer in response to the feedback from architects, planners and also the general public. Within the planning process, GIS systems are often used to analyse geographic data and real time VR has been used as a medium to view the results of data calculations. However, previous initiatives that have integrated VR and GIS to assist in urban planning have focused primarily on the aesthetics of development locations. This paper proposes the development framework of a novel system that allows users to interact with 3D visual data and more traditional GIS data to perform complex 'what if' scenarios in real time. The results of the queries will then be visualised not as text or 2D information, but in real time 3D.
Static analysis of xml transformation and schema languages
Authors: Frank Neven
Venue:  (2006)

XML (eXtensible Markup Language) has currently evolved to the standard data exchange format for the World Wide Web. Its main advantages are that it offers an intuitive and standard way of structuring a very wide range of data and that it admits the use of user-defined tags. The latter allows user communities to develop their own format of XML documents, which is defined by an XML schema. The presence of such a schema improves the efficiency of many tasks like, for instance, query processing, query optimization, and automatic data integration. The dissertation is divided into two parts. The first part studies the typechecking problem for XML to XML transformations. The typechecking problem asks, given an input schema, an output schema, and a transformation, whether the output of the transformation is always conform to the output schema when its input is in the input schema. We focus on identifying practical and tractable fragments of the latter problem. In particular, we exhibit a large tractable class in which deletion in transformations is allowed, but the number of copies they make of certain parts in the input tree is bounded. The second part studies the expressive power and the complexity of basic decision problems for XML schema languages. We discuss several syntactical and semantical characterizations of the Element Declarations Consistent (EDC) constraint of W3C XML Schema. We argue that cleaner, more expressive, more robust but equally feasible schema languages can be obtained by replacing EDC with the notion of 1-Pass Preorder Typing (1PPT) or Top-Down Typing (TDT). The former notion essentially allows schemas to determine the type of an element of a streaming document when its opening tag is met and the latter allows to determine the type of an element when it is met when reading the DOM tree in a top-down fashion. In terms of expressive power, EDC, 1PPT, and TDT are strictly included from left to right. We further consider problems such as inclusion, equivalence, intersection-non-emptiness, and minimization of such schemas. Surprisingly, the complexity of these decision problems is essentially the same for schemas with the EDC constraint as for its more expressive 1PPT and TDT variants. Finally, we discuss the problem of minimizing schema languages with the expressive power of unranked regular tree languages.
When Occlusions are Outliers
Authors: Siome Goldenstein, Christian Vogler
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In many tracking applications, the deformable object of interest suffers from frequent occlusions. Traditional augmenting methods use templates and measures of similarity to recover from occlusions. In this paper, we break with these methods. Instead, we model bad image correspondences, which are induced by occlusions, as statistical outliers in the context of tracking high-dimensional deformable models. This interpretation allows us to use robust statistical estimators in the deformable model's parameter space to detect and eliminate such outliers. Because fast-moving occlusions can generate an excessively large outlier to inlier ratio in the occluded areas, we combine the robust statistical estimation with an initial rejection of correspondences based on the magnitude of the optical flow, a simple 2D criterion. To improve robustness even further, we have the final outlier rejection test take into account both the statistical distribution of the deformable model's parameters, and that different parameters are affected by different subsets of correspondences. We validate and demonstrate our technique on real sequences of American Sign Language, which exhibit frequent and extensive occlusions caused by fast movement of the subjects' hands.
A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method
Authors: D. Takahashi
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A radix-16 fast Fourier transform (FFT) algorithm suitable for multiply-add instruction is proposed. The proposed radix-16 FFT algorithm requires fewer floating-point instructions than the conventional radix-16 FFT algorithm on processors that have a multiply-add instruction. Moreover, this algorithm has the advantage of fewer loads and stores than either the radix-2, 4 and 8 FFT algorithms or the split-radix FFT algorithm. We use Goedecker's method to obtain an algorithm for computing radix-16 FFT with fewer floating-point instructions than the conventional radix-16 FFT algorithm. The number of floating-point instructions for the proposed radix-16 FFT algorithm is compared with those of conventional power-of-two FFT algorithms on processors with multiply-add instruction.
Biologically-Inspired Concepts for Self-Management of Complexity
Authors: Roy Sterritt, Michael G. Hinchey
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

Inherent complexity in large-scale applications may be impossible to eliminate or even ameliorate despite a number of promising advances. In such cases, the complexity must be tolerated and managed. Such management may be beyond the abilities of humans, or require such overhead as to make management by humans unrealistic. A number of initiatives inspired by concepts in biology have arisen for selfmanagement of complex systems. We present some ideas and techniques we have been experimenting with, inspired by lesser-known concepts in biology that show promise in protecting complex systems and represent a step towards self-management of complexity.
Building Reactive and Emotionally Responsive Virtual Children for Edutainment and Interactive Art
Authors: Barnabas Takacs
Venue: Proceedings of the conference on Information Visualization (2006)

This paper presents the design, architecture and implementation of an interactive virtual child animated in real-time using low-cost and portable computers. The system was created for edutainment, i.e. using entertainment and multi-modal interactivity to help learning in a virtual reality environment. We advance the state-of-the-art by using a novel model for emotional modulation implemented in the form of closed-loop dialogues. Using the above techniques we demonstrate the capabilities of our solution by means of real-world examples of four separate applications fields, namely rehabilitation, education, interactive art and mobile telephony in popular culture.
Abstraction and Interaction: an Art System for White Noise
Authors: Ernest Edmonds
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This describes the development of an interactive audio/visual art system and discusses both the context of the work, in abstraction and noise, and the employment of audience testing as an integral part of the process.
wikiTable: finger driven interaction for collaborative knowledge-building workspaces
Authors: Stefano Baraldi, Alberto Del Bimbo, Lea Landucci, Alessandro Valli
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present an interactive workspace featuring visionbased gesture recognition that allows multiple users to collaborate in the creation of a concept map. The workspace integrates web-based and face-to-face scenarios in knowledge-building activities like brainstorming or problem solving sessions. A wiki serves as the repository for knowledge elements, which are presented to co-located users in form of a concept map visualized on a table. The computer vision module tracks multiple hands and fingers on the table surface using fingertip detection and tracking algorithm. The concept map and the wiki are synchronized in real-time, providing notifications to both co-located and distributed users and allowing a community shared awareness that enhances and enriches the knowledge building experience.
How Bayesians Debug
Authors: Chao Liu, Zeng Lian, Jiawei Han
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Manual debugging is expensive. And the high cost has motivated extensive research on automated fault lo- calization in both software engineering and data mining communities. Fault localization aims at automatically locating likely fault locations, and hence assists manual debugging. A number of fault localization algorithms have been developed in recent years, which prove effec- tive when multiple failing and passing cases are avail- able. However, we notice what is more commonly en- countered in practice is the two-sample debugging prob- lem, where only one failing and one passing cases are available. This problem has been either overlooked or insufficiently tackled in previous studies. In this paper, we develop a new fault localization al- gorithm, named BayesDebug, which simulates some manual debugging principles through a Bayesian ap- proach. Different from existing approaches that base fault analysis on multiple passing and failing cases, BayesDebug only requires one passing and one failing cases. We reason about why BayesDebug fits the two- sample debugging problem and why other approaches do not. Finally, an experiment with a real-world program grep-2.2 is conducted, which exemplifies the effective- ness of BayesDebug.
Metabolic network visualization using constraint planar graph drawing algorithm
Authors: Romain Bourqui, David Auber, Vincent Lacroix, Fabien Jourdan
Venue: Proceedings of the conference on Information Visualization (2006)

A metabolic network is a set of interconnected metabolic pathways (subnetworks). Until recently, metabolic studies were dedicated to a single pathway, but current researches now consider the entire network. As matter stands, existing visualization tools cannot be used to undertake these global studies since they have been designed to probe metabolic pathways. For the purpose of making it feasible, this paper presents a graph drawing algorithm for the whole metabolic network. Our collaboration with biologists led us to introduce drawing constraints which take into account the decomposition of the network into metabolic pathways as well as biochemical textbook drawing conventions. These constraints raise numerous graph drawing problems which are solved by first recursively decomposing the network then applying suitable graph drawing algorithms. Finally, we present an application that illustrates the advantage of this representation when visualizing groups of reactions which span several metabolic pathways.
A Note on the Expressive Power of Probabilistic Context Free Grammars
Authors: Gabriel Infante-Lopez, Maarten Rijke
Venue: Journal of Logic, Language and Information (2006)

We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering out unwanted parses. Probabilities in PCFGs induce an ordering relation among the set of trees that yield a given input sentence. PCFG parsers return the trees bearing the maximum probability for a given sentence, discarding all other possible trees. This mechanism is naturally viewed as a way of defining a new class of tree languages. We formalize the tree language thus defined, study its expressive power, and show that the latter is beyond context freeness. While the increased expressive power offered by PCFGs helps to reduce ambiguity, we show that, in general, it cannot be decided whether a PCFG removes all ambiguities.
Applying Agent Technology to Healthcare: The GruSMA Experience
Authors: Antonio Moreno, Aida Valls, David Isern, David Sanchez
Venue: IEEE Intelligent Systems (2006)

The Multiagent Systems Group is part of the Research Group on Artificial Intelligence at Spain's University Rovira i Virgili. Over the past five years, GruSMA has designed and developed many agent applications to address healthcare problems, including that highlight the close fit between intelligent agent properties and healthcare problems--matching agent reactivity, flexibility, proactivity, mobility, autonomy, coordination, and communication with healthcare's autonomous entities coordinating activity in a distributed environment to solve complex problems.
Evaluating the practical use of different measurement scales in requirements prioritisation
Authors: Lena Karlsson, Martin Höst, Björn Regnell
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

The importance of prioritising requirements is widely recognised. A number of different techniques for prioritising requirements have been proposed, some based on an ordinal scale, others on a ratio scale. Some measurement scales provide more information than others, i.e. the ratio scale is richer than the ordinal scale. This paper aims to investigate the differences between the scales used in prioritisation. This is important since techniques using a richer scale tend to be more time-consuming and complex to use. Thus, there is a trade-off between simple techniques only providing ranks and complex techniques providing information about the relative distance between requirements priorities. The paper suggests an approach to measure the skewness of the ratio distribution and a way to use the cost-value approach on ordinal scale data. Four different empirical data sets were used to verify the suggested approaches. The skewness measure seems feasible to determine in which cases the ratio scale is valuable. It indicates that some of our subjects tend to use the extreme values of the scale while others are more modest. The cost-value approach based on ordinal scale data also seems feasible. The requirements selection decisions based on ordinal scale data agree substantially with the decisions based on ratio scale data.
Controlling Performance of a Time-Criticial Thread in SMT Processors by Instruction Fetch Policy
Authors: Caixia Sun, Hongwei Tang, Minxuan Zhang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In Simultaneous Multithreading (SMT) processors, the instruction fetch policy affects the speed at which each thread runs and overall throughput. However, current fetch policies almost focus on overall throughput optimization, and provide no control over how fast individual threads run. As a result, the performance of a thread varies with fetch policy and the workload it is executed. This performance unpredictability means that the execution time of a thread is unpredictable. So only depending on the Operating System (OS) thread scheduler to guarantee the execution time constraint of a time critical thread is not enough even fails. The hardware must ensure that the performance of the time critical thread is predictable in any timeslice. In this paper, we propose a novel fetch policy to control performance of a time critical thread in SMT processors. We evaluate our policy using many different workloads, and results show that for more than 94% of all cases measured, our policy can achieve the desired performance. For the failing cases, the average variance is within 1.25%. Furthermore, our policy does not sacrifice overall throughput severely. Compared to fetch policies orienting towards throughput maximization such as ICOUNT, the average degradation of overall throughput is less than 3%. Especially, out policy makes efforts to maximize the throughput of all co-scheduled threads other than the time critical one, and gives 98.25% of the throughput achieved by ICOUNT on average.
Using KCCA for Japanese---English cross-language information retrieval and document classification
Authors: Yaoyong Li, John Shawe-Taylor
Venue: Journal of Intelligent Information Systems (2006)

Kernel Canonical Correlation Analysis (KCCA) is a method of correlating linear relationship between two variables in a kernel defined feature space. A machine learning algorithm based on KCCA is studied for cross-language information retrieval. We apply the algorithm in Japanese---English cross-language information retrieval. The results are quite encouraging and are significantly better than those obtained by other state of the art methods. Computational complexity is an important issue when applying KCCA to large dataset as in information retrieval. We experimentally evaluate several methods to alleviate the problem of applying KCCA to large datasets. We also investigate cross-language document classification using KCCA as well as other methods. Our results show that it is feasible to use a classifier learned in one language to classify the documents in other languages.
An Indoor and Outdoor, Multimodal, Multispectral and Multi-Illuminant Database for Face Recognition
Authors: H. Chang, H. Harishwaran, M. Yi, A. Koschan, B. Abidi, M. Abidi
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this effort, we describe a face database obtained by using an involved acquisition system for the collection of multimodal and multispectral image data under various illumination conditions. The database of facial images may aid in exploring new avenues in face recognition, especially when involving multi-band visible and thermal information. The database has applications in experimentation with human identification, authentication, and face modeling. We describe the abilities of the acquisition system wherein the imaging sensors, system considerations and registration are discussed. For each data record in the database, we have twenty five images spanning the visible spectrum, one visible RGB/monochromatic image, one thermal image and the spectral distribution of the illumination of the scene. The complete dataset has so far 2624 face images and the corresponding illumination information for each data record. Moreover, we present a multispectral data fusion approach for illumination adjustment. The database will be made public to the research community for perusal towards illumination invariant face related research.