ppxscal/embedding_network huggingface dataset:
Accurate estimation of global buffer delay within a floorplan
Authors: C. J. Alpert, Jiang Hu, S. S. Sapatnekar, C. N. Sze
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Closed formed expressions for buffered interconnect delay approximation have been around for some time. However, previous approaches assume that buffers are free to be placed anywhere. In practice, designs frequently have large blocks that make the ideal buffer insertion solution unrealizable. The theory of Otten (1998) is extended to show how one can model the blocks into a simple delay estimation technique that applies both to two-pin and to multi-pin nets. Even though the formula uses one buffer type, it shows remarkable accuracy in predicting delay when compared to an optimal realizable buffer insertion solution. Potential applications include wire planning, timing analysis during floorplanning or global routing. Our experiments show that our approach accurately predicts delay when compared to constructing a realizable buffer insertion with multiple buffer types.
Using Infrastructure IPs to Support SW-Based Self-Test of Processor Cores
Authors: P. Bernardi, M. Rebaudengo, M. Sonza Reorda
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

SoCs normally include microprocessor/microcontroller cores. Testing them following the software-based self-test approach is attractive, mainly because this allows at-speed testing, and does not require internally modifying the core. However, this raises some issues, such as how to upload and launch the test, how to monitor the results, how to embed the adopted solutions into a suitable wrapper to enhance core modularity and test re-usability. The paper proposes a possible solution to the above issues exploiting Infrastructure IPs, and reports the results gathered on two case studies.
Into the Abstract
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2005)

Karin Kuhlmann earned a living for 25 years as a commercial artist in the analog world of the advertising industry. When the computer arrived in her life, she first used it for her job, but soon discovered the creative potential of this new artistic tool.
Fast synchronization for chip multiprocessors
Authors: Jack Sampson, Rubén González, Jean-Francois Collard, Norman P. Jouppi, Mike Schlansker
Venue: ACM SIGARCH Computer Architecture News (2005)

This paper presents a novel mechanism for barrier synchronization on chip multi-processors (CMPs). By forcing the invalidation of selected I-cache lines, this mechanism starves threads and thus forces their execution to stop. Threads are let free when all have entered the barrier.We evaluated this mechanism using SMTSim and report much better (and most importantly, more flat) performance than lock-based barriers supported by existing microprocessors.
Fuzzy Cognitive Agents in Shared Virtual Worlds
Authors: Peter Leong, Miao Chunyan
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Shared virtual worlds have many applications in computer supported collaborative work (CSCW) and computer games such as massive multiplayer online games (MMOG). One key challenge in MMOG is the creation of believable non-player characters (NPC). This paper proposes a new type of intelligent virtual agents within a MMOG. Its ability for fast inference, goal-oriented and non-deterministic behaviors leads NPCs that are responsive and with a certain degree of unpredictability which are vital to the engaging game play.
Symbiosis: cooperative algorithms for mobile robots and a sensor network
Authors: Gaurav S. Sukhatme
Venue:  (2005)

We address the problem of monitoring spatiotemporal phenomena at high fidelity in an unknown, unstructured, dynamic environment. Our thesis is that a cooperative system comprised of mobile robots (suitable on their own for efficient temporal sampling) and a static sensor net work (suitable on its own for efficient spatial sampling) is an effective means of addressing this problem. We provide theoretical as well as empirical evidence supporting this thesis by decomposing the design of the proposed collaborative system into three constituents. These are respectively, robot coverage and exploration through sensor network deployment, sensor network-assisted robot navigation and sensor network-mediated multi-robot task allocation. The first subproblem we address is the embedding of an active infrastructure (sensing, communication and computation) into the environment using robots, which simultaneously use this infrastructure for coverage and exploration. Our algorithm for this is provably complete, decentralized, scalable, robust, fault tolerant and can be used on simple robots. We present experimental and simulation results which verify the performance of the algorithm. We also present theoretical results which illustrate its asymptotic behavior. Once a network is deployed it can be used for robot navigation. We present an algorithm that allows robots to navigate precisely and reliably using a deployed sensor network. This network-directed navigation approach can be used by simple (modest computation, communication and sensing requirements) heterogeneous robots. Extensive empirical testing confirms the validity of our approach. The final subproblem we address for efficient spatiotemporal monitoring is multi-robot task allocation. The network is used as a spatially diverse &lsquo;sensor&rsquo; for event detection and as a mediator which assigns and navigates robots to high-value sampling locations. This builds on the deployment, coverage, and navigation capabilities presented earlier. Network-mediated task allocation allows robots to (1) respond to task they cannot directly sense, (2) communicate at long ranges, (3) efficiently repair and maintain network. We validate our algorithm for task allocation in field and lab experimental settings.
Visual data representation using context-aware samples
Authors: Aravind Kalaiah
Venue:  (2005)

The rapid growth in the complexity of geometry models has necessitated revision of several conventional techniques in computer graphics. At the heart of this trend is the representation of geometry with locally constant approximations using independent sample primitives. This generally leads to a higher sampling rate and thus a high cost of representation, transmission, and rendering. We advocate an alternate approach involving context-aware samples that capture the local variation of the geometry. We detail two approaches; one, based on differential geometry and the other based on statistics. Our differential-geometry-based approach captures the context of the local geometry using an estimation of the local Taylor's series expansion. We render such samples using programmable Graphics Processing Unit (GPU) by fast approximation of the geometry in the screen space. The benefits of this representation can also be seen in other applications such as simulation of light transport. In our statistics-based approach we capture the context of the local geometry using Principal Component Analysis (PCA). This allows us to achieve hierarchical detail by modeling the geometry in a non-deterministic fashion as a hierarchical probability distribution. We approximate the geometry and its attributes using quasi-random sampling. Our results show a significant rendering speedup and savings in the geometric bandwidth when compared to current approaches.
Improved Topological Fiducial Tracking in the reacTIVision System
Authors: Ross Bencina, Martin Kaltenbrunner, Sergi Jorda
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This paper describes reacTIVision: a camera based two dimensional fiducial (marker) tracking system developed for the reacTable*, a table based tangible musical instrument. Key features of reacTIVision include: (1) the ability to track a large number of fiducials with faster than real-time performance and (2) fiducial size may be varied depending on the number of distinct fiducial identities required. We describe recent advances in our implementation of topologybased fiducial recognition, including a generalised method for accurately computing fiducial location and orientation. A method of graph naming known as left heavy depth sequences is applied to the identification of topologically distinct fiducials. Also discussed is our approach to generating fiducial images for the system, in which we employ evolutionary computation to produce compact fiducials with specific geometric properties.
A Progressive Two-Stage Global Routing for Macro-Cell Based Designs
Authors: Cengiz Alkan, Tom Chen
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

We propose a two-stage global routing algorithm based on mixed integer programming and a novel network-flow model. Results from various test cases including a subset of routes on a commercial 64-bit microprocessor core show that our method outperforms commercial CCT router. On average, we achieved 29% less delay violations, 40% less repeater usage on resulting routing-trees, 20% less maximum delay violation and better congestion distribution.
Creating a Pervasive Testing Environment by Using SMS Messaging
Authors: Alexei Tretiakov, Kinshuk Kinshuk
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

We consider the requirements for a generic m- Learning system that would maximize the likelihood of its acceptance, and conclude that such a system should rely on the existing infrastructure and mobile device ownership, with SMS technology being the most appropriate technology under present conditions. We back this conclusion by conducting a survey on m- Learning acceptance targeted at educators, and demonstrate the feasibility and gauge acceptance by the learners by developing a system prototype and evaluating it in a simulated classroom environment. The results reported in this article speak in favor of introducing low cost, low maintenance SMS based m- Learning systems targeting average, budget conscious educational institutions.
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
Authors: Albert Cohen, Marc Duranton, Christine Eisenbeis, Claire Pagetti, Florence Plateau, Marc Pouzet
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

The design of high-performance stream-processing systems is a fast growing domain, driven by markets such like high-end TV, gaming, 3D animation and medical imaging. It is also a surprisingly demanding task, with respect to the algorithmic and conceptual simplicity of streaming applications. It needs the close cooperation between numerical analysts, parallel programming experts, real-time control experts and computer architects, and incurs a very high level of quality insurance and optimization.In search for improved productivity, we propose a programming model and language dedicated to high-performance stream processing. This language builds on the synchronous programming model and on domain knowledge -- the periodic evolution of streams -- to allow correct-by-construction properties to be proven by the compiler. These properties include resource requirements and delays between input and output streams. Automating this task avoids tedious and error-prone engineering, due to the combinatorics of the composition of filters with multiple data rates and formats. Correctness of the implementation is also difficult to assess with traditional (asynchronous, simulation-based) approaches. This language is thus provided with a relaxed notion of synchronous composition, called n-synchrony: two processes are n-synchronous if they can communicate in the ordinary (0-)synchronous model with a FIFO buffer of size n.Technically, we extend a core synchronous data-flow language with a notion of periodic clocks, and design a relaxed clock calculus (a type system for clocks) to allow non strictly synchronous processes to be composed or correlated. This relaxation is associated with two sub-typing rules in the clock calculus. Delay, buffer insertion and control code for these buffers are automatically inferred from the clock types through a systematic transformation into a standard synchronous program. We formally define the semantics of the language and prove the soundness and completeness of its clock calculus and synchronization transformation. Finally, the language is compared with existing formalisms.
Automated oscillator macromodelling techniques for capturing amplitude variations and injection locking
Authors: Xiaolue Lai, J. Roychowdhury
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We present a method for extracting comprehensive amplitude and phase macromodels of oscillators from their circuit descriptions. The macromodels are based on combining a scalar, nonlinear phase equation with a small linear time-varying system to capture slowly-dying amplitude variations. The comprehensive macromodels are able to correctly predict oscillator response in the presence of interference at far lower computational cost than that of full SPICE-level simulation. We also present an efficient numerical method for capturing injection locking in oscillators, thereby improving on the classic technique of Adler (1946) in terms of accuracy and applicability to any kind of oscillator. We demonstrate the proposed techniques on LC and ring oscillators, comparing results from the macromodels against full SPICE-like simulation. Numerical experiments demonstrate speed tips of orders of magnitude, while retaining excellent accuracy.
Constant generation for the financial domain using grammatical evolution
Authors: Ian Dempsey
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real world problem of a live trading system. The methodologies explored here are Digit Concatenation and Grammatical Ephemeral Random Constants with clear advantages identified for a digit concatenation approach in combination with the ability to form new constants through their recombination within expressions.
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Authors: Ronaldo A. Ferreira, Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Distributed peer-to-peer storage systems rely on voluntary participation of peers to effectively manage a storage pool. Files are generally replicated in several sites to provide acceptable levels of availability. If disk space on these peers is not carefully monitored and provisioned, the system may not be able to provide availability for certain files. In particular, identification and elimination of redundant data are important problems that may arise in long-lived systems. Scalability and availability are competing goals in these networks: scalability concerns would dictate aggressive elimination of replicas, while availability considerations would argue conversely. In this paper, we provide a novel and efficient solution that addresses both these goals with respect to management of redundant data.Specifically, we address the problem of duplicate elimination in the context of systems connected over an unstructured peer-to-peernetwork in which there is no a priori binding between an object and its location. We propose a new randomized protocol to solve this problem in a scalable and decentralized fashion that does not compromise availability requirements of the application. Performance results using both large-scale simulations, and a prototype built on PlanetLab, demonstrate that the protocols provide high probabilistic guarantees of success, while incurring minimal administrative overheads.
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Venue: Workshop on Security of ad hoc and Sensor Networks (2005)

It is our great pleasure to welcome you to the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), held in conjunction with the 12th ACM Conference on Computer and Communications Security (CCS'05), November 7, 2005, in Alexandria, Virginia.This year we received a total of 39 submissions on various aspects of ad-hoc and sensor network security. The program committee selected 6 as regular papers that cover a variety of topics, including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure group communication, key pre-distribution for sensor networks, jamming attacks against sensor network MAC protocols, and defense against Denial-of-Service (DoS) attacks. This year we continue the tradition of SASN'03 and SASN'04 to encourage the presentation and discussion of work-in-progress on ad-hoc and sensor network security. Among the 39 submissions, the program committee selected 7 papers to present in work-in-progress sessions, covering topics on anonymous routing for MANETs, key distribution for inter-group multicast in ad-hoc networks, improved topology assumptions for threshold cryptography in MANETs, RFID security, tracing in mobile wireless sensor networks, time synchronization attacks in sensor networks, and coordinated deployment for improving secure communications and sensing coverage in wireless sensor networks. In addition, the program includes a panel on Advances in Sensor and Ad-hoc Network Security and an invited keynote talk by Radha Poovandran (University of Washington) on Information Assurance in MANETs and Wireless Sensor Networks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.
A Finger-Ring ShapedWearable HANDset based on Bone-Conduction
Authors: Masaaki FUKUMOTO
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper introduces a finger-ring shaped wearable HANDset. It uses the human finger as a transmission route for the receiving voice (bone conduction). Vibration noise is reduced using a newly-created microphone unit named "Duaphragm" that can suppress echo by about 70%. Duaphragm provides a small, low-power, and low-cost means of reducing vibration noise. In addition, a new LSI chip that integrates an accelerometer and a tapping command detector allows the handset to be controlled by tapping the fingertip on which the device is worn.
Optimal Control under a Dynamic Fuel Constraint
Authors: Peter Bank
Venue: SIAM Journal on Control and Optimization (2005)

We present a new approach to solve optimal control problems of the monotone follower type. The key feature of our approach is that it allows us to include an arbitrary dynamic fuel constraint. Instead of dynamic programming, we use the convexity of our cost functional to derive a first order characterization of optimal policies based on the Snell envelope of the objective functional's gradient at the optimum. The optimal control policy is constructed explicitly in terms of the solution to a representation theorem for stochastic processes obtained in Bank and El Karoui (2004), {Ann. Probab.}, 32, pp. 1030--1067. As an illustration, we show how our methodology allows us to extend the scope of the explicit solutions obtained for the classical monotone follower problem and for an irreversible investment problem arising in economics.
A Spatio-Temporal Adaptation Model for Multimedia Presentations
Authors: S. Benbernou, A. Makhoul, M. S. Hacid, A. Mostefaoui
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Multimedia data are applicable in various domains such as education, advertising, entertainment and communication. Multimedia data can be in the form of documents, and require adequate spatial and temporal presentation models. Sometimes, due to the noisy problems such as low bandwidth, or user preferences, replacing a media-element by another one can be achieved in order to provide the better quality of presentation. This paper deals with the problem of finding adequate multimedia presentation that ful- fills spatio-temporal adaptation for switching between a set of alternative and semantically equivalent media elements.
Review of "Models for Flow Systems and Chemical Reactors, by C. Y. Wen and L. T. Fan", Marcel Dekker, Inc. 1975
Venue: ACM SIGSIM Simulation Digest (1976)

The engineering approach to the development of flow models vital to the analysis of chemical reactor systems, processes of mass and heat transfer and biological systems is clearly and compactly presented in this volume by the two authors. 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
Approaches to P2P Internet Application Development
Authors: Thabotharan Kathiravelu, Arnold Pears
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Research in overlay and P2P networking has been tightly focused on fundamentals in the last few years, leading to developments on a range of important issues. The time has come to integrate these insights into existing and new systems. We see this as a vital part of the effort to influence the development of Internet services and arrive at a generalized architecture within which to design and construct overlay and P2P systems. This paper analyzes deployed P2P systems in the public and research arenas providing a taxonomy of issues and research. The paper then discusses the roles of overlays, P2P applications and network infrastructure and argues for a multi-dimensional view of systems development to describe the inter-relationships between these components. The parametric space in which one defines the role of a P2P application depends on the level of complexity we expect in that application, in comparison to the richness of the services provided by overlays and the network core. The contribution of the work presented here is to identify the key research issues in both academic and industrial environments and then suggest that an alignment of research activities and application development should focus on constructing a unified overlay architecture which ensures efficiency, fault tolerance and scalability.
A Basis for Analyzing Software Architecture Analysis Methods
Authors: Rick Kazman, Len Bass, Mark Klein, Tony Lattanze, Linda Northrop
Venue: Software Quality Control (2005)

A software architecture is a key asset for any organization that builds complex software-intensive systems. Because of an architecture's central role as a project blueprint, organizations should analyze the architecture before committing resources to it. An analysis helps to ensure that sound architectural decisions are made. Over the past decade a large number of architecture analysis methods have been created, and at least two surveys of these methods have been published. This paper examines the criteria for analyzing architecture analysis methods, and suggests a new set of criteria that focus on the essence of what it means to be an architecture analysis method. These criteria could be used to compare methods, to help understand the suitability of a method, or to improve a method. We then examine two methods--the Architecture Tradeoff Analysis Method and Architecture-level Modifiability Analysis--in light of these criteria, and provide some insight into how these methods can be improved.