ppxscal/embedding_network huggingface dataset:
R* search
Authors: Maxim Likhachev, Anthony Stentz
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Optimal heuristic searches such as A* search are widely used for planning but can rarely scale to large complex problems. The suboptimal versions of heuristic searches such as weighted A* search can often scale to much larger planning problems by trading off the quality of the solution for efficiency. They do so by relying more on the ability of the heuristic function to guide them well towards the goal. For complex planning problems, however, the heuristic function may often guide the search into a large local minimum and make the search examine most of the states in the minimum before proceeding. In this paper, we propose a novel heuristic search, called R* search, which depends much less on the quality of the heuristic function. The search avoids local minima by solving the whole planning problem with a series of short-range and easy-to-solve searches, each guided by the heuristic function towards a randomly chosen goal. In addition, R* scales much better in terms of memory because it can discard a search state-space after each of its searches. On the theoretical side, we derive probabilistic guarantees on the sub-optimality of the solution returned by R*. On the experimental side, we show that R* can scale to large complex problems.
Richard Leifer on Radical Innovation
Venue: Ubiquity (2001)

A group of six faculty members of Rensselaer Polytechnic Institute's Lally School of Management and Technology began work on something they called the Radical Innovation Research Project in 1994, focused on finding out how game-changing innovation occurs in established, mature organizations. The results of the project are reported in a new book from Harvard Business School Press entitled "Radical Innovation: How Mature Companies Can Outsmart Upstarts" and written by the six faculty members: Richard Leifer, Christopher M. McDermott, Gina Colarelli O'Connor, Lois S. Peters, Mark P. Rice, and Robert W. Veryzer. To find out more about the project, we talked with Richard Leifer, who has been at RPI since 1983 and whose academic specialties include organizational behavior, high-performance management, and leadership. 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
A Multiple-Level 3D-LEGO Game in Augmented Reality for Improving Spatial Ability
Authors: Trien V. Do, Jong-Weon Lee
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Inspired by the real LEGO game, an Augmented Reality 3D LEGO game is introduced. With multiple levels, the game provides a tool to improve spatial ability for a wide range of ages. Through the game, users can practice many spatial skills such as analyzing a 3D model's structure, figuring out what to do to make a primitive geometry become a component of a 3D model, assembling components to create a complex model. The users mainly use their hands controlling physical makers to play the game. A user study was also carried out to evaluate the game and to compare it with the real LEGO game. The game is believed to be a useful and interesting tool to enhance not only human's spatial ability but also human's creation in 3D reconstruction.
Back Propagation Neural Network for Short-term Electricity Load Forecasting with Weather Features
Authors: Yong Wang, Dawu Gu, Jianping Xu, Jing Li
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In this paper, we expand previous work and present an accurate electricity load forecasting algorithm with back propagation neural networks. It contributes to short-term electricity load forecast methodology with neural network with weather feature such as max centigrade, min centigrade and weather types. The original electricity load is from shanghai district, which is composed of original every 5 minutes load records. Through the data transform the every hour data average 12 original records and weather feature become double value. After training and simulation, the prediction errors fit for the application needs. The algorithm besides other algorithms has been used in electricity load forecasting software. Many results confirm that the proposed method is capable of forecasting load efficiently.
Transient-based identification of wireless sensor nodes
Authors: Boris Danev, Srdjan Capkun
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Identification of wireless sensor nodes based on the characteristics of their radio transmissions can provide an additional layer of security in all-wireless multi-hop sensor networks. Reliable identification can be means for the detection and/or prevention of wormhole, Sybil and replication attacks, and can complement cryptographic message authentication protocols. In this paper, we investigate the feasibility of transient-based identification of CC2420 wireless sensor nodes. We propose a new technique for transient-based identification and show that it enables reliable and accurate sensor node recognition with an Equal Error Rate as low as 0.0024 (0.24%). We investigate the performance of our technique in terms of parameters such as distance, antenna polarization and voltage and analyze how these parameters affect the recognition accuracy. Finally, we study the feasibility of certain types of impersonation attacks on the proposed technique.
Specifying and Verifying PLC Systems with TLA+
Authors: Hehua Zhang, Stephan Merz, Ming Gu
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

We report on a method for formally specifying and verifying programmable logic controllers (PLCs) in the specification language TLA+. Our specification is generic in that it separates the description of the environment from that of the controller itself and that its structure is consistent with the scan cycle mechanism used by PLCs. Specifications can be parameterized with the number of replicated components. In our experience, the structuring mechanisms of TLA+ help to obtain clear, well-organized, and configurable specifications, finite instances of which are verified by the TLA+ model checker TLC. We have validated our approach on a concrete case study, a controller for fire fighting equipment in a ship dock, and report on the results obtained for this case study.
Stochastic Analysis of Hierarchical Publish/Subscribe Systems
Authors: Gero Mühl, Arnd Schröter, Helge Parzyjegla, Samuel Kounev, Jan Richling
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations of existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.
A Distributed Render Farm System for Animation Production
Authors: Jiali Yao, Zhigeng Pan, Hongxin Zhang
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

Render farm is widely used in movie industry to solve the long rendering time problem. By parallel computing rendering jobs, render farm can speedup the rendering process in a scalable way. In this paper, we present an efficient design of render farm system name DRFarm in distributed environment. The most important feature of the system is the capacity aware task scheduling strategy. We first introduce the hierarchy tasks subdivision method which ensures flexible merging and dividing tasks. By carefully grouping tasks and dynamically assign them in different modes, the overall parallel rendering time can be reduced by exploiting coherence comparing to conventional methods. Furthermore, to adopt various rendering jobs from different locations, we design a general rendering service interface with unified job definition.
Topics in digital terrain modeling
Authors: Judy Cushing, Nikolas Stevenson-Molnar, Richard Weiss, Lee Zeman, Robert R. Lewis, Genevieve Orr, David A. Wolff
Venue: Journal of Computing Sciences in Colleges (2009)

Digital terrain modeling is an important area of study in computer graphics due to its growing use in scientific visualization and gaming. It encompasses the processing and storage of data, the analysis and extraction of information, and the visualization and integration of multiple information domains (elevation, geographic, symbolic). The primary challenges stem from the enormous size of the data sets and the growing desire for faster and more realistic real-time interactive applications. As a result, much work has focused on the development of algorithms and techniques to improve efficiency and speed. This workshop offers an introduction to digital terrain modeling. It includes descriptions of several of the important algorithms and techniques for processing and visualizing terrain data. It also presents examples of applications. Many application domains use DTMs, aka digital elevation models (DEMs). The applications presented here will focus on ecology, where several of us have some experience. With Geographical Information Systems ecologists can easily view the distribution of certain phenomena spatially --- in 2D --- on "flatland". However, many ecological phenomena vary considerably with topography --- elevation and orientation. As a result, ecologists are very interested in overlaying their 2D spatial data onto digital elevation maps to see what the "poor neglected z" adds to their understanding of the ecology.
A Business Intelligence Methodology for E-government Reverse Auctions
Authors: Rafael Souza, Adriano Pereira
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

In the first quarter of year 2008, electronic reverseauctions (e-RAs) allowed the Brazilian Government tosave up to US$ 270 million, which account for 87% ofits acquisitions in the period, against 1% in the sameperiod 6 years earlier – according to the Ministry ofPlanning, Budget and Management. A tool of suchimportance is subjected to fraud or even anomalousbehaviors, which are difficult to detect with simpleanalysis over the current system. In this paper we lookforward into identifying suspicious behaviors in egovernmentprocurement systems, through the use ofbusiness intelligence techniques. The results confirmthat our methodology can help discovering interestingaspects that can be used to help market players indecision support and auctioneer’s management.
User Evaluation of a Graphical Modeling Tool for IMS Learning Design
Authors: Susanne Neumann, Petra Oberhuemer
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

IMS Learning Design is said to be highly technical language that is hard to understand and apply by teaching practitioners. The modeling tool Graphical Learning Modeler was built to bypass this problem for level A and partially level B of the IMS Learning Design specification. Its graphical interface with drag and drop allows easy setup of learning designs that can be made conformant to IMS Learning Design. This article presents the results of an evaluation of the Graphical Learning Modeler performed with instructors at a higher education institution. Results showed that instructors were generally successful in building learning designs, but that they still had problems with transferring concepts from their teaching environment to the concepts of IMS Learning Design. Furthermore, they had trouble grasping the meaning of an editor environment that is outside the runtime environment.
Design of Control System for Aircraft Based on Receding Horizon Optimal Theory
Authors: Hao Long, Xuetao Wu, Shujie Song
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

For the forth generation fighter aircraft, with thrust vector is one of the key technique characters. In condition of High AOA (Angle of attack), the general effectors lose the maneuver efficiency or get poorly, so new type of control law must be found. This control law should not only overcome those problems but also satisfy requirements of the forth generation aircraft. So linearization method at Sampling Point and Receding Horizon Optimal (RHO) Control is brought forward. This algorithm can convergence problem of a class of affine nonlinear system. Simulation result shows that RHO control law can solve this problem perfectly and accord with the requirements of the forth generation fighter aircraft.
Visual Modelling of Data Warehousing Flows with UML Profiles
Authors: Jesús Pardillo, Matteo Golfarelli, Stefano Rizzi, Juan Trujillo
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Data warehousing involves complex processes that transform source data through several stages to deliver suitable information ready to be analysed. Though many techniques for visual modelling of data warehouses from the static point of view have been devised, only few attempts have been made to model the data flows involved in a data warehousing process. Besides, each attempt was mainly aimed at a specific application, such as ETL, OLAP, what-if analysis, data mining. Data flows are typically very complex in this domain; for this reason, we argue, designers would greatly benefit from a technique for uniformly modelling data warehousing flows for all applications. In this paper, we propose an integrated visual modelling technique for data cubes and data flows. This technique is based on UML profiling; its feasibility is evaluated by means of a prototype implementation.
A New Characterization of ACC^0 and Probabilistic CC^0
Authors: Kristoffer Arnsfelt Hansen, Michal Koucký
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Barrington, Straubing and Therien (1990) conjectured that the Boolean AND function can not be computed by polynomial size constant depth circuits built from modular counting gates, i.e., by CC^0 circuits. In this work we show that the AND function can be computed by uniform probabilistic CC^0 circuits that use only O(log n) random bits. This may be viewed as evidence contrary to the conjecture. As a consequence of our construction we get that all of ACC^0 can be computed by probabilistic CC^0 circuits that use only O(log n) random bits. Thus, if one were able to derandomize such circuits, we would obtain a collapse of circuit classes giving ACC^0=CC^0. We present a derandomization of probabilistic CC^0 circuits using AND and OR gates to obtain ACC^0 = AND o OR o CC^0 = OR o AND o CC^0. AND and OR gates of sublinear fan-in suffice. Both these results hold for uniform as well as non-uniform circuit classes. For non-uniform circuits we obtain the stronger conclusion that ACC^0 = rand-ACC^0 = rand-CC^0 = rand(log n)-CC^0, i.e., probabilistic ACC^0 circuits can be simulated by probabilistic CC^0 circuits using only O(log n) random bits. As an application of our results we obtain a characterization of ACC^0 by constant width planar nondeterministic branching programs, improving a previous characterization for the quasipolynomial size setting.
Practices in creating videos with mobile phones
Authors: Arto Puikkonen, Jonna Häkkilä, Rafael Ballagas, Jani Mäntyjärvi
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Mobile phones with integrated video cameras have become ubiquitous tools that people use both to document everyday surroundings and to express themselves artistically. In this paper we report the findings of a user study on user created mobile videos, where the actions of 11 active mobile video users were documented for 2 weeks, the collected material including diaries, device logs, and altogether 255 videos. We describe the patterns related to the creation, sharing and consuming mobile videos, revealing characteristics of both context and content of the video material.
Guest Editor's Introduction: Perspectives on the History of Computer Games
Venue: IEEE Annals of the History of Computing (2009)

[I]t is probable, but not proven, that play at video games accustoms the player to the kind of activity that computers also require. One must sit down in front of a computer-like object and manage it in much the same way by levers and controls that a computer is managed. As in the case of the computer, there is immediate feedback for right and wrong choices. The management system of both game and computer are thus similar. It would be surprising if skill at one did not transfer to skill at the other; or if the attitude of being at ease with one did not transfer to being at ease with the other. (pp. 73&#x2013;74)1&#x2014;Brian Sutton-Smith
Unsupervised morphological segmentation with log-linear models
Authors: Hoifung Poon, Colin Cherry, Kristina Toutanova
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Morphological segmentation breaks words into morphemes (the basic semantic units). It is a key component for natural language processing systems. Unsupervised morphological segmentation is attractive, because in every language there are virtually unlimited supplies of text, but very few labeled resources. However, most existing model-based systems for unsupervised morphological segmentation use directed generative models, making it difficult to leverage arbitrary overlapping features that are potentially helpful to learning. In this paper, we present the first log-linear model for unsupervised morphological segmentation. Our model uses overlapping features such as morphemes and their contexts, and incorporates exponential priors inspired by the minimum description length (MDL) principle. We present efficient algorithms for learning and inference by combining contrastive estimation with sampling. Our system, based on monolingual features only, outperforms a state-of-the-art system by a large margin, even when the latter uses bilingual information such as phrasal alignment and phonetic correspondence. On the Arabic Penn Treebank, our system reduces F1 error by 11% compared to Morfessor.
Application of Data Mining in Electronic Commerce
Authors: Hewen Tang, Honglin Yan, Zengfang Yang, Yu Ma, Chunping Li
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Data mining has got more and more mature as a field of basic research in computer science and got more and more widely applied in several fields. Electronic Commerce is a good example. This paper surveyed some of approaches where data mining has been applied in electronic commerce. And this paper focused on data mining in the context of e-commerce, not surveying the algorithms in data mining
An implicit immersed boundary method for three-dimensional fluid-membrane interactions
Authors: D. V. Le, J. White, J. Peraire, K. M. Lim, B. C. Khoo
Venue: Journal of Computational Physics (2009)

We present an implicit immersed boundary method for the incompressible Navier-Stokes equations capable of handling three-dimensional membrane-fluid flow interactions. The goal of our approach is to greatly improve the time step by using the Jacobian-free Newton-Krylov method (JFNK) to advance the location of the elastic membrane implicitly. The most attractive feature of this Jacobian-free approach is Newton-like nonlinear convergence without the cost of forming and storing the true Jacobian. The Generalized Minimal Residual method (GMRES), which is a widely used Krylov-subspace iterative method, is used to update the search direction required for each Newton iteration. Each GMRES iteration only requires the action of the Jacobian in the form of matrix-vector products and therefore avoids the need of forming and storing the Jacobian matrix explicitly. Once the location of the boundary is obtained, the elastic forces acting at the discrete nodes of the membrane are computed using a finite element model. We then use the immersed boundary method to calculate the hydrodynamic effects and fluid-structure interaction effects such as membrane deformation. The present scheme has been validated by several examples including an oscillatory membrane initially placed in a still fluid, capsule membranes in shear flows and large deformation of red blood cells subjected to stretching force.
Authorial idioms for target distributions in TTD-MDPs
Authors: David L. Roberts, Sooraj Bhat, Kenneth St. Clair, Charles L. Isbell
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

In designing Markov Decision Processes (MDP), one must define the world, its dynamics, a set of actions, and a reward function. MDPs are often applied in situations where there is a clear choice of reward functions and in these cases significant care must be taken to construct a reward function that induces the desired behavior. In this paper, we consider an analogous design problem: crafting a target distribution in Targeted Trajectory Distribution MDPs (TTD-MDPs). TTD-MDPs produce probabilistic policies that minimize divergence from a target distribution of trajectories from an underlying MDP. They are an extension of MDPs that provide variety of experience during repeated execution. Here, we present a brief overview of TTD-MDPs with approaches for constructing target distributions. Then we present a novel authorial idiom for creating target distributions using prototype trajectories. We evaluate these approaches on a drama manager for an interactive game.
Decision Support Console for System Administration Based on an Expert System Approach
Authors: Francisco José de la Torre, Laura García Munoz, Roberto González Barahona, Maite Avelino Carmona, Manuel Gil Perez
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

What we propose is a decision support system to improve the dependability of highly interconnected Communications and Information Systems (CIS) that consists of the following. First, a framework to use expert knowledge based on a Rete algorithm to use rules and proposes reactions to administrate computer systems using the incidents that occur. Second, a very visual decision support console to study and run the reactions proposed by the expert system on a real time basis. The administrator will not only have a time window to run the reactions proposed by the expert system but also a way to make those reactions automatic when they have been tested enough.