ppxscal/embedding_network huggingface dataset:
Achieving connectivity through coalescence in mobile robot networks
Authors: Sameera Poduri, Gaurav S. Sukhatme
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time for a worst-case scenario where the robots do not have any knowledge about the environment or positions of other robots and perform independent, memoryless search. Using the random direction mobility model, we show that coalescence time has an exponential distribution which is a function of the number of robots, speed, communication range, and size of the domain. Further, as the number of robots (N) increases, coalescence time decreases as O(1/&radic;N) and &Omega;(log(N)/N). Simulations validate our analysis and also suggest that the lower bound is tight. This paper is an extension of [1] where we studied a simplified setting with a stationary base station that the robots search for and coalesce to.
Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems
Authors: Traian Pop, Paul Pop, Petru Eles, Zebo Peng
Venue: International Journal of Parallel Programming (2008)

We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource, they are organised in a hierarchy. In this paper, we first develop a holistic scheduling and schedulability analysis that determines the timing properties of a hierarchically scheduled system. Second, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We also present several algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilisation of the system. The developed algorithms are evaluated using extensive experiments and a real-life example.
Design of mobile search system about choosing spouse based on individual information
Authors: Chaobo Yang, Ming Qi
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

There is an ideal inamorato in everyone's deep heart. It suggests individual information to be the search object in this paper for the first time. The mobile search system about choosing spouse designed in the paper can help people to find their perfect inamoratos. The societal problems of bachelordom and divorce are worse and worse at the present time. This system helps to solve the problems quite well to a certain extent. It discusses other social benefits from this system and bad impacts which is likely existent and gives advice about how to use this system correctly at the end of this paper.
A Markov model for indoor ultra-wideband channel with people shadowing
Authors: Ruonan Zhang, Lin Cai
Venue: Mobile Networks and Applications (2007)

For an indoor ultra-wideband (UWB) communication system, the line-of-sight (LOS) between the transmitter and receiver may be frequently blocked by moving people. Blocking of LOS may significantly affect the quality of service of on-going UWB communications. Based on the Angular Power Spectrum Density and the human blocking models, we build a packet-level UWB channel model considering the shadowing processes based on a Finite-state Markov Chain. The model is simple enough to be incorporated into existing network simulators like NS-2 and it can be used to facilitate protocol design and quality of service analysis for UWB based wireless personal area networks.
Semantic domains of timed event structures
Authors: I. B. Virbitskaite, R. S. Dubtsov
Venue: Programming and Computing Software (2008)

In the paper, timed extensions of various classes of event structures and marked Scott domains are studied, categories of these models are constructed, and their properties are examined. In addition, based on category-theoretic methods, relationship between the timed structures and marked Scott domains is established.
Adapting to Change: The CFAR Problem in Advanced Hyperspectral Detection
Authors: Alan Schaum
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Newer, realistic models of targets and backgrounds used in hyperspectral detection do not always lend themselves to a CFAR (constant false alarm rate) formulation. Several advanced techniques are considered here. It is found that incorporating a particular empirically validated method of target evolution permits an exact CFAR version of a large class of advanced detectors based on elliptically contoured distributions. Other validated detectors are considered, for which no closed form normalization exists to convert them to CFAR form. For these a geometrical approach to achieving approximate CFAR performance is described and analyzed.
Lipschitz continuity of the best approximation operator in vector-valued Chebyshev approximation
Authors: Martin Bartelt, John Swetits
Venue: Journal of Approximation Theory (2008)

When G is a finite dimensional Haar subspace of C(X,R^k), the vector-valued continuous functions (including complex-valued functions when k is 2) from a finite set X to Euclidean k-dimensional space, it is well-known that at any function f in C(X,R^k) the best approximation operator satisfies the strong unicity condition of order 2 and a Lipschitz (Holder) condition of order 12. This note shows that in fact the best approximation operator satisfies the usual Lipschitz condition of order 1.
Teleworking through optical networks, wireless links, and PBX technologies
Authors: G. Liodakis, I. O. Vardiambasis, V. Zacharopoulos, I. Kaliakatsos
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The development of teleworking relies heavily on telecommunications infrastructure. In particular, fiber optic networks for high speed networking and various wireless standards (IEEE 802.1x) lead to extensions of fixed networks. Moreover, Private Branch Exchanges (PBXs) with the introduction of IP technology are being transformed to universal access platforms for corporations and organizations. In this paper, an overview of these emerging telecommunication technologies and their deployment in Greece is presented. Emphasis is given to the implementation plans for the island of Crete, like the Metropolitan Area Networks (MANs) exploiting fiber optics and wireless communications, or the wireless hotspots for the tourism sector. These implementations' implications on teleworking development in Crete, is examined along with other issues, such as regional development, prevention of out-migration from rural areas, and provision of telematic services.
A Case Study of a Linux Grid on Windows Using Virtual Machines
Authors: Kenichi Tanaka, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Computing demands for science and technology calculations, business use, and imaging techniques are continually rising. Grid computing that uses idle resources is discussed as a platform for such applications. Grid computing is a distributed technology that has High-Throughput Computing (HTC) as its principal objective. Moreover, several middleware solutions are offered as open source software, and thus a grid has the advantage that it can be constructed at a lower cost than a cluster. However, in current grids, it is not possible to use PCs running Windows OS. Therefore, we have chosen to use a virtual machine. In this paper, we compare a Linux grid of virtual machines with a similar Windows grid.
Audio-Based Video Editing with Two-Channel Microphone
Authors: Tetsuya Takiguchi, Jun Adachi, Yasuo Ariki
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Audio has a key index in digital videos that can provide useful information for video editing, such as capturing conversations only, clipping only talking people, and so on. In this paper, we are studying about video editing based on audio with a two-channel (stereo) microphone that is standard equipment on video cameras, where the video content is automatically recorded without a cameraman. In order to capture only a talking person on video, a novel voice/non-voice detection algorithm using AdaBoost, which can achieve extremely high detection rates in noisy environments, is used. In addition, the sound source direction is estimated by the CSP (Crosspower-Spectrum Phase) method in order to zoom in on the talking person by clipping frames from videos, where a two-channel (stereo) microphone is used to obtain information about time differences between the microphones.
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Authors: Koushik Sinha, Suranjan Ghose, Pradip K. Srimani
Venue: Journal of Parallel and Distributed Computing (2008)

We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O(nlogn) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O(Dnlogn) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.
Giving Biological Behaviour to the Turbo Codes Efficient Interleaver with the Genetic Algorithms (New Interleaver Pattern BGOI)
Authors: Václav Snáel, Pavel Krömer, Nabil Ouddane
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Since the appearance in 1993, first approaching the Shannon limit, the Turbo Codes give a new direction for the channel encoding field, especially since they were adopted for multiple norms of telecommunications, such as deeper communication. To obtain an excellent performance it is necessary to design robust turbo code interleaver. We are investigating genetic algorithms as a promising optimization method to find good performing interleaver for the large frame sizes. In this paper, we present our work, compare with several previous approaches and present experimental results.
Product retrieval for grocery stores
Authors: Petteri Nurmi, Eemil Lagerspetz, Wray Buntine, Patrik Floréen, Joonas Kukkonen
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We introduce a grocery retrieval system that maps shopping lists written in natural language into actual products in a grocery store. We have developed the system using nine months of shopping basket data from a large Finnish supermarket. To evaluate the system, we used 70 real shopping lists gathered from customers of the supermarket. Our system achieves over 80% precision for products at rank one, and the precision is around 70% for products at rank 5.
Bayes Optimal DDoS Mitigation by Adaptive History-Based IP Filtering
Authors: Markus Goldstein, Christoph Lampert, Matthias Reif, Armin Stahl, Thomas Breuel
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Distributed Denial of Service (DDoS) attacks are today the most destabilizing factor in the global internet and there is a strong need for sophisticated solutions. We introduce a formal statistical framework and derive a Bayes optimal packet classifier from it. Our proposed practical algorithm "Adaptive History-Based IP Filtering" (AHIF) mitigates DDoS attacks near the victim and outperforms existing methods by at least 32% in terms of collateral damage. Furthermore, it adjusts to the strength of an ongoing attack and ensures availability of the attacked server. In contrast to other adaptive solutions, firewall rulesets used to resist an attack can be precalculated before an attack takes place. This ensures an immediate response in a DDoS emergency. For evaluation, simulated DDoS attacks and two real-world user traffic datasets are used.
Exploring semantic interference in heterogeneous sensor networks
Authors: Laura Marie Feeney
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

As the use of sensor networks expands, there will be multiple, independent networks operating in the same physical space. These networks will run heterogeneous applications and be managed by different entities. At the same time, the development of commercially available, general purpose sensor platforms makes it likely that co-located networks will be based on the same platform. Such networks will unavoidably interact with each other due their common communication hardware. "Semantic interference" occurs when frames transmitted in one sensor network are successfully decoded and (mis-)interpreted in another. This paper examines modes of conflict, co-existence, and cooperation that obtain in this context.
An approach to fuzzy granule-based hierarchical polynomial networks for empirical data modeling in software engineering
Authors: Byoung-Jun Park, Witold Pedrycz, Sung-Kwun Oh
Venue: Information and Software Technology (2008)

Experimental software data capturing the essence of software projects (expressed e.g., in terms of their complexity and development time) have been a subject of intensive modeling. In this study, we introduce a new category of fuzzy granule-based hierarchical polynomial networks (FG-HPN) and discuss their comprehensive design methodology. The FG-HPN architecture benefits from the existence of highly synergistic linkages between fuzzy granules (referred here as granular information design phase of FG-HPN) and hierarchical polynomial networks (referred as network design phase of FG-HPN). We develop a rule-based fuzzy granules consisting of a number of ''if-then'' statements whose antecedents are formed in the input space and linked with the consequents (conclusion parts) formed in the output space. Hierarchical polynomial networks provide approximation of experimental data. In this framework, fuzzy granules contribute to the realization of the granular information design phase of the overall networks structure of the FG-HPN. The networks design phase is designed with the aid of genetically endowed hierarchical polynomial networks. The experiments reported in this study deal with well-known software data such as the NASA dataset concerning software cost estimation and the one describing software modules of the Medical Imaging System (MIS). In comparison with the previously discussed approaches, the proposed FG-HPN is more accurate and yield significant generalization abilities.
Investigation of Secure Framework for Multipath MANET
Authors: Binod Vaidya, Dong-You Choi, JongAn Park, SeungJo Han
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

A wireless multihop ad hoc network is emerging as an important area for new developments in the ubiquitous network. Although ad hoc network is attractive solution, there are still some challenges in robustness and security issues. In this paper, we have depicted a secure framework for multipath routing in wireless multihop network, which is complete solution for end-to-end security for multipath wireless multihop network. We have analyzed the performance the proposed framework.
An SDL Implementation of the UMTS Radio Resource Control Protocol Oriented to Conformance Testing
Authors: José M. Álvarez, Pedro de la Cámara, Jesús Martínez, Pedro Merino, Francisco C. Pérez, Victoria Morillo
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

SDL and other related ITU-T formal languages have been revealed as a valid approach to developing software for critical systems, such as telecommunication equipment. In this context, this paper presents the use of SDL to implement one of the most complex part of UMTS networks, the Radio Resource Control protocol (RRC). SDL has been used at all the steps of the design and the implementation process, making use of the auto- matic code generation capabilities of well-known SDL tools. The resulting system will be integrated as a part of a conformance testing box for 3G mobile phones, namely MINT, a product developed by one of the certification leaders in the industry, CETECOM S.A. The main conclusion obtained from this project is that SDL (together with ASN.1) has good capabilities to design and implement realistic complex systems with a very limited use of external languages, like C. During ments belonging to different companies. In this context, the development, we have been able to take advantages of its formal basis and tool support for simulation and verification.
Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks
Authors: Giuliano Casale, Richard Muntz, Giuseppe Serazzi
Venue: IEEE Transactions on Computers (2008)

We propose the Geometric Bounds (GB), a new family of fast and accurate non-iterative bounds on closed queueing network performance metrics that can be used in the on-line optimization of distributed applications. Compared to state-of-the-art techniques such as the Balanced Job Bounds (BJB), the GB achieve higher accuracy at similar computational costs, limiting the worst-case bounding error typically within 5%-13% when for the BJB it is usually in the range 15%-35%. Optimization problems that are solved with the GB bounds return solutions that are much closer to the global optimum than with existing bounds. We also show that the GB technique generalizes as an accurate approximation to closed fork-join networks commonly used in disk, parallel and database models, thus extending the applicability of the method beyond the optimization of basic product-form networks.
Mathematical modeling and computer simulation of the Ia monosynaptic reflex fluctuations
Authors: C. Zamora, A. Fraguela, A. Gómez, L. Cervantes, E. Manjarrez
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

The simplest possible neural circuit that mediates some elementary unit of behavior is the monosynaptic reflex pathway formed by muscle spindle afferents (Ia) and their synaptic connections with alpha motoneurons. Since Sherrington in 1906 is very well known that successive stimuli applied on Ia afferents produce monosynaptic reflexes of variable amplitude. The sources of this variability include presynaptic and postsynaptic influences from other neurons within the central nervous system. The purpose of the present study is to present a mathematical modeling and a computer simulation of the variability of the Ia monosynaptic reflexes of the cat spinal cord. We used the Hodgkin-Huxley formulation to obtain a mathematical model of the membrane potential of motoneurones based on the influence of synaptic sources from dorsal horn neurons, inhibitory neurons, and excitatory supraspinal neurons. Amplitude fluctuations of the monosynaptic reflexes were computed using the solutions of the mathematical model for 100 motoneurones. In addition, we have obtained a model which reproduces many of the characteristics of the macroscopic field potentials generated by the spontaneous electrical activity of these dorsal horn neurons.
Modelling of a Wave-Based Bilateral Teleoperation System: A New Approach to Control a Two Degree of Freedom Robot Model
Authors: Seyed Reza Seyed Tabib, Ali Akbar Jalali
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Time delay is a serious problem for bilateral teleoperation systems. Even a small time delay in a bilateral teleoperation system will generally degrade the system’s performance and cause instability. Wave variable based on passivity and scattering theory method is an important approach that guarantees stability and establishes bilateral teleoperation in the presence of any constant time delay. In this paper, a new control scheme based on wave variables is proposed. This control scheme, is composed of feedback linearization method combined with PD controller to control a nonlinear model. A 2-DOF (degree-of-freedom) bilateral teleoperation system using the new Structure method is simulated using a SIMULINK model in MATLAB environment.
An Automatic Mechanism for Adjusting Validation Function
Authors: Jin-Cherng Lin, Jan-Min Chen, Cheng-Hsiung Liu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Injection attack is a technique to bypass or modify the originally intended functionality of the program. Many application’s security vulnerabilities result from generic injection problems. Examples of such vulnerabilities are SQL injection, Shell injection and Script injection (Cross Site Scripting). Proper input validation is an effective countermeasure to act as a defense against input attacks. However, it is challenging because there is no specific answer for what implies valid input across applications. As individual fields often require specific validation, input validation adopting only one filter rule may induce false negative or false positive. We develop a defense system consisting of an event driven security testing framework and an adjustable validation function on a security gateway. The security gateway is allocated in front of application server to eliminate malicious injection vulnerabilities. To verify the efficiency of the adjustable mechanism, we focus on whether the validation functions included in meta-programs have proper filter rules to sanitize input data. Among our experiments, different fields may have various validation rules made up of some sub-rules. By means of these rules, we reduce false rate and increase detection rate. That is to say, we prove that the diversified validation rules produced by our automatic mechanism are more efficient and elastic than only one rule.
Real-time data mining of non-stationary data streams from sensor networks
Authors: Lior Cohen, Gil Avrahami-Bakish, Mark Last, Abraham Kandel, Oscar Kipersztok
Venue: Information Fusion (2008)

In real-world sensor networks, the monitored processes generating time-stamped data may change drastically over time. An online data-mining algorithm called OLIN (on-line information network) adapts itself automatically to the rate of concept drift in a non-stationary data stream by repeatedly constructing a classification model from every sliding window of training examples. In this paper, we introduce a new real-time data-mining algorithm called IOLIN (incremental on-line information network), which saves a significant amount of computational effort by updating an existing model as long as no major concept drift is detected. The proposed algorithm builds upon the oblivious decision-tree classification model called ''information network'' (IN) and it implements three different types of model updating operations. In the experiments with multi-year streams of traffic sensors data, no statistically significant difference between the accuracy of the incremental algorithm (IOLIN) vs. the regenerative one (OLIN) has been observed.