ppxscal/embedding_network huggingface dataset:
Time-Efficient Broadcasting in Radio Networks
Authors: David Peleg
Venue: Proceedings of the 21st international symposium on Distributed Computing (2007)

As broadcasting is one of the primary functions in radio networks, fast algorithms for performing it are of considerable interest. A radio network consists of stations that can act at any a given time step either as transmitters or as receivers. Given a deployment of the stations, the reception conditions can be modeled by a graph, where the existence of an edge between two nodes indicates that transmissions of one of them can reach the other, i.e., these nodes can communicate directly. The message transmitted by a node in given time step is delivered in the same time step to all of its neighbors in the graph. A node acting as a receiver in a given step will successfully receive a message if and only if exactly one of its neighbors transmits in that step. If two or more neighbors of a node transmit simultaneously, then a collision occurs and none of the messages is heard by the node in that step.
Belief Combination for Uncertainty Reduction in Microarray Gene Expression Pattern Analysis
Authors: Kajia Cao, Qiuming Zhu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Many classification methods are used in microarray gene expression data analysis to identify genes that are predictive to clinical outcomes (survival/fatal) of certain diseases. However, the reliability of these methods is often not well established due to the imprecision of the method and uncertainty of the dataset. In this paper, a knowledge-based belief reasoning system (BRS) is proposed to solve the problem by dealing with the uncertainties inherent in the results of various classification methods. Through the belief combination process, we pursue a means to reduce the uncertainty and improve the reliability of classification so that the underlying features of gene behavior recorded in the microarray expression profiles could be convincingly revealed.
Demonstration: Bringing Lives to Light: Browsing and Searching Biographical Information with a Metadata Infrastructure
Authors: Ray R. Larson
Venue: Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries (2007)

In this demonstration we will show how a metadata infrastructure comprised of gazetteers, biographical dictionaries, and a "Time Period Directory" can be dynamically exploited to help searchers navigate through multiple web-based resources, and displayed in context with related information about "Who?, What?, Where?, and When?" and providing dynamic searches of those external resources. The demostration will show both a web-based interface and a Google Earth-based geo-temporal browser.
An automatic transformation from COSA software architecture to CORBA platform
Authors: Adel Alti, Mahieddine Djoudi, Adel Smeda
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Recently, middleware as an abstraction layer is completely integrated in development environments for resolving heterogeneity and guaranteeing the transparency communication of distributed components. The explicit separation of architecture and implementation is the main concern of the Model Driven Architecture (MDA), aiming to well understanding and controlling interactions and inter-connections among components. This article defines an automatic transformation from COSA (Component-Object based Software Architecture), which is a software architecture model that describes systems as a collection of components and connectors, to a standard platform - CORBA. The goal of our work is rapid mapping and smooth integration of COSA concepts into CORBA middleware platform in order to achieve a higher level of abstraction.
Design patterns: the devils in the detail
Authors: Mel Ó Cinnéide, Paddy Fagan
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

The application of a design pattern in an industrial context is frequently a much more involved task than is described the pattern description itself. In this experience paper we report on a number of problems encountered in the application of several common patterns in commercial software systems. The problems we examine range in nature from details of the runtime environment that hamper pattern implementation (Singleton), to the software upgrade process breaking a pattern's promise (Abstract Factory), to the consequences of the tight source code coupling produced by pattern application (Facade). Our conclusion is that while design patterns are indeed useful in industrial software development, there are more potential pitfalls in this area than is generally realised. In applying a design pattern, more must be taken into account than just the design context into which the pattern fits; issues to do with the low-level runtime environment as well as the higher-level software architecture, software process and social environment also play a role.
Proofs and Refutations for Probabilistic Refinement
Authors: A. K. Mciver, C. C. Morgan, C. Gonzalia
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

We consider the issue of finding and presenting counterexamples to a claim "this spec is implemented by that imp", that is $\textit{spec} \sqsubseteq \textit{imp}$ (refinement), in the context of probabilistic systems: using a geometric interpretation of the probabilistic/demonic semantic domain we are able to encode both refinement success and refinement failure as linear satisfaction problems, which can then be analysed automatically by an SMT solver. This allows the automatic discovery of certificates for counterexamples in independently and efficiently checkable form. In many cases the counterexamples can subsequently be converted into "source level" hints for the verifier.
Tensor Products of Weakly Smooth Codes Are Robust
Authors: Eli Ben-Sasson, Michael Viderman
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We continue the study of robust tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via robust two-wise tensor products. In particular, we show that all unique-neighbor expander codes and all locally correctable codes, when tensored with any other good-distance code, are robust and hence can be used to construct locally testable codes. Previous works by [2] required stronger expansion properties to obtain locally testable codes.Our proofs follow by defining the notion of weakly smooth codes that generalize the smooth codes of [2]. We show that weakly smooth codes are sufficient for constructing robust tensor codes. Using the weaker definition, we are able to expand the family of base codes to include the aforementioned ones.
Reversal-Bounded Counter Machines Revisited
Authors: Alain Finkel, Arnaud Sangnier
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this problem becomes decidable when considering Vector Addition System with States.
Automated Evaluation of Secure Route Discovery in MANET Protocols
Authors: Todd R. Andel, Alec Yasinsac
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

Evaluation techniques to analyze security properties in ad hoc routing protocols generally rely on manual, non-exhaustive approaches. Non-exhaustive analysis techniques may conclude a protocol is secure, while in reality the protocol may contain an unapparent or subtle flaw. Using formalized exhaustive evaluation techniques to analyze security properties increases protocol confidence. In this paper, we offer an automated evaluation process to analyze security properties in the route discovery phase for on-demand source routing protocols. Using our automated security evaluation process, we are able to produce and analyze all topologies for a given network size. The individual network topologies are fed into the SPIN model checker to exhaustively evaluate protocol abstractions against an attacker attempting to corrupt the route discovery process.
Interval Multiple Attribute Decision Making Based on Interval-Valued Intuitionistic Fuzzy Set
Authors: Zhongliang Yue, Yuying Jia, Changqing Zhu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

For the decision matrix given in the form of interval, the result can not reflect how many the affirmative component and denial component because the evaluation result of alternative attribute is only presented by interval. This paper presents the concept of supporting set, opposing set, and supporting interval, opposing interval with the help of golden section and the idea of interval intuitionistic fuzzy set, and then the evaluation information of alternative as to attribute is aggregated into intuitionistic fuzzy evaluation information. Interval intuitionistic fuzzy evaluation reflects three information of alternative, i.e. affirmative interval, denial interval and neutral interval. Then we gain the order relation of intuitionistic fuzzy evaluation information utilizing the score function and accuracy function, and obtain further the alternatives' order relation.
Comprehensive Segmentation of Cine Cardiac MR Images
Authors: Maxim Fradkin, Cybèle Ciofolo, Benoit Mory, Gilion Hautvast, Marcel Breeuwer
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

A typical Cardiac Magnetic Resonance (CMR) examination includes acquisition of a sequence of short-axis (SA) and long-axis (LA) images covering the cardiac cycle. Quantitative analysis of the heart function requires segmentation of the left ventricle (LV) SA images, while segmented LA views allow more accurate estimation of the basal slice and can be used for slice registration. Since manual segmentation of CMR images is very tedious and time-consuming, its automation is highly required. In this paper, we propose a fully automatic 2D method for segmenting LV consecutively in LA and SA images. The approach was validated on 35 patients giving mean segmentation error smaller than one pixel, both for LA and SA, and accurate LV volume measurements.
MHD channel flow control in 2D: Mixing enhancement by boundary feedback
Authors: Eugenio Schuster, Lixiang Luo, Miroslav Krstić
Venue: Automatica (Journal of IFAC) (2008)

A nonlinear Lyapunov-based boundary feedback control law is proposed for mixing enhancement in a 2D magnetohydrodynamic (MHD) channel flow, also known as Hartmann flow, which is electrically conducting, incompressible, and subject to an external transverse magnetic field. The MHD model is a combination of the Navier-Stokes PDE and the Magnetic Induction PDE, which is derived from the Maxwell equations. Pressure sensors, magnetic field sensors, and micro-jets embedded into the walls of the flow domain are employed for mixing enhancement feedback. The proposed control law, designed using passivity ideas, is optimal in the sense that it maximizes a measure related to mixing (which incorporates stretching and folding of material elements), while at the same time minimizing the control and sensing efforts. A DNS code is developed, based on a hybrid Fourier pseudospectral-finite difference discretization and the fractional step technique, to numerically assess the controller.
Scene detection using visual and audio attention
Authors: Angelo Chianese, Vincenzo Moscato, Antonio Penta, Antonio Picariello
Venue: Proceedings of the 2008 Ambi-Sys workshop on Ambient media delivery and interactive television (2008)

Shot and scene segmentation are basic steps for a variety of applications in video analysis and processing. In this paper, we propose a new method for automatic scene detection which takes visual patterns of movies and audio features into account. In particular, we also show that the use of audio analysis, to detect transitions in an audio stream, is suitable in order to capture the scene boundaries as well.
Neural Approximation of Monte Carlo Policy Evaluation Deployed in Connect Four
Authors: Stefan Faußer, Friedhelm Schwenker
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

To win a board-game or more generally to gain something specific in a given Markov-environment, it is most important to have a policy in choosing and taking actions that leads to one of several qualitative good states. In this paper we describe a novel method to learn a game-winning strategy. The method predicts statistical probabilities to win in given game states using a state-value function that is approximated by a Multi-layer perceptron. Those predictions will improve according to rewards given in terminal states. We have deployed that method in the game Connect Four and have compared its game-performance with Velena [5].
Spatial Social Behavior in Second Life
Authors: Doron Friedman, Anthony Steed, Mel Slater
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We have developed software bots that inhabit the popular online social environment SecondLife (SL). Our bots can wander around, collect data, engage in simple interactions, and carry out simple automated experiments. In this paper we use our bots to study spatial social behavior. We found an indication that SL users display distinct spatial behavior when interacting with other users. In addition, in an automated experiment carried out by our bot, we found that users, when their avatars were approached by our bot, tended to respond by moving their avatar, further indicating the significance of proxemics in SL.
Incomplete Statistical Information Fusion and Its Application to Clinical Trials Data
Authors: Jianbing Ma, Weiru Liu, Anthony Hunter
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

In medical clinical trials, overall trial results are highlighted in the abstracts of papers/reports. These results are summaries of underlying statistical analysis where most of the time normal distributions are assumed in the analysis. It is common for clinicians to focus on the information in the abstracts in order to review or integrate several clinical trial results that address the same or similar medical question(s). Therefore, developing techniques to merge results from clinical trials based on information in the abstracts is useful and important. In reality information in an abstract can either provide sufficient details about a normal distribution or just partial information about a distribution. In this paper, we first propose approaches to constructing normal distributions from both complete and incomplete statistical information in the abstracts. We then provide methods to merge these normal distributions (or sampling distributions). Following this, we investigate the conditions under which two normal distributions can be merged. Finally, we design an algorithm to sequence the merging of trials results to ensure that the most reliable trials are considered first.
On the Specification and Negotiation of Quality of Service for Collaborative Services
Authors: Bart Orriens, Jian Yang
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

The adoption of web service technologies in dynamic business applications such as on-demanding computing or highly reconfigurable virtual enterprizes advocates for methods and tools for describing and managing non-functional aspects of services, e.g., the reliability, accessibility and accuracy of a service. These properties are referred as Quality of Service (QoS). Failing to accurately specify and communicate quality details can lead to wrong and inconsistent expectations held by the service provider and service consumer and result in serious disagreement. Popular web service description development and management solutions, e.g. WS-Policy and Web Service Level Agreement, do not properly cater for the specification and negotiation of quality related requirements for collaborative services. In this paper we present a comprehensive mechanism for the specification of quality requirements. The proposed approach allows service providers and consumers to explicitly define and adjust both higher level and concrete measurement requirements for quality of a service in a formally verifiable manner. As a result, quality negotiations can be performed effectively for the establishment of service provision agreements.
Real-Time DOP Ellipsoid in Polarization Mode Dispersion Monitoring System by Using PSO Algorithm
Authors: Xiaoguang Zhang, Gaoyan Duan, Lixia Xi
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In high bit rate optical fiber communication systems, Polarization mode dispersion (PMD) is one of the main factors to signal distortion and needs to be compensated. PMD monitoring system is the key integral part of an adaptive PMD compensator. The degree of polarization (DOP) ellipsoid obtained by using a polarization scrambler can be used as a feedback signal for automatic PMD compensation. Generally, more than several thousands of sampling data of states of polarization (SOP) must be collected to insure getting a correct DOP ellipsoid. This would result in an unacceptable time consuming for adaptive PMD compensation. In this paper, we introduce the particle swarm optimization (PSO) algorithm in determining the real-time DOP ellipsoid with high precision, requiring only 100 sampling data of SOPs. Experimental results confirm that the PSO algorithm is effective for ellipsoid data fitting with high precision within 250ms using our hardware environment.
EPLAS: An Epistemic Programming Language for All Scientists
Authors: Isao Takahashi, Shinsuke Nara, Yuichi Goto, Jingde Cheng
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Epistemic Programming has been proposed as a new programming paradigm for scientists to program their epistemic processes in scientific discovery. As the first step to construct an epistemic programming environment, this paper proposes the first epistemic programming language, named `EPLAS'. The paper analyzes the requirements of an epistemic programming language, presents the ideas to design EPLAS, shows the important features of EPLAS, and presents an interpreter implementation of EPLAS.
Environment-Aware Communication Model in the Perspective of Web Ecosystems
Authors: Imran Ghani, Eunmi Choi, Dugki Min
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The Environment-Aware Communication Model with respect to Ultra-Large-Scale System senables self-growing system and its users to form a Web Ecosystem. In such an environment, the Web systems and users are habitants of same place and are aware of each other. The Web Ecosystems semantically solve the problems of users and improve their knowledge using metadata interchange among systems. In line with the mentioned concept, this paper discusses the potential issues related to Web Ecosystem. The paper also provides a conceptual communication model and its initial implementation with the argument that Web 3.0 has the potential to serve as the latest technology to build the next generation applications for the Web Ecosystem.
Strategies for Solving SAT in Grids by Randomized Search
Authors: Antti E. Hyvärinen, Tommi Junttila, Ilkka Niemelä
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this paper we develop strategies for solving collections of hard instances of the propositional satisfiability problem (SAT) with a randomized SAT solver run in a Grid. We study alternative strategies by using a simulation framework which is composed of (i) a grid model capturing the communication and management delays, and (ii) run-time distributions of a randomized solver, obtained by running a state-of-the-art SAT solver on a collection of hard instances. The results are experimentally validated in a production level Grid. When solving a single hard SAT instance, the results show that in practice only a relatively small amount of parallelism can be efficiently used; the speedup obtained by increasing parallelism thereafter is negligible. This observation leads to a novel strategy of using grid to solve collections of hard instances. Instead of solving instances one-by-one, the strategy aims at decreasing the overall solution time by applying an alternating distribution schedule.
Space efficient and time optimal distributed BFS tree construction
Authors: Christian Boulinier, Ajoy K. Datta, Lawrence L. Larmore, Franck Petit
Venue: Information Processing Letters (2008)

In this paper, we give a simple distributed algorithm for constructing a BFS spanning tree in an almost anonymous, asynchronous, rooted network. The proposed algorithm is an improved version of an algorithm by Aspnes. The time complexity of the algorithm is optimal for this problem, i.e., O(diam), where diam is the diameter of the network, and the space complexity of each process is O(@d"P) for each process P, where @d"P is the degree of P. The message complexity is O(diam@?|E|), where E is the set of links, and the size of each message is O(1).
A communication-efficient framework for outlier-free data reporting in data-gathering sensor networks
Authors: L. S. Jayashree, S. Arumugam, A. R. Meenakshi
Venue: International Journal of Network Management (2008)

In this paper, we address the problem of reducing the communication cost and hence the energy costs incurred in data-gathering applications of a sensor network. Environmental data depicts a huge amount of correlation in both the spatial and temporal domains. We exploit these temporal-spatial correlations to address the aforementioned problem. More specifically, we propose a framework that partitions the physical sensor network topology into a number of feature regions. Each sensor node builds a data model that represents the underlying structure of the data. A representative node in each feature region communicates only the model coefficients to the sink, which then uses them to answer queries. The temporal and spatial similarity has special meaning in outlier cleaning too. We use a modified z-score technique to precisely label the outliers and use the spatial similarity to confirm whether the outliers are due to a true change in the phenomenon under study or due to faulty sensor nodes.
Using Recognizing Textual Entailment as a Core Engine for Answer Validation
Authors: Rui Wang, Günter Neumann
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper is about our approach to answer validation, which centered by a Recognizing Textual Entailment (RTE) core engine. We first combined the question and the answer into Hypothesis (H) and view the document as Text (T); then, we used our RTE system to check whether the entailment relation holds between them. Our system was evaluated on the Answer Validation Exercise (AVE) task and achieved f-measures of 0.46 and 0.55 for two submission runs, which both outperformed others' results for the English language.