ppxscal/embedding_network huggingface dataset:
A Negotiation Protocol Description Language for Automated Service Level Agreement Negotiations
Authors: Sebastian Hudert, Torsten Eymann, Heiko Ludwig, Guido Wirtz
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

The vision of an open and global Internet of Services (IoS) is driven by globalization and fast changing settings when trading on a world-wide scope. It requires automated on-line techniques for handling services and resources themselves, for advertising and discovery as well as for the on-the-flynegotiation of proper terms for their use. In such a setting covering completely different branches and traditions of business, a flexible infrastructure for negotiating service level agreements is mandatory. In this paper, we propose an extended service usage cycle suitable for IoS along with an expressive but still machine manageable protocol description language capable of specifying a multitude of different negotiation protocols. It supports the extended usage cycle and permits choosing services with appropriate SLA negotiation styles as well as performing SLA negotiations based on the style agreed by potential business partners.
Layered Dynamic Textures
Authors: Antoni B. Chan, Nuno Vasconcelos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

A novel video representation, the layered dynamic texture (LDT), is proposed. The LDT is a generative model, which represents a video as a collection of stochastic layers of different appearance and dynamics. Each layer is modeled as a temporal texture sampled from a different linear dynamical system. The LDT model includes these systems, a collection of hidden layer assignment variables (which control the assignment of pixels to layers), and a Markov random field prior on these variables (which encourages smooth segmentations). An EM algorithm is derived for maximum-likelihood estimation of the model parameters from a training video. It is shown that exact inference is intractable, a problem which is addressed by the introduction of two approximate inference procedures: a Gibbs sampler and a computationally efficient variational approximation. The trade-off between the quality of the two approximations and their complexity is studied experimentally. The ability of the LDT to segment videos into layers of coherent appearance and dynamics is also evaluated, on both synthetic and natural videos. These experiments show that the model possesses an ability to group regions of globally homogeneous, but locally heterogeneous, stochastic dynamics currently unparalleled in the literature.
Design of Wearable Interface Considering Touch Communications
Authors: Mariko Kato, Naoki Saiwaki
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Wearable computing has the image of the high-level information processing which uses the small-sized computer. However, a motion of the body is barred by the complexity of wiring or apparatus and the function of assistance of operation which is the function of original dress is disregarded in many cases. Moreover, it tends to be kept at a distance that externals look like the cyborg by a general person. On the other hand, the interface that uses the movement of the body recently is actively researched. Then, the prototype system of a good design and fit was developed for the college woman and evaluated in this research. The system has the touch interfaces that pay attention to touch communications and can do the music sharing and the voice conversation by two-way, and the switch can be done by touch.
Sound and Efficient Dynamic Verification of MPI Programs with Probe Non-determinism
Authors: Anh Vo, Sarvani Vakkalanka, Jason Williams, Ganesh Gopalakrishnan, Robert M. Kirby, Rajeev Thakur
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

We consider the problem of verifying MPI programs that use MPI_Probe and MPI_Iprobe. Conventional testing tools, known to be inadequate in general, are even more so for testing MPI programs containing MPI probes. A few reasons are: (i) use of the MPI_ANY_SOURCE argument can make MPI probes non-deterministic, allowing them to match multiple senders, (ii) an MPI_Recv that follows an MPI probe need not match the MPI_Send that was successfully probed, and (iii) simply re-running the MPI program, even with schedule perturbations, is insufficient to bring out all behaviors of an MPI program using probes. We develop several key insights that help develop an elegant solution: prioritizing MPI processes during dynamic verification, handling non-determinism, and safe handling of probe loops. These solutions are incorporated into a new version of our dynamic verification tool ISP. ISP is now able to efficiently and soundly verify larger MPI examples, including MPI-BLAST and ADLB.
Finding reliable users and social networks in a social internetworking system
Authors: Pasquale De Meo, Antonino Nocera, Giovanni Quattrone, Domenico Rosaci, Domenico Ursino
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

Social internetworking systems are a significantly emerging new reality; they group together a set of social networks and allow their users to share resources, to acquire opinions and, more in general, to interact, even if these users belong to different social networks and, therefore, did not previously know each other. In this context the notions of trust and reputation play a very relevant role. These notions have been widely studied in the past in several contexts whereas they have been largely neglected in the social internetworking research; however, since this application field presents several peculiarities, the results found in other application contexts are not automatically valid here. This paper introduces a model to represent and handle trust and reputation in a social internetworking system and proposes an approach that exploits these parameters to provide users with suggestions about the most reliable persons they can contact or social networks they can register to.
On Three Classes of Division Queries Involving Ordinal Preferences
Authors: Patrick Bosc, Olivier Pivert, Olivier Soufflet
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

In this paper, we are interested in taking preferences into account for a family of queries inspired by the relational division. A division query aims at retrieving the elements associated with a specified set of values and usually the results remain not discriminated. So, we suggest the introduction of preferences inside such queries with the following specificities: i) the user gives his/her preferences in an ordinal way and ii) the preferences apply to the divisor which is defined as a hierarchy of sets. Different uses of the hierarchy are investigated, which leads to queries conveying different semantics and the property of the result in terms of a quotient is studied. A special attention is paid to the implementation of such queries using a regular database management system and some experimental results illustrate the feasibility of the approach.
Research and Realization of Geospatial Information Service Orchestration Based on BPEL
Authors: Xiaoliang Meng, Fuling Bian, Yichun Xie
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Geospatial information services composition is a promising approach to construct complex Web GIS applications. BPEL, which is the language and the industry standard that expresses complex concurrent business processes for web services composition, is efficient at composing the geospatial information services chain. This paper concludes the BPEL control flows to four basic models which can be applied to orchestrate the geospatial information services, and realizes the data reduction process service based on BPEL in a watershed management system.
Computing complex events in an event-driven and logic-based approach
Authors: Darko Anicic, Paul Fodor, Nenad Stojanovic, Roland Stühmer
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

In this paper we propose to demonstrate a logic-based and data-driven complex event processor. The event processor is called ETALIS (Event-driven Transaction Logic Inference System). ETALIS is based on decomposition of complex event patterns into patterns goals. Goals are asserted by declarative rules, which are executed in the backward chaining mode. A specific property of these rules is that they are event-driven, and allow reasoning over events relationships.
The Research on Algorithm of Greatest Available Logical Time in HLA
Authors: Wang Ziying, Song Ping, Li Kejie
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The time management service has important influence on performance of distributed simulation in high level architecture (HLA). For the conservative time advance mechanism, the algorithm of greatest available logical time (GALT) is key to decide whether time management service in the interface specification of HLA can be realized successfully. The in transit messages which had been sent by federates but have not been received by run time infrastructure (RTI) needs taking into consideration in the computation of GALT. In this paper, an algorithm for GALT is presented based on basic principle of Mattern's algorithm which can catch in transit messages and stature measurement algorithm. In the end, the experiment is carried out to evaluate algorithm for GALT computation.
Online collective entity resolution
Authors: Indrajit Bhattacharya, Lise Getoor
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Entity resolution is a critical component of data integration where the goal is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases that have unresolved entities, we motivate the problem of quick and accurate resolution for answering queries over such 'unclean' databases. Since collective entity resolution approaches - where related references are resolved jointly - have been shown to be more accurate than independent attribute-based resolution, we focus on adapting collective resolution for answering queries. We propose a two-stage collective resolution strategy for processing queries. We then show how it can be performed on-the-fly by adaptively extracting and resolving those database references that are the most helpful for resolving the query. We validate our approach on two large real-world publication databases where we show the usefulness of collective resolution and at the same time demonstrate the need for adaptive strategies for query processing. We then show how the same queries. can be answered in real time using our adaptive approach while preserving the gains of collective resolution. This work extends work presented in (Bhattacharya, Licamele, & Getoor 2006).
Nonlocal Similarity Image Filtering
Authors: Yifei Lou, Paolo Favaro, Stefano Soatto, Andrea Bertozzi
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

We exploit the recurrence of structures at different locations, orientations and scales in an image to perform denoising. While previous methods based on "nonlocal filtering" identify corresponding patches only up to translations, we consider more general similarity transformations. Due to the additional computational burden, we break the problem down into two steps: First, we extract similarity invariant descriptors at each pixel location; second, we search for similar patches by matching descriptors. The descriptors used are inspired by scale-invariant feature transform (SIFT), whereas the similarity search is solved via the minimization of a cost function adapted from local denoising methods. Our method compares favorably with existing denoising algorithms as tested on several datasets.
Fuzzy SQL Queries with Weights Based on Fuzzy Logic Conjunctions
Authors: Ying-Chao Zhang, Wang Hui, Xiao-Ling Ye
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The previous work studied such queries as simple query, compound query, multi-relational query, sub-query and etc, which solved fuzzy questions to some extent. But the logic conjunction was always AND or OR, Based on Zadeh’s fuzzy theory, fuzzy logic conjunctions and weights are introduced here to extend fuzzy queries. This kind of fuzzy query will be solved here through combinations of fuzzy theory and SQL functions, which will improve fuzzy query system, thus enabling more effective queys.
A Hybrid Approach to Land Cover Classification from Multi Spectral Images
Authors: Primo Zingaretti, Emanuele Frontoni, Eva Savina Malinverni, Adriano Mancini
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This work is part of a wider project whose general objective is to develop a methodology for the automatic classification, based on CORINE land-cover (CLC) classes, of high resolution multispectral IKONOS images. The specific objective of this paper is to describe a new methodology for producing really exploitable results from automatic classification algorithms. Input data are basically constituted by multispectral images, integrated with textural and contextual measures. The output is constituted by an image with each pixel assigned to one out of 15 classes at the second level of the CLC legend or let unclassified (somehow a better solution than a classification error), plus a stability map that helps users to separate the regions classified with high accuracy from those whose classification result should be verified before being used.
Formal Specification and Analysis of Intelligent Network Management System by Using Colored Petri Net
Authors: Feng Yu, JunZhou Luo, Wei Li, LaLin Jiang
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Intelligent Network Management system based on Agent becomes increasingly important autonomous network management research topic. Previous work paid little attention to its formal specification and analysis. Here, an improved Color Petri Net named as Adaptive Colored Petri Net is presented to do such work. Main modifications of the Colored Petri Net lie in two points. Firstly, weight defined in it is adaptively self- selected. Secondly, transition in it is divided into two types: and-t and or-t to simulate practical manage actions. Elements of Intelligent Network Management system such as agent, manage task or executive scheme are packed as color tokens and firing rules are modified to adjust to practical management request. Several characters are shown with property analysis of Adaptive Colored Petri Net. Endeavor we done aims to be good for Intelligent Network Manage system designing and verifying.
Reduced Inverse Distance Weighting Interpolation for Painterly Rendering
Authors: Giuseppe Papari, Nicolai Petkov
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

The interpolation problem of irregularly distributed data in a multidimensional domain is considered. A modification of the inverse distance weighting interpolation formula is proposed, making computation time independent of the number of data points. Only the first K neighbors of a given point are considered, instead of the entire dataset. Additional factors are introduced, preventing discontinuities on points where the set of local neighbors changes. Theoretical analysis provides conditions which guarantee continuity. The proposed approach is efficient and free from magic numbers. Unlike many existing algorithms based on the k-nearest neighbors, the number of neighbors is derived from theoretical principles. The method has been applied to the problem of vector field generation in the context of artistic imaging. Experimental results show its ability to produce brush strokes oriented along object contours and to effectively render meaningful texture details. 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
A 12-mW 264-MHz high linearity sharp roll-off CMOS opamp-RC low-pass filter for MB-OFDM UWB systems
Authors: Anh Tuan Phan, Ronan Farrell, Sang-Gug Lee
Venue: Analog Integrated Circuits and Signal Processing (2009)

This paper presents a high linearity wideband sharp roll-off Opamp-RC low-pass filter (LPF) for Ultra wideband (UWB) applications. The proposed LPF is composed of three biquads' transfer functions with different Q-factors in series. Sharp roll-off is attributed to the steep slope of the peaking of a biquad transfer function with a high Q-factor. The superposition of these biquads also helps extend the bandwidth of the overall LPF transfer function without the cost of extra power dissipation. The effects of biquad arrangements on noise and linearity performances are investigated. A simple operational amplifier (op-amp) is adopted to ensure high frequency characteristics and high linearity performance for the designed filter. The LPF is implemented in 0.13-μm IBM CMOS process from 1.5 V supply. The measured cutoff frequency is 264 MHz with the pass-band ripple of less than 1 dB. Digital frequency tuning is implemented with 40% of tuning range around the cutoff frequency. The amount of out-of-band rejection at 290 MHz and at twice cutoff frequency is 12 dB and about 50 dB, respectively. Good linearity with IIP3 of 23 dBm is obtained. The 6th-order LPF dissipates only 12 mW with the active chip size of 400 × 640 μm2.
A Distributed Optimum Algorithm for Target Coverage in Wireless Sensor Networks
Authors: Hongwu Zhang, Hongyuan Wang, Hongcai Feng
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In order to maximize the network lifetime for target coverage, we propose a distributed optimum coverage algorithm for point target in wireless sensor networks. In this paper, we first present a 1-hop local target coverage problem, next analyze the critical restraint of this problem and introduced the definition of key target, then designed an energy utility function, last established an adaptive adjustment mechanism of the waiting time. Measurement results show that the new algorithm extends 20% longer network lifetime, has good scalability and stability, and a lower computational and communication complexity.
Tailoring Interface for Spanish Language: A Case Study with CHICA System
Authors: Vibha Anand, Paul G. Biondich, Aaron E. Carroll, Stephen M. Downs
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

We developed a clinical decision support system (CDSS) --- Child Health Improvement through Computer Automation (CHICA) - to deliver patient specific guidance at the point of clinical care. CHICA captures structured data from families, physicians, and nursing, staff using a scannable paper user interface - Adaptive Turnaround Documents (ATD) while remaining sensitive to the workflow constraints of a busy outpatient pediatric practice. The system was deployed in November 2004 with an English language only user interface. In July 2005, we enhanced the user interface with a Spanish version of the pre-screening questionnaire to capture information from Spanish speaking families in our clinic. Subsequently, our results show an increase in rate of family responses to the pre-screening questionnaire by 36% (51% vs. 87%) in a four month time period before and after the Spanish interface deployment and up to 32% (51% vs. 83%) since November 2004. Furthermore, our results show that Spanish speaking families, on average, respond to the questionnaire more than English speaking families (85% vs. 49%). This paper describes the design, implementation challenges and our measure of success when trying to adapt a computer scannable paper interface to another language.
Technologies for an Autonomous Wireless Home Healthcare System
Authors: Christine Ho, Michael Mark, Michael Koplow, Lindsay Miller, Alic Chen, Elizabeth Reilly, Jan Rabaey, Jim Evans, Paul Wright
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

We present a design study highlighting our recent technological developments that will enable the implementation of autonomous wireless sensor networks for home healthcare monitoring systems. We outline the power requirements for a commercially available implantable glucose sensor which transmits measurements to an external wireless sensor node embedded in the home. A network of these sensor nodes will relay the data to a base station, such as a computer with internet connection, which will record and report this data to the user. We explore the feasibility of powering these sensors using energy scavenging from both body temperature gradients and vibrations in the home, and discuss our developments in energy storage and low power consuming hardware.
Shaping Up Clusters with PSO
Authors: Mihaela Breaban, Silvia Luchian
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

This paper presents a method for enhancing the performance of current clustering algorithms; the method is based on Particle Swarm Optimization techniques. Namely, a preprocessing step aims at bringing ”closer” objects whichare likely to belong to the same cluster, while increasing the distance between objects likely to belong to different clusters. Experimental results show significantly improved performance for further clustering procedures especially when non-spherical clusters are involved.
A new approach for steganography in Bengali text
Authors: S. Changder, N. C. Debnath
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

Steganography is the method to hide a message inside another message in such a way that can only be detected by its intended recipient. Text documents have been widely used for a very long time. A number of text steganography algorithms have been introduced. This paper presents a new approach for steganography in Bengali texts. Considering the structure of Bengali alphabet/words, in this approach, we hide the secret message in the text by shifting the specific 'matra' towards left, by shifting the points of some characters and by shifting the character 'ref' respectively. This approach can be categorized under feature coding methods. The approach shows good result on the sample collected from different Bengali newspaper.
On the Recovery of Depth from a Single Defocused Image
Authors: Shaojie Zhuo, Terence Sim
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper we address the challenging problem of recovering the depth of a scene from a single image using defocus cue. To achieve this, we first present a novel approach to estimate the amount of spatially varying defocus blur at edge locations. We re-blur the input image and show that the gradient magnitude ratio between the input and re-blurred images depends only on the amount of defocus blur. Thus, the blur amount can be obtained from the ratio. A layered depth map is then extracted by propagating the blur amount at edge locations to the entire image. Experimental results on synthetic and real images demonstrate the effectiveness of our method in providing a reliable estimate of the depth of a scene.