ppxscal/embedding_network huggingface dataset:
Numerical Simulations of Explosive Blast Pressures During Wall Breaching
Authors: Stephen Akers, Jay Ehrgott, Denis Rickman
Venue: Proceedings of the HPCMP Users Group Conference (2006)

During the past several years, the US Army has focused considerable attention toward developing improved methods for breaching walls and determining weapon-target interaction effects from direct- and indirect-fire weapons in the urban combat environment. A major thrust area is centered on developing methods for predicting the blast and fragmentation environment behind a breached wall. This information is important to the warfighter in terms of recognizing the expected impact on both enemy combatants, and non-combatants or friendly forces. One impediment to this effort is that little data exist to document the behind-wall blast environment produced by the detonation of explosives against or within walls. As part of the Army's effort, the US Army Engineer Research and Development Center (ERDC) is conducting experimental and numerical investigations to improve wall breaching methods. In the experimental and numerical programs, the ERDC will conduct comprehensive research on a full range of urban construction materials. As a first step in this process, the ERDC conducted a baseline study of C-4 breaching effectiveness against steel-reinforced-concrete (RC) walls. A goal of this effort was to better define the behind wall blast environment produced by various C-4 charges placed in contact with RC walls. Numerical simulations of selected experiments were conducted using the coupled Eulerian-Lagrangian code Zapotec. In these simulations, the concrete and reinforcing steel were modeled as Lagrangian materials, and the C-4 and air were modeled as Eulerian materials.
Blind speech separation of moving speakers in real reverberant environments
Authors: A. Koutvas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper we present a new on-line blind signal separation method capable to separate convolutive speech signals of moving speakers in highly reverberant rooms. The separation network used is a recurrent network which performs separation of convolutive speech mixtures in the time domain, without any prior knowledge of the propagation media, based on the maximum likelihood estimation (MLE) principle. The proposed method proved to be able to improve significantly (more than 10% in all adverse mixing situations) the performance of a continuous phoneme-based speech recognition system and therefore can be used as a front-end to separate simultaneous speech of speakers who are moving in arbitrary directions in reverberant rooms.
Partial content distribution on high performance networks
Authors: Eric H. Weigle, Andrew A. Chien
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

We present and analyze techniques to efficiently solve the partial content distribution problem-distributing a logical data set to receivers which individually desire only subsets of the total data. This is a more general and fundamentally different problem than traditional whole-file content distribution; providing new challenges and new optimization opportunities. It supports a wider variety of use models, e.g., striped file transfer, scatter/gather, or distributed editing. This work develops new metadata management and transfer scheduling techniques providing good results on high performance networks. Distributed applicationsin such systems tend to have data requirements more complicated than just total overlap at every node: transfers desired differ dramatically from whole-file content distribution. Traditional approaches perform poorly in such cases. We provide empirical data exhibiting these limitations, evaluate a new BitTorrent-based implementation of our ideas, and show order of magnitude improvements in bandwidth and latency.
"game_of_life": interactive art installation using eye-tracking interface
Authors: Mika Satomi, Christa Sommerer
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In the field of new media art, HCI techniques are often used to let spectators interact with the artwork itself. In the interactive art installation "game_of_life" an eye-tracking interface is used by the spectators. The installation tries to merge the unique experience of the eye-tracking interface with an interactive art expression.
Reval: a tool for real-time evaluation of DDoS mitigation strategies
Authors: Rangarajan Vasudevan, Z. Morley Mao, Oliver Spatscheck, Jacobus van der Merwe
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

There is a growing number of DDoS attacks on the Internet, resulting in significant impact on users. Network operators today have little access to scientific means to effectively deal with these attacks in real time. The need of the hour is a tool to accurately assess the impact of attacks and more importantly identify feasible mitigation responses enabling real-time decision making. We designed and implemented Reval, a tool that reports DDoS attack impact in real time, scaling to large networks. This is achieved by modeling resource constraints of network elements and incorporating routing information. We demonstrate the usefulness of the tool on two real network topologies using empirical traffic data and examining real attack scenarios. Using data from a tier-1 ISP network (core, access and customer router network) of size in excess of 60000 nodes, Reval models network conditions with close to 0.4 million traffic flows in about 11 seconds, and evaluates a given mitigation deployment chosen from a sample set in about 35 seconds. Besides real-time decision support, we show how the simulator can also be used in longer term network planning to identify where and how to upgrade the network to improve network resilience. The tool is applicable for networks of any size and can be used to analyze other network anomalies like flash crowds.
PARSA: A Parallel Program Scheduling and Assessment Environment
Authors: Behrooz Shirazi, Krishna Kavi, A. R. Hurson, Prasenjit Biswas
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Efficient partitioning and scheduling of parallel programs and the distribution of data among pmessing elements are very important issues in parallel and distributed systems. Existing tools fdl short in addressing the issues satisfactorily. On one hand, it is believed to k unreasonable to leave the burden of these complex tasks to the programmers. On the other hand, fully automated schedulers have ken shown to be d little practical significance, or suitable only for restricted cases. In this paper we address the issues and algorithms for efficient partitioning and scheduling d parallel programs, including the distribution of data, in dislributed-memory multiprocessor systems, using the PARSA parallel software development environment. PARSA consists of a set of visual, interactive, compiletime tools that will provide automated program partitions and schedules whenever possible, while permitting the user to exert conml over these operations for a htter performance. The support program assessment tool provides the users the opportunity b fine-tune the program and achieve their performance objectives.
PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers
Authors: T Srinivasan, D Vijayalakshmi, A A. Azeezunnisa
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when router traffic increases or when employed for IPv6 address lookup. Our paper describes a novel Parallel Ternary Search based Prefix Matching (PTSPM) scheme with reduced collision for IPv6 routers. This approach employs Multiple Hashing on reduced number of hash tables on which Parallel Ternary Search (PTS) on levels is applied. This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups. The approach we describe is fast, simple, scalable, parallelizable, and flexible.
Development of a New Method for Data Mining Based Rough Set Theory
Authors: Jianjun Hao, Huiping Li, Jihua Huang, Jiangang Zhang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In the paper, a kind of expanding model of Rough Set, which is with membership grade degree and contribution was presented after lucubrating the deficiencies of the theory of traditional Rough Set. In this model, the information system with membership grade and contribution, the processing of noises, similar space partition, the dependency grade calculation of decision attribute on condition one, attribute reduction algorithm, mining process of interconnected rule were discussed.
Time-varying noise compensation using multiple Kalman filters
Authors: P. Ramesh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The environmental conditions in which a speech recognition system should be operating are usually nonstationary. We present an approach to compensate for the effects of time-varying noise using a bank of Kalman filters. The presented method is based on the interacting multiple model (IMM) technique well-known in the area of multiple target tracking. Moreover, we propose a way to get fixed-interval smoothed estimates for the environmental parameters. The performances of the proposed approaches are evaluated in the continuous digit recognition experiments where not only the slowly evolving noise but also the rapidly varying noise sources are added to simulate the noisy environments. 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
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
Authors: Yunpeng Pan, Leyuan Shi
Venue: Mathematical Programming: Series A and B (2007)

New observations are made about two lower bound schemes for single-machine min-sum scheduling problems. We find that the strongest bound of those provided by transportation problem relaxations can be computed by solving a linear program. We show the equivalence of this strongest bound and the bound provided by the LP relaxation of the time-indexed integer programming formulation. These observations lead to a new lower bound scheme that yields fast approximation of the time-indexed bound. Several techniques are developed to facilitate the effective use of the new lower bound in branch-and-bound. Numerical experiments are conducted on 375 benchmark problems of the total weighted tardiness problem from OR-Library. Results obtained with our new method are spectacular; we are able to solve all 125 open problems to optimality.
Why Johnny can't encrypt: a usability evaluation of PGP 5.0
Authors: Alma Whitten, J. D. Tygar
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

User errors cause or contribute to most computer security failures, yet user interfaces for security still tend to be clumsy, confusing, or near-nonexistent. Is this simply due to a failure to apply standard user interface design techniques to security? We argue that, on the contrary, effective security requires a different usability standard, and that it will not be achieved through the user interface design techniques appropriate to other types of consumer software. To test this hypothesis, we performed a case study of a security program which does have a good user interface by general standards: PGP 5.0. Our case study used a cognitive walkthrough analysis together with a laboratory user test to evaluate whether PGP 5.0 can be successfully used by cryptography novices to achieve effective electronic mail security. The analysis found a number of user interface design flaws that may contribute to security failures, and the user test demonstrated that when our test participants were given 90 minutes in which to sign and encrypt a message using PGP 5.0, the majority of them were unable to do so successfully. We conclude that PGP 5.0 is not usable enough to provide effective security for most computer users, despite its attractive graphical user interface, supporting our hypothesis that user interface design for effective security remains an open problem. We close with a brief description of our continuing work on the development and application of user interface design principles and techniques for security.
Tree houses and real houses: research and commercial software
Authors: Susan LoVerso, Margo Seltzer
Venue: Proceedings of the 2nd conference on Industrial Experiences with Systems Software - Volume 2 (2002)

Sleepycat Software develops and supports the Open Source software product Berkeley DB, the most widely deployed embedded database software in the world. Berkeley DB originated at the University of California, Berkeley, and in this paper, we discuss the differences between research software and a quality commercial product. Over the past years we have acquired an education in configuration, portability, and testing. The key message is that code quality, a willingness to rewrite or discard code when necessary, rigorous adherence to internal standards, and constant policing of ourselves are the key requirements of quality software.
A Preliminary Comparative Study on the Expressive Power of Reo and Linda
Authors: Silvia Amaro, Ernesto Pimentel, Ana M. Roldan
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Component-based Software Development is an emerging discipline in the field of Software Engineering. In this context, coordination languages may be used to specify the interactive behavior of software components, and most of the proposals presented in the literature are based on shared data-space models, as Linda. On the other hand, a new model for coordination based on communication channels (Reo) is also emerging, and we argue it also can be used to describe component protocols in a very elegant way. Making a comparative analysis on the expressiveness of this channel based model and Linda is the main objective of the present work, which presents a first step to make an exhaustive formal study. Thus, in this paper we provide a couple of modular embeddings for the synchronous case and the asynchronous case by defining a common formalism in order to allow the comparison of both models at an homogeneous level of abstraction. We hope these results will help us to develop a complete study about the Reo's expressiveness, and to define an interaction description language based on Reo for component coordination, as it has already made in the context of Linda.
Neither Here nor There: Knowledge Sharing and Transfer with Proactive Structuration
Authors: Terri L. Griffith, Mark A. Fuller, Gregory B. Northcraft
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information technologies hold great promise in their ability to link distributed workers, allowing organizations to take advantage of the potential benefits of effectively gathering knowledge without regard to geographic boundaries. This can be advantageous for an organization's overall capabilities, given that employing workers from diverse backgrounds can increase an organization's knowledge base. Paradoxically, these technologies may also serve to dampen knowledge sharing, unless proactively managed. This paper extends work on Adaptive Structuration Theory and sensemaking to develop the concept of Proactive Structuration. We explain how organizations and teams can proactively manage distributed work arrangements to best position the team to take advantage of knowledge sharing for enhanced performance.
Fuzzy vector partition filtering technique for color image restoration
Authors: Zhonghua Ma, Hong Ren Wu, Dagan Feng
Venue: Computer Vision and Image Understanding (2007)

A fuzzy vector partition filter is proposed for real color image restoration applications. The filter utilizes the fuzzy ranking technique in the vector partition filtering framework to address a variety of noise corruptions in natural color images. The information of the local sample spread is tracked by the fuzzy ranking through its adaptive fuzzy sample similarity function. The non-stationary statistics of the color image is overcome by partitioning the image into a finite set of underlying local image structures and by applying an optimized nonlinear filter to restore each of the partitions accordingly. The proposed filter has been evaluated using various simulated and real-life noisy images. The results achieved by the filter are comparable to the prior-art methods specially designed for the underlying noise corruption, in terms of standard objective measurements and the subjective picture quality.
Forth & small systems report
Authors: Paul Frenger
Venue: ACM SIGPLAN Notices (2007)

In July 2005 I ran across an ad in Electronic Products [1] for an optical mouse sensor by Agilent Technologies. Like many people, I find using an optical mouse to be superior to the old ball-in-a-cage type mouse (which I first saw demonstrated on the Xerox Star workstation at the National Computer Conference in Dallas, June 1976). Inevitably, I was curious to learn what makes it tick (or "squeak") ... that's my Tinkertoy&reg; mentality at work. I clipped the article, filed it and totally forgot about it until recently.
Utilizing higher order statistics of packet interarrival times for bottleneck detection
Authors: P. Varga, G. Kun
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

This paper introduces a new approach for determining bottleneck link locations in a network. The considered measurement model is passive monitoring of a backbone link. We analyze the properties of packet interarrival time (PIT) distribution functions of network segments and make decisions whether the extracted properties of a link suggest bottleneck behavior or not. The correlation between bottleneck behavior and packet interarrival time distribution is demonstrated through simulations featuring tighter and tighter bottleneck connections. Locating shared bottlenecks with passive monitoring requires effective metrics for distinguishing seriously congested links from normal or underutilized connections. The current paper presents the third and fourth central moments (skewness and kurtosis, respectively) of PIT distribution as possible and promising metrics for bottleneck detection. According to the simulation results, kurtosis of PITs is found to be a powerful measure of bottleneck behavior. This is further validated by investigation of real measurement data.
On Maximizing Provider Revenue in Market-Based Compute Grids
Authors: Vladimir Marbukh, Kevin Mills
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Market-based compute grids encompass service providers offering limited resources to potential users with varying demands and willingness to pay. Providers face difficult decisions about which jobs to admit and when to schedule admitted jobs. For this reason, researchers investigate various heuristics for admission control and scheduling that aim to yield high revenue for providers. Such research has no framework within which to understand the revenue bounds associated with various workloads. This paper proposes a tractable analytical model for joint optimization of job admission and scheduling strategies aimed at provider revenue maximization. We show how solving this model yields maximum provider revenue given a linear user utility function. Our model can be used to understand the operating limits of heuristics for admission control and scheduling, and can also be used to investigate the implication of varying job.
OCALA: an architecture for supporting legacy applications over overlays
Authors: Dilip Joseph, Jayanth Kannan, Ayumu Kubota, Karthik Lakshminarayanan, Ion Stoica, Klaus Wehrle
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

In order for overlays and new network architectures to gain real user acceptance, users should be able to leverage overlay functionality without any modifications to their applications and operating systems. We present our design, implementation, and experience with OCALA, an overlay convergence architecture that achieves this goal. OCALA interposes an overlay convergence layer below the transport layer. This layer is composed of an overlay independent sub-layer that interfaces with legacy applications, and an overlay dependent sub-layer that delivers packets to the overlay. Unlike previous efforts, OCALA enables: (a) simultaneous access to multiple overlays (b) communication between hosts in different overlays (c) communication between overlay hosts and legacy hosts (d) extensibility, allowing researchers to incorporate their overlays into OCALA. We currently support five overlays, i3, RON, HIP, DOA and OverDoSe on Linux, Windows XP/2000 and Mac OS X. We (and a few other research groups and end-users) have used OCALA for over a year with many legacy applications ranging from web browsers to remote desktop applications.
XML as the articulation between information retrieval and multimedia in a musical heritage dissemination
Authors: Rodolphe Bailly
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The Cité de la musique in Paris has recently opened a new media Library. One of the Library's assignments is the dissemination of the Cité de la musique's collection of recorded concerts. This paper presents the concert's description model implemented into the MARC Catalogue and emphasizes the central position in the library information system architecture of automatically generated XML representations of each concert.
iSEE: Efficient Continuous K-Nearest-Neighbor Monitoring over Moving Objects
Authors: Wei Wu, Kian-Lee Tan
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

In this paper, we propose iSEE, a set of algorithms for efficient processing of continuous k-nearest-neighbor (CKNN) queries over moving objects. iSEE utilizes a grid index and incrementally updates the queries' results based on moving objects' explicit location update messages. We have three innovations in iSEE: a Visit Order Builder (VOB) method that dynamically constructs a query's optimal visit order to the cells in the grid index with low cost, an Efficient Expand (EFEX) algorithm which avoids unnecessary and redundant searching when updating a query's result, and an efficient algorithm that quickly identifies the cells that should be updated after a query's result is changed. Experimental results show that iSEE achieves a 2X speedup, when compared with the state-of-the-art CPM scheme.