ppxscal/embedding_network huggingface dataset:
On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance
Authors: Warren B. Powell, Michael T. Towns, Arun Marar
Venue: Transportation Science (2000)

The most common approach for modeling and solving routing and scheduling problems in a dynamic setting is to solve, as close to optimal as possible, a series of deterministic, myopic models. The argument is most often made that, if the data changes, then we should simply reoptimize. We use the setting of the load matching problem that arises in truckload trucking to compare the value of optimal myopic solutions versus varying degrees of greedy, suboptimal myopic solutions in the presence of three forms of uncertainty: customer demands, travel times, and, of particular interest, user noncompliance. A simulation environment is used to test different dispatching strategies under varying levels of system dynamism. An important issue we consider is that of user noncompliance, which is the effect of optimizing when users do not adopt all of the recommendations of the model. Our results show that (myopic) optimal solutions only slightly outperform greedy solutions under relatively high levels of uncertainty, and that a particular suboptimal solution actually outperforms optimal solutions under a wide range of conditions.
Reduction of errors due to source and meter in the nonlinearity test
Authors: Luke S. L. Hsieh
Venue: Proceedings of the 1998 IEEE International Test Conference (1998)

Nonlinearity test is required for manyproducts of various applications, such as in consumer,and is dtfjcult to test when sources and meters arenonlinear. A novel method using digital signalprocessing (DSP) techniques is presented to reducethe errors introduced by nonlinear source and meter.It uses the Taylor series representation to model thenonlinearity of source, meter, and device under test(DUT). The nonlinearity coeficients of the overallstages are distorted by the nonlinear source andmeter. These coeficients can be corrected by thenonlinearity coefJicients with the DUT bypassed;accordingly the errors introduced by the nonlinearsource and meter are minimized.
Computer science meets economics
Authors: Ubiquity staff
Venue: Ubiquity (2002)

Yale's Joan Feigenbaum talks about the possibilities for interdisciplinary research, the new field of algorithmic mechanism design, and her radical views on security.
A Minimal Algorithm for the Bounded Knapsack Problem
Authors: David Pisinger
Venue: INFORMS Journal on Computing (2000)

The Bounded Knapsack Problem (BKP) is a generalization of the 0-1 Knapsack Problem where a bounded amount of each item type is available. Currently, the most efficient algorithm for BKP transforms the data instance to an equivalent 0-1 Knapsack Problem, which is solved efficiently through a specialized algorithm. However, this paper demonstrates that the transformation introduces many similarly weighted items, resulting in very hard instances of the 0-1 Knapsack Problem.To avoid these problems, we propose a specialized algorithm that solves an expanding core problem through dynamic programming such that the number of enumerated item types is minimal. Sorting and reduction is done by need, resulting in very little effort for the preprocessing. Compared to other algorithms for BKP, the presented algorithm uses tighter reductions and enumerates considerably less item types. Computational experiments are presented, showing that the presented algorithm outperforms all previously published algorithms for BKP.
Conflict and politics and information systems failure: a challenge for information systems professionals and researchers
Authors: Leoni Warne
Venue: Socio-technical and human cognition elements of information systems (2003)

Managing the power, politics and organizational conflict inherent in information systems is increasingly recognized as being of critical importance to successful information systems development. The focus of this chapter is the extent to which conflict among participants in an information systems development may be said to contribute to project failure. The chapter describes a research study that explores the nature of conflict in an information systems development and the extent to which conflict may be perceived to impact on the successful progress of a project. In particular, the study was designed to determine which type of conflict (i.e., conflict between which type of stakeholders) may pose the most risk to an information systems development and to determine to what extent conflict can be said to be a contributing factor to information systems failure.The study was structured into three distinct stages. The first stage was a major case study conducted to explore the nature of conflict in a prematurely terminated information systems development and to probe the extent to which conflict was perceived to pose a risk to information systems projects. The second stage involved surveying IT Managers to test the wider applicability of the case study findings. The third and final stage involved developing a predictive model of conflict showing the relative weighting of each of the variables investigated, using logistic regression. The most significant outcome of the study was that information systems developments can be detrimentally affected by the impact of conflict among users who have commissioned or will use the system. Managing and resolving conflict in an information systems environment is clearly a difficult, challenging and time-consuming exercise, but the findings of this research study suggest that the rewards, in terms of higher success rates, should be worth the commitment.
Scheduling a Major College Basketball Conference
Authors: George L. Nemhauser, Michael A. Trick
Venue: Operations Research (1998)

The nine universities in the Atlantic Coast Conference (ACC) have a basketball competition in which each school plays home and away games against each other over a nine-week period. The creation of a suitable schedule is a very difficult problem with a myriad of conflicting requirements and preferences. We develop an approach to scheduling problems that uses a combination of integer programming and enumerative techniques. Our approach yields reasonable schedules very quickly and gave a schedule that was accepted by the ACC for play in 1997-1998.
Hedging Derivative Securities and Incomplete Markets: An e-Arbitrage Approach
Authors: Dimitris Bertsimas, Leonid Kogan, Andrew W. Lo
Venue: Operations Research (2001)

Given a European derivative security with an arbitrary payoff function and a corresponding set of underlying securities on which the derivative security is based, we solve the optimal-replication problem: Find a self-financing dynamic portfolio strategy--involving only the underlying securities--that most closely approximates the payoff function at maturity. By applying stochastic dynamic programming to the minimization of a mean-squared error loss function under Markov-state dynamics, we derive recursive expressions for the optimal-replication strategy that are readily implemented in practice. The approximation error or "e" of the optimal-replication strategy is also given recursively and may be used to quantify the "degree" of market incompleteness. To investigate the practical significance of these e-arbitrage strategies, we consider several numerical examples, including path-dependent options and options on assets with stochastic volatility and jumps.
Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
Authors: Yang Dai, Sunyoung Kim, Masakazu Kojima
Venue: Journal of Computational and Applied Mathematics (2003)

All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 11. We exploit two types of symmetric structures in the cyclic-n polynomial to compute all isolated nonsingular solutions of the equations efficiently by the polyhedral homotopy continuation method and to verify the correctness of the generated approximate solutions. Numerical results on the cyclic-8 to the cyclic-12 polynomial equations, including their solution information, are given.
Quantifiable data mining using ratio rules
Authors: Flip Korn, Alexandros Labrinidis, Yannis Kotidis, Christos Faloutsos
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

Association Rule Mining algorithms operate on a data matrix (e.g., customers $\times$ products) to derive association rules [AIS93b, SA96]. We propose a new paradigm, namely, Ratio Rules, which are quantifiable in that we can measure the &ldquo;goodness&rdquo; of a set of discovered rules. We also propose the &ldquo;guessing error&rdquo; as a measure of the &ldquo;goodness&rdquo;, that is, the root-mean-square error of the reconstructed values of the cells of the given matrix, when we pretend that they are unknown. Another contribution is a novel method to guess missing/hidden values from the Ratio Rules that our method derives. For example, if somebody bought $10 of milk and $3 of bread, our rules can &ldquo;guess&rdquo; the amount spent on butter. Thus, unlike association rules, Ratio Rules can perform a variety of important tasks such as forecasting, answering &ldquo;what-if&rdquo; scenarios, detecting outliers, and visualizing the data. Moreover, we show that we can compute Ratio Rules in a single pass over the data set with small memory requirements (a few small matrices), in contrast to association rule mining methods which require multiple passes and/or large memory. Experiments on several real data sets (e.g., basketball and baseball statistics, biological data) demonstrate that the proposed method: (a) leads to rules that make sense; (b) can find large itemsets in binary matrices, even in the presence of noise; and (c) consistently achieves a &ldquo;guessing error&rdquo; of up to 5 times less than using straightforward column averages.
A comparison of student outcomes with and without teacher facilitated computer-based instruction
Authors: Jack V. Powell, Victor G. Aeby,  Jr., Tracy Carpenter-Aeby
Venue: Computers Education (2003)

The SuccessMaker computer-based instructional package can be used to improve the academic outcomes of disruptive students when intervention is teacher facilitated. Over a 2-year period, 215 participants identified as disruptive student were involved in a naturalistic quasi-experimental design in which independent sample t-tests were employed to determined differences between comparisons (Group I) and interventions (Group II) on psychosocial and academic measures. A significant difference (P> 0.05) was found between Group I and Group II on locus of control and grade point average at the end of the first grading period subsequent to the intervention. The difference in grade point averages was suspected to be attributed to the average amount of time spent on two curriculum areas, math and science, within the 14 academic areas that comprise the SuccessMaker computerized program. Evidence from this study provides hope that teacher facilitation with computer-based instruction (CBI) may be the key to improving locus of control and grade point averages of disruptive students.
The metamorphosis to dynamic trading networks and virtual corporations
Authors: Howard D. Richards, Harris G. Makatsoris
Venue: Managing virtual web organizations in the 21st century: issues and challenges (2002)

A process of turbulent change is taking place in which companies shape up to deal with the unremitting global competition for which there is an uncertain outcome. Businesses have to look at the wider horizons and dynamics of both their supply chains and markets to discover new ways of working with both customers and suppliers to grow and remain viable. The diverse industrial, commercial and operational practices and processes need to be remolded and target the collaborative aspects of relationships to the advantage of company performance and creation of new opportunities. This chapter outlines some of the constraining forces and suggests the parameters in which a business strategy and a course of action can be devised as a pathway to the future.
A numerical approximation to the solution of a nonlocal obstacle thermistor problem
Authors: Walter Allegretto Yanping Lin Shuqing Ma
Venue: Scientific computing and applications (2001)

In this paper we construct a box scheme for a nonlocal obstacle problem which arises from the thermistor microsensor model. The box method is characterized by a trial space consisting of continuous piecewise linear polynomials on a quasiuniform triangulation and by a test space consisting of piecewise constants on a circumcenter dual box mesh. The existence and uniqueness of the numerical system are obtained and an optimal H1-norm error estimate is achieved.
Emotions in Humans and Artifacts
Authors: Robert Trappl, Sabine Payr, Paolo Petta
Venue:  (2003)

:Emotions have been much studied and discussed in recent years. Most books, however, treat only one aspect of emotions, such as emotions and the brain, emotions and well-being, or emotions and computer agents. This interdisciplinary book presents recent work on emotions in neuroscience, cognitive science, philosophy, computer science, artificial intelligence, and software and game development. The book discusses the components of human emotion and how they might be incorporated into machines, whether artificial agents should convey emotional responses to human users and how such responses could be made believable, and whether agents should accept and interpret the emotions of users without displaying emotions of their own. It also covers the evolution and brain architecture of emotions, offers vocabularies and classifications for defining emotions, and examines emotions in relation to machines, games, virtual worlds, and music.
Middleware for the use of storage in communication
Authors: Micah Beck, Dorian Arnold, Alessandro Bassi, Fran Berman, Henri Casanova, Jack Dongarra, Terry Moore, Graziano Obertelli, James Plank, Martin Swany, Sathish Vadhiyar, Rich Wolski
Venue: Parallel Computing (2002)

The Logistical Computing and Internetworking (LoCI) project is a reflection of the way that the next generation internetworking fundamentally changes our definition of high performance wide area computing. A key to achieving this aim is the development of middleware that can provide reliable, flexible, scalable, and cost-effective delivery of data with quality of service guarantees to support high performance applications of all types. The LoCI effort attacks this problem with a simple but innovative strategy. At the base of the LoCI project is a richer view of the use of storage in communication and information sharing.
Component Sharing in the Management of Product Variety: a Study of Automotive Braking Systems
Authors: Marshall Fisher, Kamalini Ramdas, Karl Ulrich
Venue: Management Science (1999)

Product variety in many industri es has increased steadily throughout this century. Component sharing-using the same version of a component across multiple products-is increasingly viewed by companies as a way to offer high variety in the marketplace while retaining low variety in their operations. Yet, despite the popularity of component sharing in industry, little is known about how to design an effective component-sharing strategy or about the factors that influence the success of such a strategy. In this paper we critically examine component sharing using automotive front brakes as an example. We consider three basic questions: (1) What are the key drivers and trade-offs of component-sharing decisions? (2) How much variation exists in actual component-sharing practice? and (3) How can this variation be explained? To answer these questions, we develop an analytic model of component sharing and show through empirical testing that this model explains much of the variation in sharing practice for automotive braking systems. We find that the optimal number of brake rotors is a function of the range of vehicle weights, sales volume, fixed component design and tooling costs, variable costs, and the variation in production volume across the models of the product line. We conclude with a discussion of the general managerial implications of our findings.
Comparing the Effectiveness of Various Bayesian X Control Charts
Authors: George Tagaras, Yiannis Nikolaidis
Venue: Operations Research (2002)

In an attempt to improve the procedures for statistical process control many researchers have developed and proposed a variety of adaptive control charts in the last decade. The common characteristic of those charts is that one or more of the chart parameters (sampling interval, sample size,control limits) is allowed to change during operation, taking into account current sample information. Due to their flexibility, adaptive charts are more effective than their static counterparts but they are also more complex in terms of implementation. The purpose of this paper is to evaluate the economic performance of various adaptive control schemes to derive conclusions about their relative effectiveness. The analysis concentrates on Bayesian control charts used for monitoring the process mean in finite production runs. We present dynamic programming formulations and properties of the optimal solutions, which we then use to solve a number of numerical examples. The results from our comparative numerical study indicate that the chart parameter having the most positive impact on the economic performance by being adaptive is the sampling interval. It is therefore sufficient in most cases to use control charts with adaptive sampling intervals rather than other types of partially adaptive charts or the more complicated fully adaptive control charts.
Congestion control performance of R-DSDV protocol in multihop wireless ad hoc networks
Authors: Azzedine Boukerche, Sajal K. Das
Venue: Wireless Networks (2003)

Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.
A framework for opportunistic scheduling in wireless networks
Authors: Xin Liu, Edwin K. P. Chong, Ness B. Shroff
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We present a method, called opportunistic scheduling, for exploiting the time-varying nature of the radio environment to increase the overall performance of the system under certain quality of service/fairness requirements of users. We first introduce a general framework for opportunistic scheduling, and then identify three general categories of scheduling problems under this framework. We provide optimal solutions for each of these scheduling problems. All the proposed scheduling policies are implementable online; we provide parameter estimation algorithms and implementation procedures for them. We also show how previous work by us and others directly fits into or is related to this framework. We demonstrate via simulation that opportunistic scheduling schemes result in significant performance improvement compared with non-opportunistic alternatives.
Perfect simulation of positive Gaussian distributions
Authors: Anne Philippe, Christian P. Robert
Venue: Statistics and Computing (2003)

We provide an exact simulation algorithm that produces variables from truncated Gaussian distributions on (\Bbb R+)p via a perfect sampling scheme, based on stochastic ordering and slice sampling, since accept-reject algorithms like the one of Geweke (1991) and Robert (1995) are difficult to extend to higher dimensions.
Race-Related Differences in Promotions and Support: Underlying Effects of Human and Social Capital
Authors: Erika Hayes James
Venue: Organization Science (2000)

This study examined two alternative explanations for disparity in reported work-related experiences and outcomes between black and white managers: treatment discrimination because of race, and differences in human and social capital. Education and training, representing human capital, and racial similarity of network ties and proportion of strong ties, representing social capital, were used to predict whether human and social capital would mediate the relationship between race and the work-related experiences and outcomes under investigation.Results of a survey of black and white managers in a Fortune 500 financial services firm indicate that black managers reported a slower rate of promotion and less psychosocial support than white managers. Race had both a direct and an indirect effect on these outcomes. Participation in company training significantly predicted reported promotion rates, but race remained a significant predictor. Additional analysis revealed that race moderates the relationship between human capital and promotion rate and suggests a type of treatment discrimination against blacks. Contrary to predictions, social capital did not predict promotion rate, although social capital mediated the relationship between race and psychosocial support. Black managers reported having less social capital than whites, and social capital, in turn, was positively related to the receipt of psychosocial support. No differences were found between blacks and whites in their receipt of career-related support.
Computational isomorphisms in classical logic
Authors: Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx
Venue: Theoretical Computer Science (2003)

All standard 'linear' boolean equations are shown to be computationally realized within a suitable classical sequent calculus LKηp. Specifically, LKηp can be equipped with a cut-elimination compatible equivalence on derivations based upon reversibility properties of logical rules. So that any pair of derivations, without structural rules, of F → G and G → F, where F, G are first-order formulas 'without any qualities', defines a computational isomorphism.