ppxscal/embedding_network huggingface dataset:
Order Allocation for Stock Cutting in the Paper Industry
Authors: Syam Menon, Linus Schrage
Venue: Operations Research (2002)

A common problem encountered in paper-production facilities is that of allocating customer orders to machines so as to minimize the total cost of production. It can be formulated as adual-angular integer program, with identical machines inducing symmetry. While the potential advantages of decomposing large mathematical programs into smaller subproblems have long been recognized, the solution of decomposableinteger programs remains extremely difficult. Symmetry intensifies the difficulty. This paper develops an approach, based on the construction of tight subproblem bounds, to solve decomposable dual-angular integer programs and successfully applies it to solve the problem from the paper industry. This method is of particular interest as it significantly reduces the impact of symmetry.
Input Distribution Selection for Simulation Experiments: Accounting for Input Uncertainty
Authors: Stephen E. Chick
Venue: Operations Research (2001)

A number of authors have identified problematic issues with techniques used in current simulation practice for selecting probability distributions and their parameters for input to stochastic simulations. A major goal of this paper is to address some of those issues by presenting a self-consistent evaluation of the uncertainty about the mean value of the simulation output, when there is uncertainty in both the parameters and functional form of input distributions (structural uncertainty), and uncertainty due to the stochastic nature of simulation output (stochastic uncertainty), as is common in simulation practice. The analysis leads to an algorithm for randomly sampling input distributions and parameters before each simulation replication, using a Bayesian posterior distribution for input distributions and parameters, given historical data. Mechanisms for addressing issues of importance to the discrete-event simulation community are illustrated by example, such as the specification of prior distributions, and analysis for shifted distributions.
Interval analysis and fuzzy set theory
Authors: Ramon Moore, Weldon Lodwick
Venue: Fuzzy Sets and Systems (2003)

An overview of interval analysis, its development, and its relationship to fuzzy set theory is given. Possible areas of further fruitful research are highlighted.
Business Intelligence Roadmap: The Complete Project Lifecycle for Decision-Support Applications
Authors: Larissa Terpeluk Moss, Shaku Atre
Venue:  (2003)

:"If you are looking for a complete treatment of business intelligence, then go no further than this book. Larissa T. Moss and Shaku Atre have covered all the bases in a cohesive and logical order, making it easy for the reader to follow their line of thought. From early design to ETL to physical database design, the book ties together all the components of business intelligence."--Bill Inmon, Inmon EnterprisesBusiness Intelligence Roadmap is a visual guide to developing an effective business intelligence (BI) decision-support application. This book outlines a methodology that takes into account the complexity of developing applications in an integrated BI environment. The authors walk readers through every step of the process--from strategic planning to the selection of new technologies and the evaluation of application releases. The book also serves as a single-source guide to the best practices of BI projects.Part I steers readers through the six stages of a BI project: justification, planning, business analysis, design, construction, and deployment. Each chapter describes one of sixteen development steps and the major activities, deliverables, roles, and responsibilities. All technical material is clearly expressed in tables, graphs, and diagrams. Part II provides five matrices that serve as references for the development process charted in Part I. Management tools, such as graphs illustrating the timing and coordination of activities, are included throughout the book. The authors conclude by crystallizing their many years of experience in a list of dos, don'ts, tips, and rules of thumb. The accompanying CD-ROMincludes a complete, customizable work breakdown structure.Both the book and the methodology it describes are designed to adapt to the specific needs of individual stakeholders and organizations. The book directs business representatives, business sponsors, project managers, and technicians to the chapters that address their distinct responsibilities. The framework of the book allows organizations to begin at any step and enables projects to be scheduled and managed in a variety of ways.Business Intelligence Roadmap is a clear and comprehensive guide to negotiating the complexities inherent in the development of valuable business intelligence decision-support applications. 0201784203B02112003
Web-based discrete event simulation models: current states and possible futures
Authors: Jasna Kuljis, Ray J. Paul
Venue: Simulation and Gaming (2003)

Environments and languages for Web-based simulation, particularly Java-based approaches, are reviewed. Some Web-based applications are mentioned. A summary of the current state forms the basis for discussing the future of simulation modeling on the Web. The future directions of Web-based simulation range from the traditional to the revolutionary, with the revolution coming from new blood into the simulation profession.
Is the relationship between numbers of references and paper lengths the same for all sciences?
Authors: Helmut A. Abt, Eugene Garfield
Venue: Journal of the American Society for Information Science and Technology (2002)

In each of 41 research journals in the physical, life, and social sciences there is a linear relationship between the average number of references and the normalized paper lengths. For most of the journals in a given field, the relationship is the same within statistical errors. For papers of average lengths in different sciences the average number of references is the same within ±17%. Because papers of average lengths in various sciences have the same number of references, we conclude that the citation counts to them can be intercompared within that accuracy. However, review journals are different: after scanning 18 review journals we found that those papers average twice the number of references as research papers of the same lengths.
A Multi-User 3-D Virtual Environment with Interactive Collaboration and Shared Whiteboard Technologies
Authors: Wing Ho Leung, Tsuhan Chen
Venue: Multimedia Tools and Applications (2003)

A multi-user 3-D virtual environment allows remote participants to have a transparent communication as if they are communicating face-to-face. The sense of presence in such an environment can be established by representing each participant with a vivid human-like character called an avatar. We review several immersive technologies, including directional sound, eye gaze, hand gestures, lip synchronization and facial expressions, that facilitates multimodal interaction among participants in the virtual environment using speech processing and animation techniques. Interactive collaboration can be further encouraged with the ability to share and manipulate 3-D objects in the virtual environment. A shared whiteboard makes it easy for participants in the virtual environment to convey their ideas graphically. We survey various kinds of capture devices used for providing the input for the shared whiteboard. Efficient storage of the whiteboard session and precise archival at a later time bring up interesting research topics in information retrieval.
Local logics for traces
Authors: Igor Walukiewicz
Venue: Journal of Automata, Languages and Combinatorics (2001)

The µ-calculus over dependence graph representation of traces is considered. It is shown that the plain µ-calculus cannot express all monadic second-order (MSO) properties of dependence graphs. Several extensions of the µ-calculus are presented and it is proved that these extensions are equivalent in expressive power to MSO logic. The satisfiability problem for these extensions is PSPACE-complete.
A Hybrid Collocation Method for Volterra Integral Equations with Weakly Singular Kernels
Authors: Yanzhao Cao, Terry Herdman, Yuesheng Xu
Venue: SIAM Journal on Numerical Analysis (2003)

The commonly used graded piecewise polynomial collocation method for weakly singular Volterra integral equations may cause serious round-off error problems due to its use of extremely nonuniform partitions and the sensitivity of such time-dependent equations to round-off errors. The singularity preserving (nonpolynomial) collocation method is known to have only local convergence. To overcome the shortcoming of these well-known methods, we introduce a hybrid collocation method for solving Volterra integral equations of the second kind with weakly singular kernels. In this hybrid method we combine a singularity preserving (nonpolynomial) collocation method used near the singular point of the derivative of the solution and a graded piecewise polynomial collocation method used for the rest of the domain. We prove the optimal order of global convergence for this method. The convergence analysis of this method is based on a singularity expansion of the exact solution of the equations. We prove that the solutions of such equations can be decomposed into two parts, with one part being a linear combination of some known singular functions which reflect the singularity of the solutions and the other part being a smooth function. A numerical example is presented to demonstrate the effectiveness of the proposed method and to compare it to the graded collocation method.
Feature Article: Optimization for simulation: Theory vs. Practice
Authors: Michael C. Fu
Venue: INFORMS Journal on Computing (2002)

Probably one of the most successful interfaces between operations research and computer science has been the development of discrete-event simulation software. The recent integration of optimization techniques into simulation practice, specically into commercial software, has become nearly ubiquitous, as most discrete-event simulation packages now include some form of ?optimization? routine. The main thesis of this article, how-ever,is that there is a disconnect between research in simulation optimization--which has addressed the stochastic nature of discrete-event simulation by concentratingon theoretical results of convergence and specialized algorithms that are mathematically elegant--and the recent software developments, which implement very general algorithms adopted from techniques in the deterministic optimization metaheuristic literature (e.g., genetic algorithms, tabu search, artificial neural networks). A tutorial exposition that summarizes the approaches found in the research literature is included, as well as a discussion contrasting these approaches with the algorithms implemented in commercial software. The article concludes with the author's speculations on promising research areas and possible future directions in practice.
Integrating mathematica with C++ for the development of a computational geometry problem solver
Authors: Mufid Abudiab, Michael Starek
Venue: Journal of Computing Sciences in Colleges (2003)

Mathematica employs a communication protocol called MathLink to interact with external programs written in programming languages such as C, C++, and others. MathLink allows Mathematica to be integrated with other packages like Robotica, Prolog, and Discover. This integration process is triggered by the flexibility and usability of outside languages and packages and the computing power and pre-developed algorithms and functions of Mathematica. Several areas of application like Robot Kinematics, Algebraic Modeling, and Geometry have been enriched by this development. This paper describes how C++ and Math Link Library were utilized to develop an external front end that interfaces with Mathematica's computational geometry package. By creating an environment that provides direct access to Mathematica's computational geometry package, the system can be used as a flexible tool that can aid scientists and users alike in solving vast range of problems concerned with the spatial relationship of data.
Globally convergent algorithms for nonsmooth nonlinear equations in computational fluid dynamics
Authors: T. Coffey, R. J. McMullan, C. T. Kelley, D. S. McRae
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper we report on a computational study in which a nonsmooth discretization of the Euler equations for flow in a nozzle is solved with splitting method which is in turn globalized with the method of pseudo-transient continuation.
Determination of the bases of a splitting matroid
Authors: M. M. Shikare, Ghodratollah Azadi
Venue: European Journal of Combinatorics (2003)

In Discrete Math. 184 (1998) 267, the authors extended the splitting operation of graphs to binary matroids. In this paper, we characterize the set of bases of a splitting matroid and give some of its applications.
Galois connections and fixed point calculus
Authors: Roland Backhouse
Venue: Algebraic and coalgebraic methods in the mathematics of program construction (2002)

Fixed point calculus is about the solution of recursive equations defined by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of fixed point calculus together with a number of applications of direct relevance to the construction of computer programs. The tutorial also summarises the theory and application of Galois connections between partially ordered sets. In particular, the intimate relation between Galois connections and fixed point equations is amply demonstrated.
Disjunctive optimization, max-separable problems and extremal algebras
Authors: Karel Zimmermann
Venue: Theoretical Computer Science (2003)

The paper was motivated by solution methods suggested in the literature for solving linear optimization problems over (max,+)- or (max, min)-algebras and certain class of so called max-separable optimization problems. General features of these optimization problems, which play a crucial role in the optimization methods were used to formulate a general class of optimization problems with disjunctive constraints and a max-separable objective function and suggest a solution procedure for solving such problems. Linear problems over (max, +)-algebras and the max-separable problems are contained in this general class of optimization problems as special cases.
Practice Abstract
Authors: Moshe Shaked, Fabio Spizzichino, Donald L. Keefer
Venue: Interfaces (1998)

Practice Abstracts carries short reports of specific current or recent OR/MS projects. Often these reports are based on existing documents, such as internal reports or company newsletters. We hope that these abstracts will be accessible, interesting, and valuable to practitioners in other organizations. Contributions should be sent for evaluation to the editor of Practice Abstracts, Donald L. Keefer, Department of Management, Arizona State University, Box 874006, Tempe Arizona 85287-4006 [Don.Keefer@ASU.EDU].
Protecting Mobile Code in the Wild
Authors: John Zachary
Venue: IEEE Internet Computing (2003)

Mobile code systems could be the next-generation distributed programming paradigm, but that first requires security mechanisms for protecting them against malicious actions by remote hosts.
Humor modeling in the interface
Authors: Anton Nijholt, Oliviero Stock, Alan Dix, John Morkes
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Humor is a multi-disciplinary field of research. People have been working on humor in many fields of research, such as psychology, philosophy and linguistics, sociology and literature. Especially in the context of computer science humor research aims at modeling humor in a computationally tractable way. Having computational models of humor allows interface designers to have the computer generate and interpret humor when interacting with users.In different studies it has been shown that humans respond in the same way to computers as they do to persons with respect to psychosocial phenomena such as personality, politeness, flattery, and in-group favoritism. Making use of this paradigm we may investigate a similar role to be played in human-computer interaction for various types of humor use and we can see whether the regulating and social-psychological aspects of humor can play positive roles in human-computer interaction.
Shape - a Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs
Authors: Raymond K.-M. Cheung, Warren B. Powell
Venue: Operations Research (2000)

We consider the problem of approximating the expected recourse function for two-stage stochastic programs. Our problem is motivated by applications that have special structure, such as an underlying network that allows reasonable approximations to the expected recourse function to be developed. In this paper, we show how these approximations can be improved by combining them with sample gradient information from the true recourse function. For the case of strictly convex nonlinear approximations, we prove convergence for this hybrid approximation. The method is attractive for practical reasons because it retains the structure of the approximation.
The Global Configuration of a Speculative Trading Operation: An Empirical Study of Foreign Exchange Trading
Authors: Elaine Mosakowski, Srilata Zaheer
Venue: Organization Science (1999)

This paper proposes a theory of firm boundaries based on fore-knowledge development and exploitation in speculative or "informed" trading. Foreign exchange trading provides this study's empirical context. From research on information economics, we suggest optimal speculative trading operations are multiunit and globally dispersed. Alternatively, transaction cost economics suggests atomistic actors prevail in the market for fungible commodities like currencies. We also develop competing hypotheses about information technology's effects on foreign exchange trading operations. Speculation arguments predict that the global scope of trading operations will expand after the introduction of generic information technologies. Transaction cost economics proposes that, when atomistic actors do not prevail, trading operations will contract after this introduction. We test competing predictions with models of the expansion, contraction, and net change in a firm's global dispersion. We estimate these models with data from the population of banks worldwide engaged in interbank foreign exchange currency (FX) trading from 1974 to 1993. Our results uncover two types of firms: those that approach the atomistic actor of transaction cost economics, and those that resemble the globally dispersed multiunit configuration from our speculation discussion. These results encourage reflection on how the theory of the firm differs when firms trade to produce versus speculate.
Merging the Bramble-Pasciak-Steinbach and the Crouzeix-Thomé criterion for H1-stability of the L2-projection onto finite element spaces
Authors: Carsten Carstensen
Venue: Mathematics of Computation (2002)

Suppose S ⊂ H1(Ω) is a finite-dimensional linear space based on a triangulation T of a domain Ω, and let Π : L2(Ω) → L2 (Ω) denote the L2-projection onto S. Provided the mass matrix of each element T ∈ T and the surrounding mesh-sizes obey the inequalities due to Bramble, Pasciak, and Steinbach or that neighboring element-sizes obey the global growth-condition due to Crouzeix and Thomée, Π is H1-stable: For all u ∈ H1 (Ω) we have ||Πu||H1 (Ω) ≤ C ||u||H1 (Ω) with a constant C that is independent of, e.g., the dimension of S.This paper provides a more flexible version of the Bramble-Pasciak-Steinbach criterion for H1-stability on an abstract level. In its general version, (i) the criterion is applicable to all kind of finite element spaces and yields, in particular, H1-stability for nonconforming schemes on arbitrary (shape-regular) meshes; (ii) it is weaker than (i.e., implied by) either the Bramble-Pasciak-Steinbach or the Crouzeix-Thomée criterion for regular triangulations into triangles; (iii) it guarantees H1-stability of Π a priori for a class of adaptively-refined triangulations into right isosceles triangles.
Dynamic agent population in agent-based distance vector routing
Authors: Kaizar A. Amin, Armin R. Mikler
Venue: Second international workshop on Intelligent systems design and application (2002)

The Intelligent Mobile Agent paradigm can be applied to a wide variety of intrinsically parallel and distributed applications. Network routing is one such application that can be mapped to an agent-based approach. The performance of any agent-based system will depend on its agent population. Although a significant amount of research has been conducted on mobile agent-based systems, little consideration has been given to the importance of agent population in dynamic networks. A large number of constituent agents can consume considerable amounts of network resources, thereby impeding the overall performance of the network. Hence, it is imperative to have a control mechanism whereby the agent population can be adjusted in a distributed manner to balance the resource overhead in the network. This paper briefly discusses an agent-based approach to Distance Vector Routing, referred as Agent-based Distance Vector Routing. It also describes a framework for an adaptive approach to control the number of agents in the network using pheromones and discusses its limitations.
A discrete model for histogram shaping
Authors: S. M. Tabirca, I. Pitt, D. Murphy
Venue: Smarandache notions (2002)

The aim of this article is to present a discrete model for histogram shaping. This is an important image transformation with several practical applications. The model that is proposed is based on a generalization of the inferior part function. Finally, an algorithm based on this model is developed.
Group Polarization and Computer-Mediated Communication: Effects of Communication Cues, Social Presence, and Anonymity
Authors: Choon-Ling Sia, Bernard C. Y. Tan, Kwok-Kee Wei
Venue: Information Systems Research (2002)

Group polarization is the tendency of people to become more extreme in their thinking following group discussion. It may be beneficial to some, but detrimental to other, organizational decisions. This study examines how computer-mediated communication (CMC) may be associated with group polarization. Two laboratory experiments were carried out. The first experiment, conducted in an identified setting, demonstrated that removal of verbal cues might not have reduced social presence sufficiently to impact group polarization, but removal of visual cues might have reduced social presence sufficiently to raise group polarization. Besides confirming the results of the first experiment, the second experiment showed that the provision of anonymity might also have reduced social presence sufficiently to raise group polarization. Analyses of process data from both experiments indicated that the reduction in social presence might have increased group polarization by causing people to generate more novel arguments and engage in more one-upmanship behavior. Collectively, process and outcome data from both experiments reveal how group polarization might be affected by level of social presence. Specifically, group discussion carried out in an unsupported setting or an identified face-to-face CMC setting tends to result in weaker group polarization. Conversely, group discussion conducted in an anonymous face-to-face CMC setting or a dispersed CMC setting (with or without anonymity) tends to lead to stronger group polarization. Implications of these results for further research and practice are provided.