ppxscal/embedding_network huggingface dataset:
Exploiting Spatio-temporal Correlations for Data Processing in Sensor Networks
Authors: Antonios Deligiannakis, Yannis Kotidis
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

Recent advances in microelectronics have made feasible the deployment of sensor networks for a variety of monitoring and surveillance tasks. In such tasks the state of the network is evaluated either at regular intervals at a base-station, which constitutes a centralized location where the data collected by the sensor nodes can be collected and processed, or continuously through the use of, potentially multiple, continuous queries. In order to increase the network lifetime, multiple techniques have been proposed in order to reduce the data transmitted in the network, since the data communication often constitutes the main source of energy drain in sensor networks. In this work we discuss several data reduction techniques that can be applied for energy-efficient query processing in sensor network applications. All of our proposed techniques seek to identify and take into account the characteristics of the collected data. Depending on the nature of the monitoring application at hand, the targeted data characteristics may range from simply monitoring the variance of a node's measurements to identifying spatio-temporal correlations amongst the values collected by the sensor nodes.
Image Magnification Based on the Properties of Human Visual Processing
Authors: Sung-Kwan Je, Kwang-Baek Kim, Jin-Young Lee, Jae-Hyun Cho
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Image magnification is among the basic image processing operations. The most commonly used techniques for image magnification are based on interpolation method. However, the magnified images produced by the techniques, such as nearest neighbor, bilinear and cubic method, often appear a variety of undesirable image artifacts such as 'blocking' and 'blurring' into the several processing for image magnification. In this paper, we propose image magnification method by properties of human visual system which reduce information during transforming from receptors to ganglion cells in retina and magnify information at visual cortex. Our method uses the whole image to exactly detect the edge information of the image and then emphasizes edge information. Experiment results show that the proposed method solves the drawbacks of the image magnification, such as blocking and blurring, and has a higher PSNR and Correlation than the traditional methods.
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Authors: Kostas Patroumpas, Timos Sellis
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of any priorities concerning delivery of results in mission-critical mobile applications. Query prioritization could be assigned either explicitly after users' preferences or implicitly by the processing engine itself to better regulate system load. In this work, we specifically examine priority-based evaluation of ranked continuous range queries against locations of moving objects streaming into a central processor. We define a versatile model with alternative scoring functions for deciding evaluation strategies adaptable to the relative importance of queries and the current distribution of objects. We also propose a processing mechanism enhanced with ranked priorities, which exploits shared computation and enables critical requests to receive response more frequently than less demanding ones. A comprehensive experimental study with performance results offers concrete evidence that such a scheme is capable of efficiently handling numerous moving queries of varying priorities and spatial extents with minimal system overhead.
Automating the Trace of Architectural Design Decisions and Rationales Using a MDD Approach
Authors: Elena Navarro, Carlos E. Cuesta
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

The impact of architecture is not only significant in the final structure of software, but also in the development process. Architecture itself is assembled by a network of design decisions (DD) composing a design rationale. Such rationale has often been neglected; however it is essential to deal with future change. This is also the role of traceability, the crosscutting relationship describing the evolution of software. The methodology ATRIUM provides the method to manage traceability, by using a Model-Driven Development (MDD) approach where every model element maintains links to related elements in previous and further stages. This proposal defines how these links have been exploited to support the tracing of DDs and their accompanying design rationales (DRs), and study their propagation. We also present how ATRIUM tools support this proposal by introducing DD/DRs and their traceability links from requirements to the target architectural model. These are automatically generated by M2M transformations, avoiding the error-prone task of managing them by hand.
Constructing Efficient Dictionaries in Close to Sorting Time
Authors: Milan Ružić
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

The dictionary problem is among the oldest problems in computer science. Yet our understanding of the complexity of the dictionary problem in realistic models of computation has been far from complete. Designing highly efficient dictionaries without resorting to use of randomness appeared to be a particularly challenging task. We present solutions to the static dictionary problem that significantly improve the previously known upper bounds and bring them close to obvious lower bounds. Our dictionaries have a constant lookup cost and use linear space, which was known to be possible, but the worst-case cost of construction of the structures is proportional to only loglogn times the cost of sorting the input. Our claimed performance bounds are obtained in the word RAM model and in the external memory models; only the involved sorting procedures in the algorithms need to be changed between the models.
Polarity Classification of Public Health Opinions in Chinese
Authors: Changli Zhang, Daniel Zeng, Qingyang Xu, Xueling Xin, Wenji Mao, Fei-Yue Wang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Public health events with major consequences are occurring globally. Increasingly people are expressing their views on these events and government agencies' responses and policies online. Recent years have seen significant interest in investigating methods to recognize favorable and unfavorable sentiments towards specific subjects, including public health opinions, from online natural language text. However, most of these efforts are focused on English. In this paper, we study Chinese opinion mining in the context of public health opinions. We explore two complementary approaches--a Chinese opinionated word-based approach and a machine learning approach. We also conduct related comparative analysis and discuss the important role Chinese NLP techniques play in polarity classification.
Site-Specific versus General Purpose Web Search Engines: A Comparative Evaluation
Authors: Georgios Atsaros, Diomidis Spinellis, Panagiotis Louridas
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

We can distinguish two types of web search engines: general use ones that index and search all the web, and site-specific ones that are provided by individual websites for local searching. A comparison of the effectiveness of the two types allows search engine users to choose the right engine and organizations to decide whether they should develop their own search software or purchase the search function as a service. We evaluate the performance of two general purpose search engines and 10 site-specific ones. The criteria we used are precision and relative recall. We entered 20 queries in each website’s search engine and evaluated the first 10 links. According to the results, Google is in most cases the most efficient search engine. However, in some cases general purpose search engines do not index the website’s content as well as a site-specific engine.
Mobility Management Using Virtual Domain in IPv6-Based Cellular Networks
Authors: Jae-Kwon Seo, Kyung-Geun Lee
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Hierarchical Mobile IPv6 (HMIPv6) has been proposed by Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overheads in employing Mobile IPv6 (MIPv6). However, HMIPv6 causes load concentration at a particular MAP and longer handover latency when inter-domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing scheme. The mobile node (MN) changes the routing path between an MN and a correspondent node (CN) according to the mobile position and the direction of the MN before inter-domain handover occurs. We simulate the performance of the MAP changing scheme and compare with HMIPv6. We also analyze the MAP changing scheme through numerical modeling in comparison with other schemes.
Vendors' perspectives on trust and control in offshore information systems outsourcing
Authors: Ji-Ye Mao, Jae-Nam Lee, Chun-Ping Deng
Venue: Information and Management (2008)

Whereas most discussion of outsourcing has concentrated on the clients' perspective, we investigated the formation of offshore IS vendors' trust in their client and the client's control over the vendor; these were assumed to affect the vendor's performance. Focusing on the Japan-China offshoring context, we conducted a survey of 110 project managers in nine Chinese IS outsourcers. Our findings indicated that trust had a significant effect on project quality but little on cost adherence; the relationship between control and the two vendor performance measures were the opposite of this. Furthermore, information sharing, communication quality, and inter-firm adaptation emerged as three significant contributors to the vendor's trust in the client; goal setting and cultural blending turned out to be significant in influencing the client's control over the vendor. One of the key contributions and implications of our research was that certain offshore client behaviors could shape vendor performance by influencing the vendor's trust in the client and client's control over the vendor, beyond formal contracts. These findings may be useful for both offshore vendors and clients in developing successful IS outsourcing.
EA4UP: An Enterprise Architecture-Assisted Telecom Service Development Method
Authors: Jacques Simonin, Francis Alizon, Jean-Pierre Deschrevel, Yves Le Traon, Jean-Marc Jézéquel, Bertrand Nicolas
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

The cost of a telecom service development is correlated to the discontinuity and the complexity of the process. To solve this problem, we propose a method dedicated to telecom service development, called EA4UP method. The first EA4UP characteristic is the use of the Enterprise Architecture (EA) for the design activity. The EA promotes component reusing, and improves development process continuity thanks to a Model Driven Engineering approach. In this new method, EA enforces the transformation of an analysis model into a design model. The second EA4UP characteristic is to place functions in the core of the method (instead of data). The assessments of eleven projects allow to measure profits of this EA4UP method with regard to the previous ones.
Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem
Authors: Min Xie, Lixin Gao, Haiwa Guan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The minimal cost maximum flow problem is a classical combinational optimization problem. Based on the characteristic of ant algorithm and the minimal cost maximum flow problem, a graph mode is presented to use the ant algorithm to solve the minimal cost maximum flow problem. Simulation results show that the algorithm can efficiently solve minimal cost maximum flow problem in a relatively short time.
Constrained LCS: Hardness and Approximation
Authors: Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

The problem of finding the longest common subsequence (LCS) of two given strings A 1 and A 2 is a well-studied problem. The constrained longest common subsequence (C-LCS) for three strings A 1, A 2 and B 1 is the longest common subsequence of A 1 and A 2 that contains B 1 as a subsequence. The fastest algorithm solving the C-LCS problem has a time complexity of O(m 1 m 2 n 1) where m 1, m 2 and n 1 are the lengths of A 1, A 2 and B 1 respectively. In this paper we consider two general variants of the C-LCS problem. First we show that in case of two input strings and an arbitrary number of constraint strings, it is NP-hard to approximate the C-LCS problem. Moreover, it is easy to see that in case of an arbitrary number of input strings and a single constraint, the problem of finding the constrained longest common subsequence is NP-hard. Therefore, we propose a linear time approximation algorithm for this variant, our algorithm yields a $1 / \sqrt{m_{min}|\Sigma|}$ approximation factor, where m min is the length of the shortest input string and |Σ| is the size of the alphabet.
New Topics from Recent Interactive Evolutionary Computation Researches
Authors: Hideyuki Takagi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

First, we review wide varieties of IEC applications. They include artistic applications such as generating computer graphics, music, and editorial design, acoustic and image signal processing, hearing aid fitting, data mining, architectural design, virtual reality, and others.Secondly, we introduce new type of IEC applications. Major IEC applications are optimizing target systems and creating graphics, images, shapes, sounds, vibrations, and others. We introduce two new types of IEC applications. The first one is measuring human characteristics. IEC is an optimization method based on human subjective evaluation. Likely reverse engineering, we may measure the evaluation characteristics or mental conditions of an IEC user by analyzing the outputs from the target system optimized by the user. The second one is extension of IEC evaluation. Usually IEC optimizes a target system based on IEC user's subjective evaluation, i.e. psychological evaluation. We may extend the evaluation from psychological one to physiological one. We show the framework of the extended IEC.Thirdly, we overview the researches that try to reduce IEC user fatigue and show our latest research in this area. Several approaches have been proposed to reduce IEC user's fatigue; some of them are improving input/output interface, accelerating EC search, allowing human intervention into EC search, estimating human evaluations, and others. Here, we introduce our latest research and show our view.
Sharpness: A Tight Condition for Scalability
Authors: Augustin Chaintreau
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-to-peer application that transmits data among a large group depends on the topology and the synchronization implemented between the peers. This work describes a model designed to shed light on the conditions that enable scalability. Formally, we model here a collection of tasks, each requiring a random amount of time, which are related by precedence constraints. We assume that the tasks are organized along an euclidean lattice of dimension d. Our main assumption is that the precedence relation between these tasks is invariant by translation along any of these dimensions, so that the evolution of the system follows Uniform Recurrence Equations (UREs). Our main result is that scalability may be shown under two general conditions: (1) a criterion called "sharpness" satisfied by the precedence relation and (2) a condition on the distribution of each task completion time, which only depends on the dimension d. These conditions are shown to be tight. This result offers a universal technique to prove scalability which can be useful to design new systems deployed among an unlimited number of collaborative nodes.
An Empirical Study on Software Engineering Knowledge/Experience Packages
Authors: Pasquale Ardimento, Marta Cimitile
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

This paper is concerned with characterization of software engineering knowledge and experience packages (EP) in the user perspective. It presents the first iteration of an evidence-based study. Results are presented from surveys conducted with many practitioners about the available experience bases, and on literature, to improve our understanding about the state of the practice and art for EP. Additionally, the paper presents attributes and their properties that, in the opinion of the participant practitioners, are relevant for characterizing an EP in the user perspective. Subsequently, with regard to this empirical system, the Acceptability indirect measurement model is provided for experience components. Moreover, the test of this measurement model is shown, which involved both developing qualitative evaluations with practitioners, and measuring ten Internet-available experience bases. Finally, the threats to validity are considered that, as usual for pilot studies, call for further investigation.
A Multivariate Fuzzy Analysis for the Regeneration of Urban Poverty Areas
Authors: Paola Perchinunno, Francesco Rotondo, Carmelo Maria Torre
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Urban poverty, specially in the metropolitan areas, represent one of the most relevant problems to both developed and developing countries. The objective of the present work is to identify, based on statistical data, territorial zones characterized by the presence of urban poverty, related to property ownership and the availability of residential services. With this problem in mind, there is an attempt to apply a Total Fuzzy and Relative (TFR) approach, based on a fuzzy measure of the degree of association of an individual to the totality of the poor and an approach of Semantic Distance (multicriteria analysis), based on the definition of a "fuzzy distance" as a discriminating multidimensional reference to urban poverty, in the specific case of the City of Bari.
Algebra of Programming Using Dependent Types
Authors: Shin-Cheng Mu, Hsiang-Shang Ko, Patrik Jansson
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

Dependent type theory is rich enough to express that a program satisfies an input/output relational specification, but it could be hard to construct the proof term. On the other hand, squiggolists know very well how to show that one relation is included in another by algebraic reasoning. We demonstrate how to encode functional and relational derivations in a dependently typed programming language. A program is coupled with an algebraic derivation from a specification, whose correctness is guaranteed by the type system.
Self-Adaptive Networked Entities for Building Pervasive Computing Architectures
Authors: Martin Danek, Jean-Marc Philippe, Petr Honzik, Christian Gamrat, Roman Bartosinski
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

This paper presents a framework for building and modeling a new-generation self-adaptive systems. The first part of the paper proposes an architecture of a self-adaptive networked entity that forms the basic element of the approach. The second part describes a modeling environment based on Matlab / Simulink and one possible implementation of the self-adaptive networked entity. A physical realization of the proposed system is demonstrated on the computation of a simple FIR filter in several FPGAs acting as hardware in the loop in Matlab / Simulink.
A Framework for the Partial Evaluation of SPARQL Queries
Authors: Sergio Flesca, Filippo Furfaro, Andrea Pugliese
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

A framework for the partial evaluation of SPARQL queries on multiple RDF data sources, both at a local and global level, is proposed. According to the proposed approach, global evaluation of queries is accomplished by first performing local evaluation on each data source, then merging the obtained results. When merging the results, term equivalence across different sources is evaluated by looking at the context of each term. Moreover, the framework allows scoring partial answers by evaluating how much a partial answer is able to capture each concept expressed in the query. Finally, a distributed index structure is proposed that supports early pruning of useless intermediate results.
Understanding Emotion in Raag: An Empirical Study of Listener Responses
Authors: Parag Chordia, Alex Rae
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

A survey of emotion in North Indian classical music was undertaken to determine the type and consistency of emotional responses to raag. Participants listened to five one-minute raag excerpts and recorded their emotional responses after each. They were asked to describe the emotions each excerpt evoked and then to adjust six different sliders indicating the degree to which they felt the following: happy, sad, peaceful, tense, romantic, longing. A total of 280 responses were received. We find that both free-response and quantitative judgments of emotions are significantly different for each raag and quite consistent across listeners. We hypothesized that the primary predictors of emotion in these excerpts would be pitch-class distribution, pitch-class dyad entropy, overall sensory dissonance, and note density. Multiple regression analysis was used to determine the most important factors, their relative importance, and their total predictive value (R 2). The features in combination explained between 11% (peaceful) and 33% (happy) of response variance. For all models, a subset of the features were significant, with the interplay between "minor" and "major" scale degrees playing an important role. Although the explanatory power of the current models is limited, the results thus far strongly suggest that raags do consistently elicit specific emotions that are linked to musical properties. The responses did not differ significantly for enculturated and non-enculturated listeners, suggesting that musical rather than cultural factors are dominant.