ppxscal/embedding_network huggingface dataset:
Easily-managed and topology-independent location service for self-organizing networks
Authors: Aline C. Viana, Marcelo D. de Amorim, Serge Fdida, Yannis Viniotis, José F. de Rezende
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

The need for efficient location mechanisms is an important issue in scalable self-organizing networks. Existing solutions are inherently dependent on the spatial distribution of nodes in the topology. This leads to limitations that go against the principles of self-organization. In this paper, we propose Twins, an easily-managed location service for self-organizing networks. Twins defines a logical multidimensional space that is a strict mathematical representation of the network geographic space. This representation is obtained through Hilbert space-filling curves. The geographic space is used for addressing and routing, while localization is based on the curve. Control messages are routed based on the logical structure while data packets are routed in a hop-by-hop basis with greedy next-hop choice. In this paper, we evaluate the Twins management operations in terms of fairness of space sharing and logical/geographic distances between nodes and their location servers. Our results show that Twins assures a fair distribution of control overhead and scales well with the number of nodes.
Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
Authors: A. Kortebi, L. Muscariello, S. Oueslati, J. Roberts
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Despite its well-known advantages, per-flow fair queueing has not been deployed in the Internet mainly because of the common belief that such scheduling is not scalable. The objective of the present paper is to demonstrate using trace simulations and analytical evaluations that this belief is misguided. We show that although the number of flows in progress increases with link speed, the number that needs scheduling at any moment is largely independent of this rate. The number of such active flows is a random process typically measured in hundreds even though there may be tens of thousands of flows in progress. The simulations are performed using traces from commercial and research networks with quite different traffic characteristics. Analysis is based on models for balanced fair statistical bandwidth sharing and applies properties of queue busy periods to explain the observed behaviour.
Personal Identification Utilizing Finger Surface Features
Authors: Damon L. Woodard, Patrick J. Flynn
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we present a novel approach for personal identification which utilizes finger surface features as a biometric identifier. Using dense range data images of the hand, we calculate the curvature-based surface representation, shape index, for the index, middle, and ring fingers. This representation is used for comparisons to determine subject similarity. Our experiments involve the use of a large data set of range images collected over time. We examine the performance of individual finger surfaces as a biometric identifier as well as the performance when using the three finger surfaces in conjunction. The results of our experiments are presented, which indicate that this approach performs well for a first-of-its-kind biometric technique.
Novel Histogram Processing for Colour Image Enhancement
Authors: Jiang Duan, Guoping Qiu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In practice histogram equalization often produces images with unnatural appearances and visually disturbing artefacts. One of the reasons for these unwanted effects is that histogram equalization attempts to force the output image to have a uniform pixel distribution regardless of what the original imageýs pixel distribution may be. In this paper, we present a novel histogram processing algorithm which takes into account the original imageýs pixel distribution in the equalization process. The method uses a single parameter to control the degree of contrast enhancement to ensure that the output have an enhanced appearance which is also faithful to that of the original image and is free of unwanted visually disturbing artefacts. We first develop the algorithm for the luminance channel and then extend the method to the colour components. We present experimental results to demonstrate the better performances of our new method over established methods in the literature.
MosaicShape: Stochastic Region Grouping with Shape Prior
Authors: Jingbin Wang, Erdan Gu, Margrit Betke
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

A method that combines shape-based object recognition and image segmentation is proposed for shape retrieval from images. Given a shape prior represented in a multiscale curvature form, the proposed method identifies the target objects in images by grouping oversegmented image regions. The problem is formulated in a unified probabilistic framework, and object segmentation and recognition are accomplished simultaneously by a stochastic Markov Chain Monte Carlo (MCMC) mechanism. Within each sampling move during the simulation process, probabilistic region grouping operations are influenced by both the image information and the shape similarity constraint. The latter constraint is measured by a partial shape matching process. A generalized cluster sampling algorithm [1], combined with a large sampling jump and other implementation improvements, greatly speeds up the overall stochastic process. The proposed method supports the segmentation and recognition of multiple occluded objects in images. Experimental results are provided for both synthetic and real images.
Learning technologies: affective and social issues in computer-supported collaborative learning
Authors: Ann Jones, Kim Issroff
Venue: Computers Education (2005)

This paper is concerned with affective issues in learning technologies in a collaborative context. Traditionally in learning there has been a division between cognition and affect: where cognition is concerned with skills and processes such as thinking and problem-solving and affect with emotional areas such as motivation, attitudes, feelings. Affective issues have been viewed as somewhat problematic in studying learning, so although it is well known that learner attitude, motivation, and emotional state are very important, they have often been excluded from the frame of research, or studied separately from cognitive learning. This position is gradually changing and this paper considers what previous research has been conducted in these areas. It discusses the role of affective factors in three main areas of collaboration: in settings where learners are co-located, in on-line communities and to support and develop socioemotional skills. It considers relevant developments in these areas, what the outcomes have been and suggests important directions for future research.
On the use of the weighted fuzzy c-means in fuzzy modeling
Authors: George E. Tsekouras
Venue: Advances in Engineering Software (2005)

This paper proposes a fuzzy clustering-based algorithm for fuzzy modeling. The algorithm incorporates unsupervised learning with an iterative process into a framework, which is based on the use of the weighted fuzzy c-means. In the first step, the learning vector quantization (LVQ) algorithm is exploited as a data pre-processor unit to group the training data into a number of clusters. Since different clusters may contain different number of objects, the centers of these clusters are assigned weight factors, the values of which are calculated by the respective cluster cardinalities. These centers accompanied with their weights are considered to be a new data set, which is further elaborated by an iterative process. This process consists of applying in sequence the weighted fuzzy c-means and the back-propagation algorithm. The application of the weighted fuzzy c-means ensures that the contribution of each cluster center to the final fuzzy partition is determined by its cardinality, meaning that the real data structure can be easier discovered. The algorithm is successfully applied to three test cases, where the produced fuzzy models prove to be very accurate as well as compact in size.
An analysis of modularity in aspect oriented design
Authors: Cristina Videira Lopes, Sushil Krishna Bajracharya
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

We present an analysis of modularity in aspect oriented design using the theory of modular design developed by Baldwin and Clark [10]. We use the three major elements of that theory, namely: i) Design Structure Matrix (DSM), an analysis and modeling tool; ii) Modular Operators, units of variations for design evolution; and iii) Net Options Value (NOV), a quantitative approach to evaluate design. We study the design evolution of a Web Services application where we observe the effects of applying aspect oriented modularization.Based on our analysis we get to the following three main conclusions. First, on the structural part, it is possible to apply the DSM to aspect oriented modularizations in a straightforward manner, i.e. without modifications to DSMs basic model. This shows that aspects can, in fact, be treated as modules of design. Second, the evolution of a design into including aspect modules uses the modular operators proposed by Baldwin and Clark, with a variant of the Inversion operator. This variant captures taking redundant, scattered information hidden in modules and moving it down or keeping it at the same level in the design hierarchy. Third, when calculating and comparing NOVs of the different designs of our application, we obtained higher NOV for the design with aspects than for the design without aspects. This shows that, under this theory of modularity, certain aspect oriented modularizations can add value to the design.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows
Authors: Michael Polacek, Richard F. Hartl, Karl Doerner, Marc Reimann
Venue: Journal of Heuristics (2004)

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.
An Inverse Problem for a Parabolic Variational Inequality Arising in Volatility Calibration with American Options
Authors: Yves Achdou
Venue: SIAM Journal on Control and Optimization (2005)

In finance, the price of an American option is obtained from the price of the underlying asset by solving a parabolic variational inequality. The free boundary associated with this variational inequality can be interpreted as the price for which the option should be exercised. The calibration of volatility from the observations of the prices of an American option yields an inverse problem for the previously mentioned parabolic variational inequality. After studying the variational inequality and the exercise price, we give results concerning the sensitivity of the option price and of the exercise price with respect to the variations of the volatility. The inverse problem is addressed by a least square method, with suitable regularization terms. We give necessary optimality conditions involving an adjoint state for a simplified inverse problem and we study the differentiability of the cost function. Optimality conditions are also given for the genuine calibration problem.
Implementation of Visuel MPI Parallel Program Performance Analysis Tool for Cluster Environments
Authors: Kuan-Ching Li, Hsun-Chang Chang, Chao-Tung Yang, Li-Jen Chang, Hsiang-Yao Cheng, Liang-Teh Lee
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we present Visuel tool for performance measurement and analysis of MPI parallel program in cluster environments. Most of tools available today for cluster systems show solely system performance data (e.g., CPU load, memory usage, network bandwidth, machine-room temperature, server average load, among others), being more suitable for system administrators who maintain such system. The Visuel tool is designed to show performance data of all computer nodes involved in the execution of MPZ parallel program, such as CPU load level and memory usage. Additionally, this tool is able to display comparative performance data charts of multiple executions of the application (instrumented with MPI interface) under development.
Time-frequency analysis and instantaneous frequency estimation using two-sided linear prediction
Authors: Abdellah Kacha, Francis Grenez, Khier Benmahammed
Venue: Signal Processing (2005)

This paper presents a new time-frequency distribution which uses a time-dependent two-sided linear predictor model. The current sample is estimated as a weighted sum of the past and future values. The two-sided linear prediction approach yields a smaller prediction error than that obtained by using the usual one-sided linear predictor model. To estimate the time-dependent coefficients of the two-sided linear predictor, these are expanded as a linear combination of a set of time functions basis which leads to an ensemble of equations of the type of Yule-Walker equations. The nonstationary power spectrum estimate is used as a time-frequency distribution to characterize the signal jointly in the time domain and the frequency domain. We show that two-sided prediction-based time-frequency distribution can discriminate two close components in the time-frequency plane that neither Choi-Williams distribution nor one-sided prediction-based time-frequency distribution are capable of resolving. Also, the proposed time-frequency distribution is used to estimate the instantaneous frequency. Examples show that the proposed approach outperforms the usual technique based on the nonstationary autoregressive model.
On Local SIGDAs
Authors: John K. Lowell
Venue: ACM SIGDA Newsletter (1986)

One of the least publicized but no less important activities of SIGDA has been the formation of local SIGDA groups across the country. With a strong, grassroots network in place, the goals and interests of all members can be shared on a local basis. In addition to national meetings like the DAC and ICCAD, and various workshops, the availability of a local SIGDA organization provides another level of ongoing professional interaction. For the national directorate, the network could be used to disseminate information, provide national officer candidates, host regional meetings, and most important, give comments and criticism on SIGDA itself. 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
IntrosPAC: a tool to teach and understand PAC-Amodeus
Authors: Christophe Lachenal, Joëlle Coutaz
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

This article presents IntrosPAC, a software tool based on aspect oriented programming, which, from a PAC-Amodeus compliant source code, generates a graphic representation of the corresponding conceptual architecture. The graphic animation supports developers for understanding the structure of their code as well as for detecting violation of the principles of the reference architecture model. IntrosPAC has been successful in teaching software architecture modeling for interactive systems and in improving students understanding.
An investigation into inference with restricted quantification and a taxonomic representation
Authors: Alan M. Frisch
Venue: Issue 91 (January 1985) (1985)

The goal of this investigation is to design and analyze efficient inference methods that arise when a representation language is augmented with restricted quantification and a taxonomic representation. These inference methods will be demonstrated by integrating them into the design of a logic-programming system and a knowledge retriever.
Energy-Efficient Data Organization and Query Processing in Sensor Networks
Authors: Ramakrishna Gummadi, Xin Li, Ramesh Govindan, Cyrus Shahabi, Wei Hong
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Recent sensor networks research has produced a class of data storage and query processing techniques called Data-Centric Storage that leverages locality-preserving distributed indexes to efficiently answer multi-dimensional range and range-aggregate queries. These distributed indexes offer a rich design space of a) logical decompositions of sensor relation schema into indexes, as well as b) physical mappings of these indexes onto sensors. In this paper, we explore this space for energy-efficient data organizations (logical and physical mappings of tuples and attributes to sensor nodes) and devise purely local query optimization techniques for processing queries that span such decomposed relations.
Automated synthesis of executable web service compositions from BPEL4WS processes
Authors: M. Pistore, P. Traverso, P. Bertoli, A. Marconi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose a technique for the automated synthesis of new composite web services. Given a set of abstract bpel4ws descriptions of component services, and a composition requirement, we automatically generate a concrete bpel4ws process that, when executed, interacts with the components and satisfies the requirement.We implement the proposed approach exploiting efficient representation techniques, and we show its scalability over case studies taken from a real world application and over a parameterized domain.
A service creation environment based on end to end composition of Web services
Authors: Vikas Agarwal, Koustuv Dasgupta, Neeran Karnik, Arun Kumar, Ashish Kundu, Sumit Mittal, Biplav Srivastava
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The demand for quickly delivering new applications is increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standard frameworks or libraries, thus resulting in poor reuse of software assets. Web services have received much interest in industry due to their potential in facilitating seamless business-to-business or enterprise application integration. A web services composition tool can help automate the process, from creating business process functionality, to developing executable workflows, to deploying them on an execution environment. However, we find that the main approaches taken thus far to standardize and compose web services are piecemeal and insufficient. The business world has adopted a (distributed) programming approach in which web service instances are described using WSDL, composed into flows with a language like BPEL and invoked with the SOAP protocol. Academia has propounded the AI approach of formally representing web service capabilities in ontologies, and reasoning about their composition using goal-oriented inferencing techniques from planning. We present the first integrated work in composing web services end to end from specification to deployment by synergistically combining the strengths of the above approaches. We describe a prototype service creation environment along with a use-case scenario, and demonstrate how it can significantly speed up the time-to-market for new services.
iBOM: A Platform for Intelligent Business Operation Management
Authors: Malu Castellanos, Fabio Casati, Ming-Chien Shan, Umesh Dayal
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

As IT systems become more and more complex and as business operations become increasingly automated, there is a growing need from business managers to have better control on business operations and on how these are aligned with business goals. This paper describes iBOM, a platform for business operation management developed by HP that allows users to i) analyze operations from a business perspective and manage them based on business goals; ii) define business metrics, perform intelligent analysis on them to understand causes of undesired metric values, and predict future values; iii) optimize operations to improve business metrics. A key aspect is that all this functionality is readily available almost at the click of the mouse. The description of the work proceeds from some specific requirements to the solution developed to address them. We also show that the platform is indeed general, as demonstrated by subsequent deployment domains other than finance.
Workshop&mdash;predicting the structure of biological molecules: Features - Workshop&mdash;predicting the structure of biological molecules. Isaac Newton Institute, centre for mathematical sciences, Cambridge University, UK
Authors: Damian Counsell
Venue: Comparative and Functional Genomics (2004)

This April, in Cambridge (UK), principal investigators from the Mathematical Biology Group of the Medical Research Council's National Institute of Medical Research organized a workshop in structural bioinformatics at the Centre for Mathematical Sciences. Bioinformatics researchers of several nationalities from labs around the country presented and discussed their computational work in biomolecular structure prediction and analysis, and in protein evolution. The meeting was intensive and lively and gave attendees an overview of the healthy state of protein bioinformatics in the UK. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia
Venue: Mobile and Ubiquitous Multimedia; Vol. 83 (2004)

Welcome to MUM 2004 in College Park, Maryland, USA.The goal of the MUM2004 conference is to provide an international forum for presenting recent research results on mobile and ubiquitous multimedia, and to bring together experts from both academia and industry for an exchange of ideas and discussion on future challenges. The program includes keynote presentations and tutorials by leading experts and contributed papers describing recent progress in mobile and ubiquitous multimedia. The papers presented in the conference are published in this conference proceeding, which will be offered to international publishers.This year, a one day workshop and tutorial theme will center Personal and Institutional Security. We have guest speakers from government, industry and academia, focused on how mobile devices are being used to provide monitoring, security services, and emergency and disaster coordination. The theme follows through into the 2 day conference which will expand to other uses of mobile multimedia in ubiquitous environments.Best Paper and Best Student Paper awards will be presented for outstanding contributions.
SENECA (Semantic Networks for Conceptual Analysis): Universidad Complutense, Madrid, Spain
Authors: E. G. Camarero, J. Garcia Sanz, M. F. Verdejo Centro de Calclo
Venue: Issue 79 (January 1982) (1982)

SENECA (2) is a representation based on semantic networks, allowing the description of objects, their characteristics and relationships. The processes that can be performed in the domain of discourse, modifying the information, can also be represented.