ppxscal/embedding_network huggingface dataset:
Analysis of an Adaptive Key Selection Scheme in Wireless Sensor Networks
Authors: Guorui Li, Jingsha He, Yingfang Fu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Sensor networks are suitable for a variety of commercial and military applications due to their self-organization characteristics and distributed nature. As a fundamental requirement for security functionality in sensor networks, key management plays a central role in authentication and encryption. In this paper, we describe an Adaptive Key Selection (AKS) scheme for multi-deployment in sensor networks and analyze the scheme in the aspects of security, connectivity and overhead. Our analysis shows that the AKS scheme can greatly improve the connectivity of sensor nodes while maintaining the security of an existing multi-deployment scheme.
DANTE: A Self-adapting Peer-to-Peer System
Authors: Luis Rodero Merino, Luis López, Antonio Fernández, Vicent Cholvi
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

In this paper we introduce DANTE, an unstructured P2P system in which the topology of the underlying overlay network can be dynamically adapted to the system conditions. Such an adaption is performed by the peers in an autonomous manner. DANTE uses a simple search mechanism based on random walks that, combined with the topology adaptation, allows it to work in a very efficient way. We have evaluated how DANTE behaves in practice, showing that it successfully adapts to varying system load conditions.
Temporal Data Mining with Temporal Constraints
Authors: M. Campos, J. Palma, R. Marín
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Nowadays, methods for discovering temporal knowledge try to extract more complete and representative patterns. The use of qualitative temporal constraints can be helpful in that aim, but its use should also involve methods for reasoning with them (instead of using them just as a high level representation) when a pattern consists of a constraint network instead of an isolated constraint.In this paper, we put forward a method for mining temporal patterns that makes use of a formal model for representing and reasoning with qualitative temporal constraints. Three steps should be accomplished in the method: 1) the selection of a model that allows a trade off between efficiency and representation; 2) a preprocessing step for adapting the input to the model; 3) a data mining algorithm able to deal with the properties provided by the model for generating a representative output.In order to implement this method we propose the use of the Fuzzy Temporal Constraint Network (FTCN) formalism and of a temporal abstraction method for preprocessing. Finally, the ideas of the classic methods for data mining inspire an algorithm that can generate FTCNs as output.Along this paper, we focus our attention on the data mining algorithm.
High level communication functionalities for wireless sensor networks
Authors: Carme Àlvarez, Josep Díaz, Jordi Petit, José Rolim, Maria Serna
Venue: Theoretical Computer Science (2008)

In this paper we show how to establish a reliable and efficient high level communication system in a randomly deployed network of sensors equipped with directional antennas. This high level communication system enables the programming of the sensor network using high level communication functionalities without the burden of taking care of their physical capacities (low range, unidirectional links, single frequency, presence of collisions, etc.). The high level communication functionalities we offer include point-to-point communication, point-to-area communication, and one-to-all communication. The basic idea to implement this system is to simulate a virtual network that emerges from the ad-hoc network using self-organization, self-discovery and collaborative methods. We also analyse the efficiency, scalability and robustness of the proposed protocols.
Optical Flow Based Velocity Field Control
Authors: Leonardo Fermín, Wilfredis Medina-Meléndez, Juan C. Grieco, Gerardo Fernández-López
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This work describes a velocity field controller for a mobile platform based on the estimation of its position using odometry. It is a known fact that this approach has an unbounded error attached. The approach here proposed uses a position estimation obtained by odometry, which uses the six components of the velocity calculated on the basis of the displacement vectors resulted from optical flow estimation. The control loop proposed takes the position estimation as reference and performs a velocity field control. Results obtained shows that, for closed trajectories, the tracking error is bounded.
Micropayments: An Idea Whose Time Has Passed Twice?
Authors: Michael Lesk
Venue: IEEE Security and Privacy (2004)

Articles in the business press suggest there is a resurgence in the popularity of the idea of micropayments, but challenges remain on multiple fronts before such technology could play a significant role in the global economy. Not least among these are sociological issues that could keep users from embracing micropayments as a solution any time soon.
Corruption and Recovery-Efficient Locally Decodable Codes
Authors: David Woodruff
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

A (q, ¿, ¿)-locally decodable code (LDC) C: {0,1} n ¿{0,1} m is an encoding from n-bit strings to m-bit strings such that each bit x k can be recovered with probability at least $\frac{1}{2} + \epsilon$ from C(x) by a randomized algorithm that queries only q positions of C(x), even if up to ¿m positions of C(x) are corrupted. If C is a linear map, then the LDC is linear. We give improved constructions of LDCs in terms of the corruption parameter ¿ and recovery parameter ¿. The key property of our LDCs is that they are non-linear, whereas all previous LDCs were linear. 1 For any ¿, ¿ ¿ [¿(n ¿ 1/2), O(1)], we give a family of (2, ¿, ¿)-LDCs with length . For linear (2, ¿, ¿)-LDCs, Obata has shown that $m \geq \exp \left (\delta n \right )$. Thus, for small enough constants ¿, ¿, two-query non-linear LDCs are shorter than two-query linear LDCs. 1 We improve the dependence on ¿ and ¿ of all constant-query LDCs by providing general transformations to non-linear LDCs. Taking Yekhanin's linear (3, ¿, 1/2 ¿ 6¿)-LDCs with $m = \exp \left (n^{1/t} \right )$ for any prime of the form 2 t ¿ 1, we obtain non-linear (3, ¿, ¿)-LDCs with . Now consider a (q, ¿, ¿)-LDC C with a decoder that has n matchings M 1, ..., M n on the complete q-uniform hypergraph, whose vertices are identified with the positions of C(x). On input k ¿ [n] and received word y, the decoder chooses e = {a 1, ..., a q } ¿ M k uniformly at random and outputs $\bigoplus_{j=1}^q y_{a_j}$. All known LDCs and ours have such a decoder, which we call a matching sum decoder. We show that if C is a two-query LDC with such a decoder, then $m \geq \exp \left (\max(\delta, \epsilon)\delta n \right )$. Interestingly, our techniques used here can further improve the dependence on ¿ of Yekhanin's three-query LDCs. Namely, if ¿ ¿ 1/12 then Yekhanin's three-query LDCs become trivial (have recovery probability less than half), whereas we obtain three-query LDCs of length $\exp \left (n^{1/t} \right )$ for any prime of the form 2 t ¿ 1 with non-trivial recovery probability for any ¿< 1/6.
Sorting Genomes with Insertions, Deletions and Duplications by DCJ
Authors: Sophia Yancopoulos, Richard Friedberg
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

We extend the DCJ paradigm to perform genome rearrangments on pairs of genomes having unequal gene content and/or multiple copies by permitting genes in one genome which are completely or partially unmatched in the other. The existence of unmatched gene ends introduces new kinds of paths in the adjacency graph, since some paths can now terminate internal to a chromosome and not on telomeres. We introduce Òghost adjacenciesÓ to supply the missing gene ends in the genome not containing them. Ghosts enable us to close paths that were due to incomplete matching, just as null points enable us to close even paths terminating in telomeres. We define generalalized DCJ operations on the generalized adjacency graph, and give a prescription for calculating the DCJ distance for the expanded repertoire of operations which includes insertions, deletions and duplications.
John Hamilton Curtiss, 1909-1977
Authors: John Todd
Venue: IEEE Annals of the History of Computing (1980)

John Hamilton Curtiss was chief of the Applied Mathematics Division of the National Bureau of Standards from 1946 to 1953. He was largely responsible for the planning and construction SEAC and SWAC and for the procurement of the first UNIVACs for federal establishments.
Systems Engineering for Technology Enhanced Learning
Authors: Sybille Hambach, Alke Martens
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Process models for developing diverse kinds of systems, including e-Learning systems, can be found dated back to the mid 1990. Given the current state of the art in system development in combination with experience in development of e-Learning systems, a modernization of existing approaches and an adaptation to the special needs of e-Learning development projects is required. This has been done in developing ROME, the ROstock Model for systematically developing E-Learning products and services.
Discontinuous control for the parking problem of a mobile robot with four steering wheels
Authors: Plamen Petrov, Ognian Boumbarov, Alexander Bekyarski
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

This paper proposes a discontinuous time- invariant controller for the parking problem of a four-wheel-steering (4WS) mobile robot. Using non smooth coordinate transformation based on a polar representation of the kinematic model, the control law is constructed via Lyapunov-based techniques yielding exponential stability of the closed-loop system. Simulation results illustrate the effectiveness of the proposed controller.
LIG at INEX 2007 Ad Hoc Track: Using Collectionlinks as Context
Authors: Delphine Verbyst, Philippe Mulhem
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)

We present in this paper the work of the Information Retrieval Modeling Group (MRIM) of the Computer Science Laboratory of Grenoble (LIG) at the INEX 2007 Ad Hoc Track. We study here the impact of non structural relations between structured document elements (doxels) on structured documents retrieval. We use existing links between doxels of the collection, encoded with the collectionlink tag, to integrate link and content aspects. We characterize the relation induced by the collectionlink tags with relative exhaustivity and specificity scores. As a consequence, the matching process is based on doxels content and these features. Results of experiments on the test collection are presented. Runs using non structural links overperform a baseline without such links.
From the How to the What
Authors: Tiziana Margaria, Bernhard Steffen
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their business processes/applications in a fashion that allows for a subsequent automatic realization on a given platform. This goal, which aims at simplifying the tasks of the many at the cost of ambitious and laborious tasks for the few, adds a new dimension to the techniques and concepts aimed at by the Grand Challenge: the application-specific design of platforms tailored for the intended goal. We are convinced that the outlined perspective provides a realistic and economically important milestone for the Grand Challenge.
The X-Scale Challenge
Authors: George Bosilca
Venue: Proceedings of the 14th European PVM/MPI User's Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2007)

The last few years have seen fast changes in the high performance computing field. Some of these changes are related to the computer hardware and architecture. Multi/many core architecture have become prevalent, with architectures more or less exotic and heterogeneous. The overall theoretical computational power of the new generation processors increased greatly, but their programmability still lacks confidence. The changes in shape of the newest architectures has come so rapidly, that we are still deficient in terms of high performance libraries and applications in order to take advantage of all these new features.
Efficient 1D and 2D Daubechies Wavelet Transforms with Application to Signal Processing
Authors: Piotr Lipinski, Mykhaylo Yatsymirskyy
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper we have introduced new, efficient algorithms for computing one- and two-dimensional Daubechies wavelet transforms of any order, with application to signal processing. These algorithms has been constructed by transforming Daubechies wavelet filters into weighted sum of trivial filters. The theoretical computational complexity of the algorithms has been evaluated and compared to pyramidal and ladder ones. In order to prove the correctness of the theoretical estimation of computational complexity of the algorithms, sample implementations has been supplied. We have proved that the algorithms introduced here are the most robust of all class of Daubechies transforms in terms of computational complexity, especially in two dimensional case.
Correspondence Patterns for Ontology Alignment
Authors: François Scharffe, Dieter Fensel
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

We introduce in this paper correspondence patterns as templates to model ontology alignments. Correspondence patterns capture regularities recurring when aligning ontologies. They come in complement of ontology matching algorithms and graphical mapping tools, and facilitate the task of the engineer building the alignment between a pair of ontologies. We develop an ontology mediation framework based on three ontology correspondence abstraction levels. We particularly detail the most abstract level: correspondence patterns.
An Ada 2005 Technology for Distributed and Real-Time Component-Based Applications
Authors: Patricia López Martínez, José M. Drake, Pablo Pacheco, Julio L. Medina
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

The concept of interface in Ada 2005 significantly facilitates its usage as the basis for a software components technology. This technology, taking benefit of the resources that Ada offers for real-time systems development, would be suitable for component-based real-time applications that run on embedded platforms with limited resources. This paper proposes a model based technology for the implementation of distributed real-time component-based applications with Ada 2005. The proposed technology uses the specification of components and the framework defined in the LwCCM standard, modifying it with some key features that make the temporal behaviour of the applications executed on it, predictable, and analysable with schedulability analysis tools. Among these features, the dependency on CORBA is replaced by specialized communication components called connectors, the threads required by the components are created and managed by the environment, and interception mechanisms are placed to control their scheduling parameters in a per-transaction basis. This effort aims to lead to a new IDL to Ada mapping, a prospective standard of the OMG.
Hierarchical Matching Using Combinatorial Pyramid Framework
Authors: Luc Brun, Jean-Hugues Pruvot
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

A string matching approach is proposed to find a region correspondance between two images. Regions and their spatial relationships are represented by two combinatorial pyramids encoding two segmentation hierarchies. Our matching algorithm is decomposed in two steps: We first require that the features of the two matched regions be similar. This threshold on the similarity of the regions to be matched is used as a pruning step. We secondly require that at least one cut may be determined in each hierarchy such that the cyclic sequence of neighbors of the two matched regions have similar features. This distance is based on a cicular string matching algorithm which uses both the orientability of the plane and the hierarchical encoding of the two regions to reduce the computational cost of the matching and enforce its robustness.
Licence Plate Character Recognition Using Artificial Immune Technique
Authors: Rentian Huang, Hissam Tawfik, Atulya Nagar
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

This paper proposes the application of Artificial Immune Technique in Licence Plate Character Recognition (LPCR). The use of Clonal Selection Algorithm (CSA) is composed of two main stages: (1) dynamic training samples; and (2) a choice of the best antibodies based on the three main clonal operations of cloning, clonal mutation and clonal selection. Once memory cells are established it will output the classification results using Fuzzy K-Nearest Neighbor (KNN) approach. The performance of CSA is compared to the Back Propagation Neural Networks (BPNN) in solving a LPCR problem. The experimental results show that the Artificial Immune Technique has a favorable performance in terms of being more accurate and robust.
Evaluation of Lineal Relation between Shifted Delta Cepstral Features and Prosodic Features in Speaker Verification
Authors: José R. Calvo, Dayana Ribas, Rafael Fernández, Gabriel Hernández
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Abstract. This paper examines the linear relation between Shifted Delta Cepstral (SDC) features and the dynamic of prosodic features. SDC features were reported to produce superior performance to Δ features in Language Identification and Speaker Recognition. A selection of more correlated SDC features is used in speaker verification to evaluate its robustness to channel/handset mismatch. The experiment reflects superior performance of selected SDC features regarding to Δ features in speaker verification using speech samples from NIST 2001 Ahumada database.
Estimating the Relative Contributions of New Genes from Retrotransposition and Segmental Duplication Events during Mammalian Evolution
Authors: Jin Jun, Paul Ryvkin, Edward Hemphill, Ion Măndoiu, Craig Nelson
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

Gene duplication has long been recognized as a major force in genome evolution and has recently been recognized as an important source of individual variation. For many years the origin of functional gene duplicates was assumed to be whole or partial genome duplication events, but recently retrotransposition has also been shown to contribute new functional protein coding genes and siRNA's. Here we present a method for the identification and classification of retrotransposed and segmentally duplicated genes and pseudogenes based on local synteny. Using the results of this approach we compare the rates of segmental duplication and retrotransposition in five mammalian genomes and estimate the rate of new functional protein coding gene formation by each mechanism. We find that retrotransposition occurs at a much higher and temporally more variable rate than segmental duplication, and gives rise to many more duplicated sequences over time. While the chance that retrotransposed copies become functional is much lower than that of their segmentally duplicated counterparts, the higher rate of retrotransposition events leads to nearly equal contributions of new genes by each mechanism.
Strategic IT Alignment in Swedish Public Healthcare System
Authors: Lazar Rusu, Yu Huang, Ali Turab Rizvi
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Information and communication technology (ICT) is not only beneficial for the business sector but has a lot to offer for the public sector as well. In fact, the public sector can benefit the most by the advancement of ICT that it offers numerous potential benefits in terms of improvements for patients, health and elderly care professionals and decision makers. In this context this research paper has studied the healthcare sector in Stockholm and has analyzed if their IT strategy is aligned with the government strategy. During this analysis we have found a lot of models developed for the alignment of business and IT strategy but we haven't found any model for the alignment of IT with the government strategy. Therefore in the analysis we have done in this paper we have proposed an integrated model and used the Swedish healthcare system as a case study in order to see if their IT strategy is aligned with their government's strategy.
User requirements of mobile technology: A summary of research results
Authors: Judith Gebauer
Venue: Information-Knowledge-Systems Management (2008)

As advanced mobile technology becomes more widespread, the impacts on professional environments and on the personal lives of individual users continue to increase. Devices, such as smart cell phones, personal digital assistants (PDAs), and laptop computers can free their owners of the need to remain close to a wired information system infrastructure that is provided in a stationary office environment, and provide the opportunity to perform tasks in a wide variety of use contexts. With changes in use context, however, come changes in requirements, such as the need to limit weight and size of a device. In order to achieve success in the form of adoption, use, and positive impacts on user performance, a thorough understanding is needed about the functional and non-functional technology requirements of mobile professionals. In this paper, we summarize the results of a series of research studies that we conducted to explore the technology requirements of mobile professionals. The research studies included a content analysis of online user reviews, two empirical surveys, and a series of user interviews. Our research findings indicate that (1) user-perceived technology maturity is a critical factor to explain and predict the use of mobile technology by mobile professionals; (2) mobile technology needs to be available in a broad variety of use-situations; (3) users require basic communication and productivity-related functionality, in particular to support non-routine and supervisory task profiles; and (4) mobile technology can have considerable impacts on the job performance and on the personal lives of its users. Our findings have implications for the design, management, and research of mobile information systems.