ppxscal/embedding_network huggingface dataset:
Vision-Based Autonomous Vehicle Guidance in Indoor Environments Using Odometer and House Corner Location Information
Authors: Kai-Li Chiang, Wen-Hsiang Tsai
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

An approach to vehicle guidance using odometer and house corner location information is proposed for visionbased vehicle navigation in indoor environments. A small vehicle with wireless control and image grabbing capabilities is used as a test bed. A camera with the pantilt- zoom capability is equipped on the vehicle. The vehicle is guided to follow a path consisting of nodes learned in advance, which include the information of travel distances and turning angles provided by the odometer. A vehicle location method using house corners is proposed to estimate vehicle location which can be used to correct vehicle location, thus preventing mechanic error accumulation in long-distance navigation. Good experimental results show the feasibility of the proposed approach.
Product-Form Solutions for Integrated Services Packet Networks
Authors: Wanyang Dai
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This paper is concerned with the computation of stationary distributions of priority multiclass queueing networks with multi-sever stations, which are associated with high-speed integrated services packet networks. General product-form solutions are iteratively derived for the networks under certain assumption related to interarrival and service time distributions and theory is established to justify the solutions in several cases. These solutions can be used to conduct performance analysis or as comparison criteria for approximation and simulation studies of large scale networks with multi-processor shared-memory switches. Numerical comparisons with existing Brownian approximating model are given to show the usage and effectiveness of our algorithm.
Shape-based image retrieval for JPEG-2000 compressed image databases
Authors: J. Jiang, B. F. Guo, S. Ipson
Venue: Multimedia Tools and Applications (2006)

As JPEG-2000 is primarily based on wavelet transforms, we propose a moment-based algorithm to extract shape features out of wavelet coefficients to facilitate image retrieval from compressed image databases. Motivated by the observation that isolated significant points in the wavelet coefficients domain cannot accurately represent the shapes of regions, a range of ideas are investigated in this paper to construct shape descriptors in the wavelet domain using several morphological operators. Based on the fact that certain moments are invariant to rotation, a more compact and effective moment representation method is also proposed to integrate shape information in various directional wavelet sub-bands. Extensive experiments have been carried out using JPEG-2000 compressed image databases, and the results show that the proposed algorithm outperforms a representative existing shape-based image retrieval method in the wavelet domain.
Cost-based optimization in DB2 XML
Authors: A. Balmin, T. Eliaz, J. Hornibrook, L. Lim, G. M. Lohman, D. Simmen, M. Wang, C. Zhang
Venue: IBM Systems Journal (2006)

DB2 XML is a hybrid database system that combines the relational capabilities of DB2 Universal DatabaseTM (UDB) with comprehensive native XML support. DB2 XML augments DB2® UDB with a native XML store, XML indexes, and query processing capabilities for both XQuery and SQL/XML that are integrated with those of SQL. This paper presents the extensions made to the DB2 UDB compiler, and especially its cost-based query optimizer, to support XQuery and SQL/XML queries, using much of the same infrastructure developed for relational data queried by SQL. It describes the challenses to the relational infrastructure that supporting XQuery and SQL/XML poses and provides the rationale for the extensions that were made to the three main parts of the optimizer: the plan operators, the cardinality and cost model, and statistics collection.
Managing mobility and adaptation in upcoming 802.21 enabled devices
Authors: Filippo Cacace, Luca Vollero
Venue: Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots (2006)

One emerging characteristic of electronic devices is the increasing number of connectivity interfaces (aka NICs1) towards the outside world. That obviously translates in a set of technical issues related to their management in order to provide seamless connectivity when the connections move from one interface to another. The IEEE 802.21 is a recent effort of IEEE that aims at providing a general interface for the management of NICs. In this paper we discuss how the upcoming standard may be effectively exploited in a mobile context in order to hide network heterogeneity to end users. To accomplish this task, we propose a centralized element called Mobility Manager interfacing with the 802.21 sublayer and responsible for the application of connectivity policies. Based on a real testbed, we showed that the new standard and the MM can be used to improve network performance experienced by the end user. Moreover we showed how the MM can interact with adaptive applications in order to improve further the range of usability of real-time applications.
Phantom-DRAWN: direction guidance using rapid and asymmetric acceleration weighted by nonlinearity of perception
Authors: Tomohiro Amemiya, Hideyuki Ando, Taro Maeda
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper describes the design of a novel force perception method and the development of a handheld force display based on the method. The method is based on the nonlinear characteristics of human tactile perception; humans feel rapid acceleration more strongly than slow acceleration. The method uses periodic prismatic motion to create asymmetric acceleration leading to a virtual force vector. A prototype of the handheld force display that generates one-directional force using a relatively simple mechanism was built, and its performance tested in terms of both physical and perceptual characteristics. We verify the feasibility of the proposed method through experiments that determine the display's motor's rotational frequency that maximizes the perception of the virtual force vector.
Active capture: integrating human-computer interaction and computer vision/audition to automate media capture
Authors: M. Davis
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

While the devices for media capture have advanced from mechanical to computational since the invention of photography and motion pictures in the 19th century, their underlying user interaction paradigms have remained largely unchanged. Current interaction techniques for media capture do not leverage computation to solve key problems: the skill required to capture high quality media assets; the effort required to select useable assets from captured assets; and the lack of metadata describing the content and structure of media assets that could enable them to be retrieved and (re)used. We describe a new interaction and processing paradigm for media capture that redefines capture as a control process with feedback. By integrating human-computer interaction and computer vision and audition into an "active capture" process, we overcome the limitations of current media capture devices, algorithms, and interaction techniques. Active capture leverages media production knowledge to automate direction and cinematography and thus enables the automated production of annotated, high quality, reusable media assets.
How General Motors used simulators to save time and money creating value for our customers
Authors: James R Ashby
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This case study demonstrates how General Motors benefited by constructing special purpose simulators using ARENA Templates to rapidly model manufacturing systems common in the Automotive Industry. We use real manufacturing examples to demonstrate the enormous flexibility of these simulators while discussing the principles integral to their development. The simulators discussed here reduced model creation time from weeks to hours. Moreover, they eliminated the need for expert simulation engineers while at the same time dramatically improving modeling accuracy. In fact, it became common practice for engineers without any prior simulation experience to be trained and accurately constructing complex Body Shop models within a couple of weeks. For the first time, simulation analysis could be used in real time throughout the engineering development process. Hence, more effort was dedicated to analysis and improving system designs rather than constructing models.
Automatic Generation of Metadata for Learning Objects
Authors: Paramjeet Singh Saini, Marco Ronchetti, Diego Sona
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Proper reuse of learning objects depends both on the amount and quality of attached semantic metadata such as "learning objective"', "related concept", etc. Manually expressing such metadata is a time consuming and expensive task.. Here we present an approach based on a probabilistic model, which through the automatic classification of learning resources on a given taxonomic organization of the knowledge, allows to associate ontological metadata to the learning resources.
A very modal model of a modern, major, general type system
Authors: Andrew W. Appel, Paul-André Melliès, Christopher D. Richards, Jérôme Vouillon
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate languages and typed assembly languages used for object-oriented and functional languages. We establish in this purely semantic fashion a soundness proof of the typing systems underlying these TILs and TALs---ensuring that every well-typed program is safe. The technique is generic, and applies to any small-step semantics including λ-calculus, labeled transition systems, and von Neumann machines. It is also simple, and reduces mainly to defining a Kripke semantics of the Gödel-Löb logic of provability. We have mechanically verified in Coq the soundness of our type system as applied to a von Neumann machine.
Interview with Apostolos P. Georgopoulos
Authors: Staff
Venue: Journal of Cognitive Neuroscience (1998)

APG studied Medicine and Physiology at the University of Athens in Greece where he obtained his M.D. and Ph.D. degrees. He was trained in neurophysiology by Vernon B. Mountcastle at Johns Hopkins and, after a brief return to Athens, he came back to Johns Hopkins. He ascended the faculty ranks and promoted to Professor of Neuroscience in 1986. He was a member of the Philip Bard Laboratories of Neurophysiology at the Department of Neuroscience until 1991 when he moved to Minnesota as the American Legion Brain Sciences Chair at the Minneapolis Veterans Affairs Medical Center and the University of Minnesota. 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
Simulating a computational grid with networked animat agents
Authors: K. A. Hawick, H. A. James
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours of computational grids, based on simulations. We employ animat agents on a topologically detailed graph representing a grid overlay network. Agents are used to represent computational jobs, users and resources. We can obtain realistic behaviours by endowing user agents with time-varying microscopic behaviour patterns.We are able to study the static flow and dynamical macroscopic properties of the network including emergent pathological behaviours and other anomalies that arise when parts of the network become temporarily unavailable. Our model is based on graph theory with various attributes decorating the edges and nodes which have physical locations. We develop some overall grid utility metrics that can be analysed. Our work suggests that grids do need to be treated as complex adaptive systems.
A Role for Cortical Crosstalk in the Binding Problem: Stimulus-driven Correlations that Link Color, Form, and Motion
Authors: Vincent A. Billock
Venue: Journal of Cognitive Neuroscience (2004)

The putative independence of cortical mechanisms for color, form, and motion raises the binding problem&mdash;how is neural activity coordinated to create unified and correctly segmented percepts? Binding could be guided by stimulus-driven correlations between mechanisms, but the nature of these correlations is largely unexplored and no one has (intentionally) studied effects on binding if this joint information is compromised. Here, we develop a theoretical framework which: (1) describes crosstalk-generated correlations between cortical mechanisms for color, achromatic form, and motion, which arise from retinogeniculate encoding; (2) shows how these correlations can facilitate synchronization, segmentation, and binding; (3) provides a basis for understanding perceptual oddities and binding failures that occur for equiluminant and stabilized images. These ideas can be tested by measuring both perceptual events and neural activity while achromatic border contrast or stabilized image velocity is manipulated.
A Combined Approach for Reachability Analysis
Authors: Abdelaziz Guerrouat, Harald Richter
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

This paper presents the principle of an approach that allows to analyse most important system properties like reachability, executability, deadlock-freeness etc. The approach is based on two concepts: analysis purpose-directed analysis and specification unfolding. The first concept drives the analysis to the aimed specification part whereas the second allows to present the specification behaviour in a suitable form for the analysis. In contrast to the common analysis methods, the present approach considerably alleviates the state-explosion problem.
Inside discrete-event simulation software: how it works and why it matters
Authors: Thomas J. Schriber, Daniel T. Brunner
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper provides simulation practitioners and consumers with a grounding in how discrete-event simulation software works. Topics include discrete-event systems; entities, resources, control elements and operations; simulation runs; entity states; entity lists; and entity-list management. The implementation of these generic ideas in AutoMod, SLX, and Extend is described. The paper concludes with several examples of "why it matters" for modelers to know how their simulation software works, including coverage of SIMAN (Arena), ProModel, and GPSS/H as well as the other three tools.
Mining for Tree-Query Associations in a Graph
Authors: Eveline Hoekx, Jan Van den Bussche
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for mining associations between tree queries in a large graph. Tree queries are powerful tree-shaped patterns featuring existential variables and data constants. Our algorithm applies the theory of conjunctive database queries to make the generation of association rules efficient. We propose a practical, database-oriented implementation in SQL, and show that the approach works in practice through experiments on data about food webs, protein interactions, and citation analysis.
A Collaborative Multi-Agent Model with Knowledge-Based Communication for the RoboCupRescue Simulation
Authors: Jun Peng, Min Wu, Xiaoyong Zhang, Ya Xie, Fu Jiang, Ya Liu
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

An effective cooperation model in a Multi-Agent system is required to enable agents to interact and achieve their task proficiently. To address this problem, we propose a collaborative hierarchical Multi-Agent model based on two layers (Administrant layer and Autonomous layer), which makes use of the knowledge-based communication to actualize interaction in this model. Task planning and allocation are implemented in the adminktrant layer by using U-Tree algorithm, where reward function and evaluation value are introduced to control selection factors. Agents are allowed to work together using architectures like swarm and information update value in the autonomous layer, so that centralized and decentralized control can be integrated effectively. Moreover, this collaboration model has been applied successfully in CSU'Yunlu RoboCupRescue simulation team to show its advantages over other approaches. which will be about to participate in internationa1 RoboCupRescue 2006 in June.
Distributed Cost Boosting and Bounds on Mis-classification Cost
Authors: John Kaufhold, Justin Abbott, Robert Kaucic
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Many classification algorithms (such as Adaboost) aim to minimize training error, that is, the ratio of the number of mis-classified examples to the total number of examples. However, it is often desirable to minimize a more general cost metric, where distinct examples have different costs. For example, in industrial inspection, the cost of clearing a defective part is substantially greater than the cost of incorrectly alarming on a good part. Further, defects themselves vary in severity and, hence, cost. Extending boosting algorithms to account for this variable cost (cost-sensitive boosting) has been attempted by a number of investigators, resulting in a number of Adaboost variants, including AdaCost, Asymboost, CSB0, CSB1, and CSB2. These algorithms all focus only on the distribution update step in Adaboost-leaving the error computation step unchanged (or only indirectly modified). In this paper, we present a novel algorithm, termed "distributed cost boosting" (DCB), that incorporates the cost metric into the error computation step, rather than merely adjusting the distribution update step. DCB produces large empirical reductions in total cost when compared to current state-ofthe- art cost-sensitive Adaboost variants. Further, we show that distributed cost boosting provides error bounds on misclassification cost similar to AdaBoost's bounds on training error rate.
Expressing Workshop Scenario with Computer Independent Model
Authors: Jean-Pierre David, Anne Lejeune, Emmanuelle Villiot-Leclercq
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This contribution for the workshop aims to establish a link between the initial expression of the planet game scenario, viewed by a teacher, and its computable expression.
A Methodology Based on Maximal-Profit Spanning Tree for Designing Application Specific Networks on Chip (ASNOC)
Authors: Yuan-Long Jeang, Chung-Wei Hung, Chuen-Muh Chiang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

In this paper, a methodology based on a mix-mode interconnection architecture is proposed for constructing application specific networks on chip to minimize the total communication time. The proposed architecture uses a globally asynchronous communication network and a locally synchronous bus (or cross-bar or Multistage Interconnection Network MIN). A complete graph is constructed such that each vertex represents an IP core or a set of IP cores connecting by a locally synchronous bus (or cross-bar or MIN) and each edge has a weight (profit) representing a communication ratio (CR) for each pair of vertices. A maximal-profit spanning tree is constructed to represent the final network on chip. Comparisons on cost and total communication times with the SPIN architecture, mesh architecture, and binary tree architecture using Huffman-coding-like algorithm show that the new methodology has better results.
SMS(Short Message Service) based Secure Authentication and Accounting Mechanism in Wireless Network
Authors: Jong-Won Seo, Je-Gyeong Jo, Hyung-Woo Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The number of wireless public network user is increasing rapidly. Security problem for user authentication is risen on existing wireless network such as 802.11 based Wireless LAN. As a solution, 802.1x (EAP-MD5, EAP-TLS, EAP-TTLS), X.509, protocol or security system was developed by effective disposal plan of this problem. In this study, we overview main problem of existing EAP-MD5 authentication mechanism and propose a SMS based secure authentication mechanism for providing security enhanced wireless network.
A Control-Theoretic Approach to Distributed Discrete-Valued Decision-Making in Networks of Sensing Agents
Authors: Sandip Roy, Kristin Herlugson, Ali Saberi
Venue: IEEE Transactions on Mobile Computing (2006)

We address the problem of global sensor fusion for the purpose of distributed decision-making, from a control-theoretic perspective. In particular, we introduce a quasi-linear stochastic distributed protocol, using which a network of sensing agents can reach agreement in order to take a collective action. Using control-theoretic methods, we design the parameters of our protocol—which include weights in the local update rules used by the agents and a finite stopping time—to achieve agreement in a fair and rapid manner. We show analytically that the developed protocol achieves fair agreement with certainty in the noise-free case and achieves fair agreement with high probability even in the presence of communication noise and assuming very little information storage capability for the agents. Our development is illustrated throughout with a canonical example motivated by autonomous vehicle control.
The distinguishing number of the direct product and wreath product action
Authors: Melody Chan
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted D G(X), is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a color-preserving permutation of X. In this paper, we consider the distinguishing number of two important product actions, the wreath product and the direct product. Given groups G and H acting on sets X and Y respectively, we characterize the distinguishing number of the wreath product G ¿Y H in terms of the number of distinguishing colorings of X with respect to G and the distinguishing number of the action of H on Y. We also prove a recursive formula for the distinguishing number of the action of the Cartesian product of two symmetric groups S m × S n on [m] × [n].