ppxscal/embedding_network huggingface dataset:
The MSOM Society Student Paper Competition: Extended Abstracts of 1999 Winners
Venue: Manufacturing Service Operations Management (2000)

Each year the Manufacturing and Service Operations Management (MSOM) Society of INFORMS conducts a Student Paper Competition. This year, in what the Editor-in-Chief and Senior Editors of the M&SOM journal hope will become an annual event, we are publishing extended abstracts of the 1999 winners. The Chairperson of the 1999 competition was Anant Iyer, i2 Technologies. The judges were Ron Askin (University of Arizona), Frank Ciarallo (University of Arizona), Vibhu Kalyan (i2 Technologies), Janny Leung (City University of Hong Kong), Sarah Patterson (Duke University) and Sridhar Tayur (Carnegie Mellon University). The 1999 winners were chosen after two rounds of judging. The first round yielded the five papers whose abstracts follow. During the second round each judge examined all five and then voted to determine the winners. All the winners received a certificate recognizing their accomplishments. In addition, the MSOM Society provided a cash award of $400 to the firstprize winner, and $200 to the second-prize winner (shared between the joint winners). The winners and their faculty mentors are: First Prize - L. Beril Toktay, INSEAD Faculty Mentor: Lawrence Wein, MIT, "Analysis of a Production-Inventory System with Stationary Demand and Dynamic Forecast Updates"; Joint Second Prize - Prashant C. Fuloria, Stanford University, Faculty Mentor: Stefanos A. Zenios, Stanford University, "Incentive Efficiency in a Health-Care Delivery System"; and Itir Z. Karaesmen, Columbia University, Faculty Advisor: Garrett J. van Ryzin, Columbia University, "Overbooking with Substitutable Inventory Classes"; Joint Honorable Mentions - Apurva Jain, University of Washington, Faculty Mentor: Ananth. Iyer, Purdue University, "The Logistics Impact of a Mixture of Order-Streams in a Manufacturer-Retailer System"; and James T. Treharne, U.S. Army TRADOC Analysis, Center Faculty Mentor: Charles R. Sox, Auburn University, "Adaptive Inventory Control for Nonstationary Demand and Partial Information." 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
B-spline collocation methods for elasticity problems
Authors: Weiwei Sun
Venue: Scientific computing and applications (2001)

A class of collocation methods based on B-spline approximations is proposed for solving equations of linear elasticity. Methods can be easily implemented and provide a high order accuracy at low cost due to the nature of both B-spline approximation and collocation method, in which B-spline approximation can be generated by some classical recurrence formulas and no integrals are involved in the calculation. Methods are examined for two examples. Some direct and iterative algorithms for solving the B-spline collocation systems are discussed.
The new efficient hierarchy combination encoding method of evolution strategies for production allocation problems
Authors: Young-Chang Hou, Ying-Hua Chang
Venue: Computers and Industrial Engineering (2002)

The production allocation problem focuses on allocating the output of individual plants in a multinational company among markets. The production allocation model aims to minimize the costs of a multinational company subject to the capacity constraints and market demand. This study applies evolution strategies to solve the production allocation problem. We proposed a new efficient encoding method, which can significantly reduce the search space of solutions and obtain a high performance and optimal solutions. To avoid invalid chromosome happened during evolution strategies procedures, a specialized mutation operation is simultaneously proposed herein. Computational results indicate that the efficient combination encoding of evolution strategies performs very well. Our results further demonstrate that the solutions obtained by this approach are always efficient.
A critique of the sensitivity rules usually employed for statistical table protection
Authors: Josep Domingo-Ferrer, Vicencç Torra
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2002)

In statistical disclosure control of tabular data, sensitivity rules are commonly used to decide whether a table cell is sensitive and should therefore not be published. The most popular sensitivity rules are the dominance rule, the p%-rule and the pq-rule. The dominance rule has received critiques based on specific numerical examples and is being gradually abandoned by leading statistical agencies. In this paper, we construct general counterexamples which show that none of the above rules does adequately reflect disclosure risk if cell contributors or coalitions of them behave as intruders: in that case, releasing a cell declared non-sensitive can imply higher disclosure risk than releasing a cell declared sensitive. As possible solutions, we propose an alternative sensitivity rule based on the concentration of relative contributions. More generally, we suggest to complement a priori risk assessment based on sensitivity rules with a posteriori risk assessment which takes into account tables after they have been protected.
A measurement-analytic approach for QoS estimation in a network based on the dominant time scale
Authors: Do Young Eun, Ness B. Shroff
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

In this paper, we describe a measurement-analytic approach for estimating the overflow probability, an important measure of the quality of service (QoS), at a given multiplexing point in the network. A multiplexing point in the network could be a multiplexer or an output port of a switch or router where resources such as bandwidth and buffers are shared. Our approach impinges on using the notion of the dominant time scale (DTS), which corresponds to the most probable time scale over which overflow occurs. The DTS provides us with a measurement window for the statistics of the traffic, but is in fact itself defined in terms of the statistics of the traffic over all time. This, in essence, results in a chicken-and-egg type of unresolved problem. For the DTS to be useful for on-line measurements, we need to be able to break this chicken-and-egg cycle, and to estimate the DTS with only a bounded window of time over which the statistics of the traffic are to be measured. In this paper, we present a stopping criterion to successfully break this cycle and find a bound on the DTS. Thus, the result has significant implications for network measurements. Our approach is quite different from other works in the literature that require off-line measurements of the entire trace of the traffic. In our case, we need to measure only the statistics of the traffic up to a bound on the DTS. We also investigate the characteristics of this upper bound on the DTS, and provide numerical results to illustrate the utility of our measurement analytic approach.
Toward an Agent Oriented Virtual Organization Dedicated to Risk Prevention in Small and Medium Size Companies
Authors: Eric Rigaud, Franck Guarnieri
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This article presents a Grid architecture allowing the implementation of Virtual Organization based on works done in the field of multi-agent system. A model of communication architecture allowing the exchange of information between distributed information systems ispresented. The AUDI@R system, dedicated to the prevention of technical risks into SME-SMI, illustrates the functioning of this architecture
Data modeling in the understanding database course: adding UML and XML modeling to the traditional course content
Authors: Bruce J. Neubauer
Venue: Journal of Computing Sciences in Colleges (2002)

The purpose of this paper is to propose that following the teaching of entity-relationship modeling in the traditional way, visual CASE tools be used to introduce students to data modeling in object-oriented applications and XML schemas. The intent is to better align database courses with the teaching of object-oriented and network-based programming.
A new formal approach for the specification and the verification of multi-agent reactive systems operating modes
Authors: Bouchaib Bounabat
Venue: Information processing and technology (2001)

A Reactive system is one that is in continual interaction with its environment, and executes at a pace determined by that environment. Examples of such systems are network protocols, industrial-process control systems etc. Reliability requirements are usually much more stringent for reactive systems than other computer systems. Fault tolerance technique is an approach to system design, which help that potential faults do not cause system failure, and increase system reliability.Due to their complex nature, reactive systems are extremely difficult to specify and validate. In this paper, we propose a new formal model for the specification and the verification of such systems using several fault tolerance techniques. This approach considers a Reactive System as a Reactive Multi-Agent System consisting of concurrent reactive agents that cooperate with each other to achieve the desired functionality. In addition, this approach uses formal synchronous specification and verification tools in order to specify and to verify the systems behaviours. Finally an example of an application of the approach is mentioned.
A complete temporal relational algebra
Authors: Debabrata Dey, Terence M. Barron, Veda C. Storey
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1996)

Various temporal extensions to the relational model have been proposed. All of these, however, deviate significantly from the original relational model. This paper presents a temporal extension of the relational algebra that is not significantly different from the original relational model, yet is at least as expressive as any of the previous approaches. This algebra employs multidimensional tuple time-stamping to capture the complete temporal behavior of data. The basic relational operations are redefined as consistent extensions of the existing operations in a manner that preserves the basic algebraic equivalences of the snapshot (i.e., conventional static) algebra. A new operation, namely temporal projection, is introduced. The complete update semantics are formally specified and aggregate functions are defined. The algebra is closed, and reduces to the snapshot algebra. It is also shown to be at least as expressive as the calculus-based temporal query language TQuel. In order to assess the algebra, it is evaluated using a set of twenty-six criteria proposed in the literature, and compared to existing temporal relational algebras. The proposed algebra appears to satisfy more criteria than any other existing algebra.
Speed is more powerful than clairvoyance
Authors: Piotr Berman, Chris Coulston
Venue: Nordic Journal of Computing (1999)

We consider the problem of preemptive non-clairvoyant scheduling on a single machine. In this model a scheduler receives a number of jobs at different times without prior knowledge of the future jobs or the required processing time of jobs that are not yet completed. We want to minimize the total response time, i.e. the sum of times each job takes from its release to completion.One particular algorithm, Balance, always schedules the job that is least processed so far. A comparison of an on-line scheduler running Balance against the optimal off-line shows a very large competitive ratio if both algorithms use machines of the same speed. However, it has been shown that if Balance is run on a υ times faster machine than its clairvoyant competitor, then the competitive ratio drops to υ/(υ - 1) at most. This result showed that speed can be almost as good as clairvoyance.We show for υ ≥ 2 the competitive ratio of Balance is 2/υ. In other words, sufficiently high speed is more powerful than clairvoyance.
Dynamic transmission problems for plates
Authors: Igor Chudinovich, Christian Constanda
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

The existence of distributional solutions is investigated for the boundary integral equations associated with the bending of a thin elastic plate in the dynamic contact problem.
Analysis of fruit and vegetable surface color
Authors: László Baranyai, Anett Szepes
Venue: Machine Graphics Vision International Journal (2002)

Changes of color on the surfaces of tomatoes, mushrooms and apples were measured with digital image processing techniques. Texture analysis methods were applied to identify the stage of ripeness and defects, such as mechanical injuries and microbiological infection. Distributions of red, green, blue color components and intensity values were shown by histograms. Differences in intensities - in the directions of 0°, 45°, 90°, and 135° - were also collected. First - order statistical parameters and coordinates of polar quality points for sum and difference histograms were calculated and evaluated. Classification powers of different color signals were compared.
Lighting simulation with radiance
Authors: Anthony W. Kay
Venue: Linux Journal (2003)

Turn simple data files into amazing 3-D scenes using free software.
Preferential treatment for short flows to reduce web latency
Authors: Xuan Chen, John Heidemann
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In this paper, we propose short flow differentiating (SFD) algorithm to reduce the user-perceived web latency. This algorithm gives short flows preferential treatment. We implement SFD algorithm as a simple differentiated services policy and evaluate its performance in simulation. We find that SFD algorithm reduces the transmission latency of short flows and the response time to retrieve representative web pages by about 30%. Using web traces, we demonstrate that 99% web pages would be transferred faster. SFD penalizes long flows, but the penalty is well bounded. We further evaluate how different schemes trade-off the performance between short and long flows.
Do you know what's in your project portfolio?
Authors: Ubiquity staff
Venue: Ubiquity (2003)

Cathleen Benko and Warren McFarlan, authors of "Connecting the Dots: Aligning Projects with Objectives in Unpredictable Times" discuss the dangers of ignoring your IT portfolio.
Wanted: a compositional approach to concurrency
Authors: C. B. Jones
Venue: Programming methodology (2003)

A key property for a development method is compositionality, because it ensures that a method can scale up to cope with large applications. Unfortunately, the inherent interference makes it difficult to devise development methods for concurrent programs (or systems). There are a number of proposals such as rely/guarantee conditions but the overall search for a satisfactory compositional approach to concurrency is an open problem. This paper identifies some issues including granularity and the problems associated with ghost variables; it also discusses using atomicity as a design abstraction.
Heisenberg groups: a unifying structure of signal theory, holography and quantum information theory
Authors: Ernst Binz, Sonja Pods, Walter Schempp
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Vector fields in three-space admit bundles of internal variables such as a Heisenberg algebra bundle. Information transmission along field lines of vector fields is described by a wave linked to the Schrödinger representation in the realm of time-frequency analysis. The preservation of local information causes geometric optics and a quantization scheme. A natural circle bundle models quantum information visualized by holographic methods. Features of this setting are applied to magnetic resonance imaging.
Report: 4th ACM Conference On Computer and Communications Security
Authors: Donald J. Reifer
Venue: ACM SIGSOFT Software Engineering Notes (1997)

The 4th ACM Conference on Computer and Communications Security [1] was held on 1-4 April 1997 in Zurich, Switzerland. About 100 participants from around the world gathered to discuss advances being made primarily in the area of defensive information warfare. This was primarily a research-oriented event which attracted principal investigators working in the security field from about 14 nations. I attended the conference for the following four reasons: bull; I wanted to update my knowledge of the area. bull; I wanted to ascertain what progress has been made in the field. bull; I wanted to determine whether there were any breakthrough technologies on the horizon. bull; I wanted to understand the threats being guarded against and the defensive strategies that leaders in the field were recommending.As I will relate later, significant progress has been in many defensive information warfare areas. I particularly was impressed by the advances that have been made in the area of cryptography, digital signatures and communications protocols. I was disappointed by the perceived lack of progress over the years in the important area of trusted systems and information security infrastructure development.This was the first conference that I have attended on the subject in about a decade. I selected the event because I thought that it would allow me to view both present work in the field and look into the future.
Finite Horizon Stochastic Knapsacks with Applications to Yield Management
Authors: Richard Van Slyke, Yi Young
Venue: Operations Research (2000)

The finite horizon stochastic knapsack combines a secretary problem with an integer knapsack problem. It is useful for optimizing sales of perishable commodities with low marginal costs to impatient customers. Applications include yield management for airlines, hotels/motels, broadcasting advertisements, and car rentals. In these problems,K types of customers arrive stochastically. Customer type,k, has an integer weightw k , a valueb k , and an arrival rate? k( t) (which depends on time). We consider arrivals over a continuous time horizon [0;T] to a "knapsack" with capacityW. For each arrival that fits in the remaining knapsack capacity, we may (1) accept it, receivingb k , while giving up capacityw k ; or (2) reject it, forgoing the value and not losing capacity. The choice must be immediate; a customer not accepted on arrival is lost. We model the problem using continuous time, discrete state, finite horizon, dynamic programming. We characterize the optimal return function and the optimal acceptance strategy for this problem, and we give solution methods. We generalize to multidimensional knapsack problems. We also consider the special case wherew k= 1 for allk. This is the classic airline yield problem. Finally, we formulate and solve a new version of the secretary problem.
Designing An FSM Architectural Framework for Service-Based Applications
Authors: Jun-Jang Jeng, Wang-Chuan Tsai
Venue: 24th International Computer Software and Applications Conference (2000)

This paper describes an FSM (Finite State Machine) architectural framework called StateJ. In a FSM architectural framework, a business service is realized by a finite state machine and implemented as a component called service managed by the state management service. Distributed services communicate with each other through request management service and event notification service. StateJ has been exploited to develop several service-based applications, in particular, telecom service provisioning systems. This paper describes the StateJ framework and our experience of using it.
Higher separation axioms in L-topologically generated I(L)-topological spaces
Authors: Tomasz Kubiak, Iraide Mardones-Pérez
Venue: Fuzzy Sets and Systems (2002)

The main result of this paper is a theorem about inserting a pair of semicontinuous L-real-valued functions which extends the insertion theorem of Kubiak [Comment. Math. Univ. Carolinae 34 (1993) 357-362] from L = {0, 1} to an arbitrary meet-continuous lattice L (endowed with an order-reversing involution). With this result it is shown that the normality-type separation axioms in TOP(L) are preserved by the functor which takes an L-topological space X to the I(L)-topological space ΩL(X) obtained by providing the set X with the I(L)-topology consisting of all lower semicontinuous functions from X to I(L). The same is proved for the case of the regularity axiom.
Density of extremal sets in multivariate Chebyshev approximation
Authors: András Kroó
Venue: Journal of Approximation Theory (2002)

There are numerous results concerning the density of extremal sets (points of maximal deviation) in univariate Chebyshev approximation. In this note, we show that in multivariate setting this density is preserved in some weak sense.
Access path support for referential integrity in SQL2
Authors: Theo Härder, Joachim Reinert
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1996)

The relational model of data incorporates fundamental assertions for entity integrity and referential integrity. Recently, these so-called relational invariants were more precisely specified by the new SQL2 standard. Accordingly, they have to be guaranteed by a relational DBMS to its users and, therefore, all issues of semantics and implementation became very important. The specification of referential integrity embodies quite a number of complications including the MATCH clause and a collection of referential actions. In particular, $\hbox{{\tt MATCH PARTIAL}}$ turns out to be hard to understand and, if applied, difficult and expensive to maintain. In this paper, we identify the functional requirements for preserving referential integrity. At a level free of implementational considerations, the number and kinds of searches necessary for referential integrity maintenance are derived. Based on these findings, our investigation is focused on the question of how the functional requirements can be supported by implementation concepts in an efficient way. We determine the search cost for referential integrity maintenance (in terms of page references) for various possible access path structures. Our main result is that a combined access path structure is the most appropriatefor checking the regular MATCH option, whereas $\hbox{{\tt MATCH PARTIAL}}$ requires very expensive and complicated check procedures. If it cannot be avoided at all, the best support is achieved by a combination of multiple $\mbox{B}^*$-trees.
Reconfigurable models of finite state machines and their implementation in FPGAs
Authors: V. Sklyarov
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2002)

This paper examines some models of finite state machines (FSMs) that can be implemented in dynamically and statically reconfigurable FPGAs. They enable circuits for the FSMs to be constructed in such a way that allows their behavior to be modified before and during run-time. This is achieved either by swapping pre-allocated areas on a chip in partially dynamically reconfigurable FPGAs, or by reloading memory-based cells in statically configured FPGAs. The initial behavioral description is presented in the form of hierarchical graph-schemes that can be formally translated to traditional FSM specifications such as state diagrams and state transition tables. The description supports modularity and a hierarchical structure, both of which are important for modifiable circuits. The results of experiments with software models that permit reconfigurable systems to be simulated and verified and with a hardware implementation of a FSM have shown that such reusable circuits require very limited FPGA resources and they can be reprogrammed in much the same way as for software development.