ppxscal/embedding_network huggingface dataset:
Comparison of MANET routing protocols using a scaled indoor wireless grid
Authors: David Johnson, Albert Lysko
Venue: Mobile Networks and Applications (2008)

Predicting the performance of ad-hoc networking protocols has typically been performed by making use of software based simulation tools. Experimental study and validation of such predictions is vital to obtaining more realistic results, but may not be possible under the constrained environment of network simulators. This paper presents experimental comparisons of routing protocols using a 7×7 grid of closely spaced WiFi nodes. It firstly demonstrates the usefulness of the grid in its ability to emulate a real world multi-hop ad-hoc network. It specifically compares hop count, routing traffic overhead, throughput, delay and packet loss for three protocols which are listed by the Internet Engineering Task Force Mobile Ad-hoc Networks (MANET) working group. These are the Ad-hoc on demand distance vector routing protocol (AODV), the optimized link state routing protocol (OLSR) and the dynamic MANET on demand routing protocol (DYMO).
An Unconditionally Secure Protocol for Multi-Party Set Intersection
Authors: Ronghua Li, Chuankun Wu
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

Existing protocols for private set intersection are based on homomorphic public-key encryption and the technique of representing sets as polynomials in the cryptographic model. Based on the ideas of these protocols and the two-dimensional verifiable secret sharing scheme, we propose a protocol for private set intersection in the information-theoretic model. By representing the sets as polynomials, the set intersection problem is converted into the task of computing the common roots of the polynomials. By sharing the coefficients of the polynomials among parties, the common roots can be computed out using the shares. As long as more than 2n/3 parties are semi-honest, our protocol correctly computes the intersection of n sets, and reveals no other information than what is implied by the intersection and the secrets sets controlled by the active adversary. This is the first specific protocol for private set intersection in the information-theoretic model as far as we know.
Semi-autonomous Coordinated Exploration in Rescue Scenarios
Authors: S. Cesa, A. Farinelli, L. Iocchi, D. Nardi, M. Sbarigia, M. Zaratti
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

In this paper we study different coordination strategies for a group of robots involved in a search and rescue task. The system integrates all the necessary components to realise the basic behaviours of robotic platforms. Coordination is based on iterative dynamic task assignment. Tasks are interesting points to reach, and the coordination algorithm finds at each time step the optimal assignment of robots to tasks. We realised both a completely autonomous exploration strategy and a strategy that involves a human operator. The human operator is able to control the robots at different levels: giving priority points for exploration to the team of robots, giving navigation goal points to team of robots, and directly tele-operating a single robot. For building a consistent global map, we implemented a centralised coordinated SLAM approach that integrates readings from all robots. The system has been tested both in the UsarSim simulation environment and on robotic platforms.
Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
Authors: Xiaofeng Chen, Fangguo Zhang, Willy Susilo, Yi Mu
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

The "hash-sign-switch" paradigm was firstly proposed by Shamir and Tauman with the aim to design an efficient on-line/off-line signature scheme. However, all existing on-line/off-line signature schemes based on Shamir-Tauman's paradigm suffer from the key exposure problem of chameleon hashing. That is, if the signer applies the same hash value more than once to obtain two signatures on two different messages, the recipient can obtain a hash collision and use it to recover the signer's trapdoor information. Therefore, the signer should pre-compute and store plenty of different chameleon hash values and the corresponding signatures on the hash values in the off-line phase, and send the collision and the signature for a certain hash value in the on-line phase. Hence, the computation and storage cost for the off-line phase and the communication cost for the on-line phase in Shamir-Tauman's signature scheme are still a little more overload.In this paper, we first introduce a special double-trapdoor hash family based on the discrete logarithm assumption to solve this problem. We then apply the "hash-sign-switch" paradigm to propose a much more efficient generic on-line/off-line signature scheme. Additionally, we use a one-time trapdoor/hash key pair for each message signing, which prevents the recipient from recovering the trapdoor information of the signer and computing other collisions.
Scheduling a Flexible Batching Machine
Authors: Baoqiang Fan, Jianzhong Gu, Guochun Tang
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

Minimizing total completion time ¿ C j on normal batching machine is solvable in polynomial time for fixed B(B > 1), while Minimizing total completion time ¿ C j for arbitrary B and minimizing total weighted completion time ¿ W j C j are open problems. In this paper, we consider the problem of scheduling jobs on a flexible batching machine in order to minimizing the total completion time. We prove that the problem is strongly NP-hard. Then the problem with agreeable is NP-hard even if there have three fixed capacities all the time.
On Correctness of Mathematical Texts from a Logical and Practical Point of View
Authors: Konstantin Verchinine, Alexander Lyaletski, Andrei Paskevich, Anatoly Anisimov
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Formalizing mathematical argument is a fascinating activity in itself and (we hope!) also bears important practical applications. While traditional proof theory investigates deducibility of an individual statement from a collection of premises, a mathematical proof, with its structure and continuity, can hardly be presented as a single sequent or a set of logical formulas. What is called "mathematical text", as used in mathematical practice through the ages, seems to be more appropriate. However, no commonly adopted formal notion of mathematical text has emerged so far.In this paper, we propose a formalism which aims to reflect natural (human) style and structure of mathematical argument, yet to be appropriate for automated processing: principally, verification of its correctness (we consciously use the word rather than "soundness" or "validity").We consider mathematical texts that are formalized in the ForTheL language (brief description of which is also given) and we formulate a point of view on what a correct mathematical text might be. Logical notion of correctness is formalized with the help of a calculus. Practically, these ideas, methods and algorithms are implemented in a proof assistant called SAD. We give a short description of SAD and a series of examples showing what can be done with it.
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Authors: Yevgeniy Dodis, Victor Shoup, Shabsi Walfish
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

Canetti et al. [7] recently proposed a new framework -- termed Generalized Universal Composability (GUC) -- for properly analyzing concurrent execution of cryptographic protocols in the presence of a global setup, and constructed the first known GUC-secure implementations of commitment (GUCC) and zero-knowledge (GUC ZK), which suffice to implement any two-party or multi-party functionality under several natural and relatively mild setup assumptions. Unfortunately, the feasibility results of [7] used rather inefficient constructions.In this paper, we dramatically improve the efficiency of (adaptively-secure) GUCC and GUC ZK assuming data erasures are allowed. Namely, using the same minimal setup assumptions as those used by [7], we build a direct and efficient constant-round GUC ZK for R from any "dense" ¿-protocol [21] for R. As a corollary, we get a semi-efficient construction from any Σ-protocol for R (without doing the Cook-Levin reduction), and a very efficient GUC ZK for proving knowledge of a discrete log representation. the first constant-rate (and constant-round) GUCC scheme. Additionally, we show how to properly model a random oracle in the GUC framework without losing deniability, which is one of the attractive features of the GUC framework. In particular, by adding the random oracle to the setup assumptions used by [7], we build the first two-round (which we show is optimal), deniable, straight-line extractable and simulatable ZK proof for any NP relation R.
Applying Logical Constraints to Ontology Matching
Authors: Christian Meilicke, Heiner Stuckenschmidt
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Automatically discovering semantic relations between ontologies is an important task with respect to overcoming semantic heterogeneity on the semantic web. Ontology matching systems, however, often produce erroneous mappings. In this paper we propose a method for optimizing precision and recall of existing matching systems. The principle of this method is based on the idea that it is possible to infer logical constraints by comparing subsumption relations between concepts of the ontologies to be matched. In order to verify this principle we implemented a system that uses our method as basis for optimizing mappings. We generated a set of synthetic ontologies and corresponding defective mappings and studied the behavior of our method with respect to the properties of the matching problem. The results show that our strategy actually improves the quality of the generated mappings.
Development of a web-based coordinated traffic signal system: an arterial road application
Authors: Tapan K. Datta
Venue:  (2008)

The current traffic signal analysis software do not thoroughly consider the fundamental traffic flow relationships when setting the offsets of the adjacent signalized intersections. Desired speeds, which are entered by the user, are often used as progression speed for the arterial. This often leads to poor operating performance if the speed values are not feasible to the current traffic flow condition. iCOTraffic system, web-based system for traffic signal analysis, was developed as a part of this research. The system contains three modules: the input module, the analysis and design module, and the output module. The input module allows the user to enter roadway geometric information, traffic volumes, lane configurations, and minimum timing parameters. The analysis and design module contains functions to produce phase sequence design and intersection timing plan. It also contains coordination strategy subroutine (CSS), and bandwidth maximization subroutine. CSS was designed to determine the prevailing traffic flow condition and to provide a range of feasible progression speeds. The bandwidth maximization subroutine was designed to maximize the green bandwidths for the through movements. The output module contains reports of the intersection timing plan and the time-space diagram. A comparison study was conducted by analyzing Baldwin Road, an arterial road located in the northern suburb of Detroit, Michigan, using four options: Synchro 6.0, PASSER II, iCOTraffic without CSS, and iCOTraffic with CSS. The objective was to coordinate the adjacent signalized intersections along the arterial and to produce the timing plan parameters using the four options and six cases of traffic demand. SimTraffic, the microscopic simulation tool, was used to evaluate the optimal solutions from each tool. The MOE results from each tool were compared and presented using different figures and tables. The results show that iCOTraffic, with the use of CSS or without, outperformed Synchro in all six cases and in four out of six for PASSER in term of producing higher progression efficiency values. In addition, iCOTraffic produced higher average arterial speed values, therefore better LOS, than Synchro for the first five cases for both directions and produced higher values than PASSER for case 5 and case 6. Thus, iCOTraffic system generally produces better arterial LOS for near-saturated traffic flow regimes. Despite the mixed results of arterial delay and number of stops, iCOTraffic CSS produces reasonable values.
Design of 2-D IIR Filters Using Two Error Criteria with Genetic Algorithm
Authors: Felicja Wysocka-Schillak
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The paper presents a method for designing 2-D IIR filters with a quadrantally symmetric magnitude response. The method is based on two error criteria, i.e., equiripple error criterion in the passband and least-squared error criterion in the stopband. Two objective functions are introduced and the filter design problem is transformed into an equivalent bicriterion optimization problem. The stability of the filter is ensured by explicitly including stability constraints in the considered optimization problem. A two-step solution procedure of the considered problem is proposed. In the first step, a genetic algorithm is applied. The final point from the genetic algorithm is used as the starting point for a local optimization method. Two design examples are given to illustrate the proposed technique. A comparison with a 2-D IIR filter designed using LS approach is also presented. 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 Tableaux System for Deontic Action Logic
Authors: Pablo F. Castro, T. S. Maibaum
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

In [1] and [2] we have introduced a novel deontic action logic for reasoning about fault-tolerance. In this paper we present a tableaux method for this logic; this proof system is sound and complete, and because the logic has the usual boolean operators on actions, it also allows us to deal successfully with action complement and parallel execution of actions. Finally, we describe an example of application of this proof system which shows how the tableaux system can be used to obtain (counter-) models of specifications.
Finding a minimum medial axis of a discrete shape is NP-hard
Authors: David Coeurjolly, Jérôme Hulin, Isabelle Sivignon
Venue: Theoretical Computer Science (2008)

The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may exist without changing the reversivility of the input shape representation. In this article, we first prove that finding a minimum medial axis is an NP-hard problem for the Euclidean distance. Then, we compare two algorithms which compute an approximation of the minimum medial axis, one of them providing bounded approximation results.
Reuse Patterns in Adaptation Languages: Creating a Meta-level for the LAG Adaptation Language
Authors: Maurice Hendrix, Alexandra I. Cristea
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

A growing body of research targets authoring of content and adaptation strategies for adaptive systems. The driving force behind it is semantics-based reuse: the same strategy can be used for various domains, and vice versa. Whilst using an adaptation language (LAG e.g.) to express reusable adaptation strategies, we noticed, however, that: a) the created strategies have common patterns that, themselves, could be reused; b) templates based on these patterns could reduce the designers' work; c) there is a strong preference towards XML-based processing and interfacing. This has leaded us to define a new meta-language for LAG, extracting common design patterns. This paper provides more insight into some of the limitations of Adaptation Languages like LAG, as well as describes our meta-language, and shows how introducing the meta-level can overcome some redundancy issues.
International Workshop on Applications of Workflows in Computational Science (AWCS 08)
Authors: Adam Belloum, Zhiming Zhao, Marian Bubak
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The goal of the Workshop on Applications of Workflows in Computational Sciences (WACS) is to provide a forum for sharing knowledge and experience on developing workflow applications, and to highlight important requirements for developing workflow systems. This short paper gives an overview on scientific workflow management systems and their application in e-Science, and introduces the topics of the Workshop. Several research focuses on utilizing scientific workflow in enhancing e-Science applications and on developing workflow management systems will be enumerated.
Bezier Triangular Neural Network
Authors: Tang van To, Kotchakorn Sa-Ingthong
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Bezier Triangular Neural Network (BTNN) is a multilayer back propagation neural network which used for surface approximation. The approximation is solved by learning process of BTNN from observation data points.
UML Profile for the Platform Independent Modelling of Service-Oriented Architectures
Authors: Marcos López-Sanz, César J. Acuña, Carlos E. Cuesta, Esperanza Marcos
Venue: Proceedings of the 1st European conference on Software Architecture (2007)

The vast diversity of implementation and support platforms for service-oriented architectures (such as Web, Grid or even CORBA) increases the complexity of the development process of service-based systems. To reduce it, both the architectural properties of the SOC paradigm and a development approach based on the MDA proposal can be studied. This work describes a UML profile for the PIM-level service-oriented architectural modelling, as well as the correspondent metamodel. PIM (Platform Independent Model) level is chosen because it does not reflect constraints about any specific platform or implementation technology. The proposal sketched in this article is part of our research of a service-oriented development method (SOD-M) called MIDAS.
Printer profiling for forensics and ballistics
Authors: Eric Kee, Hany Farid
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

We describe a technique for authenticating printed and scanned text documents. This technique works by modeling the degradation in a document caused by printing. The resulting printer profile is then used to detect inconsistencies across a document, and for ballistic purposes - that of linking a document to a printer.
Tight bounds for asynchronous randomized consensus
Authors: Hagit Attiya, Keren Censor
Venue: Journal of the ACM (JACM) (2008)

A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates within a finite number of its own steps, is impossible in an asynchronous shared-memory system. However, consensus becomes solvable using randomization when a process only has to terminate with probability 1. Randomized consensus algorithms are typically evaluated by their total step complexity, which is the expected total number of steps taken by all processes. This article proves that the total step complexity of randomized consensus is &Theta;(n2) in an asynchronous shared memory system using multi-writer multi-reader registers. This result is achieved by improving both the lower and the upper bounds for this problem. In addition to improving upon the best previously known result by a factor of log2n, the lower bound features a greatly streamlined proof. Both goals are achieved through restricting attention to a set of layered executions and using an isoperimetric inequality for analyzing their behavior. The matching algorithm decreases the expected total step complexity by a log n factor, by leveraging the multi-writing capability of the shared registers. Its correctness proof is facilitated by viewing each execution of the algorithm as a stochastic process and applying Kolmogorov's inequality.
A Knowledge-Evolution Strategy Based on Genetic Programming
Authors: Chan-Sheng Kuo, Tzung-Pei Hong, Chuen-Lung Chen
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Knowledge evolution is an important issue in knowledge management since enterprises face keen competition and need to keep the latest knowledge with time in an organization. In this paper, we proposed a GP-based knowledge-evolution framework to search for a good integrated classification tree with different evolving time points. The proposed approach can learn the evolving knowledge, integrating original and new knowledge, to deal properly with the organizational need for updating the latest knowledge as time goes on in a dynamic environment. In addition, we developed the initial population, consisting of four proportions, to accomplish suitable diversity and thus raise the search range as well as next learning efficiency in the evolutionary process.
Cooperative Differential Space-Time Transmission Scheme for MIMO Relay Networks
Authors: Jinwang Zhao, Youyun Xu, Yueming Cai
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

In this paper, we develop a new cooperative differential space-time transmission scheme for multiple-input multiple-output (MIMO) relay networks with partial channel state information (CSI). We propose an adaptive selection amplify-and-forward (AF) protocol which is combined with selection combining and antenna selection. Differential space-time coding is employed at the transmitter when the CSI is imperfect at the receiver. And maximum likelihood differential detection is derived. Simulation results show that the proposed scheme achieves higher diversity gain and better bit-error rate (BER) performance compared with the traditional point-to-point MIMO scheme with the same number of transmit and receive antennas and the equal power efficiency and spectral efficiency.
Kinematic Analysis, Obstacle Avoidance and Self-localization for a Mobile Robot
Authors: Hongbo Wang, Xingbin Tian, Zhen Huang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a novel omni-directional mobile robot with obstacle avoidance and self-location function. Since a special transmission mechanism is designed, we introduce the mechanism design of the mobile robot and analyze its kinematics. A fuzzy-neural control algorithm is presented to realize the obstacle avoidance of the mobile robot. The obstacle avoidance system based on FKCN and the control algorithm for obstacle avoidance are described. A self-localization technique that uses the ceiling light for the landmark is proposed. Using this self-location function, the mobile robot could locate itself in a world coordinate system.