ppxscal/embedding_network huggingface dataset:
Optimal facility location with random throughput costs
Authors: Nicoletta Ricciardi, Roberto Tadei, Andrea Grosso
Venue: Computers and Operations Research (2002)

In this paper we consider the optimal location and size of facilities where the throughput costs for each facility are random. Given a set of origins and a set of destinations, we want to determine the optimal location and size of a set of intermediate facilities in order to minimize the expected total generalized transportation cost. The generalized transportation cost of a freight unit from an origin to a destination passing through a facility is the sum of two terms: the transportation cost from the origin to the destination through the facility and the throughput cost of the facility. While the first term is deterministic, the second one is stochastic with a Gumbel probability distribution. Looking for the expected value of the optimal solution, a mixed deterministic nonlinear problem for the optimal location of the facilities is derived. Two heuristics, which give very good approximations to the optimum, are proposed.
The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems
Authors: J. Zahorjan, E. D. Lazowska, D. L. Eager
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

Spinning, or busy waiting, is commonly employed in parallel processors when threads ofexecution must wait for some event, such as synchronization with another thread.Because spinning is purely overhead, it is detrimental to both user response time and system throughput. The effects of two environmental factors, multiprogramming and data-dependent execution times, on spinning are discussed, and it is shown how the choice of scheduling discipline can be used to reduce the amount of spinning in each case.
Detection of Cheaters in Vector Space Secret Sharing Schemes
Authors: Carles Padro Germán Sáez Jorge Luis Villar
Venue: Designs, Codes and Cryptography (1999)

A perfect secret sharing scheme is a method of distributing shares of a secret among a set P of participants in such a way that only qualified subsets of P can reconstruct the secret from their shares and non-qualified subsets have absolutely no information on the value of the secret. In a secret sharing scheme, some participants could lie about the value of their shares in order to obtain some illicit benefit. Therefore, the security against cheating is an important issue in the implementation of secret sharing schemes. Two new secret sharing schemes in which cheaters are detected with high probability are presented in this paper. The first one has information rate equal to 1/2 and can be implemented not only in threshold structures, but in a more general family of access structures. We prove that the information rate of this scheme is almost optimal among all schemes with the same security requirements. The second scheme we propose is a threshold scheme in which cheaters are detected with high probability even if they know the secret. The information rate is in this case 1/3. In both schemes, the probability of cheating successfully is a fixed value that is determined by the size of the secret.
Managing Large Software Projects
Authors: Tom DeMarco, Ann Miller
Venue: IEEE Software (1996)

Thirty years ago, as the software industry was first gathering steam, most software projects were run by people with no software experience. Today this is no longer true. Our industry is characterized by managers who have spent most or all of their professional lives in software development. Yet few would argue that the quality of software project management has improved in the same period. While software efforts in general do not seem to be better managed, there are increasing numbers of successes among our largest projects. The Boeing 777 and Lockheed F-16 projects, for example (each covered in this special issue), were successful despite a magnitude that would have daunted software managers even a few years ago.
Multiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases
Authors: Bernhard Braunmüller, Martin Ester, Hans-Peter Kriegel, Jörg Sander
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Metric databases are databases where a metric distance function is defined for pairs of database objects. In such databases, similarity queries in the form of range queries or k-nearest-neighbor queries are the most important query types. In traditional query processing, single queries are issued independently by different users. In many data mining applications, however, the database is typically explored by iteratively asking similarity queries for answers of previous similarity queries. In this paper, we introduce a generic scheme for such data mining algorithms and we investigate two orthogonal approaches, reducing I/O cost as well as CPU cost, to speed-up the processing of multiple similarity queries. The proposed techniques apply to any type of similarity query and to an implementation based on an index or using a sequential scan. Parallelization yields an additional impressive speed-up. An extensive performance evaluation confirms the efficiency of our approach.
Warehouse Creation-A Potential Roadblock to Data Warehousing
Authors: Jaideep Srivastava, Ping-Yao Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Data warehousing is gaining in popularity as organizations realize the benefits of being able to perform sophisticated analyses of their data. Recent years have seen the introduction of a number of data-warehousing engines, from both established database vendors as well as new players. The engines themselves are relatively easy to use and come with a good set of end-user tools. However, there is one key stumbling block to the rapid development of data warehouses, namely that of warehouse population. Specifically, problems arise in populating a warehouse with existing data since it has various types of heterogeneity. Given the lack of good tools, this task has generally been performed by various system integrators, e.g., software consulting organizations which have developed in-house tools and processes for the task. The general conclusion is that the task has proven to be labor-intensive, error-prone, and generally frustrating, leading a number of warehousing projects to be abandoned mid-way through development. However, the picture is not as grim as it appears. The problems that are being encountered in warehouse creation are very similar to those encountered in data integration, and they have been studied for about two decades. However, not all problems relevant to warehouse creation have been solved, and a number of research issues remain. The principal goal of this paper is to identify the common issues in data integration and data-warehouse creation. We hope this will lead: 1) developers of warehouse creation tools to examine and, where appropriate, incorporate the techniques developed for data integration, and 2) researchers in both the data integration and the data warehousing communities to address the open research issues in this important area.
Transmitter Equalization for 4-GBPS Signaling
Authors: William J. Dally, John Poulton
Venue: IEEE Micro (1997)

To operate a serial channel over copper wires at 4 Gb/s, we incorporate an 4-GHz FIR equalizing filter into a differential transmitter. The equalizer cancels the frequency-dependent attenuation caused by the skin-effect resistance of copper wire, giving a frequency response that is flat to within 5% over the band from 200 MHz to 2 GHz even over wires with 6 dB of high-frequency attenuation. All but the last stage of the transmitter operates at 400 MHz. The transmitter output stage uses a stable, 10-phase, 400-MHz clock to sequence an array of drivers that implement the FIR filter. We introduce the concept of digital-signal equalization, describe the system design, and circuit design of our equalizing transmitter, and present simulation results from a 4-Gb/s 0.5-mm CMOS transmitter.
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
Authors: K. W. Ryu, J. JáJ'
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

A hypercube algorithm to solve the list ranking problem is presented. Let n be the length of the list, and let p be the number of processors of the hypercube. The algorithm described runs in time O(n/p) when n= Omega (p/sup 1+ epsilon /) for any constant epsilon, and in time O(n log n/p+log/sup 3/ p) otherwise. This clearly attains a linear speedup when n= Omega (p/sup 1+ epsilon /). Efficient balancing and routing schemes had to be used to achieve the linear speedup. The authors use these techniques to obtain efficient hypercube algorithms for many basic graph problems such as tree expression evaluation, connected and biconnected components, ear decomposition, and st-numbering. These problems are also addressed in the restricted model of one-port communication.
Factorizations of languages and commutativity conditions
Authors: Alexandru Mateescu, Arto Salomaa, Sheng Yu
Venue: Acta Cybernetica (2002)

Representations of languages as a product (catenation) of languages are investigated, where the factor languages are "prime", that is, cannot be decomposed further in a nontrivial manner. In general, such prime decompositions do not necessarily exist. If they exist, they are not necessarily unique - the number of factors can vary even exponentially. The paper investigates prime decompositions, as well as the commuting of the factors, especially for the case of finite languages. In particular, a technique about commuting is developed in Section 4, where the factorization of languages L1 and L2 is discussed under the assumption L1L2 = L2L1.
Innovative Computing Powers Theme Park Adventures
Authors: Michael Macedonia
Venue: Computer (2001)

The tight integration of complex physical sets and 3D computer-generated imagery provides theme park customers with a wild ride.
Self Organization and Coordination
Authors: Scott E. Page
Venue: Computational Economics (2001)

In this paper, I analyze the organization of tasks or activities by a collection of agents. I begin by formally defining organized collections and robustly organized collections of agents in the context of a simple model. Within this framework, I demonstrate that organized collections and robustly organized collections exist and equilibria need not be organized. I then test whether adaptive agents can self-organize in this environment. I find that simple behavioral rules can lead to nearly organized, fairly robust collections of agents.
Linux powers four-wall 3-D display
Authors: Douglas B. Maxwell
Venue: Linux Journal (2002)

With the aid of a custom video switcher, a Linux cluster beats an expensive proprietary UNIX system for high-end virtual reality.
Resource Management in Networked Multimedia Systems
Authors: Klara Nahrstedt, Ralf Steinmetz
Venue: Computer (1995)

The objective of error-free multimedia processing and communication it to manipulate and transmit media under time constraints by providing guaranteed services such as the colloquial telephone. Hence, the control-management level of the host and underlying network architectures has become a key issue of any distributed multimedia system. This paper discusses 'resource management' at the host and network level, and their cooperation to achieve global guaranteed transmission and presentation services, which means end-to-end guarantees. The emphasis is on 'host resources' (e.g., CPU processing time) and 'network resources' (e.g., bandwidth, buffer space) which need to be controlled in order to satisfy the Quality of Service (QoS) requirements set by users of a networked multimedia system. The control of the specified resources involves three actions: to properly allocate resources (end-to-end) during the multimedia call establishment, so that traffic may flow according to the QoS specification; to control resource allocation during the multimedia data transmission; to adapt to changes when degradation of a system components' capacity occurs. These actions imply the necessity of: (a) new services, such as admission control, at the hosts and intermediate network nodes; (b) new protocols for establishing connections which satisfy QoS requirements along the path from sender to receiver(s), such as a resource reservation protocol; (c) new mechanisms for delay, rate, and error control; (d) new resource monitoring protocols for reporting system changes; (e) new adaptive schemes for dynamic resource allocation to respond to system changes; and (f) new architectures in the hosts and switches to accommodate the resource management entities. This article gives an overview of services, mechanisms and protocols for resource management as outlined above.
A Bootstrap Technique for Nearest Neighbor Classifier Design
Authors: Yoshihiko Hamamoto, Shunji Uchimura, Shingo Tomita
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

A bootstrap technique for nearest neighbor classifier design is proposed. Our primary interest in designing a classifier is in small training sample size situations. Conventional bootstrapping techniques sample the training samples with replacement. On the other hand, our technique generates bootstrap samples by locally combining original training samples. The nearest neighbor classifier is designed on the bootstrap samples and is tested on the test samples independent of training samples. The performance of the proposed classifier is demonstrated on three artificial data sets and one real data set. Experimental results show that the nearest neighbor classifier designed on the bootstrap samples outperforms the conventional k-NN classifiers as well as the edited 1-NN classifiers, particularly in high dimensions.
A High School Program in Computer Science
Authors: Judith Gal-Ezer, Catriel Beeri, David Harel, Amiram Yehudai
Venue: Computer (1995)

The authors are part of a committee that has been designing a new high school curriculum in computer science and supervising the preparation of a comprehensive study program based on it. The new program emphasizes the foundations of algorithmic thinking and teaches programming as a way to get the computer to carry out an algorithm. The authors discuss the program and its initial implementation. They begin by discussing the key underlying principles that have guided their work. Then they describe the structure and content of the program, including a 3-unit version of 270 hours and a 5-unit version of 450. The curriculum is divided into five modules: Fundamentals 1 and 2, Software Design, Second Paradigm, Applications, and Theory. The authors describe each module in detail. Next, the authors explain the steps the committee has been taking to get the program under way. They reveal some challenges they have faced in developing the course material. For example, the Fundamentals 1 module had to provide a solid foundation for students who would not study computer science beyond the 10th grade as well as for those who would complete either the 3- or 5-unit program. This program is being tested in Israeli schools. One of the main challenges the committee has faced is a way to provide adequate teacher training.
Big Paybacks from 'Discount' Usability Engineering
Venue: IEEE Software (1990)

No abstract available
Elastostatic inverse formulation
Authors: Wei Xu, Joseph Genin
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

In this paper an inverse method for solving elastostatic problems with incomplete boundary conditions is presented. In general, inverse problems are ill-posed boundary value problems whose stability and uniqueness of solution and sensitivity-based formulations require additional constraints. In the development we use the Betti-reciprocal theorem to represent the boundary traction field in terms of the boundary and field displacements in an integral form. Initially, we assume the unknown boundary conditions and deformations required to solve the problem. In this way we equate the work done by the exact solution (unknown) to the work done by an assumed solution. Discretizing the resulting equations and using an iterative procedure each step in the solution process becomes the solution to a well-posed problem. Thus, with sufficient perturbations the correct boundary conditions are reconstructed.
Global Viewing of Heterogeneous Data Sources
Authors: Silvana Castano, Valeria De Antonellis, Sabrina De Capitani di Vimercati
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

The problem of defining global views of heterogeneous data sources to support querying and cooperation activities is becoming more and more important due to the availability of multiple data sources within complex organizations and in global information systems. Global views are defined to provide a unified representation of the information in the different sources by analyzing conceptual schemas associated with them and resolving possible semantic heterogeneity. In the paper, we propose an affinity-based unification method for global view construction. In the method: 1) The concept of affinity is introduced to assess the level of semantic relationship between elements in different schemas by taking into account semantic heterogeneity; 2) Schema elements are classified by affinity levels using clustering procedures so that their different representations can be analyzed for unification; 3) Global views are constructed starting from selected clusters by unifying representations of their elements. Experiences of applying the proposed unification method and the associated tool environment artemis on databases of the Italian Public Administration information systems are described.
Achieving Scalable Locality with Time Skewing
Authors: David Wonnacott
Venue: International Journal of Parallel Programming (2002)

Microprocessor speed has been growing exponentially faster than memory system speed in the recent past. This paper explores the long term implications of this trend. We define scalable locality, which measures our ability to apply ever faster processors to increasingly large problems (just as scalable parallelism measures our ability to apply more numerous processors to larger problems). We provide an algorithm called time skewing that derives an execution order and storage mapping to produce any desired degree of locality, for certain programs that can be made to exhibit scalable locality. Our approach is unusual in that it derives the transformation from the algorithm's dataflow (a fundamental characteristic of the algorithm) instead of searching a space of transformations of the execution order and array layout used by the programmer (artifacts of the expression of the algorithm). We provide empirical results for data sets using L2 cache, main memory, and virtual memory.
Evaluating Design Metrics on Large-Scale Software
Authors: Wayne M. Zage, Delores M. Zage
Venue: IEEE Software (1993)

Design-quality metrics that are being developed for predicting the potential quality and complexity of the system being developed are discussed. The goal of the metrics is to provide timely design information that can guide a developer in producing a higher quality product. The metrics were tested on projects developed in a university setting with client partners in industry. To further validate the metrics, they were applied to professionally developed systems to test their predictive qualities. The results of applying two design metrics and a composite metric to data from a large-scale industrial project are presented.
A Survey of Web Security
Authors: Aviel D. Rubin, Daniel E. Geer Jr.
Venue: Computer (1998)

With no insult intended to the early Web designers, security was an afterthought. At the outset, the Web's highest goal was seamless availability. Vendors engaged in retrofitting security must contend with the Web environment's peculiarities, which include statelessness, location irrelevance, code and user mobility, and stranger-to-stranger communication. This article presents a survey of Web-specific security issues. The focus is on security in the server and host environments, mobile code, data transport, and anonymity and privacy. The server is the central system and the repository of information resources. The server is thus the locus of threats, whereas the client is largely out of sight. The authors conclude that, although the state of Web security is abysmal, the use of the Web for business will result in a more serious approach to security. They suggest that public-key technology will be the skeleton on which Web security will hang. A trust management paradigm for securing Web commerce will give way to a risk management paradigm, in proportion to the value of the transactions moving on the Web.
Introduction
Authors: Leigh Tesfatsion
Venue: Computational Economics (2001)

A brief overview of agent-based computational economics (ACE) is given, followed by a synopsis of the articles included in this special issue on ACE and in a companion special issue on ACE scheduled to appear in the Journal of Economic Dynamics and Control.
IDDQ Test: Will It Survive the DSM Challenge?
Authors: Sagar S. Sabade, D. M. H. Walker
Venue: IEEE Design Test (2002)

Deep-submicron technologies pose difficultchallenges for IDDQ testing in the future. The lowthreshold voltage used by DSM devicesdecreases the defect resolution of IDDQ. However,because IDDQ is a valuable test method,researchers are working to augment IDDQ with othertest parameters to prolong its effectiveness.
A uniform framework for regulating service access and information release on the web
Authors: Piero A. Bonatti, Pierangela Samarati
Venue: Journal of Computer Security (2002)

The widespread use of Internet-based services is increasing the amount of information (such as user profiles) that clients are required to disclose. This information demand is necessary for regulating access to services, and functionally convenient (e.g., to support service customization), but it has raised privacy-related concerns which, if not addressed, may affect the users disposition to use network services. At the same time, servers need to regulate service access without disclosing entirely the details of their access control policy. There is therefore a pressing need for privacy-aware techniques to regulate access to services open to the network.We propose an approach for regulating service access and information disclosure on the Web. The approach consists of a uniform formal framework to formulate - and reason about - both service access and information disclosure constraints. It also provides a means for parties to communicate their requirements while ensuring that no private information be disclosed and that the communicated requirements are correct with respect to the constraints.
Efficient Randomized Algorithms for Input-Queued Switch Scheduling
Authors: Devavrat Shah, Paolo Giaccone, Balaji Prabhakar
Venue: IEEE Micro (2002)

High-performance schedulers for input-queued (IQ) switches must find, for each time slot, a good matching between inputs and outputs to transfer packets. At high line rates or for large switches, finding good matchings is complicated. A suite of randomized algorithms for switch scheduling provides performance comparable to that of well-known, effective matching algorithms, yet is simple to implement.
Transmission Coefficient Correction for DACs
Authors: Jacob M. Velixon
Venue: IEEE Design Test (1996)

Digital-to-analog converters have been known as the conversion devices from code to voltage for more than 20 years. Many of these converters, achieved as integrated circuits by CMOS and bipolar technologies, have a transmission coefficient error, often called full-scale error. In this article I used the general meaning of "value" and "error." The transmission error is defined by the deviation between resistances of the separate resistor r and the equivalent resistance of network Y - 2Y. This article presents some circuits for the transmission coefficient correction.