ppxscal/embedding_network huggingface dataset:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
Authors: C.A. Glass, C.N. Potts, V.A. Strusevich
Venue: INFORMS Journal on Computing (2001)

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these asconsistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.
HARNESS fault tolerant MPI design, usage and performance issues
Authors: Graham E. Fagg, Jack J. Dongarra
Venue: Future Generation Computer Systems (2002)

Initial versions of MPI were designed to work efficiently on multi-processors which had very little job control and thus static process models. Subsequently forcing them to support a dynamic process model suitable for use on clusters or distributed systems would have reduced their performance. As current HPC collaborative applications increase in size and distribution the potential levels of node and network failures increase. This is especially true when MPI implementations are used as the communication media for GRID applications where the GRID architectures themselves are inherently unreliable thus requiring new fault tolerant MPI systems to be developed. Here we present a new implementation of MPI called FT-MPI that allows the semantics and associated modes of failures to be explicitly controlled by an application via a modified MPI API. Given is an overview of the FT-MPI semantics, design, example applications and some performance issues such as efficient group communications and complex data handling. Also briefly described is the HARNESS g_hcore system that handles low-level system operations on behalf of the MPI implementation. This includes details of plug-in services developed and their interaction with the FT-MPI runtime library.
A versatile constraint-based type inference system
Authors: François Pottier
Venue: Nordic Journal of Computing (2000)

The combination of subtyping, conditional constraints and rows yields a powerful constraint-based type inference system. We illustrate this claim by proposing solutions to three delicate type inference problems: "accurate" pattern matchings, record concatenation, and first-class messages. Previously known solutions involved a different technique in each case: our theoretical contribution is in using only a single set of tools. On the practical side, this allows all three problems to benefit from a common set of constraint simplification techniques, a formal description of which is given in an appendix.
Understanding "Strategic Learning": Linking Organizational Learning, Knowledge Management, and Sensemaking
Authors: James B. Thomas, Stephanie Watts Sussman, John C. Henderson
Venue: Organization Science (2001)

Strategic learning aims to generate learning in support of future strategic initiatives that will, in turn, foster knowledge asymmetries that can lead to differences in organizational performance. From a case study of a unique organization whose purpose is to facilitate strategic knowledge distillation, it was found that this process is characterized by targeted information gathering that relies on diverse experts for interpretation as well as validation. It also embodies the organizational capability to leverage information technologies in the distillation effort, integrating them with processes for generating, storing, and transporting rich, de-embedded knowledge across multiple levels of the organization. As a result of the case study, a model of the strategic learning is developed and a series of propositions regarding its context and processes are presented based on this model. The model highlights key dimensions of strategic learning that suggest design parameters for organizations building strategic learning systems.
A Second Order Stochastic Network Equilibrium Model, II: Solution Method and Numerical Experiments
Authors: David Watling
Venue: Transportation Science (2002)

Real traffic networks typically exhibit considerable day-to-day variations in traffic flows and travel times, yet these variations are commonly neglected in network performance models. Recently, two alternative theoretical approaches were proposed for incorporating stochastic flow variation in the equilibration of route choices: the stochastic process (SP) approach (Cantarella and Cascetta 1995) and the second order generalized stochastic user equilibrium (GSUE(2)) model (Watling 2002). The theoretical basis of the two approaches is contrasted, and the paper goes on to present a heuristic solution method for the GSUE(2) model, and two alternative simulation methods for the SP model, each applicable to the realistic case of probit-based choice probabilities. These solution methods are then applied to two realistic networks. Factors affecting convergence and reproducibility are first identified, followed by comparisons of the GSUE(2) and SP predictions. It is seen that a quasi-periodic behaviour commonly arises in the SP model, with the predictions radically different from the GSUE(2) model. However, by modifying the link performance functions in the overcapacity regime, the nature of the SP solution changes, and for a memory filter based on a large number of days' experience, its moments are seen to be approximated by those of the GSUE(2) model. Implications for the application of these models are discussed.
Phonemic coding might result from sensory-motor coupling dynamics
Authors: Pierre-yves Oudeyer
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Human sound systems are invariably phone-mically coded. Furthermore, phoneme inventories follow very particular tendancies. To explain these phenomena, there existed so far three kinds of approaches : "Chomskyan"/cognitive innatism, morpho-perceptual innatism and the more recent approach of "language as a complex cultural system which adapts under the pressure of efficient communication". The two first approaches are clearly not satisfying, while the third, even if much more convincing, makes a lot of speculative assumptions and did not really bring answers to the question of phonemic coding. We propose here a new hypothesis based on a low-level model of sensory-motor interactions. We show that certain very simple and non language-specific neural devices allow a population of agents to build signalling systems without any functional pressure. Moreover, these systems are phonemically coded. Using a realistic vowel articulatory synthesizer, we show that the inventories of vowels have striking similarities with human vowel systems.
A decoupled scheduling approach for the GrADS program development environment
Authors: Holly Dail, Henri Casanova, Fran Berman
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Program development environments are instrumental in providing users with easy and efficient access to parallel computing platforms. While a number of such environments have been widely accepted and used for traditional HPC systems, there are currently no widely used environments for Grid programming. The goal of the Grid Application Development Software (GrADS) project is to develop a coordinated set of tools, libraries and run-time execution facilities for Grid program development.In this paper, we describe a Grid scheduler component that is integrated as part of the GrADS software system. Traditionally, application-level schedulers (e.g. AppLeS) have been tightly integrated with the application itself and were not easily applied to other applications. Our design is generic: we decouple the scheduler core (the search procedure) from the application-specific (e.g. application performance models) and platform-specific (e.g. collection of resource information) components used by the search procedure. We provide experimental validation of our approach for two representative regular, iterative parallel programs in a variety of real-world Grid testbeds. Our scheduler consistently outperforms static and user-driven scheduling methods.
A new approach to fuzzy regression models with application to business cycle analysis
Authors: Berlin Wu, Neng-Fang Tseng
Venue: Fuzzy Sets and Systems (2002)

Recently, fuzzy regression analysis has been largely applied in the modeling of economic or financial data. However, those data often exhibit certain kinds of linguistic terms, for instance: very good, a little reclining or stable, in the business cycle or the growth rate of GDP, etc. The goal of this paper is to construct a fuzzy regression model by fuzzy parameters estimation using the fuzzy samples. It deals with imprecise measurement of observed variables, fuzzy least square estimation and nonparametric methods. This is different from the assumptions as well as the estimation techniques of the classical analysis. Empirical results demonstrate that our new approach is efficient and more realistic than the traditional regression analysis.
Adaptive finite volume element method for convection-diffusion-reaction problems in 3-D
Authors: R. D. Lazarov, S. Z. Tomov
Venue: Scientific computing and applications (2001)

We present an adaptive numerical technique for solving steady-state diffusion and convection-diffusion-reaction equations in 3-D using finite volume approximations. Computational results of various model simulations of fluid flow and transport of passive chemicals in non-homogeneous aquifers are presented and discussed.
Extension of a Purely Pulse Control under Boundary Conditions
Authors: V. I. Kuznetsov
Venue: Automation and Remote Control (2003)

The control of a linear system under boundary conditions for the choice of a purely pulse program of limited potentialities, the asymptote of the set of admissible controls under different constraint perturbations, and the influence of perturbations on the reachability sets in the space of trajectories generated by admissible controls are studied. The asymptotic insensitivity of the problem under perturbations of boundary conditions is determined. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
SeismoSpin: a physical instrument for digital data
Authors: Mark McKelvin, Ragnhild Nestande, Leticia Valdez, Ka-Ping Yee, Maribeth Back, Steve Harrison
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

SeismoSpin is a novel interactive instrument that uses a Disc-Jockey-mixer analogy to give seismologists a quick and powerful way to explore Northern California earthquake data. The custom-built interface and display maps earthquake data to responsive, user-determined windows of time and geographical areas. Testers (seismologists) found that SeismoSpin provided a greater control and understanding of the dataset than current tools.
On a special interpolation problem and overconvergence
Authors: Marcel G. de Bruin
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper (0,m)-interpolation on the zeros of z(zn - αn) is proved to be regular if and only if m = 1 or n + 1. Furthermore, overconvergence is studied.
Genetic algorithm-based relevance feedback for image retrieval using local similarity patterns
Authors: Zoran Stejić, Yasufumi Takama, Kaoru Hirota
Venue: Information Processing and Management: an International Journal (2003)

Local similarity pattern (LSP) is proposed as a new method for computing image similarity. Similarity of a pair of images is expressed in terms of similarities of the corresponding image regions, obtained by the uniform partitioning of the image area. Different from the existing methods, each region-wise similarity is computed using a different combination of image features (color, shape, and texture). In addition, a method for optimizing the LSP-based similarity computation, based on genetic algorithm, is proposed, and incorporated in the relevance feedback mechanism, allowing the user to automatically specify LSP-based queries. LSP is evaluated on five test databases totalling around 2500 images of various sorts. Compared with both the conventional and the relevance feedback methods for computing image similarity, LSP brings in average over 11% increase in the retrieval precision. Results suggest that the proposed LSP method, allowing comparison of different image regions using different similarity criteria, is more suited for modeling the human perception of image similarity than the existing methods.
Paper prototyping - what is it good for?: a comparison of paper- and computer-based low-fidelity prototyping
Authors: Reinhard Sefelin, Manfred Tscheligi, Verena Giller
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This study investigated the differences between computer-based and paper-based low-fidelity prototypes. It researched whether subjects confronted with these two kinds of prototypes differ in their willingness to criticize a system and to give suggestions for its improvement. The chosen approach was an empirical study including test sessions using both kinds of prototypes. Quantitative and qualitative methods were applied to measure and to explain possible differences.
Semidefinite Programming vs. LP Relaxations for Polynomial Programming
Authors: Jean B. Lasserre
Venue: Mathematics of Operations Research (2002)

We consider the global minimization of a multivariate polynomial on a semi-algebraic set O defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author. The comparison is analyzed in light of recent results in real algebraic geometry on various representations of polynomials, positive on a compact semi-algebraic set.
Architecture for the Integration and Access on Multimedia Database Systems in the Context of Mobile Environments
Authors: Guntram Flach, Nico Günther
Venue: Proceedings of the 2000 International Symposium on Database Engineering & Applications (2000)

In mobile multimedia systems, the mobility of users, devices, and information produces new challenges for processing globally distributed information. We focus our attention on new strategies for the adaptation and integration of database techniques regarding the management of multimedia data types at the particular conditions of mobile infrastructures. We believe that object-relational database systems, e.g. Informix are ideal repositories on the stationary server side for next generation multimedia applications, especially in internetworked LAN or WAN environments. The basic idea of this paper is the integration of object-relational database technology in a Mobility Information Center (MIC) as a framework which faces the common problems of mobile computing like limited bandwidth, end systems with limited resources as well as the problems in the context of multimedia data access and interaction. The major aim is to optimize the mobile data exchange by using content based information retrieval and reduction methods as well as media specific queries within the database system in order to reduce the amount of data to be transferred. All these methods are influenced by contexts like local resources, available communication channels, and user preferences.
Locally-adaptive and memetic evolutionary pattern search algorithms
Authors: William E. Hart
Venue: Evolutionary Computation (2003)

Recent convergence analyses of evolutionary pattern search algorithms (EPSAs) have shown that these methods have a weak stationary point convergence theory for a broad class of unconstrained and linearly constrained problems. This paper describes how the convergence theory for EPSAs can be adapted to allow each individual in a population to have its own mutation step length (similar to the design of evolutionary programing and evolution strategies algorithms). These are called locally-adaptive EPSAs (LA-EPSAs) since each individual's mutation step length is independently adapted in different local neighborhoods. The paper also describes a variety of standard formulations of evolutionary algorithms that can be used for LA-EPSAs. Further, it is shown how this convergence theory can be applied to memetic EPSAs, which use local search to refine points within each iteration.
Enlarged-Maximum-Scannable-Groups for Real-Time Disk Scheduling in a Multimedia System
Authors: Hsung-Pin Chang, Ruei-Chuan Chang, Ray-I Chang, Wei Kuan Shih
Venue: 24th International Computer Software and Applications Conference (2000)

In a multimedia system, disk I/O subsystem is the most important component due to its relatively limited throughput and large delay. Previously, by applying SCAN to reschedule tasks having the same deadline, SCAN-EDF tries to improve disk throughput while real-time constraints can be satisfied. In DM-SCAN, groups of tasks that can be successfully rescheduled by SCAN under specified real-time requirements are identified. They are called MSGs (maximum-scannable-groups). In this paper, an enlarged-MSG (E-MSG) is proposed to further expand the MSG concept and thus to obtain more improvement in disk throughput. By removing some excess constraints on MSG, E-MSG merges several MSGs as a new scannable group. Experiment results show that the E-MSG scheme is better than both SCAN-EDF and MSG in the disk throughput obtained.
An Integrated Labor-Management System for Taco Bell
Authors: Jackie Hueter, William Swart
Venue: Interfaces (1998)

Taco Bell Corporation has approximately 6,490 company-owned, licensed, and franchised locations in 50 states and a growing international market. Worldwide yearly sales are approximately $4.6 billion. In 1988, Taco Bell introduced six core-menu items for the reduced price of 59 cents and offered free drink refills. Taco Bell has since continued to change and innovate. Its new strategy meant restructuring the business to become more efficient and cost-effective. To do this, the company relied on an integrated set of operations research models, including forecasting to predict customer arrivals, simulation to determine the optimum labor required to provide desired customer service, and optimization to schedule and allocate crew members to minimize payroll. Through 1997, these models have saved over $53 million in labor costs.
Circuit power estimation using pattern recognition techniques
Authors: Lipeng Cao
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This paper proposes a circuit power estimation method using Bayesian inference and neural networks. Based on statistical distribution of circuit leakage power and switching energy, the entire state and transition space of a circuit are classified using neural networks into a limited few classes that represent different power consumption average values. This technique enables efficient table-lookup of circuit power of the entire state and transition space. Theoretical basis of Bayesian inference, feature extraction for neural networks of circuit leakage power and switching energy are discussed. Experiments on a wide range of circuit topologies demonstrated the robustness of the proposed method for estimating circuit leakage power of all possible states and switching energy of all possible transitions.
A universal cellular automaton in the hyperbolic plane
Authors: Francine Herrmann, Maurice Margenstern
Venue: Theoretical Computer Science (2003)

The paper gives the construction of a universal CA with 22 states in the regular rectangular pentagonal grid of the hyperbolic plane. The CA implements a railway circuit which simulates a register machine and which improves a bit already known railway simulations of a Turing machine.
The Illusion of Leadership: Misattribution of Cause in Coordination Games
Authors: Roberto Weber, Colin Camerer, Yuval Rottenstreich, Marc Knez
Venue: Organization Science (2001)

This paper reports the results of experiments which examine attributions of leadership quality. Subjects played an abstract coordination game which is like many organizational problems. Previous research showed that when larger groups play the game, they rarely coordinate on the Pareto-optimal (efficient) outcome, but small groups almost always coordinate on the efficient outcome. After two or three periods of playing the game, one subject who was randomly selected from among the participants to be the "leader" for the experiment was instructed to make a speech exhorting others to choose the efficient action. Based on previous studies, we predicted that small groups would succeed in achieving efficiency but that large groups would fail. Based on social psychological studies of the fundamental attribution error, we predicted that the subjects would underestimate the strength of the situational effect (group size) and attribute cause to personal traits of the leaders instead--leaders would be credited for the success of the small groups, and blamed for the failure of the large groups. This hypothesis proved true: Subjects attributed differences in outcomes between conditions to differences in the effectiveness of leaders. In a second experiment, subjects voted to replace the leaders more frequently in the large-group condition (at a small cost to themselves), showing that misattributions of leadership ability also affect actual behavior by subjects. Previous research has demonstrated a tendency to credit or blame leaders for unusual performance. The difference in our study is that subjects should be blaming a structural condition--the size of the group--but they blame the leaders instead. Thus, our experiment is the first to establish a mistaken illusion of leadership.
Identifying the NCAA Tournament "Dance Card"
Authors: B. Jay Coleman, Allen K. Lynch
Venue: Interfaces (2001)

The NCAA Basketball Tournament selection committee annually selects the Division I men's teams that should receive at-large bids to the national championship tournament. Although its deliberations are shrouded in secrecy, the committee is supposed to consider a litany of team-performance statistics, many of which outsiders can reasonably estimate. Using a probit analysis on objective team data from 1994 through 1999, we developed an equation that accurately classified nearly 90 percent of 249 "bubble" teams during that time frame and over 85 percent for the 2000 tournament. Given the NCAA Tournament's nickname of the big dance, the equation is effectively the "dance card" that determined whether a team got an invitation from past committees and is also a tool that could aid decision making for future committees. The accuracy of the dance card, and the factors and weights included in it, suggest that the committee is fairly predictable in its decisions, despite barbs from fans, teams, and the media.