ppxscal/embedding_network huggingface dataset:
Clocking Optimization and Distribution in Digital Systemswith Scheduled Skews
Authors: Hong-Yean Hsieh, Wentai Liu, Paul Franzon, Ralph Cavin,  III
Venue: Journal of VLSI Signal Processing Systems (1997)

System performance can be improved by employing scheduled skews at flip-flops. This optimization technique is called skewed-clock optimization and has been successfully used in memory designs to achieve high operating frequencies. There are two important issues in developing this optimization technique. The first is the selection of appropriate clock skews to improve system performance. The second is to reliably distribute skewed clocks in the presence of manufacturing and environmental variations. Without the careful selection of clocking times and control of unintentional clock skews, potential system performance might not be achieved. In this paper a theoretical framework is first presented for solving the problem of optimally scheduling skews. A novel self-calibrating clock distribution scheme is then developed which can automatically track variations and minimize unintentional skews. Clocks with proper skews can be reliably delivered by such a scheme.
Evaluation of a distribution center tow-line material handling system through simulation modeling
Authors: Jay Bakst, Joel Hoffner, Kris Jacoby
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Random House, one of the world's largest and most distinguished publishing houses, embarked on a mission to improve its tow-line material handling system at its main distribution center located in Westminster, Maryland. A mechanical tow-line system, while a rugged low-tech but reliable solution, still comes with complicated management and control issues which require a simulation to evaluate and understand. A three person team designed, developed, and implemented a simulation model of a proposed modification to the existing transport system. The results were then analyzed and presented to company management. This paper discusses the processes and solutions of this simulation including how our team approach improved the model, how the model identified significant variables in the implementation and how the model results were used to help justify the capital expenditure.
Numerical Methods for a Nonconvex Optimization Problem Modeling Martensitic Microstructure
Authors: Roy A. Nicolaides, Noel Walkington, Han Wang
Venue: SIAM Journal on Scientific Computing (1997)

Using a continuum model of Ericksen and James, we compute a number of fine scale structures commonly observed as a result of martensitic phase transformations. Our results provide numerical validations of the Ericksen--James model. We show that care is needed in the discretization stage if spurious microstructures are to be avoided. A detailed description of the origin and cause of a spurious microstructure is provided. In addition, we present results showing the important effects of mesh orientation and mesh fineness on the formation of microstructure.
Using the Simplex Code to Construct Relative Difference Sets in2-groups
Authors: James A. Davis, Surinder K. Sehgal
Venue: Designs, Codes and Cryptography (1997)

Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see davis, EB, jung, maschmidt, and pottsurvey for examples). This paper modifies an example found in arasusehgal to construct a family of relative difference sets in 2-groups that gives examples for b &equals; 2 and b &equals; 3 that have a lower rank than previous examples. The Simplex code is used in the construction.
An overview of CIM enterprise modeling methodologies
Authors: Ganesh Pai Kateel, Manjunath Kamath, David B. Pratt
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Computer integrated manufacturing (CIM) systems are increasingly being used as weapons by manufacturing enterprises in competitive business environments. The complicated nature of these systems and the high initial investment requirements have necessitated their accurate modeling. A number of models, modeling methodologies, and modeling tools have been developed and used for this purpose. We first present a brief overview of several CIM models as well as modeling tools and methods. Many of the models are said to emphasize only a part of the system. A concern in the research community is that these models must be integrated. We conclude the paper by examining the rationale and feasibility of integrating the different models and/or creating integrated models.
An APL based relational data management language using SYSTEM R as data server
Authors: F. Antonacci, P. Dell'Orco
Venue: ACM SIGAPL APL Quote Quad (1985)

This report describes a system for accessing System R, via AQL, a query language based on APL, developed by IBM Italy Scientific Centers. System R and AQL reside in two different Virtual Machines: the DB Machine and the User Machine, respectively. The two Machines communicate through VMCF, an inter-machine communication facility in VM/370 environment. Queries formulated in AQL are shipped to System R, translated into SQL (the native query language of System R) and the results brought back to the User Machine. The major advantage of this architecture is easiness of implementation and separability between the two environments. From the user's standpoint, this approach combines a friendly and flexible query language with a powerful data manager.
Using Feature Construction to Improve the Performance of Neural Networks
Authors: Selwyn Piramuthu, Harish Ragavan, Michael J. Shaw
Venue: Management Science (1998)

Recent years have seen the growth in popularity of neural networks for business decision support because of their capabilities for modeling, estimating, and classifying. Compared to other AI methods for problem solving such as expert systems, neural network approaches are especially useful for their ability to learn adaptively from observations. However, neural network learning performed by algorithms such as back-propagation (BP) are known to be slow due to the size of the search space involved and also the iterative manner in which the algorithm works. In this paper, we show that the degree of difficulty in neural network learning is inherent in the given set of training examples. We propose a technique for measuring such learning difficulty, and then develop a feature construction methodology that helps transform the training data so that both the learning speed and classification accuracy of neural network algorithms are improved. We show the efficacy of the proposed method for financial risk classification, a domain characterized by frequent data noise, lack of functional structure, and high attribute interactions. Moreover, the empirical studies also provide insights into the structural characteristics of neural networks with respect to the input data used as well as possible mechanisms to improve the learning performance.
A methodology for integrating business process and information infrastructure models
Authors: Michael K. Painter, Ronald Fernandes, Natarajan Padmanaban, Richard J. Mayer
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Many organizations today undertake Business Process Reengineering (BPR) and information infrastructure (i.e., network hardware, communications, and applications infrastructure) modernization efforts to drastically reduce costs and improve performance. While these efforts would appear to be mutually supportive and complementary in nature, they are rarely conducted jointly. Although it is known that changes to one of these two facets of the organization can produce significant impacts on the other, analysts and decision-makers have had only limited support for predicting the impacts of change to one or both of these two facets of the enterprise. BPR efforts are generally conducted using business process simulation tools. Information infrastructure modernization efforts are generally conducted using network simulation tools. What is lacking is an integrated method and the automated environment for studying the impacts of change to one of these two as pects of the enterprise on the other. This paper presents a simulation-based methodology enabling simultaneous consideration of changes to core business processes and the infrastructure mechanisms that support those processes.
A Family of Semi-Regular Divisible Difference Sets
Authors: Siu Lun Ma, Surinder K. Sehgal
Venue: Designs, Codes and Cryptography (1997)

We give a construction of semi-regular divisible difference sets with parameters m = p2a(r&minus;1)+2b (pr &minus; 1)/(p &minus; 1), n = pr, k = p(2a+1)(r&minus;1)+2b (pr &minus; 1)/(p &minus; 1), &lgr;1 = p(2a+1)(r&minus;1)+2b (pr&minus;1 &minus; 1)/(p-1), &lgr;2 = p2(a+1)(r&minus;1)&minus;r+2b (pr &minus; 1)/(p &minus; 1),where p is a prime and r &ge; a + 1.
Automatic generation of state invariants from requirements specifications
Authors: Ralph Jeffords, Constance Heitmeyer
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

Automatic generation of state invariants, properties that hold in every reachable state of a state machine model, can be valuable in software development. Not only can such invariants be presented to system users for validation, in addition, they can be used as auxiliary assertions in proving other invariants. This paper describes an algorithm for the automatic generation of state invariants that, in contrast to most other such algorithms, which operate on programs, derives invariants from requirements specifications. Generating invariants from requirements specifications rather than programs has two advantages: 1) because requirements specifications, unlike programs, are at a high level of abstraction, generation of and analysis using such invariants is easier, and 2) using invariants to detect errors during the requirements phase is considerably more cost-effective than using invariants later in software development. To illustrate the algorithm, we use it to generate state invariants from requirements specifications of an automobile cruise control system and a simple control system for a nuclear plant. The invariants are derived from specifications expressed in the SCR (Software Cost Reduction) tabular notation.
A Finite-Element Method for Laplace- and Helmholtz-Type Boundary Value Problems with Singularities
Authors: Xiaonan Wu, Houde Han
Venue: SIAM Journal on Numerical Analysis (1997)

Laplace- and Helmholtz-type boundary value problems with singularities are considered. A sequence of approximations to the exact boundary conditions at an artificial boundary is given. Then the original problem is reduced to a boundary value problem in a domain away from the singularities. Furthermore, finite-element approximations are applied to this problem and error estimates are obtained. Finally, some numerical examples show the effectiveness of this method.
Module selection for pipelined synthesis
Authors: Rajiv Jain, Alice Parker, Nohbyung Park
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Module selection is one of the many functions which have to be performed during behavioral synthesis of pipelined designs. Module selection is the process of choosing the types of modules (e.g. carry-look-ahead adder) to implement each operation (e.g. addition). In this paper, we give a limited solution to the module selection problem for pipelined designs. A model for estimating area-time tradeoffs [3] for pipelined designs is used to formulate the module selection problem, and an overview of the solution technique is given. Complexities introduced by non-optimal designs and user constraints are also addressed. The results have been validated using designs generated by an automated pipeline synthesis program.
Microcode compaction with timing constraints
Authors: Bogong Su, Shiyuan Ding, Jian Wang, Jinshi Xia
Venue: Proceedings of the 20th annual workshop on Microprogramming (1987)

At present, microcode compaction with timing constraints (abbreviated as MCTC) is still an open problem. Complex timing relation between microoperations greatly affects the optimization result of microcode. This paper begins with a survey of MCTC problems, then presents a formal description of MCTC and, on the basis of a systematic study of the characteristics of MCTC, presents a generally-oriented heuristic algorithm&mdash; CAS, which has a high success rate of scheduling and promises good optimization result. Preliminary experiments indicate that CAS is better than other existing MCTC algorithms.
Compilation of Constraint Programs with Noncyclic and Cyclic Dependencies to Procedural Parallel Programs
Authors: Ajita John, James C. Browne
Venue: International Journal of Parallel Programming (1998)

This paper reports on a compiler for translation of constraint specifications into procedural parallel programs. A constraint program in our system consists of a set of constraints and an input set containing a subset of the variables appearing in the constraints. The compiler described in this paper successfully compiles a substantially larger class of constraint specifications to efficient programs than did its predecessors. In particular the compiler has been extended to generate processor and memory efficient programs for cyclic constraints which can be resolved by computational relaxation methods. The paper first details the basic compilation process for noncyclic constraints. It then describes the additional steps in the compilation process which enable resolution of cyclic constraints to iterative computational processes and illustrates the process using derivation of a parallel program for solution of the Laplace equation as the example.
Alternative fetch and issue policies for the trace cache fetch mechanism
Authors: Daniel Holmes Friendly, Sanjay Jeram Patel, Yale N. Patt
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

The increasing widths of superscalar processors are placing greater demands upon the fetch mechanism. The trace cache meets these demands by placing logically contiguous instructions in physically contiguous storage. It is capable of supplying multiple fetch blocks each cycle. In this paper we examine two fetch and issue techniques, partial matching and inactive issue, that improve the overall performance of the trace cache by improving the effective fetch rate. We show that for the SPECint95 benchmarks partial matching increases the overall performance by 12% and inactive issue by 15%. Furthermore we apply these two techniques to issue blocks from trace segments which contain multiple execution paths. We conclude with a performance comparison between a trace cache implementing partial matching and inactive issue and an aggressive single block fetch mechanism. The trace cache increases performance by an average of 25% over the instruction cache.
RISC versus CISC: a tale of two chips
Authors: Dileep Bhandarkar
Venue: ACM SIGARCH Computer Architecture News (1997)

This paper compares an aggressive RISC and CISC implementation built with comparable technology. The two chips are the Alpha* 21164 and the Intel Pentium reg; Pro processor. The paper presents performance comparisons for industry standard benchmarks and uses performance counter statistics to compare various aspects of both designs.
Finite-Resolution Aspect Graphs of Polyhedral Objects
Authors: Ilan Shimshoni, Jean Ponce
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We address the problem of computing the aspect graph of a polyhedral object observed by an orthographic camera with limited spatial resolution, such that two image points separated by a distance smaller than a preset threshold cannot be resolved. Under this model, views that would differ under normal orthographic projection may become equivalent, while "accidental" views may occur over finite areas of the view space. We present a catalogue of visual events for polyhedral objects and give an algorithm for computing the aspect graph and enumerating all qualitatively different aspects. The algorithm has been fully implemented and results are presented.
Prescriptive frameworks for multi-level lambda-calculi
Authors: Flemming Nielson
Venue: ACM SIGPLAN Notices (1997)

Two-level lambda;-calculi have been heavily utilised for applications such as partial evaluation, abstract interpretation and code generation. Each of these applications pose different demands on the exact details of the two-level structure and the corresponding inference rules. In a previous paper we have developed a descriptive framework for characterising the key ingredients used in the various applications. Based on the insights offered by this characterisation we now develop a prescriptive framework that offers firm guidelines on what we regard as "good" definitions of multi-level lambda-calculi.
Unconditional Contractivity in the Maximum Norm of Diagonally Split Runge--Kutta Methods
Authors: A. Bellen, L. Torelli
Venue: SIAM Journal on Numerical Analysis (1997)

We consider the new class of diagonally split Runge--Kutta (DSRK) methods (1.5) for the standard initial value problem (1.1). By using the theory of P-series we derive the order conditions on the method's coefficients. Stability analysis is also carried out by showing that the method is unconditionally contractive in the maximum norm if and only if the method is based on particular pairs of discrete and continuous Runge--Kutta methods. For an effective implementation of the method, an iteration scheme is proposed which preserves the contractivity of any iterate.
Delaunay: a database visualization system
Authors: Isabel F. Cruz, M. Averbuch, Wendy T. Lucas, Melissa Radzyminski, Kirby Zhang
Venue: ACM SIGMOD Record (1997)

Visual query systems have traditionally supported a set of pre-defined visual displays. We describe the Delaunay system, which supports visualizations of object-oriented databases specified by the user with a visual constraint-based query language. The highlights of our approach are the expressiveness of the visual query language, the efficiency of the query engine, and the overall flexibility and extensibility of the framework. The user interface is implemented using Java and is available on the WWW.
Analysis and Randomized Design of Algorithm-Based Fault Tolerant Multiprocessor Systems Under an Extended Model
Authors: Shalini Yajnik, Niraj K. Jha
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Reliability of compute-intensive applications can be improved by introducing fault tolerance into the system. Algorithm-based fault tolerance (ABFT) is a low-cost scheme which provides the required fault tolerance to the system through system level encoding. In this paper, we propose randomized construction techniques, under an extended model, for the design of ABFT systems with the required fault tolerance capability. The model considers failures in the processors performing the checking operations.
A parallel GPSS based on the ParaSol simulation system
Authors: Felipe Knop, Edward Mascarenhas, Vernon Rego
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Much of the research in parallel discrete-event simulation (PDES) has resulted in new experimental simulation languages or toolkits. Meanwhile, the simulation community continues to use existing (serial) commercial tools which are reportedly more powerful and flexible from a modeler's point of view. A possible way to increase the impact of PDES in the simulation community is to make existing simulation packages execute in parallel. Towards this end, we present a parallelization of the GPSS simulation language. We implement parallel GPSS as a GPSS-to-C++ translator and execute the transformed code with the help of the ParaSol parallel simulation system. The mapping from GPSS to ParaSol is simple because, unlike other parallel simulation systems, ParaSol is transaction oriented. On the other hand, because GPSS was not designed with parallelism in mind 'there are GPSS constructs that can behave poorly in a parallel environment. We present details on the mapping, some of the challenges we faced in this task, and key solutions that we adopted to enhance parallelism.
On Migrating Threads
Authors: Bernd Mathiske, Florian Matthes, Joachim W. Schmidt
Venue: Journal of Intelligent Information Systems (1997)

Based on the notion of persistent threads in Tycoon (Matthes and Schmidt, 1994), we investigate thread migration as a programming construct for building activity-oriented distributed applications. We first show how a straight-forward extension of a higher-order persistent language can be used to define activities that span multiple (semi-) autonomous nodes in heterogeneous networks. In particular, we discuss the intricate binding issues that arise in systems where threads are first-class language citizens that may access local and remote, mobile and immobile resources.We also describe how our system model can be understood as a promising generalization of the more static architecture of first-order and higher-order distributed object systems. Finally, we give some insight into the implementation of persistent and migrating threads and we explain how to represent bindings to ubiquitous resources present at each node visited by a migrating thread on the network to avoid excessive communication or storage costs.
Effect of film size on production of foreign body sarcoma by perforated film implants
Authors: Maura Mhic Iomhair, S. M. Lavelle
Venue: Technology and Health Care (1997)

Sarcoma may arise on unabsorbable foreign bodies in rodents and more rarely in man. Perforations of the implant reduce its carcinogenicity so that nitrocellulose filters of pore size 0.45 microns have failed to induce tumour. We examined whether increase of surface area would restore carcinogenesis to film with such pore size. Nitrocellulose filters of 25 mm diameter and pore size 0.45 microns were implanted singly, in pairs and in trios subcutaneously in 3 respective groups of BALB/c mice (total 97) and observed for sarcomagenesis for 100 weeks. No tumour arose on the singles (surface area 0.98 mm^2), while 7 arose on the paired (1.96 mm^2) at a mean of 54 weeks and 16 on the trios (2.95 mm^2) at a mean of 46 weeks (differences significant at p> 0.01). A sufficiency of surface area restores carcinogenicity to perforated foreign surfaces in mice. Surface area is dominant over film perforation size in film sarcomagenesis.
The Ring Loading Problem
Authors: Alexander Schrijver, Paul Seymour, Peter Winkler
Venue: SIAM Journal on Discrete Mathematics (1998)

The following problem arose in the planning of optical communications networks which use bidirectional SONET rings. Traffic demands di,j are given for each pair of nodes in an n-node ring; each demand must be routed one of the two possible ways around the ring. The object is to minimize the maximum load on the cycle, where the load of an edge is the sum of the demands routed through that edge.We provide a fast, simple algorithm which achieves a load that is guaranteed to exceed the optimum by at most 3/2 times the maximum demand, and that performs even better in practice. En route we prove the following curious lemma: for any x1,..., xn in [0,1] there exist y1,..., yn such that for each k, $|y_k|=x_k$ and $$ \left| \sum_{i=1}^k y_i - \sum_{i=k+1}^n y_i \right| \le 2. $$