ppxscal/embedding_network huggingface dataset:
Decentralized Communication-Aware Motion Planning in Mobile Networks: An Information-Gain Approach
Authors: Yasamin Mostofi
Venue: Journal of Intelligent and Robotic Systems (2009)

In this paper we consider decentralized motion-planning in mobile cooperative networks in the presence of realistic stochastic communication links, including path-loss, fading and shadowing effects. We propose a communication-aware motion-planning strategy, where each node considers the information gained through both its sensing and communication when deciding on its next move. More specifically, we show how each node can predict the information gained through its communications, by online learning of link quality measures such as received Signal to Noise Ratio (SNR) and correlation characteristics, and combine it with the information gained through its sensing in order to build objective functions for motion planning. We show that in the presence of path loss, our proposed strategy can improve the performance drastically. We furthermore show that while uncorrelated low-SNR fading channels can ruin the overall performance, the natural randomization of uncorrelated channels can potentially help the nodes leave deep fade spots with small movements. We finally show that highly correlated deep fades, on the other hand, can degrade the performance drastically for a long period of time. We then propose a randomizing motion-planning strategy that can help the nodes leave highly correlated deep fades.
Parallel Computing
Authors: M. R. Bhujade
Venue:  (2009)

KEY FEATURES:-Presents complete theoretical treatment of the relevant topics in architectural principles and synchronous parallel systems. -The material presented in this book has evolved from the parallel computing and advanced computer architecture courses taught by the author. -A one semester advanced course for graduates or senior graduates can be planned using the materials of the book. ABOUT THE BOOK: The book Parallel Computing deals with the topics of current interest in high performance computing, viz. pipeline and parallel processing architectures, and the whole book is based on treatment of these ideas. The present revised edition is updated with the addition of topics like processor performance and technology developments in chapter 1 and advanced pipeline processing on today's high performance processors in chapter 2. A new chapter on neurocomputing and two new sections on Branch prediction and scoreboard are the other major changes done to make the book more viable. ABOUT THE AUTHOR(S): Moreshwar R Bhujade, Ph.D., is a professor in the Department of Computer Science and Engineering, Indian Institute of Technology, Mumbai, India. He has published a number of articles on various topics in computer architecture, fault diagnosis, programming languages, software testing, distributed file systems, high performance computing and computational geometry. Dr. Bhujade is a member of the Editorial Board of International Journal of High Performance Systems Architecture. 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
Lightweight comparison of RNAs based on exact sequence–structure matches
Authors: Steffen Heyne, Sebastian Will, Michael Beckstette, Rolf Backofen
Venue: Bioinformatics (2009)

Motivation: Specific functions of ribonucleic acid (RNA) molecules are often associated with different motifs in the RNA structure. The key feature that forms such an RNA motif is the combination of sequence and structure properties. In this article, we introduce a new RNA sequence–structure comparison method which maintains exact matching substructures. Existing common substructures are treated as whole unit while variability is allowed between such structural motifs. Based on a fast detectable set of overlapping and crossing substructure matches for two nested RNA secondary structures, our method ExpaRNA (exact pattern of alignment of RNA) computes the longest collinear sequence of substructures common to two RNAs in O(H·nm) time and O(nm) space, where H < n·m for real RNA structures. Applied to different RNAs, our method correctly identifies sequence–structure similarities between two RNAs. Results: We have compared ExpaRNA with two other alignment methods that work with given RNA structures, namely RNAforester and RNA_align. The results are in good agreement, but can be obtained in a fraction of running time, in particular for larger RNAs. We have also used ExpaRNA to speed up state-of-the-art Sankoff-style alignment tools like LocARNA, and observe a tradeoff between quality and speed. However, we get a speedup of 4.25 even in the highest quality setting, where the quality of the produced alignment is comparable to that of LocARNA alone. Availability: The presented algorithm is implemented in the program ExpaRNA, which is available from our website ( http://www.bioinf.uni-freiburg.de/Software). Contact: {exparna@informatik.uni-freiburg.de,backofen@informatik.uni-freiburg.de} Supplementary information:Supplementary data are available at Bioinformatics online.
Measuring E-Democracy Opportunities: A Global Perspective
Authors: Farid Shirazi
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

In recent years, several case studies have emerged illustrating the impact of Information and Communication Technologies (ICTs) and in particular the expansion of the Internet and mobile cell phones on socio-political activities. This paper investigates 146 economies and the relationship between the global expansion of ICTs and the current degree of democracy within each nation by constructing an index of e-democracy opportunities among them, for the period of 1995 to 2005. The key findings in this study are (a) a notable progress in e-democracy opportunity on the global stage; (b) the fact that in some countries there is a rapid ICT expansion and global success in e-democracy, and yet, there is a growing digital divide between the most and least developed e-democratic nations.
A Framework for Remote User Evaluation of Accessibility and Usability of Websites
Authors: Christopher Power, Helen Petrie, Richard Mitchell
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The inclusion of participants that are representative of the diverse populations of users is essential for meaningful and useful evaluations of usability and accessibility on the web. This paper proposes the requirements and architecture for an automated tool suite to help manage the design and deployment of evaluations to these participants. A prototype implementation of this architecture that is being prepared is also discussed.
Human-robot collaboration for remote surveillance
Authors: Evan A. Sultanik, Ilya Braude, Peter Thai, Robert N. Lass, Duc N. Nguyen, Joseph B. Kopena, William C. Regli, Sean A. Lisse, Steven N. Furtwangler, Alan J. Vayda
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

The demonstration presents an application of multiagent systems and wireless networking to remote robot-based surveillance.
Synthesis of Water Allocation Network in Process Industries
Authors: Jianren Zhou, Zhaojie Cui
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

For many water-intensive process industries, process integration approaches can reduce both freshwater consumption and effluent generation by water reuse/recycle. Based on Source/Sink representation, this paper presents a mathematical programming model for the synthesis of water allocation network (WAN) to achieve the minimum water targets. Discharged water from each unit as well as the fresh feed is considered as water sources, whereas units that accept water are considered as sinks. The method combines water-using processes with water treatment operations into a single network. Embedding all the network configurations of source-sink matches, the model is formulated as a linear programming (LP) with flow rate and concentration constraints, which is then optimized by using commercial software Lingo v.9. Finally, a case study of a paper mill is implemented to show the effectiveness of the model. An 18% reduction of freshwater usage and optimal WAN are obtained.
User-Centered Design Meets Feature-Driven Development: An Integrating Approach for Developing the Web Application myPIM
Authors: Torsten Krohn, Martin Christof Kindsmüller, Michael Herczeg
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

In this paper we show how a user-centered design (UCD) method can be successfully combined with an agile software development approach, namely feature-driven development (FDD), to develop the web-based information management system myPIM. This system supports users' workflow requirements in research and teaching/learning contexts. It provides bookmark, file, and reference archives, as well as possibilities for exchanging information with colleagues and students. By describing the system and its development process we show how this combination of methodologies supported our development process to create a service that truly assists the target audience and is easy to use.
A simple prediction method for composite rectangular microcantilevers with equal width and the dimensional optimization
Authors: Kai Yang, Zhigang Li, Yupeng Jing, Dapeng Chen, Tianchun Ye
Venue: Microelectronics Journal (2009)

Resonant frequency is a key parameter in designing a resonant transducer with high sensitivity. Eigen-frequency calculation of a composite-layer microcantilever is quite useful for the design of a microcantilever resonant sensor. However, simple methods for predicting the resonant frequency of composite rectangular microcantilevers are poorly developed and invite further research. This paper presents a simple and accurate analytical method called ''equivalent model method'' to predict the fundamental resonant frequency of composite rectangular microcantilevers with equal width (CRMEW). This novel method, which is much more convenient for practical applications, is then confirmed by both experimental results and simulation results, and presents a strong potential to be used in the design and optimization of micromachined transducers.
Harmonic Filters for Generic Feature Detection in 3D
Authors: Marco Reisert, Hans Burkhardt
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

This paper proposes a concept for SE(3)-equivariant non-linear filters for multiple purposes, especially in the context of feature and object detection. The idea of the approach is to compute local descriptors as projections onto a local harmonic basis. These descriptors are mapped in a non-linear way onto new local harmonic representations, which then contribute to the filter output in a linear way. This approach may be interpreted as a kind of voting procedure in the spirit of the generalized Hough transform, where the local harmonic representations are interpreted as a voting function. On the other hand, the filter has similarities with classical low-level feature detectors (like corner/blob/line detectors), just extended to the generic feature/object detection problem. The proposed approach fills the gap between low-level feature detectors and high-level object detection systems based on the generalized Hough transform. We will apply the proposed filter to a feature detection task on confocal microscopical images of airborne pollen and compare the results to a 3D-extension of a popular GHT-based approach and to a classification per voxel solution.
PSPIKE: A Parallel Hybrid Sparse Linear System Solver
Authors: Murat Manguoglu, Ahmed H. Sameh, Olaf Schenk
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, we present a new parallel solver that combines the desirable characteristics of direct methods (robustness) and effective iterative solvers (low computational cost), while alleviating their drawbacks (memory requirements, lack of robustness). Our proposed hybrid solver is based on the general sparse solver PARDISO, and the "Spike" family of hybrid solvers. The resulting algorithm, called PSPIKE, is as robust as direct solvers, more reliable than classical preconditioned Krylov subspace methods, and much more scalable than direct sparse solvers. We support our performance and parallel scalability claims using detailed experimental studies and comparison with direct solvers, as well as classical preconditioned Krylov methods.
Design of Embedded System API Function for PMAC
Authors: Miao Xingang, Wang Su, Cai Lingling, Yan Zheng, Chen Jiang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Programmable Multi-Axis Controller (PMAC) is widely used in robot control system,most of them use industrial PC (IPC) as the host computer, but this cannot meet the request in some welding robot, which need economical、miniaturization and infinite variety. In this paper, PMAC+embedded system is designed in welding robot control system. The hardware of embedded system is based on SAMSUNG ARM S3C2410 which haveabundant peripheral interface . The embedded operating system is µC/OS-II which is Real-Time Kernel and can be transplanted to ARM easily. In order for communication between S3C2410 and PMAC, some API functions are designed, and an example is shown how to use this API.
P2P Incentive Mechanism for File Sharing and Cooperation
Authors: Junghwa Shin, Taehoon Kim, Sungwoo Tak
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

P2P (Peer-to-Peer) network allows peers to distribute and obtain a file to be shared cooperatively. However, some peers only download files without cooperation. Peers also share low quality files or unpopular files. These selfish behavior of peers is referred to "free riding". The free riding of peer may decrease the participation of other peers or the system performance. In this paper, we propose an incentive mechanism, called P2PIncentive, which provides the correct use of incentive mechanism by using trust peers, computes contribution values referring behavior of peers and rewards peers. The proposed mechanism assigns bandwidth and TTL (Time-To-Live) to a peer according to the contribution and differentiates the use of service. A case study on simulations shows the service differentiation according to the behavior of peers, the correct use of incentive mechanism and the advantages by use of trust peers. To prove the stability of proposed mechanism, we also show the disadvantage that a peer receives from the incorrect use of incentive mechanism.
Identifying graphs from noisy and incomplete data
Authors: Galileo Mark S. Namata,  Jr., Lise Getoor
Venue: Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data (2009)

There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biological networks. At the same time, there is a growing interest in analyzing these networks, in order to uncover general laws that govern their structure and evolution, and patterns and predictive models to develop better policies and practices. However, a fundamental challenge in dealing with this newly available observational data describing networks is that the data is often of dubious quality -- it is noisy and incomplete -- and before any analysis method can be applied, the data must be cleaned, and missing information inferred. In this paper, we introduce the notion of graph identification, which explicitly models the inference of a "cleaned" output network from a noisy input graph. It is this output network that is appropriate for further analysis. We present an illustrative example and use the example to explore the types of inferences involved in graph identification, as well as the challenges and issues involved in combining those inferences. We then present a simple, general approach to combining the inferences in graph identification and experimentally show the utility of our combined approach and how the performance of graph identification is sensitive to the inter-dependencies among these inferences.
The HOL-Omega Logic
Authors: Peter V. Homeier
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding kinds to the existing levels of types and terms. New types include type operator variables and universal types as in System F. Impredicativity is avoided through the stratification of types by ranks according to the depth of universal types. The new system, called HOL-Omega or HOL ¿ , is a merging of HOL4, HOL2P[11], and major aspects of System F ¿ from chapter 30 of [10]. This document presents the abstract syntax and semantics for the kinds, types, and terms of the logic, as well as the new fundamental axioms and rules of inference. As the new logic is constructed according to the design principles of the LCF approach, the soundness of the entire system depends critically and solely on the soundness of this core.
Brief paper: Stability analysis for discrete-time switched time-delay systems
Authors: Wen-An Zhang, Li Yu
Venue: Automatica (Journal of IFAC) (2009)

The stability analysis problem is studied in this paper for a class of discrete-time switched time-delay systems. By using a newly constructed Lyapunov functional and the average dwell time scheme, a delay-dependent sufficient condition is derived for the considered system to be exponentially stable. The obtained results provide a solution to one of the basic problems in discrete-time switched time-delay systems, that is, to find a switching signal for which the switched time-delay system is exponentially stable. Two illustrative examples are given to demonstrate the effectiveness of the proposed results.
Model and Algorithm of Dual Symmetrical Neural Networks and Its Application in Information Fusion
Authors: Jiasong Cheng, Jiren Xu, Tongli Lian, Xingshen Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

General neural networks always converge to local optimal position when solving global optimal problem but dual symmetrical neural networks can overcome this shortcoming . The model and algorithms that dual symmetrical neural networks is used to solve direction finding(DF) and frequency measurement are presented in this paper, dual symmetrical neural networks can solve global optimal problem while general neural networks is used to solve global optimal problem always do not succeed because it always converge to local optimal position. Result of software simulation demonstrates this methods is viable.
Grasping Interface with Photo Sensor for a Musical Instrument
Authors: Tomoyuki Yamaguchi, Shuji Hashimoto
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

This paper introduces a luminance intensity interface driven by grasping forces, and its application as a musical instrument. In traditional musical instruments, the relationship between the action and the generated sound is determined by the physical structures of the instruments. Moreover, the freedom of the musical performances is limited by the structures. We developed a ball-shaped interface with handheld size. A photo diode is embedded in the translucent rubber ball to reacts to the grasping force of the performer. The grasping force is detected as the luminance intensity. The performer can use the ball interface only by grasping directly but also by holding to the environmental light or shading it by hands. The output of the interface is fed to the sound generator and the relationship between the performer's action and the generated sound is determined by the instrumental program to make the universal musical instrument.
A Stochastic Approach to Predict Performance of Web Service Composition
Authors: Yuxiang Dong, Yunni Xia, Qingsheng Zhu, Yu Huang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In this paper, we propose an analytical approach to predict the performance of web service composition built on BPEL. The approach first translates web service composition specification into Stochastic Petri Nets. From the SPN model and its corresponding continuous-time Markov chain, we derive the analytical performance estimates of process-completion-time. In the case study, we also use computer simulation techniques to validate our analytical model. The paper concludes with a comparison with related work.
Advances in the CMU/InterACT Arabic GALE transcription system
Authors: Mohamed Noamany, Thomas Schaaf, Tanja Schultz
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

This paper describes the CMU/InterACT effort in developing an Arabic Automatic Speech Recognition (ASR) system for broadcast news and conversations within the GALE 2006 evaluation. Through the span of 9 month in preparation for this evaluation we improved our system by 40% relative compared to our legacy system. These improvements have been achieved by various steps, such as developing a vowelized system, combining this system with a non-vowelized one, harvesting transcripts of TV shows from the web for slightly supervised training of acoustic models, as well as language model adaptation, and finally fine-tuning the overall ASR system.
The Visualization and Animation of Algorithmically Generated 3D Models Using Open Source Software
Authors: Nick Rowe
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

Investigations into creating 3D models using the open source application Blender and its accompanying scripting language Python are documented. Firstly, the principles of how virtual models are stored are explained leading to their creation using mathematical algorithms. A plane is considered and a method for automated face generation outlined. Iterative midpoint displacement methods are then discussed and fractal surfaces produced. Methods for mapping the plane to different coordinate systems are described with particular emphasis on the spherical coordinate system. IFS algorithms are explored and fractal examples visualized. Techniques for animating models are considered. Lastly, L systems are investigated and 3D models generated. It is shown that Blender is well able to visualize these models within limits and Python provides an effective method to create a uniform library of algorithms.