ppxscal/embedding_network huggingface dataset:
RLP: Enhanced QoS Support for Real-Time Applications
Authors: Audrey Marchand, Maryline Silly-Chetto
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In this paper, we study the problem of scheduling periodic task sets defined under Quality of Service (QoS) constraints. In our approach, periodic tasks allow occasional skips of instances. A new algorithm, called RLP (Red tasks as Late as Possible) based on the Skip-Overmodel and the EDL (Earliest Deadline as Late as Possible) scheduling strategy, is proposed to enhance the QoS observed for periodic tasks, i.e, the ratio of periodic tasks which complete before their deadline. We prove that our results are never worse than those obtained in previous work. Experimental results also show significant improvement achieved by our algorithm over RTO and BWP.
PLFaultCAT: A Product-Line Software Fault Tree Analysis Tool
Authors: Josh Dehlinger, Robyn R. Lutz
Venue: Automated Software Engineering (2006)

Industry currently employs a product line approach to software development and deployment as a means to enhance quality while reducing development cost and time. This effort has created a climate where safety-critical software product lines are being developed without the full range of accompanying safety analysis tools available to software engineers. Software Fault Tree Analysis (SFTA) is a technique that has been used successfully to investigate contributing causes to potential hazards in safety-critical applications. This paper further extends the adaptation of SFTA to product lines of systems by describing a software safety analysis tool called PLFaultCAT. PLFaultCAT is an interactive, partially-automated support tool to aid software engineers in the application of product-line software SFTA. The paper describes the integration of product-line SFTA and PLFaultCAT with the software development life cycle. The description includes the initial construction of the product-line SFTA as well as the automated derivation of software fault trees for product line members. The technique and tool are illustrated with a small case study throughout the paper.
MyLifeBits: a personal database for everything
Authors: Jim Gemmell, Gordon Bell, Roger Lueder
Venue: Communications of the ACM (2006)

Developing a platform for recording, storing, and accessing a personal lifetime archive.
The design and evaluation of a sonically enhanced tool palette
Authors: Stephen A. Brewster, Catherine V. Clarke
Venue: ACM Transactions on Applied Perception (TAP) (2005)

This paper describes an experiment to investigate the effectiveness of adding sound to tool palettes. Palettes have usability problems because users need to see the information they present, but they are often outside the area of visual focus. We used nonspeech sounds called earcons to indicate the current tool and when tool changes occurred so that users could tell what tool they were in wherever they were looking. Results showed a significant reduction in the number of tasks performed with the wrong tool. Therefore, users knew what the current tool was and did not try to perform tasks with the wrong one. All of this was not at the expense of making the tool palettes any more annoying to use.
Singular Curves Determine Generic Distributions of Corank at Least 3
Authors: Wojciech Kryński
Venue: Journal of Dynamical and Control Systems (2005)

We prove that generic distribution germ of even rank not divisible by 4 and of corank at least 3 is strongly determined by singular curves.
A framework for reliable and efficient data placement in distributed computing systems
Authors: Tevfik Kosar, Miron Livny
Venue: Journal of Parallel and Distributed Computing (2005)

Data placement is an essential part of today's distributed applications since moving the data close to the application has many benefits. The increasing data requirements of both scientific and commercial applications, and collaborative access to these data make it even more important. In the current approach, data placement is regarded as a side affect of computation. Our goal is to make data placement a first class citizen in distributed computing systems just like the computational jobs. They will be queued, scheduled, monitored, managed, and even checkpointed. Since data placement jobs have different characteristics than computational jobs, they cannot be treated in the exact same way as computational jobs. For this purpose, we are proposing a framework which can be considered as a ''data placement subsystem'' for distributed computing systems, similar to the I/O subsystem in operating systems. This framework includes a specialized scheduler for data placement, a high level planner aware of data placement jobs, a resource broker/policy enforcer and some optimization tools. Our system can perform reliable and efficient data placement, it can recover from all kinds of failures without any human intervention, and it can dynamically adapt to the environment at the execution time.
Preliminary Evaluation of a FPGA-Based-Prototype of DIMMnet-2 Network Interface
Authors: Noboru Tanabe, Akira Kitamura, Tomotaka Miyashiro, Yasuo Miyabe, Tohru Izawa, Yoshihiro Hamada, Hironori Nakajo, Hideharu Amano
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Recent performance improvement of interconnection networks for a PC cluster brings a bottleneck in a standard I/O bus such as PCI bus. DIMMnet is a network interface plugged into a memory slot instead of standard I/O buses. This strategy is one of the solutions in order to balance growing performance with future micro processors. DIMMnet-2 is a prototype which can be plugged into a DDR-DIMM slot to confirm its functions. In this paper, outline of FPGA-based DIMMnet-2 prototype and improvements from DIMMnet-1 to DIMMnet-2 are mentioned. Although the DIMMnet-2 uses an FPGA instead of an ASIC, the latency for writing 8 Bytes into remote memory is only 0.948 ìs. It is about 3 times fewer latency than that of a high performance commercial network interface QsNET II plugged into PCI-X bus on Intel-based IA32 PC. The delay of CoreLogic part for BOTF sending of FPGA based DIMMnet-2 is 5.75 times as fast as that of DIMMnet-1.
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
Authors: Curt Cramer, Thomas Fuhrmann
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-level tasks, such as service discovery, in a cooperative and distributed way. Originally conceived as a peer-to-peer application for the Internet, distributed hash tables (DHTs) are data structures offering both, scalable routing and a convenient abstraction for the design of applications in large, dynamic networks. Hence, DHTs and MANETs seem to be a good match, and both have to cope with dynamic, self-organizing networks. DHTs form a virtual control structure oblivious to the underlying network. Several techniques to improve the performance of DHTs in wired networks have been established in the literature. A particularly efficient one is proximity neighbor selection (PNS). PNS has to continuously adapt the virtual network to the physical network, incurring control traffic. The applicability of PNS and DHTs for MANETs commonly is regarded as hard because of this control traffic,the complexity of the adaptation algorithms, and the dynamics of a MANET. Using simulations supported by analytical methods, we show that by making a minor addition to PNS, it is also applicable for MANETs. We additionally show that the specifics of a MANET make PNS an easy exercise there. Thus, DHTs deliver good performance in MANETs.
Learning from labeled and unlabeled data on a directed graph
Authors: Dengyong Zhou, Jiayuan Huang, Bernhard Schölkopf
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is considered. The time complexity of the algorithm derived from this framework is nearly linear due to recently developed numerical techniques. In the absence of labeled instances, this framework can be utilized as a spectral clustering method for directed graphs, which generalizes the spectral clustering approach for undirected graphs. We have applied our framework to real-world web classification problems and obtained encouraging results.
Estimation of generalized entropies with sample spacing
Authors: P. Wachowiak, Renata Smol&#x00ed;kov&#x00e1;, D. Tourassi, S. Elmaghraby
Venue: Pattern Analysis Applications (2005)

In addition to the well-known Shannon entropy, generalized entropies, such as the Renyi and Tsallis entropies, are increasingly used in many applications. Entropies are computed by means of nonparametric kernel methods that are commonly used to estimate the density function of empirical data. Generalized entropy estimation techniques for one-dimensional data using sample spacings are proposed. By means of computational experiments, it is shown that these techniques are robust and accurate, compare favorably to the popular Parzen window method for estimating entropies, and, in many cases, require fewer computations than Parzen methods.
Towards a Visual Programming Environment Based on ITK for Medical Image Analysis
Authors: Hoang D. K. Le, Rongxin Li, Sebastien Ourselin
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Medical image analysis experiments usually require a certain level of programming skills and are often time-consuming. Visual programming can address these issues by providing a high-level user interface to visually access and combine underlying medical image analysis functionalities. This paper describes the ITKBoard, an extension of the Insight Toolkit for Registration and Segmentation (ITK). Unlike traditional approaches, ITKBoard, a visual tool for experimentation and prototyping, allows rapid visual construction of filter pipelines, via a graphical user interface. An overview of the main functionalities and the system design is presented in this paper. The approaches that we have developed to resolving critical issues such as pipeline handling, automatic object wrapping and plugin mechanism are discussed in detail. This is a first step towards a visual programming environment designed for medical image analysis, in which the specific needs in terms of visual data-flow and control-flow programming will be progressively addressed. It is envisaged that when the software is released in the near future it will be significantly beneficial to the medical image analysis community.
Study on Least Squares Support Vector Machines Algorithm and Its Application
Authors: Ming-guang Zhang, Zhan-ming Li, Wen-hui Li
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Support vector machines (SVM) is a novel machine learning method based on small-sample Statistical Learning Theory (SLT), and is powerful for the problem with small sample, nonlinearity, high dimension, and local minima.SVM have been very successful in pattern recognition ,fault diagnoses and function estimation problems. Least squares support vector machines (LS-SVM) is an SVM version which involves equality instead of inequality constraints and works with a least squares cost function. This paper discusses least squares support vector machines (LS-SVM) estimation algorithm and introduces applications of the novel method for the nonlinear control systems. Then identification of MIMO models and soft-sensor modeling based on least squares support vector machines (LS-SVM) is proposed. The simulation results show that the proposed method provides a powerful tool for identification and soft-sensor modeling and has promising application in industrial process applications.
Classification of Wheeled Military Vehicles Using Neural Networks
Authors: Jerzy Jackowski, Roman Wantoch-Rekowski
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The problem of using neural networks for military vehicle classification on the basis of ground vibration is presented in this paper. One of the main elements of the system is unit called geophone. This unit allows to measure ground vibrations in each direction for certain period of time. The value of amplitude is used to fix LPC values of each vehicle. Because the multilayer perceptron is used, the learning set has to be prepared. Please find attached the results of using neural network such as: example of learning, validation and test sets, structure of the networks and learning algorithm, learning and testing results.
Fast and Accurate Face Recognition Using Support Vector Machines
Authors: K. E. Gates
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

The challenge of face recognition software is the rapid and accurate identification or classification of a query image, or set of query images, based on a set of known target images. Although Support Vector Machines (SVMs) are known to be accurate for the classification problem they are limited in this application by the time required for training which is dependent on the length of the feature vector. In this paper we present a novel method of feature reduction that greatly reduces computational time with minimal reductions in accuracy. It is shown that for Experiments 1, 2 and 4 of the the Face Recognition Grand Challenge Version 1, the feature reduction can make SVMs competitive with principal component analysis.
Using Interval Particle Filtering for Marker Less 3D Human Motion Capture
Authors: Jamal Saboune, Francois Charpillet
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper we present a new approach for marker less human motion capture from conventional camera feeds. The aim of our study is to recover 3D positions of key points of the body that can serve for gait analysis. Our approach is based on foreground segmentation, an articulated body model and particle filters. In order to be generic and simple no restrictive dynamic modelling was used. A new modified particle filtering algorithm was introduced. It is used efficiently to search the model configuration space. This new algorithm which we call Interval Particle Filtering reorganizes the configurations search space in an optimal deterministic way and proved to be efficient in tracking natural human movement. Results for human motion capture from a single camera are presented and compared to results obtained from a marker based system. The system proved to be able to track motion successfully even in partial occlusions.
A rejoinder to "Randomness is Nonsense"
Authors: Richard E. Nance
Venue: ACM SIGSIM Simulation Digest (1976)

The brief note "Randomness Is Nonsense" offers an opinion of the concept of randomness that is inaccurate and confusing. This brief rejoinder attempts to clarify the arguments that lead to the conceptual problems involving "randomness", especially as the term is used in the context of random number generation.
Machine Recognition of Online Handwritten Devanagari Characters
Authors: Niranjan Joshi, G. Sita, A. G. Ramakrishnan, V. Deepu, Sriganesh Madhvanath
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we describe a system for the automaticrecognition of isolated handwritten Devanagari , characters obtained by linearizing consonantconjuncts. Owing to the large number of charactersand resulting demands on data acquisition, we usestructural reconnition techniques to reduce some characters to others. The residual characters are then classiJied using the subspace method. Finally the results of structural recognition and feature-based matching are mapped to give final output. The proposed system is evaluated for the writer dependent scenario.
Using an interactive evolutionary algorithm to help fitting a cochlear implant
Authors: C. Bourgeois-Republique, Bruno Frachet, Pierre Collet
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Cochlear implants are electronic devices that stimulate directly the auditory nerve to allow totally deaf patients to hear again. This paper presents an interactive evolutionary algorithm (IEA) designed to help finding the best parameters of a cochlear implant for a specific patient.If early cochlear implants only featured one electrode, modern devices now offer up to 22 electrodes, with the hope to be able to transmit more details and help the patient hear better. The work presented in this paper shows however that having more electrodes is not necessarily better.Tests on a patient show surprisingly that some combinations of electrodes yield better results than others, with the problem that there is no real way to determine which electrode is beneficial to speech understanding and which is not.The best result obtained by the patient on a speech understanding evaluation protocol was 48.5/100 after 10 years of fitting sessions by an expert practitioner. For many reasons explained in this paper, the evaluation of the best parameter setting found by the IEA in one day was 91.5/100.
VLSI Design of a High-Throughput Multi-Rate Decoder for Structured LDPC Codes
Authors: Massimo Rovini, Nicola E. L'Insalata, Francesco Rossi, Luca Fanucci
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Despite recent advances in the microelectronics technology, the implementation of high-throughput decoders for LDPC codes remains a challenging task. This paper aims at summarising the top-down design flow of a decoder for a structured LDPC code compliant with the WWiSE proposal for WLAN. Starting from the system performance analysis with finite-precision arithmetic, a high-throughput architecture is presented as an enhancement of the state-of-the-art solutions, and its VLSI design detailed. The envisaged architecture is also very flexible as it supports several code rates with no significant hardware overhead. The overall decoder, synthesised on 0.18 µm standard cells CMOS technology, showed remarkable performances: small implementation loss (0.2 dB down to BER = 10-8), low latency (less than 6.0 µs), high useful throughput (up to 940 Mbps) and low complexity (about 375 Kgates).
Arabic Handwriting Recognition Competition
Authors: V. Margner, M. Pechwitz, H. El Abed
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes the Arabic handwriting recognition competition for ICDAR 2005. With the presentation of the IFN/ENIT-database in the year 2002 a database with handwritten Arabic town names was made available for free to non commercial research groups. Till now more than 30 groups are working with this data worldwide. By announcing a competition of Arabic handwriting recognition systems based on the IFN/ENIT-database, we hope to contribute to the development of Arabic handwriting recognition systems. The use of the same database by different research groups allows the comparison of different systems. We compare the systems on the most important characteristic: recognition rate, but also features like word length, writing style, and character connectivity will be discussed.
Chess Hardware in Deep Blue
Authors: Feng-Hsiung Hsu
Venue: Computing in Science and Engineering (2006)

In May 1997, Deep Blue became the first computer to defeat a reigning World Chess Champion in an official match. This article reexamines the special-purpose chess hardware that provided most of Deep Blue's computational power and explores design alternatives made possible by new technologies for similar tasks.
Multi-Level Component Grouping Algorithm and Its Applications
Authors: Bo Yuan, Chew Lim Tan
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper describes a fast and effective component grouping algorithm for some layout analysis problems of textual document images. Based on an empiricalfunction, it discovers neighborhood relations at the component level. Time-consuming algorithms that operate globally among components may obtain significant pe$ormarzce boost from the localization information that this grouping algorithm provides. Some of the applications using this grouping function are also demonstrated.
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
Authors: Georg Ringwelski
Venue: Artificial Intelligence Review (2005)

This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed constraint satisfaction problems (CSP). The algorithm is an adaptation of the well-known AC-4 algorithm to system settings where constraints can be added and deleted in concurrent processes. It is the first algorithm for arc-consistency enforcement in this system setting. Arc-consistency is achieved whenever the overall system reaches quiescence after a constraint is added or deleted.
JADE: jabber-based authoring in distributed environments
Authors: Andrew Roczniak, Abdulmotaleb El Saddik
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We present our initial results in developing a framework for collaborative multimedia authoring tools. This research is motivated by the lack of tools that take into account consumers' quality of experience. By mapping factors that have an impact on the quality of experience into requirements, we are developing a framework for tools that allow retrieval and manipulation of multimedia objects, and collaborative authoring of multimedia documents based on Jabber set of protocols.
Affine invariant fitting of algebraic curves using Fourier descriptors
Authors: Sait Sener, Mustafa Unel
Venue: Pattern Analysis Applications (2005)

Both parametric and implicit representations are used in a variety of computer vision applications such as object modeling, recognition and pose estimation. In this paper, we present a new algebraic curve fitting technique based on the implicitization of affine invariant Fourier descriptors that can be used to model free-form objects captured from different viewpoints. Implicitization can be carried out quite efficiently using a numerical procedure rather than computing determinants of eliminant matrices, symbolically. Affine invariance of the proposed fitting technique is experimentally shown on a database of 2D free-form objects. Experimental results are provided to assess the robustness of our fitting method under data perturbations. Some invariant recognition examples are also presented.