ppxscal/embedding_network huggingface dataset:
Routing Efficiency of AODV and DSR Protocols in Ad-Hoc Sensor Networks
Authors: Tao Yang, Makoto Ikeda, Giuseppe De Marco, Leonard Barolli, Arjan Durresi, Fatos Xhafa
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model. We study the routing efficiency of the ad-hoc sensor network and compare the performance of two protocols for different scenarios using the routing efficiencyconcept. By computer simulations, we found that the routing efficiency of DSR protocol is better than AODV protocol.
Dynamic Color Texture Modeling and Color Video Decomposition Using Bounded Variation and Oscillatory Functions
Authors: Mathieu Lugiez, Michel Ménard, Abdallah El-Hamidi
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Dynamic, or temporal, texture is a spatially repetitive, time-varying visual pattern that forms an image sequence with a certain temporal stationarity. Important tasks are thus the detection, segmentation and perceptual characterization of Dynamic Texture (DT). Following recent work, color image decomposition appears as a good way to reach these different aims, however, to our best knowledge, no proposed model is currently able to deal with temporal aspect, inherent to color image sequences.The major contribution of this paper is to adapt static decomposition model to time aspect in order to deal with videos and color image sequences. In this paper we propose an extended decomposition model which splits a video into two components, a first one containing geometrical information, the structure of the sequence and a second one dynamic color texture and noise. Examples for color video decomposition and characterization of real dynamic present in texture component will be presented.
Experiments with probabilistic quantum auctions
Authors: Kay-Yut Chen, Tad Hogg
Venue: Quantum Information Processing (2008)

We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in determining which bidder wins, or having no winner, rather than always having the highest bidder win. Comparing two quantum protocols in the context of first-price sealed bid auctions, we find the one predicted to be superior by game theory also performs better experimentally. We also compare with a conventional first-price auction, which gives higher performance. Thus to provide benefits, the quantum protocol requires more complex economic scenarios such as maintaining privacy of bids over a series of related auctions or involving allocative externalities.
Phrase Detection in the Wikipedia
Authors: Miro Lehtonen, Antoine Doucet
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

The Wikipedia XML collection turned out to be rich of marked-up phrases as we carried out our INEX 2007 experiments. Assuming that a phrase occurs at the inline level of the markup, we were able to identify over 18 million phrase occurrences, most of which were either the anchor text of a hyperlink or a passage of text with added emphasis. As our IR system -- EXTIRP -- indexed the documents, the detected inline-level elements were duplicated in the markup with two direct consequences: 1) The frequency of the phrase terms increased, and 2) the word sequences changed. Because the markup was manipulated before computing word sequences for a phrase index, the actual multi-word phrases became easier to detect. The effect of duplicating the inline-level elements was tested by producing two run submissions in ways that were similar except for the duplication. According to the official INEX 2007 metric, the positive effect of duplicated phrases was clear.
Fast Data Aggregation Algorithm for Minimum Delay in Clustered Ubiquitous Sensor Networks
Authors: Shan Guo Quan, Young Yong Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

We propose a time-efficient local data aggregation algorithm that aggregates delay-constrained data within agiven time deadline in clustered wireless sensor networks. Our approach consists of two phases. First, we design a zone-based fast data aggregation tree (ZFDAT) to eliminate unnecessary packets being forwarded to many receiver nodes and avoid long detour paths until cluster-head, where cluster-head is local control center to coordinate the data transmissions in the cluster. Next, we propose optimal link scheduling algorithm to minimize aggregation time by given variable length of time slots for all links in the ZFDAT. Our simulation results show that our approach can minimize the aggregation time under energy constraint and outperforms the similar existing algorithms. In particular, our approach distributes the total aggregation time, then it can also reduce the heavy processing load at the cluster-head.
Ontology-Based Management for Context Integration in Pervasive Services Operations
Authors: J. Martín Serrano, Joan Serrat, Sven Meer, Mícheál Ó Foghlú
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Next generation networks require information and communications systems able to support pervasive services and especially context-aware applications. This paper presents research challenges in self-management, autonomic communications and integration requirements of context information for supporting management operations of such services in next generation networks. The research focuses on a framework of information systems and their interoperability. Management techniques using information and data models for context information are discussed and studied and then the novel system architecture for context handling and delivery using ontology-based models is presented. In this paper, ontology-based management and modelling techniques are used and referenced in the framework of a distributed context handling and delivery system. Following this, the representative ontology-based information management system within an application scenario is presented. The flexibility of the introduced approach allows for end-user scenarios, which are briefly described at the end of the paper.
Programming with Live Distributed Objects
Authors: Krzysztof Ostrowski, Ken Birman, Danny Dolev, Jong Hoon Ahnn
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

A component revolution is underway, bringing developers improved productivity and opportunities for code reuse. However, whereas existing tools work well for builders of desktop applications and client-server structured systems, support for other styles of distributed computing has lagged. In this paper, we propose a new programming paradigm and a platform, in which instances of distributed protocols are modeled as "live distributed objects". Live objects can represent both protocols and higher-level components. They look and feel much like ordinary objects, but can maintain shared state and synchronization across multiple machines within a network. Live objects can be composed in a type-safe manner to build sophisticated distributed applications using a simple, intuitive drag and drop interface, very often without writing any code or having to understand the intricacies of the underlying distributed algorithms.
Neural Networks Based Image Recognition: A New Approach
Authors: Jiyun Yang, Xiaofeng Liao, Shaojiang Deng, Miao Yu, Hongying Zheng
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, a new application algorithm for image recognition based on neural network has been pro-posed. The present algorithm including recognition algorithm and algorithm for training BP neural network can recognize continually changing large gray image. This algorithm has been applied to deflection measurement of bridge health monitoring, and achieved a great success.
Finite element/boundary element simulation of future hard disk recording
Authors: T. Schrefl, G. Hrkac, A. Goncharov, J. Dean, S. Bance, M. A. Bashir, D. Suess
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Future hard disk storage systems will store information at a density of 10 Tbit/in2. The development and design of high density storage technologies requires the detailed simulation of the magnetization processes. We combine a hybrid finite element/boundary element method with matrix compression techniques and fast Poisson solvers, in order to simulation the writing process on a magnetic hard disks.
A Compressed Video Watermarking Scheme with Temporal Synchronization
Authors: Chao Chen, Tie-gang Gao, Li-zong Li
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

As an effective technology for copyright protection, digital watermarking has been applied in videos. Temporal synchronization is an important aspect for video watermarking. If synchronization is lost, the detector may fail in extracting the correct watermark. This paper proposes a temporal synchronous compressed MPEG-4 video watermarking scheme. This scheme utilizes DCT direct current coefficients to divide video into several scenes. Watermarks are embedded according to features of scenes. Bit rate control is introduced to ensure that watermark embedding does not increase the size of video. Drift compensation is employed to counteract the visual distortion in P-frames and B-frames caused by watermark embedding. Visual masking is exploited to enhance the invisibility of watermark. Experimental results show that the scheme has satisfactory ability in resisting the temporal synchronization attacks of frame deleting and frame inserting, therefore achieving well robustness.
Design of low complexity ofdm schemes and position location algorithm for wireless systems
Authors: Ahmed H. Tewfik
Venue:  (2008)

The research in the thesis deals with two different low-complexity designs of orthogonal frequency division multiplexing based wireless communication systems. In the first design, we seek to reduce the complexity of preceded OFDM systems. To reduce the complexity of preceded OFDM systems, we propose a time domain post coded OFDM (PC-OFDM) system. A PC-OFDM system introduces frequency diversity by manipulating the OFDM symbols in the time domain so that the computational complexity of the system can be significantly reduced. We evaluate the probability of error function for PC-OFDM systems and use it to design spreading codes for optimal performance. To reduce the complexity of detector, we propose a suboptimal encoding scheme in the forum of partial spreading. Next, we consider the design of low-power programmable wireless radios (PWRs) based on orthogonal frequency division multiple access (OFDMA). To meet the demands of higher data rate communications, we split OFDMA symbols carrying multiuser data across several non-contiguous bands of available spectrum. To perform digital baseband signal processing in an energy efficient manner, we propose efficient designs for the fast Fourier transform (FTT) and inverse FTT (IFFT) modules. Our designs of the FFT/IFFT modules reduce power consumption and chip area, and are capable of handling the dynamic nature of spectrum in programmable radios. To recover data that falls within the transition band of the analog filters, we propose a combiner similar to maximal ratio combiner. Finally, we propose an enhanced directional beacon based position locator for UWB systems. We perform detailed mathematical analysis that quantifies the dependence of the algorithm on the variance of noise and the beam pattern. We evaluate the effect of beampattern on the accuracy of position estimate and use Dolph-Chebyshev method to design an optimal beampattern. We also implement the position location algorithm using software radio and directional antenna equipped with stepper motor. We use advanced signal processing algorithms to overcome the shortcomings of low-cost hardware. We demonstrate the ability to obtain mobile node position estimates with sub-meter accuracy by transmitting a narrowband signal of 1 KHz bandwidth in the 2.4 GHz band.
Introducing a Process Infrastructure for Agent Systems
Authors: Christine Reese, Matthias Wester-Ebbinghaus, Till Dörges, Lawrence Cabac, Daniel Moldt
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

Within open distributed systems the realization of a spanning application is an open problem. While the local functionality can be implemented based on established approaches, the overall control of the processes to form a consistent and correct application remains difficult. Workflow management systems (WFMS) are one solution for process control. In combination with distributed systems further issues have to be solved and are investigated here under different perspectives like Petri nets (to provide a true concurrency semantics of the concepts) and agents (to provide a powerful middleware and a more abstract modeling paradigm than objects or components).In this paper we coin the phrase process infrastructure. The idea is to provide all means to model, build, control and maintain the processes within open agent networks as special distributed systems by combining the above mentioned concepts and techniques. To gain such a powerful process infrastructure, we started to build prototypes, which stepwise introduce some implementations of the advanced concepts. The potential of our proposed solution lies in its flexibility and rigorous formal precision. Thanks to the latter the models are directly executable. The approach introduces autonomous and adaptive handling of processes in specific units (agents), which use and produce the necessary infrastructure to handle processes in different contexts on all levels.
A stochastic model of tumor angiogenesis
Authors: Babak Mohammadi, Vahid Haghpanah, Bagher Larijani
Venue: Computers in Biology and Medicine (2008)

Angiogenesis is a prerequisite for the growth, invasion and metastasis of solid tumors. The aim of this study was to investigate the changes of microvessel densities in tumor with a method of probability. We showed that the stages of tumor angiogenesis may follow a probabilistic pattern compatible with Markov chain and this could be of prognostic importance. The system was simulated with 10,000 patients in order to show the applicability of this method. This approach may improve classification schemes and perhaps make diagnosis and treatment more individualized to patients.
Application of Ant Colony System to an Experimental Propeller Setup
Authors: Jih-Gau Juang, Yi-Cheng Lu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper presents a control problem involving an experimental propeller setup that is called the twin rotor multi-input multi-output system (TRMS). The control objective is to make the beam of the TRMS move quickly and accurately to the desired attitudes, both the pitch angle and the azimuth angle in the condition of decoupling between two axes. It is difficult to design a suitable controller because of the influence between two axes and nonlinear movement. For easy demonstration in the vertical and horizontal planes separately, the TRMS is decoupled by the main rotor and the tail rotor. An intelligent control scheme which utilizes a hybrid ACS-PID controller is implemented in the system. Simulation results show that the new approach can improve the tracking performance and reduce control force in the TRMS.
An experimental study of point location in planar arrangements in CGAL
Authors: Idit Haran, Dan Halperin
Venue: Journal of Experimental Algorithmics (JEA) (2009)

We study the performance in practice of various point-location algorithms implemented in CGAL (the Computational Geometry Algorithms Library), including a newly devised landmarks algorithm. Among the other algorithms studied are: a na&iuml;ve approach, a &ldquo;walk along a line&rdquo; strategy, and a trapezoidal decomposition-based search structure. The current implementation addresses general arrangements of planar curves, including arrangements of nonlinear segments (e.g., conic arcs) and allows for degenerate input (for example, more than two curves intersecting in a single point or overlapping curves). The algorithms use exact geometric computation and thus result in the correct point location. In our landmarks algorithm (a.k.a. jump & walk), special points, &ldquo;landmarks,&rdquo; are chosen in a preprocessing stage, their place in the arrangement is found, and they are inserted into a data structure that enables efficient nearest-neighbor search. Given a query point, the nearest landmark is located and a &ldquo;walk&rdquo; strategy is applied from the landmark to the query point. We report on various experiments with arrangements composed of line segments or conic arcs. The results indicate that compared to the other algorithms tested, the landmarks approach is the most efficient, when the overall (amortized) cost of a query is taken into account, combining both preprocessing and query time. The simplicity of the algorithm enables an almost straightforward implementation and rather easy maintenance. The generic programming implementation allows versatility both in the selected type of landmarks and in the choice of the nearest-neighbor search structure. The end result is an efficient point-location algorithm that bypasses the alternative CGAL implementations in most practical aspects.
Thresholded Learning Matrix for Efficient Pattern Recalling
Authors: Mario Aldape-Pérez, Israel Román-Godínez, Oscar Camacho-Nieto
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

The Lernmatrix, which is the first known model of associative memory, is a heteroassociative memory that can easily work as a binary pattern classifier if output patterns are appropriately chosen. However, this mathematical model undergoes fundamental patterns misclassification whenever crossbars saturation occurs. In this paper, a novel algorithm that overcomes Lernmatrix weaknesses is proposed. The crossbars saturation occurrence is solved by means of a dynamic threshold value which is computed for each recalled pattern. The algorithm applies the dynamic threshold value over the ambiguously recalled class vector in order to obtain a sentinel vector which is used for uncertainty elimination purposes. The efficiency and effectiveness of our approach is demonstrated through comparisons with other methods using real-world data.
Tension Identification of Multi-motor Synchronous System Based on Artificial Neural Network
Authors: Guohai Liu, Jianbing Wu, Yue Shen, Hongping Jia, Huawei Zhou
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Sensorlesstension control of multi-motor synchronous system with closed tension loop is required in many fields. How to identify the knowledge of instantaneous magnitude of tension is key. In this paper the tension identification is managed on the base of stator currents and its previous values with neural network. According to the fundamental state equations of multi-motor system for tension control, the novel method of tension identification using neural network is presented .A multi-layer feed-forward neural network (MFNN) is trained by Back Propagation Levenberger-Marquardt's method. Simulation and experiment results show that the system with tension identification via a neural network has better performance, and it can be used in many application fields.
Half Field Offense in RoboCup Soccer: A Multiagent Reinforcement Learning Case Study
Authors: Shivaram Kalyanakrishnan, Yaxin Liu, Peter Stone
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

We present half field offense, a novel subtask of RoboCup simulated soccer, and pose it as a problem for reinforcement learning. In this task, an offense team attempts to outplay a defense team in order to shoot goals. Half field offense extends keepaway [11], a simpler subtask of RoboCup soccer in which one team must try to keep possession of the ball within a small rectangular region, and away from the opposing team. Both keepaway and half field offense have to cope with the usual problems of RoboCup soccer, such as a continuous state space, noisy actions, and multiple agents, but the latter is a significantly harder multiagent reinforcement learning problem because of sparse rewards, a larger state space, a richer action set, and the sheer complexity of the policy to be learned. We demonstrate that the algorithm that has been successful for keepaway is inadequate to scale to the more complex half field offense task, and present a new algorithm to address the aforementioned problems in multiagent reinforcement learning. The main feature of our algorithm is the use of inter-agent communication, which allows for more frequent and reliable learning updates. We show empirical results verifying that our algorithm registers significantly higher performance and faster learning than the earlier approach. We also assess the contribution of inter-agent communication by considering several variations of the basic learning method. This work is a step further in the ongoing challenge to learn complete team behavior for the RoboCup simulated soccer task.
Swarm simulation and performance evaluation
Authors: Pooia Lalbakhsh, Bahram Zaeri, Mehdi N. Fesharaki, Nasrin Sohrabi
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Applying swarm behavior in computing environments as a novel approach is appeared to be an efficient solution to face critical challenges of the modern cyber world. The emergent improvements of a swarm-based system depend on the selected architecture and the appropriate assignments of the system parameters. To have an improved system, swarm characteristics such as agents/individuals, groups/clusters and communication/interactions should be appropriately characterized according to the system mission. Simulation is one of the best processes to monitor the efficiency of each systems' functionality before its real implementation. Because of the novel and special nature of swarm-based systems, a clear roadmap toward swarm simulation is needed and the process of assigning and evaluating the important parameters should be introduced. This paper in going to determine the important swarm characteristics in simulation phase and explain evaluation methods for important swarm parameters. It also introduces simulation methods of the swarm sub-systems in an artificial world. To clarify the proposed strategies, the AntNet routing algorithm simulation and performance evaluation process is studied according to the proposed methods.
Black-box complexity of encryption and commitment
Authors: Luca Trevisan
Venue:  (2007)

We study the black-box complexity of non-malleable encryption and statistically hiding commitments. We present a black-box construction of a non-malleable encryption scheme from any semantically secure one, and a lower bound on the round complexity of a class of black-box constructions of statistically hiding commitments from one-way permutations.