ppxscal/embedding_network huggingface dataset:
On hierarchical routing in wireless sensor networks
Authors: Konrad Iwanicki, Maarten van Steen
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Hierarchical routing is a promising approach for point-to-point routing with very small routing state. While there are many theoretical analyses and high-level simulations demonstrating its benefits, there has been little work to evaluate it in a realistic wireless sensor network setting. Based on numerous proposed hierarchical routing infrastructures, we develop a framework that captures the common characteristics of the infrastructures and identifies design points where the infrastructures differ. We then evaluate the implementation of the framework in TOSSIM and on a 60-node testbed. We demonstrate that from the practical perspective hierarchical routing is also an appealing routing approach for sensor networks. Despite only logarithmic routing state, it can offer low routing stretch: the average of ∼1.25 and the 99-th percentile of 2. Moreover, a hierarchical routing infrastructure can be autonomously bootstrapped and maintained by the nodes. By exploring the design points within our framework, the hierarchy maintenance protocol can optimize different metrics, such as the latency of bootstrapping and repairing the hierarchy after failures or the traffic volume, depending on the application requirements. Finally, we also identify a number of practical issues which we believe the applications employing hierarchical routing should be aware of.
Colored Multiway Cuts in Generalized Tree Networks
Authors: Xin Xiao, Li Shuguang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Given a graph with color dependent edge weights and a partial coloration on some distinguished vertices, the colored multiway cut problem is to extend the partial coloration such that all the vertices are colored and the total weight of edges that have different colored endpoints is minimized. A polynomial time algorithm is presented that solves the problem exactly for generalized tree networks.
Total Restrained Domination in Cubic Graphs
Authors: Hongxing Jiang, Liying Kang, Erfang Shan
Venue: Graphs and Combinatorics (2009)

A set S of vertices in a graph G&#x00a0;=&#x00a0;(V, E) is a total restrained dominating set (TRDS) of G if every vertex of G is adjacent to a vertex in S and every vertex of V &#x2212;&#x00a0;S is adjacent to a vertex in V&#x00a0;&#x2212;&#x00a0;S. The total restrained domination number of G, denoted by &#x03b3; tr (G), is the minimum cardinality of a TRDS of G. Let G be a cubic graph of order n. In this paper we establish an upper bound on &#x03b3; tr (G). If adding the restriction that G is claw-free, then we show that &#x03b3; tr (G)&#x00a0;=&#x00a0;&#x03b3; t (G) where &#x03b3; t (G) is the total domination number of G, and thus some results on total domination in claw-free cubic graphs are valid for total restrained domination.
On the Integration of Neural Classifiers through Similarity Analysis of Higher Order Features
Authors: D. A. Karras, B. G. Mertzios
Venue: Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects (2009)

A novel methodology is herein outlined for combining the classification decisions of different neural network classifiers. Instead of the usual approach for applying voting schemes on the decisions of their output layer neurons, the proposed methodology integrates higher order features extracted by their upper hidden layer units. More specifically, different instances (cases) of each such classifier, derived from the same training process but with different training parameters, are investigated in terms of their higher order features, through similarity analysis, in order to find out repeated and stable higher order features. Then, all such higher order features are integrated through a second stage neural network classifier having as inputs suitable similarity features of them. The herein suggested hierarchical neural system for pattern recognition shows improved classification performance in a computer vision task. The validity of this novel combination approach has been investigated when the first stage neural classifiers involved correspond to different Feature Extraction Methodologies (FEM) for shape classification. The experimental study illustrates that such an approach, integrating higher order features through similarity analysis of a committee of the same classifier instances (cases) and a second stage neural classifier, outperforms other combination methods, like voting combination schemes as well as single neural network classifiers having as inputs all FEMs derived features. In addition, it outperforms hierarchical combination methods non performing integration of cases through similarity analysis.
Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky
Venue: ACL Workshops (2005)

This volume contains the papers prepared for and presented at the Frontiers in Corpus Annotation II: Pie in the Sky workshop held on June 29, 2005 at the University of Michigan, as part of the 2005 annual meeting of the Association of Computational Linguistics. This workshop is the second in a series of workshops about innovation in corpus annotation and its effect on the future of Computational Linguistics.
Learning to order BDD variables in verification
Authors: Orna Grumberg, Shlomi Livne, Shaul Markovitch
Venue: Journal of Artificial Intelligence Research (2003)

The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of finite-state systems is model checking. Most of the current model-checking systems use binary decision diagrams (BDDs) for the representation of the tested model and in the verification process of its properties. Generally, BDDs allow a canonical compact representation of a boolean function (given an order of its variables). The more compact the BDD is, the better performance one gets from the verifier. However, finding an optimal order for a BDD is an NP-complete problem. Therefore, several heuristic methods based on expert knowledge have been developed for variable ordering. We propose an alternative approach in which the variable ordering algorithm gains "ordering experience" from training models and uses the learned knowledge for finding good orders. Our methodology is based on offine learning of pair precedence classifiers from training models, that is, learning which variable pair permutation is more likely to lead to a good order. For each training model, a number of training sequences are evaluated. Every training model variable pair permutation is then tagged based on its performance on the evaluated orders. The tagged permutations are then passed through a feature extractor and are given as examples to a classifier creation algorithm. Given a model for which an order is requested, the ordering algorithm consults each precedence classifier and constructs a pair precedence table which is used to create the order. Our algorithm was integrated with SMV, which is one of the most widely used verification systems. Preliminary empirical evaluation of our methodology, using real benchmark models, shows performance that is better than random ordering and is competitive with existing algorithms that use expert knowledge. We believe that in sub-domains of models (alu, caches, etc.) our system will prove even more valuable. This is because it features the ability to learn sub-domain knowledge, something that no other ordering algorithm does.
Co-presence, collaboration, and control in environmental studies: A Second Life-based approach
Authors: Songpol Attasiriluk, Arturo Nakasone, Wisut Hantanong, Rui Prada, Pizzanu Kanongchaiyos, Helmut Prendinger
Venue: Virtual Reality (2009)

In this paper, we describe a framework for synchronous collaborative visualization and remote control in the agricultural domain. The framework builds on &#x201c;Second Life&#x201d; (SL), a popular networked online 3D virtual world, where users are represented as avatars (graphical self-representations). Co-presence in SL takes the form of instant (real-time) two-way interaction among two or more avatars. The aim of our work is to facilitate co-presence for sharing knowledge and exchanging wisdom about environmental practices. In order to establish a realistic simulated context for communication in SL, virtual counterparts of real devices are created in the virtual world. Specifically, we aim to represent field servers that sense and monitor fields such as rice paddies and vineyards. The Twin-World Mediator (TWM) is developed in order to replicate the behavior of real devices in virtual counterparts, and to facilitate seamless communication between real and virtual world. The TWM is an easy-to-use, extensible, and flexible communication framework. A small study demonstrated how the TWM can support collaboration and experience sharing in the agricultural domain.
Achieving Privacy in a Federated Identity Management System
Authors: Susan Landau, Hubert Gong, Robin Wilton
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

Federated identity management allows a user to efficiently authenticate and use identity information from data distributed across multiple domains. The sharing of data across domains blurs security boundaries and potentially creates privacy risks. We examine privacy risks and fundamental privacy protections of federated identity- management systems. The protections include minimal disclosure and providing PII only on a "need-to-know" basis. We then look at the Liberty Alliance system and analyze previous privacy critiques of that system. We show how law and policy provide privacy protections in federated identity-management systems, and that privacy threats are best handled using a combination of technology and law/policy tools.
On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
Authors: Jingui Xie, Qi-Ming He, Xiaobo Zhao
Venue: Queueing Systems: Theory and Applications (2009)

This paper deals with a multi-class priority queueing system with customer transfers that occur only from lower priority queues to higher priority queues. Conditions for the queueing system to be stable/unstable are obtained. An auxiliary queueing system is introduced, for which an explicit product-form solution is found for the stationary distribution of queue lengths. Sample path relationships between the queue lengths in the original queueing system and the auxiliary queueing system are obtained, which lead to bounds on the stationary distribution of the queue lengths in the original queueing system. Using matrix-analytic methods, it is shown that the tail asymptotics of the stationary distribution is exact geometric, if the queue with the highest priority is overloaded.
Location Privacy Techniques in Client-Server Architectures
Authors: Christian S. Jensen, Hua Lu, Man Lung Yiu
Venue: Privacy in Location-Based Applications: Research Issues and Emerging Trends (2009)

A typical location-based service returns nearby points of interest in response to a user location. As such services are becoming increasingly available and popular, location privacy emerges as an important issue. In a system that does not offer location privacy, users must disclose their exact locations in order to receive the desired services. We view location privacy as an enabling technology that may lead to increased use of location-based services.In this chapter, we consider location privacy techniques that work in traditional client-server architectures without any trusted components other than the client's mobile device. Such techniques have important advantages. First, they are relatively easy to implement because they do not rely on any trusted third-party components. Second, they have potential for wide application, as the client-server architecture remains dominant for web services. Third, their effectiveness is independent of the distribution of other users, unlike the k-anonymity approach.The chapter characterizes the privacy models assumed by existing techniques and categorizes these according to their approach. The techniques are then covered in turn according to their category. The first category of techniques enlarge the client's position into a region before it is sent to the server. Next, dummy-based techniques hide the user's true location among fake locations, called dummies. In progressive retrieval, candidate results are retrieved iteratively from the server, without disclosing the exact user location. Finally, transformation-based techniques employ cryptographic transformations so that the service provider is unable to decipher the exact user locations. We end by pointing out promising directions and open problems.
Discovering Reference Models by Mining Process Variants Using a Heuristic Approach
Authors: Chen Li, Manfred Reichert, Andreas Wombacher
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

Recently, a new generation of adaptive Process-Aware Information Systems (PAISs) has emerged, which enables structural process changes during runtime. Such flexibility, in turn, leads to a large number of process variants derived from the same model, but differing in structure. Generally, such variants are expensive to configure and maintain. This paper provides a heuristic search algorithm which fosters learning from past process changes by mining process variants. The algorithm discovers a reference model based on which the need for future process configuration and adaptation can be reduced. It additionally provides the flexibility to control the process evolution procedure, i.e., we can control to what degree the discovered reference model differs from the original one. As benefit, we cannot only control the effort for updating the reference model, but also gain the flexibility to perform only the most important adaptations of the current reference model. Our mining algorithm is implemented and evaluated by a simulation using more than 7000 process models. Simulation results indicate strong performance and scalability of our algorithm even when facing large-sized process models.
Cutter Database Management System Development on NetBeans 5.0 Platform
Authors: Yan Cao, Zhou Fang, Yanli Yang, Zhong Li
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In production process, a cutter management system should provide accurate, timely, and optimal information of cutters and their components. However, there are few cutter management and consultation systems based on B/S (Browser/Server) structure. In the paper, a cutter database management system is developed based on B/S architecture. The cutter database management system is mainly consisted of user information management, cutter query, technological document and borrowing status browsing, cutter information and borrowing status management, cutter type management, technological document management, cutter storage location management, user information browsing, system management, etc. The system is developed using NetBeans 5.0 and Microsoft Office Access 2003. JSP is mainly used to develop View level, Servlet is used to realize Controller level, and JavaBean is used to realize Model level. MVC frame realizes the separation between functional modules and display modules. At the same time, the maintainability, expandability, portability, and reusability of the system are improved. B/S architecture simplifies system maintenance and upgrade, and reduces development and maintenance costs.
A quantitative approach to preposition-pronoun contraction in Polish
Authors: Beata Trawiński
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

This paper presents the current results of an ongoing research project on corpus distribution of prepositions and pronouns within Polish preposition-pronoun contractions. The goal of the project is to provide a quantitative description of Polish preposition-pronoun contractions taking into consideration morphosyntactic properties of their components. It is expected that the results will provide a basis for a revision of the traditionally assumed inflectional paradigms of Polish pronouns and, thus, for a possible remodeling of these paradigms. The results of corpus-based investigations of the distribution of prepositions within preposition-pronoun contractions can be used for grammar-theoretical and lexicographic purposes.
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
Authors: Domenic Teuchert, Simon Hauger
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding of Internet Protocol (IP) packets requires to search the most specific entry in a forwarding table that contains up to several hundred thousand address prefixes. The Tree Bitmap algorithm provides a well-balanced solution in respect of storage needs as well as of search and update complexity. In this paper, we present a pipelined lookup module based on this algorithm, which allows for an easy adaption to diverse protocol and hardware constraints. We determined the pipelining degree required to achieve the throughput for a 100 Gbps router line card by analyzing a representative sub-unit for various configured sizes. The module supports IPv4 and IPv6 configurations providing this throughput, as we determined the performance of our design to achieve a processing rate of 178 million packets per second.
Automation of treebank annotation
Authors: Thorsten Brants, Wojciech Skut
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This paper describes applications of stochastic and symbolic NLP methods to treebank annotation. In particular we focus on (1) the automation of treebank annotation, (2) the comparison of conflicting annotations for the same sentence and (3) the automatic detection of inconsistencies. These techniques are currently employed for building a German treebank.
Performance Assessment of Swarm Robots
Authors: Ercan Oztemel, Cemalettin Kubat, Ozer Uygun, Tuba Canvar, Tulay Korkusuz, Vinesh Raja, Anthony Soroka
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Swarm intelligence is the emergent collective intelligence of groups of simple autonomous agents which are autonomous subsystems that interact with their environment. This paper presents a performance evaluation system for swarm robots. The model proposed includes a set of performance assessment criteria and performance assessment and monitoring system. The proposed approach is developed for swarm robots developed for health system responsible for delivery, guidance, monitoring, recognition, and delivery which a project in European 6th Framework Research Program and carried out by several European nations.
Controlling the Business Growth Speed from Financial Angle of View: Using Cash Flow System Dyanmics Model
Authors: Cai Yan-Song
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Every business wants to grow fast, but how fast can a business afford to grow? Organizational growth needs many factors' support, such as industry development, strategy and top management. Among all the determinants, abounded cash is indispensable. Maintaining a company's normal operation needs amount of cash, growing a company will need more. Cash is a key factor, which determines the business growth rate. This paper describes a System Dynamics model for capturing cash flow and business growth dynamics, and provides a method to control the speed of business growth. We find that system dynamics model is useful to integrate the cash flow with many factors affecting cash flow to produce a financial decision support system.
Journal-Ranking.com: an online interactive journal ranking system
Authors: Andrew Lim, Hong Ma, Qi Wen, Zhou Xu, Brenda Cheang, Bernard Tan, Wenbin Zhu
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

Journal-Ranking.com is perhaps the first online journal ranking system in the world which allows any individual to conduct citation analyses among more than 7000 academic journals with regards to his/her own interests. Besides classical statistics on citation quantity, the system also allows taking citation quality into consideration after extending on the well known PageRank method, which has been successfully applied to evaluate the impact of web pages by Google. Journal-Ranking.com was developed by Red Jasper Limited and the Hong Kong University of Science and Technology. The system underwent a soft launch in June 2006 and has been successfully deployed in 2007. The website has registered an average of a million hits per month since its offIcial launch. This paper explains the development and design of Journal-Ranking.com and its impacts to the global research community.
Installation and evaluation of RFID readers on moving vehicles
Authors: Eun-Kyu Lee, Young Min Yoo, Chan Gook Park, Minsoo Kim, Mario Gerla
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

Due to recent technology advancements, RFID readers have been proposed for several vehicular applications ranging from safe navigation to intelligent transport. However, one obstacle to deployment is the unpredictable read performance. An RFID reader occasionally fails to read an RFID tag even in static circumstances, mostly due to collisions. In a mobile vehicular environment, latency becomes the key performance factor because of the high speed of vehicles. This is particularly true when the RFID reader is on the moving vehicle. In this paper, we investigate RFID read latency and thus effectiveness of on-vehicles reader installations for a wide range of speeds. First, we experimentally study the impact of reader and tag relative positions on read errors and read rates. Then we conduct road experiments at varying speeds. The results reveal the critical factors that influence on-vehicle RFID read performance, and give us guidance to identify and pursue directions for improvement.
Making Pen-Based Operation More Seamless and Continuous
Authors: Chuanyi Liu, Xiangshi Ren
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

The feature of continuous interaction in pen-based system is critically significant. Seamless mode switch can effectively enhance the fluency of interaction. The interface which incorporated the advantages of seamless and continuous operation has the potential of enhancing the efficiency of operation and concentrating the users' attention. In this paper, we present a seamless and continuous operation paradigm based on pen's multiple-input parameters. A prototype which can support seamless and continuous (SC) operation is designed to compare the performance with MS Word 2007 system. The subjects were requested to select target components, activate the command menus and color the targets with a given flowchart in two systems respectively. The experiment results report the SC operation paradigm outperformed the standard ways in MS Word in both operation speed and cursor footprint length (CFL).