ppxscal/embedding_network huggingface dataset:
Compilation for FPGA-Based Reconfigurable Hardware
Authors: João M. P. Cardoso, Horácio C. Neto
Venue: IEEE Design Test (2003)

These techniques for compiling software programs into reconfigurable hardware offer faster and more efficient performance than the complex resource-sharing approaches typical of high-level synthesis systems. The Java-based compiler presented in this article uses intermediate graph representations to embody parallelism at various levels.
A Modern Simulation Course for Business Students
Authors: H. Brian Hwarng
Venue: Interfaces (2001)

Simulation was often neglected in undergraduate business curricula for two reasons: (1) simulation was traditionally taught and used in engineering disciplines, and (2) business students lacked training in computer programming and quantitative skills. Powerful microcomputers and user-friendly simulation software have brought about new prospects for simulation modeling. To meet the needs of the modern business world, business schools should widely teach simulation modeling and analysis. I developed an intermediate simulation course at the National University of Singapore for upper-level-undergraduate or graduate business students. Early in the course, migrating from general-purpose spreadsheet modeling to special-purpose simulation modeling is a key step. Modeling real-world problems through team projects is the climax of the course. My rigorous and practical approach proves that students with no simulation or computer-programming background can handle even an intermediate course.
Partition the vertices of a graph into induced matchings
Authors: Jinjiang Yuan, Qin Wang
Venue: Discrete Mathematics (2003)

The induced matching partition number of a graph G, denoted by imp(G), is the minimum integer k such that V(G) has a k-partition (V1, V2,..., Vk) such that, for each i, 1 ≤ i ≤ k, G[Vi], the subgraph of G induced by Vi, is a 1-regular graph. This is different from the strong chromatic index--the minimum size of a partition of the edges of graph into induced matchings. It is easy to show, as we do in this paper, that, if G is a graph which has a perfect matching, then imp(G) ≤ 2Δ (G) - 1, where Δ(G) is the maximum degree of a vertex of G. We further show in this paper that, when G is connected, imp(G) = 2 Δ(G) - 1 if and only if G is isomorphic to either K2 or C4k+2 or the Petersen graph, where. Cn is the cycle of length n.
Modelling multiple mind-matter interaction
Authors: Catholijn M. Jonker, Jan Treur
Venue: International Journal of Human-Computer Studies (2002)

Relations between mental and physical aspects of an agent can be of various types. Sensing and acting are among the more commonly modelled types. In agent modelling approaches often this is the only interaction between the physical and mental; other possible types of interactions are abstracted away. If it is also taken into account that the agent's mind has a materialization in the form of a brain, the relations between mind and matter may become more complex. An explanation of a dynamic pattern may involve mental aspects, physical aspects, and interactions between mental and physical aspects. An explanatory perspective sometimes advocated for such more complex phenomena is explanatory pluralism. According to this perspective an explanation can consist of parts of a different signature, for example, a partial physical explanation and a partial mentalistic explanation. Each of these partial explanations is insufficient to explain the whole phenomenon, but together they do explain the whole, if some interaction is assumed. How for such explanations the different types of interaction between mind and matter of an agent and the material world can be modelled in a conceptually and semantically sound manner, and how the overall explanation is composed from the parts, using these interactions, is the main topic of this paper. The generic model presented can be used to model, explain and simulate a variety of phenomena in which multiple mind-matter interactions occur, including, for example, sensing and acting, (planned) birth and death, bacterial behaviour, getting brain damage, psychosomatic diseases and applications of direct brain-computer interfaces.
Research Note: Overselling with Opportunistic Cancellations
Authors: Eyal Biyalogorsky, Ziv Carmon, Gila E. Fruchter, Eitan Gerstner
Venue: Marketing Science (1999)

In many business sectors such as airlines, hotels, trucking, and media advertising, customers' arrivals and willingness to pay are uncertain. Managers must decide whether to quote a price low enough to guarantee early sales, or to quote a higher price and risk that some units remain unsold. In allocating capacity, they face a trade-off between two types of potential losses; (1) Yield loss-selling at a low price, and losing a better price later, and (2) Spoilage loss-waiting in vain to sell at a high price, and losing the opportunity of an earlier low price offer. Yield loss means that consumers who value the product most do not get to use it, and spoilage loss means that valuable products are wasted because no consumers get to use them. Sellers typically hedge against the risk of spoilage loss by selling some units early at low prices, and against the risk of yield loss by blocking some units in hope of selling them later at a high price. In this paper we show that the use of overselling with opportunistic cancellations can increase expected profits and improve allocation efficiency. Under this strategy, the seller deliberately oversells capacity if high-paying consumers show up, even when capacity is already fully booked. The seller then cancels the sale to some low-paying customers while providing them with appropriate compensation. We derive a new rule to optimally allocate capacity to consumers when overselling is used, and show that overselling helps limit the potential yield and spoilage losses. Yield loss is reduced because the seller can capture more high-paying customers by compensating low-paying customers who give up their right to the product. Spoilage loss is reduced because the compensation decreases the price spread perceived by the seller, and as a result, the seller is less anxious to speculate and "block" units. Overselling with opportunistic cancellations assures that the product will be sold to consumers who value it most. This means that "everybody wins", and resources are allocated more efficiently than in conventional selling.
Emotional speech: towards a new generation of databases
Authors: Ellen Douglas-Cowie, Nick Campbell, Roddy Cowie, Peter Roach
Venue: Speech Communication (2003)

Research on speech and emotion is moving from a period of exploratory research into one where there is a prospect of substantial applications, notably in human-computer interaction. Progress in the area relies heavily on the development of appropriate databases. This paper addresses four main issues that need to be considered in developing databases of emotional speech: scope, naturalness, context and descriptors. The state of the art is reviewed. A good deal has been done to address the key issues, but there is still a long way to go. The paper shows how the challenge of developing appropriate databases is being addressed in three major recent projects--the Reading--Leeds project, the Belfast project and the CREST--ESP project. From these and other studies the paper draws together the tools and methods that have been developed, addresses the problems that arise and indicates the future directions for the development of emotional speech databases.
On perturbations of matrix pencils with real spectra, a revisit
Authors: Ren-Cang Li
Venue: Mathematics of Computation (2003)

This paper continues earlier studies by Bhatia and Li on eigenvalue perturbation theory for diagonalizable matrix pencils having real spectra. A unifying framework for creating crucial perturbation equations is developed. With the help of a recent result on generalized commutators involving unitary matrices, new and much sharper bounds are obtained.
The origin of 'feel'
Authors: J. Kevin O'Regan, Alva Noē
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

This paper proposes a way of bridging the explanatory gap between physical processes in the brain and the "felt" aspect of sensory experience. The approach is based on the idea that experience is not generated by brain processes themselves, but rather is constituted by the way these brain processes enable a particular form of "give-and-take" between the perceiver and the environment. From this starting-point we are able to characterize the phenomenological differences between the different sensory modalities in a more principled way than has been done in the past. We are also able to approach the issue of the experiential quality of sensory awareness and consciousness in a satisfactory way. Finally we describe one of the empirical consequences of the theory, namely the phenomenon of "change blindness".
An evolutionary algorithm for optimizing material flow in supply chains
Authors: F. Elizabeth Vergara, Moutaz Khouja, Zbigniew Michalewicz
Venue: Computers and Industrial Engineering (2002)

Supply chain management literature calls for coordination between the different members of the chain. Materials should be moved from one supplier to the next according to a just-in-time schedule. In this paper we develop an evolutionary algorithm (EA) for optimal synchronization of supply chains. In developing our algorithm, we use the economic delivery and scheduling model and analyze supply chains dealing with multiple-components. We test the performance of the proposed EA and show that it provides optimal, or near optimal, solutions for a wide range of problems. The EA is shown to be much faster at solving large problems than an enumeration procedure and exhibits robust behavior when tested on a variety of different problem parameters.
Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
Authors: Candace A. Yano, Alexandra M. Newman
Venue: Transportation Science (2001)

We consider the problem of scheduling trains and containers (or trucks and pallets) between a depot and a destination. Goods arrive at the depot dynamically over time and have distinct due dates at the destination. There is a fixed-charge transportation cost for each vehicle, and each vehicle has the same capacity. The cost of holding goods may differ between the depot and the destination. The goal is to minimize the sum of transportation and holding costs.For the case in which all goods have the same holding costs, we consider two variations: one in which the holding cost at the destination is less than that at the origin, and one in which the relationship is reversed. For the first variation, we derive properties of the optimal solution which provide the basis for anO( T2) solution procedure. For the second variation, we introduce a new definition of a regeneration state, derive strong characterizations of the shipment schedule within a regeneration interval, and develop anO( T4) procedure.We also analyze two multi-item scenarios. In the first, for each item, the holding cost at the origin is less than that at the destination; in the second, the relationship is reversed for all items. We generalize several of the structural results for the single-item problem to the corresponding multi-item case. We also show that the optimal vehicle schedule can be obtained by solving a related single-item problem in which the item demands are aggregated in a particular way. The optimal assignment of customer orders to vehicles can then be found by solving a linear program.
Monitoring tools and numerical models for evaluation of monitored natural attenuation of explosives at selected sites
Authors: M. Zakikhani, D. W. Harrelson, J. C. Pennington, J. M. Brannon, M. K. Corcoran, J. Clark
Venue: Development and application of computer techniques to environmental studies (2002)

As part of the natural attenuation study and long- term monitoring of explosives, new types of direct push technologies (DPT) that allow direct detection of contamination, without bringing soil or water samples to the surface for analysis, have been developed in recent years. The DPT has been used to provide data to a multi-objective project conducted at two contaminated sites. The DPT also provided samples for microbiological studies and stratigraphic analysis of lithologies for the numerical modeling effort. The main objective of the modeling work was to assist field monitoring and data collection for a better demonstration and graphic representation of natural attenuation of explosives. The study has shown that the DPT is an effective tool for sampling both soil and water in varying geologic environments of deposition. DPT technology provided a cost-effective means of providing real-time data concerning the stratigraphy, resistivity and ground water contamination of the sites. The ground water modeling system (GMS) was used to simulate flow and mass transport of contaminants of concern (TNT, RDX) at the sites. Modeling runs for LAAP indicated that the TNT and RDX plumes are static and possibly slowly diminishing
An Exact Method for the Vehicle Routing Problem with Backhauls
Authors: Aristide Mingozzi, Simone Giorgi, Roberto Baldacci
Venue: Transportation Science (1999)

We consider the problem in which a fleet of vehicles located at a central depot is to be optimallyused to serve a set of customers partitioned into two subsets of linehaul and backhaul customers. Each route starts and ends at the depot and the backhaul customers must be visited afterthe linehaul customers. A new (0-1) integer programming formulation of this problem is presented. We describe a procedure that computes a valid lower bound to the optimal solution cost by combining different heuristic methods for solving the dual of the LP-relaxation of the exact formulation. An algorithm for the exact solution of the problem is presented. Computational tests on problems proposed in the literature show the effectiveness of the proposed algorithms in solving problems up to 100 customers.
Timed delivery of reward signals in an autonomous robot
Authors: William H. Alexander, Olaf Sporns
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

In this paper, we implement a computational model of a neuromodulatory system in an autonomous robot. The model is based on a set of anatomical and physiological properties of the mammalian dopamine system, one of several diffuse ascending systems of the brain. The output of this system acts as a value signal, which modulates widely distributed synaptic changes in sensory and motor areas. During reward conditioning, the model learns to generate tonic and phasic responses, which are consistent with potential roles as reward predictions and prediction errors. Different sets of neural units generate precisely timed signals that exert positive effects (predictive) and negative effects (if a predicted reward is omitted) on neuroplasticity. We test the learning and behavior of the robot in different environmental contexts, and observe changes in the development of neural connections within the neuromodulatory system that depend on the robot's interaction with the environment. Simulation of a computational model responsive to rewarding stimuli leads to the emergence of conditioned appetitive behaviors. These studies represent a step towards investigating the behavior of autonomous robots controlled by biologically based neuromodulatory systems.
ShownPass: an easy access control with a displayed password
Authors: Yuji Ayatsuka, Michimune Kohno, Jun Rekimoto
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Access control is one of the most important issue with ubiquitous networking environment. Traditional access control methods are mainly considering authentication of registered user or device. Therefore, it is troublesome to allow a visitor to use a networked resource in an office, without accessiblity to other resources. We propose a new access control method using frequently changing passwords displayed beside a resource. This method can be implemented without any special hardware like a sensor.
Salvatore Pincherle: the pioneer of the Mellin-Barnes integrals
Authors: Francesco Mainardi, Gianni Pagnini
Venue: Journal of Computational and Applied Mathematics (2003)

The 1888 paper by Salvatore Pincherle (Professor of Mathematics at the University of Bologna) on generalized hypergeometric functions is revisited. We point out the pioneering contribution of the Italian mathematician towards the Mellin-Barnes integrals based on the duality principle between linear differential equations and linear difference equation with rational coefficients. By extending the original arguments used by Pincherle, we also show how to formally derive the linear differential equation and the Mellin-Barnes integral representation of the Meijer G functions.
Individual Equilibrium and Learning in Processor Sharing Systems
Authors: Eitan Altman Inria, Nahum Shimkin
Venue: Operations Research (1998)

We consider a processor-sharing service system, where the service rate to individual customers decreases as the load increases. Each arriving customer may observe the current load and should then choose whether to join the shared system. The alternative is a constant-cost option, modeled here for concreteness as a private server (e.g., a personal computer that serves as an alternative to a central mainframe computer). The customers wish to minimize their individual service times (or an increasing function thereof). However, the optimal choice for each customer depends on the decisions of subsequent ones, through their effect on the future load in the shared server. This decision problem is analyzed as a noncooperative dynamic game among the customers. We first show that any Nash equilibrium point consists of threshold decision rules and establish the existence and uniqueness of a symmetric equilibrium point. Computation of the equilibrium threshold is demonstrated for the case of Poisson arrivals, and some of its properties are delineated. We next consider a reasonable dynamic learning scheme, which converges to the symmetric Nash equilibrium point. In this model customers simply choose the better option based on available performance history. Convergence of this scheme is illustrated here via a simulation example and is established analytically in subsequent work.
An efficient BIST method for distributed small buffers
Authors: W. B. Jone, D. C. Huang, S. C. Wu, K. J. Lee
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

In this work, we propose a new built-in self-testing (BIST) method that is able to concurrently test a set of spatially distributed embedded-memory modules with different sizes. Using the concept of redundant read-write operations, we develop a new march method, called RSMarch, to efficiently test each memory module. The new method has the advantages of low hardware overhead, short test time, and high-fault coverage. The total test time is dominated by large-size modules. To further reduce the test time, we also propose a split-mode test method to virtually partition each large memory array into smaller modules, which can be tested simultaneously.
SILVER: simplifying video editing with metadata
Authors: A. Chris Long, Juan Casares, Brad A. Myers, Rishi Bhatnagar, Scott M. Stevens, Laura Dabbish, Dan Yocum, Albert Corbett
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Digital video is becoming increasingly ubiquitous. However, editing video remains difficult for several reasons: it is a time-based medium, it has dual tracks of audio and video, and current tools force users to work at the smallest level of detail. Based on interviews with professional video editors, we developed a video editor, called Silver, that uses metadata to make digital video editing more accessible to novices. To help users visualize video, Silver provides multiple views with different semantic content and at different levels of abstraction, including storyboard, editable transcript, and timeline views. Silver offers smart editing operations that help users resolve the inconsistencies that arise because of the different boundaries in audio and video.
Singular value decomposition of time-varying matrices
Authors: Markus Baumann, Uwe Helmke
Venue: Future Generation Computer Systems (2003)

This paper is concerned with an algorithm to compute the singular value decomposition (SVD) of time-varying square matrices. In a first step we consider the task of diagonalizing symmetric time-varying matrices A(t). A differential equation is proposed, whose solutions asymptotically track the diagonalizing transformation. In particular, perfect matching of the initial conditions is not required and the solutions converge exponentially towards the desired transformation. Then the desired differential equation for tracking the SVD is derived. Robustness of the algorithms is guaranteed by our approach.
A bandwidth latency tradeoff for broadcast and reduction
Authors: Peter Sanders, Jop F. Sibeyn
Venue: Information Processing Letters (2003)

The "fractional tree" algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns-sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.
Open activeWrl: a middleware based software development toolkit for immersive VE systems
Authors: C. Winkelholz, T. Alexander, M. Weiß
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

A Virtual Environment (VE) is not an application in itself. It should further be seen as a complex, multi modal human-computer interface. Immersive VE systems must be able to couple resources, most likely distributed in a cluster, into a parallel, real-time simulation. The shortcoming of most VE software libraries is the inability to provide an environment that satis es the three main requirements in the implementation of a VE system, namely the design of the VE interface, the implementation of the actual application and the distribution of parallel tasks to appropriate resources within a cluster system. This paper presents Open ActiveWrl, an open source software project that tackles these problems by a generic software development approach. It is tailored for heterogenous cluster systems. Open ActiveWrl uses a general-purpose middleware that interprets VRML/X3D as an interface de nition language.
Multiclass Production Systems with Setup Times
Authors: Rhonda Righter, J. George Shanthikumar
Venue: Operations Research (1998)

We consider polling systems with random setup times, and show that if setup times are reduced in the convex ordering sense, then waiting times, work loads, and queue sizes will be reduced in the usual stochastic sense. We also show that the joint distributions of various performance measures across time are invariant under shifts in setup times as long as the net shift is zero.