ppxscal/embedding_network huggingface dataset:
Self-Protection for Wireless Sensor Networks
Authors: Dan Wang, Qlan zhang, Jiangchuan Liu
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves are important and critical objects in the network, a natural question is whether they need certain level of protection, so as to resist the attacks targeting on them directly. If this is necessary, then who should provide this protection, and how it can be achieved? We refer to the above problem as self-protection, as we believe the sensors themselves are the best (and often the only) candidate to provide such protection. In this papel; we for the jirst time present a formal study on the selfprotection problem in wireless sensor networks. We show that, if we simply focus on the quality ofjield or object covering, the sensors might not necessarily be self-protected, which in turn makes the system vulnerable. We then investigate dzreerent forms of self-pmtections, and show that the problems are generally NP-complete. We develop eficient approximation algorithms for centrally-controlled sensors. We then extend the algorithms to filly distributed implementation, and introduce a smart sleep-scheduling algorithm that minimize the energy consumption.
An empirical study of XML data management in business information systems
Authors: Eric Jui-Lin Lu, Bo-Chan Wu, Po-Yun Chuang
Venue: Journal of Systems and Software (2006)

Due the popularity of XML, an increasingly large amount of business transactions encoded in XML have been exchanged on-line. Currently there are two approaches to process and manage these XML data. One is to store them in relational databases, and the other is to store them in recently-developed native XML databases. There is no conclusion yet as to which approach suits better for contemporary business information systems. Also, the effectiveness of native XML databases used in daily operational systems has not been completely investigated. Therefore, in this paper, we provide: (1) a complete and systematic survey of the current development and challenges of processing XML data in relational and native XML databases, (2) a useful benchmark for IT practitioners who need to process XML data effectively, (3) experimental results and detailed analysis which reveal several interesting tips that can be helpful to XML document designers, and (4) a conclusion, based on the findings of using native XML databases in EDI processes, that it is practical to use native XML databases for daily operations although our experimental results showed that relational database systems outperform native XML databases in processing XML data.
Extracting queries by static analysis of transparent persistence
Authors: Ben Wiedermann, William R. Cook
Venue: ACM SIGPLAN Notices (2007)

Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent data. When the data is stored in a relational database, however, transparent persistence does not naturally leverage the performance benefits of relational query optimization. We present a program analysis that combines the benefits of both approaches by extracting database queries from programs with transparent access to persistent data. The analysis uses a sound abstract interpretation of the original program to approximate the data traversal paths in the program and the conditions under which the paths are used. The resulting paths are then converted into a query, and the program is simplified by removing redundant tests. We study an imperative kernel language with read-only access to persistent data and identify the conditions under which the transformations can be applied. This analysis approach promises to combine the software engineering benefits of transparent data persistence with the performance benefits of database query optimization.
DESHL--Standards Based Access to a Heterogeneous European Supercomputing Infrastructure
Authors: T. M. Sloan, R. Menday, T. P. Seed, M. Illingworth, A. S. Trew
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper describes the DESHL -- an open standards-based means for accessing the DEISA consortium's heterogeneous supercomputing Grid. The paper provides some background on DEISA before giving an overview of the functionality and architecture of the DESHL.
Bias in parallel and distributed simulation systems
Authors: Tobias Kiesling, Johannes Lüthi, Rachid El Abdouni Khayari
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Even after several decades of research, modeling is considered an art, with a high liability to produce incorrect abstractions of real world systems. Therefore, validation and verification of simulation models is considered an indispensable method to establish the credibility of developed models. In the process of parallelizing or distributing a given credible simulation model, a bias is introduced, possibly leading to serious errors in simulation results. Depending on the mechanisms used for parallelization or distribution, a separate validation of the parallel or distributed model is required. A necessary first step for such a validation is an understanding of the sources of bias that might occur through parallelization or distribution of a simulation model. The intention of this paper is to give an overview of the various types of bias and to give a formal definition of the bias and its quantification.
A Novel Approach for Static Slicing of Inter-Procedural Programs
Authors: Swatee Rekha Mohanty, Durga Prasad Mohapatra, Himansu Sekhar Behara
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

We propose a novel static slicing algorithm for inter-procedural programs. We use the system dependence graph (SDG) as the intermediate representation. We have implemented our algorithm by using file structures to handle all the statements that compute the static slice.
Non-linear estimation of image motion and tracking
Authors: P. Lanvin, J.-C. Noyer, M. Benjelloun
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper details a model-based method to track object in an image sequence and jointly estimates its motion. It uses the grey-level images and no preprocessing, as feature extraction for example, is done on the sequence. The main benefits of this method which avoids this extraction stage is to allow a better localization of the shape. This estimation problem is modelled by state equations which describe the evolution of the object in the sequence and the related measurements and is solved by a non-linear filtering method: the particle filtering.
Market-Based Resource Allocation in Grids
Authors: B. Pourebrahimi, K. Bertels, G. M. Kandru, S. Vassiliadis
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The core goal of resource management is to establish a mutual agreement between a resource producer and a resource consumer by which the provider agrees to supply a capability that can be used to perform some tasks on behalf of the consumer. Market-based approaches introduce money and pricing as the technique for coordination between consumers and producers of resources. In this paper, we propose a market-based mechanism to allocate computational resources (CPU time) with a single central Market in a local Grid. In such a network whenever any node can offer idle CPU time to the Grid and whenever a node has some tasks waiting for free CPU, it may request the resource from the Grid. In our approach, consumers and producers are autonomous agents that make their own decisions according to their capabilities and their local knowledge. Continuous Double Auction model is used as a technique using which these selfish agents can coordinate their work and make their decision. The performance of this mechanism is evaluated and is compared with the simple FCFS mechanism.
Qualitative criteria of admissibility for enforced agreements
Authors: Luigi Sauro
Venue: Computational Mathematical Organization Theory (2006)

It is desirable that artificial agents can help each other when they cannot achieve their goals, or when they profit from social exchanges. In this work we study coalition formation processes supported by enforced agreements and we define two qualitative criteria, the do-ut-des property and the composition property, that establish when a coalition is admissible to be formed. The do-ut-des property is based on a balance between the advantages and the burdens of an agent, when it agrees an enforced agreements. The composition property is a refinement of the do-ut-des property that takes into account also the costs and the risks deriving from the coalition formation process.Two relevant aspects distinguish our approach from the solution criteria developed in cooperative game theory. First, the do-ut-des property and the composition property are not based on an explicit utility function associated to the goals of an agent, and hance they can be used also in that cases in which the importance that agents give to their own goals is unknown. Second, a coalition has all the necessary information to establish if it satisfies the do-ut-des property or the composition property, therefore these two properties can be used in the case not all the space of possible coalitions is known.
Enhancement of Moment Based Painterly Rendering Using Connected Components
Authors: M. Obaid, R. Mukundan, T. Bell
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Moment functions have been used recently to compute stroke parameters for painterly rendering applications. The technique is based on the estimation of geometric features of the intensity distribution in small windowed images to obtain the brush size, colour and direction. This paper proposes an improvement of this method, by additionally extracting the connected components so that adjacent regions of similar colour are grouped for generating large and noticeable brush stroke images. An iterative coarse-to-fine rendering algorithm is used for painting regions of varying colour frequencies. Performance improvements over the existing technique are discussed with several examples.
GRAdient broadcast: a robust data delivery protocol for large scale sensor networks
Authors: Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang
Venue: Wireless Networks (2005)

Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field of small, vulnerable sensors remains a research challenge. In this paper we present GRAdient Broadcast (GRAB), a new set of mechanisms and protocols which is designed specifically for robust data delivery in face of unreliable nodes and fallible wireless links. Similar to previous work [12,13], GRAB builds and maintains a cost field, providing each sensor the direction to forward sensing data. Different from all the previous approaches, however, GRAB forwards data along a band of interleaved mesh from each source to the receiver. GRAB controls the width of the band by the amount of credit carried in each data message, allowing the sender to adjust the robustness of data delivery. GRAB design harnesses the advantage of large scale and relies on the collective efforts of multiple nodes to deliver data, without dependency on any individual ones. We have evaluated the GRAB performance through both analysis and extensive simulation. Our analysis shows quantitatively the advantage of interleaved mesh over multiple parallel paths. Our simulation further confirms the analysis results and shows that GRAB can successfully deliver over 90% of packets with relatively low energy cost, even under the adverse conditions of 30% node failures compounded with 15% link message losses.
Using Program Data-State Diversity in Test Data Search
Authors: Mohammad Alshraideh, Leonardo Bottaci
Venue: Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques (2006)

Search-based automatic software test data generation for structural testing depends on the instrumentation of the test goal to construct a many-valued function which is then optimised. The method encounters difficulty when the search is in a region in which the function is not able to discriminate between different candidate test cases because it returns a constant value. A typical example of this problem arises in the instrumentation of branch predicates that depend on the value of a boolean-valued (flag) variable. Existing transformation techniques can solve many cases of the problem but there are situations for which transformation techniques are inadequate. This paper presents a technique for directing the search when the function that instruments the test goal is not able to discriminate candidate test inputs. The new technique depends on introducing program data-state diversity as an additional search goal. The search is guided by a new evaluation (cost) function made up of two parts, one depends on the conventional instrumentation of the test goal, the other depends on the diversity of the data-states produced during execution of the program under test. The method is demonstrated for a number of example programs for which existing methods are inadequate.
A two-tier method for evaluating alternative policies to support interactive analysis of 3D material flow simulations
Authors: Wilhelm Dangelmaier, Kiran Mahajan, Daniel Huber, Bengt Mueck
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Discrete-event material flow simulation tools have long been offering real-time 3D visualization. This feature allows less experienced users to analyze the underlying system. Beyond this, visualization is not used to interact with the simulated (underlying manufacturing) system to improve or control the material flow, especially under disturbances. This paper presents a simulation based 2-tier framework, which seeks to control or improve material flow by means of real-time user immersive visualization. The first tier uses static optimization to compute the material flow by selecting from a large number of alternative policies based on deterministic disturbances. The second tier is a reactive algorithm which computes solutions for probabilistic disturbances. The results of the two tiers are used for interacting with the underlying system using visualization. We show that the proposed system is able to handle complex alternative policies, which supports interactive analysis of 3D material flow simulations.
On-line Processing of "Pop-Out" Words in Spoken French Dialogues
Authors: Cyrille Magne, Corine Astésano, Anne Lacheret-dujour, Michel Morel, Kai Alter, Mireille Besson
Venue: Journal of Cognitive Neuroscience (2005)

Highlighting relevant information in a discourse context is a major aim of spoken language communication. Prosodic cues such as focal prominences are used to fulfill this aim through the pragmatic function of prosody. To determine whether listeners make on-line use of focal prominences to build coherent representations of the informational structure of the utterances, we used the brain event-related potential (ERP) method. Short dialogues composed of a question and an answer were presented auditorily. The design of the experiment allowed us to examine precisely the time course of the processing of prosodic patterns of sentence-medial or -final words in the answer. These patterns were either congruous or incongruous with regard to the pragmatic context introduced by the question. Furthermore, the ERP effects were compared for words with or without focal prominences. Results showed that pragmatically congruous and incongruous prosodic patterns elicit clear differences in the ERPs, which were largely modulated in latency and polarity by their position within the answer. By showing that prosodic patterns are processed on-line by listeners in order to understand the informational structure of the message, the present results demonstrate the psychobiological validity of the pragmatic concept of focus, expressed via prosodic cues. Moreover, the functional significance of the positive-going effects found sentence medially and negative-going effects found sentence finally is discussed. Whereas the former may reflect the processing of surprising and task-relevant prosodic patterns, the latter may reflect the integration problems encountered in extracting the overall informational structure of the sentence.
Frames, Reproducing Kernels, Regularization and Learning
Authors: Alain Rakotomamonjy, Stéphane Canu
Venue: The Journal of Machine Learning Research (2005)

This work deals with a method for building a reproducing kernel Hilbert space (RKHS) from a Hilbert space with frame elements having special properties. Conditions on existence and a method of construction are given. Then, these RKHS are used within the framework of regularization theory for function approximation. Implications on semiparametric estimation are discussed and a multiscale scheme of regularization is also proposed. Results on toy and real-world approximation problems illustrate the effectiveness of such methods.
Using the Amazon Metric to Construct an Image Database based on what people do, not what they say.
Authors: Theodor G. Wyeld, Robert M. Colomb
Venue: Proceedings of the conference on Information Visualization (2006)

Current image database metadata schemas require users to adopt a specific text-based vocabulary. Textbased metadata is good for searching but not for browsing. Existing image-based search facilities, on the other hand, are highly specialised and so suffer similar problems. Wexelblat's semantic dimensional spatial visualisation schemas go some way towards addressing this problem by making both searching and browsing more accessible to the user in a single interface. But the question of how and what initial metadata to enter a database remains. Different people see different things in an image and will organise a collection in equally diverse ways. However, we can find some similarity across groups of users regardless of their reasoning. For example, a search on Amozon.com returns other products also, based on an averaging of how users navigate the database. In this paper we report on applying this concept to a set of images for which we have visualised them using traditional methods and the Amazon.com method. We report on the findings of this comparative investigation in a case study setting involving a group of randomly selected participants. We conclude with the recommendation that in combination, the traditional and averaging methods would provide an enhancement to current database visualisation, searching, and browsing facilities.
Personal varrier: autostereoscopic virtual reality display for distributed scientific visualization
Authors: Tom Peterka, Daniel J. Sandin, Jinghua Ge, Javier Girado, Robert Kooima, Jason Leigh, Andrew Johnson, Marcus Thiebaux, Thomas A. DeFanti
Venue: Future Generation Computer Systems (2006)

As scientific data sets increase in size, dimensionality, and complexity, new high resolution, interactive, collaborative networked display systems are required to view them in real-time. Increasingly, the principles of virtual reality (VR) are being applied to modern scientific visualization. One of the tenets of VR is stereoscopic (stereo or 3d) display; however the need to wear stereo glasses or other gear to experience the virtual world is encumbering and hinders other positive aspects of VR such as collaboration. Autostereoscopic (autostereo) displays presented imagery in 3d without the need to wear glasses or other gear, but few qualify as VR displays. The Electronic Visualization Laboratory (EVL) at the University of Illinois at Chicago (UIC) has designed and built a single-screen version of its 35-panel tiled Varrier display, called Personal Varrier. Based on a static parallax barrier and the Varrier computational method, Personal Varrier provides a quality 3d autostereo experience in an economical, compact form factor. The system debuted at iGrid 2005 in San Diego, CA, accompanied by a suite of distributed and local scientific visualization and 3d teleconferencing applications. The CAVEwave National LambdaRail (NLR) network was vital to the success of the stereo teleconferencing.
Web Service Indexing for Efficient Retrieval and Composition
Authors: Marco Aiello, Christian Platzer, Florian Rosenberg, Huy Tran, Martin Vasko, Schahram Dustdar
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

The success and widespread use of Web service technology is bound to the availability of tools for rapidly discovering services and for composing their operations. We present a system for service discovery and composition based on syntactic and semantic matching of the published service interfaces. The system relies on accurate preprocessing of the available services, that is, on the indexing time of the services' descriptions. The composition task is performed by index lookup and an efficient heuristic for graph traversing. The presented system is the VitaLab entry for the Syntactic and Semantic WS-Challenge 2006.
An interview with Marten Mickos
Authors: Glyn Moody
Venue: Linux Journal (2007)

Marten Mickos chats about the success of MySQL.
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
Authors: Douglas M. Blough
Venue: IEEE Transactions on Mobile Computing (2006)

Topology control, wherein nodes adjust their transmission ranges to conserve energy and reduce interference, is an important feature in wireless ad hoc networks. Contrary to most of the literature on topology control which focuses on reducing energy consumption, in this paper we tackle the topology control problem with the goal of limiting interference as much as possible, while keeping the communication graph connected with high probability. Our approach is based on the principle of maintaining the number of physical neighbors of every node equal to or slightly below a specific value k. As we will discuss in this paper, having a nontrivially bounded physical node degree allows a network topology with bounded interference to be generated. The proposed approach enforces symmetry on the resulting communication graph, thereby easing the operation of higher layer protocols. To evaluate the performance of our approach, we estimate the value of k that guarantees connectivity of the communication graph with high probability both theoretically and through simulation. We then define k-Neigh, a fully distributed, asynchronous, and localized protocol that uses distance estimation. k-Neigh guarantees logarithmically bounded physical degree at every node, is the most efficient known protocol (requiring 2n messages in total, where n is the number of nodes in the network), and relies on simpler assumptions than existing protocols. Furthermore, we verify through simulation that the network topologies produced by k-Neigh show good performance in terms of node energy consumption and expected interference.