ppxscal/embedding_network huggingface dataset:
The Effects of Low Inventory on the Development of Productivity Norms
Authors: Kenneth L. Schultz, David C. Juran, John W. Boudreau
Venue: Management Science (1999)

Low inventory, a crucial part of just-in-time (JIT) manufacturing systems, enjoys increasing application worldwide, yet the behavioral effects of such systems remain largely unexplored. Operations research (OR) models of low-inventory systems typically use a simplifying assumption that processing times of individual workers are independent random variables. This leads to predictions that low-inventory systems will exhibit production interruptions leading to lower productivity. Yet empirical results suggest that low-inventory systems do not exhibit the predicted productivity losses. This paper develops a model integrating feedback, goal setting, group cohesiveness, task norms, and peer pressure to predict how individual behavior may adjust to alleviate production interruptions in lowinventory systems. In doing so we integrate previous research on the development of task norms. Operations research models are used to show how norms can significantly improve throughput by decreasing variance and increasing the speed of the slowest workers, even if accompanied by decreases in speed of the fastest workers. Findings suggest that lowinventory systems induce individual and group responses that cause behavioral changes that mitigate production interruptions.
Reliable low-power design in the presence of deep submicron noise (embedded tutorial session)
Authors: Naresh Shanbhag, K. Soumyanath, Samuel Martin
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Scaling of feature size in semiconductor technology has been responsible for increasingly higher computational capacity of silicon. This has been the driver for the revolution in communications and computing. However, questions regarding the limits of scaling (and hence Moore's Law) have arisen in recent years due to the emergence of deep submicron noise. The tutorial describes noise in deep submicron CMOS and their impact on digital as well as analog circuits. In particular, noise-tolerance is proposed as an effective means for achieving energy and performance efficiency in the presence of DSM noise.
Verification of relational tranducers for electronic commerce
Authors: Marc Spielmann
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

Motivated by recent work of Abiteboul, Vianu, Fordham, and Yesha [3] we investigate the verifiability of transaction protocols specifying the interaction of multiple partiesvia a network, where each party is equipped with an (active) database that participates in the interaction. Such transaction protocols typically occur in the context of electronic commerce applications and can be formalized as relational transducers. We introduce a class of powerful relational transducers based on Gurevich's abstract state machines and show that several verification problems related to electronic commerce applications can be solved for these transducers. Our approach is, in some sense, complementary to the approach in [3].
Marsh: min-area retiming with setup and hold constraints
Authors: Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K. Parhi
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock period c, our algorithm either outputs a retimed version of G satisfying setup and hold constraints or reports that such a solution is not possible, in &Ogr;(|V3|log|V|log(|V|C)) steps, where |V| corresponds to number of gates in the circuit and C is equal to the number of registers in the circuit. This is the first polynomial time algorithm ever reported for min-area retiming with constraints on both long and short-paths. An alternative problem formulation that takes practical issues in to consideration and lowers the problem complexity is also developed. Both the problem formulations have many parallels with the original formulation of long-path only retiming by Leiserson and Saxe and all the speed improvements that have been obtained on that technique are likely to be valid for improving the performance of the technique described in this paper.
Putting the feel in &rsquo;look and feel&lsquo;
Authors: Ian Oakley, Marilyn Rose McGee, Stephen Brewster, Philip Gray
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Haptic devices are now commercially available and thus touch has become a potentially realistic solution to a variety of interaction design challenges. We report on an investigation of the use of touch as a way of reducing visual overload in the conventional desktop. In a two-phase study, we investigated the use of the PHANToM haptic device as a means of interacting with a conventional graphical user interface. The first experiment compared the effects of four different haptic augmentations on usability in a simple targeting task. The second experiment involved a more ecologically-oriented searching and scrolling task. Results indicated that the haptic effects did not improve users performance in terms of task completion time. However, the number of errors made was significantly reduced. Subjective workload measures showed that participants perceived many aspects of workload as significantly less with haptics. The results are described and the implications for the use of haptics in user interface design are discussed.
Accessing Data from External Centralized Sources To Enhance Analysis of a Completed Clinical Trial
Authors: Mazen Abdellatif, Domenic J. Reda, David Williams, William C. Cushman, Barry J. Materson
Venue: Journal of Medical Systems (1999)

After the data collection phase of a clinical trial has been completed, new hypotheses may surface which require additional data before they can be tested. In the Veterans Affairs Cooperative Study on Single Drug Therapy of Hypertension, we investigated the relationship between location of the participating center, race and ability to control blood pressure. The analysis indicated poorer blood pressure control among sites located in the &ldquo;stroke belt&rdquo; (southeastern United States), especially among African-Americans. We sought to determine whether the effect was attributable to socioeconomic patterns&semi; however, income data were not collected as part of the original study. Therefore, we accessed centralized data bases to obtain zipcode-level income information for the randomized study patients. This approach yielded estimates of income data for 94.3% of the patients and compared favorably to data acquisition rates for variables which were collected prospectively in the study.
Bit-level arithmetic optimization for carry-save additions
Authors: Kei-Yong Khoo, Zhan Yu, Alan N. Willson,  Jr.
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper addresses the bit-level optimization of carry-save adder (CSA) arrays when the operands are of unequal wordlength (such as in some datapaths in digital signal processing circuits). We first show that by relaxing the carry-save representation to allow for more than two signals per bit position, we gain flexibility in the bit-level implementation of CSA arrays that can be exploited to achieve a more efficient design. We then propose algorithms to optimize a single adder array at the bit-level. In addition, we proposed a heuristic to optimize a series of adder arrays that might occur in a datapath. We have applied our algorithms to the optimization of high-speed digital FIR filters and have achieved 15% to 30% savings (weighted cost) in the overall filter implementation array in comparison to the standard carry-save implementation.
Empirical Game Theoretic Models: Computational Issues
Authors: Olivier Armantier, Jean-François Richard
Venue: Computational Economics (2000)

This paper discusses computational issues raised by a generic solution and estimation methodology applicable to a broad range of empirical game theoretic models with incomplete information. By combining the use of Monte Carlo simulation techniques with that of smooth kernel estimation of empirical distribution functions, the authors develop a numerical algorithm of unparalleled performance and flexibility applicable, in particular, to models for which no operational solutions currently exist. An illustration to a set of procurement data from the French aerospace industry is used to illustrate the operation of this algorithm.
Optimal Control of Thermally Convected Fluid Flows
Authors: K. Ito, S. S. Ravindran
Venue: SIAM Journal on Scientific Computing (1998)

We examine the optimal control of stationary thermally convected fluid flows from the theoretical and numerical point of view. We use thermal convection as control mechanism; that is, control is effected through the temperature on part of the boundary. Control problems are formulated as constrained minimization problems. Existence of optimal control is given and a first-order necessary condition of optimality from which optimal solutions can be obtained is established. We develop numerical methods to solve the necessary condition of optimality and present computational results for control of cavity- and channel-type flows showing the feasibility of the proposed approach.
Stage Value Predictors and Efficient Newton Iterations in Implicit Runge--Kutta Methods
Authors: Hans Olsson, Gustaf Söderlind
Venue: SIAM Journal on Scientific Computing (1998)

The prediction of stage values in implicit Runge--Kutta methods is important both for overall efficiency as well as for the design of suitable control strategies for the method. The purpose of this paper is to construct good stage value predictors for implicit methods and to verify their behavior in practical computations. We show that for stiffly accurate methods of low stage order it is necessary to use several predictors. In other words, a continuous extension for the method will not yield the best results. We also investigate how to gain additional efficiency in the Newton iterations used to correct the prediction error. This leads to new control strategies with respect to refactorization of Jacobians that seek to globally minimize total work per unit time of integration.
Sticky Particles and Scalar Conservation Laws
Authors: Yann Brenier, Emmanuel Grenier
Venue: SIAM Journal on Numerical Analysis (1998)

One-dimensional scalar conservation laws with nondecreasing initial conditions and general fluxes are shown to be the appropriate equations to describe large systems of free particles on the real line, which stick under collision with conservation of mass and momentum.
Notes on \sl n-D Polynomial Matrix Factorizations
Authors: Zhiping Lin
Venue: Multidimensional Systems and Signal Processing (1999)

This paper discusses a relationship between the prime factorizability of a normal full rank n-D ( n>2) polynomial matrix and its reduced minors. Two conjectures regarding the n-D polynomial matrix prime factorization problem are posed, and a partial solution to one of the conjectures is provided. Another related open problem of factorizing an n-D polynomial matrix that is not of normal full rank as a product of two n-D polynomial matrices of smaller size is also considered, and a partial solution to this problem is presented. An illustrative example is worked out in details.
Convergence of libraries and computer centres for African universities: a strategy for enhancing information services
Authors: Mugyabuso J.F Lwehabura, Doris S. Matovelo
Venue: Information Technology for Development (1999)

This paper aims at stimulating universities in Africa to work towards convergence of computer centres and library services as a strategy for enhancing information provision in these institutions. It highlights the convergence initiatives in the context of developed countries and gives advantages and benefits of such a strategy particularly in developing countries&rsquo; constraints in both material and human resources. Despite possible obstacles that have also been pointed out, the paper concludes by stressing the timeliness for convergence of the two services in African universities where IT is now rapidly being adopted.
Implication graph based domino logic synthesis
Authors: Ki-Wook Kim, C. L. Liu, Sung-Mo Kang
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid significant area penalty resulting from duplication. To maximize the domino logic part and to minimize the static CMOS logic part, a generalized ATPG based logic transformation is proposed to eliminate or relocate a target inverter. Based on the new concept of dominating set of mandatory assignment (DSMA) and the corresponding implication graph, we propose algorithms to identify a minimum candidate set for a target inverter. Experimental results show that logic transformation based on implication graph can reduce transistor counts by 25% and power delay product by 25% on average.
Two New Infinite Families of 3-Designs from Kerdock Codesover \mbox{ Z } _4
Authors: Kyeongcheol Yang, Tor Helleseth
Venue: Designs, Codes and Cryptography (1998)

In this paper we show that the support of the codewords of each type in the Kerdock code of length 2^m over Z_4 form 3-designs for any odd integer m \geq 3. In particular, two new infinite families of 3-designs are obtained in this construction for any odd integer m \geq 3, whose parameters arev=2^m , k= 2^{m-1} + 2^{m-2} \pm 2^{\frac{m-3}{2}}, and \lambda = \frac{k (k-1) (k-2)}{2^m-2}.
Calculating Laplace Transforms in Terms of the Toda Molecule
Authors: Yoshimasa Nakamura
Venue: SIAM Journal on Scientific Computing (1998)

A method for calculating a continued fraction expansion of Laplace transforms is presented in terms of the tau-function of the continuous time Toda molecule equation and its integrable discretization. The $z$-transform and a discrete analogue of the Laplace transform of a set of finite samples are also formulated.
A case study: demands on component-based development
Authors: Ivica Crnkovic, Magnus Larsson
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

Building software systems with reusable components brings many advantages. The development becomes more efficient, the realibility of the products is enhanced, and the maintenance requirement is significantly reduced. Designing, developing and maintaining components for reuse is, however, a very complex process which places high requirements not only for the component functionality and flexibility, but also for the development organization. In this paper we discuss the different levels of component reuse, and certain aspects of component development, such as component generality and efficiency, compatibility problems, the demands on development environment, maintenance, etc. The evolution of requirements for products generates new requirements for components, if components are not enough general and mature. This dynamism determines the component life cycle where the component first reaches its stability and later degenerates in an asset that is difficult to use, difficult to adapt and maintain. When reaching this stage, the component becomes an obstacle for efficient reuse and should be replaced. Questions related to use of standard and de-facto standard components are addressed specifically. As an illustration of reuse issues, we present a successful implementation of a component-based system which is widely used for industrial process control.
MOS current mode logic for low power, low noise CORDIC computation in mixed-signal environments
Authors: Jason M. Musicer, Jan Rabaey
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

In this work, MOS Current Mode Logic (MCML) is analyzed for application to low power, mixed signal environments. A small MCML cell library is developed and optimized for several different performance requirements. The cells are then applied to the generation of piplelined CORDIC structures and compared with equivalent CMOS circuits. MCML CORDICs are designed which can operate from 125MHz to 310MHz with power consumption varying between 4.3mW and 18.6mW. These power results are up to 1.5 times less than CMOS CORDICs with equivalent propagation delays. Design was done in a 0.25&mrg;m standard CMOS process from ST Microelectronics.
Secure virtual private networks: the future of data communications
Authors: Eli Herscovitz
Venue: International Journal of Network Management (1999)

The Internet is an almost ideal means for information retrieval and exchange. It is cost-effective, easy to use and easily accessible. However, it can also be susceptible to devious practices such as data tempering, eavesdropping and theft. This paper analyses secure virtual private networks &lpar;VPNs&rpar; and their use in countering the problems of the Internet. Copyright &copy; 1999 John Wiley Sons, Ltd.
Radiance interpolants for accelerated bounded-error ray tracing
Authors: Kavita Bala, Julie Dorsey, Seth Teller
Venue: ACM Transactions on Graphics (TOG) (1999)

Ray tracers, which sample radiance, are usually regarded as offline rendering algorithms that are too slow for interactive use. In this article we present a system that exploits object-space, ray-space, image-space, and temporal coherence to accelerate ray tracing. Our system uses per-surface interpolants to approximate radiance both interactive and batch ray tracers. Our approach explicity decouples the two primary operations of a ray tracer&mdash;shading and visibility determination&mdash;and accelerates each of them independently. Shading is accelerated by quadrilinearily interpolating lazily acquired radiance samples. Interpolation error does not exceed a user-specified bound, allowing the user to control performance/quality tradeoffs. Error is bounded by adaptive sampling at discontinuities and radiance nonlinearities. Visibility determination at pixels is accelerated by reprojecting interpolants as the user's viewpoint changes. A fast scan-line alogoithm then achieves high performance without sacrificing image quality. For a smoothly varying viewpoint, the combination of lazy interpolants and projection substantially accelerates the ray tracer. Additionally, an efficient cache management algorithm keeps the memory footprint of the system small with negilgible overhead.
Boundary Controllability of a Hybrid System Consisting in Two Flexible Beams Connected by a Point Mass
Authors: Carlos Castro, Enrique Zuazua
Venue: SIAM Journal on Control and Optimization (1998)

We consider a hybrid system consisting of two flexible beams connected by a point mass. The constant of rotational inertia is assumed to be nonzero. In a previous paper we have proved that, in the presence of the point mass, the system is well posed in asymmetric spaces in which solutions have one more degree of regularity to one side of the mass.We are interested in the problem of controllability when the control acts on the free extreme of one of the beams. We prove that when the control time is large enough the system is exactly controllable in an asymmetric space. This result is sharp. The proofs combine classical techniques from asymptotic analysis and the theory of nonharmonic Fourier series.
Timing-safe false path removal for combinational modules
Authors: Yuji Kukimoto, Robert K. Brayton
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

A combinational module is a combinational circuit that can be used under any arrival time condition at the primary inputs. An intellectual property (IP) module, if combinational, is one such example. The false-path-aware delay characterization of a combinational module without disclosing its internal structural detail is crucial for accurate timing analysis of IP-based designs.This paper addresses three related issues on delay characterization of combinational modules. We first introduce a new notion called timing-safe replaceability as a way of comparing the timing characteristics of two combinational modules formally. This notion allows us to determine whether a new module is a safe replacement of an original module under any surrounding environment with respect to timing. Second, we consider false path detection of combinational modules. Although false path detection is essential in accurate delay modeling, we argue that the conventional definition of false paths such as floating mode analysis is not appropriate for defining the falsity of a path for a combinational module since the falsity is relative to an arrival time condition. A new definition of false paths, termed strongly false paths, is introduced to resolve this issue. Strongly false paths are those paths that are guaranteed to be false under any arrival time condition, and thus uniquely defined independent of arrival time conditions. Finally, we propose a new algorithm that removes strongly false paths from a combinational module by a circuit transformation. We prove that the resulting circuit is a timing-safe replacement of the original.
Fault-Tolerant Processor Arrays Using Additional Bypass Linking Allocated by Graph-Node Coloring
Authors: Nobuo Tsuda
Venue: IEEE Transactions on Computers (2000)

An advanced spare-connection scheme for k-out-of-n redundancy called ¿generalized additional bypass linking¿ is proposed for constructing fault-tolerant massively parallel computers with series-connected, mesh-connected, or tree-connected processing element (PE) arrays. This scheme uses bypass links with wired OR connections to selectively connect the primary PEs to a spare PE in parallel. These bypass links are allocated to the primary PEs by node-coloring of a graph with a minimum inter-node distance of three in order to minimize the number of bypass links (i.e., the chromatic number). The main advantage of this scheme is that it can be used for constructing various k-out-of-n configurations capable of enhanced PE-to-PE communication and broadcast while still achieving strong fault tolerance for these PEs and links. In particular, it enables the construction of optimal r-strongly-fault-tolerant configurations capable of direct k-out-of-n selections by providing r spare PEs and $r$ extra connections per PE for any kind of array when node-coloring with a distance of three is used. This simple spare-circuit structure enhances fault tolerance more than conventional schemes do. The node-coloring patterns were constructed using new node-coloring algorithms and the chromatic numbers were evaluated theoretically. Enhanced PE-to-PE communication and broadcast were achieved by using new fault-tolerant routing algorithms based on the properties of the node-coloring patterns with four or five message transmission steps being optimal configurations with any size array.