ppxscal/embedding_network huggingface dataset:
Reliability Properties Assessment at System Level: A Co-Design Framework
Authors: C. Bolchini, L. Pomante, F. Salice, D. Sciuto
Venue: Journal of Electronic Testing: Theory and Applications (2002)

This paper introduces an enhanced hardware/software co-design framework allowing the designer to introduce hardware fault detection properties in the system under consideration. By considering reliability requirements at system level, within a hw/sw co-design flow, it is possible to evaluate overheads and benefits of different solutions. System specification, hardware and software concurrent fault detection design methodologies and hw/sw partitioning are the three key factors taken into account. The paper discusses these aspects providing a complete overview of the reliability co-design project.
A counterexample to a conjecture of Erd&#x00D5;s
Authors: Türker Bíyíkoglu
Venue: Discrete Mathematics (2002)

This short note provides a counterexample to a conjecture of Erdös on non-3-colorable planar graphs with exactly four triangles.
Jade: A High-Level, Machine-Independent Language for Parallel Programming
Authors: Martin C. Rinard, Daniel J. Scales, Monica S. Lam
Venue: Computer (1993)

Jade, a high-level parallel programming language for managing coarse-grained parallelism, is discussed. Jade simplifies programming by providing sequential-execution and shared-address-space abstractions. It is also platform-independent; the same Jade program runs on uniprocessors, multiprocessors, and heterogeneous networks of machines. An example that illustrates how Jade programmers express irregular, dynamically determined concurrency and how the implementation exploits this source of concurrency is presented. A digital video imaging program that runs on a high-resolution video system and several other examples of Jade applications are described.
Fast Hierarchical Test Path Construction for Circuits with DFT-Free Controller-Datapath Interface
Authors: Yiorgos Makris, Jamison Collins, Alex Orailoğlu
Venue: Journal of Electronic Testing: Theory and Applications (2002)

Hierarchical approaches address the complexity of test generation through symbolic reachability paths that provide access to the I/Os of each module in a design. However, while transparency behavior suitable for symbolic design traversal can be utilized for constructing reachability paths for datapath modules, control modules do not exhibit transparency. Therefore, incorporating such modules in reachability path construction requires exhaustive search algorithms or expensive DFT hardware. In this paper, we discuss a fast hierarchical test path construction method for circuits with DFT-free controller-datapath interface. A transparency-based RT-Level hierarchical test generation scheme is devised for the datapath, wherein locally generated vectors are translated into global design test. Additionally, the controller is examined through the introduced concept of influence tables, which are used to generate valid control state sequences for testing each module through hierarchical test paths. Fault coverage and vector count levels thus attained match closely those of traditional test generation methods, while sharply reducing the corresponding computational cost and test generation time.
The Mythical Man-Month: After 20 Years
Authors: Frederick P. Brooks,  Jr.
Venue: IEEE Software (1995)

A UK consortium hasidentified the special characteristics of RAD projects and published a first version of a development standard. The three critical success factors are easy access to end users, a stable and skilled development team, and a commercial application.
Shape-driven deformations of functionally defined heterogeneous volumetric objects
Authors: B. Schmitt, A. Pasko, C. Schlick
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

In this paper, we propose a framework for deforming heterogeneous volumetric objects defined as point sets with attributes. In contrast to homogeneous volumes with uniform distribution of material and other properties, a heterogeneous volumetric object has a number of attributes assigned at each point. An attribute is a mathematical model of an object property of arbitrary nature (material, photometric, physical, statistical etc.). It is not necessary for an attribute to be described by a continuous function.In our approach, the function representation (FRep) is used as the basic model for both object geometry and attributes represented independently using real-valued scalar functions of point coordinates. While FRep directly defines object geometry, for an attribute it specifies a space partition used to define the attribute function.Deformation of an existing object is usually considered as the final step of the modelling process. In this paper, we propose to define a new node in the FRep tree based on shape-driven deformations. These deformations can be controlled by additional shapes (points, curves, surfaces, or solids) and can be applied to object geometry and attributes at any modelling step.
A New Testing Acceleration Chip for Low-Cost Memory Tests
Authors: Michihiro Inoue, Toshio Yamada, Atsushi Fujiwara
Venue: IEEE Design Test (1993)

It is argued that the development of semiconductor memories has reached a turning point. In the multimegabit dynamic random access memories (DRAMs) of the future, major factors contributing to the chip cost are process complexity, die size, equipment cost, and test cost. If conventional test methods are used, test costs will grow at an especially rapid rate. A memory test concept called the testing acceleration chip, which could reduce future test costs a hundredfold and yet maintain AC testing reliability, is presented.
The knowledge grid
Authors: Mario Cannataro, Domenico Talia
Venue: Communications of the ACM (2003)

Designing, building, and implementing an architecture for distributed knowledge discovery.
A note on models for non-probabilistic analysis of packet switching networks
Authors: Adi Rosén
Venue: Information Processing Letters (2002)

We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types of models, and between them and the set of sequences of packets that allow stability. We also consider the adaptive setting in which packets are injected with only their source and destination but without a prescribed path to follow.
Windows NT Clustering Service
Authors: Rod Gamache, Rob Short, Mike Massa
Venue: Computer (1998)

The Windows NT Clustering Service supports high-availability file servers, databases, and generic applications and services. A cluster is a collection of computer nodes-independent, self-contained computer systems-that work together to provide a more reliable and powerful system than a single node. In general, the goal of a cluster is to distribute a computing load over several systems, without users or system administrators being aware of the independent systems running the services. The Windows NT Clustering Service detects and restarts failed hardware or software components or migrates the failed component's functionality to another node if local restart is not possible. It also offers a much simpler user and programming interface. Microsoft Cluster Service for Windows NT has been shipping for about a year on Windows NT version 4.0. The upcoming Windows NT 5.0 release of Windows NT Clustering Service will improve ease of use through a wizard that guides the user through the creation of cluster resources.
Customizing information: Part 1, Getting what we need, when we need it
Venue: Computer (1994)

As we move further into the information age, it is becoming ever more apparent that society as a whole, and information and computing specialists as its agents, will have to confront the general problem of information overload. The rising flood of information will soon compel us to use techniques and resources aimed at maximising our information handling efficiency. Storing and retrieving digital information according to consumer requirements is only part of the equation, information must also be presented in a form suited to the consumer's needs at the time of consumption. We call this information customisation and characterise it as the transformation of information into its most appropriate form. Thus, customisation makes existing information more useful.
Solving Einstein's Equations on Supercomputers
Authors: Gabrielle Allen, Tom Goodale, Gerd Lanfermann, Thomas Radke, Edward Seidel, Werner Benger, Hans-Christian Hege, Andre Merzky, Joan Massó, John Shalf
Venue: Computer (1999)

In 1916, Albert Einstein published his famous general theory of relativity, which contains the rules of gravity and provides the basis for modern theories of astrophysics and cosmology. For many years, physicists, astrophysicists, and mathematicians have striven to develop techniques for unlocking the secrets contained in Einstein's theory of gravity; more recently, computational-science research groups have added their expertise to the endeavor. Because the underlying scientific project provides such a demanding and rich system for computational science, techniques developed to solve Einstein's equations will apply immediately to a large family of scientific and engineering problems. The authors have developed a collaborative computational framework that allows remote monitoring and visualization of simulations, at the center of which lies a community code called Cactus. Many researchers in the general scientific computing community have already adopted Cactus, as have numerical relativists and astrophysicists. This past June, an international team of researchers at various sites ran some of the largest such simulations in numerical relativity yet undertaken, using a 256- processor SGI Origin 2000 supercomputer at NCSA.
hp-Approximation Theory for BDFM and RT Finite Elements on Quadrilaterals
Authors: Mark Ainsworth, Katia Pinchedez
Venue: SIAM Journal on Numerical Analysis (2002)

We study approximation properties of hp-finite element subspaces of $\boldsymbol{\mathsf{H}}(\mathop{{\rm div}},\Omega)$ and $\boldsymbol{\mathsf{H}}(\mathop{{\rm rot}},\Omega)$ on a polygonal domain $\Omega$ using Brezzi--Douglas--Fortin--Marini (BDFM) or Raviart--Thomas (RT) elements. Approximation theoretic results are derived for the hp-version finite element method on non-quasi-uniform meshes of quadrilateral elements with hanging nodes for functions belonging to weighted Sobolev spaces ${\boldsymbol{\mathsf{H}}}_{\omega}^{s,\ell}(\Omega)$ and the countably normed spaces $\pmb{{\cal B}}_{w}^{\ell}(\Omega)$. These results culminate in a proof of the characteristic exponential convergence property of the hp-version finite element method on suitably designed meshes under similar conditions needed for the analysis of the ${\boldsymbol{\mathsf{H}}}^{1}(\Omega)$ case. By way of illustration, exponential convergence rates are deduced for mixed hp-approximation of flow in porous media.
A Unifying Approach to Iconic Indexing for 2-D and 3-D Scenes
Authors: G. Costagliola, G. Tortora, T. Arndt
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Several iconic indexes for representing three-dimensional scenes are presented. The approach extends previous work in iconic indexing of two-dimensional scenes in a unified manner. Good characteristics for iconic indexes are also pointed out. OPP2 and OPP3, two-dimensional iconic indexes for three-dimensional scenes, are introduced. The problem of ambiguity in the OPP2 and OPP3 representations of three-dimensional scenes is studied in detail and a class of images for which they are unambiguous is identified. The Genstring, a linear iconic index which can be used to represent two-, three-, or higher-dimensional scenes, is introduced. It provides a compact, unambiguous representation of a three-dimensional scene. The Genstring takes advantage of previous work, thus providing fast pattern matching for higher-dimensional scenes. In fact, the pattern matching algorithm given for k-dimensional scenes is as fast as that previously given for two-dimensional scenes.
An interface for user-defined functions in a database application
Authors: Stephen M. Mansour
Venue: Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications (2002)

This paper describes a database application, which permits users to write their own functions in a limited way using a scripting language consisting of a set of canned functions written in APL. Inputs to the function can be database fields and/or constant values. This provides users with additional flexibility in generating reports and selection statements.The user must first define the function inputs and outputs assigning names, position, data types, default values and descriptions for each. Then the user writes a script in the database language, making reference to the named input and output fields. The scripting language is limited to a defined set of functions and certain ASCII symbols.A limited set of control structures are permitted, such as if-then-else, and while loops.The application consists of an editor, which allows the user to describe the inputs and write the script, and a "compiler", which generates an APL function, which behaves in a similar manner to the canned functions, provided with the database application. The "compiler" inserts data assignment and input checking into the function based on the data type and data structure permitted by the user.
Virtual-Address Caches, Part 2: Multiprocessor Issues
Authors: Michel Cekleov, Michel Dubois
Venue: IEEE Micro (1997)

In order to support virtual memory, virtual addresses must be efficiently translated into physical addresses. Traditionally, this dynamic translation has been done in a Translation Lookaside Buffer (TLB) before or in parallel with the cache access, so that the cache is indexed and tagged with physical addresses. Consistency problems add complexity to virtual-address caches. The main sources of these problems are the presence of synonyms and address-mapping changes. In this first part of this two-part survey, we introduced the problems and discussed solutions in the context of single-processor systems. In Part 2 of, we address multiprocessor issues. In multiprocessors, coherence of caches and TLBs must be maintained. The virtual caches can take advantage of these mechanisms. Therefore, some solutions make more sense than others in a multiprocessor environment.
An Analysis of Cache Performance for a Hypercube Multicomputer
Authors: C. B. Stunkel, W. K. Fuchs
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

Multicomputer cache simulation results derived from address traces collected from an Intel iPSC/2 hypercube multicomponent are presented. The primary emphasis is on examining how increasing the number of processor nodes executing a parallel application affects the overall multicomputer cache performance. The effects on multicomputer direct-mapped cache performance of application-specific data partitioning, data access patterns, communication distribution, and communication frequency are illustrated. The effects of system accesses on total cache performance are explored, as well as the reasons for application-specific differences in cache behavior for system and user accesses. Comparing user code results with full user and system code analysis reveals the significant effect of system accesses, and this effect increases with multicomputer size. The time distribution of an application's message-passing operations is found to more strongly affect cache performance than the total amount of time spent in message-passing code.
Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies
Authors: David Carmel, Shaul Markovitch
Venue: Autonomous Agents and Multi-Agent Systems (1999)

An agent that interacts with other agents in multi-agent systems can benefit significantly from adapting to the others. When performing active learning, every agent's action affects the interaction process in two ways: The effect on the expected reward according to the current knowledge held by the agent, and the effect on the acquired knowledge, and hence, on future rewards expected to be received. The agent must therefore make a tradeoff between the wish to exploit its current knowledge, and the wish to explore other alternatives, to improve its knowledge for better decisions in the future. The goal of this work is to develop exploration strategies for a model-based learning agent to handle its encounters with other agents in a common environment. We first show how to incorporate exploration methods usually used in reinforcement learning into model-based learning. We then demonstrate the risk involved in exploration&mdash;an exploratory action taken by the agent can yield a better model of the other agent but also carries the risk of putting the agent into a much worse position.We present the lookahead-based exploration strategy that evaluates actions according to their expected utility, their expected contribution to the acquired knowledge, and the risk they carry. Instead of holding one model, the agent maintains a mixed opponent model, a belief distribution over a set of models that reflects its uncertainty about the opponent's strategy. Every action is evaluated according to its long run contribution to the expected utility and to the knowledge regarding the opponent's strategy. Risky actions are more likely to be detected by considering their expected outcome according to the alternative models of the opponent's behavior. We present an efficient algorithm that returns an almost optimal exploration plan against the mixed model and provide a proof of its correctness and an analysis of its complexity.We report experimental results in the Iterated Prisoner's Dilemma domain, comparing the capabilities of the different exploration strategies. The experiments demonstrate the superiority of lookahead-based exploration over other exploration methods.
Modeling throughput in TCP vegas
Authors: Charalampos (Babis) Samios, Mary K. Vernon
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

This abstract describes a simple and accurate analytic model for the steady state throughput of TCP Vegas, as a function of round trip time and packet loss rate. Such models have previously been developed for TCP Reno. However, several aspects of TCP Vegas need to be treated quite differently from their counterparts in Reno. In particular, TCP Vegas employs an algorithm to detect the incipient stages of congestion in the network and preemptively adjusts the sending rate to avoid losses. The proposed model reflects this behavior, as well as Vegas' new slow start mechanism, and the most important of the innovative congestion recovery mechanisms introduced in TCP Vegas. Initial validations against the ns-2 simulator configured to simulate TCP Vegas are presented.
A Comparison of Algorithms for Connected Set Openings and Closings
Authors: A. Meijster, M. H. F. Wilkinson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent union-find approach. Unlike the earlier algorithms which process regional extrema in the image sequentially, the union-find method allows simultaneous processing of extrema. In the context of area openings, closings, and pattern spectra, the union-find algorithm outperforms the previous methods on almost all natural and synthetic images tested. Finally, extensions to pattern spectra and the more general class of attribute operators are presented for all three algorithms, and memory usages are compared.
A Class of Intrinsic Schemes for Orthogonal Integration
Authors: Elena Celledoni, Brynjulf Owren
Venue: SIAM Journal on Numerical Analysis (2002)

Numerical integration of ODEs on the orthogonal Stiefel manifold is considered. Points on this manifold are represented as n &times; k matrices with orthonormal columns, of particular interest is the case when $n\gg k$. Mainly two requirements are imposed on the integration schemes. First, they should have arithmetic complexity of order nk2. Second, they should be intrinsic in the sense that they require only the ODE vector field to be defined on the Stiefel manifold, as opposed to, for instance, projection methods. The design of the methods makes use of retractions maps. Two algorithms are proposed, one where the retraction map is based on the QR decomposition of a matrix, and one where it is based on the polar decomposition. Numerical experiments show that the new methods are superior to standard Lie group methods with respect to arithmetic complexity, and may be more reliable than projection methods, owing to their intrinsic nature.
Teaching and Learning in the Wireless Classroom
Authors: Paul G. Shotsberger, Ron Vetter
Venue: Computer (2001)

Combining handheld PCs with wireless Internet access offers new possibilities for both educators and students.
Fault-Tolerant Communication in Embedded Supercomputing
Authors: Giorgos Efthivoulidis, Evangelos A. Verentziotis, Apostolos N. Meliones, Theodora A. Varvarigou, Antonios Kontizas, Geert Deconinck, Vincenzo De Florio
Venue: IEEE Micro (1998)

A framework is developed to integrate fault tolerance flexibly and easily into embedded parallel HPC applications. This framework consists of a variety of reusable fault tolerance modules acting at different levels and coping with common requirements. The burden of ad hoc fault tolerance programming is removed from the application developers, while at the same time mediocre fault tolerance support taken at the operating system level is avoided. Integration of this functionality in real embedded applications validates this approach, and provides promising results. In this article we focus on fault tolerance mechanisms for synchronous and asynchronous communication between application threads running on system nodes.
Guest Editors' Introduction: Early 21st Century Processors
Authors: Sriram Vajapeyam, Mateo Valero
Venue: Computer (2001)

The computer architecture arena faces exciting challenges as it attempts to meet the design goals and constraints that new markets, changing applications, and fast-moving semiconductor technology impose.
Computing iceberg concept lattices with TITANIC
Authors: Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
Venue: Data Knowledge Engineering (2002)

We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.