ppxscal/embedding_network huggingface dataset:
SIMD Optimization in COINS Compiler Infrastructure
Authors: Mitsugu Suzuki, Nobuhisa Fujinami, Takeaki Fukuoka, Tan Watanabe, Ikuo Nakata
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

COINS is a compiler infrastructure that makes it easy to construct a new compiler by adding/modifying only part of the COINS of compiling/optimization features. SIMD optimization is a major advantage. We present an overview of COINS and some topics on its SIMD optimization.
PL/I process generators
Authors: Y. V. Reddy
Venue: ACM SIGSIM Simulation Digest (1976)

The following is a listing of several process generators implemented in PL/I. These were adopted from similar programs implemented in SIMSCRIPT II and published in the SIMSCRIPT II implementation manual. The Assembly Language version of the pseudo random number generator was adopted from a listing published in CACM, Feb. 1969. All programs raise a CONDITION (@ERR), if improper arguments are passed. The error conditions and the calling arguments are self explanatory. These routines allow for ten separate streams of random numbers. The seed values are initialized in the routine RANDOM. 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
General approach to formulation and solution of simulation models
Authors: S. Sitharama Iyengar
Venue: ACM SIGSIM Simulation Digest (1980)

This paper will report on a general approach to the formulation and solution to simulation models.
Proactive Route Maintenance and Overhead Reduction for Application Layer Multicast
Authors: Tetsuya Kusumoto, Yohei Kunichika, Jiro Katto, Sakae Okubo
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The purpose of this study is to maintain efficient backup routes for restoring overlay trees. In most conventional methods, after a node leaves the trees, its children start searching for a new parent. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to find a new parent over the overlay trees before the current parent leaves. A proactive approach can find respective new parents immediately and switch to the backup route smoothly. In our proposal, the structure of the overlay tree using a redundant degree enables to decide a new parent without so much overhead information. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.
Client controlled security for web applications
Authors: Marko Hassinen, Petteri Mussalo
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The main contribution of this paper is an encryption system for web applications, where the encryption is done on the client side. By a web application we mean an application that uses a web browser as a user interface and the content is in HTML or equivalent. In our application the client creates and stores an encryption key. The data is always encrypted when in transit through the transport media, and cannot be decrypted on the server without an explicit consent of the client. Even a malicious server software cannot be used to disclose the confidential data. Furthermore, the client will detect any attempt to tamper with the encrypted data. We show how to create a web application that uses client side encryption and key generation. Our approach delivers confidentiality, integrity, and user trust. Furthermore it doesn't require any additional hardware or any software installations on the client side.
Relief Texture from Specularities
Authors: Jing Wang, Kristin J. Dana
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In vision and graphics, advanced object models require not only 3D shape, but also surface detail. While several scanning devices exist to capture the global shape of an object, few methods concentrate on capturing the fine-scale detail. Fine-scale surface geometry (relief texture), such as surface markings, roughness, and imprints, is essential in highly realistic rendering and accurate prediction. We present a novel approach for measuring the relief texture of specular or partially specular surfaces using a specialized imaging device with a concave parabolic mirror to view multiple angles in a single image. Laser scanning typically fails for specular surfaces because of light scattering, but our method is explicitly designed for specular surfaces. Also, the spatial resolution of the measured geometry is significantly higher than standard methods, so very small surface details are captured. Furthermore, spatially varying reflectance is measured simultaneously, i.e., both texture color and texture shape are retrieved.
A Dynamic Conditional Random Field Model for Foreground and Shadow Segmentation
Authors: Yang Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

This paper proposes a dynamic conditional random field (DCRF) model for foreground object and moving shadow segmentation in indoor video scenes. Given an image sequence, temporal dependencies of consecutive segmentation fields and spatial dependencies within each segmentation field are unified by a dynamic probabilistic framework based on the conditional random field (CRF). An efficient approximate filtering algorithm is derived for the DCRF model to recursively estimate the segmentation field from the history of observed images. The foreground and shadow segmentation method integrates both intensity and gradient features. Moreover, models of background, shadow, and gradient information are updated adaptively for nonstationary background processes. Experimental results show that the proposed approach can accurately detect moving objects and their cast shadows even in monocular grayscale video sequences.
Increasing Sensor Network Lifetime by Identifying and Leveraging Nodes with Excess Energy In Heterogeneous Networks
Authors: Keith Hellman, Michael Colagrosso
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

propose and evaluate wireless sensor routing algorithms igned to extend the lifetime of a heterogeneous wireless sor network. The network is heterogeneous in the sens' energy distribution and also in the amount of data ch sensor must communicate. As a basis for comparin, we analyze the lifetime of a network using a simple, arest-neighbor routing algorithm and an analytic solun to the optimal lifetime of networks meeting certain conaints. We compare the performance of all the routing alrithms in simulation.
The k-degree Cayley graph and its topological properties
Authors: Sun-Yuan Hsieh, Tien-Te Hsiao
Venue: Networks (2006)

This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest path routing algorithm for the k-degree Cayley graph. Cycle-embedding and clique-embedding are also discussed. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26&ndash;36 2006
Architectural-level synthesis of digital microfluidics-based biochips
Authors: Fei Su, K. Chakrabarty
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Microfluidics-based biochips offer a promising platform for massively parallel DNA analysis, automated drug discovery, and real-time biomolecular recognition. Current techniques for full-custom design of droplet-based "digital" biochips do not scale well for concurrent assays and for next-generation system-on-chip (SOC) designs that are expected to include fluidic components. We propose a system design methodology that attempts to apply classical architectural-level synthesis techniques to the design of digital microfluidics-based biochips. We first develop an optimal scheduling strategy based on integer linear programming. Since the scheduling problem is NP-complete, we also develop two heuristic techniques that scale well for large problem instances. A clinical diagnostic procedure, namely multiplexed in-vitro diagnostics on human physiological fluids, is used to evaluate the proposed method.
Learning From and About Others: Towards Using Imitation to Bootstrap the Social Understanding of Others by Robots
Authors: Cynthia Breazeal, Daphna Buchsbaum, Jesse Gray, David Gatenby, Bruce Blumberg
Venue: Artificial Life (2005)

We want to build robots capable of rich social interactions with humans, including natural communication and cooperation. This work explores how imitation as a social learning and teaching process may be applied to building socially intelligent robots, and summarizes our progress toward building a robot capable of learning how to imitate facial expressions from simple imitative games played with a human, using biologically inspired mechanisms. It is possible for the robot to bootstrap from this imitative ability to infer the affective reaction of the human with whom it interacts and then use this affective assessment to guide its subsequent behavior. Our approach is heavily influenced by the ways human infants learn to communicate with their caregivers and come to understand the actions and expressive behavior of others in intentional and motivational terms. Specifically, our approach is guided by the hypothesis that imitative interactions between infant and caregiver, starting with facial mimicry, are a significant stepping-stone to developing appropriate social behavior, to predicting others' actions, and ultimately to understanding people as social beings.
An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
Authors: Xiaoliang Wan, George Em Karniadakis
Venue: Journal of Computational Physics (2005)

We formulate a Multi-Element generalized Polynomial Chaos (ME-gPC) method to deal with long-term integration and discontinuities in stochastic differential equations. We first present this method for Legendre-chaos corresponding to uniform random inputs, and subsequently we generalize it to other random inputs. The main idea of ME-gPC is to decompose the space of random inputs when the relative error in variance becomes greater than a threshold value. In each subdomain or random element, we then employ a generalized polynomial chaos expansion. We develop a criterion to perform such a decomposition adaptively, and demonstrate its effectiveness for ODEs, including the Kraichnan-Orszag three-mode problem, as well as advection-diffusion problems. The new method is similar to spectral element method for deterministic problems but with h-p discretization of the random space.
A verifiable SSA program representation for aggressive compiler optimization
Authors: Vijay S. Menon, Neal Glew, Brian R. Murphy, Andrew McCreight, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Leaf Petersen
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We present a verifiable low-level program representation to embed, propagate, and preserve safety information in high perfor-mance compilers for safe languages such as Java and C#. Our representation precisely encodes safety information via static single-assignment (SSA) [11, 3] proof variables that are first-class constructs in the program.We argue that our representation allows a compiler to both (1) express aggressively optimized machine-independent code and (2) leverage existing compiler infrastructure to preserve safety information during optimization. We demonstrate that this approach supports standard compiler optimizations, requires minimal changes to the implementation of those optimizations, and does not artificially impede those optimizations to preserve safety. We also describe a simple type system that formalizes type safety in an SSA-style control-flow graph program representation. Through the types of proof variables, our system enables compositional verification of memory safety in optimized code. Finally, we discuss experiences integrating this representation into the machine-independent global optimizer of STARJIT, a high-performance just-in-time compiler that performs aggressive control-flow, data-flow, and algebraic optimizations and is competitive with top production systems.
Using Volatile State Storage for Substantial Improvement in RFID Throughput
Authors: Vijay Pillai, James Peternel, Harley Heinrich, Rene Martinez, K. V. S. Rao
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

One of the major problems facing RFID systems today is that of tags not being read, resulting in reduced tag identification rates. This is more likely to happen as large number of tags is present in a small enclosure. We examine one of the causes for missed tags, namely coupling between adjacent tags. We present a theoretical explanation for the cause of coupling between tags and the mechanism by which it causes tags not to be identified. The concept of using a volatile state storage cell is examined. We study how state storage helps to eliminate missed tags, using the ISO 18000-6B protocol as an illustrative example. Experimental results using chips that have state storage capability are presented and we compare identification rates with and without using state storage. It is seen that when state storage is used, all tags are identified and is vastly superior to tag identification without state storage. For the first time, we present results showing how indispensable the concept of state storage is for passive RFID operation. The concept is readily extended to any protocol for passive RFID operation.
A Genetic Approach for the Reconfiguration of Degradable Processor Arrays
Authors: Masaru Fukushi, Yusuke Fukushima, Susumu Horiguchi
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

This paper discusses the NP-complete problem of reconfiguring two-dimensional degradable processor arrays under the row and column rerouting constraints. One major drawback of the previous algorithms is that a rerouting scheme to construct logical rows/columns can be applied only in one direction, either row or column direction, to handle the difficulty of this reconfiguration problem. We propose a new approach for the reconfiguration of degradable processor arrays employing a genetic algorithm (GA). The GA is used to evolve rerouting strategies for constructing logical rows/columns. A strategy based rerouting scheme is proposed to reroute the inter-connections of fault-free PEs in both row and column directions. The performances of our algorithm are compared with previous studies and it indicates that the proposed algorithm achieves better results in terms of harvest and degradation.
ROC confidence bands: an empirical evaluation
Authors: Sofus A. Macskassy, Foster Provost, Saharon Rosset
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper is about constructing confidence bands around ROC curves. We first introduce to the machine learning community three band-generating methods from the medical field, and evaluate how well they perform. Such confidence bands represent the region where the "true" ROC curve is expected to reside, with the designated confidence level. To assess the containment of the bands we begin with a synthetic world where we know the true ROC curve---specifically, where the class-conditional model scores are normally distributed. The only method that attains reasonable containment out-of-the-box produces non-parametric, "fixed-width" bands (FWBs). Next we move to a context more appropriate for machine learning evaluations: bands that with a certain confidence level will bound the performance of the model on future data. We introduce a correction to account for the larger uncertainty, and the widened FWBs continue to have reasonable containment. Finally, we assess the bands on 10 relatively large benchmark data sets. We conclude by recommending these FWBs, noting that being non-parametric they are especially attractive for machine learning studies, where the score distributions (1) clearly are not normal, and (2) even for the same data set vary substantially from learning method to learning method.
Region Abstraction for Event Tracking in Wireless Sensor Networks
Authors: Chun-Han Lin, Chung-Ta King, Hung-Chang Hsiao
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

It is often necessary to track objects or events that gather as a large group, such as a school of fishes, or that do not have a rigid shape, such as forest fires and toxic gas. Their aggregate features, such as shape, area, moving direction, and speed are often queried. These objects or events often exhibit interesting behavior, such as splitting into multiple groups or merging into a single group. In this paper, we discuss the use of wireless sensor networks to track such events. A framework, CLOUD, is proposed, which constructs a collective structure over every region covered by the events to collect and aggregate related information. CLOUD is evaluated by simulations in NS2. The results show that CLOUD can effectively reduce bandwidth consumption in tracking such events while conserve energy.
Hierarchical Density-Based Clustering of Uncertain Data
Authors: Hans-Peter Kriegel, Martin Pfeifle
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The hierarchical density-based clustering algorithm OPTICS has proven to help the user to get an overview over large data sets. When using OPTICS for analyzing uncertain data which naturally occur in many emerging application areas, e.g. location based services, or sensor databases, the similarity between uncertain objects has to be expressed by one numerical distance value. Based on such single-valued distance functions OPTICS, like other standard data mining algorithms, can work without any changes. In this paper, we propose to express the similarity between two fuzzy objects by distance probability functions which assign a probability value to each possible distance value. Contrary to the traditional approach, we do not extract aggregated values from the fuzzy distance functions but enhance OPTICS so that it can exploit the full information provided by these functions. The resulting algorithm FOPTICS helps the user to get an overview over a large set of fuzzy objects.
Gradient-Ascending Routing via Footprints in Wireless Sensor Networks
Authors: Jai-Jin Lim, Kang G. Shin
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

*A novel gradient-ascending stateless routing protocol, called GRASP (GRadient Ascending Stateless Protocol), is proposed for stationary wireless sensor networks. GRASP is built with a novel packet forwarding method called FBF (Footprint-Based Forwarding), in which each node maintains a Bloom filter that holds a dejavu image for the nodes whose packets were relayed through the filter. Forwarding a packet through networked sensors is then just running a membership test of the packet's destination against the networked Bloom filters, either dropping the packet before it reaches the destination or eventually delivering it to the destination. An extensive simulation study with various routing scenarios has shown the proposed method to achieve about 99% packet delivery while incurring only a small amount of overhead. It also achieves more than 86% packet delivery even for a lossy channel with up to 30% loss rate. Furthermore, our comparative evaluation against AODV or simple flooding shows that GRASP achieves a comparable, or even better, performance in terms of the packet delivery ratio and overhead under the simulation settings investigated. GRASP is shown to reduce the delivery overhead by a factor of 2.37 over AODV or 3.11 over the simple flooding, while providing more robustness to packet lossesthis is a significant improvement for low-power sensors in a lossy wireless environment. Manipulating Bloom filters incurs a small space overhead and does not create any protocol conflict with the underlying gradient-descending protocols, thanks to its stateless routing.
Non_sensor
Authors: Raquel Rennó, Rafael Marchetti, Gonzague Defos du Rau
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The paper presents Non_sensor, a digital art project that makes use of a Polhemus motion tracking system to create a electromagnetic field which is disturbed by metallic objects that are manipulated by the visitors in the installation. This disturbance is interpreted by the system as movement, and presented in the interface as lines that create trajectories according to the distortions. Visitors can therefore design different graphic patterns in the interface by playing with objects.
Optimal Read-Once Parallel Disk Scheduling
Authors: Mahesh Kallahalla, Peter J. Varman
Venue: Algorithmica (2005)

An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the next $L$ references, $L$-block lookahead, to create a minimal-length I/O schedule. For a system with $D$ disks and a buffer of capacity $m$ blocks, we show that the competitive ratio of L-OPT is $\Theta(\sqrt{mD/L})$ when $L \geq m$, which matches the lower bound of any prefetching algorithm with $L$-block lookahead. Tight bounds for the remaining ranges of lookahead are also presented. In addition we show that L-OPT is the optimal offline algorithm: when the lookahead consists of the entire reference string, it performs the absolute minimum possible number of I/Os. Finally, we show that L-OPT is comparable with the best online algorithm with the same amount of lookahead; the ratio of the length of its schedule to the length of the optimal schedule is always within a constant factor.
EvoLens: Lens-View Visualizations of Evolution Data
Authors: Jacek Ratzinger, Michael Fischer, Harald Gall
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

Visualizing software evolution is essential for identifying design erosion that has occurred over the past releases. Making evolutionary aspects explicit via visual representations can help the engineer to focus on particular software parts to identify such hot-spots. Although many tools exist that provide zooming-in and -out within the hierarchical decomposition of a software system, only very few allow an engineer to view a system through a kind of lens view. Our approach called EvoLens is a visualization approach for explorations of evolution data across multiple dimensions. EvoLens is based on temporal lens views. But the graphical representation of this visualization integrates enhanced zooming by navigating through software hierarchies with arbitrary selectable groups of software parts across module or package boundaries. EvoLens allows an engineer to define a focal point for the lens view and navigate along the time dimension by user-defined sliding time windows. The comprehension is supported by using color for metrics of classes. The EvoLens prototype tool has been developed and tested on basis of a large Java application consisting of 580 000 LOC that was studied over 18 months of its evolution lifetime.