ppxscal/embedding_network huggingface dataset:
A Fast Digital Fuzzy Processor
Authors: Alessandro Gabrielli, Enzo Gandolfi
Venue: IEEE Micro (1999)

This article presents a fast digital Fuzzy Processor that has already been designed and realized in 0.7-(m digital CMOS technology obtained by European Silicon Structure (ES2) silicon foundry. It processes four 7-bit input variables and carries out one 7-bit output one. It may be synchronized up to a 50-MHz clock signal for an estimated power consumption of nearly 1300 mW. Moreover the rate of this chip varies from 80 ns to 320 ns depending on the number of input variables. The innovative idea is the no-time consuming methodology for selecting the fuzzy active rules. This is done by a parallel-pipeline architecture described in details. In the paper are summarized the Fuzzy Processor future implementations for High Energy Physics Experiments (HEPE). In addition, the architecture is explained with layout and data flow simulation pictures. Moreover the fuzzy logic methodologies which have been adopted are justified in terms of hardware implementation feasibility and speed requirements.
The Future of Systems Research
Authors: John Hennessy
Venue: Computer (1999)

After 20 years in academia and the Silicon Valley, the new Provost of Stanford University calls for a shift in focus for systems research. Performance-- long the centerpiece--needs to share the spotlight with availability, maintainability, and other qualities. Although performance increases over the past 15 years have been truly amazing, it will be hard to continue these trends by sticking to the basically evolutionary path that the research community is currently on. The author advocates a more evolutionary approach to systems problems and thinks the approach needs to be more integrated. Researchers need to think about hardware and software as a continuum, not as separate parts. He sees society on the threshold of a "Post PC" era, in which computing is ubiquitous, and everyone will use information services and everyday utilities. When everyone starts using these systems, guess what? They expect them to work and to be easy to use. So this era will drive system design toward greater availability, maintainability, and scalability, which will require a real refocusing of current research directions.
Improved Lower Bounds on the Reliability of Hypercube Architectures
Authors: S. Soh, S. Rai, J. L. Trahan
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

The hypercube topology, also known as the Boolean n-cube, has recently been used for multiprocessing systems. The paper considers two structural-reliability models, namely, terminal reliability (TR) and network reliability (NR), for the hypercube. Terminal (network) reliability is defined as the probability that there exists a working path connecting two (all) nodes. There are no known polynomial time algorithms for exact computation of TR or NR for the hypercube. Thus, lower-bound computation is a better alternative, because it is more efficient computationally, and the system will be at least as reliable as the bound. The paper presents algorithms to compute lower bounds on TR and NR for the hypercube considering node and/or link failures. These algorithms provide tighter bounds for both TR and NR than known results and run in time polynomial in the cube dimension n, specifically, within time O(n/sup 2/).
Archictecture and Performance of Java-Based DistributedObject Models: CORBA vs RMI
Authors: Cesar Munoz, Janusz Zalewski
Venue: Real-Time Systems (2001)

This paper presents a comprehensive comparison of the architectural differences and similarities of the two most popular Java-based distributed object models: RMI and CORBA. Performance and timing issues related to the CORBA and RMI architectures are also considered. The following aspects are studied for client server applications, on Sun UltraSparcs under Solaris 2.5.1 and Pentium II under Windows NT 4.0: response time for method invocation without parameters as well as with variable number of parameters; response time for applet clients, and response time for variable number of clients requesting the same service. The goal is to provide a reference framework that supports the selection of either mechanism for the development of web-based distributed real-time applications: chat programs, interactive games, shared boards, etc.
Performance Analysis of Parallel Query Processing Algorithms for Object-Oriented Databases
Authors: Stanley Y. W. Su, Sanjay Ranka, Xiang He
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

In recent years, parallel processing and optimization algorithms for processing object-oriented databases have drawn a considerable amount of attention from the database research community. Two general types of algorithms have been introduced: hybrid-hash pointer-based algorithms and multiwavefront algorithms. In this work, we quantitatively analyze the two algorithms and develop analytical formulas to capture the main performance features of these two approaches. We study their performance in three application environments: One is characterized by large databases having many object classes, each of which contains a large number of instances; the second one is characterized by large databases having many object classes, each of which contains a relatively small number of instances; and the third one is by large databases having object classes of varying sizes. A horizontal data partitioning strategy, in which each object class is partitioned into horizontal segments stored across all processors, is used in the first environment. A class-per-node assignment strategy, in which instances of each object class are stored in a single processor, is used in the second environment. In the third environment, object classes are partitioned horizontally and assigned to a varying number of processors depending on their different sizes. Our analytical results show that the multiwavefront algorithm has three distinguishing features which contribute to its better performance: 1) two-phase processing strategy, 2) vertical partitioning of horizontal segments, and 3) dynamic determination of ¿collision point¿ in multiwavefront propagations which results in an optimized query execution plan. We show that if these features are adopted by a hybrid-hash, pointer-based algorithm, its performance will be comparable with that of the multiwavefront algorithm because the difference in CPU time between them is negligible. The assumed computing environment is a network of workstations having a share-nothing architecture. The schema and some queries selected from the OO7 benchmark are used in the performance analyses and comparisons. The queries are modified slightly in different data environments in order to reflect the features of diverse database applications.
On Using Tabu Search for Design Automation of VLSI Systems
Authors: John M. Emmert, Sandeep Lodha, Dinesh K. Bhatia
Venue: Journal of Heuristics (2003)

Tabu search is a meta-heuristic problem solving technique that, when applied carefully, provides near optimal solutions in a very short time. In this paper, we have described the use of tabu search for solving problems related to very large scale integrated (VLSI) circuit design automation. Specifically, we have demonstrated the use for VLSI circuit partitioning and placement. We present a tabu search based circuit bi-partitioning technique that partitions circuits with the goal of minimizing the size of the cutset between the partitions. Then, we use tabu search techniques along with force directed placement techniques to accomplish the physical placement of VLSI circuits on regular two-dimensional arrays with the goal of minimizing the placement time. We use empirical data from partitioning and placement of benchmark circuits to test our techniques. Our methods show improvement when compared to partitioning techniques from the literature and commercially available placement tools. Relative to the literature, our tabu search bi-partitioning technique improves on the best known minimum cuts for several benchmark circuits. Relative to commercially available computer aided design tools, our tabu search based placement approach shows dramatic (20&times;) speedup in execution time without negative impact on the quality of the solution.
Automating Relational Operations on Data Structures
Authors: Donald Cohen, Neil Campbell
Venue: IEEE Software (1993)

An approach to having compilers do most of the implementation detail work in programming that divides a program into two parts is described. The specification part describes what the program should do, but in a way that avoids commitment to implementation details. The annotation part provides implementation instructions that the compiler will carry out. Annotations affect execution efficiency, but not functional behavior. They are very high level and usually very short and hence encourage experimentation. To try out different implementation choices, the programmer simply changes the annotations and recompiles. The implementation details related to data representations are discussed. The testing of compilers that produce Lisp code for iteration, and for adding and deleting tuples of composite relations, is reviewed.
A high-order-accurate unstructured mesh finite-volume scheme for the advection-diffusion equation
Authors: Carl Ollivier-Gooch, Michael Van Altena
Venue: Journal of Computational Physics (2002)

High-order-accurate methods for viscous flow problems have the potential to reduce the computational effort required for a given level of solution accuracy. The state of the art in this area is more advanced for structured mesh methods and finite-element methods than for unstructured mesh finite-volume methods. In this paper, we present and analyze a new approach for high-order-accurate finite-volume discretization for diffusive fluxes that is based on the gradients computed during solution reconstruction. Our analysis results show that our schemes based on linear and cubic reconstruction can be reasonably expected to achieve second- and fourth-order accuracy in practice, respectively, while schemes based on quadratic reconstruction are expected to be only second-order accurate in practice. Numerical experiments show that in fact nominal accuracy is attained in all cases for two advection-diffusion problems, provided that curved boundaries are properly represented. To enforce boundary conditions on curved boundaries, we introduce a technique for constraining the least-squares reconstruction in boundary control volumes. Simply put, we require that the reconstructed solution satisfy the boundary condition exactly at all boundary flux integration points. Numerical experiments demonstrate the success of this approach, both in the reconstruction results and in simulation results.
Extending Telecommunications Systems: The Feature-Interaction Problem
Authors: Nancy D. Griffeth, Yow-Jian Lin
Venue: Computer (1993)

A number of characteristics distinguish telecommunications systems from other computer systems. The authors first describe the overall function of telecommunications and then detail the more difficult characteristics that contribute to the feature-interaction problem. Many features are simple, and detecting interactions between a particular pair of them can be easy. The problem becomes difficult when rapid addition of many new features must be expedited. To determine what issues to address, the stages of adding a new feature are examined.
A subspace-based online calibration algorithm for an asynchronous CDMA-based antenna array
Authors: Chong Hyun Lee, Joohwan Chun
Venue: Signal Processing (2002)

A new iterative calibration algorithm is presented for an asynchronous CDMA-based antenna array in the presence of unknown gain and phase errors. The algorithm is applicable to a non-linear array where the number of signals could be greater than the number of antennas. It does not require a prior knowledge of the direction of arrivals (DOAs) of the signals of any user but requires the code sequence of a reference user. The proposed algorithm provides us with estimates of the DOAs, the multi-path impulse response of the reference signal source, and the calibration of the antenna gain and phase, even under a multiple access interference. We verify the algorithm by using synthetic data as well as field data measured through a custom-built W-CDMA test bed.
Multimedia Storage Servers: A Tutorial
Authors: D. James Gemmell, Harrick M. Vin, Dilip D. Kandlur, P. Venkat Rangan, Lawrence A. Rowe
Venue: Computer (1995)

Multimedia storage servers provide access to multimedia objects including text, images, audio, and video. The design of such servers fundamentally differs from conventional servers due to: (1) the real-time storage and retrieval requirements, as well as (2) the large storage space and data transfer rate requirements of digital multimedia. In this paper, we present an overview of the architectures and algorithms required for designing digital multimedia storage servers.
Formalizing Specification Modeling in OOA
Authors: Shinichi Honiden, Nobuto Kotaka, Yoshinori Kishimoto
Venue: IEEE Software (1993)

It is argued that object-oriented analysis is not a fully mature upstream-development method because its specification process is a complex round-trip method that has not been described in detail. The round-trip OOA model involves data and activities that are intricately dependent on each other. If an analyst tries to use OOA to model specification sequentially, backward control flows will occur. An OOA specification process is presented that is decomposed into steps, substeps, and activities, that clarifies the dataflow between each step, substep, and activity. paying close attention to the chains of data dependence to expose activities and their relations, and that defines OOA control flows, in an effort to minimize process retrogression. The specification process is applied to a definite specification example and to formalization and visualization of an OOA.
The Future: Plug and Pray?
Authors: Colin Maunder
Venue: IEEE Design Test (1998)

The relationship between man and electronic machine has changed significantly over the past 20 years. Gone, for example, are the days when computers, fax machines, mobile phones, and other electronic devices merely enhanced working lives. Today, our jobs are dependent on them - when they stop work, so do we.Looking forward into the next millennium, it is clear our dependence on electronics will grow. At work, we will be dependent on computer-based libraries and services distributed around the world. At home, we will expect to use computer networks as routinely and reliably as the TV and the telephone, for activities spanning shopping, education, and entertainment. And, like our cars today, efficient operation of our future homes may well depend on an array of networked electronic systems that adjust for changes in the weather and our living patterns.So, how will this increasing dependence on electronic systems impact the way we design and test such products?Based on a keynote at the 1997 International Test Conference, this article will look at some ways that society's relationship with, and expectations of, electronics might change, consider how test engineers might respond, and pose some challenges for the test engineering community in the next 20 years.
Incremental Recomputation of Active Relational Expressions
Authors: X. Qian, Gio Wiederhold
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Database updates are small and incremental compared to database contents. It is therefore desirable that recomputations of active relational expressions-such as views, derived data, integrity constraints, active queries, and monitors-can also be performed incrementally. An efficient algorithm for the incremental recomputation of active relational expressions based on finite differencing techniques is presented. Database updates are modeled as incremental changes to database relations, and the algorithm derives, by update propagation, the minimal incremental relational expressions that need recomputation. The algorithm has applications in the maintenance of materialized views and derived data, the checking of integrity constraints, and the evaluation of active queries and monitors.
Forecasting market demand for new telecommunications services: an introduction
Authors: Peter McBurney, Simon Parsons, Jeremy Green
Venue: Telematics and Informatics (2002)

The marketing team of a new telecommunications company is usually tasked with producing forecasts for diverse stakeholders with different needs. Consequently, those outside marketing often realize neither the many reasons for developing forecasts nor the marketing theory used and the challenges involved in doing so. Based on our three decades of experience working with telecommunications operators around the world we seek to redress this situation by presenting a discussion of the issues involved in demand forecasting for new communications services.
Generalization Ability of Folding Networks
Authors: Barbara Hammer
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

The information theoretical learnability of folding networks, a very successful approach capable of dealing with tree structured inputs, is examined. We find bounds on the VC, pseudo-, and fat shattering dimension of folding networks with various activation functions. As a consequence, valid generalization of folding networks can be guaranteed. However, distribution independent bounds on the generalization error cannot exist in principle. We propose two approaches which take the specific distribution into account and allow us to derive explicit bounds on the deviation of the empirical error from the real error of a learning algorithm: The first approach requires the probability of large trees to be limited a priori and the second approach deals with situations where the maximum input height in a concrete learning example is restricted.
Match Propogation for Image-Based Modeling and Rendering
Authors: Maxime Lhuillier, Long Quan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper presents a quasi-dense matching algorithm between images based on the match propagation principle. The algorithm starts from a set of sparse seed matches, then propagates to the neighboring pixels by the best-first strategy, and produces a quasi-dense disparity map. The quasi-dense matching aims at broad modeling and visualization applications which rely heavily on matching information. Our algorithm is robust to initial sparse match outliers due to the best-first strategy. It is efficient in time and space as it is only output sensitive. It handles half-occluded areas because of the simultaneous enforcement of newly introduced discrete 2D gradient disparity limit and the uniqueness constraint. The properties of the algorithm are discussed and empirically demonstrated. The quality of quasi-dense matching are validated through intensive real examples.
Online Fingerprint Template Improvement
Authors: Xudong Jiang, Wee Ser
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This work proposes a technique that improves fingerprint templates by merging and averaging minutiae of multiple fingerprints. The weighted averaging scheme enables the template to change gradually with time in line with changes of the skin and imaging conditions. The recursive nature of the algorithm greatly reduces the storage and computation requirements of this technique. As a result, the proposed template improvement procedure can be performed online during the fingerprint verification process. Extensive experimental studies demonstrate the feasibility of the proposed algorithm.
Information Flow Control in Object-Oriented Systems
Authors: Pierangela Samarati, Elisa Bertino, Alessandro Ciampichetti, Sushil Jajodia
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

In this paper, we describe a high assurance discretionary access control model for object-oriented systems. The model not only ensures protection against Trojan horses leaking information, but provides the flexibility of discretionary access control at the same time. The basic idea of our approach is to check all information flows among objects in the system in order to block possible illegal flows. An illegal flow arises when information is transmitted from one object to another object in violation of the security policy. The interaction modes among objects are taken into account in determining illegal flows. We consider three different interaction modes that are standard interaction modes found in the open distributed processing models. The paper presents formal definitions and proof of correctness of our flow control algorithm.
A CMOS Neural Network for Pattern Association
Authors: Mark Walker, Paul Hasler, Lex Akers
Venue: IEEE Micro (1989)

The authors present an analog complementary metal-oxide semiconductor (CMOS) version of a model for pattern association, along with discussions of design philosophy, electrical results, and a chip architecture for a 512-element, feed-forward IC. They discuss hardware implementations of neural networks and the effect of limited interconnections. They then examine network design, processor-element design, and system operation.
An Abstract Pretty Printer
Authors: Robert D. Cameron
Venue: IEEE Software (1988)

The author has distilled the basic operations of the pretty printer into an abstract pretty printer that uses procedural parameters to perform low-level printing actions. By encapsulating the algorithm in one place, all the pretty-printing utilities will use the same algorithm, and the algorithm itself can be changed easily. The author describes how the abstract pretty printer can be used for basic design, printing to files and screens, setting the cursor, identifying a node, formatting text, and lexical changes.
From Play-In Scenarios to Code: An Achievable Dream
Authors: David Harel
Venue: Computer (2001)

The author describes a scheme for developing complex reactive systems. The scheme makes it possible to go from a user-friendly requirements capture method, called play-in scenarios, via a rich language for describing message sequencing to full behavioral descriptions of system parts, and from there to final implementation. The author's proposal combines ideas that have been known for a long time with more recent ones. Central to the proposal is a cyclic process of verifying the system against requirements and synthesizing system parts from the requirements. The article focuses on the languages, methods, and computerized tools that allow smooth but rigorous transitions between the scheme's various stages. In contrast to database systems, this article concentrates on systems that have a dominant reactive, event-driven facet for which modeling and analyzing behavior is the most crucial and problematic issue.
More on random walks, electrical networks, and the harmonic k-server algorithm
Authors: Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan
Venue: Information Processing Letters (2002)

Techniques from electrical network theory have been used to establish various properties of random walks. We explore this connection further, by showing how the classical formulas for the determinant and cofactors of the admittance matrix, due to Maxwell and Kirchoff, yield upper bounds on the edge stretch factor of the harmonic random walk. For any complete, n-vertex graph with distances assigned to its edges, we show the upper bound of (n - 1)2. If the distance function satisfies the triangle inequality, we give the upper bound of ½n(n - 1). Both bounds are tight. As a consequence, we obtain that the harmonic algorithm for the k server problem is ½k(k + 1)-competitive against the lazy adversary.