ppxscal/embedding_network huggingface dataset:
Extensions of valuations
Authors: Jean Goubault-Larrecq
Venue: Mathematical Structures in Computer Science (2005)

Continuous valuations have been proposed by several authors as a way of modelling probabilistic non-determinism in programming language semantics. Let $(X, {\cal O})$ be a topological space. A quasi-simple valuation on $X$ is the sup of a directed family of simple valuations. We show that quasi-simple valuations are exactly those valuations that extend to continuous valuations to the Alexandroff topology on the specialisation preordering of the topology $\cal O$. A number of applications are presented. In particular, we recover Jones' result that every continuous valuation is quasi-simple if $X$ is a continuous dcpo &ndash; in this case there is a least extension to the Alexandroff topology. We show that this can be refined if $X$ is algebraic, where every continuous valuation is the sup of a directed family of simple valuations based on finite elements. We exhibit another class of spaces in which every continuous valuation is quasi-simple, the so-called finitarily coherent spaces &ndash; in this case there is a largest extension to the Alexandroff topology. In general, the extension to the Alexandroff topology is not unique, unless, for example, the original valuation is bicontinuous. We also show that other natural spaces of valuations, namely those of discrete valuations and point-continuous valuations, can be characterised by similar extension theorems.
Exploring technology adoption and use through the lens of residential mobility
Authors: Irina A. Shklovski, Scott D. Mainwaring
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

One of the outcomes of massive adoption of technology is that much of daily technology use and consumption is embedded into "unremarkable" daily life routines. Occasionally, these routines undergo major shifts, often in conjunction with major life events such as marriage, birth of a child, or a residential move. We propose a model of settling into a new location as a function of balance between the pull of the things left behind and the demands of the new and unknown. It is through this experience of being unsettled that we explore the processes of behavior adjustment and re-evaluation of old patterns of technology use as it relates to the old location and the demands of the new location.
Automatic video editing system using stereo-based head tracking for multiparty conversation
Authors: Yoshinao Takemae, Kazuhiro Otsuka, Junji Yamato
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper presents an automatic video editing system based on head tracking for multiparty conversations. Systems that record meetings and those that support teleconferences are attracting considerable interest. Conventional systems use a fixed-viewpoint camera and simple camera selection based on participants' utterances. However, conventional systems fail to adequately convey who is talking to whom to the viewer. We focus on the participants' head orientation since this information is useful in detecting the speaker and who the speaker is talking to. In order to automatically estimate each participant's head orientation, our system combines several modules for stereo-based head tracking. The system selects the shot of the participant that most participants are looking at, based on majority decision. Experiments confirm the effectiveness of our system in several 3-participant conversations. The results show that our system can more successfully convey who is talking to whom which is an extremely crucial piece of information that allows the viewer to better under-stand conversation content.
A survey of combinatorial optimization problems in multicast routing
Authors: Carlos A. S. Oliveira, Panos M. Pardalos
Venue: Computers and Operations Research (2005)

In multicasting routing, the main objective is to send data from one or more sources to multiple destinations, while at the same time minimizing the usage of resources. Examples of resources which can be minimized include bandwidth, time and connection costs. In this paper, we survey applications of combinatorial optimization to multicast routing. We discuss the most important problems considered in this area, as well as their models. Algorithms for each of the main problems are also presented.
Dreaming of robots: an interview with Bruce Sterling
Authors: Aaron Marcus
Venue: interactions (2005)

Bruce Sterling is a 50-year-old cyberpunk who is currently "Provocateur-in-Residence" at the Art Center College of Design in Pasadena. His many works of science fiction include a number of robots, especially the novel and short-story cycle Schismatrix Plus.
Transitions in programming models: 2
Authors: Luca Cardelli
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The future of programming languages is not what it used to be. From the 50's to the 90's, richer, more flexible, and more robust structures were imposed on raw computation. Generally, new models of data and control managed to subsume older ones. But now, as programs and applications expand beyond a single local network and a single administrative domain, the very nature of data and control changes, and many long-lasting conceptual invariants are disrupted. We discuss three of these disruptive changes, which seem to be happening all at the same time, and for related reasons: asynchronous concurrency, semistructured data, and (in much less detail) security abstractions. We outline research project that address issues in those areas, mostly as examples of much larger territories yet to explore.
A control model for an insurance company
Authors: E. N. Derieva
Venue: Cybernetics and Systems Analysis (2005)

The activity of an insurance company with a reinsurance condition system is modeled on an infinite time interval. Payment times and sums insured are random. The amount of money replenished is selected as a control parameter. The task is to minimize the average insurance payment per unit time, thus optimizing investments.
An effective decision procedure for linear arithmetic over the integers and reals
Authors: Bernard Boigelot, Sébastien Jodogne, Pierre Wolper
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

This article considers finite-automata-based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this article is to show, using topological arguments, that only a restricted class of automata on infinite words are necessary for handling real and integer linear arithmetic. This allows the use of substantially simpler algorithms, which have been successfully implemented.
A pattern-based analyzer for french in the context of spoken language translation: first prototype and evaluation
Authors: Hervé Blanchon
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

In this paper, we describe a first prototype of a pattern-based analyzer developed in the context of a speech-to-speech translation project using a pivot-based approach (the pivot is called IF). The chosen situation involves a French client talking to an Italian travel agent (both in their own language) to organize a stay in the Trentino area.An IF consists of a dialogue act, and a list, possibly empty, of argument values. The analyzer applies a "phrase spotting" mechanism on the output of the speech recognition module. It finds well-formed phrases corresponding to argument values. A dialogue act is then built according to the instantiated arguments and some other features of the input.The current version of the prototype has been involved in an evaluation campaign on an unseen corpus of four dialogues consisting of 235 speech turns. The results are given and commented in the last part of the paper. We think they pave the way for future enhancements to both the coverage and the development methodology.
Composition and evaluation of trustworthy Web Services
Authors: Stephen J. H. Yang, James S. F. Hsieh, Blue C. W. Lan, Jen-Yao Chung
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

Service Oriented Architecture (SOA) is an architectural style that could seamlessly integrate existing software to fulfill dynamic requests in a platform-independent way but the loosely coupled and distributed characteristics of SOA will incur the trustworthiness problem in service composition. In this paper, we utilized the statistical techniques and Petri nets to propose an evaluation method for trustworthy service compositions. The trustworthiness of involved Web Services will be evaluated by analyzing past experiences so that the trustworthiness of the composite service could be estimated from the evaluation of each Web Service and aggregation topology of the composite service.
Information search: the intersection of visual and semantic space
Authors: Franklin P. Tamborello,  II, Michael D. Byrne
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In the context of an information search task, does the visual salience of items interact with information scent? That is, do things like bold headlines or highlighted phrases interact with local semantic cues about the usefulness of distal sources of information? Most research on visual search and highlighting has used stimuli with no semantic content, while studies on information search have assumed equal visual salience of items in the search space. In real information environments like the Web, however, these things do not occur in isolation. Thus, we used a laboratory study to examine how these factors interact. The almost perfectly additive results imply that good information scent cannot overcome poor visual cues, or vice versa, and that both factors are equally important.
Component-based architecture and implicit interactions: wearable computing application
Authors: Daniel Cheung-Foo-Wo, Jean-Yves Tigli, Michel Riveill
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This study of software architecture for wearables aims at showing that component-based architecture can be well suited for component reusability and rapid prototyping in constraint resource environments. But some component assembly might produces side effects inside the resulting application. Indeed, drawbacks can be limited by using an architecture based on the decomposition of components into behavioural structures and implicit interaction between components. This approach is validated by a wearable application for visual disabled.
Deploying Diffserv in Backbone Networks for Tight SLA Control
Authors: Clarence Filsfils, John Evans
Venue: IEEE Internet Computing (2005)

The Differentiated Services Architecture (Diffserv) enables service providers to offer tighter, more comprehensive service-level agreements (SLAs) for IP service performance. One way it does this is by letting designers engineer IP backbone networks to assure that SLA parameters are met on a per-class basis. This review covers best practices for designing, validating, deploying, and operating Diffserv in the network backbone. It also presents new results from router-based testing that demonstrate how, with Diffserv, high-performance backbone routers can achieve tight SLA capabilities.
A flexible and general solution for reconfiguring pipeline computing systems
Authors: Mircea Popa
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The pipeline architectural concept ensures great speed for computing systems but its important disadvantages are the lack of flexibility and low fault tolerance. One way for minimizing these disadvantages which ensures optimum power consumption too for a specific application is its reconfiguration. The paper presents a flexible and general solution for reconfiguring pipeline computing systems which allows the reconfiguration at the device level or at the system level. After presenting the pipeline concept and its specific features, the new solution is described. It is based on introducing programmable hardware at every pipeline station which allows tailoring the optimal pipeline architecture for a specific application. The programmability of this hardware is simple and fast. Some examples are used which show how to reconfigure pipeline computing systems with four stations but they can be extended for any number of stations. The new solution is described in 2 variants: one with maximum flexibility but which is more complex too and one simpler but with a reduced flexibility.
Ensemble Tracking
Authors: Shai Avidan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We consider tracking as a binary classification problem, where an ensemble of weak classifiers is trained on-line to distinguish between the object and the background. The ensemble of weak classifiers is combined into a strong classifier using AdaBoost. The strong classifier is then used to label pixels in the next frame as either belonging to the object or the background, giving a confidence map. The peak of the map, and hence the new position of the object, is found using mean shift. Temporal coherence is maintained by updating the ensemble with new weak classifiers that are trained on-line during tracking. We show a realization of this method and demonstrate it on several video sequences.
An affordable modular mobile robotic platform with fuzzy logic control and evolutionary artificial neural networks
Authors: Maurice Tedder, David Chamulak, Li-Ping Chen, Santosh Nair, Andrey Shvartsman, I. Tseng, Chan-Jin Chung
Venue: Journal of Robotic Systems (2004)

Autonomous robotics projects encompass the rich nature of integrated systems that includes mechanical, electrical, and computational software components. The availability of smaller and cheaper hardware components has helped make possible a new dimension in operational autonomy. This paper describes a mobile robotic platform consisting of several integrated modules including a laptop computer that serves as the main control module, microcontroller-based motion control module, a vision processing module, a sensor interface module, and a navigation module. The laptop computer module contains the main software development environment with a user interface to access and control all other modules. Programming language independence is achieved by using standard input&sol;output computer interfaces including RS-232 serial port, USB, networking, audio input and output, and parallel port devices. However, with the same hardware technology available to all, the distinguishing factor in most cases for intelligent systems becomes the software design. The software for autonomous robots must intelligently control the hardware so that it functions in unstructured, dynamic, and uncertain environments while maintaining an autonomous adaptability. This paper describes how we introduced fuzzy logic control to one robot platform in order to solve the 2003 Intelligent Ground Vehicle Competition (IGVC) Autonomous Challenge problem. This paper also describes the introduction of hybrid software design that utilizes Fuzzy Evolutionary Artificial Neural Network techniques. In this design, rather than using a control program that is directly coded, the robot's artificial neural net is first trained with a training data set using evolutionary optimization techniques to adjust weight values between neurons. The trained neural network with a weight average defuzzification method was able to make correct decisions to unseen vision patterns for the IGVC Autonomous Challenge. A comparison of the Lawrence Technological University robot designs and the design of the other competing schools shows that our platforms were the most affordable robot systems to use as tools for computer science and engineering education. &copy; 2004 Wiley Periodicals, Inc.
The Exact Maximum Likelihood-Based Test for Fractional Cointegration: Critical Values, Power and Size
Authors: Emmanuel Dubois, Sandrine Lardic, Valérie Mignon
Venue: Computational Economics (2004)

The exact maximum likelihood (EML) procedure can be used as a residual-based test of the hypothesis of no cointegration against the alternative of fractional cointegration. Since the corresponding asymptotic properties have not yet been established, this paper provides simulated critical values, power and size relating to the EML-based test for fractional cointegration. Monte Carlo simulations indicate that the simulated density of the EML-based test is shifted to the left compared to the standard normal distribution and exhibits a strong excess of kurtosis in the absence of autoregressive components in the regression residuals. The power and size comparison indicates that the EML-based test is more powerful than other fractional cointegration tests (Lo, Lobato-Robinson and Geweke and Porter-Hudak) in small and medium sample sizes. Moreover, by simulating integrated time series with AR(1), and respectively MA(1), disturbances, it is shown that, whatever the sample size, the EML-based test exhibits the lowest size distortions for positive AR(1) and negative MA(1) coefficients, respectively.
The virtual interaction panel: an easy control tool in augmented reality systems: Research Articles
Authors: M. L. Yuan, S. K. Ong, Andrew Y. C. Nee
Venue: Computer Animation and Virtual Worlds (2004)

In this paper, we propose and develop an easy control tool called Virtual Interaction Panel (VirIP) for Augmented Reality (AR) systems, which can be used to control AR systems. This tool is composed of two parts: the design of the VirIPs and the tracking of an interaction pen using a Restricted Coulomb Energy (RCE) neural network. The VirIP is composed of some virtual buttons, which have meaningful information that can be activated by an interaction pen during the augmentation process. The interaction pen is a general pen-like object with a certain color distribution. It is tracked using a RCE network in real-time and used to trigger the VirIPs for AR systems. In our system, only one camera is used for capturing the real world. Therefore, 2D information is used to trigger the virtual buttons to control the AR systems. The proposed method is real-time because the RCE-based image segmentation for a small region is fast. It can be used to control AR systems quite easily without any annoying sensors attached to entangling cables. This proposed method has good potential in many AR applications in manufacturing, such as assembly without the need for object recognition, collaborative product design, system control, etc. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A form-based meta-model for software composition
Authors: M. Lumpe, J.-G. Schneider
Venue: Science of Computer Programming (2005)

In recent years considerable progress has been made in facilitating the specification and implementation of software components. However, it is far less clear what kind of language support is needed to enable a flexible and reliable software composition approach. Object-oriented programming languages seem to already offer some reasonable support for component-based programming (e.g., encapsulation of state and behavior, inheritance, late binding). Unfortunately, these languages typically provide only a fixed and restricted set of mechanisms for constructing and composing compositional abstractions.In this article, we will present a generic meta-level framework for modeling both object-and component-oriented programming abstractions. In this framework, various features, which are typically merged in traditional object-oriented programming languages, are all replaced by a single concept: the composition of forms. Forms are first-class, immutable, extensible records that allow for the specification of compositional abstractions in a language-neutral and robust way. Thus, using the meta-level framework, we can define a compositional model that provides the means both to bridge between different object models and to incorporate existing software artifacts into a unified composition system.
Text Mining Biomedical Literature for Discovering Gene-to-Gene Relationships: A Comparative Study of Algorithms
Authors: Ying Liu, Shamkant B. Navathe, Jorge Civera, Venu Dasigi, Ashwin Ram, Brian J. Ciliax, Ray Dingledine
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

Partitioning closely related genes into clusters has become an important element of practically all statistical analyses of microarray data. A number of computer algorithms have been developed for this task. Although these algorithms have demonstrated their usefulness for gene clustering, some basic problems remain. This paper describes our work on extracting functional keywords from MEDLINE for a set of genes that are isolated for further study from microarray experiments based on their differential expression patterns. The sharing of functional keywords among genes is used as a basis for clustering in a new approach called BEA-PARTITION in this paper. Functional keywords associated with genes were extracted from MEDLINE abstracts. We modified the Bond Energy Algorithm (BEA), which is widely accepted in psychology and database design but is virtually unknown in bioinformatics, to cluster genes by functional keyword associations. The results showed that BEA-PARTITION and hierarchical clustering algorithm outperformed k\hbox{-}{\rm{means}} clustering and self-organizing map by correctly assigning 25 of 26 genes in a test set of four known gene groups. To evaluate the effectiveness of BEA-PARTITION for clustering genes identified by microarray profiles, 44 yeast genes that are differentially expressed during the cell cycle and have been widely studied in the literature were used as a second test set. Using established measures of cluster quality, the results produced by BEA-PARTITION had higher purity, lower entropy, and higher mutual information than those produced by k\hbox{-}{\rm{means}} and self-organizing map. Whereas BEA-PARTITION and the hierarchical clustering produced similar quality of clusters, BEA-PARTITION provides clear cluster boundaries compared to the hierarchical clustering. BEA-PARTITION is simple to implement and provides a powerful approach to clustering genes or to any clustering problem where starting matrices are available from experimental observations.
Numerical Conservation Properties of H(div)-Conforming Least-Squares Finite Element Methods for the Burgers Equation
Authors: H. De Sterck, Thomas A. Manteuffel, Stephen F. McCormick, Luke Olson
Venue: SIAM Journal on Scientific Computing (2005)

Least-squares finite element methods (LSFEMs) for the inviscid Burgers equation are studied. The scalar nonlinear hyperbolic conservation law is reformulated by introducing the flux vector, or the associated flux potential, explicitly as additional dependent variables. This reformulation highlights the smoothness of the flux vector for weak solutions, namely, $\bff(u) \in H({\rm div},\Omega)$. The standard least-squares (LS) finite element (FE) procedure is applied to the reformulated equations using H(div)-conforming FE spaces and a Gauss--Newton nonlinear solution technique. Numerical results are presented for the one-dimensional Burgers equation on adaptively refined space-time domains, indicating that the H(div)-conforming FE methods converge to the entropy weak solution of the conservation law. The H(div)-conforming LSFEMs do not satisfy a discrete exact conservation property in the sense of Lax and Wendroff. However, weak conservation theorems that are analogous to the Lax--Wendroff theorem for conservative finite difference methods are proved for the H(div)-conforming LSFEMs. These results illustrate that discrete exact conservation in the sense of Lax and Wendroff is not a necessary condition for numerical conservation but can be replaced by minimization in a suitable continuous norm.