ppxscal/embedding_network huggingface dataset:
BIST for D/A and A/D Converters
Authors: Karim Arabi, Bozena Kaminska, Janusz Rzeszut
Venue: IEEE Design Test (1996)

A novel test approach and circuitry suitable for built-in self-test (BIST) of digital-to-analog (D/A) and analog-to-digital (A/D) converters using static parameters are proposed. Offset, gain, integral nonlinearity (INL) and differential nonlinearity (DNL) are tested without using mixed-mode or logic test equipment. The proposed BIST structure presents a compromise between area overhead (AO), test time, and fault coverage. The BIST circuitry has been designed and evaluated using CMOS 1.2-micron technology. The simulations show that, assuming the BIST voltage references fulfill the required accuracy, the BIST structure is applicable for testing D/A and A/D converters up to 16-bits of resolution. By only a minor modification, the test structure would be able to localize the fail situation and to test all D/A converters on the same chip. The small value of AO, the simplicity and efficiency of the proposed BIST architectures seem to be promising for manufacturing.
Practical Data-Oriented Microaggregation for Statistical Disclosure Control
Authors: J. Domingo-Ferrer, J. M. Mateo-Sanz
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Microaggregation is a statistical disclosure control technique for microdata disseminated in statistical databases. Raw microdata (i.e., individual records or data vectors) are grouped into small aggregates prior to publication. Each aggregate should contain at least $k$ data vectors to prevent disclosure of individual information, where $k$ is a constant value preset by the data protector. No exact polynomial algorithms are known to date to microaggregate optimally, i.e., with minimal variability loss. Methods in the literature rank data and partition them into groups of fixed-size; in the multivariate case, ranking is performed by projecting data vectors onto a single axis. In this paper, candidate optimal solutions to the multivariate and univariate microaggregation problems are characterized. In the univariate case, two heuristics based on hierarchical clustering and genetic algorithms are introduced which are data-oriented in that they try to preserve natural data aggregates. In the multivariate case, fixed-size and hierarchical clustering microaggregation algorithms are presented which do not require data to be projected onto a single dimension; such methods clearly reduce variability loss as compared to conventional multivariate microaggregation on projected data.
Program Recognition
Authors: Dirk Ourston
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The author explores the issues involved with program recognition by reviewing in some detail three systems epitomizing current techniques in program recognition research: the Program Recognizer, Talus, and Proust. The Program Recognizer recognizes occurrences of stereotyped computational fragments in computer programs. Talus analyzes programs involving the recursive definition of data structures, permitting recursion on three data types: list, tree, and number. Proust is a program for debugging Pascal programs. The author concludes the most promising direction for future research would be to combine the best elements of all three programs.
The Design of Fault-Tolerant Linear Digital State Variable Systems: Theory and Techniques
Authors: A. Chatterjee, M. A. d'Abreu
Venue: IEEE Transactions on Computers (1993)

A theory for error detection in linear digital state variable systems is described. With the aid of a tool called the gain matrix, it is shown that the effect of error propagation along different paths of the circuit can be analyzed. For circuits with operator fanout, it is shown that despite the fact that single faulty operators cause multiple state variables to be erroneous, no more additional check variables are required than for circuits without operator fanout. It is further shown that hardware optimization can be performed by sharing hardware functions between the original state variable system and its error detection circuitry. The analysis is performed for both single and multiple faulty operators. A scheme for error correction that performs error correction in real time is proposed. Experimental results that illustrate the practical viability of the proposed scheme are discussed.
Decreasing the Sensitivity of ADC Test Parameters by Means of Wobbling
Authors: R. De Vries, A. J. E. M. Janssen
Venue: Journal of Electronic Testing: Theory and Applications (1999)

In this paper we propose a new technique, wobbling, for the stabilization of spectral ADC-test parameters with respect to offset and amplitude deviations of the sinusoidal stimulus. Wobbling aims at removing the effect of the rounding operation that takes place in an ADC, so that the measured harmonic distortion and noise amplitude can be truly ascribed to the intrinsic non-linearity and noise of the ADC. We compare the wobbling technique with subtractive and non-subtractive noise dithering, both from a performance and an implementation point-of-view. We present results of simulations and measurements validating the wobbling technique for use in a production environment.
Making Compaction-Based Parallelization Affordable
Authors: T. Nakatani, K. Ebcioglu
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Compaction-based parallelization suffers from long compile time and large code size because of its inherent code explosion problem. If software pipelining is performed for loop parallelization along with compaction, as in the authors' compiler, the code explosion problem becomes more serious. The authors propose the software lookahead heuristic for use in software pipelining, which allows inter-basic-block movement of code within a prespecified number of operations, called the software lookahead window, on any path emanating from the currently processed instruction at compile time. Software lookahead enables instruction-level parallelism to be exploited in a much greater code area than a single basic block, but the lookahead region is still limited to a constant depth by means of a user-specifiable window, and thus code explosion is restricted. The proposed scheme has been implemented in the authors' VLIW parallelizing compiler. To study the code explosion problem and instruction-level parallelism for branch-intensive code, they compiled five AIX utilities: sort, fgrep, sed, yacc, and compress. It is demonstrated that the software lookahead heuristic effectively alleviates the code explosion problem while successfully extracting a substantial amount of inter-basic-block parallelism.
The Family Internet Pocket Guide
Authors: Olen R. Pearson, Chris Coffin
Venue:  (1998)

:An easy-to-read guide that begins by succinctly explaining the concepts, equipment, services and features of the Internet, with lists of manufacturers, service providers and software. The book then gives simple lessons on e-mail, news groups, search engines and the World Wide Web. It concudes by examining the Internet's pros and cons, its history and future. Author Olen Pearson has worked with computers for 30 years, as a professor, programmer, system administrator and consultant. Co-author Chris coffin is an editor at Grapevine Publications, a publisher of plain-English books on technology since 1983.
Ordered logit analysis for selectively sampled data
Authors: Dennis Fok, Philip Hans Franses
Venue: Computational Statistics Data Analysis (2002)

If individuals are classified into ordered categories, which are defined from the outset, it may happen that the majority belong to a single category. If a market researcher is interested in the correlation between the classification and individual characteristics, then the natural question is whether one needs to collect data for all individuals in that particular category. This question is dealt within the context of the ordered logit model. It is shown that there is no need to consider all those individuals and that a fraction of the individuals is needed. All that is required is a simple modification of the log likelihood, which is based on Bayes' theorem. The proposed method is illustrated using simulated data and data concerning risk profiles of customers of an investment bank.
A Least-Squares Spectral Element Formulation for the Stokes Problem
Authors: M. M. J. Proot, M. I. Gerritsma
Venue: Journal of Scientific Computing (2002)

Least-squares spectral element methods seem very promising since they combine the generality of finite element methods with the accuracy of the spectral methods and also the theoretical and computational advantages in the algorithmic design and implementation of the least-squares methods. The new element in this work is the choice of spectral elements for the discretization of the least-squares formulation for its superior accuracy due to the high-order basis-functions. The main issue of this paper is the derivation of a least-squares spectral element formulation for the Stokes equations and the role of the boundary conditions on the coercivity relations. The numerical simulations confirm the usual exponential rate of convergence when p-refinement is applied which is typical for spectral element discretization.
Visualizing the Structure of Large Relational Databases
Authors: Jacqueline M. Antis, Stephen G. Eick, John D. Pyrce
Venue: IEEE Software (1996)

Large relational databases, such as those associated with legacy software systems, can be difficult to engineer and extend. This visualization system abandons the use of entity-relationship diagrams in favor of a 2D, multiview, color representation of the database structure. It can easily display databases with more than 1,000 relations.
A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields
Authors: Christof Paar
Venue: IEEE Transactions on Computers (1996)

In this paper a new bit-parallel structure for a multiplier with low complexity in Galois fields is introduced. The multiplier operates over composite fields GF((2n)m), with k = nm. The Karatsuba-Ofman algorithm is investigated and applied to the multiplication of polynomials over GF(2n). It is shown that this operation has a complexity of order $O(k^{{\rm log}_23})$ under certain constraints regarding k. A complete set of primitive field polynomials for composite fields is provided which perform modulo reduction with low complexity. As a result, multipliers for fields GF(2k) up to k = 32 with low gate counts and low delays are listed. The architectures are highly modular and thus well suited for VLSI implementation.
Network Communication in Edge-Colored Graphs: Gossiping
Authors: A. L. Liestman, D. Richards
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A mechanism for scheduling communications in a network in which individuals exchange information periodically according to a fixed schedule is presented. A proper kedge-coloring of the network is considered to be a schedule of allowed communicationssuch that an edge of color i can be used only at times i modulo k. Within thiscommunication scheduling mechanism, the information exchange problem known asgossiping is considered. It is proved that there is a proper k edge-coloring such thatgossip can be completed in a path of n edges in a certain time for ngreater than or equal to k greater than or equal to 1. Gossipcan not be completed in such a path any earlier under any proper k edge-coloring. In anytree of bounded degree Delta and diameter d, gossip can be completed under a properDelta edge-coloring in time ( Delta -1)d+1. In a k edge-colored cycle of n vertices, othertime requirements of gossip are determined.
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes
Authors: G. D. Stamoulis, J. N. Tsitsiklis
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors analyze the problem in which each node of the binary hypercubeindependently generates packets according to a Poisson process with rate lambda ; eachof the packets is to be broadcast to all other nodes. Assuming unit packet length and noother communications taking place, it is observed that the system can be stable insteady-state only if the load factor rho identical to lambda (2/sup d/-1)/d satisfies rho>1 where d is the dimensionality (diameter) of the hypercube. Moreover, the authorsestablish some lower bounds for the steady-state average delay D per packet and deviseand analyze two distributed routing schemes that are efficient in the sense that stabilityis maintained for all rho > rho * where rho * does not depend on the dimensionality d ofthe network, while the average delay D per packet satisfies D>or=Kd(1+ rho ) for smallvalues of rho (with constant K). The performance evaluation is rigorous for one scheme,while for the other the authors resort to approximations and simulations.
Information Technologies in South Africa: Problems and Prospects
Authors: Gay A. Wood, Seymour E. Goodman, Jan Roos
Venue: Computer (1994)

Development of South Africa's information technologies infrastructure has been skewed by apartheid and the constraints of past policies, but IT can be part of the solution. The authors consider how critical IT is to the process of change.
Health Benefits and Risks of the Internet
Authors: Judith A. Levy, Rita Strombeck
Venue: Journal of Medical Systems (2002)

The linking of the Internet with health and medicine involves all levels of society, including individuals, health care providers, professional organizations, communities, and local and federal governments. A growing body of evidence suggests that despite the benefits of the Internet, this means of communication also figures into the creation of new forms of health risk for some users. This paper examines the effects of the Internet on the promotion of both health and illness. The discussion focuses on those factors of online communication that produce positive health outcomes and also the potential for health risk. Implications for health providers and for better serving patients are analyzed together with recommendations for improving services for those who go online to access health information.
An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex
Authors: Chuangyin Dang, Hans Van Maaren
Venue: Computational Optimization and Applications (1999)

An arbitrary starting variable dimension algorithm is proposed to compute an integer point of an n-dimensional simplex. It is based on an integer labeling rule and a triangulation of R^n. The algorithm consists of two interchanging phases. The first phase of the algorithm is a variable dimension algorithm, which generates simplices of varying dimensions,and the second phase of the algorithm forms a full-dimensional pivoting procedure, which generates n-dimensional simplices. The algorithm varies from one phase to the other. When the matrix defining the simplex is in the so-called canonical form, starting at an arbitrary integer point, the algorithm within a finite number of iterations either yields an integer point of the simplex or proves that no such point exists.
Parallel Mining of Outliers in Large Database
Authors: Edward Hung, David W. Cheung
Venue: Distributed and Parallel Databases (2002)

Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like monitoring of credit card fraud and criminal activities in electronic commerce. With the ever-increasing size and attributes (dimensions) of database, previously proposed detection methods for two dimensions are no longer applicable. The time complexity of the Nested-Loop (NL) algorithm (Knorr and Ng, in Proc. 24th VLDB, 1998) is linear to the dimensionality but quadratic to the dataset size, inducing an unacceptable cost for large dataset.A more efficient version (ENL) and its parallel version (PENL) are introduced. In theory, the improvement of performance in PENL is linear to the number of processors, as shown in a performance comparison between ENL and PENL using Bulk Synchronization Parallel (BSP) model. The great improvement is further verified by experiments on a parallel computer system IBM 9076 SP2. The results show that it is a very good choice to mine outliers in a cluster of workstations with a low-cost interconnected by a commodity communication network.
Principal Feasability Studies Using Neuro &ndash; Numerics for Prediction of Flow Fields
Authors: Rainer M. Benning, Thomas M. Becker, Antonio Delgado
Venue: Neural Processing Letters (2002)

In this paper initial studies of the application of a hybrid model using artificial neural networks and conventional numerical methods to predict &ndash; as an example &ndash; twodimensional, isothermal, steady flow fields is presented. Main topics of the work were to show the principal possibility of using ANN in fluid mechanics and, additionally, to realize the potential of incorporation a priori knowledge of physical phenomena into the training procedure. For training, as well as for rating the prediction, flow fields, consisting of velocity, temperature and pressure, were generated by numerical simulation. Major result was that prediction of the flow and especially the existance of vortices in the bodies outflow depending on the Reynolds number can be realized with a much lesser time consumption than necessary for numerical calculation. Furthermore, a priori physical knowledge could be included in the learning process with an obvious improvement of the predicting ability of the hybrid model.
Multiple-scale leader-lattice VQ with application to LSF quantization
Authors: Adriana Vasilache, Bogdan Dumitrescu, Ioan Tabus
Venue: Signal Processing (2002)

In this study we introduce two new quantization structures, namely the multiple scale leader-lattice vector quantization (MSLLVQ) using different lattice truncations and (MSLLVQ) using different unions of leader vectors. The design methods and the corresponding encoding algorithms are presented for each structure. We first focus on the search in a truncated lattice and in a leader class of a lattice and we then propose two new search methods for pyramidal (l1-) truncations and l1/2-truncations. The encoding algorithms have low memory and computational requirements. The new schemes outperform in terms of SNR other lattice quantization structures presented in the literature in the case of generalized Gaussian source densities with decay parameters 0.5, 1 and 2. In addition, when used for LSF quantization they can achieve a mean spectral distortion below 1 dB at only 19 bits, being superior to the G.729 speech coder.
Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling
Authors: J. M. López, M. García, J. L. Díaz, D. F. García
Venue: Real-Time Systems (2003)

In this paper, we extend Liu and Layland&rsquo;s utilization bound for fixed priority scheduling on uniprocessors to homogeneous multiprocessor systems under a partitioning strategy. Assuming that tasks are pre-emptively scheduled on each processor according to fixed priorities assigned by the Rate-Monotonic policy, and allocated to processors by the First Fit algorithm, we prove that the utilization bound is (n&minus;1)(21/2&minus;1)+(m&minus;n+1)(21/(m&minus;n+1)&minus;1), where m and n are the number of tasks and processors, respectively. This bound is valid for arbitrary utilization factors. Moreover, if all the tasks have utilization factors under a value &alpha;, the previous bound is raised and the new utilization bound considering &alpha; is calculated. Finally, simulation provides the average-case behavior.
Fast Nearest-Neighbor Search in Dissimilarity Spaces
Authors: A. Faragó, T. Linder, G. Lugosi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A fast nearest-neighbor algorithm is presented. It works in general spaces in which the known cell techniques cannot be implemented for various reasons, such as the absence of coordinate structure or high dimensionality. The central idea has already appeared several times in the literature with extensive computer simulation results. An exact probabilistic analysis of this family of algorithms that proves its O(1) asymptotic average complexity measured in the number of dissimilarity calculations is presented.
Virtual Integrated Practice: Integrating Teams and Technology to Manage Chronic Disease in Primary Care
Authors: Steven K. Rothschild, Stanley Lapidos
Venue: Journal of Medical Systems (2003)

The use of teams in health care has generally relied on the notion that teams must physically meet and function in person in the same location, on a regular, scheduled basis, in order to maximize the value of the interdisciplinary process. This article examines the concept of creating a different kind of team in primary care, out-patient settings&mdash;one which relies upon communications technology to link together clinicians from different locations to coordinate and manage the care of patients, particularly those with chronic disease. This approach&mdash;referred to as Virtual Integrated Practice&mdash;is designed to overcome the barriers of traditional in-person teams by creating a &ldquo;virtual team&rdquo; with the potential to function more efficiently, productively, and satisfactorily for clinicians and patients alike.
Strongly regular graphs from differences of quadrics
Authors: Nicholas Hamilton
Venue: Discrete Mathematics (2002)

In this note strongly regular graphs with new parameters are constructed using nested "blown up" quadrics in projective spaces.
Real-Time Implementation of the Newton-Euler Equations of Motion on the NEC mu PD77230 DSP
Authors: Mansur Kabuka, Rodrigo Escoto
Venue: IEEE Micro (1989)

A methodology for implementing the Newton-Euler (NE) equations of motion on the mu PD77230 signal processor is presented. The targeted application is the control of robot arms, with a dual emphasis on performance and flexibility. The controller interprets high-level control commands and performs required computations without host intervention. The design objective was a relatively inexpensive host computer to control multiple robot arms without substantial programming or computational overhead. An option is provided for dividing torque computation into parallel tasks for improved speed.
On Augmenting Trace Cache for High-Bandwidth Value Prediction
Authors: Sang-Jeong Lee, Pen-Chung Yew
Venue: IEEE Transactions on Computers (2002)

Value prediction is a technique that breaks true data dependences by predicting the outcome of an instruction and speculatively executes its data-dependent instructions based on the predicted outcome. As the instruction fetch rate and issue rate of processors increase, the potential data dependences among instructions issued in the same cycle also increase. Value prediction and speculative execution become critical to keep the issue rate high. Unfortunately, most of the proposed value prediction schemes focused only on the accuracy of the prediction. They have yet to consider the bandwidth required to access the value prediction tables. In this paper, we focus on the bandwidth issues of the value prediction. We propose augmenting the trace cache [19], [26] (which was proposed to provide the required fetch bandwidth for wide-issue ILP processors) with a copy of the predicted values and moving the generation of those predicted values (which require accessing the value prediction tables) from the instruction fetch stage to a later stage, e.g., the writeback stage. Such a change will allow ¿selective value prediction,¿ i.e., only those instructions which require value prediction will access the value prediction tables. It can significantly reduce the bandwidth requirement of value prediction tables. We also use a dynamic classification scheme to steer predictor updates to behavior-specific tables (such as last-value, stride, two-level, etc.). A relatively even split among such table accesses further moderates the bandwidth requirement of those tables.