ppxscal/embedding_network huggingface dataset:
Recursive self-organizing network models
Authors: Barbara Hammer, Alessio Micheli, Alessandro Sperduti, Marc Strickert
Venue: Neural Networks (2004)

Self-organizing models constitute valuable tools for data visualization, clustering, and data mining. Here, we focus on extensions of basic vector-based models by recursive computation in such a way that sequential and tree-structured data can be processed directly. The aim of this article is to give a unified review of important models recently proposed in literature, to investigate fundamental mathematical properties of these models, and to compare the approaches by experiments. We first review several models proposed in literature from a unifying perspective, thereby making use of an underlying general framework which also includes supervised recurrent and recursive models as special cases. We shortly discuss how the models can be related to different neuron lattices. Then, we investigate theoretical properties of the models in detail: we explicitly formalize how structures are internally stored in different context models and which similarity measures are induced by the recursive mapping onto the structures. We assess the representational capabilities of the models, and we shortly discuss the issues of topology preservation and noise tolerance. The models are compared in an experiment with time series data. Finally, we add an experiment for one context model for tree-structured data to demonstrate the capability to process complex structures.
Computational methods inspired by chemistry: multiscale modeling and mechanisms of control
Authors: Bjorn Engquist
Venue:  (2005)

The control of molecular systems inspired the two themes of this thesis: mechanism analysis and multiscale modeling. The goal of mechanism analysis is to understand and quantify the underlying mechanism of interaction governing laser controlled quantum systems. Despite successful optimal control simulations and experiments, little is known about the underlying mechanism. Mechanism is identified as the set of significant quantum pathways connecting the initial state of a system with a target state. The probability amplitudes of mechanistic pathways are determined by a procedure called Coding Hamiltonians to Access Mechanistic Pathways. Several coding schemes are proposed, and numerical simulations reveal high order multiphoton processes. The mechanisms are robust with respect to reasonable levels of noise. Coding methods are adapted for laboratory use: only the electric field may be modulated and only observable data may be collected. Under ideal conditions, mechanism extraction requires the solution of a system of quadratic equations. Existence, uniqueness, and symmetry in the solutions are addressed. The system is shown to be overdetermined in most reasonable cases. An analytic solution is presented for a simple case, and an algorithm is given for use under the rotating wave approximation. Shortcomings of the ideal setting are discussed, including noisy observable data, limited ability to modulate the electric field, and numerical challenges. A simulation demonstrates mechanism extraction from observable data. The second part of the thesis studies multiscale algorithms produced within the Heterogeneous Multiscale Methods (HMM) framework for application to highly oscillatory ODES. A class of numerical ODE schemes that operate in two time scales is developed. The methods are applied to compute the average path of Kapitza's pendulum. A consistency condition for the initialization of microscopic data given the macroscopic state is derived. A proof and numerical simulations show that the proposed methods approximate the analytically averaged equation, and thus correctly compute the average path of the pendulum. The final chapter extends these ideas to autonomous systems. The consistency condition must be calculated numerically because no explicit forcing exists. Simulations of a mass and spring system compare and evaluate the effectiveness of various HMM style algorithms in this setting.
Load balancing in parallel and distributed databases
Authors: Zhong Tang
Venue:  (2005)

This dissertation addresses the load balancing problem for parallel computations in the presence of time delays from a control system design perspective. The critical feature of the load balancing problem is the delayed receipt of information and transferred load. In this work, load balancing in a parallel computer architecture is first modeled as a deterministic time-delay system with saturations. Three essential properties of the load balancing strategy, including consistency, stability, and conservation of tasks, have been analyzed. Load distribution and task processing contend for the same resources on each computational element (node). A deterministic dynamic nonlinear system is developed to model load balancing for parallel computations and incorporate both time delays and resource constraints. This model accounts for the trade-off between using processor resources to process tasks and the advantage of distributing the load evenly between the nodes to reduce overall processing time. The model is shown to be consistent and the open-loop system is Lyapunov stable, but not asymptotically stable. A distributed closed-loop controller is proposed to balance load dynamically at each node by using not only local estimates of loads at other nodes, but also estimates of the number of tasks in transit to it. Experimental results have demonstrated substantial improvements in performance using a controller based on the anticipated estimates of workloads over using a controller based on the local workloads only. The eventual size and the search requirements for DNA databases necessitate the development of parallel DNA databases. This work presents the design of a parallel DNA database, which is the motivation and an application of the presented load balancing strategies. DNA profiles are assigned in portions to each search engine node of the parallel computer to form distributed databases to be searched in parallel. A multi-threaded search server is designed and implemented to achieve high performance. Experimental results for the parallel DNA database and parallel searches with load balancing integrated with the database demonstrate both the efficiency of the parallel database and the efficacy of the load balancing strategy.
Balanced Scorecard: Evening the Odds of Successful BPR
Authors: Yujong Hwang, Robert A. Leitch
Venue: IT Professional (2005)

Researchers have long addressed how to control, measure, and evaluate business process reengineering (BPR), but many so-called solutions continue to focus almost exclusively on the technical aspects of change. Integrating BPR and a balanced scorecard (BSC) to control, measure, and evaluate BPR can link performance evaluation to strategic objectives. As such, BSC is becoming the foundation for a strategy that will accomplish an organization's objectives.
Toward Robust Speech Recognition and Understanding
Authors: Sadaoki Furui
Venue: Journal of VLSI Signal Processing Systems (2005)

The principal cause of speech recognition errors is a mismatch between trained acoustic/language models and input speech due to the limited amount of training data in comparison with the vast variation of speech. It is crucial to establish methods that are robust against voice variation due to individuality, the physical and psychological condition of the speaker, telephone sets, microphones, network characteristics, additive background noise, speaking styles, and other aspects. This paper overviews robust architecture and modeling techniques for speech recognition and understanding. The topics include acoustic and language modeling for spontaneous speech recognition, unsupervised adaptation of acoustic and language models, robust architecture for spoken dialogue systems, multi-modal speech recognition, and speech summarization. This paper also discusses the most important research problems to be solved in order to achieve ultimate robust speech recognition and understanding systems.
Turing's test and believable AI in games
Authors: Daniel Livingstone
Venue: Computers in Entertainment (CIE) (2006)

The Turing test is perhaps the most famous, most quoted, and probably most often misrepresented and misunderstood measure of machine intelligence. In this article we'll briefly review the Turing test and some of its key criticisms. In particular, we will try to answer whether the Turing test -- or something derived from it -- can be of use in developing and assessing game AI. We will also present a brief overview of a methodology for conducting believability testing for games and highlight some of the problems inherent in any attempt to categorically determine whether or not some AI behavior is capable of convincing, life-like behavior.
Insight and perspectives for content delivery networks
Authors: George Pallis, Athena Vakali
Venue: Communications of the ACM (2006)

Striking a balance between the costs for Web content providers and the quality of service for Web customers.
Disks on a Tree: Analysis of a Combinatorial Game
Authors: Tomás Feder, Carlos Subi
Venue: SIAM Journal on Discrete Mathematics (2005)

Anderson et al. [{\it Amer. Math. Monthly}, 96 (1989), pp. 481--493] studied a combinatorial game on an infinite path that is started with $n$ disks at a vertex and ends with the disks spread between $k=\lfloor n/2 \rfloor$ vertices to the left and to the right of the initial vertex. They showed that the number of steps the game takes to converge to the final configuration is $ck^2+o(k^2)$ for some constant $c$. We generalize this game to the case of an infinite rooted tree, where each vertex has degree $d+1$ and where the earlier game corresponds to the case $d=1$. We determine the final configuration when the game is started with $n$ disks at the root and show that in this final configuration all disks are at depth at most $k=\Theta(\log_d n)$ for $d\geq 2$. We also show that the number of steps that the game takes to converge to the final configuration in this case is at most $O(k(1+ \log_d k))$, so that the convergence is faster than what it was for the case $d=1$. We generalize the game to the case where the vertices at depth $i$ in the tree have $d_i\geq 2$ children, where the $d_i$ are not necessarily the same, and show that the convergence time in this case is at most $O(k^{1.5} + k \log_{d_{\min}} d_{\max})$, where $d_{\min}$ and $d_{\max}$ are the smallest and largest $d_i$, respectively.
Methods for modelling and generating probabilistic components in digital computer simulation when the standard distributions are not adequate: a survey
Authors: Bruce Schmeiser
Venue: ACM SIGSIM Simulation Digest (1978)

Methods of modelling probabilistic components which are not adequately represented by the standard continuous distributions (such as normal, gamma, and Weibull) are surveyed. The methods are categorized as systems of distributions, approximations to the cumulative distribution function, and four-parameter distributions. Emphasis is on generality, determination of appropriate parameter values, and random variate generation.
Dynamic shot suggestion filtering for home video based on user performance
Authors: Brett Adams, Svetha Venkatesh
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper presents novel additions to our existing amateur media creation framework. The framework provides at-capture guidance to enable the home movie maker to realize their aesthetic and narrative goals and automation of post-production editing. A common problem with the amateur filming context is its contingent nature, which often results in the failure to gain footage vital to the user's goals, even with at-capture software embedding. Accordingly, we have modelled minimizing the difference between target and captured footage at a given time during filming as a probability distribution divergence problem. We apply two policies of feedback to the user on thier performance, passive communication via a suggestion desirability measure, and active filtering of undesirable suggestions. We demonstrate the framework using each policy with a simulation of various user and filming situations with promising results.
Combinatorial Auction for Resource Allocation in a Distributed Sensor Network
Authors: John Ostwald, Victor Lesser, Sherief Abdallah
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

This paper discusses a solution to the problems posed by sensor resource allocation in an adaptive, distributed radar array. We have formulated a variant of the classic resource allocation problem, called the setting-based resource allocation problem, which reflects the challenges posed in domains in which sensors have multiple settings, each of which could be useful to multiple tasks. Further, we have implemented a solution to this problem that takes advantage of the locality of resources and tasks that is common to such domains. This solution involves translating tasks and possible resource configurations into bids that can be solved by a modified combinatorial auction, thus allowing us to make use of recent developments in the solution of such auctions. We have also developed an information-theoretic procedure for accomplishing this translation, which models the effect various sensor settings would have on the network's output.
Biclustering Models for Structured Microarray Data
Authors: Heather L. Turner, Trevor C. Bailey, Wojtek J. Krzanowski, Cheryl A. Hemingway
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

Microarrays have become a standard tool for investigating gene function and more complex microarray experiments are increasingly being conducted. For example, an experiment may involve samples from several groups or may investigate changes in gene expression over time for several subjects, leading to large three-way data sets. In response to this increase in data complexity, we propose some extensions to the plaid model, a biclustering method developed for the analysis of gene expression data. This model-based method lends itself to the incorporation of any additional structure such as external grouping or repeated measures. We describe how the extended models may be fitted and illustrate their use on real data.
Capture the Flag: A Multiplayer Online Game for Phone Users
Authors: Adrian David Cheok, Sze Lee Teo, Lei Cao, Le Nam Thang
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper explores the concept of using smart phones to facilitate pervasive mixed reality, locationbased, physical and social gaming. The interaction and communication between the virtual and physical worlds are explored and studied using a mixed reality version of the capture-the-flag game. In this game, players from two different paradigms, virtual and real, compete and collaborate in a social gaming environment using mobile devices and network system.
A case library for teaching usability engineering: Design rationale, development, and classroom experience
Authors: John M. Carroll, Mary Beth Rosson
Venue: Journal on Educational Resources in Computing (JERIC) (2005)

Case studies of professional software development practices describe how real (or realistic) projects are planned and executed. Cases provide engaging models of the activities and materials of software development to students and other novice practitioners. They vividly remind learners of the possibilities for meaningfully applying knowledge and skills in the world beyond the classroom. During the past six years, we have developed and used a collection of usability engineering case studies for teaching human-computer interaction, primarily to upper-level undergraduates in computer science and in information sciences and technology. In this article we describe the rationale for this approach, the structural schema and browser that we developed for case studies, the case-based activities we employ in courses, and the experiences of instructors and students who have used the cases.
Formal support for merging and negotiation
Authors: Shiva Nejati
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Model merging is an important activity in software development. We often need to integrate a set of models coming from different sources so as to create a unified model encompassing all the given models. Inconsistencies between models can make model merging significantly more complex. To deal with inconsistencies efficiently, a systematic negotiation process is needed. This paper outlines a formal approach to merging and negotiation over behavioural models and presents the results achieved so far.
Singular perturbations of complex polynomials and circle inversion maps
Authors: Daniel M. Look
Venue:  (2005)

The dynamics of the family of complex functions Flz=z n+l/zd is explored. For n = d = 2 conditions are given on l ensuring that the Julia set of Fl is a Sierpinski curve. Further, a complete description of the symbolic dynamics of Fl restricted to its Julia set (in the cases where the Julia set is a Sierpinski curve) is given. For n = 2 and d = 1 the existence of a sequence of ln&isin;R- is shown where Fln has a superattracting n-cycle and J( Fln ) is a Sierpinski curve. The dynamics of a function derived from multiple circle inversions is also investigated. A description of the dynamics of this function restricted to its Julia set via symbolic dynamics is given. Finally, a description of the (topological and dynamcal) bifurcations that occur as this system is perturbed is presented.
Packet classification consuming small amount of memory
Authors: Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

In order to provide more value-added services, the Internet needs to classify packets into flows for different treatment. This function becomes a bottleneck in the router. High performance packet classification algorithms are therefore in high demand.This paper describes a new algorithm for packet classification using the concept of independent sets. The algorithm has very small memory requirements. The search speed is not sensitive to the size of the rule table or to the percentage of wildcards in the fields. It also scales well from two-dimensional classifiers to high-dimensional ones. In particular, the algorithm is inherently parallel. Hardware tailored to this algorithm can achieve very fast search speed. The update algorithm proposed is also very fast in general.
Community Cooperation in Recommender Systems
Authors: Alexandre Desmarais-Frantz, Esma Aimeur
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Recommender systems have been widely used in commercial and research oriented systems. In this paper, we propose to develop an intelligent, Internetbased movie recommender system, to help moviegoers choose movies. Our system, COOP-R uses a hybrid recommendation technique based on collaborative and content based filtering. As opposed to previous work using the neighbourhood paradigm, our collaborative filtering approach uses the community of chosen friends, thus allowing better control of the overall recommendation, and takes advantage of the influential and popular friends that have some authority in the movie community. We believe that our system allows more social interaction among moviegoers. We discuss the design and implementation of COOP-R, report on its performance evaluation, and present a comparative study to traditional collaborative filtering systems. Our results indicate that COOP-R exhibits a better precision when compared to traditional collaborative based system.
CMOS Integrated Circuit for Sensing Applications
Authors: Supriya S. Shanbhag
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this work, a CMOS integrated circuit (IC) that can be employed to develop an integrated fiber optic sensor based on phase detection technique is presented. The CMOS IC combines the LED driver circuitry, optical detector and phase detector circuitry on a single chip. The designed CMOS IC provides miniaturized, portable, low cost and low power detection for quantifying analytes and for recording excited-state lifetimes ranging from nanoseconds to milliseconds.
Recovery-Based Real-Time Static Scheduling for Battery Life Optimization
Authors: Anirban Lahiri, Saurabh Agarwal, Anupam Basu, Bhargab B. Bhattacharya
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

A real-time, static scheduling algorithm for battery life optimization has been presented in this paper. The work aims to extend existing battery aware scheduling techniques. It differs from previous work as it takes into consideration many aspects of battery recovery that were not considered previously. This allows for further enhancement of the system battery life by up to 29.41%.The scheduling algorithm achieves a total battery life extension of up to 37.7%.
Novel fuzzy test patterns and their application in the measurement of geometric characteristics of displays
Authors: Saeed Toosizadeh, Ali Peiravi
Venue: Machine Vision and Applications (2005)

One of the final steps in a display production line is the image alignment that includes the visual adjustment of the geometric parameters and the color of the image. Measurement of geometric characteristics using machine vision is a necessary function in the automatic alignment of displays&#x2019; image in the factory. A critical part in the measurement of the geometric attributes is to precisely locate a test pattern position on the display screen. In this paper we introduce novel patterns as fuzzy test patterns and present a novel algorithm to precisely locate the fuzzy test pattern in captured images of the display screen. We experimentally show that the application of the proposed fuzzy test pattern and its associated locating algorithm increases the precision and robustness of the geometric measurements of a display like a TV display. The use of this new measurement method in an auto-alignment system increases the adjustment accuracy, improves the reliability of the alignment system, and improves the quality of images on the display of the adjusted display sets.