ppxscal/embedding_network huggingface dataset:
Performance Testing a Large Finance Application
Authors: David Grossman, M. Catherine McCabe, Christopher Staton, Bret Bailey, Ophir Frieder, David C. Roberts
Venue: IEEE Software (1996)

Developers have been performance testing large database applications for more than 20 years. Up to now, they have focused primarily on system-level testing of operating systems and database management systems. However, just because a machine, its operating system, and its database system are fast does not mean that an application using the database system will perform well. Design flaws in the application or in the tuning parameters specific to the application's environment often result in serious performance problems. The authors present a case study that shows how a simple prototype can be used to verify, before production, that a system will perform at an acceptable level under realistic conditions. Their approach hinges upon the use of a simple prototype to verify that the system performance falls within acceptable bounds.
Design for Delay Testability in High-Speed Digital ICs
Authors: H. G. Kerkhoff, H. Speek, M. Shashani, M. Sachdev
Venue: Journal of Electronic Testing: Theory and Applications (2001)

The cost-effective testing of high-speed digital ICs is becoming increasingly problematic. Even advanced, costly testers are not always capable of testing these ICs because of their high-speed limitations. This paper focuses on a Design for Delay Testability (DfDT) technique such that high-speed ICs can be tested using inexpensive, low-speed test systems. Also extensions for possible full BIST of delay faults are addressed.
Efficient clustering and visibility calculation for global illumination
Authors: Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat, Philippe Blasi
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the radiosity method are time consuming and (ii) the large amount of memory needed is very large. In this paper, we address this problem by proposing a new clustering technique as well as a new method of visibility computation for complex indoor scenes. Our clustering algorithm groups polygons that are close to each other in each room (or corridor) of the building. It relies on a classification method of k-mean type and allows the use of several kinds of distance functions. For each group of polygons (or cluster), we estimate the set of potentially visible clusters with the help of openings such as doors or windows. This computation results in a graph in which the nodes correspond to clusters and the edges express visibility relationships between the corresponding clusters. We use this graph for computing radiosity in complex buildings while reducing both the amount of memory needed and the computing time. Our global illumination method is a MWRA (multi-wavelet radiosity algorithm). Unlike cluster-based radiosity methods, our MWRA does not approximate (but computes accurately) the light energy impinging or leaving a cluster after multiple reflections. We provide results for 3 different test scenes containing a high number of polygons.
Broadcast Ring Sandwich Networks
Authors: Gerald M. Masson, Yuanyuan Yang
Venue: IEEE Transactions on Computers (1995)

In this paper we will present a constructive design of a new class of cascaded network structures for broadcast applications called ring sandwich networks. These ring sandwich networks are rearrangeable in the sense that a request for a connection between a sender and a receiver can sometimes be realized only by first rearranging other existing connection paths through the network. We will present analytical results which permit the average rearrangeability of ring sandwich networks to be evaluated on the basis of fundamental structural parameters associated with the ring sandwich design so that the trade-off between the network rearrangeability and the network cost can be determined. It will be shown that the average number of rearrangements to satisfy a broadcast connection request relative to the subnetwork of the cascaded ring sandwich structure providing fanout can be reduced to O(1); this is in contrast to O(N) for other existing cascaded designs. We will give detailed connecting algorithms that can be used to satisfy connection requests. We will also support our analytically derived results with corroborating simulation data. This work provides an analytical framework for a class of low-cost broadcast networks currently being employed by government and industry in both broadcasting and conferencing applications wherein only a limited degree of rearrangements can be tolerated.
A Single-Chip Multiprocessor for Smart Terminals
Authors: Masato Edahiro, Satoshi Matsushita, Masakazu Yamashina, Naoki Nishi
Venue: IEEE Micro (2000)

Merlot, the first MP98 architecture prototype, promises 1-GIPS performance at 1 watt for 1.3-V operations in support of smart 21st-century information terminals.
A Generalized Algorithm of Training a Formal Neuron
Authors: Ye. V. Bodyanskii, N. Ye. Kulishova, O. G. Rudenko
Venue: Cybernetics and Systems Analysis (2002)

Activation functions of neurons are represented in the form of power series. An algorithm that controls the slope of an activation function is proposed. The results of numerical experiments are given.
A Multilayer Perceptron Solution to the Match Phase Problem in Rule-Based Artificial Intelligence Systems
Authors: M. A. Sartori, K. M. Passino, P. J. Antsaklis
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

In rule-based artificial intelligence (AI) planning, expert, and learning systems, it is often the case that the left-hand-sides of the rules must be repeatedly compared to the contents of some working memory. Normally, the intent is to determine which rules are relevant to the current situation (i.e., to find the conflict set). A technique using a multilayer perceptron to solve the match phase problem for rule-based AI systems is presented. A syntax for premise formulas (i.e., the left-hand-sides of the rules) is defined, and working memory is specified. From this, it is shown how to construct a multilayer perceptron that finds all of the rules which can be executed for the current situation in working memory. The complexity of the constructed multilayer perceptron is derived in terms of the maximum number of nodes and the required number of layers. A method for reducing the number of layers to at most three is presented.
A Fuzzy Logic Beam-and-Ball Controller Prototype
Authors: Hua Harry Li, Nowell Godfrey, Yuandong Ji
Venue: IEEE Micro (1995)

In this study, we describe the design and hardware implementation of a real-time fuzzy logic controller for a nontrivial nonlinear system control application, balancing a beam-and-ball system in real time. Unlike most of the optimal or conventional control techniques, our in-house built fuzzy logic controller requires no explicit system parameters, such as mass, torque etc., and it is characterized by its simplicity. A hardware prototyping system is built and the experimental results demonstrate the robustness of the controller. A comparative study reveals that the fuzzy logic controller outperforms optimal control based algorithm and in most cases outperforms trained human operators as well. *This beam-and-ball system was demonstrated in the World Congress Neural Network Conference in San Diego in June 1994 and it was given an Industrial Neural Network Award. A video tape of the demonstration can be obtained from the first author.
Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules
Authors: K. K. Jain, V. Rajaraman
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

The lower and upper bounds on the minimum time needed to process a given directedacyclic task graph for a given number of processors are derived. It is proved that theproposed lower bound on time is not only sharper than the previously known values butalso easier to calculate. The upper bound on time, which is useful in determining theworst case behavior of a given task graph, is presented. The lower and upper bounds onthe minimum number of processors required to process a given task graph in the minimum possible time are also derived. It is seen with a number of randomly generated dense task graphs that the lower and upper bounds we derive are equal, thus giving the optimal time for scheduling directed acyclic task graphs on a given set of processors.
Extended Fibonacci Cubes
Authors: Jie Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

The Fibonacci Cube is an interconnection network that possesses many desirable properties that are important in network design and application. The Fibonacci Cube can efficiently emulate many hypercube algorithms and uses fewer links than the comparable hypercube, while its size does not increase as fast as the hypercube. However, most Fibonacci Cubes (more than 2/3 of all) are not Hamiltonian. In this paper, we propose an Extended Fibonacci Cube (EFC1) with an even number of nodes. It is defined based on the same sequence F(i) = F(i¿ 1) + F(i¿ 2) as the regular Fibonacci sequence; however, its initial conditions are different. We show that the Extended Fibonacci Cube includes the Fibonacci Cube as a subgraph and maintains its sparsity property. In addition, it is Hamiltonian and is better in emulating other topologies. Specifically, the Extended Fibonacci Cube can embed binary trees more efficiently than the regular Fibonacci Cube and is almost as efficient as the hypercube, even though the Extended Fibonacci Cube is a much sparser network than the hypercube. We also propose a series of Extended Fibonacci Cubes with even number of nodes. Any Extended Fibonacci Cube (EFCk, with k¿ 1) in the series contains the node set of any other cube that precedes EFCk in the series. We show that any Extended Fibonacci Cube maintains virtually all the desirable properties of the Fibonacci Cube. The EFCks can be considered as flexible versions of incomplete hypercubes, which eliminates their restriction on the number of nodes, and, thus, makes it possible to construct parallel machines with arbitrary sizes.
Synchronisation Techniques for HIPERLAN
Authors: D. A. G. Gillies, Y. J. Guo, S. K. Barton
Venue: Wireless Personal Communications: An International Journal (1997)

Timing recovery in the High Performance Radio Local Area Network (HIPERLAN) standard is likely to be performed with the aid of synchronisation sequences embedded in the user data, which will be detected with matched filters. A directed search using a form of genetic algorithm has been performed to obtain suitable sequences of lengths up to 80 bits, and simulations of their performance have been undertaken. Performance of the sequences has been measured under the severe channel conditions that pertain in the indoor environment.
Shifted Chebyshev Collocation Domain Truncation for Solving Problems on an Infinite Interval
Authors: Huiyuan Li, Heping Ma
Venue: Journal of Scientific Computing (2003)

A shifted Chebyshev collocation method is proposed for solving problems on an infinite interval with domain truncation strategy.
Computing Functions cos/sup -1/ and sin/sup -1/ Using CORDIC
Authors: C. Mazenc, X. Merrheim, J. -M. Muller
Venue: IEEE Transactions on Computers (1993)

An extension of the CORDIC (coordinate rotation digital computer) algorithm that makes it possible to compute the functions cos/sup -1/, sin/sup -1/, square root 1-t/sup 2/, sinh/sup -1/ cosh/sup -1/, and square root 1+t/sup 2/ is presented. The algorithms are suitable for VLSI implementation and require only a slight modification of the original CORDIC algorithm.
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
Authors: G. George Yin, Cheng-Zhong Xu, Le Yi Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computational requirements, remapping at runtime is an effective approach to ensure parallel efficiency. This paper introduces a novel remapping strategy for computations whose workload changes can be modeled as a Markov chain. The use of Markovian model allows us to treat statistical dependence and more complex structure than the usual independent identically distributed random variable assumptions. Our models are quite general and we do not need to impose conditions on the dynamics of the underlying process other than the transition probability matrix. It is shown that optimal remapping can be formulated as a binary decision process: remap or not at a given synchronizing instant. The optimal strategy is then developed for long lasted computations by employing optimal stopping rules in a stochastic control framework. The existence of optimal controls is established. Necessary and sufficient conditions for the optimality are obtained. Furthermore, a policy iteration algorithm is devised to reduce computational complexity and enhance fast convergence to the desired optimal control.
Test Algorithms for Double-Buffered Random Access and Pointer-Addressed Memories
Authors: Jos van Sas, Francky Catthoor, Hugo J. De Man
Venue: IEEE Design Test (1993)

Test algorithms for static double-buffered RAMs and pointer-addressed memories (PAMs) are presented. The reasons why test algorithms for single-buffered memories are inadequate to test double-buffered memories (DBMs) are discussed. To obtain a realistic fault model, the authors perform an inductive fault analysis on the DBM cells. They also show that the address generation method imposes different requirements on the test algorithms.
An exact gate assignment algorithm for tree circuits under rise and fall delays
Authors: Arlindo L. Oliveira, Rajeev Murgai
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In most libraries, gate parameters such as the pin-to-pin intrinsic delays, load-dependent coefficients, and input pin capacitances have different values for rising and falling signals. The performance optimization algorithms, however, assume a single value for each parameter.It is known that under the load-independent delay model, the gate assignment (or resizing) problem is solvable in time polynomial in the circuit size when a single value is assumed for each parameter [5]. In the presence of different rise and fall parameter values, this problem was recently shown to be NP-complete even for chain and tree topology circuits under the simple load-independent delay model [8]. In this paper, we propose a dynamic programming algorithm for solving this problem exactly in pseudo-polynomial time for tree circuits. More specifically, we show that the problem can be solved in time proportional to the size of the tree circuit, the number of choices available in the library for each gate, and the delay of the circuit. To the best of our knowledge, this is the first pseudo-polynomial exact algorithm for the gate assignment problem for trees in the presence of different rise and fall delays. We present a straightforward way of extending this algorithm to general directed acyclic graphs. We present experimental results on a set of benchmark problems using a standard commercial library and show that our algorithm generates provably optimum delays for 72 out of 76 circuits. We also compare our technique with two approaches traditionally used to solve this problem in the industry & academia and show that it is slightly better than these two. Interestingly, both traditional approaches also yield delays not far from the optimum.
Invasion Percolation: A Computational Algorithm for Complex Phenomena
Authors: Joe Damore
Venue: IEEE Design Test (2010)

Developing efficient computational algorithms for studying complex phenomena has been a long-standing problem in physics and engineering. One such algorithm, invasion percolation, has found wide applications.
Efficient implementation of the multigrid preconditioned conjugate gradient method on distributed memory machines
Authors: Osamu Tatebe, Yoshio Oyanagi
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

A multigrid preconditioned conjugate gradient (MGCG) method[15], which uses the multigrid method as a preconditioner for the CG method, has a good convergence rate even for the problems on which the standard multigrid method does not converge efficiently. This paper considers a parallelization of the MGCG method and proposes an efficient parallel MGCG method on distributed memory machines. For the good convergence rate of the MGCG method, several difficulties in parallelizing the multigrid method are successfully settled. Besides, the parallel MGCG method on Fujitsu multicomputer AP1000[8] has high performance and it is more than 10 times faster than the Scaled CG (SCG) method[6].
Spline techniques for solving singularly-perturbed nonlinear problems on nonuniform grids
Authors: M. K. Kadalbajoo, K. C. Patidar
Venue: Journal of Optimization Theory and Applications (2002)

A numerical method based on cubic splines with nonuniform grid is given for singularly-perturbed nonlinear two-point boundary-value problems, The original nonlinear equation is linearized using quasilinearization. Difference schemes are derived for the linear case using a variable-mesh cubic spline and are used to solve each linear equation obtained via quasilinearization. Second-order uniform convergence is achieved. Numerical examples are given in support of the theoretical results.
A Causal Probabilistic Network for Optimal Treatment of Bacterial Infections
Authors: Leonard Leibovici, Michal Fishman, Henrik C. Schønheyder, Christian Riekehr, Brian Kristensen, Ilana Shraga, Steen Andreassen
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

The fatality rate associated with severe bacterial infections is about 30 percent and appropriate antibiotic treatment reduces it by half. Unfortunately, about a third of antibiotic treatments prescribed by physicians are inappropriate. We have built a causal probabilistic network (CPN) for treatment of severe bacterial infections. The net is based on modules, each module representing a site of infection. The general configuration of a module is as follows: Major distribution factors define groups of patients, each of them with a definite prevalence of infection caused by a given pathogen. Minor distribution factors multiply the likelihood of one pathogen, without changing much of the prevalence of infection. Infection caused by a pathogen causes local and generalized signs and symptoms. Antibiotic treatment is appropriate if it matches the susceptibility of the pathogens in vitro and appropriate treatment is associated with a gain in life expectancy. This is balanced against the cost of the drug, side effects, and ecological damage, to reach the most cost effective treatment. The net was constructed in such a way that the data for the conditional probability tables will be available, even if it meant sometimes giving up on fine modeling details. For data, we used large databases collected by us in the last 10 years and data from the literature. The CPN was a convenient way to combine data from databases collected at different locations and times with published information. Although the net is based on detailed and large databases, its calibration to new sites requires data that is available in most modern hospitals.
Chameleon: Hierarchical Clustering Using Dynamic Modeling
Authors: George Karypis, Eui-Hong (Sam) Han, Vipin Kumar
Venue: Computer (1999)

Many advanced algorithms have difficulty dealing with highly variable clusters that do not follow a preconceived model. By basing its selections on both interconnectivity and closeness, the Chameleon algorithm yields accurate results for these highly variable clusters. Existing algorithms use a static model of the clusters and do not use information about the nature of individual clusters as they are merged. Furthermore, one set of schemes (the CURE algorithm and related schemes) ignores the information about the aggregate interconnectivity of items in two clusters. Another set of schemes (the Rock algorithm, group averaging method, and related schemes) ignores information about the closeness of two clusters as defined by the similarity of the closest items across two clusters. By considering either interconnectivity or closeness only, these algorithms can select and merge the wrong pair of clusters. Chameleon's key feature is that it accounts for both interconnectivity and closeness in identifying the most similar pair of clusters. Chameleon finds the clusters in the data set by using a two-phase algorithm. During the first phase, Chameleon uses a graph-partitioning algorithm to cluster the data items into several relatively small subclusters. During the second phase, it uses an algorithm to find the genuine clusters by repeatedly combining these sub-clusters.
Enhancing Disjunctive Datalog by Constraints
Authors: Francesco Buccafurri, Nicola Leone, Pasquale Rullo
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

This paper presents an extension of Disjunctive Datalog (${\rm{DATALOG}}^{\vee,}{^\neg}$) by integrity constraints. These are of two types: strong, that is, classical integrity constraints and weak, that is, constraints that are satisfied if possible. While strong constraints must be satisfied, weak constraints express desiderata, that is, they may be violated¿actually, their semantics tends to minimize the number of violated instances of weak constraints. Weak constraints may be ordered according to their importance to express different priority levels. As a result, the proposed language (call it, ${\rm{DATALOG}}^{\vee,}{^{\neg,}}{^c}$) is well-suited to represent common sense reasoning and knowledge-based problems arising in different areas of computer science such as planning, graph theory optimizations, and abductive reasoning. The formal definition of the language is first given. The declarative semantics of ${\rm{DATALOG}}^{\vee,}{^{\neg,}}{^c}$ is defined in a general way that allows us to put constraints on top of any existing (model-theoretic) semantics for ${\rm{DATALOG}}^{\vee,}{^\neg}$ programs. Knowledge representation issues are then addressed and the complexity of reasoning on ${\rm{DATALOG}}^{\vee,}{^{\neg,}}{^c}$ programs is carefully determined. An in-depth discussion on complexity and expressiveness of ${\rm{DATALOG}}^{\vee,}{^{\neg,}}{^c}$ is finally reported. The discussion contrasts ${\rm{DATALOG}}^{\vee,}{^{\neg,}}{^c}$ to ${\rm{DATALOG}}^{\vee,}{^\neg}$ and highlights the significant increase in knowledge modeling ability carried out by constraints.
Making the Reuse Business Work
Authors: Ivar Jacobson, Martin Griss, Patrik Jonsson
Venue: Computer (1997)

In this excerpt of Software Reuse: Architecture Process and Organization for Business Success (Addison-Wesley, 1997), the authors describe the benefits of reuse and debunk the misconceptions that stand in the way of achieving reuse gains. Jacobson is the inventor of the Objectory method and a well-known pioneer in the use of object technology. Jonsson is further developing Objectory, with a focus on reuse. Griss has been involved in software reuse for 23 years, the last 14 at Hewlett-Packard. Their book describes how a reuse architecture can dramatically improve development costs and development time. They contend that reuse technology is ready now: Companies that are prepared to implement a systematic reuse program will "coin money" in the future.