ppxscal/embedding_network huggingface dataset:
Applications of boundary element methods on the Intel Paragon
Authors: David E. Womble, David S. Greenberg, Stephen R. Wheat, Robert E. Benner, Marc S. Ingber, Greg Henry, Satya Gutpa
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

This paper describes three applications of the boundary element method and their implementations on the Intel Paragon supercomputer. Each of these applications sustains over 99 Gflops/s based on wall-clock time for the entire application and an actual count of flops executed; one application sustains over 140 Gflops/s! Each application accepts the description of an arbitrary geometry and computes the solution to a problem of commercial and research interest.The common kernel for these applications is a dense equation solver based on LU factorization. It is generally accepted that good performance can be achieved by dense matrix algorithms, but achieving the excellent performance demonstrated here required the development of a variety of special techniques to take full advantage of the power of the Intel Paragon.
Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems
Authors: Debashis Basak, Dhabaleswar K. Panda
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

This paper identifies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to-processor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel flow control schemes to deliver better network performance. This paper indicates that the advantages associated with these schemes cannot be realized with limited consumption capacity. To alleviate such performance bottlenecks, a new network interface design using multiple consumption channels is proposed. To match virtual multiplexing on network channels, we also propose each consumption channel to support multiple virtual consumption channels. The impact of message arrival rate at a node on the required number of consumption channels is studied analytically. It is shown that wormhole networks with higher routing adaptivity, dimensionality, degree of hot-spot traffic, and number of virtual lanes have to take advantage of multiple consumption channels to deliver better performance. The interplay between system topology, routing algorithm, number of virtual lanes, messaging overheads, and communication traffic is studied through simulation to derive the effective number of consumption channels required in a system. Using the ongoing technological trend, it is shown that wormhole-routed systems can use up to two-four consumption channels per node to deliver better system performance.
Using Metrics in Quality Management
Venue: IEEE Software (1990)

No abstract available The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Minimum-buffered routing of non-critical nets for slew rate and reliability control
Authors: Charles Alpert, Andrew B. Kahng, Bao Liu, Ion Măndoiu, Alexander Zelikovsky
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal transition edges, and reduce delay uncertainty due to coupling noise. Bounding load capacitance also improves reliability with respect to hot-carrier oxide breakdown and AC self-heating in interconnects, and guarantees bounded input rise/fall times at buffers and sinks.This paper introduces a new minimum-buffer routing problem (MBRP) formulation which requires that the capacitive load of each buffer, and of the source driver, be upper-bounded by a given constant. Our contributions include the following.&bull; We give linear-time algorithms for optimal buffering of a given routing tree with a single (inverting or non-inverting) buffer type.&bull; For simultaneous routing and buffering with a single non-inverting buffer type, we give a factor 2(1 + &epsilon;) approximation algorithm and prove that no algorithm can guarantee a factor smaller than 2 unless P=NP. For the case of a single inverting buffer type, we give a factor 4(1 + &epsilon;) approximation algorithm.&bull; We give local-improvement and clustering based MBRP heuristics with improved practical performance, and present a comprehensive experimental study comparing the runtime/quality tradeoffs of the proposed MBRP heuristics on test cases extracted from recent industrial designs.
A Hybrid Scheme for Processing Data Structures in a Dataflow Environment
Authors: B. Lee, A. R. Hurson, B. Shirazi
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The asynchronous nature of the dataflow model of computation allows the exploitation ofmaximum inherent parallelism in many application programs. However, before the dataflow model of computation can become a viable alternative to the control flow model of computation, one has to find practical solutions to some problems such as efficienthandling of data structures. The paper introduces a new model for handling datastructures in a dataflow environment. The proposed model combines constant timeaccess capabilities of vectors as well as the flexibility inherent in the concept of pointers.This allows a careful balance between copying and sharing to optimize the storage andprocessing overhead incurred during the operations on data structures. The mode) iscompared by simulation to other data structure models proposed in the literature, and theresults are good.
A note on the Cusum quality control chart
Authors: József Túri
Venue: Octogon Mathematical Magazine (2002)

In this work we suggest a method for detecting errors occuring in the manufacturing process, verifying the stability respectively, whose basis is the modification of the simplest CUSUM control charts. This modification enables us to observe the stability of the manufacturing process in a better way. We also compare the old and the new method on the basis of the computer generated data.
Perspectives on errors-in-variables estimation for dynamic systems
Authors: Torsten Söderström, Umberto Soverini, Kaushik Mahata
Venue: Signal Processing (2002)

The paper gives all overview of various methods for identifying dynamic errors-in-variables systems. Several approaches are classified by how the original information in time-series data of the noisy input and output measurements is condensed before further processing. For some methods, such as instrumental variable estimators, the information is condensed into a nonsymmetric covariance matrix as a first step before further processing. In a second class of methods, where a symmetric covariance matrix is used instead, the Frisch scheme and other bias-compensation approaches appear. When dealing with the estimation problem in the frequency domain, a milder data reduction typically takes place by first computing spectral estimators of the noisy input-output data. Finally, it is also possible to apply maximum likelihood and prediction error approaches using the original time-domain data in a direct fashion. This alternative will often require quite high computational complexity but yield good statistical efficiency. The paper is also presenting various properties of parameter estimators for the errors-in-variables problem, and a few conjectures are included, as well as some perspectives and experiences by the authors.
A Fuzzy Partitioning System
Authors: Krishna Rao Valavala, Mahmoud A. Manzoul
Venue: IEEE Micro (1995)

In this paper, a Fuzzy Partitioning System is introduced. It uses fuzzy logic to perform bipartitioning of cells in VLSI circuits. Net and cell indices are generated using fuzzy logic principles. Then a bottom-up clustering algorithm produces the bipartition. The algorithm is tested on ten Benchmark circuits of the ISCAS and the performance of the algorithm is compared with other implementations.
3D-List: A Data Structure for Efficient Video Query Processing
Authors: C. C. Liu, A. L. P. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In this paper, a video query model based on the content of video and iconic indexing is proposed. We extend the notion of two-dimensional strings to three-dimensional strings (3D-Strings) for representing the spatial and temporal relationships among the symbols in both a video and a video query. The problem of video query processing is then transformed into a problem of three-dimensional pattern matching. To efficiently match the 3D-Strings, a data structure, called 3D-List, and its related algorithms are proposed. In this approach, the symbols of a video in the video database are retrieved from the video index and organized as a 3D-List according to the 3D-String of the video query. The related algorithms are then applied on the 3D-List to determine whether this video is an answer to the video query. Based on this approach, we have started a project called Vega. In this project, we have implemented a user friendly interface for specifying video queries, a video index tool for constructing the video index, and a video query processor based on the notion of 3D-List. Some experiments are also performed to show the efficiency and effectiveness of the proposed algorithms.
Some Characterizations of Functions Computable in On-Line Arithmetic
Authors: J. -M. Muller
Venue: IEEE Transactions on Computers (1994)

After a short introduction to on-line computing, we prove that the functions computable in on-line by a finite automaton are piecewise affine functions whose coefficients are rational numbers (i.e., the functions f(x)=ax+b, or f(x,y)=ax+by+c where a, b, and c are rational). A consequence of this study is that multiplication, division and elementary functions of operands of arbitrarily long length cannot be performed using bounded-size operators.
Functional Differentiation of Computer Programs
Authors: Jerzy Karczmarczuk
Venue: Higher-Order and Symbolic Computation (2001)

We present a purely functional implementation of the computational differentiation tools&mdash;the well known numeric (i.e., not symbolic) techniques which permit one to compute point-wise derivatives of functions defined by computer programs economically and exactly (with machine precision). We show how the use of lazy evaluation permits a transparent and elegant construction of the entire infinite tower of derivatives of higher order for any expressions present in the program. The formalism may be useful in various problems of scientific computing which often demand a hard and ungracious human preprocessing before writing the final code. Some concrete examples are given.
An Associative Accelerator for Large Databases
Authors: Pascal Faudemay, Mongia Mhiri
Venue: IEEE Micro (1991)

The RAPID-1 (relational access processor for intelligent data), an associative accelerator that recognizes tuples and logical formulas, is presented. It evaluates logical formulas instantiated by the current tuple, or record, and operates on whole relations or on hashing buckets. RAPID- 1 uses a reduced instruction set and hardwired control and executes all comparisons in a bit-parallel mode. It speeds up the database by a significant factor and will adapt to future generations of microprocessors. The principal design issues, data structures, instruction set, architecture, environments and performance are discussed.
Multiskewing-A Novel Technique for Optimal Parallel Memory Access
Authors: Ashoke Deb
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

The disparity between the processing speed and the data access rates presents a serious bottleneck in pipelined/vector processors. The memory bank conflict in interleaved system can be alleviated by skewing, for scientific computations performing functions on varieties of submatrices. So far uniskewing involving periodic and linear functions have been studied. Several difficulties encountered in such schemes are that they require a prime number of memory modules, may create wasted memory space, or addressing functions and the alignment network become complex. We present a new technique, termed multiskewing, which applies multiple functions on different sections of the array. Each of these functions may be as simple as a linear shift. We show that some of the advantages are that it does not require a prime number of memory, memory utilization factor is 100%, maintains the logical structure of the array, and allows optimal memory access of a large class of submatrices.
Pattern Discovery by Residual Analysis and Recursive Partitioning
Authors: Tom Chau, Andrew K. C. Wong
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

In this paper, a novel method of pattern discovery is proposed. It is based on the theoretical formulation of a contingency table of events. Using residual analysis and recursive partitioning, statistically significant events are identified in a data set. These events constitute the important information contained in the data set and are easily interpretable as simple rules, contour plots, or parallel axes plots. In addition, an informative probabilistic description of the data is automatically furnished by the discovery process. Following a theoretical formulation, experiments with real and simulated data will demonstrate the ability to discover subtle patterns amid noise, the invariance to changes of scale, cluster detection, and discovery of multidimensional patterns. It is shown that the pattern discovery method offers the advantages of easy interpretation, rapid training, and tolerance to noncentralized noise.
Broadcasting on Incomplete Hypercubes
Authors: Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang
Venue: IEEE Transactions on Computers (1993)

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0>or=k>n. The broadcasting algorithm is strictly optimal.
Markets for Technology
Authors: Shane Greenstein
Venue: IEEE Micro (2002)

For better or worse, mature-market economies possess a remarkable tendency to transform almost any exploitable asset into a traded good or service. To be sure, there are limits to that tendency, and many of those limits arise when the asset is knowledge.
Moment-Preserving Piecewise Linear Approximations of Signals and Images
Authors: Thai B. Nguyen, B. John Oommen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Approximation techniques are an important aspect of digital signal and image processing. Many lossy signal compression procedures such as the Fourier transform and discrete cosine transform are based on the idea that a signal can be represented by a small number of transformed coefficients which are an approximation of the original.Existing approximation techniques approach this problem in either a time/spatial domain or transform domain, but not both. This paper briefly reviews various existing approximation techniques. Subsequently, we present a new strategy to obtain an approximation $\hat f\left( x \right)$ of $f\left( x \right)$ in such a way that it is reasonably close to the original function in the domain of the variable x, and exactly preserves some properties of the transformed domain. In this particular case, the properties of the transformed values that are preserved are geometric moments of the original function. The proposed technique has been applied to single-variable functions, two-dimensional planar curves, and two-dimensional images, and the results obtained are demonstrative.
PRISMA/DB: A Parallel, Main Memory Relational DBMS
Authors: P. M. G. Apers, C. A. van den Berg, J. Flokstra, P. W. P. J. Grefen, M. L. Kersten, A. N. Wilschut
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

PRISMA/DB, a full-fledged parallel, main memory relational database management system (DBMS) is described. PRISMA/DB's high performance is obtained by the use of parallelism for query processing and main memory storage of the entire database. A flexible architecture for experimenting with functionality and performance is obtained using a modular implementation of the system in an object-oriented programming language. The design and implementation of PRISMA/DB are described in detail. A performance evaluation of the system shows that the system is comparable to other state-of-the-art database machines. The prototype implementation of the system runs on a 100-node parallel multiprocessor.
A Single Chip Parallel Multiplier by MOS Technology
Authors: S. Nakamura, K. -Y. Chu
Venue: IEEE Transactions on Computers (1988)

A parallel multiplier design based on the five-counter cell is discussed. A design optimization for the performance in speed is proposed at the logic design level which is developed into an MOS circuit design. The comparison of the five-counter cell design and the full adder cell design reveals that the proposed design is most useful with pass gate logic and results in high-speed multiplication (approximately twice as fast as that of the full adder design) with a moderate increase in hardware complexity. With the five-counter design, an improvement in the hardware complexity of a squarer can be expected.
Scripting embodied agents behaviour with CML: character markup language
Authors: Yasmine Arafa, Abe Mamdani
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Embodied agents present ongoing challenging agenda for research in multi-modal user interfaces and human-computer-interaction. Such agent metaphors will only be widely applicable to online applications when there is a standardised way to map underlying engines with the visual presentation of the agents. This paper delineates the functions and specifications of a mark-up language for scripting the animation of virtual characters. The language is called: Character Mark-up Language (CML) and is an XML-based character attribute definition and animation scripting language designed to aid in the rapid incorporation of lifelike characters/agents into online applications or virtual reality worlds. This multi-modal scripting language is designed to be easily understandable by human animators and easily generated by a software process such as software agents. CML is constructed based jointly on motion and multi-modal capabilities of virtual life-like figures. The paper further illustrates the constructs of the language and describes a real-time execution architecture that demonstrates the use of such a language as a 4G language to easily utilise and integrate MPEG-4 media objects in online interfaces and virtual environments
Toward Support for Hypermedia on the World Wide Web
Authors: Michael Bieber, Fabio Vitali
Venue: Computer (1997)

As organizations rush to embrace the World Wide Web as their primary application infrastructure, they should not bypass the benefit of hypermedia support. Many organizations will embrace the World Wide Web as their primary application infrastructure. However, in the rush to acquire and retrofit Web applications, they risk bypassing the Web's greatest supplemental benefit-hypermedia. Hypermedia lets you add, access, and navigate links in textual and multimedia information. With hypermedia features, Web applications can provide clearer information, and they can be easier and more effective to use than traditional applications. We foresee a hypermedia-influenced era in which users will expect (and application developers will provide) browsing and supplemental linking in all applications. However, some of the latest technologies may actually make it difficult to provide hypermedia features on the Web. For example, Java applets, which read and display some arcane binary data format as input parameters, will recreate the well-known problems with proprietary and unreadable data formats. Applets that create independent connections with a server application could provide shared-screen collaboration and other two-way communication, but they would require an independent and as-yet-undeveloped connection protocol that will not necessarily support hypermedia, rather than the standard HTTP. Furthermore, even if designers agree that supporting a broad range of hypermedia features is desirable, they will need appropriate methodologies and tools. If designers must wait for these methodologies and tools, they may lose interest in using them and, therefore, in supporting hypermedia features. Thus, developing appropriate methodologies and tools quickly is imperative.
Concurrent Error Detection and Correction in Real-Time Systolic Sorting Arrays
Authors: Sy-Yen Kuo, Sheng-Chiech Liang
Venue: IEEE Transactions on Computers (1992)

A novel approach to online error detection and correction for high-throughput VLSI sorting arrays is presented. The error model is defined at the sorting element level and both functional errors and data errors are considered. Functional errors are detected and corrected by exploiting inherent properties as well as newly discovered special properties of the sorting array. Coding techniques are used to locate data errors. All the checkers are designed to be totally self-checking and hence the sorting array is highly reliable. Two-level pipelining is employed, making the design very efficient and suitable for real-time application. The structure is very regular and therefore is very attractive for VLSI or WSI implementation.
Inward looking projections
Authors: Scott Vallance, Paul Calder
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

This paper presents a technique for rendering inward looking projections. We call these projections anti-perpsective because they run counter to normal perspective projection and converge to a point in front of the image plane. A real world analog for this type of projection is the reflection seen on a spherically concave mirror. In fact the technique can be used to render reflections on perfectly spherically curved mirrors. Our implementation builds on environment mapping work that captures a sample of the light coming into a point; we propose an inward looking spherical camera that captures a view from all around an object. The aim of this research is to provide a visualisation technique capable of viewing multiple sides of an object in a single image.
Carbon nanotubes as potential building blocks for future nanoelectronics
Authors: J. Appenzeller, R. Martel, V. Derycke, M. Radosavljević, S. Wind, D. Neumayer, Ph. Avouris
Venue: Microelectronic Engineering (2002)

We present recent experiments on carbon nanotube field-effect transistors and their characteristics and compare the performance of these devices with state-of-the-art silicon MOSFETs. By reducing the gate dielectric film thickness and working with high-k dielectric materials such as HfO2, we are able to effectively reduce the operational voltages below 1 V. The electrical characteristics obtained clearly indicate excellent device performance in both the on- and off-state wit of the nanotube transistor. On/off-current ratios of almost 104 are achieved along with a maximum transconductance of around 425 µS/µm and drive currents of 270 µA/µm at Vgs -- Vth = -0.6 V. Since device parameters are not fully optimized, significant performance improvements can be expected making carbon nanotubes particularly promising as building blocks for future nanoelectronics.