ppxscal/embedding_network huggingface dataset:
I-RMI: performance isolation in information flow applications
Authors: Mohamed Mansour, Karsten Schwan
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

A problem with many distributed applications is their behavior in lieu of unpredictable variations in user request volumes or in available resources. This paper explores a performance isolation-based approach to creating robust distributed applications. For each application, the approach is to (1) understand the performance dependencies that pervade it and then (2) provide mechanisms for imposing constraints on the possible 'spread' of such dependencies through the application. Concrete results are attained for J2EE middleware, for which we identify sample performance dependencies: in the application layer during request execution and in the middleware layer during request de-fragmentation and during return parameter marshalling. Isolation points are the novel software abstraction used to capture performance dependencies and represent solutions for dealing with them, and they are used to create (2) I(solation)-RMI, which is a version of RMI-IIOP implemented in the WebSphere service infrastructure enhanced with isolation points. Initial results show the approach's ability to detect and filter ill-behaving messages that can cause an up to a 85% drop in performance for the Trade3 benchmark, and to eliminate up to a 56% drop in performance due to misbehaving clients.
Prioritizing Vulnerability Remediation by Determining Attacker-Targeted Vulnerabilities
Authors: Michel Cukier, Susmit Panjwani
Venue: IEEE Security and Privacy (2009)

This article attempts to empirically analyze which vulnerabilities attackers tend to target in order to prioritize vulnerability remediation. This analysis focuses on the link between malicious connections and vulnerabilities, where each connection is considered malicious. Attacks requiring multiple connections are counted as multiple attacks. As the number of connections increases, so does the cost of recovering from the intrusion. The authors deployed four honey pots for four months, each running a different Windows service pack with its associated set of vulnerabilities. They then performed three empirical analyses to determine the relationship between the number of malicious connections and the total number of vulnerabilities, the number of malicious connections and the number of the vulnerabilities for different services, and the number of known successful attacks and the number of vulnerabilities for different services.
On the Fisher---Bingham distribution
Authors: A. Kume, S. G. Walker
Venue: Statistics and Computing (2009)

This paper primarily is concerned with the sampling of the Fisher---Bingham distribution and we describe a slice sampling algorithm for doing this. A by-product of this task gave us an infinite mixture representation of the Fisher---Bingham distribution; the mixing distributions being based on the Dirichlet distribution. Finite numerical approximations are considered and a sampling algorithm based on a finite mixture approximation is compared with the slice sampling algorithm.
Robots with projectors: an alternative to anthropomorphic HRI
Authors: Jongkyeong Park, Gerard Jounghyun Kim
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Current forms of Human Robot Interaction (HRI) pursue mostly anthropomorphism and direct interaction. That is, the interaction paradigm is based on imitating how "people" interact with one another (e.g. using spoken language, gestures, facial expression, etc.). However, "direct" interaction/contact with the "robot," often causes significant inconvenience and usability problems. In this paper, we present an alternative to the anthropomorphic interface using a projected display and indirect, yet already familiar GUI based interaction. That is, the projector (on the moving robot) projects information on the nearby surface and provides a relatively large area through which indirect GUI based interaction can occur. As an instance of such an HRI paradigm, we present a moving robot kiosk that projects displays around itself and serve and interact with multiple people at once. We report our on-going development efforts and a pilot experimental study that compares it to the typical touch screen based direct HRI.
SCOPE - Sensor Mote Configuration and Operation Enhancement
Authors: Harun Özturgut, Christian Scholz, Thomas Wieland, Christoph Niedermeier
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Wireless sensor networks are difficult to manage and control due to their large geographical distribution and the lack of visual feedback. Tasks of configuration, debugging, monitoring and role assignment are only possible with access to the running application.With SCOPE we developed a generic management framework for such networks. It can be integrated in every TinyOS application to monitor and adjust application values such as configuration variables, sensor readings or other data. To be most flexible a generic approach was taken to read and set variables by Remote Instance Calls. SCOPE is a demon application running on every mote and sending the desired data to a Java application on a PC with network access. This enables the system administrator to manage and control every single node by adjusting these values.This paper describes the architecture and use of the SCOPE framework as well as comparies it with other non-commercial state-of-the-art system management frameworks for wireless sensor networks.
A Novel Method for the Web Page Segmentation and Identification
Authors: Jing Wang, Zhijing Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A method of page segmentation and recognition based on generalized hidden Markov model is present in this paper, according to the page content as well as the structural configuration. It can effective carry on the division to the homepage, thus distinguishes each homepage block part with GHMM. The experimental result indicated that, compares with the original page segmentation algorithm, this algorithm operation efficiency enhanced by 14.3%, and the effect of segmentation has significantly improved.
Algorithmic Concurrent Error Detection in Complex Digital-Processing Systems
Authors: Lucía Costas-Pérez, Juan J. Rodríguez-Andina
Venue: IEEE Design Test (2009)

Fault tolerance capabilities are becoming a fundamental requirement in many designs. Improving these systems' dependability under demanding environmental and operating conditions requires new techniques that use concurrent error detection (CED) strategies to guarantee data integrity. The system-level algorithmic CED methodology uses selective redundancy for online monitoring of system-level properties, without requiring any modifications to the target system.
Elliptic Curve Cryptography on FPGA for Low-Power Applications
Authors: Maurice Keller, Andrew Byrne, William P. Marnane
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2009)

Elliptic curve cryptography has generated a lot of research interest due to its ability to provide greater security per bit compared to public key systems such as RSA. The designer of an elliptic curve hardware accelerator is faced with many choices at design time, each of which can impact the performance of the accelerator in different ways. There are many examples in the literature of how these design choices can effect the area and/or speed of an elliptic curve hardware accelerator. The effect of design choices on power and energy consumption in elliptic curve hardware has been less well studied. This article studies the effect of design choices on the power and energy consumption of an FPGA-based reconfigurable elliptic curve hardware accelerator. A reconfigurable processor has been used for different system parameters and the power and energy consumption measured. The power and energy results are presented and compared.
Toolpath planning algorithm for the ablation process using energy sources
Authors: H. C. Kim, S. H. Lee, D. Y. Yang
Venue: Computer-Aided Design (2009)

Ablation processes using various energy sources such as lasers, electrical power and ultrasonic sources have been widely used in industry to ablate workpieces made of hard-to-cut and temperature resistive materials. Even though the cutting mechanism of the ablation process is different from that of the mechanical cutting process, an identical toolpath of the mechanical cutting process has been applied to the ablation process. An inappropriate toolpath for the ablation process may result in a lower dimensional accuracy of the ablated part. Therefore, a new toolpath planning algorithm considering the characteristics of the energy source is required. In this paper, a toolpath planning algorithm for the ablation process is proposed. The proposed algorithm consists of three steps: (1) The generation of a valid toolpath element, (2) the storage of toolpath elements and the creation of sub-groups, (3) the linking of sub-groups. New guidelines on the toolpath demanded by the ablation process are studied. A new idea involving the use of a storage matrix is applied to the storage of toolpath elements and the creation of sub-groups. In order to verify the applicability of the proposed algorithm, the proposed toolpath planning algorithm has been implemented and tested with practical examples.
Twelve Definitions of a Stable Model
Authors: Vladimir Lifschitz
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

This is a review of some of the definitions of the concept of a stable model that have been proposed in the literature. These definitions are equivalent to each other, at least when applied to traditional Prolog-style programs, but there are reasons why each of them is valuable and interesting. A new characterization of stable models can suggest an alternative picture of the intuitive meaning of logic programs; or it can lead to new algorithms for generating stable models; or it can work better than others when we turn to generalizations of the traditional syntax that are important from the perspective of answer set programming; or it can be more convenient for use in proofs; or it can be interesting simply because it demonstrates a relationship between seemingly unrelated ideas.
Software Pipelining in Nested Loops with Prolog-Epilog Merging
Authors: Mohammed Fellahi, Albert Cohen
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Software pipelining (or modulo scheduling) is a powerful back-end optimization to exploit instruction and vector parallelism. Software pipelining is particularly popular for embedded devices as it improves the computation throughput without increasing the size of the inner loop kernel (unlike loop unrolling), a desirable property to minimize the amount of code in local memories or caches. Unfortunately, common media and signal processing codes exhibit series of low-trip-count inner loops. In this situation, software pipelining is often not an option: it incurs severe fill/drain time overheads and code size expansion due to nested prologs and epilogs.We propose a method to pipeline series of inner loops without increasing the size of the loop nest, apart from an outermost prolog and epilog. Our method achieves significant code size savings and allows pipelining of low-trip-count loops. These benefits come at the cost of additional scheduling constraints, leading to a linear optimization problem to trade memory usage for pipelining opportunities.
An agile radio framework for unmanaged wireless environments
Authors: Zhou Wang, Ranveer Chandra, Thomas Moscibroda, Alain Gefflaut, Alexandre de Baynast, Victor Bahl
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

The proposed demonstration is based on commodity 802.11 wireless cards and a low cost 2.4GHz sniffing device and shows how current WLAN based networks can benefit from spectrum awareness and dynamic access to the assigned band. The demonstrator presents a solution to problems in current wireless networks, like inefficient radio spectrum usage and limited ability to withstand interferences. The presented spectrum-aware radio management framework flexibly negotiates transmission parameters based on spectrum usage and application requirements and opportunistically utilizes available bandwidth. A key feature of this demonstrator is the fact that it breaks the traditional fixed channel bandwidth limitation and enables dynamic bandwidth allocation according to the needs of applications. It continuously monitors the assigned spectrum, tracks application behaviour, and dynamically adapts to the radio environment, such as interference and competition. Furthermore, a cross-media roaming mechanism is provided in the framework to support seamless handovers within and between radio technologies. Our enhancements are transparent to upper layer applications and will automatically benefit any software using network resources. The presented demonstrator uses wireless video streaming in a typical household scenario to illustrate the benefits without changes to the multimedia applications.
A comparative study of two state-of-the-art sequence processing techniques for hand gesture recognition
Authors: Agnès Just, Sébastien Marcel
Venue: Computer Vision and Image Understanding (2009)

In this paper, we address the problem of the recognition of isolated, complex, dynamic hand gestures. The goal of this paper is to provide an empirical comparison of two state-of-the-art techniques for temporal event modeling combined with specific features on two different databases. The models proposed are the Hidden Markov Model (HMM) and Input/Output Hidden Markov Model (IOHMM), implemented within the framework of an open source machine learning library (www.torch.ch). There are very few hand gesture databases available to the research community; consequently, most of the algorithms and features proposed for hand gesture recognition are not evaluated on common data. We thus propose to use two publicly available databases for our comparison of hand gesture recognition techniques. The first database contains both one- and two-handed gestures, and the second only two-handed gestures.
A New Mind Evolutionary Algorithm Based on Information Entropy
Authors: Yuxia Qiu, Keming Xie
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A new self-adaptive Mind Evolutionary Algorithm based on information entropy is proposed to improve the algorithmic convergence especially in the late evolutionary time. As studied, the evolution of a population is a process with entropy reducing and the population entropy can be used to reflecting the evolution state. Thus the self-adaptive strategy can be realized by building population entropy computing module to estimate the region including global optimal solution. In this way, the exploring of the algorithm is more purposeful and sufficiently and the performance is improved. The experimental results show the algorithm is valid and advanced.
Bayesian prediction of an epidemic curve
Authors: Xia Jiang, Garrick Wallstrom, Gregory F. Cooper, Michael M. Wagner
Venue: Journal of Biomedical Informatics (2009)

An epidemic curve is a graph in which the number of new cases of an outbreak disease is plotted against time. Epidemic curves are ordinarily constructed after the disease outbreak is over. However, a good estimate of the epidemic curve early in an outbreak would be invaluable to health care officials. Currently, techniques for predicting the severity of an outbreak are very limited. As far as predicting the number of future cases, ordinarily epidemiologists simply make an educated guess as to how many people might become affected. We develop a model for estimating an epidemic curve early in an outbreak, and we show results of experiments testing its accuracy.
A semi-automatic method for quantification and classification of erythrocytes infected with malaria parasites in microscopic images
Authors: Gloria Díaz, Fabio A. González, Eduardo Romero
Venue: Journal of Biomedical Informatics (2009)

Visual quantification of parasitemia in thin blood films is a very tedious, subjective and time-consuming task. This study presents an original method for quantification and classification of erythrocytes in stained thin blood films infected with Plasmodium falciparum. The proposed approach is composed of three main phases: a preprocessing step, which corrects luminance differences. A segmentation step that uses the normalized RGB color space for classifying pixels either as erythrocyte or background followed by an Inclusion-Tree representation that structures the pixel information into objects, from which erythrocytes are found. Finally, a two step classification process identifies infected erythrocytes and differentiates the infection stage, using a trained bank of classifiers. Additionally, user intervention is allowed when the approach cannot make a proper decision. Four hundred fifty malaria images were used for training and evaluating the method. Automatic identification of infected erythrocytes showed a specificity of 99.7% and a sensitivity of 94%. The infection stage was determined with an average sensitivity of 78.8% and average specificity of 91.2%.
A New Network Access Control Method Based on Diameter Protocol
Authors: Li-chuan Gu, Shao-wen Li, Zhu Cheng, You-hua Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

With the constantly expansion of network scale, the problems of network security become more and more intractable. Currently, how to establish trusted network has been a research hotspot. The key technology of trusted network is authentication, the access authentication; management and control of user and device are the base for various network security schema. In this paper, a new Network Access model is proposed, consisting of NASREQ and EAP application of Diameter protocol, PAA and EP function of PANA protocol, and authenticator function of EAP protocol. The NAS prototype system is designed and implemented, and the system is tested. By performance analysis, the result proves that the system basically satisfies requirements of a NAS defined by Diameter, EAP and PANA protocols. The new method combines the merits of digital certificate and can promotes the control-ability and manageability of network.
An Effective Vocal/Non-vocal Segmentation Approach for Embedded Music Retrieve System on Mobile Phone
Authors: Hua Tuo, Hui Li, Kai Lei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

With the growing bodies of MP3 songs in Internet, content-based analysis plays an important role for its retrieving and management. Due to most useful information is carried by vocal portions, it is necessary to separate the vocal segments from music. This paper presents a method for vocal/non-vocal segmentation, which uses a new featue extracted directly from MPEG encoded bitstream to avoid the computational cost of completely decoding process. In contrast to conventional classification method based on statistical model, in our method, the similarity matrix is first introduced to partition the input into a series of portions; then the SVM (Support Vector Machine) classifier is employed for vocal/non-vocal classification for each portion, finally, a smoothing method is adopted to correct the misclassification errors brought by the classifier. Experiments show the proposed method not only has lower computational complexity, but also has better accuracy rate of the vocal and non-vocal classification under a broad range of signal noise ratio than the original ones.
A Time-Delay Neural Networks Architecture for Structural Damage Detection
Authors: Lin Niu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper the time-delay neural networks (TDNNs) have been implemented in detecting the damage in bridge structure using vibration signature analysis. A simulation study has been carried out for the incomplete measurement data. It has been observed that TDNNs have performed better than traditional neural networks in this application and the arithmetic of the TDNNs is simple.
The sort-first rendering architecture for high-performance graphics
Authors: Carl Mueller
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Another trend in interactive graphics is the growing use of display devices with pixel counts well beyond what is usually considered "high resolution." If we examine the architectural space of high-performance rendering systems, we discover only one architectural class that promises to deliver high polygon performance with very-high-resolution displays and do so in an efficient manner. It is known as "sort-first." We investigate the sort-first architecture, starting with a comparison to its architectural class mates (sort-middle and sort-last). We find that sort-first has an inherent ability to take advantage of the frame-to-frame coherence found in interactive applications. We examine this ability through simulation with a set of test applications and show how it reduces sort-first's communication needs and therefore its parallel overhead. We also explore the issue of load-balancing with sort-first and introduce a new adaptive algorithm to solve this problem. Additional simulations demonstrate the effectiveness of this algorithm. Finally, we touch on a variety of issues that must be resolved in order to fulfill sort-first's ultimate promise: millions of polygons for zillions of pixels.
A novel software framework for embedded multiprocessor smart cameras
Authors: Andreas Doblander, Andreas Zoufal, Bernhard Rinner
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

Distributed smart cameras (DSC) are an emerging technology for a broad range of important applications including smart rooms, surveillance, entertainment, tracking, and motion analysis. By having access to many views and through cooperation among the individual cameras, these DSCs have the potential to realize many more complex and challenging applications than single-camera systems. This article focuses on the system-level software required for efficient streaming applications on single smart cameras as well as on networks of DSCs. Embedded platforms with limited resources do not provide middleware services well known on general-purpose platforms. Our software framework supports transparent intra- and interprocessor communication while keeping the memory and computation overhead very low. The software framework is based on a publisher--subscriber architecture and provides mechanisms for dynamically loading and unloading software components as well as for graceful degradation in case of software- and hardware-related faults. The software framework has been completely implemented and tested on our embedded smart cameras consisting of an ARM-based network processor and several digital signal processors. Two case studies demonstrate the feasibility of our approach.