ppxscal/embedding_network huggingface dataset:
Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
Authors: A. L. N. Reddy, P. Banerjee
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

Several issues concerning the design of an I/O (input/output) system for a multiprocessor such as a hypercube are examined. A methodology is proposed for connecting the I/O processors to such a system for efficient I/O access. The effect of I/O communication onthe multiprocessor network is analyzed. Different disk organizations that can be employed within such a system are evaluated to see which organization has a better performance. It is observed that parallelism in serving an I/O request plays a dominant role in the scientific workload. The problem of mapping specific data structures such as matrices onto the disks so that the data can be accessed efficiently is considered.
Software Architectures and Coordination Models
Authors: Paola Inverardi, Henry Muccini
Venue: The Journal of Supercomputing (2003)

Coordination models and Software Architectures are strictly related but only a little attention has been paid to their integration. What we propose in this paper is an approach to trace coordination requirements from their definition to the low level specification. The UML Unified Process is extended to gain this objective and the theory is applied to a case study.
Performance-driven placement for dynamically reconfigurable FPGAs
Authors: Guang-Ming Wu, Jai-Ming Lin, Yao-Wen Chang
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2002)

In this article, we introduce a new placement problem motivated by the Dynamically Reconfigurable FPGA (DRFPGA) architectures. Unlike traditional placement, the problem for DRFPGAs must consider the precedence constraints among logic components. For the placement, we develop an effective metric that can consider wirelength, register requirement, and power consumption simultaneously. With the considerations of the new metric and the precedence constraints, we then present a three-stage scheme of partitioning, initial placement generation, and placement refinement to solve the new placement problem. Experimental results show that our placement scheme with the new metric achieves respective improvements of 17.2, 27.0, and 35.9&percnt; in wirelength, the number of registers, and power consumption requirements, compared with the list scheduling method.
Distributed On-Demand Address Assignment in Wireless Sensor Networks
Authors: Curt Schurgers, Gautam Kulkarni, Mani B. Srivastava
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Sensor networks consist of autonomous wireless sensor nodes that are networked together in an ad hoc fashion. The tiny nodes are equipped with substantial processing capabilities, enabling them to combine and compress their sensor data. The aim is to limit the amount of network traffic, and as such conserve the nodes' limited battery energy. However, due to the small packet payload, the MAC header is a significant, and energy-costly, overhead. To remedy this, we propose a novel scheme for a MAC address assignment. The two key features which make our approach unique are the exploitation of spatial address reuse and an encoded representation of the addresses in data packets. To assign the addresses, we develop a purely distributed algorithm that relies solely on local messsage exchanges. Other salient features of our approach are the ability to handle unidirectional links and the excellent scalability of both the assignment algorithm and address representation. In typical scenarios, the MAC overhead is reduced by a factor of three compared to existing approaches.
On the average size of sets in intersecting sperner families
Authors: Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck
Venue: Discrete Mathematics (2002)

We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1k-1) is at least k provided that k ≤ n/2 - √n/2 + 1. The statement is not true if n/2 ≥ k > n/2 - √8n+1/8+9/8.
Joust: A Platform for Liquid Software
Authors: John J. Hartman, Peter A. Bigot, Patrick Bridges, Brady Montz, Rob Piltz, Oliver Spatscheck, Todd A. Proebsting, Larry L. Peterson, Andy Bavier
Venue: Computer (1999)

Computer network research has recently focused on the feasibility of running mobile code on the intermediate nodes that forward packets through a network. A network that exploits mobile code in this way is called an active network because the network's packet delivery service is programmable, rather than fixed. Active networking is just one example of a class of systems that exploit liquid software--low-level, communication-oriented code that easily flows from machine to machine. This article describes a Java-based platform for liquid software, called Joust, that is specifically designed to support low-level, communication-oriented systems and to avoid the limitations of general- purpose OSs. The authors contrast the platform requirements for communication- oriented liquid software with those of computation-oriented software, identify the limitations of current platforms, and outline the benefits of Joust. They also offer an overview of Scout (the underlying OS upon which Joust is built), its runtime system, and its just-in-time (JIT) compiler.
Critics for Knowledge-Based Design Systems
Authors: Huan Liu, Chris D. Rowles, Wilson X. Wen
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Expert critics have been built to critique human performance in various areas such as engineering design, decision making, etc. We suggest that critics can also be useful in the building and use of knowledge-based design systems (KBDSs).Knowledge engineers elicit knowledge from domain experts and build a knowledge-based design system. The system generates designs. The amount of knowledge the system possesses and the way it applies the knowledge directly influence the performance of its designs. Therefore, critics are proposed to assist 1) acquiring sufficient knowledge for constructing a desirable system, and 2) applying proper knowledge to generating designs. Methodologies of equipping a KBDS with critics are developed. Our practice in building and using a KBDS shows the applicability and capability of these critics.
Search Engines as a Security Threat
Authors: Julio César Hernández, José María Sierra, Arturo Ribagorda, Benjamín Ramos
Venue: Computer (2001)

Search engines index a huge number of Web pages and other resources. Hackers can use these engines to make anonymous attacks, find easy victims, and gain the knowledge necessary to mount a powerful attack against a network.Further, search engines can help hackers avoid identification. One reason so few hacking attempts get reported is that there are so many of them. Tracerouting a hacker's IP address to its source often ends at a hop completely unrelated to the hacker's actual ISP or local network, which makes reporting the hacker to the upstream provider difficult.Search engines are dangerous largely because users are careless. In the age of DSL and broadband cable accounts, users often keep their machines turned on and connected to the Internet for days. Most of them would be shocked to find that potential hackers target their machines up to several times a minute. Most home-machine hack attempts seek to make their targets zombies in a distributed denial-of-service attack. Search engines make discovering candidate machines almost effortless.It isn't possible to secure all channels against hackers trying to penetrate a vulnerable system. But search engines needn't be wide-open channels that continue to help hackers find and penetrate weak systems.
Causal Knowledge Elicitation Based on Elicitation Failures
Authors: Silvano Mussi
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

The paper presents an approach to causal knowledge elicitation supported by a tool directly used by the domain expert. This knowledge elicitation approach is characterized by trying to guess an interpretation of the knowledge entered by the expert. The tool (initially general), as it is used, self-customizes its guessing capability, remembers failures in guessing (in order to avoid similar failures in the future) and when they occur elicits their explanations. Even in this case elicitation is supported by guessing on the basis of previous similar failures. The resulting overall effect is that the tool digs up tenaciously causal knowledge from the expert¿s mind, playing in this way a cooperative role for model building.
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
Authors: Y. Q. Bai, M. El Ghami, C. Roos
Venue: SIAM Journal on Optimization (2002)

We introduce a new barrier-type function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, the iteration bound of a large-update interior-point method based on this function is shown to be $O({\sqrt{n}\,({\rm log}\,n)\,{\rm log}\,\frac{n}{\varepsilon}})$, which is as good as the currently best known bound for large-update methods. The recently introduced property of \emph{exponential convexity} for the kernel function underlying the barrier function, as well as the strong convexity of the kernel function, are crucial in the analysis.
Automatic Indexing and Content-Based Retrieval of Captioned Images
Authors: Rohini K. Srihari
Venue: Computer (1995)

This research explores the interaction of textual and photographic information in an integrated text/image database environment developed at the Center of Excellence for Document Analysis and Recognition (CEDAR), State University of New York, Buffalo. The idea is to extract information from a newspaper photo caption that can be used for retrieving the picture and for identifying the people shown. A multistage system, called Piction, uses spatial and characteristic constraints derived from the caption in labeling face candidates generated by a face locator. Several other vision systems employ the idea of top-down control in picture understanding by providing the general context; this system carries the notion one step further, exploiting not only general context but also picture-specific context. The author gives several examples showing how information from both text and images can be used in computing the similarity between a given query and an image in the database to satisfy focus-of-attention queries. Although Piction represents only a preliminary foray into truly integrated text/image content-based retrieval, it shows that additional discriminatory capabilities can be obtained by combining the two sources of information. Much work remains, however, both in improving the language processing capabilities and in face location and characterization.
Observability analysis of embedded software for coverage-directed validation
Authors: José C. Costa, Srinivas Devadas, José C. Monteiro
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

The most common approach to checking correctness of a hardware or software design is to verify that a description of the design has the proper behavior as elicited by a series of input stimuli. In the case of software, the program is simply run with the appropriate inputs, and in the case of hardware, its description written in a hardware description language (HDL) is simulated with the appropriate input vectors. In coverage-directed validation, coverage metrics are defined that quantitatively measure the degree of verification coverage of the design.Motivated by recent work on observability-based coverage metrics for models described in a hardware description language, we develop a method that computes an observability-based code coverage metric for embedded software written in a high-level programming language. Given a set of input vectors, our metric indicates the instructions that had no effect on the output. An assignment that was not relevant to generate the output value cannot be considered as being covered. Results show that our method offers a significantly more accurate assessment of design verification coverage than statement coverage. Existing coverage methods for hardware can be used with our method to build a verification methodology for mixed hardware/software or embedded systems.
An Efficient Multiversion Access Structure
Authors: Peter J. Varman, Rakesh M. Verma
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

An efficient multiversion access structure for a transaction-time database is presented. Our method requires optimal storage and query times for several important queries and logarithmic update times. Three version operations¿inserts, updates, and deletes¿are allowed on the current database, while queries are allowed on any version, present or past. The following query operations are performed in optimal query time: key range search, key history search, and time range view. The key-range query retrieves all records having keys in a specified key range at a specified time; the key history query retrieves all records with a given key in a specified time range; and the time range view query retrieves all records that were current during a specified time interval. Special cases of these queries include the key search query, which retrieves a particular version of a record, and the snapshot query which reconstructs the database at some past time. To the best of our knowledge no previous multiversion access structure simultaneously supports all these query and version operations within these time and space bounds. The bounds on query operations are worst case per operation, while those for storage space and version operations are (worst-case) amortized over a sequence of version operations. Simulation results show that good storage utilization and query performance is obtained.
Techniques for Increasing the Stream Capacity of A High-Performance Multimedia Server
Authors: Divyesh Jadav, Alok N. Choudhary, P. Bruce Berra
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization and, thus, minimize cost, it is essential that the load be balanced among each of the server's components viz., the disks, the interconnection network, and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment¿round-robin (RR), minimum link allocation (MLA), minimum contention allocation (MCA), weighted minimum link allocation (WMLA), and weighted minimum contention allocation (WMCA)¿are developed. The performance of these policies on a server model developed earlier is presented. We also consider the issue of file replication, and develop two schemes for storing the replicas, the Parent Group Based Round-Robin Placement (PGBRRP) scheme, and the Group Wide Round-Robin Placement (GWRRP) scheme. The performance of the request assignment policies in the presence of file replication is presented.
Real-Time Hierarchical Control
Authors: Magnus Morin, Simin Nadjm-Tehrani, Per Österling, Erik Sandewall
Venue: IEEE Software (1992)

A framework for developing hierarchical control systems consisting of layers that group transformation types, the tools to help implement the layers and validate timing properties, and the mechanisms for communicating among layers is discussed. The layered framework supports the design and implementation of control systems with both continuous and discrete components, and is suitable for integrating symbolic and numeric computations in a range of applications. Two applications of the framework-an elevator control system and driver support system-are described.
Reconfigurable Accelerators for Combinatorial Problems
Authors: Marco Platzner
Venue: Computer (2000)

Reconfigurable accelerators can improve process time on combinatorial problems with fine-grained parallelism. Such problems contain a huge number of logical operations (NOT, AND, and OR) that can evaluate simultaneously, a characteristic that varies considerably from problem to problem. Because of this variability, such combinatorial problems are approached using instance-specific reconfiguration--hardware tailored to a specific algorithm and a specific set of input data.Boolean satisfiability (SAT for short) is a common combinatorial problem that exhibits fine-grained parallelism. SAT varies considerably based on the situation. Its solution is thus an ideal candidate for improvements based on instance-specific reconfiguration. In fact, simulations of an instance-specific accelerator show potential speed-ups by a factor of up to 140,000 in execution time over the solution by a software solver. The authors detail the results of their prototype that leads to an order of magnitude speedup in the execution of difficult satisfiability problems.
Congruence classes in M3 (Fq) (q even)
Authors: B. Corbas, G. D. Williams
Venue: Discrete Mathematics (2002)

In dimensions 2 and 3, the sizes of the congruence classes of matrices over a finite field of characteristic 2 are determined. This complements the authors' earlier solution of the corresponding problem in odd characteristic.
Informative art: information visualization in everyday environments
Authors: Lars Erik Holmquist, Tobias Skog
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Thanks to advances in display technologies, it will soon be possible to have electronic information displays virtually everywhere. We have developed the concept of Informative Art as a way to integrate information visualization in the everyday human environment. Informative Art combines a dynamically updated information display with the decorative role of visual art, such as posters and paintings. We present four examples of Informative Art, where we borrowed the styles of various modern artists to show different kinds of information. For instance, a composition similar to the style of an abstract painter, Piet Mondriaan, showed the current weather in six different cities, while a piece of "landscape art" in the style of Richard Long gave a view of the last 30 days of global earthquake activity. We discuss how designing information visualizations for everyday environment introduces requirement that are different from those of graphical user interfaces for desktop computers.
The Future of 3D Video
Authors: Mark Ollis, Todd Williamson
Venue: Computer (2001)

The latest developments in 3D video promise to advance the medium from a passive experience to a fully interactive one.
Design of Algorithm-Based Fault-Tolerant Multiprocessor Systems for Concurrent Error Detection and Fault Diagnosis
Authors: V. Vinnakota, N. K. Jha
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Algorithm-based fault tolerance (ABPT) is a low-overhead system-level concurrent errordetection and fault location scheme for multiprocessor systems. We present new methodsfor the design of ABFT systems. Our design procedure is applicable to a wide range ofsystems in which processors share data elements. A feature of our design approach isthat the type of checks to be used in the final system can be controlled by the systemdesigner. We also present some new bounds on the number of checks needed in ABFTsystem design.
Automating Knowledge Acquisition: A Propositional Approach to Representing Expertise as an Alternative to Repertory Grid Technique
Authors: Derek Batty, Mohamed S. Kamel
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Repertory grid technique plays a central role in the elicitation methodology of many well-reported knowledge acquisition tools or workbenches. However, the dependability of these systems is low where the technique breaks down or proves inadequate due to limited expressive power and other problems. This paper introduces an alternate approach based on Personal Construct Theory that elicits an expert¿s knowledge as a network of terms that constitutes a propositional formalism. An extended example is used to both highlight the difficulties encountered using repertory grids and illustrate how these are overcome using the proposed approach. The results of an empirical study are presented where an experienced clinician compared the knowledge structures that she constructed for a diagnostic task using each elicitation technique. Furthermore, although the network representation is amenable to inductive learning methods for generating production rules, an inference method is demonstrated which reveals the formalism¿s categorical reasoning potential. The authors conclude it is more appropriate to classify such methods as either mediating or immediate rather than the knowledge structures they employ. The paper contributes to a better understanding of constructivist formalisms developed for knowledge acquisition.
Fractional analytic signals
Authors: Adolf Cusmariu
Venue: Signal Processing (2002)

The fractional Hilbert transform (FHT) is a linear combination of a signal and its Hilbert transform, and invites extensions of the classical analytic signal. Mathematical properties of the FHT and three possible versions of fractional analyticity are explored in detail.
Practical Steps Toward Quality Development
Authors: Akira K. Onoma, Tsuneo Yamaura
Venue: IEEE Software (1995)

For decades, hardware capacity and the size of software systems have steadily increased. With such large and complex bodies of code at stake, we believe it is essential to separate software development and quality assurance. Unless you can separate the two, it is difficult to know what software quality is, and thus it is difficult to control it. You cannot manage what you do not know.At Hitachi Software, we organize software projects in a way that retains high-quality software and improves scheduling. We do this by forcing "necessary" conflicts among independent groups within the larger software-development team. We believe that by creating a competitive atmosphere between the design and quality-assurance departments, engineers on both teams are motivated to be quality sensitive.From 1979 to 1992, software productivity at Hitachi Software rose 3.2 times, proof that reducing field failures can also increase productivity. In this article, we describe our software-development process and provide further advice for implementing sound quality-assurance into your own development cycles.
Sums of minima and maxima
Authors: Zhi-Wei Sun
Venue: Discrete Mathematics (2002)

Let h1, ...,hn be positive integers. We study new sums m(h1,...,hn = Σr1=0h1-1 ... Σrn=0hn-1 min {r1h1,..., rnhn} and M(h1,...,hn = Σr1=0h1-1 ... Σrn=0hn-1 max {r1h1,..., rnhn}, the first of which times h1 ... hn is the number of lattice points in a pyramid of dimension n + 1. We show that m(h1,...,hn)(h1 - 1)...(hn - 1) = 1 + Σ0 ≠ I ⊆ {1,...,n} (-1)|I| m({hi}i∈I)Πi∈I (hi - 1) if h1,...,hn > 1, and that M(h1,...,hn) - h1 ... hn + 1(h1 + 1)...(hn + 1) = Σ0≠I⊆{1,...,n} (-1)|I| M({hi}i∈I)Πi∈I (hi + 1). The sums m(h1, h2) and M(h1, h2) are connected with the reciprocity law for Dedekind sums. The values of m(h1, h2, h3, M(h1, h2, h3) and m(h1, h2, h3 h4) + M(h1, h2, h3 h4) are determined explicity in the paper.