ppxscal/embedding_network huggingface dataset:
A Markov chain sequence generator for power macromodeling
Authors: Xun Liu, Marios C. Papaefthymiou
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper, we present a novel sequence generator based on a Markov chain model. Specifically, we formulate the problem of generating a sequence of vectors with given average input probability p, average transition density d, and spatial correlation s as a transition matrix computation problem, in which the matrix elements are subject to constraints derived from the specified statistics. We also give a practical heuristic that computes such a matrix and generates a sequence of l n-bit vectors in O(nl + n2) time. Derived from a strongly mixing Markov chain, our generator yields binary vector sequences with accurate statistics, high uniformity, and high randomness. Experimental results show that our sequence generator can cover more than 99% of the parameter space. Sequences of 2,000 48-bit vectors are generated in less than 0.05 seconds, with average deviations of the signal statistics p, d, and s equal to 1.6%, 1.8%, and 2.8%, respectively.Our generator enables the detailed study of power macromodeling. Using our tool and the ISCAS-85 benchmark circuits, we have assessed the sensitivity of power dissipation to the three input statistics p, d, and s. Our investigation reveals that power is most sensitive to transition density, while only occasionally exhibiting high sensitivity to signal probability and spatial correlation. Our experiments also show that input signal imbalance can cause estimation errors as high as 100% in extreme cases, although errors are usually within 25%.
Supporting intercultural computer-mediated discourse: methods, models, and architectures
Authors: Fahri Yetim, Elaine M. Raybourn
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We use the term "intercultural" instead of "cultural" to emphasis the dialogical relationship of at least two participants from different cultures in computer-mediated communication and cooperation contexts. Supporting intercultural computer-mediated communication (I-CMC) requires, on the one hand, the understanding of both enabling and constraining aspects (barriers) of such a dialogical situations, and calls for, on the other hand, new ideas for tools, architectures, etc., which may support, promote or enable computer-mediated intercultural communication and cooperation.This workshop explores the challenges in the intercultural computer-mediated communication and cooperation environments and will provide a platform for discussing empirical insights into the intercultural communication barriers and practical and theoretical works for new designs, tools and architectures that aims at overcoming them and enabling computer-mediated intercultural communication and cooperation.
Allocating Fibers in Cable Manufacturing
Authors: Daniel Adelman, George L. Nemhauser, Mario Padron, Robert Stubbs, Ram Pandit
Venue: Manufacturing Service Operations Management (1999)

We study the problem of allocating stocked fibers to made-to-order cables with the goals of satisfying due dates and reducing the costs of scrap, setup, and fiber circulation. These goals are achieved by generating remnant fibers either long enough to satisfy future orders or short enough to scrap with little waste. They are also achieved by manufacturing concatenations, in which multiple cable orders are satisfied by the production of a single cable that is afterwards cut into the constituent cables ordered. We use a function that values fibers according to length, and which can be viewed as an approximation to the optimal value function of an underlying dynamic programming problem. The daily policy that arises under this approximation is an integer program with a simple linear objective function that uses changes in fiber value to take into account the multi-period consequences of decisions. We describe our successful implementation of this integer program in the factory, summarizing our computational experience as well as realized operational improvements.
Testing parallel random number generators
Authors: Ashok Srinivasan, Michael Mascagni, David Ceperley
Venue: Parallel Computing (2003)

Monte Carlo computations are considered easy to parallelize. However, the results can be adversely affected by defects in the parallel pseudorandom number generator used. A parallel pseudorandom number generator must be tested for two types of correlations--(i) intra-stream correlation, as for any sequential generator, and (ii) inter-stream correlation for correlations between random number streams on different processes. Since bounds on these correlations are difficult to prove mathematically, large and thorough empirical tests are necessary. Many of the popular pseudorandom number generators in use today were tested when computational power was much lower, and hence they were evaluated with much smaller test sizes.This paper describes several tests of pseudorandom number generators, both statistical and application-based. We show defects in several popular generators. We describe the implementation of these tests in the SPRING [ACM Trans. Math. Software 26 (2000) 436; SPRNG--scalable parallel random number generators. SPRNG 1.0--http://www.ncsa.uiuc.edu/ Apps/SPRNG; SPRNG 2.0--http://sprng.cs.fsu.edu] test suite and also present results for the tests conducted on the SPRNG generators. These generators have passed some of the largest empirical random number tests.
Strategies to make E-business more customer-centered
Authors: Richard Anderson, Jared Braiterman
Venue: The usability business: making the web work (2001)

Building user-centered business and experience design practices in the unpredictable world of digital business requires diplomacy, flexibility and, above all, creativity. In this chapter, we share our experiences of working within small and large organizations which were trying to "add" customer experience research and testing to e-business design and engineering. Working in leadership positions in four professional services firms and a digital startup, we have found that transforming e-business development practices requires understanding the specifics of each organization - and also stretching the methods and principles of human-computer interaction (HCI).
Computing moments of ratios of quadratic forms in normal variables
Authors: Marc S. Paolella
Venue: Computational Statistics Data Analysis (2003)

The accuracy and speed of numerical methods for computing the moments of a ratio of quadratic forms in normal variables is examined, with particular application to the sample auto-correlation function. Methods based on a saddlepoint approximation are demonstrated to be not only superior to existing approximations, but are numerically reliable and virtually as accurate as the method suitable for exact computations, while taking only a fraction of the time to compute. The new method also maintains its accuracy for time series models near the nonstationary border, which is of significant interest for unit-root inference and also a case for which first-order mean and variance approximations break down. As a wide variety of test statistics and their power functions arising in econometric models are expressible in the general form considered, the method should prove very useful for data analysis and model building.
Optimizing Restoration Capacity in the AT&T Network
Authors: Ken Ambs, Sebastian Cwilich, Mei Deng, David J. Houck, David F. Lynch, Dicky Yan
Venue: Interfaces (2000)

To ensure high network reliability, AT&amp;T employs two basic approaches: preventing failures and responding quickly when failures occur. For AT&amp;T to quickly reroute traffic in the event of a network failure, the network must contain sufficient restoration capacity to carry the displaced demand. A team of AT&amp;T OR experts, network planners, and managers developed a method for determining the appropriate quantity and location of restoration capacity required to restore the demand during any single link failure. The approach centers on a linear programming model to minimize the cost of the restoration network and uses column generation to generate new restoration paths as needed. In about 10 months, the team converted the methodology into a tool to optimize the allocation of restoration capacity. This tool was then extended to plan for the recovery of a switching-center disaster and to reoptimize the entire restoration network. It has contributed to AT&amp;T's achieving high-quality service, while saving valuable resources. It resulted in hundreds of millions of dollars in cost savings and increased revenues.
Plugging-in visualization: experiences integrating a visualization tool with Eclipse
Authors: Rob Lintern, Jeff Michaud, Margaret-Anne Storey, Xiaomin Wu
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

The Eclipse platform presents an opportunity to openly collaborate and share visualization tools amongst the research community and with developers. In this paper, we present our own experiences of "plugging-in" our visualization tool, SHriMP Views, into this environment. The Eclipse platform's Java Development Tools (JDT) and CVS plug-ins provide us with invaluable information on software artifacts relieving us from the burden of creating this functionality from scratch. This allows us to focus our efforts on the quality of our visualizations and, as our tool is now part of a full-featured Java IDE, gives us greater opportunities to evaluate our visualizations. The integration process required us to re-think some of our tool's architecture, strengthening its ability to be plugged into other environments. We step through a real-life scenario, using our newly integrated tool to aid us in merging of two branches of source code. Finally we detail some of the issues we have encountered in this integration and provide recommendations for other developers of visualization tools considering integration with the Eclipse platform.
Role of reactive metals in Ge/Pd/GaAs contact structures
Authors: P. Macháč, V. Peřina
Venue: Microelectronic Engineering (2003)

This article describes the behavior of the contact structures of the Ge/Pd type with addition of a very thin layer of a reactive metal (Ti, Ni, Cr) deposited on the surface of the GaAs plate prior to the metallization. The most suitable structure by the contact resistivity and thermal stability is Ge(40)/Pd(4)/Ti(0.5). This structure showed minimal contact resistivity 2.66 × 10-6 Ωcm2. During the reliability test carried out at 400 °C, the contact resistivity only doubled after 10 h. The RBS measurement results show little mixing between titanium and GaAs. Chromium and nickel reacted with GaAs substrate very strongly. As presumed, the deposited reactive metals reduce the natural oxides on the GaAs surface, the effect of titanium being the most significant.
Inclusion Principle for Linear Time-Varying Systems
Authors: Srdjan S. Stankovic, Dragoslav D. Siljak
Venue: SIAM Journal on Control and Optimization (2003)

The main objective of this paper is to consider time-varying linear systems within the framework of the inclusion principle. Starting from general definitions, conditions are derived for a dynamic system to include a dynamic system of smaller dimension. Particular attention is paid to restriction and aggregation, the most important special cases of inclusion. It is proved, using geometric arguments within the general time-varying context, that any inclusion relationship on a given time-interval can be decomposed into a sequence of restriction-aggregation pairs. Connections between inclusion and zero-state equivalence are discussed. The paper also presents a formulation of the contractibility (expandability) conditions for time-varying state-feedback controllers.
Utilizing a direct model reference adaptive controller for a cardiovascular system
Authors: S. Azadi, H. R. Momeni, A. R. Sharafat
Venue: Iranian Journal of Science and Technology (2002)

The objective of this study is to design robust direct model reference adaptive controller (DMRAC) for a non-linear cardiovascular model over a range of plant parameters representing a variety of physical conditions. The direct adaptive controllers used here require the plant to be almost strictly positive real (ASPR), that is, for a plant to be controlled there must exist a feedback gain such that the resulting closed-loop system is strictly positive real. We designed new compensator so that the system composed of the cardiovascular plant and the compensator satisfies the ASPR condition.Numerous technical papers have considered a small range of gain variations of the cardiovascular system. In most of these works, the controller was designed based on the variations in either time delay or plant gains. Many of the papers have treated the cardiovascular system as a single-input single-output (SISO) plant in which the control output was mean arterial pressure (MAP). We treated the cardiovascular system as a multi-input multi-output (MIMO) plant in which both the MAP and cardiac output (CO) are controlled.We presented a new linear model that provides better approximation than the original linear model. By doing so and utilizing the DMRAC algorithm, we could satisfy the stability conditions for the model, and obtained satisfactory responses in every possible condition for the cardiovascular nonlinear model.
The term orderings which are compatible with composition II
Authors: Jinwang Liu, Zhuojun Liu, Mingsheng Wang
Venue: Journal of Symbolic Computation (2003)

Polynomial composition is the operation of replacing the variables of a polynomial with other polynomials. Let > be a term ordering, if for all terms p and q, p > q implies that p o t > (Θ) > q o lt > (Θ), then we say that composition by Θ is compatible with the term ordering. In (J. Symb. Comput. 25 (1998) 643), Hong proposed the question of how to test if a term ordering is compatible with composition. In this paper, by using elementary rational row operations for matrices, we obtain a decision procedure for Hong's question.
Exploring IR with UNIX tools
Authors: Ken Roger Riggs
Venue: Journal of Computing Sciences in Colleges (2002)

Information retrieval is a complex topic, but simple Unix utilities are capable of demonstrating the essential differences among the major information retrieval paradigms. In order to clearly demonstrate the effect of paradigm choice on results, we have our students program the major IR retrieval algorithms using UNIX primitives. This avoids the overhead and complexity of using a production retrieval system. At the same time the students avoid tedious and error prone I/O programming. The scripts and programs used also allow the student to experiment easily with retrieval methods. The work incidentally provides a compact introduction to UNIX programming.
Combining active and passive network measurements to build scalable monitoring systems on the grid
Authors: Bruce B. Lowekamp
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

Because the network provides the wires that connect a grid, understanding the performance provided by a network is crucial to achieving satisfactory performance from many grid applications. Monitoring the network to predict its performance for applications is an effective solution, but the costs and scalability challenges of actively injecting measurement traffic, as well as the information access and accuracy challenges of using passively collected measurements, complicate the problem of developing a monitoring solution for a global grid. This paper is a preliminary report on the Wren project, which is focused on developing scalable solutions for network performance monitoring. By combining active and passive monitoring techniques, Wren is able to reduce the need for invasive measurements of the network without sacrificing measurement accuracy on either the WAN or LAN levels. Specifically, we present topology-based steering, which dramatically reduces the number of measurements taken for a system by using passively acquired topology and utilization to select the bottleneck links that require active bandwidth probing. Furthermore, by using passive measurements while an application is running and active measurements when none is running, we preserve our ability to offer accurate, timely predictions of network performance, while eliminating additional invasive measurements.
Intersection graphs of maximal hypercubes
Authors: Bostjan Brešar
Venue: European Journal of Combinatorics (2003)

In this paper we consider cube graphs, that is intersection graphs of maximal hypercubes of graphs. In contrast to the related concepts of line graphs and clique graphs, we show that any graph is a cube graph of a (bipartite) graph. We answer a question of Bandelt and Chepoi (European J. Combin. 17 (1996) 113) by showing that dually chordal graphs are precisely cube graphs of graphs of acyclic cubical complexes. Similarly, we characterize classes of chordal graphs, Helly chordal graphs and doubly chordal graphs as cube graphs of certain subclasses of isometric subgraphs of hypercubes.
Optimizing bandwidth
Authors: Geoffrey Fox, Shrideep Pallickara
Venue: Ubiquity (2001)

An approach to high performance distributed Web brokering.
Identity disclosure and the creation of social capital
Authors: David R. Millen, John F. Patterson
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this paper, we describe the identity policy decisions for a community network outside of Boston, Massachusetts. To promote trust and accountability, a member's online identity is their real-world identity; there is no anonymity. We conclude, based on analysis of the online interaction that this identity policy: bridged and enriched online and face-to-face interactions, promoted accountability in support of local commerce, and fostered a social norm of polite conversation.
Combined model for text entry rate development
Authors: Poika Isokoski, I. Scott MacKenzie
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We combine the power law of learning and theoretical upper limit predictions to describe the development of text entry rates from users' first contact to asymptotic expert usage. The combined model makes comparing text entry methods easier. We present the rationale for the model and two candidate implementations. The first is a simple regression model with a reasonable fit to the data. The second fits measured data better, but is more complicated.
Lower semi-continuity of integrals with G-quasiconvex potential
Authors: Marius Buliga
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

This paper introduces the proper notion of variational quasiconvexity associated to a group of bi-Lipschitz homeomorphisms, with possible applications in elasticity. We prove a lower semicontinuity theorem connected to this notion, which improves a result of Dacorogna and Fusco [7]. In the second part of the paper we apply this result to a class of functions, introduced in [5]. Such functions are GL(n,R)+ quasiconvex, hence they induce lower semicontinuous integrals.
A comparison of online and lecture methods for delivering the CS 1 course
Authors: David Olson
Venue: Journal of Computing Sciences in Colleges (2002)

The study examined both completion rates and success scores between students taking a CS 1 course. The sample included 111 students at Western Oregon University. The students were divided into three groups. The traditional group included students not wanting to take the course online. The students volunteering to take the course online were randomly selected for the experimental group and the control group. The experimental group received online instruction. Both the control group and the traditional group received instruction in a lecture setting. The results showed no significance in completion of the course among the three groups. In comparing the success rate among the groups, the students in the control and experimental group scored lower on the weekly quizzes than the students in the traditional group.
A survey of very large-scale neighborhood search techniques
Authors: Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
Venue: Discrete Applied Mathematics (2002)

Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computation time. An improvement algorithm is a heuristic algorithm that generally starts with a feasible solution and iteratively tries to obtain a better solution. Neighborhood search algorithms (alternatively called local search algorithms) are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the "neighborhood" of the current solution. A critical issue in the design of a neighborhood search algorithm is the choice of the neighborhood structure, that is, the manner in which the neighborhood is defined. As a rule of thumb, the larger the neighborhood, the better is the quality of the locally optimal solutions, and the greater is the accuracy of the final solution that is obtained. At the same time, the larger the neighborhood, the longer it takes to search the neighborhood at each iteration. For this reason, a larger neighborhood does not necessarily produce a more effective heuristic unless one can search the larger neighborhood in a very efficient manner. This paper concentrates on neighborhood search algorithms where the size of the neighborhood is "very large" with respect to the size of the input data and in which the neighborhood is searched in an efficient manner. We survey three broad classes of very large-scale neighborhood search (VLSN) algorithms: (1) variable-depth methods in which large neighborhoods are searched heuristically, (2) large neighborhoods in which the neighborhoods are searched using network flow techniques or dynamic programming, and (3) large neighborhoods induced by restrictions of the original problem that are solvable in polynomial time.
Manageable access control for CORBA
Authors: Gerald Brose
Venue: Journal of Computer Security (2002)

Specifying and managing access rights in large distributed systems is a non-trivial task. This paper presents a language-based approach to policy-based management of access rights. We develop an object-oriented access model and a concrete syntax that is designed to allow both flexible and manageable access control policies for CORBA objects. We introduce a typed construct for access rights called view that allows static type checking of specifications and show how a realistic example policy is expressed using this notation.
Effect of powder particle size on the strength of ceramic cores made by injection moulding process
Authors: M. Keyanpour-Rad, R. H. Aghajani, H. A. Mehrabi
Venue: Iranian Journal of Science and Technology (2001)

The effect of powder particle size on the strength of ceramic cores, made by injection moulding of the pastes, is studied in this paper. It was found that finer particle size of the solid materials produced better moulding and debinding of the special wax binder and therefore increased the mechanical strength of the resulting cores.