ppxscal/embedding_network huggingface dataset:
Using immersive virtual reality to evaluate pedestrian street crossing decisions at a roundabout
Authors: Haojie Wu, Daniel H. Ashmead, Bobby Bodenheimer
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

In this paper, we use an immersive virtual environment to assess the separation, or "gap," between moving vehicles that people need before initiating a street crossing in a roundabout, where traffic can be approaching from several directions. From a pedestrians viewpoint, crossing at a roundabout can represent a more complex decision than at a normal linear intersection. This paper presents the design of a system that simulates reasonable traffic patterns that a pedestrian might encounter in making a crossing decision at the exit lane of a roundabout, while controlling the gap duration in the stream of traffic. Using a maximum-likelihood procedure, we conducted a street crossing experiment in the virtual environment to evaluate the minimum gap during which pedestrians would initiate a successful crossing of the intersection. Our results are generally consistent with real-world data on pedestrian street crossings, and may provide insights into how to engineer the design of such roundabouts.
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
Authors: Binay Bhattacharya, Qiaosheng Shi, Arie Tamir
Venue: Algorithmica (2009)

Extensive facility location models in networks deal with the location of special types of subgraphs such as paths or trees and can be considered as extensions of classical facility location models. In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees, under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional discrete/continuous extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(nlog&#x2009;n) by Tamir et al. (J. Algebra 56:50&#x2013;75, [2005]).
A multifrontal QR factorization approach to distributed inference applied to multirobot localization and mapping
Authors: Frank Dellaert, Alexander Kipp, Peter Krauthausen
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

QR factorization is most often used as a "black box" algorithm, but is in fact an elegant computation on a factor graph. By computing a rooted clique tree on this graph, the computation can be parallelized across subtrees, which forms the basis of so-called multifrontal QR methods. By judiciously choosing the order in which variables are eliminated in the clique tree computation, we show that one straightforwardly obtains a method for performing inference in distributed sensor networks. One obvious application is distributed localization and mapping with a team of robots. We phrase the problem as inference on a large-scale Gaussian Markov Random Field induced by the measurement factor graph, and show how multifrontal QR on this graph solves for the global map and all the robot poses in a distributed fashion. The method is illustrated using both small and large-scale simulations, and validated in practice through actual robot experiments.
Tuning parallel applications in parallel
Authors: Ananta Tiwari, Vahid Tabatabaee, Jeffrey K. Hollingsworth
Venue: Parallel Computing (2009)

In this paper, we present and evaluate a parallel algorithm for parameter tuning of parallel applications. We discuss the impact of performance variability on the accuracy and efficiency of the optimization algorithm and propose a strategy to minimize the impact of this variability. We evaluate our algorithm within the Active Harmony system, an automated online/offline tuning framework. We study its performance on three benchmark codes: PSTSWM, HPL and POP. Compared to the Nelder-Mead algorithm, our algorithm finds better configurations up to seven times faster. For POP, we were able to improve the performance of a production sized run by 59%.
A multilingual analysis of the notion of instrumentality
Authors: Asanee Kawtrakul, Mukda Suktarachan, Bali Ranaivo-Malancon, Pek Kuan Ng, Achla Raina, Sudeshna Sarkar, Alda Mari, Sina Zarriess, Elixabete Murguia, Patrick Saint-Dizier
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

Instruments are expressed in language by various means: prepositions, postpositions, affixes including case marks, nonfinite verbs, etc. We consider here 12 languages from five families in order to be able to identify the different meaning components that structure instrumentality.
Discovering lexical information by tagging Arabic newspaper text
Authors: Saleem Abuleil, Martha Evens
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

In this paper we describe a system for building an Arabic lexicon automatically by tagging Arabic newspaper text. In this system we are using several techniques for tagging the words in the text and figuring out their types and their features. The major techniques that we are using are: finding phrases, analyzing the affixes of the words, and analyzing their patterns. Proper nouns are particularly difficult to identify in the Arabic language; we describe techniques for isolating them.
Scalable semantic retrieval through summarization and refinement
Authors: Julian Dolby, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Edith Schonberg, Kavitha Srinivas, Li Ma
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Query processing of OWL-DL ontologies is intractable in the worst case, but we present a novel technique that in practice allows for efficient querying of ontologies with large Aboxes in secondary storage. We focus on the processing of instance retrieval queries, i.e., queries that retrieve individuals in the Abox which are instances of a given concept C. Our technique Uses summarization and refinement to reduce instance retrieval to a small relevant subset of the original Abox. We demonstrate the effectiveness of this technique in Aboxes with up to 7 million assertions. Our results are applicable to the very expressive description logic SHIN, which corresponds to OWL-DL minus nominals and datatypes.
BSSGUI --- A Package for Interactive Control of Blind Source Separation Algorithms in MATLAB
Authors: Jakub Petkov, Zbyněk Koldovský
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

This paper introduces a Matlab graphical user interface (GUI) that provides an easy operation of several Blind Source Separation (BSS) algorithms together with adjustment of their parameters. BSSGUI enables working with input and output data, multiple signal plots, and saving of output variables to the base Matlab workspace or to a file. The Monte Carlo Analysis allows for the validation of particular features of BSS algorithms integrated into the package. The BSSGUI package is available for free at http://bssgui.wz.cz.
A Framework for Fairness Guaranteed Multi-streaming Transport Protocol
Authors: Wonhyuk Lee, Hyuncheol Kim, Doowon Seo, Jinwook Chung
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

High-speed service and bulk transmission were available by the development of the network, and communication technologies. Moreover, voice-oriented communication service is undergoing a change by various services including data and video services. This paper presents a revised, improved congestion control scheme such as SCTP-SCF that includes SCTP multi-streaming to solve performance problems at high speed and evaluates the method's performance. The performance of the proposed scheme is evaluated using an OPNET simulator. Proposed SCTP-SCF overcomes existing problems in the traditional SCTP when a multi-streaming feature is used.
Design and Implementation of Davis Social Links OSN Kernel
Authors: Thomas Tran, Kelcey Chan, Shaozhi Ye, Prantik Bhattacharyya, Ankush Garg, Xiaoming Lu, S. Felix Wu
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Social network popularity continues to rise as they broaden out to more users. Hidden away within these social networks is a valuable set of data that outlines everyone's relationships. Networks have created APIs such as the Facebook Development Platform and OpenSocial that allow developers to create applications that can leverage user information. However, at the current stage, the social network support for these new applications is fairly limited in its functionality. Most, if not all, of the existing internet applications such as email, BitTorrent, and Skype cannot benefit from the valuable social network among their own users. In this paper, we present an architecture that couples two different communication layers together: the end2end communication layer and the social context layer, under the Davis Social Links (DSL) project. Our proposed architecture attempts to preserve the original application semantics (i.e., we can use Thunderbird or Outlook, unmodified, to read our SMTP emails) and provides the communicating parties (email sender and receivers) a social context for control and management. For instance, the receiver can set trust policy rules based on the social context between the pair, to determine how a particular email in question should be prioritized for delivery to the SMTP layer. Furthermore, as our architecture includes two coupling layers, it is then possible, as an option, to shift some of the services from the original applications into the social context layer. In the context of email, for example, our architecture allows users to choose operations, such as reply, reply-all, and forward, to be realized in either the application layer or the social network layer. And, the realization of these operations under the social network layer offers powerful features unavailable in the original applications. To validate our coupling architecture, we have implemented a DSL kernel prototype as a Facebook application called CyrusDSL (currently about 40 local users) and a simple communication application combined into the DSL kernel but is unaware of Facebook's API.
Exploring the use of landmarks for mobile navigation support in natural environments
Authors: Caroline Snowdon, Christian Kray
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Landmarks are a key element in navigation and have been used extensively to provide navigation support to pedestrians through mobile devices in urban areas. Natural environments differ significantly from built environments in a number of ways including, for example, the degree of structure and regularity, the types and density of landmarks, and the way in which people navigate in those environments. In this paper, we investigate how people currently navigate 'in the wild', and whether landmark-based navigation support through mobile devices is a feasible option in such settings. We present results from two studies: a questionnaire-based study focussing on current practice and the use of landmarks, and a qualitative lab-based study using immersive panoramic photographs and photographs of (natural) landmarks investigating the feasibility of landmark-based navigation support in natural environments. The results indicate that a small number of means are currently used for navigation in the wild, and that certain types of landmarks might be feasible for navigation support on mobile devices. We also found initial evidence that immersive panoramic photographs may constitute a promising way to evaluate mobile applications.
Optimizing WebPage Interest
Authors: Willem Elbers, Theo Weide
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

In the rapidly evolving and growing environment of the internet, web site owners aim to maximize interest for their web site. In this article we propose a model, which combines the static structure of the internet with activity based data, to compute an interest based ranking. This ranking can be used to gain more insight into the flow of users over the internet, optimize the position of a web site and improve strategic decisions and investments. The model consists of a static centrality based component and a dynamic activity based component. The components are used to create a Markov Model in order to compute a ranking.
Agent-Based Driver Abnormality Estimation
Authors: Tony Poitschke, Florian Laquai, Gerhard Rigoll
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

For enhancing current driver assistance and information systems with regard to the capability to recognize an individual driver's needs, we conceive a system based on fuzzy logic and a multi-agent-framework. We investigate how it is possible to gain useful information about the driver from typical vehicle data and apply the knowledge on our system. In a pre-stage, the system learns the driver's regular steering manner with the help of fuzzy inference models. By comparing his regular and current manner, the system recognizes whether the driver is possibly impaired and betakes in a risky situation. Furthermore, the steering behavior and traffical situation are continuously observed for similar pattern. According to the obtained information, the system tries to conform its assistance functionalities to the driver's needs.
Reliability optimization of topology communication network design using an improved ant colony optimization
Authors: Kanyapat Watcharasitthiwat, Paramote Wardkein
Venue: Computers and Electrical Engineering (2009)

Network design problem is a well-known NP-hard problem which involves the selection of a subset of possible links or a network topology in order to minimize the network cost subjected to the reliability constraint. To overcome the problem, this paper proposes a new efficiency algorithm based on the conventional ant colony optimization (ACO) to solve the communication network design when considering both economics and reliability. The proposed method is called improved ant colony optimizations (IACO) which introduces two addition techniques in order to improve the search process, i.e. neighborhood search and re-initialization process. To show its efficiency, IACO is applied to test with three different topology network systems and its results are compared with those obtained results from the conventional approaches, i.e. genetic algorithm (GA), tabu search algorithm (TSA) and ACO. Simulation results, obtained these test problems with various constraints, shown that the proposed approach is superior to the conventional algorithms both solution quality and computational time.
Applying AOP and MDA to Middleware-Based Distributed Real-Time Embedded Systems Software Process
Authors: Liu Jingyong, Zhong Yong, Zhang Lichen, Chen Yong
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Aspect-Oriented Programming (AOP) and Model-driven Architecture (MDA) are very important as technologies to resolving lifecycle challenges of DRE systems, including requirements analysis, design, validation, development and testing. This paper provides two contributions to the study of DRE systems development. First, analyzes non-functional requirements of DRE systems. Second, proposes a new aspect-oriented middleware based DRE systems software process, and applies AOP and MDA technologies to the process. The characteristics of middleware are considered in the entire DRE systems software process from requirements analyze phase to testing phase.
From parametric polymorphism to models of polymorphic fpc
Authors: Rasmus ejlers MØgelberg
Venue: Mathematical Structures in Computer Science (2009)

This paper shows how PILLY (Polymorphic Intuitionistic/Linear Lambda calculus with a fixed point combinator Y) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin's encodings of recursive types in PILLY, we show how parametric models of PILLY give rise to models of FPC, which is a simply typed lambda calculus with recursive types and an operational call-by-value semantics, reflecting a classical result from domain theory. Essentially, this interpretation is an interpretation of intuitionistic logic into linear logic first discovered by Girard, which in this paper is extended to deal with recursive types. Of particular interest is a model based on ‘admissible’ pers over a reflexive domain, the theory of which can be seen as a domain theory for (impredicative) polymorphism. We show how this model gives rise to a parametric and computationally adequate model of PolyFPC, an extension of FPC with impredicative polymorphism. This is to the author's knowledge the first denotational model of a non-linear language with parametric polymorphism and recursive types.
Event Detection Based on Hierarchical Event Fusion
Authors: Xiaoling Xiao, Xiang Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

This paper proposes a method for event detection based on hierarchical event fusion. Four high-level events in intelligent meeting scenarios, namely, “monologue”,“presentation”, “discussion”, and “break”, are analyzed. To characterize these four events by hierarchical event fusion and inference, four kinds of group events are considered. Group events are analyzed based on three kinds of basic states of individual participants, such as location, standing or sitting, and speaking or silence. Rao-Blackwellized particle filters are applied to make event inference in real time. The experimental results indicate that this approach is effective in detecting high-levelevent.
UMTS Networks and Beyond
Authors: Cornelia Kappler
Venue:  (2009)

An all-encompassing coverage on UMTS Networks including an in-depth discussion of current work on UMTS evolution and 4G . UMTS Networks and Beyond offers a comprehensive introduction to the networking aspects of UMTS and the networks coming after UMTS. The book is unique in that it systematically compares how a particular problem, e.g. obtaining connectivity, is solved in UMTS and how the same problem is solved in a Computer Network such as the Internet. It also highlights why the respective solutions are so different. The first part of the book provides a detailed technical discussion of UMTS, including original vision, architecture, protocol stacks and overall functionality. It places UMTS in the context of its evolution of from GSM and its convergence with Computer Networks. The second part of the book discusses todays vision of 4G, and introduces upcoming networking technologies. Emphasis is on LTE / SAE as successor of UMTS; UMB, WiMAX and NGN are also discussed. The book gives an overview of what these technologies are likely to offer, of their architectures, protocols and functionality. It also discusses their differences and similarities, and whether they will qualify as 4G. Key Features: Provides readers, particularly those with a background in IP-based networks, with a technical understanding of what UMTS does, how it works and how it is likely to evolve Explains the differences in design between UMTS Networks and Computer Networks and discusses how these design divergences can be reconciled in the future Shows how economic considerations shape the design of UMTS Motivates why particular design choices are made in UMTS Gives an in-depth introduction to LTE / SAE Provides a detailed picture of the state of the art in 4G Illustrates the theory with numerous tables and figures This comprehensive textbook is essential reading for advanced students and lecturers in communications systems and networking. It is also of interest to engineers and researchers in the field of UMTS and communications systems. 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
Crypto Engineering: Some History and Some Case Studies
Authors: Christof Paar
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

In this extended abstract, I will first try to describe briefly the developments in the cryptographic engineering community over the last decade. After this, some hopefully instructive case studies about cryptographic implementations in the real world will be given.
Service Parts Inventory Pooling Based on Periodic Review Model
Authors: Dai Yong
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Service parts logistics is an important field in logistics management, especially on inventory pooling. The paper does a research on models of inventory pooling determination based on (R,S) strategy, According to the expected total cost during the review period, whether to use lateral transshipment or not at each checkpoint is decided and the minimal cost under certain service level is achieved.
Optimization Way of Engineering Equipment Maintenance Based on Process Algebra
Authors: Xiaonan Zhang, Anxin Liu, Jun Yan, Bin Liu, Hongliang Liu, Qingzheng Gao
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

This paper presents a method of engineering equipment process optimization based on process algebra from the from the decision analysis perspective. In the new method, maintenance process described process algebra formula is presented and analyzed; then, the process evaluation criterions are made; finally, the method is proved to be effective in a practical example.
An Information Fashion Algorithm Based on Extremal Optimization
Authors: XiaoGang Fu, Jinshou Yu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

A hybrid Information Fashion Algorithm (IFA) based on Extremal Optimization (EOIFA) with adaptive levy mutation was proposed in this paper. It applied the idea of combination mechanism of global and local search. In the process of the global search, IFA is an evolutionary algorithm based on the simulation of simplified social models and the swarming theory that can quickly approach a approximate optimal solution. During the local search, as a powerful local search capabilities algorithm EO with adaptive lévy mutation helps IFA out of local optimal points. Simulation study and its application have proved its capability of strong global search andhigh immunity against premature convergence. Then EOIFA is applied to optimize PID controllerparameters . The obtained results indicate that the new method proposed by this paper is feasible and effective.