ppxscal/embedding_network huggingface dataset:
On Route Lifetime in Multihop Mobile Ad Hoc Networks
Authors: Yu-Chee Tseng
Venue: IEEE Transactions on Mobile Computing (2003)

One wireless network architecture that has received a lot of attention recently is the mobile ad hoc network (MANET). It is attractive because the network can be quickly deployed without the infrastructure of base stations. One main feature of MANET is that mobile hosts may communicate with each other through a sequence of wireless links (i.e., in a multihop manner). While many routing protocols have been proposed for MANET by considering criteria such as length, quality, bandwidth, and signal strength, the issue of route lifetime has not been addressed formally. This paper presents a formal model to predict the lifetime of a routing path based on the random walk model. Route lifetime is derived based on a probabilistic model. Through such investigation, we hope to provide further insight into issues such as route selection, route maintenance, and network scalability related to MANETs.
EERP: energy-efficient routing protocol for wireless sensor networks
Authors: Samra Boulfakhar, Mohamed Benmohammed
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Networking unattended sensors is expected to have a significant impact on the efficiency of many military and civil applications. Sensors in such systems are typically disposable and expected to last until their energy drains. Therefore, energy is a very scarce resource for such sensor systems and has to be managed wisely in order to extend the life of the sensors for the duration of a particular mission. In this paper, we present a new protocol of routing for wireless sensor networks named EERP (Energy-Efficient Routing Protocol for wireless sensor networks) that maximizes the lifetime of the sensors. Its principle is as follows: each node sends the data captured on the way which minimizes the consumption of energy as well as the variance of energies consumed by the sensors nodes. Our experimental results show that our protocol increase the lifetime of the sensors network and conserve the energy of the nodes up to optimum level better than the Energy Aware Routing protocol (EAR).
A Platform of Distributed Speech Recognition for the European Portuguese Language
Authors: João Miranda, João P. Neto
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

In this paper we present a Distributed Speech Recognition system for the European Portuguese based on the Audimus system, that can be used in embedded systems such as PDAs. The obtained system has no significant degradation in what concerns word error rates or increased latency in processing, and only a small increase in word error rate when the audio is recorded using the microphone in the device.
Linear Logical Algorithms
Authors: Robert J. Simmons, Frank Pfenning
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Bottom-up logic programming can be used to declaratively specify many algorithms in a succinct and natural way, and McAllester and Ganzinger have shown that it is possible to define a cost semantics that enables reasoning about the running time of algorithms written as inference rules. Previous work with the programming language Lollimon demonstrates the expressive power of logic programming with linear logic in describing algorithms that have imperative elements or that must repeatedly make mutually exclusive choices. In this paper, we identify a bottom-up logic programming language based on linear logic that is amenable to efficient execution and describe a novel cost semantics that can be used for complexity analysis of algorithms expressed in linear logic.
Real-time HSPA emulator for end-to-edge QoS evaluation in all-IP beyond 3G heterogeneous wireless networks
Authors: Miguel López-Benítez, Francisco Bernardo, Nemanja Vučević, Anna Umbert
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This paper is aimed at presenting the real-time High Speed Packet Access (HSPA) emulator that has been developed in the framework of the AROMA project. Real-time emulators allow reproducing realistic scenarios to test algorithms, strategies, protocols and applications under realistic conditions. Therefore, real-time emulators constitute a powerful tool to evaluate the end-user's Quality of Experience (QoE), which could not be achieved by means of off-line simulations. The presented emulator is integrated in the AROMA real-time testbed, which has been developed to provide a framework for demonstrating the benefits of the common radio resource management algorithms as well as the proposed end-to-edge Quality of Service (QoS) management techniques developed for all-IP beyond 3G heterogeneous wireless networks in the context of the AROMA project. This paper presents a qualitative description of the developed tool, emphasizing some interesting implementation details that may result helpful in the development of similar emulation platforms. Some illustrative results, showing the capabilities of the developed tool, are also presented and analyzed.
Adaptive Spell Checker for Dyslexic Writers
Authors: Tuomas Korhonen
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Dyslexic writers make more spelling errors than non-dyslexic writers do. There is some disagreement as to whether they display distinct characteristics in their spelling errors or whether they make errors typical of a younger age group while trying to use vocabulary that is of a level similar to that of others their own age. We hypothesise that the spell checking needs of dyslexic writers differ from those of non-dyslexic writers and that those needs are not adequately met by existing spell checkers. We also hypothesise that spell checkers may be adapted to better meet these needs and that such adaptation would increase the ability of the spell checkers to both detect and correct the spelling errors of dyslexic writers. In this paper, we examine two spell checking methods, one, which can adapt to the writing style of the user and the other, which uses phonetic information to predict the intended word.
Transforming Abstract Interpretations by Abstract Interpretation
Authors: Roberto Giacobazzi, Isabella Mastroeni
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

In this paper we exploit abstract interpretation for transforming abstract domains and semantics. The driving force in both transformations is making domains and semantics, i.e. abstract interpretations themselves, complete, namely precise, for some given observation. We prove that a common geometric pattern is shared by all these transformations, both at the domain and semantic level. This pattern is based on the notion residuated closures, which in our case can be viewed as an instance of abstract interpretation. We consider these operations in the context of language-based security, and show how domain and semantic transformations model security policies and attackers, opening new perspectives in the model of information flow in programming languages.
Permutation-Based Distributed Video Coding
Authors: Lihua Guo
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

A permutation-based preprocessing is proposed to solve the burst error problem in video distributed coding. In send, this method uses the chaotic mapping to permute the image, and put the permuted image into the traditional distributed video encoder. In receiver, the image will be easily restored from the decoded one. The experimental results show that this permutation-based preprocessing can improve the performance of distributed video coding. In addition, this system structure is low-complexity, and can be used in some security applications.
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints
Authors: Kenil C. Cheng, Roland H. Yap
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

In many real-life problems, constraints are explicitly defined as a set of solutions. This ad hoc (table) representation uses exponential memory and makes support checking (for enforcing GAC) difficult. In this paper, we address both problems simultaneously by representing an ad hoc constraint with a multi-valued decision diagram (MDD), a memory efficient data structure that supports fast support search. We explain how to convert a table constraint into an MDD constraint and how to maintain GAC on the MDD constraint. Thanks to a sparse set data structure, our MDD-based GAC algorithm, mddc, achieves full incrementality in constant time. Our experiments on structured problems, car sequencing and still-life, show that mddc is a fast GAC algorithm for ad hoc constraints. It can replace a Boolean sequence constraint [1], and scales up well for structural MDD constraints with 208 variables and 340984 nodes. We also show why it is possible for mddc to be faster than the state-of-the-art generic GAC algorithms in [2,3,4]. Its efficiency on non-structural ad hoc constraints is justified empirically.
Succinct description of regular languages by weak restarting automata
Authors: Martin Kutrib, Jens Reimann
Venue: Information and Computation (2008)

The descriptional complexity of restarting automata is investigated. We distinguish the classes of weak restarting automata, i.e., classical restarting automata accepting exactly the regular languages. In order to investigate the descriptional power gained by the additional structural resources of restarting automata, we study the trade-offs in the number of states when changing the representation to classical finite automata. The bounds shown are tight in the exact number of states. Interestingly, for a particular class we can show the tight bounds 2^n+1 and 2^n for DFA and NFA conversion, respectively, by a fooling set technique. So, the power gained by the resources given to restarting automata seems to be different compared with nondeterminism.
Achieving pervasive awareness through artwork
Authors: Salah Uddin Ahmed
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Aesthetics and ludic aspects of pervasive awareness applications make the awareness system more attractive and aesthetically pleasing to its users. The same objective can be achieved by adding pervasive awareness features to an aesthetic object such as an artwork. In this article we describe how an artwork can be transformed to an pervasive awareness application by adding awareness features into the artwork.
Design of Fuzzy Relation-Based Polynomial Neural Networks Using Information Granulation and Symbolic Gene Type Genetic Algorithms
Authors: Sungkwun Oh, Intae Lee, Witold Pedrycz, Hyunki Kim
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this study, we introduce and investigate a genetically optimized fuzzy relation-based polynomial neural networks with the aid of information granulation (IG_gFRPNN), develop a comprehensive design methodology involving mechanisms of genetic optimization with symbolic gene type. With the aid of the information granules based on C-Means clustering, we can determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. The GA-based design procedure being applied at each layer of IG_gFRPNN leads to the selection of preferred nodes with specific local characteristics (such as the number of input variables, the order of the polynomial, a collection of the specific subset of input variables, and the number of membership function) available within the network. The proposed model is contrasted with the performance of the conventional intelligent models shown in the literatures.
Identification of Key Development Areas for the Opole Region
Authors: Miroslaw Dytczak, Grzegorz Ginda
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

A problem of key development areas identification for regional development is discussed in the paper. Multiple-criteria decision support is applied. Dual-method approach is proposed. Parallel application of two MCDA methods: analytic hierarchy/network process (AHP/ANP) and DEMATEL. Both methods are based on a pair-wise comparison foundation and allow to include the influence of intangibles. However, there is slight difference with regard to form of delivered results. Therefore, parallel utilisation of the methods allows to enrich decision analysis to attain better results. The approach proved useful for realisation of the National Foresight Programme. A problem of key development areas identification for one of Polish regions—the Opole Region was coped with. Obtained results confirm usefulness of the approach.
End-to-End Performance of 10-Gigabit Ethernet on Commodity Systems
Authors: Justin (Gus) Hurwitz, Wu-chun Feng
Venue: IEEE Micro (2004)

Intel's network interface card for 10-Gigabit Ethernet (10GbE) allows individual computer systems to connect directly to 10GbE Ethernet infrastructures. Results from various evaluations suggest that 10GbE could serve in networks from LANS to WANs.
Revising and polishing a structured abstract: Is it worth the time and effort?
Authors: James Hartley, Lucy Betts
Venue: Journal of the American Society for Information Science and Technology (2008)

Many writers of structured abstracts spend a good deal of time revising and polishing their texts&mdash;but is it worth it? Do readers notice the difference? In this paper we report three studies of readers using rating scales to judge (electronically) the clarity of an original and a revised abstract, both as a whole and in its constituent parts. In Study 1, with approximately 250 academics and research workers, we found some significant differences in favor of the revised abstract, but in Study 2, with approximately 210 information scientists, we found no significant effects. Pooling the data from Studies 1 and 2, however, in Study 3, led to significant differences at a higher probability level between the perception of the original and revised abstract as a whole and between the same components as found in Study 1. These results thus indicate that the revised abstract as a whole, as well as certain specific components of it, were judged significantly clearer than the original one. In short, the results of these experiments show that readers can and do perceive differences between original and revised texts&mdash;sometimes&mdash;and that therefore these efforts are worth the time and effort. &copy; 2008 Wiley Periodicals, Inc.
Adaptive Algorithms for Interactive Multimedia
Authors: Nikolaos D. Doulamis, Anastasios D. Doulamis, Theodora A. Varvarigou
Venue: IEEE MultiMedia (2003)

Modeling multimedia content by identifying semantically meaningful entities can be arduous because it is difficult to simulate human perception. However, by creating an algorithm to respond interactively to user preference, content-retrieval systems can become more efficient and easier to use.
Parameter-Based Categorization for Musical Instrument Retrieval
Authors: Rory Lewis, Alicja Wieczorkowska
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In the continuing goal of codifying the classification of musical sounds and extracting rules for data mining, we present the following methodology of categorization, based on numerical parameters. The motivation for this paper is based upon the fallibility of Hornbostel and Sachs generic classification scheme, used in Music Information Retrieval for instruments. In eliminating the redundancy and discrepancies of Hornbostel and Sachs' classification of musical sounds we present a procedure that draws categorization from numerical attributes, describing both time domain and spectrum of sound. Rather than using classification based directly on Hornbostel and Sachs scheme, we rely on the empirical data describing the log attack, sustainability and harmonicity. We propose a categorization system based upon the empirical musical parameters and then incorporating the resultant structure for classification rules.
Fast allocation algorithms
Authors: Dayid S. Johnson
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior. Linear time algorithms are then introduced which, though "faster" than FIRST FIT and BEST FIT, have the same, or better, worst case behavior. Finally, an improved polynomial-time algorithm is found for a problem of scheduling on multiprocessing systems, by treating this as a bin packing problem. 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
Mobile Agents Implementing Local Computations in Graphs
Authors: Bilel Derbel, Mohamed Mosbah, Stefan Gruner
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Mobile agents are a well-known paradigm for the design and implementation of distributed systems. However, whilst their popularity continues to grow, a uniform theory of mobile agent systems is not yet sufficiently elaborated, in comparison with classical models of distributed computation. In this paper we show how to use mobile agents as an alternative model for implementing distributed local computation rules. In doing so, we approach a general and unified framework for local computations which is consistent with the classical theory of distributed computations based on graph relabeling systems.
On Logic with Fuzzy and Rough Powerset Monads
Authors: Patrik Eklund, Maria A. Galán
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Non-standard logics departs from traditional logic mostly in extended views, on one hand syntactically related to logical operators, and on the other hand semantically related to truth values. Typical for these approaches is the remaining traditional view on 'sets and relations' and on terms based on signatures. Thus the cornerstones of the languages remain standard, and so does mostly the view on knowledge representation and reasoning using traditional substitution theories and unification styles. In previous papers we have dealt with particular problems such as generalizing terms and substitution, extending our views on sets and relations, and demonstrated the use of these non-standard language elements in various applications such as for fuzzy logic, generalized convergence spaces, rough sets and Kleene algebras. In this paper we provide an overview and summarized picture of what indeed happens when we drop the requirement for using traditional sets with relations and terms with equational settings.
Inference and Reformation in Flow Graphs Using Granular Computing
Authors: Huawen Liu, Jigui Sun, Changsong Qi, Xi Bai
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Flow graph (FG) is a new mathematical model which can be used for representing, analyzing, and discovering knowledge in databases. Due to its well-structured characteristics of network, FG is naturally consistent with granular computing (GrC). Meanwhile, GrC provides us with both structured thinking at the philosophical level and structured problem solving at the practical level. In this paper, the relationship between FG and GrC will be discussed from three aspects under GrC at first, and then inference and reformation in FG can be easily implemented in virtue of decomposition and composition of granules, respectively. As a result of inference and reformation, the reformed FG is a reduction of the original one.
Network Architecture and Fast Handover Scheme Using Mobility Anchor for UMTS-WLAN Interworking
Authors: Incheol Kim, Sungkuen Lee, Taehyung Lim, Eallae Kim, Jinwoo Park
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

UMTS-WLAN interworking has attracted many research efforts because each of UMTS and WLAN can maximize its capability in service provisioning. Through UMTS-WLAN internetworking, users can be offered the most suitable services according to service area and service provider can reduce network building and maintenance costs. In this paper, we propose a network architecture and fast handover scheme using Mobility Anchor (MA) for UMTS-WLAN interworking. MA is provided at the boundary between GGSN and PDG, under the 3GPP-proposed interworking reference model. Such MA can enable authentication and session establishment before L2 handover of the mobile node, so that seamless and fast vertical handover could be possible. Through computer simulation using OPNET for the performance measurement, the efficiency and validity of the proposed scheme has been examined.
An Improve to Human Computer Interaction, Recovering Data from Databases Through Spoken Natural Language
Authors: Omar Florez-Choque, Ernesto Cuadros-Vargas
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The fastest and most straightforward way of communication for mankind is the voice. Therefore, the best way to interact with computers should be the voice too. That is why at the moment men are searching new ways to interact with computers. This interaction is improved if the words spoken by the speaker are organized in Natural Language.In this article, it is proposed a model to recover information from databases through queries in Spanish Natural Language using the voice as the way of communication. This model incorporates a Hybrid Intelligent System based on Genetic Algorithms and a Kohonen Self-Organizing Map (SOM) to recognize the present phonemes in a word through time. This approach allows us to remake up a word with speaker independence. Furthermore, it is proposed the use of a compiler with type 2 grammar according to the Chomsky Hierarchy to support the syntactic and semantic structure in Spanish language. Our experiments suggest that the Spoken Natural Language improves notably the Human-Computer interaction when compared with traditional input methods such as: mouse or keybord.
Gene Team Tree: A Compact Representation of All Gene Teams
Authors: Melvin Zhang, Hon Wai Leong
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

The identification of conserved gene clusters is an important step towards understanding genome evolution and predicting the function of genes. Gene team is a model for conserved gene clusters that takes into account the position of genes on a genome. Existing algorithms for finding gene teams require the user to specify the maximum distance between adjacent genes in a team. However, determining suitable values for this parameter, ¿, is non-trivial. Instead of trying to determine a single best value, we propose constructing the gene team tree (GTT), which is a compact representation of all gene teams for every possible value of ¿. Our algorithm for computing the GTT extends existing gene team mining algorithms without increasing their time complexity. We compute the GTT for E. coli K-12 and B. subtilis and show that E. coli K-12 operons are recovered at different values of ¿. We also describe how to compute the GTT for multi-chromosomal genomes and illustrate using the GTT for the human and mouse genomes.