ppxscal/embedding_network huggingface dataset:
On the feasibility of the link abstraction in wireless mesh networks
Authors: Bhaskaran Raman, Kameswari Chebrolu, Dattatraya Gokhale, Sayandeep Sen
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Outdoor community mesh networks based on IEEE 802.11 have seen tremendous growth in the recent past. The current understanding is that wireless link performance in these settings is inherently unpredictable, due to multipath delay spread. Consequently, researchers have focused on developing intelligent routing techniques to achieve the best possible performance. In this paper, we are specifically interested in mesh networks in rural locations. We first present detailed measurements to show that the PHY layer in these settings is indeed stable and predictable. There is a strong correlation between the error rate and the received signal strength. We show that interference, and not multipath fading, is the primary cause of unpredictable performance. This is in sharp contrast with current widespread knowledge from prior studies. Furthermore, we corroborate our view with a fresh analysis of data presented in these prior studies. While our initial measurements focus on 802.11b, we then use two different PHY technologies as well, operating in the 2.4-GHz ISM band: 802.11g and 802.15.4. These show similar results too. Based on our results, we argue that outdoor rural mesh networks can indeed be built with the link abstraction being valid. This has several design implications, including at the MAC and routing layers, and opens up a fresh perspective on a wide range of technical issues in this domain.
Efficient Identification of Duplicate Bibliographical References
Authors: Vinícius Veloso de Melo, Alneu de Andrade Lopes
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

In this work we present an approach to extract and to structure bibliographical references from BibTex files, allowing the identification of the duplicate ones, which can appear slightly different in different files. To deal with this problem, existing systems use classifiers, clustering or others algorithms, allied with an Edit Distance metric, to distinguish between duplicate and nonduplicate records. The main challenge is to identify the duplicate records in database where the volume of the references can reach millions, in an efficient computational time. The technique proposed constructs a key (string) with information from each reference and stores them in a metric data structure called Slim-Tree. The Slim-Tree structure allows the minimization of the comparisons between references (being close to O(n log (n))), considering only the most similar keys to a given one.
An efficient node selection metric for in-network process deployment
Authors: Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

In-network processing is a powerful technique for reducing network traffic in an ad hoc network where network efficiency is a critical issue. When an in-network process collects data from multiple data sources, the node hosting the in-network process should be carefully selected to reduce network traffic. Existing metrics used to select the host node are unsatisfactory in this case, because they do not consider differences in the amount of data provided by each data source. In this paper, we propose a node selection metric called COLOR to solve this problem. COLOR value is derived from locations of data sources and the amount of data provided by them so that a data source that provides more data than the others has a stronger effect. Moreover, the communication overheads associated with COLOR are small, because parameters involved by COLOR can be collected during a data retrieval phase, which generally occurs in in-network processing. Simulation results show that data retrieval using COLOR produces less network traffic than that retrieved using existing metrics in environments where placements of data sources and the amount of data are nonuniform.
Electronic and Physical Market Channels: A Multiyear Investigation in a Market for Products of Uncertain Quality
Authors: Eric Overby, Sandy Jap
Venue: Management Science (2009)

Many markets that have traditionally relied on collocation of buyers, sellers, and products have introduced electronic channels. Although these electronic channels may provide benefits to buyers and sellers by lowering the transaction costs of participating in the market, there are trade-offs related to quality uncertainty and increased risk that may limit the adoption of the electronic channels. As a result, buyers and sellers use physical channels for some transactions and electronic channels for others. These usage patterns may evolve over time, particularly when the electronic channels are new. We examine buyer and seller use of electronic and physical channels in a market for products of uncertain quality (used vehicles) over a 2.5-year period. Results indicate that transactions involving low quality uncertainty and relatively rare products occurred in the electronic channels, whereas transactions involving high quality uncertainty and relatively plentiful products occurred in the physical channels. These patterns became clearer over time as buyers and sellers gained experience with the electronic channels. The electronic channels led to discounts for products of high quality uncertainty, but not for those of low quality uncertainty.
Towards Power Efficient MAC Protocol for In-Body and On-Body Sensor Networks
Authors: Sana Ullah, Xizhi An, Kyung Sup Kwak
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

This paper presents an empirical discussion on the design and implementation of a power-efficient Medium Access Control (MAC) protocol for in-body and on-body sensor networks. We analyze the performance of a beacon-enabled IEEE 802.15.4, PB-TDMA, and S-MAC protocols for on-body sensor networks. We further present a Traffic Based Wakeup Mechanism that utilizes the traffic patterns of the BAN Nodes (BNs) to accommodate the entire BSN traffic. To enable a logical connection between different BNs working on different frequency bands, a method called Bridging function is proposed. The Bridging function integrates all BNs working on different bands into a complete BSN.
Another viewpoint on "evaluating web software reliability based on workload and failure data extracted from server logs"
Authors: Toan Huynh, James Miller
Venue: Empirical Software Engineering (2009)

An approach of determining a website's reliability is evaluated in this paper. This technique extracts workload measures and error codes from the server's data logs. This information is then used to calculate the reliability for a particular website. This study follows on from a previous study, and hence, can be regarded as a "partial replication" (technically, as both studies are case studies not formal experiments, this description is inaccurate. Unfortunately, no corresponding definition exists for case studies, and hence the term is used to convey a general sense of purpose) of the original study. Although the method proposed by the original study is feasible, the effectiveness of just using a specific error type and a specific workload to estimate the reliability of websites is questionable. In this study, different error types and their usefulness for reliability analysis are examined and discussed. After a thorough investigation, we believe that reliability analysis for websites must be based on more specific error definitions as they can provide a superior reliability estimate for today's highly dynamic websites.
Performance evaluation with different mobility models for dynamic probabilistic flooding in MANETs
Authors: Abdalla M. Hanashi, Irfan Awan, Mike Woodward
Venue: Mobile Information Systems (2009)

Broadcasting is an essential and effective data propagation mechanism, with several of important applications such as route discovery, address resolution, as well as many other network services. As data broadcasting has many advantages, also causing a lot of contention, collision, and congestion, which induces what is known as "broadcast storm problems". Broadcasting has traditionally been based on the flooding protocol, which simply overflows the network with high number of rebroadcast messages until the messages reach to all network nodes. A good probabilistic broadcasting protocol can achieve higher saved rebroadcast, low collisions and less number of relays. In this paper, we propose a dynamic probabilistic approach that dynamically fine-tunes the rebroadcasting probability according to the number of neighbour's nodes distributed in the ad hoc network for routing request packets (RREQs). The performance of the proposed approach is investigated and compared with the simple AODVand fixed probabilistic schemes using the GloMoSim network simulator under different mobility models. The performance results reveal that the improved approach is able to achieve higher saved rebroadcast and low collision as well as low number of relays than the fixed probabilistic scheme and simple AODV.
MIMUS: a multimodal and multilingual dialogue system for the home domain
Authors: J. Gabriel Amores, Guillermo Pérez, Pilar Manchón
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

This paper describes MIMUS, a multimodal and multilingual dialogue system for the in--home scenario, which allows users to control some home devices by voice and/or clicks. Its design relies on Wizard of Oz experiments and is targeted at disabled users. MIMUS follows the Information State Update approach to dialogue management, and supports English, German and Spanish, with the possibility of changing language on--the--fly. MIMUS includes a gestures--enabled talking head which endows the system with a human--like personality.
Ontology-based Support of Knowledge Evaluation in Higher Education
Authors: Andrea Kő, András Gábor, Réka Vas, Ildikó Szabó
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

This paper demonstrates research activities regarding ontology-based knowledge evaluation in Higher Education. Conceptualization initiatives for educational domain are currently a hot topic and at the same time a challenge. In the paper we demonstrate an adaptive knowledge testing and evaluation system supported by the educational ontology, which helps the students to explore missing knowledge areas and guide them to the material which has to be further studied. The system is the outcome of fourteen higher institutes in Hungary, so we have gathered several experiences during the system test (which was organized and performed by the participating higher institutes and their students), which we highlight in the article. Current phase of the research concentrated to the curricula of the Business Informatics program, as a test environment. We outline our further improvement and refinement also.
Developing drawing and visual thinking strategies to enhance computer programming for people with dyslexia
Authors: Peter Coppin
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Text based programming languages are difficult for dyslexics and many so-called learning disabled (LD) people to use [14]. However, weaknesses in mentally processing text-based prose associated with dyslexia and certain forms of LD often coincide with strong visual-spatial abilities [13, 12]. An informal participatory design inspired study revealed that a self-identified LD introductory programmer used hand-drawn spatial thinking techniques as a cognitive interface to a text-based programming interface. Using this and other clues as a starting point, my project seeks to continue this research through a more formal study by using experiences from a visually oriented LD student designer to develop a visual thinking and translation process that might enable the student and others to “draw their way” between their own (possibly spatial) runnable mental models and text-based programming environments. 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
Practical type inference for first-class polymorphism
Authors: Stephanie Weirich
Venue:  (2008)

Type inference is a key component of modern statically typed programming languages. It allows programmers to omit many&mdash;and in some cases all&mdash;type annotations from programs. Type inference becomes particularly interesting theoretically and from an implementation standpoint in the presence of polymorphism. Hindley-Damas-Milner type inference, underlying modern functional programming languages with let-bound polymorphism, allows for full type reconstruction for programs with types that (i) only contain top-level quantifiers, and (ii) can only be instantiated with quantifier-free types. As soon as one attempts to overcome these barriers to allow higher-rank or impredicative polymorphism full type reconstruction becomes either undecidable or non-modular because many typeable programs no longer possess principal types. The only hope then for modular and decidable type inference for first-class polymorphism arises from exploiting type annotations to guide the type checker in a mixture of type reconstruction and type checking.The first contribution of this dissertation is a formal study of various theoretical properties of annotation-guided inference for predicative higher-rank types. The second contribution is the presentation of a type system and inference algorithm that lift both Damas-Milner restrictions, allowing impredicative higher-rank types.A central claim of this dissertation is that annotation-guided type inference for first-class polymorphism is compatible with intuitive specifications that do not have to be more complicated than the familiar Damas-Milner type system.
From Bayesian Decision-Makers to Bayesian Agents
Authors: Václav Šmídl, Jan Přikryl
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

Bayesian approach to decision making is successfully applied in control theory for design of control strategy. However, it is based on on the assumption that a decision-maker is the only active part of the system. Relaxation of this assumption would allow us to build a framework for design of control strategy in multi-agent systems. In Bayesian framework, all information is represented by probability density functions. Therefore, communication and negotiation of Bayesian agents also needs to be facilitated by probabilities. Recent advances in Bayesian theory make formalization these tasks possible. In this paper, we bring the existing theoretic results together and show their relevance for multi-agent systems. The proposed approach is illustrated on the problem of feedback control of an urban traffic network.
Activity Recognition from Sparsely Labeled Data Using Multi-Instance Learning
Authors: Maja Stikic, Bernt Schiele
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

Activity recognition has attracted increasing attention in recent years due to its potential to enable a number of compelling context-aware applications. As most approaches rely on supervised learning methods, obtaining substantial amounts of labeled data is often an important bottle-neck for these approaches. In this paper, we present and explore a novel method for activity recognition from sparsely labeled data. The method is based on multi-instance learning allowing to significantly reduce the required level of supervision. In particular we propose several novel extensions of multi-instance learning to support different annotation strategies. The validity of the approach is demonstrated on two public datasets for three different labeling scenarios.
Revised associate-level curricular guidelines in computer science
Authors: Elizabeth K. Hawthorne, Karl J. Klee, Robert D. Campbell, Anita M. Wright
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This poster presentation features revised associate-level transfer curriculum guidelines in computer science that were recently updated by the Two-Year College Education Committee (TYCEC). These guidelines will be available online in a Web 2.0 format. As a standing committee of the ACM Education Board, the TYCEC has been for two decades developing curricular guidelines for associate-degree computing programs worldwide.
Virtual organization management eServices
Authors: Jiří Hodík, Jiří Vokřínek, Stefan Bollhalter, Bruno Landau
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This demonstration concentrates on eServices (supporting electronic services) for Virtual Organization (VO) management support. The eServices are provided by the VOM toolkit (a suite of VO management tools), which was developed to support the VO manager in managing the VO throughout its life-cycle. In this demo the eServices related to all phases of the VO life-cycle are demonstrated together with the toolkit and benefits identified during pilot testing.
Momentum Based Optimization Methods for Level Set Segmentation
Authors: Gunnar Läthén, Thord Andersson, Reiner Lenz, Magnus Borga
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived terms. The solution of the segmentation problem is the contour which extremizes this functional. The standard way of solving this optimization problem is by gradient descent search in the solution space, which typically suffers from many unwanted local optima and poor convergence. Classically, these problems have been circumvented by modifying the energy functional. In contrast, the focus of this paper is on alternative methods for optimization. Inspired by ideas from the machine learning community, we propose segmentation based on gradient descent with momentum. Our results show that typical models hampered by local optima solutions can be further improved by this approach. We illustrate the performance improvements using the level set framework.
Anomaly detection using manifold embedding and its applications in transportation corridors
Authors: Amrudin Agovic, Arindam Banerjee, Auroop Ganguly, Vladimir Protopopescu
Venue: Intelligent Data Analysis (2009)

The formation of secure transportation corridors, where cargoes and shipments from points of entry can be dispatched safely to highly sensitive and secure locations, is a high national priority. One of the key tasks of the program is the detection of anomalous cargo based on sensor readings in truck weigh stations. Due to the high variability, dimensionality, and/or noise content of sensor data in transportation corridors, appropriate feature representation is crucial to the success of anomaly detection methods in this domain. In this paper, we empirically investigate the usefulness of manifold embedding methods for feature representation in anomaly detection problems in the domain of transportation corridors. We focus on both linear methods, such as multi-dimensional scaling (MDS), as well as nonlinear methods, such as locally linear embedding (LLE) and isometric feature mapping (ISOMAP). Our study indicates that such embedding methods provide a natural mechanism for keeping anomalous points away from the dense/normal regions in the embedding of the data. We illustrate the efficacy of manifold embedding methods for anomaly detection through experiments on simulated data as well as real truck data from weigh stations.
Managing design and test challenges
Venue: IEEE Design Test (2009)

Risks are notably increasing in the design of complex SoCs at the 65-nm technology node and beyond. Escalating design costs, increasing profitability and time-to-market pressures, and skyrocketing power consumption&#x2014;in conjunction with a lower first-silicon success rate, and lower chip manufacturability and reliability&#x2014;are among the key challenges that chip makers are confronting. To minimize the risks in the face of these challenges requires skillful management of the design process, which has become a core competency of leading chip makers. This issue of Design &#x0026; Test features a special issue on the management of emerging SoC development. The special issue consists of four articles, contributed by experienced design managers from leading semiconductor companies. In addition, four general-interest articles address diverse design and test issues.
Using context to improve semantic interoperability
Authors: Patrick Hoffmann, Lionel Médini, Parisa Ghodous
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

This paper presents an approach to enhance interoperability between heterogeneous ontologies. It consists in adapting the ranking of concepts to the final users and their work context. The computations are based on an upper domain ontology, a task hierarchy and a user profile. As prerequisites, OWL ontologies have to be given, and an articulation ontology has to be built.
A FEM-BEM approach for electro-magnetostatics and time-harmonic eddy-current problems
Authors: Ana Alonso Rodríguez, Alberto Valli
Venue: Applied Numerical Mathematics (2009)

In this paper we propose a method for solving the electro-magnetostatics problem and the eddy current problem in terms of suitable potentials. A new variational formulation is devised, in which standard results of potential theory are used to reduce the problem in the external domain to an integral equation on the boundary of a computational domain containing the conductor. The existence and uniqueness of the solution is proved, by showing that the associated sesquilinear form is coercive. A numerical approximation scheme, based on nodal finite elements in the computational domain and boundary elements on its boundary, is devised and proved to be convergent. It is also shown that the solution of the time-harmonic eddy current problem tends to the solution of the electro-magnetostatics problem as the frequency tends to 0. The same convergence holds, uniformly with respect to the mesh size, for the finite element solutions.
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem
Authors: Donatas Elvikis, Horst W. Hamacher, Marcel T. Kalsch
Venue: Journal of Scheduling (2009)

While in classical scheduling theory the locations of machines are assumed to be fixed we will show how to tackle location and scheduling problems simultaneously. Obviously, this integrated approach enhances the modeling power of scheduling for various real-life problems. In this paper, we introduce in an exemplary way theory and three polynomial solution algorithms for the planar ScheLoc makespan problem, which includes a specific type of a scheduling and a rather general, planar location problem, respectively. Finally, a report on numerical tests as well as a generalization of this specific ScheLoc problem is presented.