ppxscal/embedding_network huggingface dataset:
Macroprogramming heterogeneous sensor networks using cosmos
Authors: Asad Awan, Suresh Jagannathan, Ananth Grama
Venue: ACM SIGOPS Operating Systems Review (2007)

In this paper, we present COSMOS, a novel architecture for macroprogramming heterogeneous sensor network systems. Macroprogramming specifies aggregate system behavior, as opposed to device-specific programs that code distributed behavior using explicit messaging. COSMOS is comprised of a macroprogramming language, mPL, and an operating system, mOS. mPL macroprograms are statically verifiable compositions of reusable user-specified, or system supported functional components. The mOS node/network operating system provides component management and a lean execution environment for mPL programs in heterogeneous resource-constrained sensor networks. It provides runtime application instantiation, with over-the-air reprogramming of the network. COSMOS facilitates composition of complex real-world applications that are robust, scalable and adaptive in dynamic data-driven sensor network environments. An important and novel aspect of COSMOS is the ability to easily extend its component basis library to add rich macroprogramming abstractions to mPL, tailored to domain and resource constraints, without modifications to the OS. Applications built on COSMOS are currently in use at the Bowen Labs for Structural Engineering, in Purdue University, for high-fidelity structural monitoring. We present a detailed description of the COSMOS architecture, its various components, and a comprehensive experimental evaluation using macro- and micro- benchmarks to demonstrate performance characteristics of COSMOS.
Wavelet-based Light Reconstruction from a Single Image
Authors: Cameron Upright, Dana Cobzas, Martin Jagersand
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper we propose a wavelet-based light representation. This representation is used for recovering illumination and reflectance of a scene with known geometry from a single calibrated image. Previous approaches of light estimation reconstruct either a discrete set of infinite light sources or the projection of light on the spherical harmonics basis. The first approach is more suitable for modeling sharp light effects while the second one works best for diffuse scenes. In contrast, we show that the proposed representation is suitable for both diffuse and specular scenes. We compared our technique with the two previously mentioned approaches and found it superior. In addition to illumination estimation our algorithm also estimates a Phong surface reflection. Experiments with synthetic and real scenes demonstrate the effectiveness of our method.
Mining a Change-Based Software Repository
Authors: Romain Robbes
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Although state-of-the-art software repositories based on versioning system information are useful to assess the evolution of a software system, the information they contain is limited in several ways. Versioning systems such as CVS or SubVersion store only snapshots of text files, leading to a loss of information: The exact sequence of changes between two versions is hard to recover. In this paper we present an alternative information repository which stores incremental changes to the system under study, retrieved from the IDE used to build the software. We then use this changebased model of system evolution to assess when refactorings happen in two case studies, and compare our findings with refactoring detection approaches on classical versioning system repositories.
Improved utilisation in IP networks using multiple path routing
Authors: D. Platt
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper considers routing in an IP network running a routing protocol such as OSPF It takes as a benchmark a routing scheme. which computes a single lowest cost path between every source/destination pair. It proposes two more schemes which each generate two routes for each source/destination pair. The second scheme uses the present lowest cost route and the previous lowest cost route, different from the present one. The third scheme uses the present lowest cost route and re-computes a route by removing all the links used in the first route and using the Dijkstra algorithm. A number of tests are carried out on simulated networks to determine the throughput and stability of each scheme. It is found that the third scheme produces the best results. followed by the second and then the first. It is also found that the benefit of these schemes is only worthwhile when the number of nodes in the network is low. 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
Evaluation Framework of Location Privacy of Wireless Mobile Systems with Arbitrary Beam Pattern
Authors: Ford Long Wong, Min Lin, Shishir Nagaraja, Ian Wassell, Frank Stajano
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Position localization of transmitters can be carried out by an adversary owning a network of pervasive receivers, which can pinpoint the victim mobile nodes' locations with high temporal and spatial accuracy, such that pseudonym changing and higher-layer obfuscation are insufficient to protect their location privacy. Our contribution is to consider covert beam patterns, generated using multiple antennas to do adaptive beamforming, and so reducing radio signature. We architect such a privacy-enhancing system, give an informal security analysis, and develop an evaluation framework to analyze its location privacy. We performed simulations using wireless LAN parameters, and found that signal-to-noise-ratios for successful direction-finding are more stringent than those required for mere communications. We composed an end-to-end integrated radio and mobility simulation, and compared location privacy performance of omnidirectional versus adaptive beamforming antennas. Our proposal is shown to perform better. In addition, our evaluation framework is flexible and extensible.
Arriclides: An Architecture Integrating Clinical Decision Support Models
Authors: Kris Verlaene, Wouter Joosen, Pierre Verbaeten
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper, we present an open architecture that enables the coexistence of and the collaboration between different and heterogeneous clinical decision support models. Clinical decision support can be (and has been) built starting from complementary knowledge representation models, for instance rule-based representations or workflow models to mention just a few. Each model can contribute to the quality and effectiveness of an overall clinical decision support system. Our architecture, Arriclides, enables the integration of a set of representative and quite different models. An evaluation of our prototype implementation shows that such an integration has been achieved while preserving performance and scalability.
A new adaptive algorithm for stereophonic acoustic echo canceller
Authors: Yang-Won Jung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Stereophonic sound becomes more important in a growing number of hands-free applications where spatial realism is demanded. Such hands-free systems need stereophonic acoustic echo cancellers to reduce echoes that result from coupling between loudspeakers and microphones. In this paper, we propose a new adaptive algorithm for an stereophonic acoustic echo canceller based on human auditory properties and affine projection (AP) algorithm. The proposed algorithm employs a pre-processor generating speech-like noise to decorrelate the input signals without degrading perceptual speech quality. The decorrelation is based on the masking patterns of the human auditory system. By showing that the AP algorithm can be represented by a vector update as a combination of the Gram-Schmidt (GS) orthogonalization followed by the normalized LMS (NLMS) algorithm, the proposed adaptive algorithm integrates the pre-processor into the adaptive algorithm. Subjective listening test and computer simulation show the effectiveness of the proposed algorithm.
Reliability and Defect Tolerance in Metallic Quantum-dot Cellular Automata
Authors: Mo Liu, Craig S. Lent
Venue: Journal of Electronic Testing: Theory and Applications (2007)

The computational paradigm known as quantum-dot cellular automata (QCA) encodes binary information in the charge configuration of Coulomb-coupled quantum-dot cells. Functioning QCA devices made of metal-dot cells have been fabricated and measured. We focus here on the issue of robustness in the presence of disorder and thermal fluctuations. We examine the performance of a semi-infinite QCA shift register as a function of both clock period and temperature. The existence of power gain in QCA cells acts to restore signal levels even in situations where high speed operation and high temperature operation threaten signal stability. Random variations in capacitance values can also be tolerated.
Social Factors Relevant to Capturing Design Decisions
Authors: Carmen Zannier, Frank Maurer
Venue: Proceedings of the Second Workshop on SHAring and Reusing architectural Knowledge Architecture, Rationale, and Design Intent (2007)

We present results from a qualitative study of design decision making that used interviews, observations and participatory observations to describe inherent traits of software design decision makers. We find that designers do not always strive for optimal design solutions, that designers do not always consider alternatives when making design decisions, and that alternatives are considered more often in groups of people having a casual conversation. We highlight that tool support for capturing design rationale and intent should first recognize the way decisions are inherently made in software environments and we provide a summary of our results as an indicator of requirements for such tools.
Efficient Use of Dynamically tagged Directories Through Compiler Analysis
Authors: Trung N. Nguyen, Zhiyuan Li', David J. Lilja
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Dynamiically tagged directories have been recently proposed as a memory-efficient mechanism for maintaining cache coherence in large-scale shared-memory multiprocessors. In order to efficiently use these directories, the number of pointer operations must be minimized and pointers should be allocated as late as possible. If pointers are allocated too early, frequent pointer overflow will occur, which in turn may cause cache thrashing.
An Information Model for Security Integration
Authors: Hassan Rasheed, Randy Y. C. Chow
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

Research on security systems has typically focused on improving the performance and reliability of a single technique, algorithm or mechanism. There is also significant potential, however, in studying security as the product of a few key systems and then analyzing how those systems can best be integrated to achieve better overall system security. Most approaches that examine integrating one or more security mechanisms have focused on a specific implementation strategy. A systematic approach to integrated system security requires an analysis of the data relationships between all of the major mechanisms leading to a model that describes and relates all of the major elements in the domain. This paper proposes a information model for integrating access control, intrusion detection and intrusion response to enhance overall system security.
Efficiently Mining Maximal 1-complete Regions from Dense Datasets
Authors: Haiyun Bian, Raj Bhatnagar
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

We propose a new search algorithm for maximal 1-complete regions in high dimensional dense binary datasets. A maximal 1-complete region indicates a poten- tial functional cluster, and it is mathematically equivalent to a formal concept and also a closed itemset. Our algo- rithm is designed for dense datasets, where the percentage of 1's in the dataset is higher than 10%, and the total num- ber of maximal 1-complete regions is much larger than the number of objects in the dataset. Our algorithm is memory efficient and unlike other closed set mining algorithms, it does not require all patterns mined so far to be kept in the memory. We show that our algorithm has solid theoretical foundations, and it is also very time efficient compared with other existing algorithms.
Learning, detection and representation of multi-agent events in videos
Authors: Asaad Hakeem, Mubarak Shah
Venue: Artificial Intelligence (2007)

In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in videos. The proposed approach has three main steps. First, in order to learn the event structure from training videos, we automatically encode the sub-event dependency graph, which is the learnt event model that depicts the conditional dependency between sub-events. Second, we pose the problem of event detection in novel videos as clustering the maximally correlated sub-events using normalized cuts. The principal assumption made in this work is that the events are composed of a highly correlated chain of sub-events that have high weights (association) within the cluster and relatively low weights (disassociation) between the clusters. The event detection does not require prior knowledge of the number of agents involved in an event and does not make any assumptions about the length of an event. Third, we recognize the fact that any abstract event model should extend to representations related to human understanding of events. Therefore, we propose an extension of CASE representation of natural languages that allows a plausible means of interface between users and the computer. We show results of learning, detection, and representation of events for videos in the meeting, surveillance, and railroad monitoring domains.
Providing tunable consistency for a parallel file store
Authors: Murali Vilayannur, Partho Nath, Anand Sivasubramaniam
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Consistency, throughput, and scalability form the backbone of a cluster-based parallel file system. With little or no information about the workloads to be supported, a file system designer has to often make a one-glove-fits-all decision regarding the consistency policies. Taking a hard stance on consistency demotes throughput and scalability to second-class status, having to make do with whatever leeway is available. Leaving the choice and granularity of consistency policies to the user at open/mount time provides an attractive way of providing the best of all worlds. We present the design and implementation of such a file-store, CAPFS (Content Addressable Parallel File System), that allows the user to define consistency semantic policies at runtime. A client-side plug-in architecture based on user-written plug-ins leaves the choice of consistency policies to the end-user. The parallelism exploited by use of multiple data stores provides for bandwidth and scalability. We provide extensive evaluations of our prototype file system on a concurrent read/write workload and a parallel tiled visualization code.
A framework for providing redundancy and robustness in key management for ipsec security associations in a mobile ad-hoc environment
Authors: Nathaniel J. Davis,  IV
Venue:  (2005)

This research investigated key management in a Mobile Ad Hoc Network (MANET) environment. At the time this research began key management schemes provided limited functionality and low service availability in a highly partitioned ad hoc environment. The purpose of this research was to develop a framework that provides redundancy and robustness for Security Association (SA) establishment between pairs of nodes. The key contribution of this research is the Key Management System (KMS) framework and, more specifically, the unique way the various components are integrated to provide the various functionalities. The KMS overcomes the limitations of previous systems by (1) minimizing pre-configuration, (2) increasing service availability, (3) and increasing flexibility for new nodes joining the network. A behavior grading scheme provides the network with a system-wide view of the trustworthiness of nodes and enables the KMS to dynamically adjust its configuration according to its environment. The introduction of behavior grading allows nodes to be less dependent on strict identity verification. This KMS was simulated with Monte Carlo and NS2 simulations and was shown to interoperate with IP Security (IPsec) to enable the establishment of IPsec SAs. The simulations have proven the effectiveness of the system in providing service to the nodes in a highly partitioned environment.
A geometric approach to finding new lower bounds of A(n, d, w)
Authors: I. Gashkov, J. A. Ekberg, D. Taub
Venue: Designs, Codes and Cryptography (2007)

Certain classes of binary constant weight codes can be represented geometrically using linear structures in Euclidean space. The geometric treatment is concerned mostly with codes with minimum distance 2(w ¿ 1), that is, where any two codewords coincide in at most one entry; an algebraic generalization of parts of the theory also applies to some codes without this property. The presented theorems lead to several improvements of the tables of lower bounds on A(n, d, w) maintained by E. M. Rains and N. J. A. Sloane, and the ones recently published by D. H. Smith, L. A. Hughes and S. Perkins. Some of these new codes can be proven optimal.
Economics of ethernet over SONET&#x002F;SDH: Research Articles
Authors: Jim Borger, Alina Ionescu-Graff, Samrat Kulkarni, Narayan Raman
Venue: Bell Labs Technical Journal (2007)

Ethernet provides a simple, cost-effective solution for transporting enterprise data applications that is fast replacing traditional private line and frame relay services. However, carrier-class Ethernet architecture is still evolving and transport vendors need a flexible architecture that provides a hedge against the timing and extent of migration to Ethernet. Ethernet over Synchronous Optical Network (SONET) provides a viable architecture that allows service providers to start offering Ethernet service without overcommitting themselves, while protecting their embedded base. This paper presents an economic evaluation of Ethernet-over-SONET architecture based on a number of scenarios that serve as building blocks for service provider network transformation. We construct a business model that evaluates the various alternative strategies available to the service provider to address bandwidth demand growth and simultaneous migration from legacy to Ethernet services. &copy; 2007 Alcatel-Lucent.
On-wafer electro-mechanical characterization of silicon MEMS switches
Authors: L. Lorenzelli, K. J. Rangra, C. Collini, F. Giacomozzi, B. Margesin
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The feasibility of integrating the RF MEMS switches in space and wireless communication systems has generated tremendous interest in related design, fabrication and characterization methodologies. The space applications make long term reliability of the devices a very pertinent issue and involves both the process and device characterization. In this paper we describe the experimental setup and measurement results on RF MEMS switches fabricated for DC to 30 GHz applications. The on-wafer experimental setup, based on standard manual microprobe station provides dual pulse actuation voltage waveforms with programmable period and amplitude, ranging from 10/sup -5/ to 1 sec and 0-200 volts respectively. The usefulness of the dual-pulse testing is demonstrated by the minimal charge generation in the dielectric layer and capacitance measurements with negligible variations over long measurement periods.
Dynamic, expressive speech animation from a single mesh
Authors: Kevin Wampler, Daichi Sasaki, Li Zhang, Zoran Popović
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

In this work we present a method for human face animation which allows us to generate animations for a novel person given just a single mesh of their face. These animations can be of arbitrary text and may include emotional expressions. We build a multilinear model from data which encapsulates the variation in dynamic face motions over changes in identity, expression, and over different texts. We then describe a synthesis method consisting of a phoneme planning and a blending stage which uses this model as a base and attempts to preserve both face shape and dynamics given a novel text and an emotion at each point in time.
Robust facial feature tracking under varying face pose and facial expression
Authors: Yan Tong, Yang Wang, Zhiwei Zhu, Qiang Ji
Venue: Pattern Recognition (2007)

This paper presents a hierarchical multi-state pose-dependent approach for facial feature detection and tracking under varying facial expression and face pose. For effective and efficient representation of feature points, a hybrid representation that integrates Gabor wavelets and gray-level profiles is proposed. To model the spatial relations among feature points, a hierarchical statistical face shape model is proposed to characterize both the global shape of human face and the local structural details of each facial component. Furthermore, multi-state local shape models are introduced to deal with shape variations of some facial components under different facial expressions. During detection and tracking, both facial component states and feature point positions, constrained by the hierarchical face shape model, are dynamically estimated using a switching hypothesized measurements (SHM) model. Experimental results demonstrate that the proposed method accurately and robustly tracks facial features in real time under different facial expressions and face poses.
Probabilistic Self-Adaptation of Nanoscale CMOS Circuits: Yield Maximization under Increased Intra-Die Variations
Authors: Maryam Ashouei, Muhammad M. Nisar, Abhijit Chatterjee, Adit D. Singh, Abdulkadir U. Diril
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

As technology scales to 40nm and beyond, intra-die process variability will cause large delay and leakage variations across a chip in addition to expected die-to-die variations. In this paper, a new approach to post-manufacture circuit adaptation for yield maximization is proposed with special focus on the projected large intra-die variability of future CMOS technologies. Adaptation is achieved through an iterative implicit delay test (IDT) and reconfiguration procedure. The IDT is used to assess the timing of the circuit every time it is reconfigured until the best (with the lowest leakage) configuration, achievable within a specified reconfiguration time, is obtained. Since accurate delay testing is not possible at each step of the reconfiguration process, statistical correlation-based methods are used to determine the circuit timing. Reconfiguration is achieved by activating programmable gates that can be switched from a low-speed/low-leakage mode to a high-speed/high-leakage mode under digital control. The circuitry for self-adaptation is very simple, no external tester support is necessary and results show that a significant yield improvement is possible.