ppxscal/embedding_network huggingface dataset:
Fine-grained failover using connection migration
Authors: Alex C. Snoeren, David G. Andersen, Hari Balakrishnan
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

This paper presents a set of techniques for providing fine-grained failover of long-running connections across a distributed collection of replica servers, and is especially useful for fault-tolerant and load-balanced delivery of streaming media and telephony sessions. Our system achieves connection-level failover across both local-and wide-area server replication, without requiring a front-end transport-or application-layer switch. Our approach uses recently proposed end-to-end "connection migration" mechanisms for transport protocols such as TCP, combined with a soft-state session synchronization protocol between replica servers. The end result is a robust, fast, and fine-grained connection failover mechanism that is transparent to client applications, and largely transparent to the server applications. We describe the details of our design and Linux implementation, as well as experimental data that suggests this approach is an attractive way to engineer robust systems for distributing long-running streams; connections suffer relatively small performance degradation even when migration occurs every few seconds, and the associated server overhead is small.
A Nonlinear Multi-agent System designed for Swarm Intelligence: the Logistic MAS
Authors: Rodolphe Charrier, Christine Bourjot, Francois Charpillet
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Ant algorithms and flocking algorithms are the two main programming paradigms in swarm intelligence. They are built on stochastic models, widely used in optimization problems. However, though this modeling leads to highperformance algorithms, some mechanisms, like the symmetry break in ant decision, are still not well understood at the local ant level. Moreover, there is currently no modeling approach which joins the two paradigms. This paper proposes an entirely novel approach to the mathematical foundations of swarm algorithms: contrary to the current stochastic approaches, we show that an alternative deterministic model exists, which has its origin in deterministic chaos theory. We establish a reactive multi-agent system, based on logistic nonlinear decision maps, and designed according to the influence-reaction scheme. The rewriting of the decision functions leads to a new way of understanding the swarm phenomena in terms of state synchronization, and enables the analysis of their convergence behavior through bifurcation diagrams. We apply our approach on two concrete examples of each algorithm class, in order to demonstrate its general applicability.
Identifiability in causal bayesian networks
Authors: Marco Valtorta
Venue:  (2006)

The usefulness of Bayesian networks in representing knowledge with uncertainty is widely accepted. A Bayesian network consists of a qualitative part a directed acyclic graph (DAG) and a quantitative part a collection of numerical parameters, which are usually conditional probability tables. Bayesian networks also admit a natural causal interpretation, and therefore they are a kind of language in which causal concepts can be discussed and analyzed in precise terms. This dissertation concerns the problem of identifying casual effects in causal Bayesian networks. Causal effects enable us to predict how systems respond to external interventions without carrying out controlled experiments. Based on the work of other researchers, especially Tian and Pearl, we offer a sound and complete algorithm to solve the identification problem on general causal Bayesian networks. Our result shows the power of the algebraic approach in solving identifiability problems and closes the identifiability problem of unconditional interventions. We recognize that the graphical and transformational approach to identifiability questions proposed by other researchers has certain advantages over the algebraic approach in terms of ease of explanation. The most important graphical approach to identifiability is the do-calculus method given by J. Pearl. We prove that it is complete, in the sense that, if a causal effect is identifiable, there exists a sequence of applications of the rules of the do-calculus that transforms the causal effect formula into a formula that only includes observational quantities. Our result confirms Pearl's conjecture of the completeness property of his method, which had been stated in 1995.
Sequencing by hybridization: an enhanced crossover operator for a hybrid genetic algorithm
Authors: Carlos A. Brizuela, Luis C. González-Gurrola, Andrei Tchernykh, Denis Trystram
Venue: Journal of Heuristics (2007)

This paper presents a genetic algorithm for an important computational biology problem. The problem appears in the computational part of a new proposal for DNA sequencing denominated sequencing by hybridization. The general usage of this method for real sequencing purposes depends mainly on the development of good algorithmic procedures for solving its computational phase. The proposed genetic algorithm is a modified version of a previously proposed hybrid genetic algorithm for the same problem. It is compared with two well suited meta-heuristic approaches reported in the literature: the hybrid genetic algorithm, which is the origin of our proposed variant, and a tabu-scatter search algorithm. Experimental results carried out on real DNA data show the advantages of using the proposed algorithm. Furthermore, statistical tests confirm the superiority of the proposed variant over the state-of-the-art heuristics.
Transforming a database systems and design course for non computer science majors
Authors: T. J. Dean, W. G. Milani
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Methods of instruction for many undergraduate courses in database systems and design still focus primarily an lectures and a single, all-encompassing design project to reinforce database concepts. This paper describes how the database systems course taught at the US Military Academy has evolved to include immediate concept reinforcement in the classroom using networked PCs and a graphically-oriented relational database and application development software tool for each cadet. Heretofore, many relational database concepts were discussed in theory and not thoroughly demonstrated. Our course incorporates immediate concept demonstration using running courseware examples that graphically illustrate practical application of the underlying theory. These examples, for instance, allow direct mapping from theoretical discussions of relational algebra to SQL implementation and finally to query-by-example construction. The traditional course culminated in a final project of limited practical use. This delayed mastery of the theory until completion of the course project, still leaving students without a meaningful product to show for their efforts. With direct application of the theory in our course, understanding is immediate. This allows successful integration of an early project of equal magnitude to the usual final design project. Later, a capstone design project is permitted, emphasizing group interaction with a real-world client and team development of a viable, stand-alone database application. To conclude the course, groups orally present their product in class and write a technical report supporting their work.
Learning how to design loosely coupled classes
Authors: K. Shyam
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Standard object oriented (OO) design facilitates organizing the classes in a modular fashion during the design stage. However, this doesn't necessarily mean that the modularity is preserved in the later stages of the software development cycle. For example, during implementation, a casual use of friends in classes can re-introduce dependencies. We describe the design of a tool that detects such dependencies and aids in learning the design of classes in OO programs where the interdependencies in the classes are minimized.
Adaptive Fuzzy Sliding Mode Controller for the Kinematic Variables of an Underwater Vehicle
Authors: Eduardo Sebastián, Miguel A. Sotelo
Venue: Journal of Intelligent and Robotic Systems (2007)

This paper address the kinematic variables control problem for the low-speed manoeuvring of a low cost and underactuated underwater vehicle. Control of underwater vehicles is not simple, mainly due to the non-linear and coupled character of system equations, the lack of a precise model of vehicle dynamics and parameters, as well as the appearance of internal and external perturbations. The proposed methodology is an approach included in the control areas of non-linear feedback linearization, model-based and uncertainties consideration, making use of a pioneering algorithm in underwater vehicles. It is based on the fusion of a sliding mode controller and an adaptive fuzzy system, including the advantages of both systems. The main advantage of this methodology is that it relaxes the required knowledge of vehicle model, reducing the cost of its design. The described controller is part of a modular and simple 2D guidance and control architecture. The controller makes use of a semi-decoupled non-linear plant model of the Snorkel vehicle and it is compounded by three independent controllers, each one for the three controllable DOFs of the vehicle. The experimental results demonstrate the good performance of the proposed controller, within the constraints of the sensorial system and the uncertainty of vehicle theoretical models.
A new distance measure for probability distribution function of mixture type
Authors: Z. Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Evaluating the similarity between two probability distribution functions (PDF) is very important in various research problems. This paper proposes a new metric that computes the distance between two PDFs of mixture type directly from their parameters. It is posed as a linear programming problem and its theoretical properties and performance are analyzed, experimented, and compared with existing measures. In addition, as a proof of concept, we applied the new metric to the problem of audio retrieval where involved PDFs are GMMs (Gaussian mixture model) with 4 mixtures. Experimental results on both synthetic and real data show that this new distance measure is quite promising.
The use of textual data mining in the detection of the proliferation of weapons of mass destruction
Authors: Peter M. Leitner
Venue:  (2007)

This dissertation describes an experiment where a form of textual data mining of the World Wide Web is performed to discover web pages that may be indicative of the construction, research about, or at least interest in the various weapons of mass destruction (Biological, Chemical, Nuclear, and Radiological). Words have been selected from various control lists (Australia Group, Military Critical Technologies List, and others) and assigned various point scores according to their importance in constructing a weapon. Web pages from the World Wide Web are crawled, and analyzed and a score in obtained for each page scanned in each of the weapon categories. An innovative computer man-machine interface presents the information to an intelligence analyst in a manner such that the most important sites are analyzed first. The results of the experiment are analyzed and suggestions for future enhancements to the program are made.
Wire speed packet classification without tcams: a few more registers (and a bit of logic) are enough
Authors: Qunfeng Dong, Suman Banerjee, Jia Wang, Dheeraj Agrawal
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

Packet classification is the foundation of many Internet functions such as QoS and security. A long thread of research has proposed efficient software-based solutions to this problem. Such software solutions are attractive because they require cheap memory systems for implementation, thus bringing down the overall cost of the system. In contrast, hardware-based solutions use more expensive memory systems, e.g., TCAMs, but are often preferred by router vendors for their faster classification speeds. The goal of this paper is to find a "best-of-both-worlds" solution -- a solution that incurs the cost of a software-based system and has the speed of a hardware-based one. Our proposed solution, called smart rule cache achieves this goal by using minimal hardware -- a few additional registers -- to cache evolving rules which preserve classification semantics, and additional logic to match incoming packets to these rules. Using real traffic traces and real rule sets from a tier-1 ISP, we show such a setup is sufficient to achieve very high hit ratios for fast classification in hardware. Cache miss ratios are 2 ∼ 4 orders of magnitude lower than flow cache schemes. Given its low cost and good performance, we believe our solution may create significant impact on current industry practice.
Linkage identification based on epistasis measures to realize efficient genetic algorithms
Authors: M. Munetomo
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Genetic algorithms (GAs) process building blocks (BBs) mixed and tested through genetic recombination operators. To realize effective BB processing, linkage identification, which detects a set of tightly linked loci, is essential. This paper proposes linkage identification with epistasis measures (LIEM), which detects linkage groups based on a pair-wise epistasis measure.
Model Checking of Computer-Based Systems
Authors: Jinzhao Wu, Wei Yan
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Computer-based systems, especially multi-agent systems which incorporate multi-agents physically distributed, can be represented as event structures. We propose an action-based event structure logic which is an appropriate approach specifying the action behaviors that cause states change. We discuss the symmetry of event structures. The symmetry reduction technique is used to reduce an event structures to get a simple quotient structure through the equivalence class induced by a permutation group. The action-based event structure formulas without confliction modality can be easily verified on the quotient structure for multi-agent systems.
A PMOS-diode Differential Body-driven Offset compensated 0.5V
Authors: S. M. Rezaul Hasan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper reports a new 0.5V supply high resolution CMOS comparator suitable for biosensor applications. The comparator uses a body-driven PMOS-diode differential pair and compensates for differential body-input referred offset-voltage through single-ended sampled-data pre-amplification. Extensive simulations were carried out using a 0.13ìm IBM CMOS process technology. The comparator has a differential input overdrive resolution of under 2mV and a response time of around 0.1ìsec which is scalable. The static power dissipation by the comparator from the 0.5V supply is under 5ìW making it extremely suitable for implantable biosensor devices. In addition, the comparator uses a Truly Single Phase Clock (TSPC) for the sampled data operations, thus simplifying dynamic timing requirements.
Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
Authors: Jean-Baptiste Hiriart-Urruty
Venue: SIAM Review (2007)

We present a collection of fourteen conjectures and open problems in the fields of nonlinear analysis and optimization. These problems can be classified into three groups: problems of pure mathematical interest, problems motivated by scientific computing and applications, and problems whose solutions are known but for which we would like to know better proofs. For each problem we provide a succinct presentation, a list of appropriate references, and a view of the state of the art of the subject.
General E-unification with Eager Variable Elimination and a Nice Cycle Rule
Authors: Barbara Morawska
Venue: Journal of Automated Reasoning (2007)

We present a goal-directed E-unification procedure with eager Variable Elimination and a new rule, Cycle, for the case of collapsing equations --- that is, equations of the type x¿¿¿v where x ¿Var(v). Cycle replaces Variable Decomposition (or the so-called Root Imitation) and thus removes possibility of some obviously unnecessary infinite paths of inferences in the E-unification procedure. We prove that, as in other approaches, such inferences into variable positions in our goal-directed procedure are not needed. Our system is independent of selection rule and complete for any E-unification problem.
Recommenders in a personalized, collaborative digital library environment
Authors: Henri Avancini, Leonardo Candela, Umberto Straccia
Venue: Journal of Intelligent Information Systems (2007)

We envisage an information source not only as an information resource where users may submit queries to satisfy their daily information need, but also as a collaborative working and meeting space of people sharing common interests. Indeed, we will present a highly personalized environment where not only users may organize (and search into) the information space according to their individual taste and use, but which provides advanced features of collaborative work among the users. It is up to the system to discover interesting properties about the users' interests, relationships between users and user communities and to make recommendations based on preference patterns of the users, which is the main topic of this paper.
An algorithm to determine hidden Markov model topology
Authors: J. L. Sanz-Gonzalez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Hidden Markov modeling (HMM) provides a probabilistic framework for modeling a time series of multivariate observations. An HMM describes the dynamic behavior of the observations in terms of movement among the states of a finite-state machine. We present an algorithm that selects an HMM topology for a set of time series data. Our method selects a topology based on a likelihood criterion and a heuristic evaluation of complexity. The algorithm iteratively prunes state transitions from a large general HMM topology until a topology is obtained that concisely represents the dynamic structure of the data. The goal of this approach is to allow the data to reveal their own dynamic structure without external assumptions concerning the number of states or pattern of transitions.
Comparing a coevolutionary genetic algorithm for multiobjective optimization
Authors: J. D. Lohn, W. F. Kraus, G. L. Haith
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA yields poor coverage across the Pareto front, yet finds a solution that dominates all the solutions produced by the eight other algorithms.
A Prototype No-Reference Video Quality System
Authors: Richard Dosselmann, Xue Dong Yang
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper introduces a number of innovative noreference algorithms to assess the perceived quality of realtime analog and digital television and video streams. A prototype system is developed to locate and measure the impact of three types of impairments that commonly impair television and video signals. Analog sequences are tested for the presence of random noise. In the case of digital signals, two fundamental types of errors are of interest. The first is the blocking artifact that is so pervasive among DCT-based compression schemes such as MPEG. The second category includes errors caused by random changes to the bit stream of a signal. Of the various forms that these distortions may take on, only those that appear as "colored blocks are detected by this system. Ideas to address the remaining issues are discussed.
Log amplitude modeling of sinusoids in voiced speech
Authors: N. Malik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We present an algorithm for all-pole (envelope) modeling of the amplitudes of sinusoids present in voiced speech segments which works even when the number of sinusoids is very small, as occurs with high-pitched speakers. In contrast to previous methods, this algorithm minimizes a squared error criterion in the log amplitude domain rather than the amplitude domain, and so is better matched to the properties of the human auditory system. A weighted iterative approach is used to get near optimal solutions to this otherwise nonlinear problem. This new frequency domain log amplitude modeling (LAM) algorithm gives impressive results, especially in the case of high pitched female voices where conventional linear prediction methods are inadequate. The algorithm can easily be generalized to develop pole-zero models.
Challenges in creating environments for SOA learning
Authors: Nicolas Lopez, Rubby Casallas, Jorge Villalobos
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

SOA is now in widespread use by the industry and is a current area of interest for research. However a currently open area of investigation is how to properly introduce SOA in an IT/CS/SwE type of curriculum. Software engineering students must develop a series of abilities and skills related to SOA for effective professional practice. Providing environments where students go beyond learning some concepts and specific technologies to truly apprehend the complexity involved in SOA is a mayor challenge. This environment must be articulated in the context of business needs and other software architecture methodologies. Instructors need a new set of skills and abilities to tackle this challenge. This position paper discusses what such an environment should provide for students and instructors to effectively develop skills that will enable SOA practice in the business world.