ppxscal/embedding_network huggingface dataset:
A Semantic Approach to Enhance Service Composition in Workflows that use Mobile Services
Authors: Robert B. Piotter, T Kirkham, J Gallop, I Johnson, D Mac Randal, B Ritchie
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The successful execution of workflows using mobile services is dependant on the services behaving as expected. The management of this behaviour in Akogrimo is achieved by a context management framework bridging both the network and Grid Middleware. The quality of the information that passes over this link is essential to the whole Akogrimo application. In order to ensure relevant and specific context information is used in Akogrimo the development of mechanism to aid network to middleware service to service understanding is essential. In creating such a mechanism the concept of self similarity in creating understanding between services is essential. The challenges and issues when applying this process to Akogrimo's unique mix of services are discussed in this paper.
Drinking from the firehose: multicast USENET news
Authors: Kurt Lidl, Josh Osborne, Joseph Malcolm
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

News transport and spooling systems of the last several years have concentrated on decreasing the resource load on news servers. One beneficial side effect has been the average decrease in time that a news system spends on a given article. This paper describes a novel USENET news transport protocol, which we call Muse. The two major motivations behind Muse are to reduce the average propagation delays of articles on USENET and to further reduce the resource load on a centralized news server. Muse runs on top of the experimental Internet multicast backbone, commonly referred to as the Mbone. Major design and implementation issues are discussed. Security concerns of multicast news are discussed and our solution is examined. The problems of scaling news distribution to thousands of hosts are also addressed.
On the Effect of Scale-Free Structure of Network Topology on End-to-End Performance
Authors: Hiroyuki Ohsaki, Koutaro Yagi, Makoto Imase
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

In recent years, it has been reported that several existing networks including the Internet have scale-free structure. In this paper, through a simple numerical analysis, we investigate effect of the scale-free structure of communication networks on their end-to-end performance. As network topologies, a random network and a scale-free network with the equal number of nodes and the equal number of links are used. We compare end-to-end performance of flows (i.e., throughput) in both random and scale-free networks. Consequently, we show that when the average degree of a network is small (i.e., whah the number of links is small), a scale-free network shows better end-to-end performance. On the contrary, when the average degree of a network is large (i.e., when the number of links is large), we show that a random network shows better end-to-end performance.
On resolvability of Steiner systems S(v = 2m, 4, 3) of rank r ≤ v - m + 1 over $$\mathbb{F}_2 $$
Authors: V. A. Zinoviev, D. V. Zinoviev
Venue: Problems of Information Transmission (2007)

Two new constructions of Steiner quadruple systems S(v, 4, 3) are given. Both preserve resolvability of the original Steiner system and make it possible to control the rank of the resulting system. It is proved that any Steiner system S(v = 2 m , 4, 3) of rank r ¿ v ¿ m + 1 over F2 is resolvable and that all systems of this rank can be constructed in this way. Thus, we find the number of all different Steiner systems of rank r = v ¿ m + 1.
Extensionality of Spatial Observations in Distributed Systems
Authors: Luís Caires, Hugo Torres Vieira
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observational equivalences may be characterized by spatial logics, including the composition and void operators. Our results support the claim that spatial observations do not need to be always considered intensional, even if expressive enough to talk about the structure of systems. For simplicity, our technical development is based on a minimalist process calculus, that already captures the main features of distributed systems, namely local synchronous communication, local computation, asynchronous remote communication, and partial failures.
Comparing memory systems for chip multiprocessors
Authors: Jacob Leverich, Hideho Arakida, Alex Solomatnikov, Amin Firoozshahian, Mark Horowitz, Christos Kozyrakis
Venue: ACM SIGARCH Computer Architecture News (2007)

There are two basic models for the on-chip memory in CMP systems:hardware-managed coherent caches and software-managed streaming memory. This paper performs a direct comparison of the two modelsunder the same set of assumptions about technology, area, and computational capabilities. The goal is to quantify how and when they differ in terms of performance, energy consumption, bandwidth requirements, and latency tolerance for general-purpose CMPs. We demonstrate that for data-parallel applications, the cache-based and streaming models perform and scale equally well. For certain applications with little data reuse, streaming scales better due to better bandwidth use and macroscopic software prefetching. However, the introduction of techniques such as hardware prefetching and non-allocating stores to the cache-based model eliminates the streaming advantage. Overall, our results indicate that there is not sufficient advantage in building streaming memory systems where all on-chip memory structures are explicitly managed. On the other hand, we show that streaming at the programming model level is particularly beneficial, even with the cache-based model, as it enhances locality and creates opportunities for bandwidth optimizations. Moreover, we observe that stream programming is actually easier with the cache-based model because the hardware guarantees correct, best-effort execution even when the programmer cannot fully regularize an application's code.
Estimation of sinusoids in audio signals using an analysis-by-synthesis neural network
Authors: G. Garcia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In this paper we present a new method for estimating the frequency, amplitude and phase of sinusoidal components in audio signals. An analysis-by-synthesis system of neural networks is used to extract the sinusoidal parameters from the signal spectrum at each window position of the short-term Fourier transform. The system attempts to find the set of sinusoids that best fits the spectral representation in a least-squares sense. Overcoming a significant limitation of the traditional approach in the art, preliminary detection and interpolation of spectral peaks is not necessary and the method works even when spectral peaks are not well resolved in frequency. This allows for shorter analysis windows and therefore better time resolution of the estimated sinusoidal parameters. Results have also shown robust performance in presence of high levels of additive noise, with signal-to-noise ratios as low as 0 dB. 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
Comparison between two hybrid HMM/MLP approaches in speech recognition
Authors: V. Fontaine
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We present and compare two different hybrid HMM/MLP approaches. The first one uses MLPs as labelers coupled with a discrete HMM while the second one takes advantage of the ability of MLPs trained as classifiers to estimate a posteriori probabilities. Both approaches bring sensible improvement compared with classical methods since they rid the system of some restrictive hypotheses inherent of pure HMM design (no time correlation between successive acoustic vectors, hypothesis on the probability distributions...). Our experiments have been achieved in order to provide quite fair comparisons. This implied that we used standard environment namely, standard software, standard databases including common training and test sets.
A Tk netscape plugin
Authors: Jacob Levy
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

I have built a plugin module for Tk, for Netscape Navigator. This module delivers Tk applications as elements of Web pages and it makes it possible to create web based applications that have a richer GUI than HTML. Tcl also makes building such applications easier due to its high level scripting nature, and Safe Tcl helps construct web applications that can safely perform interesting tasks such as communicating with local or remote resources. The demonstration will show how the plugin module works and some of its capabilities and limitations.
Register Sharing Verification During Data-Path Synthesis
Authors: C. Karfa, C. Mandal, D. Sarkar, Chris Reade
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The variables of the high-level specifications and the automatically generated temporary variables are mapped on to the data-path registers during data-path synthesis phase of high-level synthesis process. The registers in the data-path are usually shared by the variables and the mapping is not bijective as most of the high-level synthesis tools perform register optimization. In this paper, a formal methodology for verifying the correctness of register sharing is described. The input and the output of the data-path synthesis phase are represented as finite state machines with data-paths (FSMD). The method is based on checking equivalence of two FSMDs. Our technique is independent of the mechanism used for register optimization and works for both carrier and value based register optimization. The method also works for both data intensive and control intensive input specification. Our current implementation is integrated with an existing synthesis tool and has been tested for robustness.
More Than A Pencil: Using the Computer to Make Two-Dimensional Art
Authors: Blake Hurt
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

The history of art techniques in western art has been a march toward increasing the control, precision and speed of the artist. The arrival of the computer and its associated technology follows this tradition. By thinking of the computer as an agent, the range of detail that is possible is no longer limited by a person's physical ability and, therefore, new kinds of images are possible. The range of the machine's capability is illustrated by my own large digital portraits. Although pregnant with opportunity, there also exist drawbacks to the process that currently act as stumbling blocks to its widespread adoption.
An Analysis of Defect Detection for Weighted Random Patterns Generated with Observation/Excitation-Aware Partial Fault Targeting
Authors: Jennifer Dworak
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Fortuitous detection increases with multiple site observations and good excitation balance. However, this increases test data volume. We investigate weighted random patterns generated with partial fault targeting and show that they may be equally or more effective at fortuitous detection than an ATPG set with the same minimal site observations.
Computing the schirmer number on homogeneous spaces
Authors: Robert F. Brown
Venue:  (2006)

The main objective of this dissertation is to compute the Schirmer number N (F; X, A), or relative Nielsen number, on pairs of certain homogeneous spaces; specifically, tori, nilmanifolds, and model solvmanifolds. In order to compute N (F; X, A), we must first understand relative homotopy classes of selfmaps. To this end, we develop a relative analogue of a classical theorem concerning aspherical spaces: If (X, A) is a finite, connected CW pair and ( Y, B) is a pair of connected aspherical spaces, then two maps F, G: (X, A) &rarr; (Y, B) are homotopic rel A if and only if F &pi; = G&pi; and F| A&pi; = G|A &pi;. We define broad classes of pairs of tori and nilmanifolds: namely toral pairs and algebraic nilmanifold pairs. Given a selfmap F: (X, A) &rarr; (X, A) of a toral pair or algebraic nilmanifold pair., we show that Schirmer theory always reduces to Nielsen theory, in the sense that N(F; X, A) = N(F) or N( F; X, A) = N(F| A). We then compute the Schirmer number on model solvmanifold pairs and their diagonal type selfmaps. We find that these spaces and selfmaps often have interesting Schirmer theory, meaning max{ N(F), N(F| A)} < N(F; X, A) < N(F) + N( F|A).
Performance evaluation of a new fast path re-routing for intercluster handoff scheme in wireless ATM networks
Authors: J. Elbergali, N. Ventura
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Recently, a two-phase handoff protocol has been adopted to support the rerouting of the connection after inter-cluster handoff. It employs rapid path extension, followed by path optimization to establish the new connection. Since the extended path is longer than the original one, certain Quality of Service (QoS) requirements such as cell transfer delay and cell delay variation may not be guaranteed after handoff and depend largely on the speed of the optimization process service. In this paper, we propose an efficient and fast rerouting scheme. The reserved Permanent Virtual Channels (PVCs) are used in the first phase to avoid handoff latency and in the second phase the optimization process is triggered instantly, concurrently with other active connections. The main objective of our scheme is to minimize the route optimization delay such that the QoS parameters will not be affected. Both analytical and simulation models are presented to evaluate the overall system performance in terms of wired link resources and route optimization delay.
Finding presentations in recorded meetings using audio and video features
Authors: J. Foote
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper describes a method for finding segments in video-recorded meetings that correspond to presentations. These segments serve as indexes into the recorded meeting. The system automatically detects intervals of video that correspond to presentation slides. We assume that only one person speaks during an interval when slides are detected. Thus these intervals can be used as training data for a speaker spotting system. An HMM is automatically constructed and trained on the audio data from each slide interval. A Viterbi alignment then resegments the audio according to speaker. Since the same speaker may talk across multiple slide intervals the acoustic data from these intervals is clustered to yield an estimate of the number of distinct speakers and their order. This allows the individual presentations in the video to be identified from the location of each presenter's speech. Results are presented for a corpus of six meeting videos.
Efficient Component Labeling on SIMD Mesh Processors
Authors: Whanki Yong, Martin L. Brady
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

A new component labeling algorithm for SIMD meshes is presented whose time complexity is O(\frac{{n^2 }} {{p^2 }} + n) for an n × n image on a p × p mesh. The algorithm is efficient in terms of total work for p \leqslant n^{\frac{1} {2}} . It was evaluated on a MasPar MP-1 with 1K processors and 64KB of memory per processor. For most of the 1K × 1K size test inputs, our algorithm is faster than a neighbor updating algorithm that is extremely simple but asymptotically slower on images of large diameter.
Rapid Development of a Gunfire Detection Algorithm Using an Imagery Database
Authors: William Seisler, Neil Terry, Elmer Williams
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

Over the past few years, the Naval Research Laboratory (NRL) has been developing gunfire detection systems using infrared sensors. During the past year, the primary focus of this effort has been on algorithm performance improvements for gunfire detection from infrared imagery. A database of recordings of small arms fire and background clutter is being developed to allow lab testing of new algorithms. As the amount of data continues to grow, the testing analysis becomes lengthier. New tools and methods are being developed to reduce the post analysis time. Results of algorithm improvements for probability of detection and false alarm reduction through use of the database and tools will be presented.
Sentient Networks: A New Dimension in Network Capability
Authors: B. S. Manoj, R. Hegde, B. D. Rao, R. R. Rao
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

As computer networks evolve to the next generation, they offer flexible infrastructures for communication as well as high vulnerability. In order to sustain the reliability, to prevent misuse, and to provide radically new services, these networks need new capabilities in non-traditional domains of operation such as perception and consciousness. Therefore, we propose Sentient Networks, as an early approach towards realizing them. There are several applications for such networking capability. For one, sentient networks can enable packet detection in a blackbox manner, detect encryption of data transferred, detecting and classifying data types such as voice, video, and data. Some of the applications of such capabilities, for example, include the use of emotion content of the voice packets through a network and classifying these packets into normal, moderately panicked, and extremely panicked. Such classifications can be used to provide better QoS schemes for panicked callers. We obtained a packet detection accuracy of about 65-70% for data packets and about 98% accuracy for detecting encrypted TCP packets. The emotion-aware QoS provision mechanism provided approximately 60% improvement in delay performance for voice packets generated by panicked sources.
Lessons from the Sony CD DRM episode
Authors: J. Alex Halderman, Edward W. Felten
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

In the fall of 2005, problems discovered in two Sony-BMG compact disc copy protection systems, XCP and MediaMax, triggered a public uproar that ultimately led to class-action litigation and the recall of millions of discs. We present an in-depth analysis of these technologies, including their design, implementation, and deployment. The systems are surprisingly complex and suffer from a diverse array of flaws that weaken their content protection and expose users to serious security and privacy risks. Their complexity, and their failure, makes them an interesting case study of digital rights management that carries valuable lessons for content companies, DRM vendors, policymakers, end users, and the security community.
Deploying PHYLIP phylogenetic package on a Large Scale Distributed System
Authors: Nabil Abdennadher, Regis Boesch
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

This paper describes the parallelization (gridification) of the phylogenetic package PHYLIP on a Large Scale Distributed System termed XtremWeb- CH.PHYLIP is a package of programs for inferring phylogenies (evolutionary trees). It is the most widelydistributed phylogeny package. PHYLIP has been used to build the largest number of published trees. It's known that some modules of PHYLIP are CPU time consuming; their sequential version can not be applied to a large number of sequences.XtremWeb-CH (XWCH) is a software system that makes it easier for scientists and industrials to deploy and execute their parallel and distributed applications on a public-resource computing infrastructure. Universities, research centres and private companies can create their own XWCH platform while anonymous PC owners can participate to these platforms. They can specify how and when their resources could be used. The objective of XWCH is to develop a real High Performance Peer-To-Peer platform with a distributed scheduling and communication system. The main idea is to build a completely symmetric model where nodes can be providers and consumers at the same time.In this paper we describe the porting, deployment, and execution of some PHYLIP modules on the XWCH platform. The parallelized version of PHYLIP is used to generate evolutionary tree related to HIV viruses.
An adaptive dual control framework for QoS design
Authors: Keqiang Wu, David J. Lilja, Haowei Bai
Venue: Cluster Computing (2007)

The widespread deployment of the advanced computer technology in business and industries has demanded the high standard on quality of service (QoS). For example, many Internet applications, i.e. online trading, e-commerce, and real-time databases, etc., execute in an unpredictable general-purpose environment but require performance guarantees. Failure to meet performance specifications may result in losing business or liability violations. As systems become distributed and complex, it has become a challenge for QoS design. The ability of on-line identification and auto-tuning of adaptive control systems has made the adaptive control theoretical design an attractive approach for QoS design. However, there is an inherent constraint in adaptive control systems, i.e. a conflict between asymptotically good control and asymptotically good on-line identification. This paper first identifies and analyzes the limitations of adaptive control for network QoS by extensive simulation studies. Secondly, as an approach to mitigate the limitations, we propose an adaptive dual control framework. By incorporating the existing uncertainty of on-line prediction into the control strategy and accelerating the parameter estimation process, the adaptive dual control framework optimizes the tradeoff between the control goal and the uncertainty, and demonstrates robust and cautious behavior. The experimental study shows that the adaptive dual control framework mitigate the limitations of the conventional adaptive control framework. Compared with the conventional adaptive control framework under the medium uncertainty, the adaptive dual control framework reduces the deviation from the desired hit-rate ratio from 40% to 13%.