ppxscal/embedding_network huggingface dataset:
Classical versus quantum communication complexity
Authors: Amnon Ta-Shma
Venue: ACM SIGACT News (1999)

Classical communication complexity has been intensively studied since its conception two decades ago. Recently, its quantum analogue, the quantum communication complexity model, was defined and studied. In this paper we present some of the main results in the area.
The Ravenscar Profile
Authors: Alan Burns
Venue: ACM SIGAda Ada Letters (1999)

The Ravenscar profile is described. All its features and restrictions are noted. Also, the means of designating the profile is presented. Detailed motivations for the profile are not given. The aim of the paper is to summarize the outcome of deliberations at the 8th and 9th International Workshops on Real-Time Ada Issues.
Image Sequence Analysis via Partial Differential Equations
Authors: Pierre Kornprobst, Rachid Deriche, Gilles Aubert
Venue: Journal of Mathematical Imaging and Vision (1999)

This article deals with the problem of restoring and motion segmenting noisy image sequences with a static background. Usually, motion segmentation and image restoration are considered separately in image sequence restoration. Moreover, motion segmentation is often noise sensitive. In this article, the motion segmentation and the image restoration parts are performed in a coupled way, allowing the motion segmentation part to positively influence the restoration part and vice-versa. This is the key of our approach that allows to deal simultaneously with the problem of restoration and motion segmentation. To this end, we propose a theoretically justified optimization problem that permits to take into account both requirements. The model is theoretically justified. Existence and unicity are proved in the space of bounded variations. A suitable numerical scheme based on half quadratic minimization is then proposed and its convergence and stability demonstrated. Experimental results obtained on noisy synthetic data and real images will illustrate the capabilities of this original and promising approach.
Context-sensitive learning methods for text categorization
Authors: William W. Cohen, Yoram Singer
Venue: ACM Transactions on Information Systems (TOIS) (1999)

Two recently implemented machine-learning algorithms, RIPPERand sleeping-experts for phrases, are evaluated on a number of large text categorization problems. These algorithms both construct classifiers that allow the &ldquo;context&rdquo; of a word w to affect how (or even whether) the presence or absence of w will contribute to a classification. However, RIPPER and sleeping-experts differ radically in many other respects: differences include different notions as to what constitutes a context, different ways of combining contexts to construct a classifier, different methods to search for a combination of contexts, and different criteria as to what contexts should be included in such a combination. In spite of these differences, both RIPPER and sleeping-experts perform extremely well across a wide variety of categorization problems, generally outperforming previously applied learning methods. We view this result as a confirmation of the usefulness of classifiers that represent contextual information.
Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
Authors: Vic Baston, Shmuel Gal
Venue: SIAM Journal on Control and Optimization (1998)

Two players A and B are randomly placed on a line. The distribution of the distance between them is unknown except that the expected initial distance of the (two) players does not exceed some constant $\mu.$ The players can move with maximal velocity 1 and would like to meet one another as soon as possible. Most of the paper deals with the asymmetric rendezvous in which each player can use a different trajectory. We find rendezvous trajectories which are efficient against all probability distributions in the above class. (It turns out that our trajectories do not depend on the value of $\mu.$) We also obtain the minimax trajectory of player A if player B just waits for him. This trajectory oscillates with a geometrically increasing amplitude. It guarantees an expected meeting time not exceeding $6.8\mu.$ We show that, if player B also moves, then the expected meeting time can be reduced to $5.7\mu.$The expected meeting time can be further reduced if the players use mixed strategies. We show that if player B rests, then the optimal strategy of player A is a mixture of geometric trajectories. It guarantees an expected meeting time not exceeding $4.6\mu.$ This value can be reduced even more (below $4.42\mu$) if player B also moves according to a (correlated) mixed strategy. We also obtain a bound for the expected meeting time of the corresponding symmetric rendezvous problem.
Invisible Work of Telephone Operators: An Ethnocritical Analysis
Authors: Michael J. Muller
Venue: Computer Supported Cooperative Work (1999)

This paper applies principles derived from ethnocriticism to help explain differential outcomes with different methods used to analyze the work of Directory Assistance telephone operators in a large US telecommunications company. The work of Directory Assistance operators provides a subtle case of computer-supported cooperative work. Collaborative work between operator and customer is supported and shaped by digitized-voice and database technologies. Our work also involved the introduction of additional voice-recognition technologies to this human-to-human collaboration. In a previous paper, we used methods from participatory design to show that knowledge work is a major component of the operators&lsquo; conversations with customers. By contrast, other research using formal cognitive task analyses had described operators&lsquo; work as routine and as involving no active problem solving. How had evidence that we had found so compelling been invisible to other analysts? I analyze the concept of &rsquo;&rsquo;invisible work&lsquo;&lsquo; as an attribute not of the work, but rather of the perspectives from which that work appeared to be invisible. Ethnocritical heuristics help us to contrast the analytical methods and their outcomes.
Broadly Decreasing Risk Aversion
Authors: Gregory M. Gelles, Douglas W. Mitchell
Venue: Management Science (1999)

This paper considers decision-making in the presence of two additive risk sources, with no restrictions on the relation between the two risks. A utility function is said to exhibit broad DARA if and only if a rise in wealth always decreases the magnitude of the risk premium for one of the risks vis-a-vis the other. A condition on utility functions giving this property is derived: utility must be of the linear plus exponential form. It is shown that certain problems involving portfolios and risk-averse firms give unambiguous comparative statics if and only if utility exhibits broad DARA.
Solving the Minimum Weighted Integer Coloring Problem
Authors: Jue Xue
Venue: Computational Optimization and Applications (1998)

In this paper, we present, as we are aware of, the first combinatorialalgorithm specifically designed for the minimum weighted integercoloring problem ({\it MWIP}). We test the algorithm on randomly generated graphs with integer weights uniformly drawn from intervals &lsqb;1, 1&rsqb;, &lsqb;1, 2&rsqb;, &lsqb;1, 5&rsqb;, &lsqb;1, 10&rsqb;, &lsqb;1, 15&rsqb;, and &lsqb;1, 20&rsqb;. We also use theproposed algorithm to test the quality of a simple, yet effectiveheuristic for the {\it MWIPS} in the literature. We have observed from our test that: i( the algorithm is able to solve {\it MWIPS} on graphs of up to 20 vertices when the average vertex weights is not too large&semi; ii( The relative gap between the simple heuristic solutions and the optimal solution seems to decrease as the average vertex weight increases. A rough comparison with the state-of-the-art methods for the minimum unweighted coloring problem seems to suggest the advantage of solving {\it MWIPS} directly.
PROMS: a PRO-active Monitoring System for SS7 networks
Authors: Ren-Hung M. Hwang, Pao-Ta M. Yu
Venue: International Journal of Network Management (2000)

In this paper, we propose a PRO-active Monitoring System &lpar;PROMS&rpar; for SS7 networks, which actively monitors all signaling network management messages of SS7 networks, alerts operators when there is a potential network error, and provides intelligent diagnosis based on fuzzy logic and neural networks. Copyright &copy; 2000 John Wiley Sons, Ltd.
Groupware comes to the Internet: charting a new world
Authors: Bradley C. Wheeler, Alan R. Dennis, Laurence I. Press
Venue: ACM SIGMIS Database (1999)

Early experiences with Web-based groupware point to new collaboration opportunities within and between organizations. We report the results of a study of more than 100 organizations that have used Web-based groupware to understand better how they are using it and what advantages and disadvantages they have experienced. We then use these data to develop a framework for analyzing and assessing the fit of groupware systems to organizational needs. We close with a discussion of the evolution and future of groupware.
Towards a taxonomy of software connectors
Authors: Nikunj R. Mehta, Nenad Medvidovic, Sandeep Phadke
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

Software systems of today are frequently composed from prefabricated, heterogeneous components that provide complex functionality and engage in complex interactions. Existing research on component-based development has mostly focused on component structure, interfaces, and functionality. Recently, software architecture has emerged as an area that also places significant importance on component interactions, embodied in the notion of software connectors. However, the current level of understanding and support for connectors has been insufficient. This has resulted in their inconsistent treatment and a notable lack of understanding of what the fundamental building blocks of software interaction are and how they can be composed into more complex interactions. This paper attempts to address this problem. It presents a comprehensive classification framework and taxonomy of software connectors. The taxonomy is obtained through an extensive analysis of existing component interactions. The taxonomy is used both to understand existing software connectors and to suggest new, unprecedented connectors. We demonstrate the use of the taxonomy on the architecture of a large, existing system.
Asymptotic Solution of Stiff PDEs with the CSP Method: The Reaction Diffusion Equation
Authors: M. Hadjinicolaou, D. A. Goussis
Venue: SIAM Journal on Scientific Computing (1999)

The computational singular perturbation (CSP) method is employed for the solution of stiff PDEs and for the acquisition of the most important physical understanding. The usefulness of the method is demonstrated by analyzing a transient reaction-diffusion problem. It is shown that in the regions where the solution exhibits smooth spatial slopes, a simple nonstiff system of equations can be used instead of the full governing equations. From the simplified system, which is numerically provided by CSP and whose structure varies with space and time, important physical information comes to light. The relation of this method to the class of asymptotic expansion methods is explored. It is shown that the CSP results are identical to the ones obtained by the asymptotic methods. The identifications of the nondimensional parameters and the tedious manipulations needed by the asymptotic methods are performed by programmable numerical or analytic computations specified by CSP. Preliminary numerical results are presented validating the theoretical aspects of the proposed algorithm and providing a measure of its usefulness and its accuracy.
Minimum requirements for effective distance teaching systems
Authors: Geraldo Lino de Campos
Venue: ACM SIGCSE Bulletin (1999)

The first practical video conferencing systems were introduced at the Fourth World Telecommunications Forum held in Geneva in 1983 [Eva95], but their use is still rare. By comparison, the personal computer, introduce about the same time, is now a commodity sold by the millions.That is surprising, considering the cost and time savings associated with teleconferencing and the economy of scale achievable by teleteaching.This paper presents the position that lack of quantity and quality in the transmission process are responsible for the low success.
Design for Testability Techniques at the Behavioraland Register-Transfer Levels
Authors: Sujit Dey, Anand Raghunathan, Kenneth D. Wagner
Venue: Journal of Electronic Testing: Theory and Applications (1998)

Improving testability during the early stages of the design flow can have several benefits, including significantly improved fault coverage, reduced test hardware overheads, and reduced design iteration times. This paper presents an overview of high-level design methodologies that consider testability during the early (behavior and architecture) stages of the design flow, and their testability benefits. The topics reviewed include behavioral and RTL test synthesis approaches that generate easily testable implementations targeting ATPG (full and partial scan) and BIST methodologies, and techniques to use high-level information for ATPG.
Dynamically generating problems on static scope
Authors: Amruth Kumar
Venue: ACM SIGCSE Bulletin (2000)

Solving problems is an integral part of learning in Computer Science. In order to provide students with a vast supply of problems with which to practice, we propose to use applets that automatically generate problems. In this paper, we first discuss the capabilities required of such applets, and then, present the design and features of an applet we have developed to automatically generate problems on static scope in Pascal.
Web design and maintenance
Authors: Jerry Berkman
Venue: ACM SIGUCCS Newsletter (1998)

In the last few years, there has been a transformation from publishing documentation on paper to publishing online on the Web. Unlike publishing on paper, we do not have a wealth of experience in publishing via the Web. This paper discusses some guidelines for making Web publishing more valuable.
Performance prediction of a parallel simulator
Authors: Jason Liu, David Nicol, Brian J. Premore, Anna L. Poplawski
Venue: Proceedings of the thirteenth workshop on Parallel and distributed simulation (1999)

There are at least three major obstacles thwarting wide-spread adoption of parallel discrete-event simulation (a) lack of need, (b) lack of tools, (c) lack of predictability in behavior and performance. The plain truth is that most simulation studies can be adequately done on ordinary serial computers. Parallel simulation tools are products of re-search efforts, and simply don't stand up to the demands of modern software engineering. The results of 20 years of research in parallel simulation reveal it to be a highly complex endevour, with performance results very much dependent on implementation details and model characteristics.
Endogeneity in Brand Choice Models
Authors: J. Miguel Villas-Boas, Russell S. Winer
Venue: Management Science (1999)

Applications of random utility models to scanner data have been widely presented in marketing for the last 20 years. One particular problem with these applications is that they have ignored possible correlations between the independent variables in the deterministic component of utility (price, promotion, etc.) and the stochastic component or error term. In fact, marketing-mix variables, such as price, not only affect brand purchasing probabilities but are themselves endogenously set by marketing managers. This work tests whether these endogeneity problems are important enough to warrant consideration when estimating random utility models with scanner panel data. Our results show that not accounting for endogeneity may result in a substantial bias in the parameter estimates.
Estimation of analogue pre-filtering characteristics for CORSA standardisation
Authors: X. Q. Sun, B. M. G. Cheetham, K. G. Evans, J. E. Earis
Venue: Technology and Health Care (1998)

This paper is concerned with devising a standard procedure for determining the gain and phase responses of the analogue filters used to pre-process pulmonary signals prior to their digitisation. The customary high-pass filtering, in particular, will strongly affect the time-domain wave-shapes of digitised signals and this must be taken into account when analysing the signals. Several means of determining the effect of the high-pass filtering are investigated and a measurement procedure is proposed which may be easily carried out using simple laboratory equipment.
The Efficient Computation of Structured Gradients using Automatic Differentiation
Authors: Thomas F. Coleman, Gudbjorn F. Jonsson
Venue: SIAM Journal on Scientific Computing (1999)

The advent of robust automatic differentiation tools is an exciting and important development in scientific computing. It is particularly noteworthy that the gradient of a scalar-valued function of many variables can be computed with essentially the same time complexity as required to evaluate the function itself. This is true, in theory, when the "reverse mode" of automatic differentiation is used (whereas the "forward mode" introduces an additional factor corresponding to the problem dimension). However, in practice, performance on large problems can be significantly (and unacceptably) worse than predicted. In this paper we illustrate that when natural structure is exploited, fast gradient computation can be recovered, even for large dimensional problems.
SOI technology and tools (abstract only)
Authors: Sani R. Nassif, Tuyen V. Nguyen
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

SOI represents a technology shift comparable in Impact to the shift from NMOS to CMOS. It has impacts on many aspects of modeling, simulation and analysis, and presents some unique challenges due to the presence of a number of electrical phenomena unique to SOI.In this tutorial, we will review SOI technology, touching specifically on devices and models, as well as the impact of the floating body and parasitic bipolar effects. We show examples of the impact of these electrical phenomena on circuit behavior and balance that against existing sources of variation such as power supply variations, signal-to-signal coupling and processing fluctuations. We will then show the impact of these phenomena on relevant areas of ECADD such as circuit simulation, timing (or fast circuit) simulation, static timing analysis, power and thermal estimation, synthesis/technology mapping and physical design.This paper proposes lazy group sifting for dynamic variable re-ordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables and their corresponding next state variables. This is done to produce better variable orderings during image computation without causing BDD size blowup in the substitution of next state variables with present state variables at the end of image computation. Experimental results show that our approach is more robust in state traversal than the approaches that either unconditionally group variable pairs or never group them.
Intelligent interdomain distributed service management
Authors: Cynthia Della Torre Cicalese, Martha Della Torre Kahn, John Della Torre DeCarlo, Pushkar Della Torre Varna
Venue: International Journal of Network Management (1999)

This article presents an overview of a prototype for management of a large-scale distributed system. The prototype objective is to demonstrate a capability for intelligent management of distributed services, which correlates network and service elemelements faults to diagnose events. Copyright &copy; 1999 John Wiley Sons, Ltd.
Clock skew scheduling for improved reliability via quadratic programming
Authors: Ivan S. Kourtev, Eby G. Friedman
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadratic programming (QP) problem is introduced. The concept of a permissible range, or a valid interval, for the clock skew of each local data path is key to this QP approach. From a reliability perspective, the ideal clock schedule corresponds to each clock skew within the circuit being at the center of the respective permissible range. However, this ideal clock schedule is not practically implementable because of limitations imposed by the connectivity among the registers within the circuit. To evaluate the reliability, a quadratic cost function is introduced as the Euclidean distance between the ideal schedule and a given practically feasible clock schedule. This cost function is the minimization objective of the described algorithms for the solution of the previously mentioned quadratic program. Furthermore, the work described here substantially differs from previous research in that it permits complete control over specific clock signal delays or skews within the circuit. Specifically, the algorithms described here can be employed to obtain results with explicitly specified target values of important clock delays/skews with a circuit, such as for example, the clock delays/skews for I/O registers. An additional benefit is a potential reduction in clock period of up to 10%. An efficient mathematical algorithm is derived for the solution of the QP problem with &Ogr;(r3) run time complexity and &Ogr;(r2) storage complexity, where r is the number of registers in the circuit. The algorithm is implemented as a C++ program and demonstrated on the ISCAS'89 suite of benchmark circuits as well as on a number of industrial circuits. The work described here yields additional insights into the correlation between circuit structure and circuit timing by characterizing the degree to which specific signal paths limit the overall performance and reliability of a circuit. This information is directly applicable to logic and architectural synthesis.
Using Java and the socket interface in teaching client/server programming
Authors: Andrew Yang, Yael Bachar
Venue: ACM SIGCSE Bulletin (1999)

In this poster, we present our experience developing JAVA applets and applications to create a client/server system on the world wide web, and show how the product is used in upper-division computer science classes.The set of programs consist of a client and a server. The client program in the prototype is a JAVA applet that is downloaded into the client machine and is executed in a user's web browser using the local memory, CPU and other resources. The server program in the prototype is a JAVA application that runs on a web server all the time. The client and the server programs use the socket interface [ Comer amp;Stevens 96] as the communication protocol, and are able to transmit data back and forth successfully over the internet. Figure 1 illustrates how the client and the server communicate over the socket interface.With the set of programs in place, students in the upper-division computer science classes, including software engineering, databases systems, and distributed application development, are able to build their own software for the course projects, on top of the software prototypes.Revision of a given set of JAVA programs proves to be a better approach in learning client/server programming using JAVA and sockets, compared to requiring students to create JAVA programs from the scratch.