ppxscal/embedding_network huggingface dataset:
Guest Editor's Introduction: Systems on a Chip--The Next Electronic Frontier
Authors: Luciano Lavagno
Venue: IEEE Micro (2002)

Moore's law keeps providing electronic designers with ever-growing computational power. The list of applications enabled by this phenomenal and unprecedented explosion in human capabilities is continuously expanding. The combination of these two factors, together with the associated economic effects of increasing nonrecurrent engineering costs and decreasing chip costs, is shaping the landscape of electronics. Problems that in the past were either too expensive to solve in silicon or required a whole electronic board can now be tackled with a single chip, one that might have tens of millions of logic gates and could include both analog and digital parts.
The Role of Polymorphic Reuse Mechanisms in Schema Evolution in an Object-Oriented Database
Authors: Ling Liu, Roberto Zicari, Walter Hürsch, Karl J. Lieberherr
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

A seamless approach to the incremental design and reuse of object-oriented methods and query specifications is presented. We argue for avoiding or minimizing the effort required for manually reprogramming methods and queries due to schema modifications, and demonstrate how the role of polymorphic reuse mechanisms is exploited for enhancing the adaptiveness of database programs against schema evolution in an object-oriented database. The salient features of our approach are the use of propagation patterns and a mechanism for propagation pattern refinement. Propagation patterns are employed as an interesting specification formalism for modeling operational requirements. They encourage the reuse of operational specifications against the structural modification of an object-oriented schema. Propagation pattern refinement is suited for the specification of reusable operational modules. It promotes the reusability of propagation patterns toward the operational requirement changes. This approach has a formal basis and emphasizes structural derivation of specifications. The main innovations are in raising the level of abstraction for behavioral schema design, and for making possible the derivation of operational semantics from structural specifications. As a result, both the modularity and reusability of object-oriented schemas are increased.
What can a web bag discover for you?
Authors: Sourav S. Bhowmick, Sanjay Madria, Wee Keong Ng
Venue: Data Knowledge Engineering (2002)

Sets and bags are closely related structures. A bag is different from a set in that it is sensitive to the number of times an element occurs while a set is not. In this paper, we introduce the concept of web bag in the context of the web warehouse project called WHOWEDA (Warehouse of Web Data). Informally, a web bag is a web table which allows multiple occurrences of identical web tuples. We have used web bag to discover useful knowledge from a web table such as visible documents (or web sites), luminous documents and luminous paths. In this paper, we formally discuss the semantics and properties of web bags. We design formal algorithms for the construction of a web bag and its schema. In addition, we also provide formal algorithms for various types of knowledge discovery in a web warehouse using web bag and illustrate them with examples.
Tracking of Tubular Molecules for Scientific Applications
Authors: B. a. Parvin, C. Peng, W. Johnston, F. m. Maestre
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper, we present a system for detection and tracking of tubular molecules in images. The automatic detection and characterization of the shape, location, and motion of these molecules can enable new laboratory protocols in several scientific disciplines. The uniqueness of the proposed system is twofold: At the macro level, the novelty of the system lies in the integration of object localization and tracking using geometric properties; at the micro level, in the use of high and low level constraints to model the detection and tracking subsystem. The underlying philosophy for object detection is to extract perceptually significant features from the pixel level image, and then use these high level cues to refine the precise boundaries. In the case of tubular molecules, the perceptually significant features are antiparallel line segments or, equivalently, their axis of symmetries. The axis of symmetry infers a coarse description of the object in terms of a bounding polygon. The polygon then provides the necessary boundary condition for the refinement process, which is based on dynamic programming. For tracking the object in a time sequence of images, the refined contour is then projected onto each consecutive frame.
A parallel formulation of interior point algorithms
Authors: George Karypis, Anshul Gupta, Vipin Kumar
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

In this paper we describe a scalable parallel formulation of interior point algorithms. Through our implementation on a 256-processor nCUBE 2 parallel computer, we show that our parallel formulation utilizes hundreds of processors efficiently and delivers much higher performance and speedups than reported earlier. These speedups are a result of our highly efficient parallel algorithm for solving a linear symmetric positive definite system using Cholesky factorization. We also evaluate a number of ordering algorithms for sparse matrix factorization in terms of their suitability for parallel Cholesky factorization.
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
Authors: Lionel M. Ni, Stephen W. Turner, Betty H. C. Cheng
Venue: IEEE Transactions on Computers (1995)

Traditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper presents a 2D-mesh cluster allocation strategy for hypercubes. The proposed auxiliary free list processor allocation strategy can efficiently allocate 2D-mesh clusters without size constraints, can reduce average job turnaround time compared with that based on subcube allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlock-free E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.
Using a Computer Game to Develop Advanced AI
Authors: John E. Laird
Venue: Computer (2001)

In computer games, designers can use artificial intelligence to control individual characters, provide strategic direction to character groups, dynamically change parameters to make the game appropriately challenging, or produce play-by-play commentary. Computer games offer an inexpensive, reliable, and surprisingly accessible environment for conducting research in human-level AI design, often--as in the case of Quake II--with built-in AI interfaces. The author's work with the game's Quakebot demonstrated that researchers can successfully pursue serious study of autonomous AI agents within the context of computer games. This research directly applies to computer-generated forces, which require modeling realistic, entity-level behavior. Studying the impact of changes in reaction time, tactics level, and perceptual and motor skills on over-all Quake II game performance helped to model these behaviors. From its scoring method, which rewards the highest number of kills, it's obvious that Quake II epitomizes violent computer games. The author does not, however, believe that the future of AI in games lies in creating ever more realistic arenas for violence. Thus, he is pursuing further research within the context of creating computer games that emphasize the drama that arises from social interactions between humans and computer characters.
Comparison of inter-area rekeying algorithms for secure wireless group communications
Authors: Chun Zhang, Brian DeCleene, Jim Kurose, Don Towsley
Venue: Performance Evaluation (2002)

Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a member joins or leaves the group's session. Hierarchical approaches have recently been proposed to manage the distribution of the data encryption key in a scalable manner for fixed (non-mobile) networks. In this paper, we characterize the impact of mobility on secure rekeying of group communication in a hierarchical key-distribution framework. We propose several rekeying algorithms that preserve confidentiality as members move within the hierarchy. The algorithms differ in the locality of communication, the amount of messages needed to rekey the data key/key-encryption key, the key-encryption key rekey rate, and the number of key-encryption keys held by group members. We develop Markov models to quantify the performance of the proposed algorithms. Our results shows that the FEDRP and SR inter-area rekeying algorithms are superior under different circumstances. In the situation of lower arrival rate and higher mobility, SR has the lowest intra-AS message rate, rekey rate and a low inter-AS message rate. On the other hand, with higher arrival rate and lower mobility, FEDRP has a low rekey rate, inter-AS message rate and the lowest intra-AS message rate. This is achieved by allowing members to hold a small number of keys. In a wireless environment, where bandwidth is often a limiting resource, minimization of communication overhead is of critical importance. This goal could be achieved by using a dynamic strategy to combine the benefits of FEDRP and SR algorithms.
Knowledge Representation in Fuzzy Logic
Authors: L. A. Zadeh
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The author presents a summary of the basic concepts and techniques underlying the application of fuzzy logic to knowledge representation. He then describes a number of examples relating to its use as a computational system for dealing with uncertainty and imprecision in the context of knowledge, meaning, and inference. It is noted that one of the basic aims of fuzzy logic is to provide a computational framework for knowledge representation and inference in an environment of uncertainty and imprecision. In such environments, fuzzy logic is effective when the solutions need not be precise and/or it is acceptable for a conclusion to have a dispositional rather than categorical validity. The importance of fuzzy logic derives from the fact that there are many real-world applications which fit these conditions, especially in the realm of knowledge-based systems for decision-making and control.
A lightwave 3D plug-in for modeling long hair on virtual humans
Authors: Deborah Patrick, Shaun Bangay
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

Multimedia applications today make use of virtual humans. Generating realistic virtual humans is a challenging problem owing to a number of factors, one being the simulation of realistic hair. The difficulty in simulating hair is due to the physical properties of hair. The average human head holds thousands of hairs, with the width of each hair often smaller than the size of a pixel. There are also complex lighting effects that occur within hair. This paper presents a LightWave 3D plug-in for modeling thousands of individual hairs on virtual humans. The plug-in allows the user to specify the length, thickness and distribution of the hair, as well as the number of segments a hair is made up of. The plug-in is able to add hairs to a head model, which the user then modifies to define a hairstyle. The hairs are then multiplied by the plug-in to produce many hairs. By providing a plug-in that does most of the work and produces realistic results, the user is able to produce a hairstyle without modeling each individual strand of hair. This greatly reduces the time spent on hair modeling, and makes the possibility of adding realistic long hair to virtual humans reasonable.
A Multichip Module Design Process for Notebook Computers
Authors: Paul D. Franzon, Robert J. Evans
Venue: Computer (1993)

A packaging system design process for multichip modules (MCMs) is presented. The performance factors, cost factors, alternative packaging technologies, and packaging alternatives for daughter cards are discussed. The process is illustrated by applying to the design of a 80386SL chip that contains a 32-b integer central processing unit (CPU), memory management, bus control, and buffering, and a 82360SL companion chip that contains control functions for the system, I/O, peripherals, power management, and a majority of the glue logic required by the system.
On the equivalence and range of applicability of graph-based representations of logic programs
Authors: Stefania Costantini, Ottavio D'Antona, Alessandro Provetti
Venue: Information Processing Letters (2002)

Logic programs under Answer Sets semantics can be studied, and actual computation can be carried out, by means of representing them by directed graphs. Several reductions of logic programs to directed graphs are now available. We compare our proposed representation, called Extended Dependency Graph, to the Block Graph representation recently defined by Linke [Proc. IJCAI-2001, 2001, pp. 641-648]. On the relevant fragment of well-founded irreducible programs, extended dependency and block graph turns out to be isomorphic. So, we argue that graph representation of general logic programs should be abandoned in favor of graph representation of well-founded irreducible programs, which are more concise, more uniform in structure while being equally expressive.
Instruction Window Size Trade-Offs and Characterization of Program Parallelism
Authors: P. K. Dubey, G. B. Adams,  III, M. J. Flynn
Venue: IEEE Transactions on Computers (1994)

Detecting independent operations is a prime objective for computers that are capable of issuing and executing multiple operations simultaneously. The number of instructions that are simultaneously examined for detecting those that are independent is the scope of concurrency detection. The authors present an analytical model for predicting the performance impact of varying the scope of concurrency detection as a function of available resources, such as number of pipelines in a superscalar architecture. The model developed can show where a performance bottleneck might be: insufficient resources to exploit discovered parallelism, insufficient instruction stream parallelism, or insufficient scope of concurrency detection. The cost associated with speculative execution is examined via a set of probability distributions that characterize the inherent parallelism in the instruction stream. These results were derived using traces from a Multiflow TRACE SCHEDULING compacting FORTRAN 77 and C compilers. The experiments provide misprediction delay estimates for 11 common application-level benchmarks under scope constraints, assuming speculative, out-of-order execution and run time scheduling. The throughput prediction of the analytical model is shown to be close to the measured static throughput of the compiler output.
A Parallel Algorithm for Constructing a Labeled Tree
Authors: Yue-Li Wang, Hon-Chan Chen, Wei-Kai Liu
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

A tree T is labeled when the n vertices are distinguished from one another by names such as $v_1, v_2 \cdots, v_n.$ Two labeled trees are considered to be distinct if they have different vertex labels even though they might be isomorphic. According to Cayley's tree formula, there are nn¿2 labeled trees on n vertices. Prüfer used a simple way to prove this formula and demonstrated that there exists a mapping between a labeled tree and a number sequence. From his proof, we can find a naive sequential algorithm which transfers a labeled tree to a number sequence and vice versa. However, it is hard to parallelize. In this paper, we shall propose an O(log n) time parallel algorithm for constructing a labeled tree by using O(n) processors and O(n log n) space on the EREW PRAM computational model.
Computer Science Research in Mexico
Authors: Vladimir Estivill-Castro
Venue: Computer (1995)

With the enactment of the North American Free Trade Agreement (NAFTA), Mexico has increased opportunities to compete in the global economy. A month after NAFTA was enacted in January 1994, the National Science Foundation of the US and the National Council for Science and Technology of Mexico met to discuss ways for computer and information science and engineering (CISE) researchers to collaborate in their R&D efforts. In October 1994, these two agencies announced a collaborative program. This can ignite CISE research in Mexico. However, the author points out that scientists, industry, and universities must do their part. The author proposes a series of paths to successful implementation. First, public policy must give higher priority to CISE research, where improvements have already occurred. Federal expenditures for R&D have increased significantly over the last three years. However, Mexico's citizens must invest more as well. Specifically, the private sector must provide a higher percent of the financing for the nation's CISE R&D. Universities and research centers must also improve. CISE PhDs are concentrated in one public and five private centers. This concentration may have its advantages, but the focus should be to enhance R&D output, not to attract industry contracts or student applications. Finally, the author advises the research community to adopt a serious commitment to research and collaborate with other researchers in the face of great obstacles. The author also discusses how other less-developed countries, such as Chile, have oriented their resources to achieve impressive results.
A new technique for the characterization of graphs with a maximum number of spanning trees
Authors: L. Petingi, J. Rodriguez
Venue: Discrete Mathematics (2002)

Let Γ(n,e) denote the class of all simple graphs on n nodes and e edges. The number of spanning trees of a graph G is denoted by t(G). A graph G0 ∈ Γ(n,e) is said to be t-optimal if t(G0) ≥ t(G) for all G ∈ Γ(n,e). The problem of characterizing t-optimal graphs for arbitrary n and e is still open, although characterizations of t-optimal graphs for specific pairs (n,e) are known. We introduce a new technique for the characterization of t-optimal graphs, based on an upper bound for the number of spanning trees of a graph G in terms of the degree sequence and the number of induced paths of length two of the complement of G. The technique yields the following new results: (1) Complete, almost-regular multipartite graphs are t-optimal. (2) A complete characterization of t-optimal graphs in Γ(n,e) for n(n - 1)/2 - 3n/2 ≤ e ≤ n(n - 1)/2- n is obtained for n ≥ n0, where n0 can be explicitly determined.
Achieving Supercomputer Performance for Neural Net Simulation with an Array of Digital Signal Processors
Authors: Urs A. Muller, Bernhard Baumle, Peter Kohler, Anton Gunzinger, Walter Guggenbuhl
Venue: IEEE Micro (1992)

Music, a digital signal processor (DSP)-based system with a parallel distributed-memory architecture that provides enormous computing power yet retains the flexibility of a general-purpose computer, is discussed. It is shown that Music reaches a peak performance of 2.7 Gflops at a significantly lower cost, power consumption, and space requirement than conventional supercomputers. The Music system hardware, programming, and backpropagation implementation are described.
Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors
Authors: H. Park, R. T. Chin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A morphological operation using a large structuring element can be decomposed equivalently into a sequence of recursive operations, each using a smaller structuring element. However, an optimal decomposition of arbitrarily shaped structuring elements is yet to be found. In this paper, we have derived an optimal decomposition of a specific class of structuring elements/spl mdash/convex sets/spl mdash/for a specific type of machine/spl mdash/4-connected parallel array processors. The cost of morphological operation on 4-connected parallel array processors is the total number of 4-connected shifts required by the set of structuring elements. First, the original structuring element is decomposed into a set of prime factors, and then their locations are determined while minimizing the cost function. Proofs are presented to show the optimality of the decomposition. Examples of optimal decomposition are given and compared to an existing decomposition reported by Xu (1991).
Specification, Mapping and Control for QoS Adaptation
Authors: Cristian Koliver, Klara Nahrstedt, Jean-Marie Farines, Joni Da Silva Fraga, Sandra Aparecida Sandri
Venue: Real-Time Systems (2002)

In this paper we describe a fuzzy-control approach for quality of service (QoS) adaptation, needed in distributed multimedia applications. QoS adaptation is necessary (a) due to sudden variations in network resource availability, especially in the case of Internet, and (b) due to multiple applications requiring shared resource such as bandwidth. To solve the problem of QoS adaptation, several sub-problems need to be considered: (1) mapping of user perception and different combinations of application QoS values onto a uniform quality metric, (2) estimation, control and adjustment of application QoS parameters in case of network and other resource congestion, and (3) enforcement algorithm which reacts according to adapted QoS parameters. Our approach is to solve the QoS adaptation using the integration of (a) quality degree function, which maps the application QoS parameters into a metric, called quality degree, (b) fuzzy controller, which controls, estimates and adjusts the application QoS parameters according to resource availability, and (c) filter algorithms, which are the services to enforce the adapted QoS parameters. The quality degree function associates quality degree as the quality measure with different combinations of application QoS values. This function is influenced by the user&rsquo;s perception of quality. The fuzzy control takes the results of the quality degree function, estimates the new quality degree and its corresponding quality level, predicts the new application QoS parameters, and adjusts them. The results of the adapted QoS parameters are then used by the filter algorithms to enforce the changes, proposed by the fuzzy controller, by allocating bandwidth to the application according to its QoS parameter values. We have implemented and applied the quality degree function, the fuzzy controller, and the filter algorithms to the video distribution system (VDS). The results of VDS over the local area network show that (1) the target system improves user perceived QoS at the receivers, and (2) the bandwidth utilization increases significantly when using our fuzzy-control approach for QoS adaptation.