ppxscal/embedding_network huggingface dataset:
Evaluation of java virtual machines for real-time applications
Authors: Andy Juan Wang, Venkatesh Baglodi
Venue: Journal of Computing Sciences in Colleges (2002)

This paper shows how a benchmark program can be utilized in a real-time system course to test six Java virtual machines for their suitability of supporting hard real time applications. This is a continuous effort following the work reported in [5]. With Java Hartstone benchmark, our experiment was carried out on a computer with both Windows Millennium and Linux operating systems using all four benchmark experiments under controlled conditions to provide reliable analysis. The characteristics and expected behavior of the benchmark are described with actual testing results presented and analyzed. A conclusion is drawn about suitability of these Java virtual machines in terms of their potentials for being included in real-time systems. The issues of using real-time benchmark programs in a real-time systems course are discussed.
Good Processor Identification in Two-Dimensional Grids
Authors: Fred J. Meyer, Fabrizio Lombardi, Jun Zhao
Venue: Proceedings of the 14th International Symposium on Defect and Fault-Tolerance in VLSI Systems (1999)

We examine the problem of identifying good processors in self-testing two-dimensional grid systems. The grids have boundaries (not wrap-around) and degree 8. Our diagnostic objective is to identify at least one fault-free processor. From this, at least one faulty processor could be identified and it would be possible to sequentially diagnose the system by repeated repair. We establish an upper bound on the worst case maximum number of faults while still being able to meet the diagnostic goal with an ideal diagnosis algorithm. A straightforward ideal diagnosis algorithm would have exponential complexity and would involve 16 parallel rounds of processor testing. We give a test schedule with at most 6 parallel rounds of testing. This test schedule tolerates asymptotically as many faults as an ideal algorithm (by a constant factor). The new test schedule will also work for grids with degree 4, which have inferior diagnostic potential.
Multimodal geographic information systems: adding haptic and auditory display
Authors: Wooseob Jeong, Myke Gluck
Venue: Journal of the American Society for Information Science and Technology (2003)

The goal of this study was to discover the feasibility of adding haptic and auditory displays to traditional visual geographic information systems (GIS). The experiment was conducted with 51 participants to explore the difference in user performance (task completion time and accuracy) and user satisfaction with a multimodal GIS system, which was implemented with a haptic display, auditory display, and combined display. The experiment consisted of a series of 36 tasks in which the participants were asked to identify the highest or the middle valued state among nine U.S. states on maps. The results showed that haptic displays produce faster and more accurate performance than auditory displays and combined displays for more complex tasks. In terms of user satisfaction, the participants preferred the combined display even though they performed best with the haptic display.
Mappings between probabilistic boolean networks
Authors: Edward R. Dougherty, Ilya Shmulevich
Venue: Signal Processing (2003)

Probabilistic Boolean Networks (PBNs) comprise a graphical model based on uncertain rule-based dependencies between nodes and have been proposed as a model for genetic regulatory networks. As with any algebraic structure, the characterization of important mappings between PBNs is critical for both theory and application. This paper treats the construction of mappings to alter PBN structure while at the same time maintaining consistency with the original probability structure. It considers projections onto sub-networks, adjunctions of new nodes, resolution reduction mappings formed by merging nodes, and morphological mappings on the graph structure of the PBN. It places PBNs in the framework of many-sorted algebras and in that context defines homomorphisms between PBNs.
Immersive visual modeling: potential use of virtual reality in teaching software design
Authors: Bruce J. Neubauer, James D. Harris
Venue: Journal of Computing Sciences in Colleges (2003)

It is difficult for students to learn to design object-oriented applications if they have an incomplete or incorrect understanding of object-oriented concepts and relationships. The usual classroom explanation of these concepts is often based upon UML (Unified Modeling Language) diagrams and the "donut" visualization of an object. Spatial visualization in a virtual world may be an aid to learning. This paper explores the prospective use of virtual worlds as three-dimensional models of object-oriented software. The virtual world building tool Adobe Atmosphere is described. The conclusion identifies three prospective significant benefits of immersive virtual modeling of software systems.
A corpus-based speech synthesis system with emotion
Authors: Akemi Iida, Nick Campbell, Fumito Higuchi, Michiaki Yasumura
Venue: Speech Communication (2003)

We propose a new approach to synthesizing emotional speech by a corpus-based concatenative speech synthesis system (ATR CHATR) using speech corpora of emotional speech. In this study, neither emotional-dependent prosody prediction nor signal processing per se is performed for emotional speech. Instead, a large speech corpus is created per emotion to synthesize speech with the appropriate emotion by simple switching between the emotional corpora. This is made possible by the normalization procedure incorporated in CHATR that transforms its standard predicted prosody range according to the source database in use. We evaluate our approach by creating three kinds of emotional speech corpus (anger, joy, and sadness) from recordings of a male and a female speaker of Japanese. The acoustic characteristics of each corpus are different and the emotions identifiable. The acoustic characteristics of each emotional utterance synthesized by our method show clear correlations to those of each corpus. Perceptual experiments using synthesized speech confirmed that our method can synthesize recognizably emotional speech. We further evaluated the method's intelligibility and the overall impression it gives to the listeners. The results show that the proposed method can synthesize speech with a high intelligibility and gives a favorable impression. With these encouraging results, we have developed a workable text-to-speech system with emotion to support the immediate needs of nonspeaking individuals. This paper describes the proposed method, the design and acoustic characteristics of the corpora, and the results of the perceptual evaluations.
A fuzzy c-means variant for the generation of fuzzy term sets
Authors: T. W. Liao, Aivars K. Celmins, Robert J. Hammell,  II
Venue: Fuzzy Sets and Systems (2003)

A fuzzy c-means (FCM) variant is proposed for the generation of fuzzy term sets with ½ overlap. The proposed variant differs from the original mainly in two areas. The first modification ensures that two end terms take the maximum and minimum domain values as their centers. The second modification prevents the generation of non-convex fuzzy terms that often occurs with the original algorithm. The optimal number of terms and the optimal shape of the membership function associated with each term are determined based on the mean squared error criterion. The exponential weight, m, used in the algorithm is found to greatly affect the shape of the membership function. The effect of data size used for the generation of fuzzy terms is also discussed. A generalized π-shaped function with a tunable parameter along with its complement is developed to fit all term sets generated by the FCM variant using various m values.
Development of a Rapid-Response Supply Chain at Caterpillar
Authors: Uday Rao, Alan Scheller-Wolf, Sridhar Tayur
Venue: Operations Research (2000)

As part of its growth strategy, Caterpillar Inc. is launching a new P2000 product line of "compact" construction equipment and worktools. In anticipation of this, they asked the authors to construct and analyze potential P2000 supply chain configurations. Using decomposition and results from network flow theory, inventory theory, and simulation theory, we were able to provide solutions to this problem for different supply chain scenarios provided by Caterpillar. Novel features of our model include expedited deliveries, partial backlogging of orders, and realized sales that are responsive to service. Caterpillar made their decision regarding the P2000 supply chain based on our recommendations.
Distributed State Space Generation of Discrete-State Stochastic Models
Authors: Gianfranco Ciardo, Joshua Gluckman, David Nicol
Venue: INFORMS Journal on Computing (1998)

High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generation and storage of the entire underlying state space. This imposes practical limitations on the types of systems that can be modeled. Because of the vast amount of memory consumed, we investigate distributed algorithms for the generation of state space graphs. The distributed construction allows us to take advantage of the combined memory readily available on a network of workstations. The key technical problem is to find effective methods for on-the-fly partitioning, so that the state space is evenly distributed among processors. In this article we report on the implementation of a distributed state space generator that may be linked to a number of existing system modeling tools. We discuss partitioning strategies in the context of Petri net models, and report on performance observed on a network of workstations, as well as on a distributed memory multicomputer.
Predicting context aware computing performance
Authors: Eli Rohn
Venue: Ubiquity (2003)

Computer systems will increasingly need to be sensitive to their context to serve their users better.In this paper we forecast the capabilities of context aware computing and relating it to a time frame.Our short-range analysis indicates such systems will become commercially available and common by 2007.Our mid-range analysis indicates that the development pace of Context Aware systems will start to slow down by 2020 and will reach maturity by 2035.
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Authors: Silvano Martello, David Pisinger, Paolo Toth
Venue: Management Science (1999)

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in additi on, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted. The algorithm is able to solve all classical test instances, with up to 10,000 variables, in less than 0.2 seconds on a HP9000-735/99 computer. The C language implementation of the algorithm is available on the internet.
Toward a Stakeholder Theory of the Firm: The Saturn Partnership
Authors: Thomas A. Kochan, Saul A. Rubinstein
Venue: Organization Science (2000)

This paper seeks to engage the organization theory community in contemporary debates over the role of the corporation in American society by using the case of the Saturn corporation to develop and illustrate a stakeholder theory of the firm. One normative and three positive questions are posed for a stakeholder theory: The normative question is: Why should stakeholder models be given serious consideration at this moment in history? The positive questions are: (1) Under what conditions is a stakeholder firm likely to emerge in the United States, (2) what are the critical determinants of performance in a stakeholder firm, and (3) what will determine the sustainability and diffusion of this organizational form in the American environment? The history, design features, and dynamics of the labormanagement partnership at Saturn are used to illustrate and interpret a specific case of employees as stakeholders. Saturn's original mission, governance structure, and internal processes fit the characteristics of a stakeholder firm. Employees establish themselves as influential, definitive stakeholders by using their knowledge to improve organizational performance. The local union likewise contributes to firm performance by organizing workers into a dense social network that contributes to problem solving, conflict resolution, and quality improvement. However, the legal and political environment in which the firm operates produces considerable uncertainty over the sustainability and diffusion of Saturn's features in particular, and the stakeholder organizational form in general. Additional hypotheses and research questions are proposed to continue theory building around the more general model of the stakeholder firm. Researchers are encouraged to take up the analysis of stakeholder models and thereby contribute to the contemporary and future debates over the role of the corporation in American society.
How Larger Demand Variability May Lead to Lower Costs in the Newsvendor Problem
Authors: Ad Ridder, Erwin Van Der Laan, Marc Salomon
Venue: Operations Research (1998)

In this paper we consider the Newsvendor Problem. Intuition may lead to the hypothesis that in this stochastic inventory problem a higher demand variability results in larger variances and in higher costs. In a recent paper, Song (1994a) has proved that the intuition is correct for many demand distributions that are commonly used in practice, such as for the normal distribution function. However, this paper shows that there exist demand distributions for which the intuition is misleading, i.e., for which larger variances occur in combination with lower costs. To characterize these demand distributions we use stochastic dominance relations.
Can a dog tell the difference? dogs encounter AIBO, an animal-like robot in two social situations
Authors: Enikö Kubinyi, Ádám Miklósi, Frédéric Kaplan, Márta Gácsi, József Topál, Vilmos Csányi
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

The use of autonomous animal-like robots can offer new possibilities for studying social recognition ability in animals. We report on an experiment where 24 adult dogs and 16 puppies were studied in a spontaneous and in a competitive situation with AIBO, a four-legged autonomous robot. A puppy and a remote controlled car were used as controls.
A note on transitive orientations with maximum sets of sources and sinks
Authors: Celina M. H. de Figueiredo, John Gimbel, Célia P. Mello, Jayme L. Szwarcfiter
Venue: Discrete Applied Mathematics (2002)

Given a transitive orientation G of a comparability graph G, a vertex of G is a source (sink) if it has indegree (outdegree) zero in G, respectively. A source set of G is a subset of vertices formed by sources of some transitive orientation G. A pair of subsets S, T ⊆ V(G) is a source-sink pair of G when the vertices of S and T are sources and sinks, of some transitive orientation G, respectively. We describe algorithms for finding a transitive orientation with a maximum source-sink pair in a comparability graph. The algorithms are applications of modular decomposition and are all of linear-time complexity.
An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem
Authors: Cynthia Barnhart, Rajesh G. Shenoi
Venue: Transportation Science (1998)

The crew pairing problem requires the coverage of a set of long-haul flights by a minimum cost set of crew pairings. A crew pairing is a sequence of flights flown by one crew, starting and ending at the same location, and satisfying a variety of work regulations and collective bargaining agreements. We present a new solution approach that solves first an approximate model of the problem and then uses its solution as an advanced start solution for conventional approaches. Using data provided by a long-haul airline, we demonstrate that our new approach can be used with a deadhead selector to identify deadheads quickly that might improve significantly the quality of the crew pairing solution. Deadheads, flights to which crews are assigned as passengers, reposition crews for better utilization. We speed up the solution process by using our advanced start solution and by quickly providing good lower bounds on the optimal solution values. Our experiments show that the lower bounds are on average within 0.85% of the optimal solution value. Further, we show that compared to existing methods, we reduce solution costs and run times by an average of 20% and over 80%, respectively.
Concepts in fuzzy scaling theory: order and granularity
Authors: Karl Erich Wolff
Venue: Fuzzy Sets and Systems (2002)

This paper explains mainly by examples the mathematical foundation of Fuzzy Scaling Theory described in (Wolff: EUFIT' 98, 6th European Congress on Intelligent Techniques and Soft Computing, Vol. I, Aachen, 1998, pp. 555-562). It illustrates the solution of fundamental problems in Fuzzy Theory, especially the problem of the pragmatic meaning of ordered sets as logics, the problem of the meaning of Fuzzy implications and the problem of the construction of direct products of linguistic variables. The key to the solution of these problems is the description of membership functions by cut contexts and of linguistic variables by conceptual scales. This renders the translation of Conceptual Scaling Theory into Fuzzy Scaling Theory and the generalization of the latter to L-Fuzzy Scaling Theory for an arbitrary ordered set L as logic.This paper bridges the gap between two scientific communities both using "graded concepts" as tools to handle granularity: it is shown that L-Fuzzy Scaling Theory is equivalent to Conceptual Scaling Theory.
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
Authors: Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan
Venue: Operations Research (1998)

This article describes a generalized insertion heuristic for the Traveling Salesman Problem with Time Windows in which the objective is the minimization of travel times. The algorithm gradually builds a route by inserting at each step a vertex in its neighbourhood on the current route, and performing a local reoptimization. This is done while checking the feasibility of the remaining part of the route. Backtracking is sometimes necessary. Once a feasible route has been determined, an attempt is made to improve it by applying a post-optimization phase based on the successive removal and reinsertion of all vertices. Tests performed on 375 instances indicate that the proposed heuristic compares very well with alternative methods and very often produces optimal or near-optimal solutions.
Interconnected rings and oscillators as gigahertz clock distribution nets
Authors: Manuel Salim Maza, Mónico Linares Aranda
Venue: Proceedings of the 13th ACM Great Lakes symposium on VLSI (2003)

The performance of interconnected rings and oscillators, working as clock distribution networks, is analyzed and compared among several configurations. The use of interconnected 3-inverter rings as globally asynchronous, locally synchronous clock distribution networks is proposed even for chip lengths from 4 to 24 mm. In this approach, modularity and basic cell properties are kept while the power consumption results directly proportional to the number of blocks. Typical 3.3V AMS 0.35mm CMOS N-well process parameters were used for the analysis. Regarding the current area expansion, we show that interconnected rings is a more robust approach than the interconnected oscillators.
The branching point approach to Conway's problem
Authors: Juhani Karhumäki, Ion Petre
Venue: Formal and natural computing (2002)

A word u is a branching point for a set of words X if there are two different letters a and b such that both ua and ub can be extended to words in X+. A branching point u is critical for X if u ∈ X+. Using these notions, we give an elementary solution for Conway's Problem in the case of finite biprefixes. We also discuss a possible extension of this approach rewards a complete solution for Conway's Problem.
The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
Authors: Michela Milano, Greger Ottosson, Philippe Refalo, Erlendur S. Thorsteinsson
Venue: INFORMS Journal on Computing (2002)

Efforts aimed at combining operations research and constraint programming have become increasingly prominent and successful in the last few years. It is now widely recognized that integration, e.g., inference in the form of constraint propagation and relaxation in the form of linear programming, can yield substantial results. In this paper, we argue the benefits of constraint programming's global constraints as a basis for such an integration and discuss the advantages along with some examples. We illustrate the integration on the global cardinality structure, on piecewise linear functions, on variable subscripts, on the cycle structure and on resource constraints. Each example is completed with a case study.
Parallel functional programming at two levels of abstraction
Authors: Ricardo Peña, Fernando Rubio
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

The parallel functional language Eden extends Haskell with expressions to define and instantiate process systems. These extensions allow also the easy definition of skeletons as higherorder functions. P arallel programming is possible in Eden at two levels: Recursive programming and higher-order programming. At the lower level, processes are explicitly created by using recursive definitions. In this way, skeletons can be defined. This is very un usual, as most skeleton-based languages use an imperative language to create new skeletons. At the higher level, available sk eletons are used to create applications or to define new skeletons on top of the other ones. In this paper, we present five skeletons, most of them wellkno wn, covering a wide range of parallel structures. F or each one, sev eral Eden implementations are given, together with their corresponding cost models. Finally, some examples of application programming are shown, including predicted and actual results on a Beowulf cluster.
Options in the Real World: Lessons Learned in Evaluating Oil and Gas Investments
Authors: James E. Smith, Kevin F. McCardle
Venue: Operations Research (1999)

Many firms in the oil and gas business have long used decision analysis techniques to evaluate exploration and development opportunities and have looked at recent development in option pricing theory as potentially offering improvements over the decision analysis approach. Unfortunately, it is difficult to discern the benefits of the options approach from the literature on the topic: Most of the published examples greatly oversimplify the kinds of projects encountered in practice, and comparisons are typically made to traditional discounted cash flow analysis, which, unlike the option pricing and decision analytic approaches, does not explicitly consider the uncertainty in project cash flows. In this paper, we provide a tutorial introduction to option pricing methods, focusing on how they relate to and can be integrated with decision analysis methods, and describe some lessons learned in using these methods to evaluate some real oil and gas investments.