ppxscal/embedding_network huggingface dataset:
Allocating Data and Operations to Nodes in Distributed Database Design
Authors: Salvatore T. March, Sangkyu Rho
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

The allocation of data and operations to nodes in a computer communications network is a critical issue in distributed database design. An efficient distributed database design must trade off performance and cost among retrieval and update activities at the various nodes. It must consider the concurrency control mechanism used as well as capacity constraints at nodes and on links in the network. It must determine where data will be allocated, the degree of data replication, which copy of the data will be used for each retrieval activity, and where operations such as select, project, join, and union will be performed. We develop a comprehensive mathematical modeling approach for this problem. The approach first generates units of data (file fragments) to be allocated from a logical data model representation and a characterization of retrieval and update activities. Retrieval and update activities are then decomposed into relational operations on these fragments. Both fragments and operations on them are then allocated to nodes using a mathematical modeling approach. The mathematical model considers network communication, local processing, and data storage costs. A genetic algorithm is developed to solve this mathematical formulation.
On-the-Fly Program Modification: Systems for Dynamic Updating
Authors: Mark E. Segal, Ophir Frieder
Venue: IEEE Software (1993)

Several dynamic software-based updating systems that are in the research and production stages are described. In particular, the procedure-oriented dynamic updating system (PODUS) is discussed. In PODUS, a program is updated by loading the new version of the program and replacing each old procedure with its corresponding new procedure during execution. Updating a procedure involves changing the binding from its current version to the new version. When all procedures have been replaced by their corresponding new versions, the program update is completed.
A General Framework for Debugging
Authors: Keijiro Araki, Zengo Furukawa, Jingde Cheng
Venue: IEEE Software (1991)

The state of the art of debugging is examined. A debugged process model that serves as the basis of a general debugging framework is described. The relationship of the model to traditional debugging processes and support tools is discussed. A minimal set of requirements for a general debugging framework is described in terms of both the theory behind debugging methodologies and the support tools. An execution monitor, Eden, that serves as a debugging tool within this general framework is described.
Deterministic Test Vector Compression/Decompression for Systems-on-a-Chip Using an Embedded Processor
Authors: Abhijit Jas, Nur A. Touba
Venue: Journal of Electronic Testing: Theory and Applications (2002)

A novel approach for using an embedded processor to aid in deterministic testing of the other components of a system-on-a-chip (SOC) is presented. The tester loads a program along with compressed test data into the processor's on-chip memory. The processor executes the program which decompresses the test data and applies it to scan chains in the other components of the SOC to test them. The program itself is very simple and compact, and the decompression is done very rapidly, hence this approach reduces both the amount of data that must be stored on the tester and reduces the test time. Moreover, it enables at-speed scan shifting even with a slow tester (i.e., a tester whose maximum clock rate is slower than the SOC's normal operating clock rate). A procedure is described for converting a set of test cubes (i.e., test vectors where the unspecified inputs are left as X's) into a compressed form. A program that can be run on an embedded processor is then given for decompressing the test cubes and applying them to scan chains on the chip. Experimental results indicate a significant amount of compression can be achieved resulting in less data that must be stored on the tester (i.e., smaller tester memory requirement) and less time to transfer the test data from the tester to the chip.
Uniform Stimulation Systems
Authors: A. P. Karavaev
Venue: Automation and Remote Control (2003)

Even if the managers are well aware of the abilities of their subordinates, they often have to use uniform systems of labor remuneration, that is, to fix the payments to the employees so that they are defined uniformly exceptionally by the results of their work, rather than directly by their abilities. The present work studied the properties of uniform systems of labor remuneration in the active systems consisting of a principal and several subordinated agents. Realization of identical actions by various agents was considered in detail. Relationship between the stimulation function and the function of action, which is understood as the dependence of the vector of actions chosen by the agent on its abilities, was studied.
Design Issues in Parallel Simulation Languages
Authors: Hassan Rajaei, Rassul Ayani
Venue: IEEE Design Test (1993)

The authors address several key issues in designing languages for parallel discrete-event simulation and survey the state-of-the-art techniques aimed at solving these problems. Attention is given to issues that are specific to parallel simulation, e.g., the parallel synchronization schemes, or issues that have not previously been a problem for sequential simulation, e.g., termination. Various specialized PSLs (parallel simulation languages) may also have quite different design issues. The problem of achieving transparency is addressed. In particular it is observed that a major difficulty in achieving the design criteria is the overhead introduced by the methods for solving the problems considered. In some cases making the design criteria less constrained appears to be unavoidable. The authors also propose several useful high-level language constructs to facilitate modeling in order to have the simulation system deal with the low-level details transparently. They show that extending the capability of an existing programming language is the simplest available technique for designing a PSL.
Towards a Formalism to Produce a Programmer Assistant CASE Tool
Authors: D. E. Cooke
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A weak specification method important to the area of computer-aided software engineering (CASE) is introduced. The specification language introduced does not require the specification of control flow information. When given a specification consisting of a formula characterizing input constraints of a function and a formula characterizing output constraints, it is possible to synthesize program functions. The synthesis algorithm is guaranteed to find all functions which satisfy the specification. It is shown that when the algorithm is applied to the specifications, it is capable of producing all program structures, including sequences, selections, and iterations. Therefore, the methodology provides for a formal foundation upon which a CASE programmer assistant tool can be built.
Rule-Based System Validation through Automatic Identification of Equivalence Classes
Authors: Gary W. Rosenwald, Chen-Ching Liu
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

The proposed validation method identifies equivalence classes for fundamental tasks in a rule-based system to help identify incorrect knowledge and rule inconsistencies. The proposed method validates the entire input domain of a pre-existing rule-based system by using symbolic execution to determine the conditions under which tasks may be instantiated.
Collaborative Multimedia Systems: Synthesis of Media Objects
Authors: K. Selçuk Candan, P. Venkat Rangan, V. s. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

When a group {I1, ..., In} of individuals wishes to collaboratively construct a complex multimedia document, the first requirement is that they be able to manipulate media-objects created by one another. For instance, if individual Ij wishes to access some media objects present at participant Ik's site, he must be able to: 1) retrieve this object from across the network, 2) ensure that the object is in a form that is compatible with the viewing/editing resources he has available at his node, and 3) ensure that the object has the desired quality (such as image size and resolution). Furthermore, he must be able to achieve these goals at the lowest possible cost. In this paper, we develop a theory of media objects, and present optimal algorithms for collaborative object sharing/synthesis of the sort envisaged above. We then extend the algorithms to incorporate quality constraints (such as image size) as well as distribution across multiple nodes. The theoretical model is validated by an experimental implementation that supports the theoretical results.
On the Natural Selection of Market Choice
Authors: Aviv Bergman, Moshe Tennenholtz
Venue: Autonomous Agents and Multi-Agent Systems (2002)

An evolutionary approach to the problem of economic mechanism choice is presented. It demonstrates the power that a single participant has on the choice of a preferred market mechanism. A population of sellers, each with one of two possible economic mechanisms, facing potential buyers, is presented as a test model. It is shown that if two auctions, such as first- and second-price auctions, are to attract an identical number of buyers, although under the model assumptions their expected revenues are identical, sellers using a first-price auction mechanism will be selected for. However, if a second-price auction attracts one additional buyer, then it will be selected for by the evolutionary process. These results are extended to the choice between an arbitrary k- and l-price auctions.
Current Testing Procedure for Deep Submicron Devices
Authors: Anton Chichkov, Dirk Merlier, Peter Cox
Venue: Journal of Electronic Testing: Theory and Applications (2001)

This paper presents a test technique that employs two different supply voltages for the same IDDQ pattern. The results of the two measurements are subtracted in order to eliminate the inherent sub-threshold leakage. Summary of the experiment carried out on &ldquo;System on a Chip&rdquo; (SOC) device build in 0.35 &mu; technology is also shown. These experiments proved that the method is effective in detecting failures not detectable with the single limit IDDQ.
Exploiting Data Mining Techniques for Broadcasting Data in Mobile Computing Environments
Authors: Yücel Saygin, Özgür Ulusoy
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Mobile computers can be equipped with wireless communication devices that enable users to access data services from any location. In wireless communication, the server-to-client (downlink) communication bandwidth is much higher than the client-to-server (uplink) communication bandwidth. This asymmetry makes the dissemination of data to client machines a desirable approach. However, dissemination of data by broadcasting may induce high access latency in case the number of broadcast data items is large. In this paper, we propose two methods aiming to reduce client access latency of broadcast data. Our methods are based on analyzing the broadcast history (i.e., the chronological sequence of items that have been requested by clients) using data mining techniques. With the first method, the data items in the broadcast disk are organized in such a way that the items requested subsequently are placed close to each other. The second method focuses on improving the cache hit ratio to be able to decrease the access latency. It enables clients to prefetch the data from the broadcast disk based on the rules extracted from previous data request patterns. The proposed methods are implemented on a Web log to estimate their effectiveness. It is shown through performance experiments that the proposed rule-based methods are effective in improving the system performance in terms of the average latency as well as the cache hit ratio of mobile clients.
Horizon occlusion culling for real-time rendering of hierarchical terrains
Authors: Brandon Lloyd, Parris Egbert
Venue: Proceedings of the conference on Visualization '02 (2002)

We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional storage, yet leads to 2-4 times improvement in framerate for views with high degrees of occlusion. Our method is based on the well-known occlusion horizon algorithm. We show how to adapt the algorithm for use with hierarchical terrains. The occlusion horizon is constructed as the terrain is traversed in an approximate front to back ordering. Regions of the terrain are compared to the horizon to determine when they are completely occluded from the viewpoint. Culling these regions leads to significant savings in rendering.
Enhanced Co-Scheduling: A Software Pipelining Method Using Modulo-Scheduled Pipeline Theory
Authors: R. Govindarajan, N. S. S. Narasimha Rao, E. R. Altman, Guang R. Gao
Venue: International Journal of Parallel Programming (2000)

Instruction scheduling methods which use the concepts developed by the classical pipeline theory have been proposed for architectures involving deeply pipelined function units. These methods rely on the construction of state diagrams (or automatons) to (i) efficiently represent the complex resource usage pattern; and (ii) analyze legal initiation sequences, i.e., those which do not cause a structural hazard. In this paper, we propose a state-diagram based approach for modulo scheduling or software pipelining, an instruction scheduling method for loops. Our approach adapts the classical pipeline theory for modulo scheduling, and, hence, the resulting theory is called Modulo-Scheduled pipeline (MS-pipeline) theory. The state diagram, called the Modulo-Scheduled (MS) state diagram is helpful in identifying legal initiation or latency sequences, that improve the number of instructions initiated in a pipeline. An efficient method, called Co-scheduling, which uses the legal initiation sequences as guidelines for constructing software pipelined schedules has been proposed in this paper. However, the complexity of the constructed MS-state diagram limits the usefulness of our Co-scheduling method. Further analysis of the MS-pipeline theory, reveals that the space complexity of the MS-state diagram can be significantly reduced by identifying primary paths. We develop the underlying theory to establish that the reduced MS-state diagram consisting only of primary paths is complete; i.e., it retains all the useful information represented by the original state diagram as far as scheduling of operations is concerned. Our experiments show that the number of paths in the reduced state diagram is significantly lower&mdash;by 1 to 3 orders of magnitude&mdash;compared to the number of paths in the original state diagram. The reduction in the state diagram facilitate the Co-scheduling method to consider multiple initiations sequences, and hence obtain more efficient schedules. We call the resulting method, enhanced Co-scheduling. The enhanced Co-scheduling method produced efficient schedules when tested on a set of 1153 benchmark loops. Further the schedules produced by this method are significantly better than those produced by Huff's Slack Scheduling method, a competitive software pipelining method, in terms of both the initiation interval of the schedules and the time taken to construct them.
A Web-Based Financial Trading System
Authors: Ming Fan, Jan Stallaert, Andrew B. Whinston
Venue: Computer (1999)

A new electronic financial market is fast emerging. Connected by high-speed networks, buyers and sellers are gathering in virtual marketplaces and revolutionizing the way business is conducted. The financial services industry, among the most innovative and aggressive in its use of IT, has created an entirely new online brokerage industry in just a few years. The principal functions of financial markets are to bring buyers and sellers together and to provide a price discovery mechanism for the assets being traded. In this article, the authors describe their financial bundle trading system (FBTS), a Web-based continuous electronic market that traders can use to execute bundle orders. With a bundle order, a trader can order a combination of stocks or assets. FBTS is in an experimental stage and is being extensively used for research at the University of Texas at Austin. Rapid advances in IT and growing competition are causing fundamental changes in the world's financial services industry. Because the FBTS is based on distributed objects, it has significant advantages over systems built with CGI scripts.
Complex systems in APL: fractals, evolving cellular automata and artificial life
Authors: Manuel Alfonseca, Alfonso Ortega, Marina de la Cruz
Venue: Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications (2002)

We have been working for several years on the representation, study and simulation of complex systems by means of formal methods. APL2 and other programming languages have been used to develop our tools and experiments. This paper summarizes our APL2 works on fractal sets, automatic programming of cellular automata and simulation of multi agent systems.
Interpolation of cones and shape-preserving approximation
Authors: Inna Kozlov
Venue: Journal of Approximation Theory (2002)

In this paper, we present an approach to shape-preserving approximation based on interpolation space theory. In particular, we prove the corresponding approximation result related to the intersection property of the cone of nonnegative functions with respect to the couple (<i>L<inf>p</inf>,B<inf>p</inf><sup>α,∞</sup></i>).
Managing Conflict in System Diagnosis
Authors: John W. Sheppard, William R. Simpson
Venue: Computer (1998)

As systems grow in complexity, the need for reliable testing and diagnosis grows accordingly. The design of complex systems has been facilitated by CAD/CAE tools. Unfortunately, test engineering tools have not kept pace with design tools, and test engineers are having difficulty developing reliable procedures to satisfy the test requirements of modern systems. When testing a complex system, what is the proper response to unexpected and conflicting test results? Should the results be scrapped and the tests rerun? Should the system be replaced or redesigned? Should the test procedures be redeveloped? Determining the best answers to these questions is not easy. In fact, each of these options might be more drastic than necessary for handling conflict in a meaningful way. In this article, we discuss two approaches to system diagnosis that apply several tests and interpret the results based on an underlying model of the system being tested. These tests are used to determine if the system is functioning properly and, if not, to explain the faulty performance. By examining potential sources of conflict and the way conflict might become manifest in a reasoning system, we developed an approach to extend diagnosis to handle the conflict and draw more reliable conclusions.
Validating Trace-Driven Microarchitectural Simulations
Authors: Humayun Khalid
Venue: IEEE Micro (2000)

The increasing complexity of realistic benchmarks combined with the relatively sluggish rate of detailed performance analysis has resulted in an ever-increasing gap between the size of the workload and the speed of analysis. We have presented a methodology for generating and validating representative input sampled data (traces) from SPEC95 benchmark suite using R-metric and K-metric. Experimental results demonstrate the superiority of our proposed technique over the existing popular profile-driven methodology and the uniform sampling approach.
European Activities for EDA Standardization
Authors: Anton Sauer, Jean Piere Tual, Robin La Fontaine
Venue: IEEE Micro (1992)

Current European activities for standardization in the field of electronic design automation are discussed. The activities concentrate mainly in the areas of system description languages (VHDL), data interchange formats (EDIF), and development environments, (frameworks). It is shown that, in support of these three areas, information modeling and standard interoperability became important areas of investigation. The roles of the European CAD Standardization Initiative (ECSI) and the European CAD Integration Project (ECIP) in the standardization effort are described.
The Reliability of Approximate Testability Measures
Authors: Leendert M. Huisman
Venue: IEEE Design Test (1988)

Techniques for gauging the accuracy of approximate testability measures that estimate the random-pattern testability of gate-level faults in designs with combinational logic are considered. The measures examined are overall fault-exposure distribution, high coverage, and fault grading. Sampling techniques are compared with the Stafan and Protest approximate testability measures. For random-pattern testing, it is clear that state-of-the-art testability measures like Stafan and Protest do provide some information about the testability of single faults or complete designs, but this information is not accurate; in many areas of use they cannot compete with carefully chosen sampling techniques. The three techniques described here are applicable to testing strategies other than the random-pattern testing of stuck-at faults; they are equally useful in a weighted random-pattern testing environment, for example.
A Framework for Learning in Search-Based Systems
Authors: Sudeshna Sarkar, P. p. Chakrabarti, Sujoy Ghose
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

In this paper, we provide an overall framework for learning in search-based systems that are used to find optimum solutions to problems. This framework assumes that prior knowledge is available in the form of one or more heuristic functions (or features) of the problem domain. An appropriate clustering strategy is used to partition the state space into a number of classes based on the available features. The number of classes formed will depend on the resource constraints of the system. In the training phase, example problems are run using a standard admissible search algorithm. In this phase, heuristic information corresponding to each class is learned. This new information can be used in the problem-solving phase by appropriate search algorithms so that subsequent problem instances can be solved more efficiently. In this framework, we also show that heuristic information of forms other than the conventional single-valued underestimate value can be used, since we maintain the heuristic of each class explicitly. We show some novel search algorithms that can work with some such forms. Experimental results have been provided for some domains.