ppxscal/embedding_network huggingface dataset:
Efficient optimization of information-theoretic exploration in SLAM
Authors: Thomas Kollar, Nicholas Roy
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization problem of computing a trajectory to minimize posterior map error, subject to the constraints of traveling through a set of sensing locations to ensure map coverage. This trajectory is found by reducing the map to a skeleton graph and searching for a minimum entropy tour through the graph. We describe how a specific factorization of the map covariance allows the re-use of EKF updates during the optimization, giving an efficient gradient ascent search for the maximum information gain tour through sensing locations, where each tour naturally incorporates revisiting well-known map regions. By generating incrementally larger tours as the exploration finds new regions of the environment, we demonstrate that our approach can perform autonomous exploration with improved accuracy.
Labeling the r-path with a condition at distance two
Authors: John P. Georges, David W. Mauro, Yan Wang
Venue: Discrete Applied Mathematics (2009)

For integer r>=2, the infinite r-path P"~(r) is the graph on vertices ...v"-"3,v"-"2,v"-"1,v"0,v"1,v"2,v"3... such that v"s is adjacent to v"t if and only if |s-t|@?r-1. The r-path on n vertices is the subgraph of P"~(r) induced by vertices v"0,v"1,v"2,...,v"n"-"1. For non-negative reals x"1 and x"2, a @l"x"""1","x"""2-labeling of a simple graph G is an assignment of non-negative reals to the vertices of G such that adjacent vertices receive reals that differ by at least x"1, vertices at distance two receive reals that differ by at least x"2, and the absolute difference between the largest and smallest assigned reals is minimized. With @l"x"""1","x"""2(G) denoting that minimum difference, we derive @l"x"""1","x"""2(P"n(r)) for r>=3, 1@?n@?~, and x"1x"2@?[2,~]. For x"1x"2@?[1,2], we obtain upper bounds on @l"x"""1","x"""2(P"~(r)) and use them to give @l"x"""1","x"""2(P"~(r)) for r>=5 and x"1x"2@?[1,2r-22r-3]@?[43,2]. We also determine @l"x"""1","x"""2(P"~(3)) and @l"x"""1","x"""2(P"~(4)) for all x"1x"2@?[1,2].
Software Dependability Analysis Methodology
Authors: Beoungil Cho, Hyunsang Youn, Eunseok Lee
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Dependability can be verified at the integration phase of the software development life cycle. However the dependability verification processes that inspect software dependability in the late period of development have an effect in the development cost (e.g. time, human resources). Therefore, it is a very important issue to verify any nonfunctional requirements in the early stages of the development process. In this paper, we propose a software dependability analysis methodology of distributed component based software by using HQPNs (Hierarchically Combined Queuing Petri Nets) modeling. We prove the validity of the proposed methodology by applying it to a video conference system development.
Coupling a linguistic formalism and a script language
Authors: Claude Roux
Venue: Proceedings of the Third Workshop on Constraints and Language Processing (2006)

This article presents a novel syntactic parser architecture, in which a linguistic formalism can be enriched with all sorts of constraints, included extra-linguistic ones, thanks to the seamless coupling of the formalism with a programming language.
Thinking Outside the (Search) Box
Authors: Susan Dumais
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Search is the main entry point for an ever-increasing range of information, services, communications and entertainment. During the last decade, there have been tremendous advances in the scale of search systems and the diversity of available resources. Yet the methods used to represent searchers' information needs have changed very little. Search interfaces today look much the same as they did a decade ago. Searchers type a few words into a search box, and the search engine returns a long list of results. When the results fail to satisfy the searcher's information needs, they try again and again with little support from the search engine. In this talk I describe several efforts to improve easy and effectiveness of search by: modeling searchers' interests and activities over time, representing non-content attributes of information such as time or genre, and developing interaction techniques that enable searchers to articulate their information needs more effectively.
Pro SQL Server 2008 Administration
Authors: Ken Simmons, Sylvester Carstarphen
Venue:  (2009)

Pro SQL Server 2008 Administration is critical for database administrators seeking in-depth knowledge on administering SQL Server 2008. This book covers the impact of the new features available in SQL Server 2008 specifically targeted for database administrators, along with the tried-and-true advanced techniques required to support and maintain Microsoft SQL Server. Introduces new administration features of SQL Server 2008 Shows how to manage a SQL Server 2008 database at professional level Provides guidance on performance optimization What you'll learn Take advantage of the new administrative features in SQL Server 2008 Make intelligent decisions when choosing an installation or upgrade path Define and implement database policies to create a consistent, predictable environment throughout the organization Automate repetitive Tasks for increased productivity Create baseline monitors using Performance Monitor, Profiler, and System Dynamic Management views Identify and resolve long-running, I/O, and CPU-intensive queries Who is this book for? This book is for junior and seasoned database administrators who are looking to develop their knowledge and skill set in Microsoft SQL Server 2008. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
A Comparison of Block-Based and Clip-Based Cooperative Caching Techniques for Streaming Media in Wireless Home Networks
Authors: Shahram Ghandeharizadeh, Shahin Shayandeh
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Wireless home networks are widely deployed due to their low cost, ease of installation, and plug-and-play capabilities with consumer electronic devices. Participating devices may cache continuous media (audio and video clips) in order to reduce the demand for outside-the-home network resources and enhance the average delay incurred from when a user references a clip to the onset of its display (startup latency). In this paper, we focus on a home network consisting of a handful of devices configured with a mass storage device to cache data. A cooperative caching technique may manage the available cache space at the granularity of either a clip or individual blocks of a clip. The primary contribution of this paper is to evaluate these two alternatives using realistic specifications of a wireless home network, identifying factors that enable one to outperform the other.
ESP: a logic of only-knowing, noisy sensing and acting
Authors: Alfredo Gabaldon, Gerhard Lakemeyer
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

When reasoning about actions and sensors in realistic domains, the ability to cope with uncertainty often plays an essential role. Among the approaches dealing with uncertainty, the one by Bacchus, Halpern and Levesque, which uses the situation calculus, is perhaps the most expressive. However, there are still some open issues. For example, it remains unclear what an agent's knowledge base would actually look like. The formalism also requires second-order logic to represent uncertain beliefs, yet a first-order representation clearly seems preferable. In this paper we show how these issues can be addressed by incorporating noisy sensors and actions into an existing logic of only-knowing.
Video with Adobe Flash CS4 Professional Studio Techniques, 1st edition
Authors: Robert Reinhardt
Venue:  (2009)

The definitive guide to creating video for the WebIn Video with Adobe Flash CS4 Professional Studio Techniques, Robert Reinhardt goes beyond the entry-level coverage found in other books to bring you a comprehensive look at what you really need to know to produce, host, and distribute Flash-compatible video on the Web, including FLV and AVC/H.264 content. Real world examples and hands-on projects with sample video files provide the expert training you need with tips and insights that everyone can benefit from.Youll learn:Basic methods, from preproduction through delivery, includingcapturing, processing, and compressing your video.Production essentials for sharing your footage on the Web, including setting up your Web page and server for seamless video playback and how to create your own video player.Advanced techniques, including building an index and play list, adding captions and banner ads, and designing a comprehensive video experiencefor your audience.The DVD-ROM includes complete sample Flash files as shown throughout the book. More than 2 GB of source files are provided, including High Definition (HD) clips, which you can use to perfect your video compression skills. The source files for each chapter are found in the corresponding Lessons folder on the disc.Robert Reinhardt is a highly respected authority on Flash and Flash video. He has authored or co-authored numerous books on Flash, including the Flash Bible and the Flash ActionScript Bible, and his blog and other online articles draw a wide audience. He has developed multimedia courses for educational facilities in Canada and the United States and is an Adobe Certified Instructor for Flash courses at Portland State University. He is a former Vice President of the Multimedia Platforms Group at Schematic and now works with a wide range of clients from his base in Portland, Oregon. A frequent presenter at conferences such as Flashforward, FITC, Flashbelt, and NAB, he is also a contributor at DesignProVideo.com. Forums and updates for this book can be found at FlashSupport.com, where you can share questions and answers with Robert and other readers. 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
Model-Driven Dependability Analysis of Virtualization Systems
Authors: Xu Zhang, Chuang Lin, Xiangzhen Kong
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

After many years of silence, virtualization recently became a hot topic once again, especially in the field of system dependability. Current researches mostly focus on more technical methods without taking into account the problem of how to verify the dependability of these technics. This paper proposes a Markov model to describe virtualization systems and gives the solving methods to quantitatively analyze their dependabilities including reliability, availability and maintainability. Through the numeric results, we get the relationship between the specific dependability evaluating attributes of virtualization systems and the characteristics of virtualization systems’ components. Then evolve some conditions which should be satisfied by the virtualization for enhancing system dependability, including the number of backup virtual machines, the failure and repair rate of hypervisor and so on.
Towards System Integrity Protection with Graph-Based Policy Analysis
Authors: Wenjuan Xu, Xinwen Zhang, Gail-Joon Ahn
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

Identifying and protecting the trusted computing base (TCB) of a system is an important task, which is typically performed by designing and enforcing a system security policy and verifying whether an existing policy satisfies security objectives. To efficiently support these, an intuitive and cognitive policy analysis mechanism is desired for policy designers or security administrators due to the high complexity of policy configurations in contemporary systems. In this paper, we present a graph-based policy analysis methodology to identify TCBs with the consideration of different system applications and services. Through identifying information flows violating the integrity protection of TCBs, we also propose resolving principles to using our developed graph-based policy analysis tool.
A merged RF CMOS LNA-Mixer design using geometric programming
Authors: Sergio Chaparro, Armando Ayala Pabón, Elkim Roa, Wilhelmus Van Noije
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

This paper presents the design using geometric programming of a merged CMOS LNA-Mixer cell, intended for bluetooth application at 2.45GHz. A rigorous noise formulation taking into account on chip inductors non-idealities and parameters from inductor measurement results is provided. Design considerations to achieve geometric programming suitable expressions for noise, gain, and input matching, among others, are presented. As a result, the designed LNA-Mixer cell exhibits a single side band noise figure of 9.64dB, with a voltage gain of 21.5dB, input reflection co-efficient S11 of -28.7dB, in addition to a PIIP3=-2.06dBm. The circuit area is 0.93mm2 and consumes 8.67mW at 3.3V power supply in a 0.35&mu;m CMOS process.
Improving the Cost Structure of Sensemaking Tasks: Analysing User Concepts to Inform Information System Design
Authors: Simon Attfield, Ann Blandford
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

In many everyday contexts people interact with information systems in order to make sense of a domain of interest. However, what this means and how it can best be supported are poorly understood. In particular, there has been little research on how to develop system representations that simplify naturally occurring sense making processes by matching people's conceptualizations of the domain. In this paper we draw on Klein et al.'s data-frame theory and Russell at al's notion of cost-structures in sensemaking to propose an approach to understanding sensemaking that supports reasoning about system requirements. The two key elements of the approach are the identification of the process and the transformational steps within that process that could benefit from support to reduce costs, and the identification of primary concepts which are cued by information in the context of a given sensemaking task and domain, and around which users integrate information to form a structured understanding. Our general principle is that by understanding a sensemaking transformation in terms of its source data and the integrating structures it creates, one is better able to anticipate the evolving information needs that it tends to invoke. We test this approach with a case study of fraud investigation performed by a team of lawyers and forensic accountants and consider how to support the elaboration of prototypical user-frames once they have been invoked.
Lighting as Support for Enhancing Well-Being, Health and Mental Fitness of an Ageing Population - The FP6 EU Funded ALADIN Project
Authors: Inge Gavat, Ovidiu Grigore, Marius Cotescu, Markus Canazei, Hermann Atz, Klaus Becker, Lajos Izso, Guido Kempter, Herbert Plischke, Wilfried Pohl
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

The paper presents the ALADIN prototype for adaptive lighting control designed to assist elderly in achieving a state of well-being, developed as a FP6 EU funded project. It uses psycho-physiological features extracted from Electro-Dermal Activity (EDA) and Pulse signals to determine the subject's mental state and adapts the lighting parameters in order to achieve a certain desired state. One of the controller implementations was done using Simulated Annealing. Field test evaluations of this implementation are discussed.
Indexing by permeability in block structured web pages
Authors: Emmanuel Bruno, Nicolas Faessel, Hervé Glotin, Jacques Le Maitre, Michel Scholl
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

We present in this paper a model that we have developed for indexing and querying web pages based on their visual rendering. In this model pages are split up into a set of visual blocks. The indexing of a block takes into account its content, its visual importance and, by permeability, the indexing of neighbors blocks. A page is modeled as a directed acyclic graph. Each node is associated with a block and labeled by the coefficient of importance of this block. Each edge is labeled by the coefficient of permeability of the target node content to the source node content. Importance and permeability coefficients cannot be manually quantified. the second part of this paper, we present an experiment consisting in learning optimal permeability coefficients by gradient descent for indexing images of a web page from the text blocks of this page. The dataset is drawn from real web pages of the train and test set of the ImagEval task2 corpus. Results demonstrate an improvement of the indexing using non uniform block permeabilities.
Energy-Aware Scheduling of Flow Applications on Master-Worker Platforms
Authors: Jean-François Pineau, Yves Robert, Frédéric Vivien
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

We consider the problem of scheduling an application composed of independent tasks on a fully heterogeneous master-worker platform with communication costs. We introduce a bi-criteria approach aiming at maximizing the throughput of the application while minimizing the energy consumed by participating resources. Assuming arbitrary super-linear power consumption laws, we investigate different models for energy consumption, with and without start-up overheads. Building upon closed-form expressions for the uniprocessor case, we derive optimal or asymptotically optimal solutions for both models.
Automatic induction of FrameNet lexical units
Authors: Marco Pennacchiotti, Diego De Cao, Roberto Basili, Danilo Croce, Michael Roth
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Most attempts to integrate FrameNet in NLP systems have so far failed because of its limited coverage. In this paper, we investigate the applicability of distributional and WordNet-based models on the task of lexical unit induction, i.e. the expansion of FrameNet with new lexical units. Experimental results show that our distributional and WordNet-based models achieve good level of accuracy and coverage, especially when combined.
User's Motion for Shape Perception Using CyARM
Authors: Ryo Mizuno, Kiyohide Ito, Tetsuo Ono, Junichi Akita, Takanori Komatsu, Makoto Okamoto
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

We have developed a new sensing device, named by "CyARM". CyARM is one of Active Perception device, based on activeness of human perception. In order to clarify information for shape perception using CyARM, an experiment had conducted. Results of this experiment show that shapes with sharp edges are identified easily, but shapes with smooth edges are identified with greater difficulty. In other words, the subjects perceived changes in distance from the sensor to the object as object edges. Furthermore, from the results of multi-dimensional scaling, it is suggested that object shapes perceived by the subjects were classified according to the sharpness of the edge and by the ratio of height and width. In addition, motion analyses were conducted. The result shows, it is suggested that user tend to swing arm to front arm mainly in motion of lateral direction.
Investigating the characteristics of causal relations in Japanese text
Authors: Takashi Inui, Manabu Okumura
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

We investigated of the characteristics of in-text causal relations. We designed causal relation tags. With our designed tag set, three annotators annotated 750 Japanese newspaper articles. Then, using the annotated corpus, we investigated the causal relation instances from some viewpoints. Our quantitative study shows that what amount of causal relation instances are present, where these relation instances are present, and which types of linguistic expressions are used for expressing these relation instances in text.
Search strategies for shape regularized active contour
Authors: Tianli Yu, Jiebo Luo, Narendra Ahuja
Venue: Computer Vision and Image Understanding (2009)

Nonlinear shape models have been shown to improve the robustness and flexibility of contour-based object segmentation when there are appearance ambiguities between the object and the background. In this paper, we focus on a new search strategy for the shape regularized active contour (ShRAC) model, which adopts existing nonlinear shape models to segment objects that are similar to a set of training shapes. The search for optimal contour is performed by a coarse-to-fine algorithm that iterates between combinatorial search and gradient-based local optimization. First, multi-solution dynamic programming (MSDP) is used to generate initial candidates by minimizing only the image energy. In the second step, a combination of image energy and shape energy is minimized starting from these initial candidates using a local optimization method and the best one is selected. To generate diverse initial candidates while reducing invalid shapes, we apply two pruning methods to the search space of MSDP. Our search strategy combines the advantages of global combinatorial search and local optimization, and has shown excellent robustness to local minima caused by distracting suboptimal solutions. Experimental results on segmentation of different anatomical structures using ShRAC, as well as preliminary results on human silhouette segmentation are provided.