ppxscal/embedding_network huggingface dataset:
ToA^3: Beyond the Limit of Unstructured P2P Networks
Authors: Xinli Huang, Yin Li, Fei Liu, Fanyuan Ma
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

A major limitation of current unstructured peer-topeer (P2P) networks lies in the inefficiency of search, which results in fatal scalability problems. In this paper, ToA^3, a novel P2P file-sharing system, is proposed to tackle such a limitation. The key idea of ToA^3 is to generate an overlay topology with DESIRABLE properties, adapt peers towards BETTER neighbors dynamically, and direct queries to RIGHT next nodes with as few duplicated messages as possible. To achieve this goal, ToA^3 introduces several innovative techniques such as: (a) a dynamic topology adaptation algorithm with self-sustaining power-law degree distributions, (b) a simply but efficient utilization of peerto- peer network heterogeneity, (c) a proper implementation of the underlying-network-awareness, and (d) Smart Search-a biased search algorithm used in ToA^3. Extensive simulations substantiate that our techniques significantly improve the search performance and reduce the network load dramatically.
Managing the follow-me semantics to build large-scale pervasive applications
Authors: Iara Augustin, Adenauer Yamin, Cláudio F. Resin Geyer
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

In this paper, we present the concept of follow-me semantics of the large-scale pervasive application and discuss the features and services to its implementation based on the integration of three computing fields: mobile, context-aware and grid computing. We also discuss the adopted context-aware adaptation model, main feature embedded in both applications and middleware design, to allow the wide physical and logical mobility.
From Static Distributed Systems to Dynamic Systems
Authors: Achour MOSTEFAOUI, Michel RAYNAL, Corentin TRAVERS, Stacy PATTERSON, Divyakant AGRAWAL, Amr EL ABBADI
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

A noteworthy advance in distributed computing is due to the recent development of peer-to-peer systems. These systems are essentially dynamic in the sense that no process can get a global knowledge on the system structure. They mainly allow processes to look up for data that can be dynamically added/suppressed in a permanently evolving set of nodes. Although protocols have been developed for such dynamic systems, to our knowledge, up to date no computation model for dynamic systems has been proposed. Nevertheless, there is a strong demand for the de?nition of such models as soon as one wants to develop provably correct protocols suited to dynamic systems. This paper proposes a model for (a class of) dynamic systems. That dynamic model is de?ned by (1) a parameter (an integer denoted a) and (2) two basic communication abstractions (query-response and persistent reliable broadcast). The new parameter a is a threshold value introduced to capture the liveness part of the system (it is the counterpart of the minimal number of processes that do not crash in a static system). To show the relevance of the model, the paper adapts an eventual leader protocol designed for the static model, and proves that the resulting protocol is correct within the proposed dynamic model. In that sense, the paper has also a methodological ?avor, as it shows that simple modi?cations to existing protocols can allow them to work in dynamic systems.
The privacy and safety impact of technology choices for command, communications and control of the public highway
Authors: Jon Crowcroft
Venue: ACM SIGCOMM Computer Communication Review (2006)

Monitoring, and command,communications and control of private vehicles on the public highway is now high on the political agenda. This is both because it is becoming feasible, and because it may be desirable. From the economic perspective, more efficient se of road resources may be achievable. From a safety perspective, it would clearly be good to reduce road injury and death statistics below the current "9/11"'s-worth per year in the UK (and other similar sized European countries).Various prototypes, proposals and projects are being undertaken. There are a number of technologies that interact as well as numerous legal, political and economic stakeholders. In this note, we pay particular attention to the impact on privacy and safety of di .erent approaches to the overall problem.The purpose is to draw attention to the potential unintended consequences that result from decisions being made at the time of writing, in this arena.
Robust Multiclass Signaling Overload Control
Authors: Sneha Kasera, Jose Pinheiro, Catherine Loader, Tom LaPorta, Mehmet Karaul, Adiseshu Har
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

We propose multi-class signaling overload control algorithms, for telecommunication switches, that are robust against different input traffic patterns and system upgrades. In order to appropriately measure the system load when several classes of signaling traffic are present, we first introduce the concept of equivalent system load measure, that converts the multiple system measures associated with different classes of traffic into a single measure with respect to a pre-defined base class. We use this measure to develop three multi-class overload detection and measurement algorithms. Next, we develop a new algorithm for partitioning the allowable equivalent system load across multiple traffic classes, using a strict priority scheme. Using simulations of call flows from mobile telecommunications standards, we compare different multi-class overload algorithms under a variety of overload conditions. Our simulation results indicate that our algorithm that measures system load using a combination of request acceptance rate and processor occupancy, provides highly reactive and robust overload control. Last, for the purpose of making the overload control algorithms more robust, we propose a measurementbased simple regression technique to dynamically estimate key system parameters. We find that estimates derived in this manner converge rapidly to their true values.
Region based image annotation through multiple-instance learning
Authors: Changbo Yang, Ming Dong, Farshad Fotouhi
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In an annotated image database, keywords are usually associated with images instead of individual regions, which poses a major challenge for any region based image annotation algorithm. In this paper, we propose to learn the correspondence between image regions and keywords through Multiple-Instance Learning (MIL). After a representative image region has been learned for a given keyword, we consider image annotation as a problem of image classification, in which each keyword is treated as a distinct class label. The classification problem is then addressed using the Bayesian framework. The proposed image annotation method is evaluated on an image database with 5,000 images.
Unsupervised spatial pattern classification of electrical-wafer-sorting maps in semiconductor manufacturing
Authors: F. Di Palma, G. De Nicolao, G. Miraglia, E. Pasquinetti, F. Piccinini
Venue: Pattern Recognition Letters (2005)

In semiconductor manufacturing, the spatial pattern of failed devices in a wafer can give precious hints on which step of the process is responsible for the failures. In the literature, Kohonen's Self Organizing Feature Maps (SOM) and Adaptive Resonance Theory 1 (ART1) architectures have been compared, concluding that the latter are to be preferred. However, both the simulated and the real data sets used for validation and comparison were very limited. In this paper, the use of ART1 and SOM as wafer classifiers is re-assessed on much more extensive simulated and real data sets. We conclude that ART1 is not adequate, whereas SOM provide completely satisfactory results including visually effective representation of spatial failure probability of the pattern classes.
Similarity space projection for web image search and annotation
Authors: Ying Liu, Tao Qin, Tie-Yan Liu, Lei Zhang, Wei-Ying Ma
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

Web image search has been explored and developed in academic as well as commercial areas for over a decade. To measure the similarity between Web images and user queries, most of the existing Web image search systems try to convert an image to textual keywords by analyzing the textual information available (such as surrounding text and image filename) with or without leveraging image visual features (such as color, texture, shape). In this way, the existing systems transform "Web images" to the "query (text)" space so as to compare the relevance of images to the query. In this paper, we present a novel solution to Web image search - similarity space projection (SSP). This algorithm takes images and queries as two heterogeneous object peers, and projects them into a third Euclidean "similarity space" in which their similarity can be directly measured. The rule of projection guarantees that in the new space the relevant images are kept close to the corresponding query and those irrelevant ones are away from it. Experiments on real-world Web image collections showed that the proposed algorithm significantly outperformed traditional information retrieval models (such as vector space model) in the application of image search. Besides Web image search, we demonstrate that this algorithm can also be applied to image annotation scenario, and has promising performance. Thus, this algorithm unifies Web image search and image annotation into same framework.
On Systems Engineering Deployment and Requirements Evolution
Authors: Mourad Messaadia, Mohamad Hani El-Jamal, Abd-El-Kader Sahraoui
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper is on systems engineering deployment and requirements evolution issues. The approach presented relies on the necessity for systems engineering deployment as a way to customize such concepts for specific applications; a case study is given concerning product lifecycle management (PLM); in the other hand the requirements evolution aspect is addressed in a systems engineering framework and the study analysis of the its impacts on safety issues.
Input devices for web browsing: age and hand effects
Authors: Tiffany Jastrzembski, Neil Charness, Patricia Holley, Jeffrey Feddon
Venue: Universal Access in the Information Society (2005)

The work reported in this paper examined performance on a mixed pointing and data entry task using direct and indirect positioning devices for younger, middle-aged, and older adults (n=72) who were experienced mouse users. Participants used both preferred and non-preferred hands to perform an item selection and text entry task simulating a typical web page interaction. Older adults performed more slowly than middle-aged adults who in turn performed more slowly than young adults. Performance efficiency was superior with the mouse for older adults only on the first two trial blocks. Thereafter mouse and light pen yielded equivalent performance. For other age groups, mouse and light pen were equivalent at all points of practice. Contrary to prior research revealing superior performance with a light pen for pure pointing tasks, these results suggest that older adults may initially perform worse with a light pen than a mouse for mixed tasks.
Integrating Heterogeneous Personal Devices with Public Display-Based Information Services
Authors: Marc Jansen, Ismail Uzun, Ulrich Hoppe, Philipp Rossmanith
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Based on a requirements analysis for public location information displays in on-campus settings, we describe the implementation of a system called "SynchroBoard". Especially, we elaborate on mechanisms to integrate different personal devices in this framework.
A Ubiquitous Context-sensitive Multimodal Multimedia Computing System and Its Machine Learning-based Reconfiguration at the Architectural Level
Authors: Manolo Dulva Hina, Amar Ramdane-Cherif, Chakib Tadj
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, we present our work on a ubiquitous context-sensitive multimodal multimedia computing system that progressively acquires machine knowledge. This ubiquitous computing system supports an automatic selection of media and modalities deemed appropriate for the user's context and user's profile. The ability of the system to do so constitutes its acquired knowledge. The decision making for media/modality selection takes into account if the user has some special needs due to disability. The architecture of the system is designed to be pervasive and is conceived to resist failure. In case of one or more components being missing or found defective, the machine would resist failure by reconfiguring itself dynamically in the architectural level. It finds alternative replacement to the failed component using its acquired knowledge.
New charge pumping model for the analysis of the spatial trap distribution in the nitride layer of SONOS devices
Authors: A. Arreghini, F. Driussi, D. Esseni, L. Selmi, M. J. van Duuren, R. van Schaijk
Venue: Microelectronic Engineering (2005)

This work presents a new analytical model for low frequency Charge Pumping measurements on SONOS memory cells. The charge per cycle that recombines into the nitride layer and its frequency dependence allow us to study the spatial distribution of nitride traps. Experimental results agree with reported nitride trap concentrations and show an interface between the nitride and the silicon substrate in good agreement with TEM pictures of the SONOS devices.
A New Particle Swarm Optimization Technique
Authors: Chunming Yang, Dan Simon
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In this paper, a new particle swarm optimization method (NPSO) is proposed. It is compared with the regular particle swarm optimizer (PSO) invented by Kennedy and Eberhart in 1995 based on four different benchmark functions. PSO is motivated by the social behavior of organisms, such as bird flocking and fish schooling. Each particle studies its own previous best solution to the optimization problem, and its group's previous best, and then adjusts its position (solution) accordingly. The optimal value will be found by repeating this process. In the NPSO proposed here, each particle adjusts its position according to its own previous worst solution and its group's previous worst to find the optimal value. The strategy here is to avoid a particle's previous worst solution and its group's previous worst based on similar formulae of the regular PSO. Under all test cases, simulation shows that the NPSO always finds better solutions than PSO.
Specification and testing of autonomous agents in e-commerce systems: Research Articles
Authors: Manuel Núñez, Ismael Rodríguez, Fernando Rubio
Venue: Software Testing, Verification Reliability (2005)

This paper presents a generic formal framework to specify and test autonomous e-commerce agents. First, the formalism to represent the behaviour of agents is introduced. The corresponding machinery to define how implementations can be tested follows. Two testing approaches are considered. The first of them, which can be called active, is based on stimulating the implementation under test (IUT) with a test. The peculiarity is that tests will be defined as a special case of autonomous e-commerce agent. The second approach, which can be called passive, consists of observing the behaviour of the tested agent in an environment containing other agents. As a case study the framework is applied to the e-commerce system Kasbah. Copyright &copy; 2005 John Wiley & Sons, Ltd.Parts of this paper appeared in &lsquo;Specification of autonomous agents in e-commerce systems&rsquo; by Ismael Rodr&iacute;guez, Manuel N&uacute;&ntilde;ez and Fernando Rubio and in &lsquo;Testing of autonomous agents described as utility state machines&rsquo; by Manuel N&uacute;&ntilde;ez, Ismael Rodr&iacute;guez and Fernando Rubio, Lecture Notes in Computer Science, vol. 3236 (pp. 30&ndash;43 and 322&ndash;336, respectively) &copy; 2004 Springer-Verlag. This revised and expanded version appears with the permission of Springer-Verlag
Techniques de couplage de bureaux: Ambient-Desktop comme illustration
Authors: Nicolas Barralon, Viet-Tung Nguyen, Gaëtan Rey
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Coupling interaction resources is key to ubiquitous computing by permitting users to construct their own interactive spaces. In this article, we examine the requirements related to coupling and we propose a set of middleware techniques (I-AM and the Contextors infrastructure) to support coupling between the interaction resources of conventional workstations. We illustrate the application of these techniques with Ambient-Desktop, a desktop that complies to the look and feel of current graphical desktops extended with novel HCI features for addressing coupling.
Local Controllability for Linear Control Systems on Lie Groups
Authors: Fabiana Cardetti, Dirk Mittenhuber
Venue: Journal of Dynamical and Control Systems (2005)

In this work, we study controllability properties of linear control systems on Lie groups. Using Lie theory of semigroups, we obtain local controllability results for this type of systems. In addition, properties for the flow of the drift vector field X and for the reachable set of the system are presented. Finally, an example on the Heisenberg Lie group is considered, and its properties are proved using the theory developed.
Specification and Verification of Position Based Routing for Mobile Ad Hoc System
Authors: Jinkui Xie, Linpeng Huang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper focus on the decidability of the position based routing in mobile ad hoc system. Based on the Abstract State Machines theory, we provide a formal model ASM PBRAgent for mobile ad hoc system, on which the position based routing runs as a query. In the result, it is shown that the problem of position based routing is PSPACE-complete when the arity of each node's outgoing edges has a fixed upper bound, and the Yao-graph topology is an instance; on the other hand, the problem is EXPSPACE-complete if there is no fixed upper bound on the arity.
Interactive modeling and simulation of transaction flow or network models using the ADA simulation support environment
Authors: Heimo H. Adelsberger
Venue: ACM SIGSIM Simulation Digest (1984)

The Ada Simulation Support Environment (ASSE) is a software system, with the purpose to support the development and maintenance of simulation models written in Ada throughout their life cycle. We describe here the transaction flow or network part of the ASSE, which allows to build models like in GPSS or SLAM. Our view of such models is slightly different from that of the above mentioned languages, which is demonstrated in detail by the server/resource process. The design stres ses modular top-down development using submodels. Models can be developed and tested interactively.
Reduction of fixed charges in atomic layer deposited Al2O3 dielectrics
Authors: J. Buckley, B. De Salvo, D. Deleruyelle, M. Gely, G. Nicotra, S. Lombardo, J. F. Damlencourt, Ph. Hollinger, F. Martin, S. Deleonibus
Venue: Microelectronic Engineering (2005)

In this work we present an original study that shows how to reduce the negative fixed charges of atomic layer deposited Al2O3. The influence of the aluminium oxide growth temperature on this charge is studied here for the first time. The effect of annealing is also considered, and an optimal process is proposed. Relationship with H content is investigated as well. Finally, influences of these charges on the A2O3 transport properties are analyzed.
Normalization of Microarray Data by Iterative Nonlinear Regression
Authors: Jianhua Xuan, Eric Hoffman, Robert Clarke, Yue Wang
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Normalization is an important prerequisite for almost all follow-up microarray data analysis steps. Accurate normalization assures a common base for comparative biomedical studies using gene expression profiles across different experiments and phenotypes. In this paper, we present a novel normalization approach - iterative nonlinear regression (INR) method - that exploits concurrent identification of invariantly expressed genes (IEGs) and implementation of nonlinear regression normalization. We demonstrate the principle and performance of the INR approach on two real microarry data sets. As compared to major peer methods (e.g., linear regression method, Loess method and iterative ranking method), INR method shows a superior performance in achieving low expression variance across replicates and excellent fold change preservation.
A note on a nearest polynomial with a given root
Authors: Stef Graillat
Venue: ACM SIGSAM Bulletin (2005)

In this paper, we consider the problem of a nearest polynomial with a given root in the complex field (the coefficients of the polynomial and the root are complex numbers). We are interested in the existence and the uniqueness of such polynomials. Then we study the problem in the real case (the coefficients of the polynomial and the root are real numbers), and in the real-complex case (the coefficients of the polynomial are real numbers and the root is a complex number). We derive new formulas for computing such polynomials.
Real-Time Task Scheduling for SMT Systems
Authors: Shi-Wu Lo, Kam-Yiu Lam, Tei-Wei Kuo
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Although simultaneous multithreading (SMT) has been shown being an efficient technique to improve processor performance, little work has been done on real-time SMT scheduling. The objective of this paper is to explore realtime SMT scheduling, for independent periodic task sets with schedulability guarantees. We propose emulation-based scheduling algorithms with and without task migration to emulate an adjustable SMT processor over a non-adjustable SMT processol: The schedulability tests for the proposed scheduling algorithms are presented. An approximation bound on the average number of tasks running in parallel is also shown. The performance of the proposed algorithms was evaluated by a series of simulation experiments.
An Efficient NC Tool Path Planning Approach
Authors: K. S. Tsui, K. W. Chan
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

One major problem encountered in NC machining is that cutting load fluctuates in twisty tool paths and increases momentarily when milling concave corners where stock material concentrates. Much research has been conducted on controlling milling forces but the problem remains unsolved. This paper presents a solution to reduce and stabilise cutting load in NC milling operation by applying computational techniques to isolate the concave corners of a machining region, thereby forming a major region and a number of disjoint sub-regions. Due to the suppression of concave corners, the boundary profile of the major region will become smoother. Contour-parallel offset tool paths can then be used to remove the material in the major region. For the isolated sub-regions, special corner removing tool paths with the use of different cutter sizes will be employed. By using this approach, the adverse effects caused by excessive undulation of milling tool path can be reduced.