ppxscal/embedding_network huggingface dataset:
Non-contiguous processor allocation algorithms for distributed memory multicomputers
Authors: Wanqian Liu, Virginia Lo, Kurt Windisch, Bill Nitzberg
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Current processor allocation techniques for highly parallel systems have thus far been restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation. Three non-contiguous processor allocation strategies: Naive, Random and the Multiple Buddy Strategy (MBS) are proposed and studied in this paper. Simulations compare the performance of the non-contiguous strategies with that of several well-known contiguous algorithms. We show that non-contiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show non-contiguous allocation is feasible with current technologies.
Code Generators
Authors: Ted Lewis
Venue: IEEE Software (1990)

Code generators, which take a programmer's inputs in the form of some abstraction, design, or direct interaction with the system and write out a source program that implements the details of the application, are reviewed. After a brief overview, four separate presentations cover examples of such systems from four domains. The Tags tools uses abstraction to specify real-time control systems. In this tool, the details of synchronization code are hidden from the designer, but some functionality must still be provided in detail. Microstep is a similar kind of tool for data-processing applications. One can view both Tags and Microstep as high-level specification languages. PSG generates programming environments, i.e. one gives it a nonprocedural specification of a language's syntax and it generates an integrated programming environment for that language. While one must specify the environment in detailed form, the actual code generation is hidden. Escort is a similar system specialized for telecommunications applications. It lets one build, execute, and test specifications for telecommunication systems. Both PSG and Escort illustrate the power of domain-specific tools.
Distributed Computing on Regular Networks with Anonymous Nodes
Authors: T. V. Lakshman, V. K. Wei
Venue: IEEE Transactions on Computers (1994)

Presents efficient algorithms for collecting information distributed among indistinguishable (anonymous) processors while performing certain operations on the information being collected. The efficiency objective is to minimize the communication-delay product and to obtain trade-offs between the two. The main contribution of the paper is a new efficient algorithm for performing sumlike operations (such as Abelian group operations and elementary symmetric functions) and the use of metrically regular graphs (which include the widely used hypercube interconnections) for information dissemination in distributed computations. The best algorithm has a communication-delay product of O(Nlog/sup 3/ N) (for W nodes), and obtaining an optimal /spl Omega/(Nlog/sup 2/N) algorithm remains an open problem.
A Metapattern-Based Automated Discovery Loop for Integrated Data Mining-Unsupervised Learning of Relational Patterns
Authors: Wei-Min Shen, Bing Leng
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Metapattern (also known as metaquery) is a new approach for integrated data mining systems. Different from a typical "tool-box" like integration, where components must be picked and chosen by users without much help, metapatterns provide a common representation for intercomponent communication as well as a human interface for hypothesis development and search control. One weakness of this approach, however, is that the task of generating fruitful metapatterns is still a heavy burden for human users. In this paper, we describe a metapattern generator and an integrated discovery loop that can automatically generate metapatterns. Experiments in both artificial and real-world databases have shown that this new system goes beyond the existing machine learning technologies, and can discover relational patterns without requiring humans to prelabel the data as positive or negative examples for some given target concepts. With this technology, future data mining systems could discover high-quality, human comprehensible knowledge in a much more efficient and focused manner, and data mining could be managed easily by both expert and less expert users.
Making Network Interfaces Less Peripheral
Authors: Shubhendu S. Mukherjee, Mark D. Hill
Venue: Computer (1998)

A barrier to delivering improvements in network bandwidth and latency to users is the network interface (NI), which connects a network to the host computer that runs the network software. An NI includes hardware that exposes an internal interface-such as device registers- to a host processor. A key problem with most current NIs is that their internal interface is similar to that of a disk's interface. Because of such limitations, current NIs will not be adequate for use with newer, high-performance networks and host computers. High-performance local area networks have advanced so far that some view them as a new class of networks called system area networks (SANs). Emerging SANs deliver bandwidths of 10 Gbps or more and latencies of tens of nanoseconds-two to four orders of magnitude better than that delivered by most current LANs. New hosts demand much higher performance. If NIs do not adapt to these changes they will become a barrier to improving network performance. To solve this problem, future NIs should appear to their hosts more like memory than like disk interfaces. The authors argue that treating NI accesses like memory accesses is justified by the importance of network performance to future computers.
Improving Size Estimates Using Historical Data
Authors: James Bielak
Venue: IEEE Software (2000)

The author examines a completed C++ project and considers programming artifacts that we can readily trace to requirements and early class design.
Practical Oscillation-Based Test of Integrated Filters
Authors: Gloria Huertas, Diego Vázquez, Eduardo J.Peralías, Adoración Rueda, José Luis Huertas
Venue: IEEE Design Test (2002)

Oscillation-based test techniques show promise in detecting faults in mixed-signal circuits and require little modification to the circuit under test. Comparing both the oscillation's amplitude and frequency yields acceptable test quality.
Interactive Data Analysis: The Control Project
Authors: Joseph M. Hellerstein, Ron Avnur, Andy Chou, Christian Hidber, Chris Olston, Vijayshankar Raman, Tali Roth, Peter J. Haas
Venue: Computer (1999)

Data analysis is fundamentally an iterative process in which you issue a query, receive a response, formulate the next query based on the response, and repeat. You usually don't issue a single, perfectly chosen query and get the information you want from a database; indeed, the purpose of data analysis is to extract unknown information, and in most situations, there is no one perfect query. People naturally start by asking broad, big-picture questions and then continually refine their questions based on feedback and domain knowledge. In the Control (Continuous Output and Navigation Technology with Refinement Online) project at the University of California, Berkeley, the authors are working with collaborators at IBM, Informix, and elsewhere to explore ways to improve human-computer interaction during data analysis. The Control project's goal is to develop interactive, intuitive techniques for analyzing massive data sets.
Asynchronous Processor Survey
Authors: Tony Werner, Venkatesh Akella
Venue: Computer (1997)

Virtually all computers today are synchronous, thanks to an internal timing device that regulates processing. As systems grow increasingly large and complex, however, this little device-the clock-can cause big problems with clock skew, a timing delay that can create havoc with the overall design. It can also increase the circuit silicon and power dissipation. In seeking to overcome such limitations, computer architecture researchers are actively considering asynchronous processor design. Asynchronous architectures permit modular design: Each subsystem or functional block can be optimized without being synchronized to a global clock. Moreover, an asynchronous system exhibits the average performance of all components, rather than the worst-case performance of a single component. Asynchronous processors may also reduce power dissipation by inherently shutting down unused portions of the circuit. This article examines the key architecture issues that concern designers and compares six developmental asynchronous architectures. Though asynchronous processors may not match the performance of synchronous processors now, the condition generating the research into asynchronous processors will grow more prevalent as device geometries continue to shrink.
Consistency Checking in Complex Object Database Schemata with Integrity Constraints
Authors: Domenico Beneventano, Sonia Bergamaschi, Stefano Lodi, Claudio Sartori
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Integrity constraints are rules that should guarantee the integrity of a database. Provided an adequate mechanism to express them is available, the following question arises: Is there any way to populate a database which satisfies the constraints supplied by a database designer? That is, does the database schema, including constraints, admit at least a nonempty model? This work answers the above question in a complex object database environment, providing a theoretical framework, including the following ingredients: 1) two alternative formalisms, able to express a relevant set of state integrity constraints with a declarative style; 2) two specialized reasoners, based on the tableaux calculus, able to check the consistency of complex objects database schemata expressed with the two formalisms. The proposed formalisms share a common kernel, which supports complex objects and object identifiers, and which allow the expression of acyclic descriptions of: classes, nested relations and views, built up by means of the recursive use of record, quantified set, and object type constructors and by the intersection, union, and complement operators. Furthermore, the kernel formalism allows the declarative formulation of typing constraints and integrity rules. In order to improve the expressiveness and maintain the decidability of the reasoning activities, we extend the kernel formalism into two alternative directions. The first formalism, ${\cal OLCP,}$ introduces the capability of expressing path relations. Because cyclic schemas are extremely useful, we introduce a second formalism, ${\cal OLCD,}$ with the capability of expressing cyclic descriptions but disallowing the expression of path relations. In fact, we show that the reasoning activity in ${\cal OLCDP}$ (i.e., ${\cal OLCP}$ with cycles) is undecidable.
Robot learning driven by emotions
Authors: Sandra Clara Gadanho, John Hallam
Venue: Adaptive Behavior (2001)

The adaptive value of emotions in nature indicates that they might also be useful in artificial creatures. Experiments were carried out to investigate this hypothesis in a simulated learning robot. For this purpose, a non-symbolic emotion model was developed that takes the form of a recurrent artificial neural network where emotions both depend on and influence the perception of the state of the world. This emotion model was integrated in a reinforcement-learning architecture with three different roles: influencing perception, providing reinforcement value, and determining when to reevaluate decisions. Experiments to test and compare this emotion-dependent architecture with a more conventional architecture were done in the context of a solitary learning robot performing a survival task. This research led to the conclusion that artificial emotions are a useful construct to have in the domain of behavior-based autonomous agents with multiple goals and faced with an unstructured environment, because they provide a unifying way to tackle different issues of control, analogous to natural systems' emotions.
Knowledge Elicitation for Authoring Patent Claims
Authors: Svetlana Sheremetyeva, Sergei Nirenburg
Venue: Computer (1996)

To safeguard an invention, the inventor must apply for a patent. The first step is to author a patent claim. The claim is the focal point of a patent disclosure and the actual subject of legal protection. Claims contain crucial information about the invention and must be formulated according to precise syntactic, lexical, and stylistic rules, as specified in the guidelines pioneered by the German Patent Office and commonly accepted in the US and other countries. To successfully author a patent claim, you need two distinct types of expert knowledge: knowledge about the sublanguage of patents as legal documents and knowledge about the invention's technology. This is why inventors (who possess the technical knowledge) need the services of lawyers or patent experts (who possess the legal knowledge) to author a claim. To automate and thereby simplify the process of patent authoring, a system must elicit both kinds of knowledge. Legal knowledge essentially manifests itself in the constraints on and preferences concerning the lexical and grammatical language elements in a patent disclosure. This type of knowledge applies to all patents regardless of domain and need not be elicited more than once. Technical knowledge and the language of its description are much more varied; thus, its elicitation should be conducted separately for each patent document. Authoring patent disclosures is a complex task well suited for human-computer interaction, and patent claim composition is the most difficult part. Even for experts, claim analysis and synthesis is time-consuming. In hopes of alleviating this situation, we developed an experimental system for semiautomatic authoring of patent claims. The first implementation of our workstation, designed for both inventors and patent experts, is devoted to patent claim composition. This article focuses on interactively eliciting technical knowledge from inventors. These techniques let us readily acquire knowledge about different domains. When they are coupled with text generation, we can ultimately simplify text composition tasks faced by all sorts of professionals.
Using Different Communication Media in Requirements Negotiation
Authors: Daniela E. Herlea Damian, Armin Eberlein, Mildred L. G. Shaw, Brian R. Gaines
Venue: IEEE Software (2000)

Contrary to traditional wisdom, the authors found that when it comes to requirements negotiations, groups meeting face-to-face perform no better than those using video conferencing and computer support. Furthermore, their study identified a particular distributed group configuration that significantly improved performance and was more conducive to negotiation than face-to-face meetings.
Characterizing minimally 1-factorable r-regular bipartite graphs
Authors: D. Labbate
Venue: Discrete Mathematics (2002)

The possibilities for circuits of length 4 to appear together in a cubic bigraph are classified. That has consequences on the structure of minimally 1-factorable regular bigraphs, i.e. those in which each 1-factor lies in precisely one 1-factorization. We characterize minimally 1-factorable cubic bigraphs of girth 4.
Superspeculative Microarchitecture for Beyond AD 2000
Authors: Mikko H. Lipasti, John Paul Shen
Venue: Computer (1997)

Based on their research at Carnegie Mellon University, these authors also argue for billion-transistor uniprocessors. Like Patt et al., they divide the important implementation problems into three components: instruction flow, register dataflow, and memory dataflow. They also argue for trace caches and advanced branch prediction. Their article, however, focuses on using massive speculation at all levels to improve performance. They claim that without this much speculation, future processors will be limited by true data dependences, and will be unable to harvest enough instruction-level parallelism (ILP) to improve performance satisfactorily. Their investigations discovered large speedups on code that have traditionally not been amenable to finding ILP.
An Improved Method for Constructing Multiphase Communications Protocols
Authors: H. -A. Lin, C. -L. Tarng
Venue: IEEE Transactions on Computers (1993)

An extension to an existing method for building multiphase protocols is presented. One of the limitations of the former method is a stringent restriction on the validity of phases. Consequently, the protocols built by this method must run in a noiseless environment or rely on other protocols for reliable transport. Another restriction is a rigid requirement on the selection of the points that connect different phases. The presented method either minimizes or eliminates the above restrictions. It enables a multiphase protocol to deal with message corruption and loss, and provides a less restrictive way for phase connection. It also maintains the advantages of the existing method in allowing a multiphase protocol to be constructed in an easy and modular way.
A Scalable Parallel Formulation of the Backpropagation Algorithm for Hypercubes and Related Architectures
Authors: V. Kumar, S. Shekhar, M. B. Amin
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We present a new technique for mapping the backpropagation algorithm on hypercubeand related architectures. A key component of this technique is a network partitioningscheme called checkerboarding. Checkerboarding allows us to replace the all-to-allbroadcast operation performed by the commonly used vertical network partitioningscheme, with operations that are much faster on the hypercubes and relatedarchitectures. Checkerboarding can be combined with the pattern partitioning techniqueto form a hybrid scheme that performs better than either one of these schemes.Theoretical analysis and experimental results on nCUBE and CM5 show that our schemeperforms better than the other schemes, for both uniform and nonuniform networks.
Roomware-Moving Toward Ubiquitous Computers
Authors: Peter Tandler, Norbert Streitz, Thorsten Prante
Venue: IEEE Micro (2002)

Collaborative work approaches, facilitated by ubiquitous computing, will shape future working environments. roomware components integrate everyday office furniture with computer-based information devices.
A RKHS Interpolator-Based Graph Matching Algorithm
Authors: Michaël A. van Wyk, Tariq S. Durrani, Barend J. van Wyk
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

In this paper, we present a novel algorithm for performing attributed graph matching. This algorithm is derived from a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces. The algorithm incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on multiple sets of attributes. No assumption is made about the adjacency structure of the graphs to be matched.
Finding Waldo, or Focus of Attention Using Local Color Information
Authors: François Ennesser, Gérard Medioni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We present a method to locate an ¿object¿ in a color image, or more precisely, to select a set of likely locations for the object. The model is assumed to be of known color distribution, which permits the use color-space processing. A new method is presented, which exploits more information than the previous Backprojection Algorithm of Swain and Ballard at a competitive complexity. Precisely, the new algorithm is based on matching local histograms with the model, instead of directly replacing pixels with a confidence that they belong to the object. We prove that a simple version of this algorithm degenerates into Backprojection in the worst case. In addition, we show how to estimate the scale of the model.Results are shown on pictures digitized from the famous ¿Where is Waldo¿ books. Issues concerning the optimal choice of a color space and its quantization are carefully considered and studied in this application. We also propose to use co-occurrence histograms to deal with cases where important color variations can be expected.
Data Compression Limit for an Information Source of Interacting Qubits
Authors: Nilanjana Datta, Yuri Suhov
Venue: Quantum Information Processing (2002)

A system of interacting qubits can be viewed as a non-i.i.d quantum information source. A possible model of such a source is provided by a quantum spin system, in which spin-1/2 particles located at sites of a lattice interact with each other. We establish the limit for the compression of information from such a source and show that asymptotically it is given by the von Neumann entropy rate. Our result can be viewed as a quantum ana-logue of Shannon's noiseless coding theorem for a class of non-i.i.d. quantum informa-tion sources. From the probabilistic point of view it is an analog of the Shannon-McMillan-Breiman theorem considered as a cornerstone of modern Information Theory.PACS: 03.67-a; 03.67.Lx
Web on Wheels: Toward Internet-Enabled Cars
Authors: Akhtar Jameel, Matthias Stuempfle, Daniel Jiang, Axel Fuchs
Venue: Computer (1998)

The services provided to customers through the Internet can be extended to the automobile. Early versions of Internet-enabled cars might hit the road in five years or less. Portions of the technology could be available to customers in as little as two years as an after-sales solution. Indeed, such integration could become essential, given the constant access to information our just-in-time world seems to require. Integration could also be two-way: Your car might also provide information to the Internet for the purposes of remote diagnostics, among other things. Unlike the portable method of accessing the Internet with a laptop computer, an Internet-integrated vehicle is truly mobile. Mobility serves as both a challenge and a distinguishing factor in the design of our communication and service architecture. With the advancement of the Global Positioning System (GPS) and other position- tracking technologies, location awareness emerges as a distinctive characteristic of combining mobile computing and automobiles. This knowledge will be used to build communication and service architectures. For example, a service could provide information about the nearest gas station or restaurant. A safe and easy-to-use human interface for drivers and passengers must be designed to bring Internet-based services to moving vehicles. For example, an e-mail service must not require that drivers take their eyes off the road. We employ various alternatives, such as speech-based technologies, to address safety concerns.
The Classification, Fusion, and Parallelization of Array Language Primitives
Authors: D. C. R. Ju, C. L. Wu, P. Carini
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators.