ppxscal/embedding_network huggingface dataset:
Cost considerations in network on chip
Authors: Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam Kolodny
Venue: Integration, the VLSI Journal (2004)

Systems on Chip (SoCs) require efficient inter-module interconnection providing for the required communications at a low cost. We analyze the generic cost in area and power of Networks on Chip (NoCs) and alternative interconnect architectures: a shared bus, a segmented bus and a point-to-point interconnect. For each architecture we derive analytical expressions for area, power dissipation and operating frequency as well as asymptotic limits of these functions. The analysis quantifies the intuitive NoC scalability advantages.Next we turn to NoC cost optimization. We explore cost tradeoffs between the number of buffers and the link speed. We use a reference architecture, termed QNoC (Quality-of-Service NoC), which is based on a grid of wormhole switches, shortest path routing and multiple QoS classes. Two traffic scenarios are considered, one dominated by short packets sensitive to queuing delays and the other dominated by large block-transfers. Our simulations show that network cost can be minimized while maintaining quality of service, by trading off buffers with links in the first scenario but not in the second.
Book review: Integration of Visual Modules An Extension of the Marr Paradigm By John (Yiannis) Aloimonos and David Shulman (Academic Press, London, 1990)
Venue: ACM SIGART Bulletin (1991)

The main goal of the book is to extend Marr's paradigm. In his book, David Marr (Vision, Freeman, 1982) presents the vision problem as a problem of information processing. He presents a general three-level paradigm, in which any machine carrying out an information-processing task must be understood. The three levels are:1. Computational theory: What is the goal of the computation, why is it appropriate, and what is the logic of the strategy by which it can be carried out?
Accurate and robust geometric modeling for simulation of IC and MEMS fabrication processes
Authors: Tushar Udeshi
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Simulation of IC (Integrated Circuit) and MEMS (Micro Electro Mechanical Systems) fabrication processes offers many interesting challenges. A fabrication step, such as a deposition or an etch, can result in significant changes to the surface profile of the structure. A fabrication process can consist of tens of these steps; therefore, the geometric modeling algorithm must be robust and memory and computationally efficient. Moreover, it should be flexible enough to be able to account for the varied geometric changes that can occur during a step. We describe voxel-based geometric modeling techniques (which exhibit these properties) for accurately modeling different types of deposition and etch steps.
Book review: Rule Based Programming with OPS5 by Thomas A. Cooper and Nancy Wogrin (Morgan Kaufmann Pubtishers)
Venue: Issue 109 (July 1989) (1989)

"Rule Based Programming with OPS5" is intended for beginning OPS5 programmers and, according to the foreword by John McDermott, presents "... the collective wisdom of experienced OPS5 programmers ..." to enable those beginners to avoid common mistakes and misuse of the language. The authors assume that the reader is familiar with software development fundamentals such as data structures and data abstraction, however, experience with production systems, rule-based programming, expert systems or even artificial intelligence is not needed. Nonetheless the methods presented in the text are flavored for expert system developers.
Workshop on architecting dependable systems (WADS 2005)
Authors: Rogério de Lemos, Alexander Romanovsky
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This workshop summary gives a brief overview of the workshop on "Architecting Dependable Systems" held in conjunction with the ICSE 2005. The main aim of this workshop is to promote cross-fertilization between the software architecture and dependability communities. We believe that both of them will benefit from clarifying approaches that have been previously tested and have succeeded as well as those that have been tried but have not yet been shown to be successful.
On d-threshold graphs and d-dimensional bin packing
Authors: Alberto Caprara, Andrea Lodi, Romeo Rizzi
Venue: Networks (2004)

We illustrate efficient algorithms to find a maximum stable set and a maximum matching in a graph with n nodes given by the edge union of d threshold graphs on the same node set, in case the d graphs in the union are known. Actually, because the edge set of a threshold graph can be implicitly represented by assigning values to the nodes, we assume that we know these values for each of the d graphs in the union. We present an O&lpar;n log n &plus; nd-1&rpar; time algorithm to find a maximum stable set and an O&lpar;n2&rpar; time algorithm to find a maximum matching, in case d is constant. For the case d &equals; 2, the running time of the latter is reduced to O&lpar;n log n&rpar; provided an additional technical condition is satisfied. The natural application of our results is the fast computation of lower bounds for the d-dimensional bin packing problem, for which the compatibility relations between items are represented by the edge union of d threshold graphs with one node for each item, the value of the node for the i-th graph being equal to the size of the item on the i-th dimension. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;4&rpar;, 266&ndash;280 2004
A Novel Fingerprint Map of SARS-CoV with Visualization Analysis
Authors: Lei Gao, Yongsheng Ding, Hua Dai, Zhende Huang, Shihuang Shao
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Spike (S) protein of severe acute respiratory syndrome coronavirus (SARS-CoV) associates with cellular receptors to mediate infection of their target cells. This paper studies the genome sequences of S protein and SARSýs receptor based on Z curve method. A visualization characteristic for SARS-CoV has been seized. The comparison results among a large number of genome sequences have proved such characteristic is special for SARS-CoV. Such characteristic can be looked upon as a fingerprint map of SARS-CoV to diagnose a suspected case. Also, this conclusion has been proved in recent real case in Guang Dong, China. Via our study in this paper, we have viewed that: (1) the fingerprint map can provide a nonstandard, simple and visualized detection approach, especially for the situation where the standard methodýs results are conflict, and (2) we can take virus and its receptor into coordinated consideration of sequence analysis for SARS-CoV detection.
Speed-up of radiation treatment planning using a workstation cluster
Authors: Hiroyuki Sato, Takafumi Nakagawa, Kiyoshi Yoda, Katsuto Nakajima, Hidenobu Sakamoto, Masahiro Endo
Venue: Systems and Computers in Japan (2004)

In treatment planning in a heavy particle cancer radiation facility which is utilized by multiple remote medical institutions, it is necessary to calculate accurately the three-dimensional dose distribution within the body of the patient in order to achieve efficient treatment. However, this presents a problem, since a long processing time is needed, which degrades the efficiency of treatment planning. In order to handle this problem, the authors used a cluster system in which Alpha 21164A CPUs were connected over a 100 Mbit&sol;s Ethernet to speed up the dose distribution calculation (Dose) and digital reconstructed X-ray image regeneration (DRR) by parallel processing. Parallel calculation is performed by segmenting the calculation area. The communication time among processors is reduced by data compression, and the load is made uniform by assigning more than one area to a processor. As a result of evaluation experiments, calculations performed iteratively by varying parameters at the actual site of medical care were accelerated by using 10 processors, by a factor of 7 for Dose, and 9 for DRR. In other words, the speed was improved in proportion to the number of processors. This implies that processing which has required several tens of seconds can now be handled in 3 to 6 seconds, which is short enough for the user to wait before the terminal. The objective is to make the system usable by multiple remote medical institutions by refining system functions such as fault recovery in order to ensure its reliability as a calculation server. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 96&ndash;106, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10277
Shared landmarks in complex coordination environments
Authors: Michael J. Muller, Olga Kuchinskaya, Suzanne O. Minassian, John C. Tang, Catalina Danis, Chen Zhao, Beverly Harrison, Thomas P. Moran
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We explore the concept of social landmarks in complex, shared information and coordination environments. Previous research in navigation and shared spaces has tended to emphasize individual navigation, formally inscribed spaces, social filtering, and boundary objects. Based on ethnographic research into complex collaborative work in organizations, we extend the concept of navigational "landmarks" to include not only individually-used documents, but also shared landmarks in the form of persons, roles, and events. This emerging concept of social landmarks may be applied in identifying and representing these coordinating points, to support the work of teams and organizations in complex projects.
Shape-Tree Semilattice
Authors: Renato Keshet
Venue: Journal of Mathematical Imaging and Vision (2005)

A new, self-dual approach for morphological image processing, based on a semilattice framework, is introduced. The related morphological erosion, in particular, shrinks all 'objects` in an image, regardless to whether they are bright or dark.The theory is first developed for the binary case, where it is closely related to the adjacency tree. Under certain constraints, it is shown to yield a lattice structure, which is complete for discrete images. It is then generalized to grayscale functions thanks to the tree of shapes, a recently introduced generalization of adjacency trees.
Moving object extraction with cooperative cameras
Authors: Wentao Zheng, Toshihiko Misu, Masahide Naemura, Yoshinori Izumi, Yasuaki Kanatsugu
Venue: Systems and Computers in Japan (2004)

We present a novel approach to robust extraction of moving objects with cooperative static and active cameras. The active camera, for usual broadcasts, is fixed in location but free to rotate and zoom. The static camera is a completely fixed panoramic camera viewing a whole scene. Precalibration and on-the-ground calibration are carried out to determine the intrinsic and extrinsic camera parameters. The two cameras work in synchronism, and the motion parameters (e.g., pan, tilt, zoom, focus) of the active camera are measured for each image frame. Background subtraction is applied to the image sequence of the static camera to extract moving objects, and the obtained moving objects are then transformed to the image sequence of the active camera using both calibrated camera parameters and camera motion parameters. The approach is robust and fast and has a number of other desirable features. &copy; 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 35(1): 13&ndash;25, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10557
FPGA Implementation of a Lattice Quantum Chromodynamics Algorithm Using Logarithmic Arithmetic
Authors: Owen Callanan, Andy Nisbet, Emre Ozer, James Sexton, David Gregg
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

In this paper, we discuss the implementation of a lattice Quantum Chromodynamics (QCD) application to a Xilinx VirtexII FPGA device on an Alpha Data ADM-XRC-II board using Handel-C and logarithmic arithmetic. The specific algorithm implemented is the Wilson Dirac Fermion Vector times Matrix Product operation. QCD is the scientific theory that describes the interactions of various types of sub-atomic particles. Lattice QCD is the use of computer simulations to prove aspects of this theory. The research described in this paper aims to investigate whether FPGAs and logarithmic arithmetic are a viable compute-platform for high performance computing by implementing lattice QCD for this platform. We have achieved competitive performance of at least 936 MFlops per node, executing 14.2 floating point equivalent operations per cycle, which is far higher than the previous solutions proposed for lattice QCD simulations.
Tracking task ontology
Authors: Tia B. Walton
Venue: Journal of Computing Sciences in Colleges (2004)

The knowledge involved in tracking a ballistic missile in the boost phase, the first three minutes after its launch, is quite crucial. An intelligent system that would track the missile would use different types of sensors and be able to communicate with the Global Positioning System. The Global Positioning System and radar play a major part in the development of my research because each gives valuable information that must be turned into knowledge. The Global Positioning System gives actual latitude and longitude while the radar provided altitude.
An Approach for Automatic Data Allocation in C to HDL Compilers
Authors: Tsutomu Maruyama
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

In this paper, we propose a method for automatic data allocation in C to HDL compilers which support pointers. In our method, first, all assignment statements are traced throughout all function calls in order to reduce the number of variables which are mapped on memories, then, virtual memory banks are given to the variables in order to reduce access conflicts on the memory banks, and last, the variables are mapped on physical memory banks based on the virtual memory banks.
On combining language models: oracle approach
Authors: Kadri Hacioglu, Wayne Ward
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper, we address the problem of combining several language models (LMs). We find that simple interpolation methods, like log-linear and linear interpolation, improve the performance but fall short of the performance of an oracle. The oracle knows the reference word string and selects the word string with the best performance (typically, word or semantic error rate) from a list of word strings, where each word string has been obtained by using a different LM. Actually, the oracle acts like a dynamic combiner with hard decisions using the reference. We provide experimental results that clearly show the need for a dynamic language model combination to improve the performance further. We suggest a method that mimics the behavior of the oracle using a neural network or a decision tree. The method amounts to tagging LMs with confidence measures and picking the best hypothesis corresponding to the LM with the best confidence.
A Novel Dual-Output CCII-Based Single-Ended to Differential Converter
Authors: Francesco Centurelli, Marco Diqual, Giuseppe Ferri, Nicola C. Guerrini, Giuseppe Scotti, Alessandro Trifiletti
Venue: Analog Integrated Circuits and Signal Processing (2005)

In this paper a novel single-ended to differential converter topology, based on second generation current conveyors (CCIIs) is proposed. The converter architecture is very simple, being formed by a dual output current-conveyor (DOCCII) and three resistances which fix the gain of the circuit independently from the active block. Also the DOCCII topology is original, having the particular feature that output signals show a very little phase shifting between the two high impedance current outputs. The circuit has been implemented in a standard CMOS technology (AMS 0.35 ¿ m), using a supply voltage of ± 0.75 V. Theoretical values, circuit simulations and post-layout simulations are also shown and their good agreement confirms the validity of the presented idea.
Power balanced coverage-time optimization for clustered wireless sensor networks
Authors: Tao Shu, Marwan Krunz, Sarma Vrudhula
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays them to a sink node directly or through other CHs. The coverage time of the network is defined as the time until one of the CHs runs out of battery, resulting in an incomplete coverage of the sensing region. We study the maximization of coverage time by balancing the power consumption of different CHs. Using a Rayleigh fading channel model for inter-cluster communications, we provide optimal power allocation strategies that guarantee (in a probabilistic sense) an upper bound on the end-to-end (inter-CH) path reliability. Our allocation strategies account for the interaction between routing and clustering by considering the impacts of intra- and inter-cluster traffic at each CH. Two mechanisms are proposed for achieving balanced power consumption: the routing-aware optimal cluster planning and the clustering-aware optimal random relay. For both mechanisms, the problem is formulated as a signomial optimization, which can be efficiently solved using generalized geometric programming. Numerical examples and simulations are used to validate our analysis and study the performance of the proposed schemes.
How to implement ISDNs without user observability---Someremarks
Authors: Andreas Pfitzmann
Venue: ACM SIGSAC Review (1987)

In present day communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. With the increasing use of ISDNs, this becomes a severe threat.Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose and evaluate some suitable performance and reliability enhancements.
A surfactant-conserving volume-of-fluid method for interfacial flows with insoluble surfactant
Authors: Ashley J. James, John Lowengrub
Venue: Journal of Computational Physics (2004)

An axisymmetric numerical method to simulate the dynamics of insoluble surfactant on a moving liquid-fluid interface is presented. The motion of the interface is captured using a volume-of-fluid method. Surface tension, which can be a linear or nonlinear function of surfactant concentration (equation of state), is included as a continuum surface force. The surfactant evolution is governed by a convection-diffusion equation with a source term that accounts for stretching of the interface. In the numerical method, the masses of the flow components and the surfactant mass are exactly conserved. A number of test cases are presented to validate the algorithm. Simulations of a drop in extensional flow, and its subsequent retraction and breakup upon cessation of the external flow, are performed. Even when the initial surfactant distribution is dilute, we observe that increases in surfactant concentration locally (i.e. at the drop tips) can result in a local deviation from the dilute limit. We show that this can lead to differences in effective surface tension, the Marangoni forces and the associated drop dynamics between results using the linear and nonlinear equations of state.
A Multiresolution Symbolic Representation of Time Series
Authors: Vasileios Megalooikonomou, Qiang Wang, Guo Li, Christos Faloutsos
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a new representation of time series, the Multiresolution Vector Quantized (MVQ) approximation, along with a new distance function. The novelty of MVQ is that it keeps both local and global information about the original time series in a hierarchical mechanism, processing the original time series at multiple resolutions. Moreover, the proposed representation is symbolic employing key subsequences and potentially allows the application of text-based retrieval techniques into the similarity analysis of time series. The proposed method is fast and scales linearly with the size of database and the dimensionality. Contrary to the vast majority in the literature that uses the Euclidean distance, MVQ uses a multi-resolution/hierarchical distance function. We performed experiments with real and synthetic data. The proposed distance function consistently outperforms all the major competitors (Euclidean, Dynamic Time Warping, Piecewise Aggregate Approximation) achieving up to 20% better precision/recall and clustering accuracy on the tested datasets.
Delay insertion method in clock skew scheduling
Authors: Baris Taskin, Ivan S. Kourtev
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

This paper describes a delay insertion method that improves the efficiency of clock skew scheduling. Clock skew scheduling is performed on synchronous circuits in order to improve the performance of a circuit; most often by permitting the circuit to operate at a lower clock period or by increasing the tolerance of the circuit against secondary order effects and process parameter variations. With clock skew scheduling, the original circuit topology is preserved while the clock distribution network is modified to satisfy an optimal clock schedule (set of clock signal arrival delays). The work presented here studies a circuit modification technique requiring systematic delay insertion within the circuit logic (delay insertion method) in order to improve the minimum clock period achieved through clock skew scheduling. The proposed delay insertion method is defined and demonstrated on both edge-triggered and level-sensitive synchronous circuits leading to average clock period improvements of 9% and 10%, respectively, over standard clock skew scheduling algorithms. Overall, the clock period improvements over zero clock skew, flip-flop based circuits are improved to 34% on average, both for the edge-triggered and level-sensitive designs of ISCAS'89 benchmark circuits.
Graphics-to-Haptics: A Tool for Developing Haptic Virtual Environments
Authors: Eric Acosta, Bharti Temkin
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Current haptic application development tools typically require considerable programming efforts in order to make an existing surface-based graphical virtual environment (G-VE) touchable. In this paper we describe a Graphics-to-haptics (G2H) tool that provides a framework for developing the largest possible haptic virtual environments (H-VE) for stable haptic applications. G2H automatically converts a GVE into a haptic application with no additional programming via a real-time visual software development process of 1) importing G-VEs, 2) setting haptic and visual properties for models, 3) selecting graphics and haptic rendering algorithms, 4) representing the haptic device position in the virtual space, 5) interfacing different haptic devices to the virtual environment, and 6) testing and modify the virtual environment to ensure real-time stability of the created haptic application. The tested H-VE can be used as the foundation for other applications such as surgical simulators [1, 2].