ppxscal/embedding_network huggingface dataset:
Describing the emotional states that are expressed in speech
Authors: Roddy Cowie, Randolph R. Cornelius
Venue: Speech Communication (2003)

To study relations between speech and emotion, it is necessary to have methods of describing emotion. Finding appropriate methods is not straightforward, and there are difficulties associated with the most familiar. The word emotion itself is problematic: a narrow sense is often seen as "correct", but it excludes what may be key areas in relation to speech-including states where emotion is present but not full-blown, and related states (e.g., arousal, attitude). Everyday emotion words form a rich descriptive system, but it is intractable because it involves so many categories, and the relationships among them are undefined. Several alternative types of description are available. Emotion-related biological changes are well documented, although reductionist conceptions of them are problematic. Psychology offers descriptive systems based on dimensions such as evaluation (positive or negative) and level of activation, or on logical elements that can be used to define an appraisal of the situation. Adequate descriptive systems need to recognise the importance of both time course and interactions involving multiple emotions and/or deliberate control. From these conceptions of emotion come various tools and techniques for describing particular episodes. Different tools and techniques are appropriate for different purposes.
A survey of some quantitative approaches to the notion of information
Authors: Aldo de Luca
Venue: Formal and natural computing (2002)

We survey some formalizations of the intuitive notion of information which have been formulated in different mathematical and conceptual frames. The existence of different formalizations reflects the different aspects of the notion of information which are strongly related to the mechanisms of information processing of the receiver. Finally, some considerations and remarks on information in Physics and Biology are made.
The Multiprocessor Scheduling of Precedence-Constrained Task Systems in the Presence of Interprocess Communication Delays
Authors: Lisa Navazio, Giorgio Romanin-Jacur, Sanjoy K. Baruah
Venue: Operations Research (1998)

The problem of scheduling precedence-constrained task systems characterized by interprocessor communication delays is addressed. It is assumed that task duplication is permitted. The target machine is a homogenous multiprocessor with an unbounded number of processors. The general problem is known to be NP-hard; however, when communication delays are small relative to task execution times, the C.P.M. based approach of Colin and Chretienne (1991) yields an optimal schedule in polynomial time. Extensions to this method of Colin and Chretienne are presented here, which allow for polynomial-time optimal schedule generation for certain categories of task systems with arbitrary precedence relations, processing times, and communication delays.
Effect of Signature Sequence on the Performance of an AsynchronousMultiple-Chip-Rate DS/CDMA System
Authors: Dugin Lyu
Venue: Wireless Personal Communications: An International Journal (2003)

The effects of signature sequence on the performance of an asynchronous multiple-chip-rate (MCR)-DS/CDMA system are considered. The equations for the multiple access interference (MAI) and the variance of the MAI are developed. The bit error rate is derived by using the Gaussian approximation. The deterministic signature sequences such as maximal-length sequences and Gold sequences are compared with random signature sequences in terms of the variance of the MAI and bit error rate. We find that the performance of signature sequences in an asynchronous MCR-DS/CDMA system depends not only on the crosscorrelation properties of sequences but also on the carrier frequency separation between the interfering and desired users.
Precise Solution of the Algebraic Riccati Equation for One-Input Relaxation Systems
Authors: V. T. Borukhov, D. M. Zelenyak
Venue: Automation and Remote Control (2003)

Consideration was given to a special class of the algebraic Riccati equations arising in the theory of one-input relaxation systems. The precise solution obtained was used for rational parametrization of the dissipative manifold and the boundary of the set of solutions of the dissipative inequality.
Aspects for a block version of the interval Cholesky algorithm
Authors: Uwe Schäfer
Venue: Journal of Computational and Applied Mathematics (2003)

Using the domain decomposition method we give an application of a block version of the interval Cholesky algorithm. We give an example where this version accelerates the calculation of bounds for the solutions of linear systems of equations with symmetric matrices and right-hand sides both of which are varying within given intervals.
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
Authors: Egon Balas, Neil Simonetti
Venue: INFORMS Journal on Computing (2000)

Consider the following restricted (symmetric or asymmetric) traveling-salesman problem (TSP): given an initial ordering of then cities and an integerk > 0, find a minimum-cost feasible tour, where a feasible tour is one in which cityi precedes cityj wheneverj =i +k in the initial ordering. Balas (1996) has proposed a dynamic-programming algorithm that solves this problem in time linear inn, though exponential ink. Some important real-world problems are amenable to this model or some of its close relatives.The algorithm of Balas (1996) constructs a layered network with a layer of nodes for each position in the tour, such that source-sink paths in this network are in one-to-one correspondence with tours that satisfy the postulated precedence constraints. In this paper we discuss an implementation of the dynamic-programming algorithm for the general case when the integerk is replaced with city-specific integersk( j),j = 1, . . .,n.We discuss applications to, and computational experience with, TSPs with time windows, a model frequently used in vehicle routing as well as in scheduling with setup, release and delivery times. We also introduce a new model, the TSP with target times, applicable to Just-in-Time scheduling problems. Finally for TSPs that have no precedence restrictions, we use the algorithm as a heuristic that finds in linear time a local optimum over an exponential-size neighborhood. For this case, we implement an iterated version of our procedure, based on contracting some arcs of the tour produced by a first application of the algorithm, then reapplying the algorithm to the shrunken graph with the samek.
Minimizing the distortion of affine spline motions
Authors: Dae-Eun Hyun, Bert Jüttler, Myung-Soo Kim
Venue: Graphical Models (2002)

In a simple approach to the affine motion interpolation problem, an affine spline motion is generated that interpolates a given sequence of keyframes and approximately satisfies rigidity constraints and certain optimization criteria. An affine spline motion is generated so as to interpolate the given keyframes, and then it is progressively refined by knot insertion and degree elevation using an iterative optimization procedure.
A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
Authors: Suvrajeet Sen, Rekha Pillai, Shirish Joshi, Ajay K. Rathi
Venue: Transportation Science (2001)

Traditional models of route generation are based on choosing routes that minimize expected travel-time between origin and destination. Such approaches do not account for the fact that travelers often incorporate travel-time variability within their decision making. Thus, a route with lower travel-time variability is preferred by some travelers, even if such a route is not one with the lowest mean travel-time. Such traveler behavior is best captured by a multiobjective model in which the choice of a route is based on the mean as well as the variance of the path travel-time. Our route-planning model is intended to help travelers make choices that reflect their decision-making process better. We formulate a network flow multiobjective model in which one of the objectives (expectation) is linear, whereas, the other (variance) is quadratic. In order to present the user with a series of options, we solve a series of parametric 0-1 quadratic integer programs. By utilizing the network structure of the problem, we devise an effective algorithm in which the 0-1 quadratic program is solved by using a continuous relaxation together with an enumeration of some selected paths. Finally, we note that the data requirements for the model can be easily satisfied in practice.
k-anonymity: a model for protecting privacy
Authors: Latanya Sweeney
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2002)

Consider a data holder, such as a hospital or a bank, that has a privately held collection of person-specific, field structured data. Suppose the data holder wants to share a version of the data with researchers. How can a data holder release a version of its private data with scientific guarantees that the individuals who are the subjects of the data cannot be re-identified while the data remain practically useful? The solution provided in this paper includes a formal protection model named k-anonymity and a set of accompanying policies for deployment. A release provides k-anonymity protection if the information for each person contained in the release cannot be distinguished from at least k-1 individuals whose information also appears in the release. This paper also examines re-identification attacks that can be realized on releases that adhere to k- anonymity unless accompanying policies are respected. The k-anonymity protection model is important because it forms the basis on which the real-world systems known as Datafly, µ-Argus and k-Similar provide guarantees of privacy protection.
Gesture + play: full-body interaction for virtual environments
Authors: Tollmar Konrad, David Demirdjian, Trevor Darrell
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Navigating virtual environments usually requires a wired interface, game console, or keyboard. The advent of perceptual interface techniques allows a new option, the passive and untethered sensing of users' pose and gesture to allow them maneuver through virtual worlds. We show new algorithms for passive, real-time articulated tracking with standard cameras and personal computers. Several different interaction styles are compared, based on an analysis of the space of possible perceptual interface abstractions for full-body navigation and the results of a wizard-of-oz study of user preferences. In this demo we show our prototype system with users guiding avatars through a series of 3-D virtual game worlds.
General framework for removal of clock network pessimism
Authors: Jindrich Zejda, Paul Frain
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The paper presents a simple yet powerful general theoretical framework and efficient implementation for removal of clock network timing pessimism. We address pessimism in static timing analysis (STA) tools caused by considering delay variation along common segments of clock paths. The STA tools compute setup (hold) timing slack based on conservative combinations of late (early) launching and early (late) capturing arrival times. To avoid exponential-time path-based analysis the STA tools use both early and late arrival times on gates common to both launching and capturing paths. It is impossible in real circuit and is observed as the clock network pessimism in STA. Our approach supports any kind of delay variation though the typical causes of the pessimism are process, voltage, and temperature on-chip variation, and reconvergence in clock network. We propose a new theoretical framework that allows to apply known graph algorithms instead of time consuming forward and backward multi-pass tracing algorithms and heuristics that are limited to some network topologies [4]. The new graph-based framework supports clock networks of virtually any size and type, e.g., tree, mesh, hybrid, clock gating, chains of multipliers and dividers, loops in such chains, etc. The implementation based on the proposed framework has proven its strength in a commercial sign-off static timing analyzer and thus is helping hundreds of designers to achieve faster clock speeds of their chips.
Infinitary relations and their representation
Authors: Laurent Mauborgne
Venue: Science of Computer Programming (2003)

This papers presents extensions of Binary Decision Diagrams (BDDs) to represent some infinitary relations (coded as infinite boolean functions). Four classes of infinitary relations are presented, and their representations are discussed. The widest class is closed under all boolean operations. The three others give rise to a canonical representation, which, when restricted to finite relations, are the classical BDDs. The paper also gives new insights in to the notion of variables and the possibility of sharing variables that can be of interest in the case of finite relations.
Preferences for unfavorable external representations in interaction with ATMs and multimedia
Authors: Martin Bergling
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Security codes accompany almost every new multimedia device. The codes are commonly represented in the form of symbolic numbers. The relative usefulness of symbolic and visuo-spatial representations of codes was investigated, using ATM-codes as an enlightening example. Visuo-spatial representations lead to higher performance on an immediate recall test. This suggests that explicit visuo-spatial representations in multimedia design may enhance usability. In spite of these results people showed preferences for the more frequently used numerical representations.
On uniform decay of solutions for wave equation of Kirchhoff type with nonlinear boundary damping and memory source term
Authors: Jeong Ja Bae, Jong Yeoul Park, Jin Mun Jeong
Venue: Applied Mathematics and Computation (2003)

In this paper we prove the existence of solution to the mixed problem for wave equation of Kirchhoff type with nonlinear boundary damping and memory term. Moreover we discuss the uniform decay of solution.
Personality types in software engineering
Authors: Luiz Fernando Capretz
Venue: International Journal of Human-Computer Studies (2003)

Software engineering is forecast to be among the fastest growing employment field in the next decades. The purpose of this investigation is two-fold: Firstly, empirical studies on the personality types of software professionals are reviewed. Secondly, this work provides an up-to-date personality profile of software engineers according to the Myers-Briggs Type Indicator.
Developing a lisp-based preprocessor for TEX documents
Authors: Hideya Iwasaki
Venue: Software&mdash;Practice Experience (2002)

TEX allows users to define a macro that abstracts a sequence of typesetting commands. However, defining macros is not easy for most users, because the mechanism of macro expansion in TEX is complicated. As a remedy for this situation, a new system that enables users to define macros for TEX documents as Lisp programs has been developed. The system acts as a preprocessor for TEX; given a document that contains Lisp programs as S-expressions, the system expands each S-expression on the basis of Lisp's evaluation rules, thus generating an ordinary TEX document. The system is very flexible and easy-to-use, thanks to the underlying language's general-purpose data structure, i.e. the S-expression, applicative order evaluation, and rich set of predefined functions. This paper also demonstrates that the proposed system is really effective for practical use by giving some concrete examples of Lisp macros, some of which are difficult to define in terms of TEX commands. The system is currently implemented on the Emacs Lisp, and a user-friendly environment is thus available in the Emacs text editor.
Satisficing solutions and duality in interval and fuzzy linear programming
Authors: Masahiro Inuiguchi, Jaroslav Ramik, Tetsuzo Tanino, Milan Vlach
Venue: Fuzzy Sets and Systems (2003)

In this paper, we introduce a class of fuzzy linear programming problems and define the concepts of feasible and satisficing solutions--the necessary tools for dealing with such problems. In this way, we show that the class of crisp (classical) LP problems can be embedded into the class of FLP ones. Moreover, for FLP problems we define the concept of duality and prove the weak and strong duality theorems. Further, we define a class of interval linear programming problems as a special subclass of FLP problems and apply the previous results to this special case.
A media enhanced introductory programming class
Authors: Curt Hill
Venue: Journal of Computing Sciences in Colleges (2002)

A traditional classroom introductory programming class has been enhanced into a hybrid class with strong classroom and Internet components. The course no longer has a textbook, but relies on a course management system developed from a MOO as an alternate information source. The MOO provides many of the facilities of a course management system but excels in its ability to be customized in a more fundamental way. This allows it to provide services not usually associated with course management software.There is something of a controversy between the proponents of classroom instruction and online learning. The classroom activities of this course and its online system complement each other with differing strengths and weaknesses. The result is a course that has the best of both worlds.
A computational economy for grid computing and its implementation in the Nimrod-G resource broker
Authors: David Abramson, Rajkumar Buyya, Jonathan Giddy
Venue: Future Generation Computer Systems (2002)

Computational grids that couple geographically distributed resources such as PCs, workstations, clusters, and scientific instruments, have emerged as a next generation computing platform for solving large-scale problems in science, engineering, and commerce. However, application development, resource management, and scheduling in these environments continue to be a complex undertaking. In this article, we discuss our efforts in developing a resource management system for scheduling computations on resources distributed across the world with varying quality of service (QoS). Our service-oriented grid computing system called Nimrod-G manages all operations associated with remote execution including resource discovery, trading, scheduling based on economic principles and a user-defined QoS requirement. The Nimrod-G resource broker is implemented by leveraging existing technologies such as Globus, and provides new services that are essential for constructing industrial-strength grids. We present the results of experiments using the Nimrod-G resource broker for scheduling parametric computations on the World Wide Grid (WWG) resources that span five continents.
The Bi-Gaussian S-Transform
Authors: C. R. Pinnegar, L. Mansinha
Venue: SIAM Journal on Scientific Computing (2002)

The S-transform kernel is derived from the kernel of the Fourier transform through the introduction of a scalable, translating window. The width of the window is a function of inverse frequency. In effect the S-transform is a method of spectral localization, with some similarities to wavelet transforms but using the concept of frequency rather than the concept of scale. An important property of the S-transform is that it collapses into the Fourier transform when integrated over the time axis; this property requires the window to satisfy a normalizing condition. The window which has been used in the majority of previous S-transform research is the symmetric Gaussian window introduced by Stockwell, Mansinha, and Lowe [IEEE Trans. Signal Process., 44 (1996), pp. 998--1001]. One problem with the use of a Gaussian, however, is degradation of time resolution in the time-frequency spectrum due to the long front taper. In this paper, a bi-Gaussian window is introduced, constructed through the welding of two half Gaussian windows. The asymmetry of the bi-Gaussian introduces asymmetry in the resultant time-frequency spectrum, with time resolution better in the "front" direction, as compared with the "back" direction. The bi-Gaussian S-transform is better at resolving the sharp onset of events in a time series.
Creating an internet and multimedia technology program in a computer science department
Authors: Sylvia Sorkin, Donna Tupper, Andrew Beiderman, Kathleen Harmeyer, Barbara Mento
Venue: Journal of Computing Sciences in Colleges (2003)

This paper describes the three-year process of creating a new Internet and Multimedia Technology associate's degree and certificate program at the Essex Campus of the Community College of Baltimore County (CCBC Essex). Program growth, student progress, and difficulties are described.
Two methods for auto-organizing personal web history
Authors: Scott LeeTiernan, Shelly Farnham, Lili Cheng
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Two methods for automatically organizing personal web history were developed and evaluated, and compared to the Internet Explorer history. One method grouped visited web pages based on similarity of root URL and time co-occurrence. The second method started with the similarity ratings and further associated or dissociated web pages using an associative learning rule. In a preliminary experiment, participants reported that both methods organized their web history significantly more like their own mental organization of their web history than did IE history. Participants were also faster to revisit web pages using both organizations than when using IE history.
HW/SW partitioning and code generation of embedded control applications on a reconfigurable architecture platform
Authors: Massimo Baleani, Frank Gennari, Yunjian Jiang, Yatish Patel, Robert K. Brayton, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

This paper studies the use of a reconfigurable architecture platform for embedded control applications aimed at improving real time performance. The hw/sw codesign methodology from POLIS is used. It starts from high-level specifications, optimizes an intermediate model of computation (Extended Finite State Machines) and derives both hardware and software, based on performance constraints. We study a particular architecture platform, which consists of a general purpose processor core, augmented with a reconfigurable function unit and data-path to improve run time performance. A new mapping flow and algorithms to partition hardware and software are proposed to generate implementations that best utilize this architecture. Encouraging preliminary results are shown for automotive electronic control examples.
Restricted-Recourse Bounds for Stochastic Linear Programming
Authors: David P. Morton, R. Kevin Wood
Venue: Operations Research (1999)

We consider the problem of bounding the expected value of a linear program (LP) containing random coefficients, with applications to solving two-stage stochastic programs. An upper bound for minimizations is derived from a restriction of an equivalent, penalty-based formulation of the primal stochastic LP, and a lower bound is obtained from a restriction of a reformulation of the dual. Our "restricted- recourse bounds" are more general and more easily computed than most other bounds because random coefficients may appear anywhere in the LP, neither independence nor boundedness of the coefficients is needed, and the bound is computed by solving a single LP or nonlinear program. Analytical examples demonstrate that the new bounds can be stronger than complementary Jensen bounds. (An upper bound is "complementary" to a lower bound, and vice versa). In computational work, we apply the bounds to a two-stage stochastic program for semiconductor manufacturing with uncertain demand and production rates.