ppxscal/embedding_network huggingface dataset:
Adaptive Parallelism and Piranha
Authors: Nicholas Carriero, Eric Freeman, David Gelernter, David Kaminsky
Venue: Computer (1995)

Desktop computers are idle much of the time. Ongoing trends make aggregate LAN "waste"--idle compute cycles--an increasingly attractive target for recycling. Piranha, a software implementation of adaptive parallelism, allows these waste cycles to be recaptured by putting them to work running parallel applications. Most parallel processing is static: Programs execute on a fixed set of processors throughout a computation. Adaptive parallelism allows for dynamic processor sets, which means that the number of processors working on a computation may vary, depending on availability. With adaptive parallelism, instead of parceling out jobs to idle workstations, a single job is distributed over many workstations. Adaptive parallelism is potentially valuable on dedicated multiprocessors as well, particularly on massively parallel processors. One key Piranha advantage is that task descriptors, not processes, are the basic movable, remappable computation unit. The task descriptor approach supports strong heterogeneity. A process image representing a task in midcomputation can't be moved to a machine of a different type, but a task descriptor can be. Thus, a task begun on a Sun computer can be completed by an IBM machine. The authors show that adaptive parallelism has the potential to integrate heterogeneous platforms seamlessly into a unified computing resource and to permit more efficient sharing of traditional parallel processors than is possible with current systems.
Generalization Capabilities of Subtle Image Pattern Classifiers
Authors: D. D. Egbert, P. H. Goodman, V. G. Kaburlasos, J. H. Witchey
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The generalization capabilities, for learned subtle image pattern categories, of neural network and algorithmic classification techniques are described. Several neural network and algorithmic techniques have been applied to a set of feature vectors extracted from thermal infrared images which characterize the extent of whiplash injury. Thermography recently has been reported to have clinical utility in a multitude of neuromusculoskeletal disorders, particularly with soft tissue injuries such as whiplash in which there are few widely agreed upon diagnostic standards. The results of this research indicate that the backpropagation neural network produces the best classification results and provides significantly better generalization from a set of training patterns. Results of unsupervised classification of the data using clustering algorithms and the Adaptive Resonance Theory (ART2) neural network demonstrate the difficulties of learning and of generalization of patterns from such data.
IFS: A Tool to Build Application Systems
Authors: Kiem-Phong Vo
Venue: IEEE Software (1990)

The interpretive frame system (IFS), a tool for building application systems, is presented. IFS separates high-level design and user-interface programming from domain-specific programming. It offers a language suitable for implementing systems of interconnected tasks, simplifies the construction of sophisticated but easy-to-use user interfaces, and increases tool reuse in system construction. A system built with IFs is called a frame system, and it consists of four layers-the user interface, system structure, computational functions, and data architecture-which are described. The IFS language and programming environment are also described. A programming example is given. Reuse and prototyping are discussed.
A Built-In Test Module for Fault Isolation
Authors: Nagesh Vasanthavada, Nick Kanopoulos
Venue: IEEE Design Test (1989)

A broad-level implementation of signature analysis that uses a built-in test module called a testing switch is presented. It is shown how board designers can incorporate the testing-switch modules to reduce the time it takes to isolate faulty chips. Both the test time and the power overhead are better with the testing-switch implementation than with schemes using built-in logic block observer circuits. The proposed technique is especially useful when boundary scan and self-test cannot be implemented in every chip of a board.
Editor's Notice
Authors: A. K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The problem of fitting a straight line to a planar set of points is reconsidered. A parameter space computational approach capable of fitting one or more lines to a set of points is presented. The suggested algorithm handles errors in both coordinates of the data points, even when the error variances vary between coordinates and among points and can be readily made robust to outliers. The algorithm is quite general and allows line fitting according to several useful optimality criteria to be performed within a single computational framework. It is observed that certain extensions of the Hough transform can be turned to be equivalent to well-known M estimators, thus allowing computationally efficient approximate M estimation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Role of the Good-Die Project in Miniaturized-System Design
Authors: Claudio Truzzi
Venue: IEEE Design Test (1998)

The implementation of complex electronic systems using High Density Packaging (HDP) technologies requires an IC-like "first-time right" design approach, as rework and prototyping for such technologies can be extremely expensive. On the other hand, most Multichip Module (MCM) and HDP technologies have not reached a mature stage yet. Highly integrated and versatile MCM design environments, able to provide an automated design data flow and to cope with the required flexibility, are therefore a necessity.One of the most important time-consuming and error-prone tasks in a HDP design flow is the selection of the desired bare die (or minimally packaged) component and the mostly manual data entry in the CAD environment. The outcome of the GOOD-DIE project provides an infrastructure addressing this issue and based on existing standards. A major advantage offered by this solution is the possibility to use it as a corner stone which one can build a complete automated MCM design environment around.
On Advances in Statistical Modeling of Natural Images
Authors: A. Srivastava, A. B. Lee, E. P. Simoncelli, S.-C. Zhu
Venue: Journal of Mathematical Imaging and Vision (2003)

Statistical analysis of images reveals two interesting properties: (i) invariance of image statistics to scaling of images, and (ii) non-Gaussian behavior of image statistics, i.e. high kurtosis, heavy tails, and sharp central cusps. In this paper we review some recent results in statistical modeling of natural images that attempt to explain these patterns. Two categories of results are considered: (i) studies of probability models of images or image decompositions (such as Fourier or wavelet decompositions), and (ii) discoveries of underlying image manifolds while restricting to natural images. Applications of these models in areas such as texture analysis, image classification, compression, and denoising are also considered.
Recommendations without user preferences: a natural language processing approach
Authors: Michael Fleischman, Eduard Hovy
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

We examine the problems with automated recommendation systems when information about user preferences is limited. We equate the problem to one of content similarity measurement and apply techniques from Natural Language Processing to the domain of movie recommendation. We describe two algorithms, a naïve word-space approach and a more sophisticated approach using topic signatures, and evaluate their performance compared to baseline, gold standard, and commercial systems.
Evaluation of Recursive Queries with Extended Rules in Deductive Databases
Authors: Sang Ho Lee, Lawrence J. Henschen
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In order to extend the expressive power of deductive databases, a formula that can have existential quantifiers in prenex normal form in a restricted way is defined as an extended rule. With the extended rule, we can easily define a virtual view that requires a division operation of relational algebra to evaluate. This paper addresses a recursive query evaluation where at least one formula in a recursive rule set is of an extended rule. We investigate transformable recursions as well as four cases of non-transformable recursions of transitive-closure-like and linear type. This work reveals that occurrence of an existentially quantified variable in the extended recursive body predicate might dramatically limit the level of recursive search. In particular, the number of iterations to answer extended queries can be determined, independently of database contents.
Empirical Failure Analysis and Validation of Fault Models in CMOS VLSI Circuits
Authors: Ashish Pancholy, Janusz Rajski, Larry J. McNaughton
Venue: IEEE Design Test (1992)

A way to empirically validate fault models and to measure the effectiveness of test sets based on the targeted fault models is described. The authors use automated fault diagnosis of test circuits representative of the circuits being studied and of the fabrication process, cell libraries, and CAD tools used in their development. The design and fabrication of a test chip using an experimental CMOS, 1.5- mu m double-layer metal process are discussed.
Multidimensional Database Technology
Authors: Torben Bach Pedersen, Christian S. Jensen
Venue: Computer (2001)

Multidimensional data-base technology is a key factor in the interactive analysis of large amounts of data for decision-making purposes. In contrast to previous technologies, these databases view data as multidimensional cubes that are particularly well suited for data analysis. Multidimensional models categorize data either as facts with associated numerical measures or as textual dimensions that characterize the facts. Queries aggregate measure values over a range of dimension values to provide results such as total sales per month of a given product. Multidimensional database technology is being applied to distributed data and to new types of data that current technology often cannot adequately analyze. For example, classic techniques such as preaggregation cannot ensure fast query response times when data-such as that obtained from sensors or GPS-equipped moving objects-changes continuously. Multidimensional database technology will increasingly be applied where analysis results are fed directly into other systems, thereby eliminating humans from the loop. When coupled with the need for continuous updates, this context poses stringent performance requirements not met by current technology.
Performance evaluation of ABR flow-control protocols in a wireless ATM network
Authors: Udo R. Krieger, Michael Savorić
Venue: Wireless Networks (2003)

Using an object-oriented simulation model of a basic client-server scenario in a wireless ATM network, we study the impact of handover and error-control protocols on the performance of high-speed data communication by the ABR service class. We present performance results of the ABR flow-control protocols ERICA and ERICA+ and discuss some implications for the protocol design.
Compressing large polygonal models
Authors: Jeffrey Ho, Kuang Chih Lee, David Kriegman
Venue: Proceedings of the conference on Visualization '01 (2001)

We present an algorithm that uses partitioning and gluing to compress large triangular meshes which are too complex to fit in main memory. The algorithm is based largely on the existing mesh compression algorithms, most of which require an 'in-core' representation of the input mesh. Our solution is to partition the mesh into smaller submeshes and compress these submeshes separately using existing mesh compression techniques. Since a direct partition of the input mesh is out of question, instead, we partition a simplified mesh and use the partition on the simplified model to obtain a partition on the original model. In order to recover the full connectivity, we present a simple scheme for encoding/decoding the resulting boundary structure from the mesh partition. When compressing large models with few singular vertices, a negligible portion of the compressed output is devoted to gluing information. On desktop computers, we have run experiments on models with millions of vertices, which could not be compressed using standard compression software packages, and have observed compression ratios as high as 17 to 1 using our technique.
Introducing the FR500 Embedded Microprocessor
Authors: Atsuhiro Suga, Kunihiko Matsunami
Venue: IEEE Micro (2000)

Developed for digital consumer products, the FR500 microprocessor issues four instructions simultaneously and can be configured in a small-scale circuit, making it possible to implement a low-cost, high-performance system.
Planning by Transformational Synthesis
Authors: Theodore A. Linden
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The results of applying transformational synthesis to planning missions and routes for multiple robotic vehicles are described. Transformational synthesis is an integration methodology that allows many control flow decisions to be deferred until later in the system life cycle, thus enhancing the flexibility and extensibility that one is trying to achieve by using planning technology. The planner has the domain knowledge and planning heuristics to plan multivehicle reconnaissance missions for DARPA's autonomous land vehicle. Most knowledge about the environment and all knowledge about the effects of vehicle operations is uncertain and is represented in terms of probability distributions. Implementation experience with the planner is described.
Reply to Comments on "Theory and Application of Cellular Automata in Cryptography"
Authors: S. Nandi, P. Pal Chaudhuri
Venue: IEEE Transactions on Computers (1997)

This reply emphasizes the point that the regular, modular, cascadable structure of local neighborhood CA can be employed for building low cost cipher system hardware. This cost effective engineering solution can achieve desired level of security with larger size CA.
Classical physics and the Church--Turing Thesis
Authors: Andrew Chi-Chih Yao
Venue: Journal of the ACM (JACM) (2003)

Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence suggests that this might be the case in the quantum world. But the question is of great interest even in the realm of classical physics. In this article, we observe that there is fundamental tension between the Extended Church--Turing Thesis and the existence of numerous seemingly intractable computational problems arising from classical physics. Efforts to resolve this incompatibility could both advance our knowledge of the theory of computation, as well as serve the needs of scientific computing.
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
Authors: Nicola Leone, Pasquale Rullo, Antonella Mecchia, Giuseppe Rossi
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

The BQM¿an acronym that stands for Bottom-up Query machine, the role played by our system in the framework of the KIWIS system [2]¿system extends deductive database technology with knowledge structuring capabilities to provide an advanced environment for the development of data and knowledge-based applications. The system relies on a knowledge representation language that combines the declarativeness of logic programming with the notions of object, inheritance with exceptions, and message passing. Exceptions are supported by allowing rules with negated heads. The use of exceptions inside the inheritance mechanism makes the language inherently nonmonotonic. The paper contains a comprehensive description of both the language and the implementation principles of the BQM system. It begins by providing a model-theoretic semantics of the language based on the notion of least model. A fixpoint semantics, providing a constructive definition of the least model, is given as well. Then, a number of implementation techniques for efficient query evaluation are described. Such techniques significantly extend "traditional" deductive database query evaluation strategies to deal with monotonic reasoning. A description of the architecture of the current prototype of the BQM system is also given.
&#956ITRON for Small-Scale Embedded Systems
Authors: Hiroaki Takada, Ken Sakamura
Venue: IEEE Micro (1995)

The \muITRON is a standard real-time kernel specification for use in small-scale embedded control systems. This specification has been implemented for a large number of microcontroller units (MCUs), and has been utilized in numerous applications. In this article, the design principles of the \muITRON specification and the current state of its implementations and applications are described. The overview of the \muITRON bus, a low-cost real-time LAN standard for connecting small-scale embedded systems, is also introduced.
Deterministic Many-to-Many Hot Potato Routing
Authors: Allan Borodin, Yuval Rabani, Baruch Schieber
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing, a packet cannot be buffered, and is therefore always moving until it reaches its destination. We give optimal and nearly optimal deterministic algorithms for many-to-many packet routing in commonly occurring networks such as the hypercube, meshes, and tori of various dimensions and sizes, trees, and hypercubic networks such as the butterfly. All these algorithms are analyzed using a charging scheme that may be applicable to other algorithms as well. Moreover, all bounds hold in a dynamic setting in which packets can be injected at arbitrary times.
Principal Interconnections in Higher Order Hebbian-Type Associative Memories
Authors: Jung-Hua Wang
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

The existence of principal interconnections useful in solving the proliferation problem in higher order Hebbian-type associative memories is introduced. Among all legal interconnections, we prove there exists a subset Tpr that carries more information than the others. Regardless of the network order p, the elements in Tpr are shown to be those interconnections T that fall within the range of$$\sqrt {m_s} \le \left| T \right| \le 2 \sqrt {m_s},$$where ms equals the number of stored codewords. Memories that use only Tpr can maintain original generalization performance, using less than 50 percent of the total number of interconnections.
Semantic Issues in the Verification of Agent Communication Languages
Authors: Michael Wooldridge
Venue: Autonomous Agents and Multi-Agent Systems (2000)

This article examines the issue of developing semantics for agent communication languages. In particular, it considers the problem of giving a verifiable semantics for such languages&mdash;a semantics where conformance (or otherwise) to the semantics could be determined by an independent observer. These problems are precisely defined in an abstract formal framework. Using this framework, a number of example agent communication frameworks are defined. A discussion is then presented, of the various options open to designers of agent communication languages, with respect the problem of verifying conformance.
A Commonsense Management Model
Authors: Raymond T. Yeh, David A. Naumann, Roland T. Mittermeir, Reinhard A. Schlemmer, William S. Gilmore, George E. Sumrall, John T. LeBaron
Venue: IEEE Software (1991)

A description is given of a process-management model, called cosmos, which combines the best of existing models by incorporating three perspectives: activity, communication, and infrastructure. Cosmos is designed to manage a large software system from beginning to end. Current problems in system development are reviewed, and the principles on which cosmos is based are outlined. The reasons for using such a three-dimensional model are examined. The use of cosmos is described.
A simple axiomatization of binary rank-dependent utility of gains (losses)
Authors: A. A. J. Marley, R. Duncan Luce
Venue: Journal of Mathematical Psychology (2002)

For binary gambles composed only of gains (losses) relative to a status quo, the rank-dependent utility model with a representation that is dense in intervals is shown to be equivalent to ten elementary properties plus event commutativity and a gamble partition assumption. The proof reduces to a (difficult) functional equation that has been solved by Aczél, Maksa, and Páles (in press).
An Integrated Environment for Teaching Computer Architecture
Authors: Jovan Djordjevic, Aleksandar Milenkovic, Nenad Grbanovic
Venue: IEEE Micro (2000)

To bridge the gap between learning and doing in traditional computer architecture courses, students require a different educational approach, such as the integrated environment the authors describe.
On principal component analysis in L1
Authors: Baibing Li, Elaine B. Martin, A. Julian Morris
Venue: Computational Statistics Data Analysis (2002)

Four formulations of principal component analysis in L1 norm were developed by Galpin and Hawkins (Comput. Statist. Data Anal. 5 (1987) 305), QPmax, QPmin, LPmax, and LPmin. Choulakian (Comput. Statist. Data Anal. 37 (2001)135) claimed that of the four formulations, only QPmax produces a non-trivial solution. The objective is to present counter-examples that illustrate that the QPmin and LPmin formulations also give non-trivial solutions that may be unique except for the sign.
SPEC as a Performance Evaluation Measure
Authors: Ran Giladi, Niv Ahituv
Venue: Computer (1995)

System Performance Evaluation Cooperative (SPEC) measures are commonly considered the most effective indicators for evaluating engineering workstation performance. Indeed, these measures have gradually become a de facto industry standard for CPU performance evaluation. But do they truly provide added information value? The authors examine SPEC measures with the aim of learning their limitations and the areas in which caution should be exercised. They present results and evaluations of a comprehensive statistical analysis of SPEC rankings published in the SPEC Newsletter over a number of years. The major findings show that several programs in the benchmark suite contribute little additional information to the measures. In fact, the potency profile of the system can be demonstrated by just a few representative programs. Moreover, the method of aggregating the results to create a single measure (or two measures) leads to distortion in presenting the overall system performance. In evaluating the system, SPEC focuses on the CPU clock rate and thus may not reflect the performance of the entire system. This suggests that the added value of the SPEC information is not very high. The authors thus advise that SPEC should be employed cautiously with full awareness of its shortcomings.
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems
Authors: O. L. Mangasarian, M. V. Solodov
Venue: Computational Optimization and Applications (1999)

We establish the first rate of convergence result for the class of derivative-free descent methods for solving complementarity problems. The algorithm considered here is based on the implicit Lagrangian reformulation [26, 35] of the nonlinear complementarity problem, and makes use of the descent direction proposed in [42], but employs a different Armijo-type linesearch rule. We show that in the strongly monotone case, the iterates generated by the method converge globally at a linear rate to the solution of the problem.