ppxscal/embedding_network huggingface dataset:
A Gossip-based Membership Management Algorithm for Large-Scale Peer-to-Peer Media Streaming
Authors: Bin Rong, Ibrahim Khalil, Zahir Tari
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A new adaptive gossip-based membership management algorithm is proposed. Its adaptive nature enables it to con- fine the control overhead to local ranges, and adapt to the ever-changing network traffic conditions and group membership. The random nature of the algorithm ensures that it can cope with random failures and offer proactive measures to maintain service at a certain level. Mathematical analysis and simulation results indicate that more than 90% of the nodes can work properly even under very high network dynamics (with a short half-life time of 50 seconds), and all these are achieved by using a relatively low overhead.
Exploiting open functionality in SMS-capable cellular networks
Authors: William Enck, Patrick Traynor, Patrick McDaniel, Thomas La Porta
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Cellular networks are a critical component of the economic and social infrastructures in which we live. In addition to voice services, these networks deliver alphanumeric text messages to the vast majority of wireless subscribers. To encourage the expansion of this new service, telecommunications companies offer connections between their networks and the Internet. The ramifications of such connections, however, have not been fully recognized. In this paper, we evaluate the security impact of the SMS interface on the availability of the cellular phone network. Specifically, we demonstrate the ability to deny voice service to cities the size of Washington D.C. and Manhattan with little more than a cable modem. Moreover, attacks targeting the entire United States are feasible with resources available to medium-sized zombie networks. This analysis begins with an exploration of the structure of cellular networks. We then characterize network behavior and explore a number of reconnaissance techniques aimed at effectively targeting attacks on these systems. We conclude by discussing countermeasures that mitigate or eliminate the threats introduced by these attacks.
Threading stories and generating topic structures in news videos across different sources
Authors: Xiao Wu
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

News videos delivered from different sources constitute a huge volume of daily information. These videos, overall, form a huge collection of news stories that are intertwined with various novel and old topic themes. To date, it remains a challenging task on how to automatically extract a concise view of news stories according to topic themes. This doctoral thesis studies the issues in story dependency threading and topical auto-documentary in news stories. Initially, a co-clustering algorithm is proposed to perform the news story clustering by exploiting the duality between stories and multi-modal concepts. Then, the novelty and redundancy detection is performed to capture the relationship among stories of a topic. To facilitate the fast navigation of news topic, a novel topic structure is then proposed to chains the dependencies of stories. A main thread is extracted to highlight the important aspects of a theme. A news video editing optimization algorithm can be directly applied to automatically select suitable video and speech contents from the original video source to create an edited video documentary.
Stochastic analysis of interconnect performance in the presence of process variations
Authors: J. Wang, P. Ghanta, S. Vrudhula
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Deformations in interconnect due to process variations can lead to significant performance degradation in deep sub-micron circuits. Timing analyzers attempt to capture the effects of variation on delay with simplified models. The timing verification of RC or RLC networks requires the substitution of such simplified models with spatial stochastic processes that capture the random nature of process variations. The present work proposes a new and viable method to compute the stochastic response of interconnects. The technique models the stochastic response in an infinite dimensional Hilbert space in terms of orthogonal polynomial expansions. A finite representation is obtained by using the Galerkin approach of minimizing the Hilbert space norm of the residual error. The key advance of the proposed method is that it provides a functional representation of the response of the system in terms of the random variables that represent the process variations. The proposed algorithm has been implemented in a procedure called OPERA, results from OPERA simulations on commercial design test cases match well with those from the classical Monte Carlo SPICE simulations and from perturbation methods. Additionally OPERA shows good computational efficiency: speedup factor of 60 has been observed over Monte Carlo SPICE simulations.
DVD mastering using QDVDAuthor
Authors: Dan Sawyer
Venue: Linux Journal (2005)

Do you need a Mac to do professional DVD authoring? Not at all. It's easy with QDVDAuthor.
On Binary Similarity Measures for Handwritten Character Recognition
Authors: Sung-Hyuk Cha, Sungsoo Yoon, Charles C. Tappert
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Similarity and dissimilarity measures play an important role in pattern classification and clustering. For a century, researchers have searched for a good measure. Here, we review, categorize, and evaluate various binary vector similarity/dissimilarity measures for character recognition. One of the most contentious disputes in the similarity measure selection problem is whether the measure includes or excludes negative matches. While inner-product based similarity measures consider only positive matches, other conventional measures credit both positive and negative matches equally. Hence, we propose an enhanced similarity measure that gives variable credits and show that it is superior to conventional measures in an offline handwritten character recognition application. Finally, the proposed similarity measure can be further boosted by applying weights and we demonstrate that it outperforms the weighted Hamming distance.
An Implicit Wavelet Sparse Approximate Inverse Preconditioner
Authors: Stuart C. Hawkins, Ke Chen
Venue: SIAM Journal on Scientific Computing (2005)

Wavelet-based sparse approximate inverse preconditioners are considered for the linear system Ax=b. The preconditioners are good sparse approximations to the inverse of A computed by taking advantage of the compression obtained by working in a wavelet basis. When the representation of A in a single scale basis (for example, a finite element basis) is available, the formulation presented obviates computation of the representation of A in the wavelet basis and removes the associated costs. Efficient application for both sparse and dense A is considered.
A mathematical morphology approach to image based 3D particle shape analysis
Authors: J. Lee, L. Smith, N. Smith, S. Midha
Venue: Machine Vision and Applications (2005)

Angularity is a critically important property in terms of the performance of natural particulate materials. It is also one of the most difficult to measure objectively using traditional methods. Here we present an innovative and efficient approach to the determination of particle angularity using image analysis. The direct use of three-dimensional data offers a more robust solution than the two-dimensional methods proposed previously. The algorithm is based on the application of mathematical morphological techniques to range imagery, and effectively simulates the natural wear processes by which rock particles become rounded. The analysis of simulated volume loss is used to provide a valuable measure of angularity that is geometrically commensurate with the traditional definitions. Experimental data obtained using real particle samples are presented and results correlated with existing methods in order to demonstrate the validity of the new approach. The implementation of technologies such as these has the potential to offer significant process optimisation and environmental benefits to the producers of aggregates and their composites. The technique is theoretically extendable to the quantification of surface texture.
Single Camera Stereo for Mobile Robot Surveillance
Authors: Jonah McBride, Magnus Snorrason, Thomas Goodsell, Ross Eaton, Mark R. Stevens
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Mobile robot designers frequently look to computer vision to solve navigation, obstacle avoidance, and object detection problems such as those encountered in parking lot surveillance. Stereo reconstruction is a useful technique in this domain. The advantage of a single-camera stereo method versus a stereo rig is the flexibility to change the baseline distance to best match each scenario. This directly increases the robustness of the stereo algorithm and increases the effective range of the system. The challenge comes from accurately rectifying the images into an ideal stereo pair. Structure from motion (SFM) can be used to compute the camera motion between the two images, but its accuracy is limited and small errors can cause rectified images to be misaligned. We present a single-camera stereo system that incorporates a Levenberg-Marquardt minimization of rectification parameters to bring the rectified images into alignment.
Artistic reality: fast brush stroke stylization for augmented reality
Authors: Jan Fischer, Dirk Bartz, Wolfgang Straβer
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

The goal of augmented reality is to provide the user with a view of the surroundings enriched by virtual objects. Practically all augmented reality systems rely on standard real-time rendering methods for displaying graphical objects. Although such conventional computer graphics algorithms are fast, they often fail to produce sufficiently realistic renderings. Therefore, virtual models can easily be distinguished from the real environment. We have recently proposed a novel approach for generating augmented reality images [4]. Our method is based on the idea of applying stylization techniques for adapting the visual realism of both the camera image and the virtual graphical objects. Since both the camera image and the virtual objects are stylized in a corresponding way, they appear very similar. Here, we present a new method for the stylization of augmented reality images. This approach generates a painterly brush stroke rendering. The resulting stylized augmented reality video frames look similar to paintings created in the pointillism style. We describe the implementation of the camera image filter and the non-photorealistic rendererfor virtual objects. These components have been newly designed or adapted for this purpose. They are fast enough for generating augmented reality images in near real-time (more than 14 frames per second).
ARVino — Outdoor Augmented Reality Visualisation of Viticulture GIS Data
Authors: Gary R. King, Wayne Piekarski, Bruce H. Thomas
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

This paper describes the combination of two technologies, augmented reality and GIS, to provide a new way to visualise viticulture GIS data using outdoor mobile computers. Viticulturists use GIS to assist with accurately understanding the parameters that affect their yields and quality of the grapes from different vineyards. The ability to view this data in the field digitally would be advantageous to the viticulturist. This paper describes the ARVino system; an AR platform that was built for visualising 3D data outdoors using a movable tripod-based computer. We describe the user interface, some problems that were encountered, and how the visualisation and interface were evaluated through an expert review.
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
Authors: Shaojun Wang, Shaomin Wang, Russell Greiner, Dale Schuurmans, Li Cheng
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) for the purpose of statistical language modeling. Even though the composite directed MRF model potentially has an exponential number of loops and becomes a context sensitive grammar, we are nevertheless able to estimate its parameters in cubic time using an efficient modified EM method, the generalized inside-outside algorithm, which extends the inside-outside algorithm to incorporate the effects of the n-gram and PLSA language models. We generalize various smoothing techniques to alleviate the sparseness of n-gram counts in cases where there are hidden variables. We also derive an analogous algorithm to calculate the probability of initial subsequence of a sentence, generated by the composite language model. Our experimental results on the Wall Street Journal corpus show that we obtain significant reductions in perplexity compared to the state-of-the-art baseline trigram model with Good-Turing and Kneser-Ney smoothings.
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
Authors: Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, Dima Krymskiy
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies like Denial of Service attacks. For this purpose, Internet Service Providers (ISPs) have started to instrument their networks with Network Measurement Infrastructures (NMIs) that periodically run active measurement tasks using measurement servers located at strategic points in their networks. However, one problem that most network engineers have overlooked is the measurement conflict problem. Since active measurement tasks actively inject test packets to collect measurements along network paths, running multiple active measurements at the same time over the same path could result in misleading reports of network performance. We call this phenomenon a measurement conflict. Our recent observation of such measurement conflict motivates us to form a measurement task scheduling problem of meeting periodicity requirements, where real-time scheduling algorithms can play a role. The scheduling problem, however, is not exactly same as any of the existing scheduling problems in the realtime literature, because the problem involves multiple measurement servers running multiple measurement tasks whose conflict dependency propagates along the chains of paths. For this problem, we propose to use an EDF (Earliest Deadline First) heuristic but allowing "Concurrent Executions" if possible, to construct an offline schedule for a given measurement task set. Also, we propose a novel mechanism to flexibly use the offline schedule for minimizing the response time of dynamic on-demand measurement jobs. Further, we implement and deploy our scheduling algorithms in a real working NMI for monitoring Internet 2 Abilene network.
Adaptive Multi-Model CMAC-Based Supervisory Control for Uncertain MIMO Systems
Authors: Nasser Sadati, Mahdi Bagherpour, Rasoul Ghadami
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper, an adaptive multi-model CMAC-based controller (AMCBC) in conjunction with a supervisory controller is developed for uncertain nonlinear MIMO systems. AMCBC is a kind of adaptive feedback linearizing controller where nonlinearity terms are approximated with multiple CMAC neural networks With the help of a supervisory controller, the resulting close-loop system is globally stable. The proposed control system is applied to control a robotic manipulators, where some varying tasks are repeated but information on the load is not defined; it is unknown and varying. It is shown how the proposed controller is effective because of its capability to memorize the control skill for each task using CMAC neural network. Simulation results demonstrate the effectiveness of the proposed control scheme for the robotic manipulators.
Ambient functionality: use cases
Authors: Eija Kaasinen, Timo Tuomisto, Pasi Välkkynen
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

In this paper we describe use cases and user requirements for ambient intelligence applications on personal mobile devices. Wireless connections to tags and sensors provide mobile applications with different identification, measurement and context data. Mobile applications that utilise local connectivity share many common patterns. We have identified these common patterns and describe them as use cases related to physical selection, activating applications, sensing and context-awareness. Based on user and expert evaluations of usage scenarios we also present user requirements for the use cases.
Self Managed Adaptability with Wrappings
Authors: Christopher Landauer, Kirstie L. Bellman
Venue: Proceedings of the IEEE International Workshop on Software Evolvability (2005)

In this paper, we offer an approach to software evolvability based on our Wrapping infrastructure for integration in Constructed Complex Systems. We believe that the self-modeling systems that we have built using Wrappings may be able to manage their own evolution to some extent. In a Wrapping-based system, the design decisions are visible in the resource definitions, with the associated context assumptions, so it is much easier to change them. We expect such a system to build and examine models of its environment, and its behavior in the environment, to check them against the specifications that define the assumptions about the use of the system, so it can call for help when they are violated. We also think we can build the system to make the changes itself in some cases. In particular, there is a class of system change causes that are known to the original system designers (usually based on uncertainties about the environment or the curernt state of hardware components), and the system can be built with enough information to react to those changes accordingly.
A Technology Optimization Process for Heavy Hybrid Electric Vehicle Systems Using Computational Models
Authors: Michael O'Keefe, Kevin Walkowicz, Terry Hendricks
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

We have developed a computer-based technology optimization process to define vehicle systems that meet specified goals and constraints using a minimum amount of resources. The process is built around answering three questions: Where are we now? Where do we want to go? And what is the best way to get there? A technical target setting algorithm helps answer the last question. The target setting algorithm uses computational models that predict system responses for various combinations of technology attributes, quantitatively defined requirements and goals, and relationships between improvements in technology attributes and resource requirements. The algorithm yields the mix of technologies that achieve overall program and vehicle goals using a minimum amount of resources. This process was developed for and applied to the U.S. Department of Energy's Advanced Heavy Hybrid Propulsion Systems activity. In this paper, we describe the technology optimization process, with a focus on technical target setting, and illustrate its use with a simple example
Enabling Agent-Based Management of Web Services with WS2JADE
Authors: Xuan Thang, Ryszard Kowalczyk
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Web services management has attracted substantial research and industry interests in recent years. Web services technology is gaining popularity because of its well defined infrastructure aiming at enabling interoperability among heterogenous applications. However, this interoperability promise also poses a difficulty in building a Web service management framework which can work across organizational boundaries. Software agents have been recognized as a promising technology for managing Web services. However in many proposed frameworks no agent standard is assumed. In this paper, we propose an extension of our existing Web services-agent integration toolkit WS2JADE for Web services management with FIPA compliant multi-agent systems. In particular, we relate our framework to other solutions in the area and show how new emerging Web services management technologies can be used with WS2JADE for enabling Web services management with agents.
Continuous Path and Edge Profiling
Authors: Michael D. Bond, Kathryn S. McKinley
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Microarchitectures increasingly rely on dynamic optimization to improve performance in ways that are dif- ficult or impossible for ahead-of-time compilers. Dynamic optimizers in turn require continuous, portable, low cost, and accurate control-flow profiles to inform their decisions, but prior approaches have struggled to meet these goals simultaneously. This paper presents PEP, a hybrid instrumentation and sampling approach for continuous path and edge profiling that is efficient, accurate, and portable. PEP uses a subset of Ball-Larus path profiling to identify paths with low overhead, and uses sampling to mitigate the expense of storing paths. PEP further reduces overhead by using profiling to guide instrumentation placement. PEP improves profile accuracy with a modified version of Arnold-Grove sampling. The resulting system has 1.2% average and 4.3% maximum overhead, 94% path profile accuracy, and 96% edge profile accuracy on a set of Java benchmarks.