ppxscal/embedding_network huggingface dataset:
Services Web Adapt&eacute;s aux utilisateurs nomades
Authors: Céline Lopez-Velasco, Marlène Villanova-Oliver, Jérôme Gensel, Hervé Martin
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Web services, emergent technologies based on standard architecture and standard languages, allow interoperability between different actors (provider and requestor of services). However today, no Web service standard takes really into account the adaptation concept. This is a crucial issue since the users do not only expect Web services to fulfil their needs but also to be adapted to their profiles (personal characteristics and environmental ones) and, especially in the case of nomadic users, to be adapted to both their location and the limited capabilities of their devices. We propose an extension, called AWSDL, of the standard of Web services description language (WSDL) in order to support the Web services adaptation. A module has been developed in order to evaluate how the AWSDL descriptions of Web services and user requests match.
Practical Application of Support-Based Distributed Search
Authors: Peter Harvey, Chee Fon Chang, Aditya Ghose
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Algorithms for Distributed Constraint Satisfaction Problems have tended to mirror existing non-distributed global-search or local-search algorithms. Unfortunately, existing distributed global-search algorithms derive from classical backtracking search methods and require a total ordering over variables for completeness. Distributed variants of local-search algorithms (such as distributed breakout) inherit the incompleteness properties of their predecessors. A meeting scheduling problem translates to a DisCSP where a global ordering is difficult to maintain and creates undesirable behaviours. We present a practical demonstration of an algorithm in which a global ordering is not required, while avoiding the problems of local-search algorithms.
Une architecture hybride pour i'interrogation et i'administration des capteurs
Authors: Levent Gürgen, Cyril Labbé, Vincent Olive, Claudia Roncancio
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Sensors have been successfully applied in many fields namely, military, house automation, medical and urban environments where they make information omnipresent. However, much work needs to be done on administration and querying sets of sensors. This paper presents an architecture for management of data streams coming from heterogeneous sensors. Our proposal is inspired by two traditional approaches. The first one is based on networks of "intelligent" sensors allowing data processing in a strongly distributed way. The second approach manages continuous data streams using a centralized or slightly distributed platform. We propose a hybrid approach combining the advantages of current approaches in order to build scalable solutions.
Intelligent Feature Extraction for Ensemble of Classifiers
Authors: PauloV. W. Radtke, Robert Sabourin, Tony Wong
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a two-level approach to create ensemble of classifiers based on intelligent feature extraction and multi-objective genetic optimization. The first stage optimizes a set of representations, which is used to create classifiers. The second stage then optimizes the ensemble's aggregated classifiers. To assess the approach's feasibility, a set of tests with isolated handwritten digits is performed. The experimental results encourage further researches in this direction, as the optimized ensemble of classifiers outperforms the single classifier approach.
Managing energy consumption costs in desktop PCs and LAN switches with proxying, split TCP connections, and scaling of link speed
Authors: Chamara Gunaratne, Ken Christensen, Bruce Nordman
Venue: International Journal of Network Management (2005)

The IT equipment comprising the Internet in the USA uses about $6 billion of electricity every year. Much of this electricity use is wasted on idle, but fully powered-up, desktop PCs and network links. We show how to recover a large portion of the wasted electricity with improved power management methods that are focused on network issues.
An Extended Event Matching Approach in Content-based Pub/Sub Systems for EAI
Authors: Gang Xu, Wei Xu, Tao Huang
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

Content-based publish/subscribe offers a convenient abstraction for information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike in the traditional address-based unicast or multicast, its core problem is how to match events by predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of nonsemantic constraints. But, in context of enterprise application integration, although they can match events by their contents, this traditional matching predicates are not expressive enough in manipulating the complex event matching, such as the "one-tomany" and "many-to-one" matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend this simple matching approach to the multisemantic matching approach and further introduce the temporal constraint variable. The multi-semantic matching approach allows using different operations in accordance with different semantics; the temporal constraint variable supports processing several discrete events in temporal sequences. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs, the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
The social dynamics of instrumental computer use
Authors: Rob Kling, Walter Scacchi, Phillip Crabtree
Venue: ACM SIGSOC Bulletin (1978)

During the last three decades, computing has far surpassed its early role as a laboratory device for scientific computation. Computers are presently used for a wide array of purposes. In most of its uses it is portrayed as a problem-solving <u>tool</u> and as a material or intellectual object. Despite continuing technical advances, computer use is still costly in its demands for attention and special skills by people (instrumental users) who try to use it to further their own work, whether they program or not. These problems occur because much computer use is inextricably embedded in a complex set of problematic social relationships between groups of service providers and consumers. In particular, serious and continual use of computing forces users to attend to issues associated with:1. The work setting of computer use;2. Understanding the capabilities of computing;3. The scope and rate of technical change;4. Insuring that data is accurate, complete, and timely;5. Control over computing resources;6. The overall time that attention to these social and technical issues require.The opportunities and problems of instrumental computer use vary when users utilize different technologies and different organizational arrangements for supporting them. However, as software and hardware developments progress, the social arrangements of computer use will increasingly dominate the attention of users.
Segmentation of Connected Chinese Characters Based on Genetic Algorithm
Authors: Xianghui Wei, Shaoping Ma, Yijiang Jin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The accuracy of segmenting Chinese character, especially connected Chinese characters, is essential for the performance of a Chinese character recognition system. In this paper, a new approach for segmenting connected Chinese characters based on genetic algorithm is proposed. The best segmentation path is evolved by genetic algorithm from a fixed area located in the middle of character image which is defined as Segmentation Path Zone (SPZ). The initial population is composed of each point line in SPZ. The individual coding, fitness function, crossover operator and mutation operator are also defined for this task. Experimental results on a dataset extracted from the Four Vaults show that our approach can get an average accuracy of 88.9% on test set and can handle some complex types of connected Chinese characters without special heuristic rules.
Abstract Interactions and Interaction Refinement in Model-Driven Design
Authors: Joao Paulo Almeida, Remco Dijkman, Luis Ferreira Pires, Dick Quartel, Marten van Sinderen
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

In a model-driven design process the interaction between application parts can be described at various levels of platform-independence. At the lowest level of platform-independence, interaction is realized by interaction mechanisms provided by specific middleware platforms. At higher levels of platform-independence, interaction must be described in such a way that it can be further refined and realized onto a number of different middleware platforms, each with its particular interaction mechanisms and implementation constraints. In this paper we investigate concepts that support interaction design at various levels of middleware-platformindependence. Also, we propose design operations for interaction refinement. The application of these operations to source designs results in target designs that take into account implementation constraints imposed by platforms, while preserving characteristics prescribed in source designs.
Trade-off Analysis in Web Development
Authors: Sven Ziemer, Tor Stålhane, Magnar Sveen
Venue: Proceedings of the third workshop on Software quality (2005)

Many Web Applications are depending on keeping a loyal user group. This is partly archived by frequent updates, including new content, new presentation and new functionality. Time-to-market (TTM) is an important requirement for these updates. This pose a challenge for the quality of Web Applications, which have to be balanced properly. When prioritising new requirements, the benefits and the consequences have to be assessed and conflicts between requirements have to be resolved. This can be done by using trade-off analysis. A tool that can be used to facilitate a trade-off analysis is the Quality Function Deployment (QFD) method. This paper reports on an experiment that we have conducted to observe how QFD contributes to resolve conflicts between requirements, to make a prioritisation and to enhance the communication in a development team.
Review of "Mathematical Modeling for Water Pollution Control Processes, by Thomas M. Keinath and Martin P. Wanielista", Ann Arbor Science Publishers
Venue: ACM SIGSIM Simulation Digest (1976)

This volume dealing with dynamic and steadystate simulation and mathematical models focuses on process performance models in water pollution control. According to the author, the volume has three major purposes: (1) establishment of the current status of these models, with special attention given to model development, data requirements, simulation techniques and applicability; (2) identification of models possessing actual design and operation applications; and (3) defining simplied models and mathematically simulate the ecosystems discussed. The authors of the various chapters have done much to help the editors achieve their goals. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance Metrics of IP Multicast Sessions
Authors: Han Gao, Michael E. Papka, Rick L. Stevens
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Most research on design and implementation of multicast network systems has concentrated mainly on the capacities of network devices, without completely considering the impact from multicast sessions on network systems. This impact heavily depends on the activities during the life span of multicast sessions, such as the session initialization, communication, termination, and membership management, and on the influence within the overall architecture context of multicast sessions, such as routing devices and protocols. Based on the fundamental rules and principles of multicast sessions, this paper defines performance metrics for IP multicast sessions. The paper summarizes the metrics in four categories: latency, quality of service, group characteristics, and link bandwidth consumptions. Also presented are results from our simulations.
Art exhibition: impossible geographies 01
Authors: Petra Gemeinboeck, Mary Agnes Krell
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Impossible Geographies 01: Memory is an interactive installation in which memory becomes the metaphor for the fluid boundaries between the physical and the virtual. It dynamically traces visitor's actions and mixes them in unexpected ways with memories captured by the physical space. Throughout the exhibition, those memories of visitors and actions seep into the present environment, creating a virtually woven fabric of events that grows and evolves over time. This paper discusses the experience of (temporarily) inhabiting a space that senses, captures and remembers.
Cognitive comparison of 3D interaction in front of large vs. small displays
Authors: F. Tyndiuk, G. Thomas, V. Lespinet-Najib, C. Schlick
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

This paper presents some experimental results on the comparison of users performance for different kinds of 3D interaction tasks (travel, manipulation), when using either a standard desktop display or a large immersive display. The main results of our experimentation are the following: first, not all users benefit similarly from the use of large displays, and second, the gains of performance strongly depend on the nature of the interaction task. To explain these results, we borrow some tools from cognitive science in order to identify one cognitive factor (visual attention) that is involved in the difference of performance that can be observed.
Machine learning in metrical task systems and other on-line problems
Authors: Carl Burch
Venue:  (2000)

We establish and explore a new connection between two general on-line scenarios deriving from two historically disjoint communities. Though the problems are inherently similar, the techniques and questions developed for these two scenarios are very different. From competitive analysis comes the problem of metrical task systems, where the algorithm is to decide in which state to process each of several sequential tasks, where each task specifies the processing cost in each state, and the algorithm must pay according to a metric to move between states. And from machine learning comes the problem of predicting from expert advice&mdash;that is, of choosing one of several experts for each query in a sequence without doing much worse than the best expert overall. The dissertation includes four results touching on this connection. We begin with the first metrical task system algorithm that can guarantee for every task sequence that the ratio of its expected cost to the cheapest way to process the sequence is only polylogarithmic in the number of states. Then we see how we can use expert-advice results to combine on-line algorithms on-line if there is a fixed cost for changing between the on-line algorithms. The third result establishes new expert-advice algorithms deriving from metrical task system research; in addition to establishing theoretical bounds, we compare the algorithms empirically on a process migration scenario. Finally, we investigate a modified version of paging, where we want to do well against an adversary who is allowed to ignore a paging request cheaply.
Yama: A Scalable Generational Garbage Collector for Java in Multiprocessor Systems
Authors: R. M. Muthukumar D. Janakiram
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

The current state-of-the-art generational garbage collector pauses all the program threads when it performs young and old generation garbage collection. As the number of program threads increases, the delay due to garbage collection also increases, thus restricting the scalability of the collector. In order to improve the scalability and reduce the pause time, an on-the-fly generational garbage collector called Yama is proposed for multiprocessor systems. This uses the on-the-fly deferred reference counting in the young generation and the DLG (Doligez Leroy Gonthier) on-the-fly mark and sweep garbage collector in the old generation. We have proposed and experimented with two novel variations of the on-the-fly deferred reference counting called Chitragupt1 and Chitragupt2 in the young generation. Yama does not pause all the application threads simultaneously. An adaptive tenuring policy based on object reference count and survival rate is also proposed. Yama has been implemented in the IBM Jikes RVM (Research Virtual Machine). The above claims are supported with experimental results for standard benchmark programs. The results show that Yama has an extremely low pause time in both the young and the old generation. The pause time reduction results in better response times for the user programs.
REDEPEND-REACT: an Architecture Analysis Tool
Authors: Gemma Grau, Xavier Franch, Neil A. M. Maiden
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The i approach includes the construction of Strategic Dependency models (SD) developed to model information systems that can be applied in a wide variety of contexts. We are interested in the formulation of metrics over i models to be used in components system architectures analysis. These metrics are defined to analyse the models with respect to some properties that are interesting for the system being modelled, such as security, efficiency or accuracy. Metrics are defined in terms of the actors and dependencies of the models and the results of their evaluation are used to inform multiple component selection. As the definition and evaluation of the property metrics are cumbersome activities, the need of tool support arises. Thus, we have enlarged REDEPEND, a Microsoft Visio plug-in that graphically models system goals using the i formalism, to support the definition and evaluation of architectural properties obtaining the REDEPENDREACT prototype.
Federated Identity Management
Authors: Simon S. Y. Shim, Geetanjali Bhalla, Vishnu Pendyala
Venue: Computer (2005)

The Liberty Alliance is developing a framework for identity-based Web services.
Text Classification without Negative Examples Revisit
Authors: Gabriel Pui Cheong Fung Jeffrey X. Yu, Hongjun Lu Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Traditionally, building a classifier requires two sets of examples: positive examples and negative examples. This paper studies the problem of building a text classifier using positive examples (P) and unlabeled examples (U). The unlabeled examples are mixed with both positive and negative examples. Since no negative example is given explicitly, the task of building a reliable text classifier becomes far more challenging. Simply treating all of the unlabeled examples as negative examples and building a classifier thereafter is undoubtedly a poor approach to tackling this problem. Generally speaking, most of the studies solved this problem by a two-step heuristic: First, extract negative examples (N) from U. Second, build a classifier based on P and N. Surprisingly, most studies did not try to extract positive examples from U. Intuitively, enlarging P by P' (positive examples extracted from U) and building a classifier thereafter should enhance the effectiveness of the classifier. Throughout our study, we find that extracting P' is very difficult. A document in U that possesses the features exhibited in P does not necessarily mean that it is a positive example, and vice versa. The very large size of and very high diversity in U also contribute to the difficulties of extracting P'. In this paper, we propose a labeling heuristic called PNLH to tackle this problem. PNLH aims at extracting high quality positive examples and negative examples from U and can be used on top of any existing classifiers. Extensive experiments based on several benchmarks are conducted. The results indicated that PNLH is highly feasible, especially in the situation where |P| is extremely small.
Synthesis of Real-Time Implementations from Component-Based Software Models
Authors: Zonghua Gu, Kang G. Shin
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Component-based software development is an effective technique for tackling the increasing complexity of large-scale embedded software systems. After building a logical software model, the designer must make design decisions, including choosing a multi-threading strategy and assigning priorities to threads, to ensure that the final implementation on the target execution platform satisfies non-functional requirements. Code generators for software design tools produce functional code, but typically ignore concurrency and timing issues. In this paper, we describe techniques for real-time scheduling and design-space exploration and optimization, with the goal of helping the designer synthesize efficient real-time implementations from component-based software models. Experimental evaluation shows that our techniques yield high-quality implementations with reasonable running time of the optimization algorithm.
A Model-Based Sampling and Sample Synthesis Method for Auto Identification in Computer Vision
Authors: Nanfei Sun, Norman Haas, Jonathan H. Connell, Sharath Pankanti
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

The need for a large sample size grows exponentially with the dimensionality of the feature space ("curse of dimensionality" [4, 6]), which increases the labor cost during the training procedure and severely restricts the number of the practical applications. While feature selection methods can often alleviate the problems associated with the curse of dimensionality, complex large scale pattern recognition problems may not be amenable to features selection approach due to large intrinsic dimensionality. In such situations, the only effective solution to conquer the complications of the high-dimensional functions is to incorporate knowledge about the data that is correct [4]. How to incorporate the domain knowledge with the specific machine learning system has been widely studied in the pattern classification field. In this paper, we will explore a novel method to synthesize a larger, valid training sample data set based on a smaller set of the key samples that are collected by a model based sampling theory that incorporates the domain knowledge of the computer vision. In addition to reducing the training sample size in the learning procedure, our emphasis is on providing practical advice on how to incorporate domain knowledge to design and simplify a vision based pattern classification model.