ppxscal/embedding_network huggingface dataset:
Applying Artificial Intelligence Theory to Helicopter SAF Simulation Based on HLA/RTI (2)
Authors: Kazuo Uchiyama, Yasuko Iwai, Yoichi Ohashi, Toshikazu Ichinoseki, Kiyoshi Kayama
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper describes helicopter SAF simulation model based on HLA/RTI.Since Helicopter SAF requires complicated behavior on three dimensional space.Actual situation in battle space has uncertainty that is difficult to express in the usual simulation. In this study, we have developed helicopter SAF model at first in Japan and confirmed the effectiveness of ourmodel.The characteristics of study are as follows. 1) This helicopter has "intention" by applying Artificial Intelligence (AI) theory. So it will behave as autonomic and judge by itself. 2) Applying Rule Based Reasoning (RBR) and Case Based Reasoning (CBR), we can reflect the proficient pilot behavior to our developed model.As the result, the helicopter conducts with much complicated flying pattern as terrain avoidance, nap of the earth etc. 3) In this model, the operator has set mission to search enemy which location is unknown.The helicopter theorizes the location of enemy and plans the flight scheme using AI theory. 4) Algorithm for detecting enemy is based on the searching pattern data that we have surveyed from a proficient watchman. 5) Enemy can also detect the Helicopter by using radar and watchman.And they can assault the helicopter by missile. 6) Regarding environmental federation, we use digital map data and input weather data as visibility, ceiling, cloudy status, wind velocity, wind direction etc.Hence, we can realize more actual meteorological situation than existing simulation. 7) To scrutinize helicopter-flying pattern, we can conduct complicated simulation by using simpler rules for the helicopter flight pattern than usual one.A computer's processor is required less work than usual RBR.As the result, we found the way to conduct major scale federation or more realistic simulation than existing model.
Calibration Propagation for Image Augmentation
Authors: Didier Stricker, Nassir Navab
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

Calibration is the first step in image augmentation. Classical approaches compute the projection matrix given 3D points of the scene and their 2D image correspondences. Different auto-calibration algorithms have been recently developed by the computer vision community. They do not use 3D-2D correspondences, but need many 2D-2D correspondences over long sequence of images to provide stable results. In this article we propose a calibration propagation procedure, which is in-between the two previous approaches.Starting from one calibrated image, the unknown camera parameters and position are computed for a second image. In particular, this paper presents a method for extracting the focal length and the 3D structure, while other camera intrinsic parameters remain invariant. In practice for many professional cameras the principal point is approximately at the center of the image and the aspect ratio is given by camera specification.Calibration propagation is relevant to augmented reality applications, e.g. video see through HMD with zooming capability, since it enables image augmentation for a number of camera views with changing intrinsic parameters. In this paper, we present results on synthetic images showing the theoretical validity and performance of the method. We then use real data to demonstrate the potential of this approach for image augmentation applications in industrial maintenance assistance and architectural design.
Word sense disambiguation in information retrieval revisited
Authors: Christopher Stokoe, Michael P. Oakes, John Tait
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Word sense ambiguity is recognized as having a detrimental effect on the precision of information retrieval systems in general and web search systems in particular, due to the sparse nature of the queries involved. Despite continued research into the application of automated word sense disambiguation, the question remains as to whether less than 90% accurate automated word sense disambiguation can lead to improvements in retrieval effectiveness. In this study we explore the development and subsequent evaluation of a statistical word sense disambiguation system which demonstrates increased precision from a sense based vector space retrieval model over traditional TF*IDF techniques.
A Linear Constraint Satisfaction Approach to Cyclicity
Authors: Eugene Santos,  Jr.
Venue:  (1992)

Abductive reasoning (or explanation) is basically a backward-chaining process on a collection of causal rules. Given an observed event, we attempt to determine the set of causes that brought about this event. {\em Cost-based abduction} is a model for abductive reasoning which provides a concrete formulation of the explanation process. However, it restricts itself to acyclic causal knowledge bases. The existence of cyclicity results in anamolous behavior by the model. For example, assume in our knowledge base that $A$ can cause $B$ and $B$ can cause $A$. Faced with having to explain the occurrence of $A$, we could postulate $B$. Now, since $A$ already exists, we can use it to explain $B$. Our backward- explanation can certainly fall into this trap. In this paper, we present a new model called {\em generalized cost-based abduction} for general causal knowledge bases. Furthermore, we provide an approach for solving this model by using {\em linear constraint satisfaction.} 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
Information Theoretic Approach to Minimization of Polynomial Expressions over GF(4)
Authors: S. Yanushkevich, D. Popel, V. Shmerko, V. Cheushev, R. Stankovic
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper addresses a new information theoretic approach to minimization of polynomial expressions for Multiple Valued Logic (MVL) functions. Its focus is to determine the so-called pseudo Reed-Muller and pseudo Kronecker expressions of MVL functions. A key point of our approach is the use of information theoretic measures for efficient design of Decision Trees (DTs) to represent MVL functions. We utilize free pseudo Reed-Muller GF(4) (PSDRMGF) DTs and free pseudo Kronecker GF(4) (PSDKGF) DTs. Furthermore, we show that the suggested approach allows to manage the process of minimization in a simple way, for the most of known forms of logic function representation. Our program, Info-MV, produces, in most cases, the extremely better results, in contrast to some known heuristic minimization strategies.
A Systolic Array for the Sequence Alignment Problem
Authors: Dzung T. Hoang
Venue:  (1992)

This report introduces a new systolic algorithm for the sequence alignment problem. This work builds upon an existing systolic array for computing the edit distance between two sequences. The alignment array is meant to be used as the second phase in a two-phase design, with a modified edit distance array serving as the first phase. An implementation on the SPLASH programmable logic array is described. Because of the extensive pipelining in the systolic array, computing an alignment on the array takes that same amount of time as computing just the edit distance. Compared to conventional computers, SPLASH implementation performs several orders of magnitude faster.
Extracting Objects of Ada Programs using Module Features
Authors: Yuming Zhou, Baowen Xu
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Reengineering legacy systems written in conventional procedural languages to equivalent OO systems makes software more maintainable and reliable. In this paper, a method for extracting objects from legacy Ada 83 systems using module features is proposed. First, we develop metrics to measure module cohesion. Then, effects on cohesion from changing module components are discussed and rules on how to extract inheritance relations among objects are given. Finally, an object identification tool in APAUS is described.
Locating moving entities in indoor environments with teams of mobile robots
Authors: Matthew Rosencrantz, Geoffrey Gordon, Sebastian Thrun
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This article presents an implemented multi-robot system for playing the popular game of laser tag. The object of the game is to search for and tag opponents that can move freely about the environment. The main contribution of this paper is a new particle filter algorithm for tracking the location of many opponents in the presence of pervasive occlusion. We achieve efficient tracking principally through a clever factorization of our posterior into roles that can be dynamically added and merged. When searching for opponents, the individual agents greedily maximize their information gain, using a negotiation technique for coordinating their search efforts. Experimental results are provided, obtained with a physical robot system in large-scale indoor environments and through simulation.
An Efficient Calibration Technique for Systematic Current-Mismatch of D/A Converters
Authors: Kwang-Hyun Baek, Myung-Jun Choe, Sung-Mo (Steve) Kang
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper presents a current calibration technique forsystematic mismatch in current-cell array.The proposedtechnique is suitable for GHz-range current-steering D/Aconverters because of an efficient and its totally independent calibration operation. Behavioral simulation and measurement results show that static and yield performance ofa D/A converter can be enhanced significantly by using theproposed technique.A measured reduction in INL and DNLerrors before and after calibration is from +33.2 /-60.1 LSBto +1.28 /-1.28 LSB and from +10.2 /-12.8 LSBto +2.56 /-1.28 LSBin 12-bit resolution.
A Web Database Application Model for Software Maintenance
Authors: Chia-Lin Hsu, Hsien-Chou Liao, Jiun-Liang Chen, Feng-Jian Wang
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Web database application programs may consist of hundreds of files. The interoperations among these files could be complex, and most of them are lack of design documents. When a programmer maintains (changes) some programs of an application, the program files affected by the changes need be updated simultaneously to keep the functional consistency. One major difficulty of maintenance is how to identify these affected parts, especially in Web database applications. In this paper, we present a model, called HED model, for the maintenance of Web database applications. HED model decomposes a Web database application into three diagrams, hyperlink diagrams, entity-relationship diagrams, and data-flow diagrams, which are used to represent different aspects of a Web database application. Based on the HED model, the programs files affected by a program change can be identified precisely via the structure and database analyses. In addition, a maintenance tool is implemented to demonstrate the capability of the HED model.
Worst Case Analysis of a Greedy Multicast Algorithm in k-ary n-cubes
Authors: Satoshi Fujita
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we consider the problem of multicasting a message in k -ary n -cubes under the store-and-forward model. The objective of the problem is to minimize the size of the resultant multicast tree by keeping the distance to each destination over the tree the same as the distance in the original graph. In the following, we first propose an algorithm that grows a multicast tree in a greedy manner, in the sense that for each intermediate vertex of the tree, the outgoing edges of the vertex are selected in a non-increasing order of the number of destinations that can use the edge in a shortest path to the destination. We then evaluate the goodness of the algorithm in terms of the worst case ratio of the size of the generated tree to the size of an optimal tree. It is proved that for any k \geqslant 5 and n \geqslant 6 , the performance ratio of the greedy algorithm is c × kn - o(n ) for some constant 1/12 \leqslant c \leqslant 1/2 .
Dynamic Power Saving Strategy and Data System for Future Shinkansen Traffic Control
Authors: Takashi Kawakami
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

A framework for effective energy saving control measures for Shinkansen ("Bullet Train") Lines is presented.The future will see increased transportation capacity. For example, train frequency of the fastest train "Nozomi" is expected to be rise from one to four trains per hour. The dynamic power supply strategy is the best solution to avoid the needs to install extra electric facilities. Decreasing the top speed and matching the train operation phase are ways to cut the fluctuating load peak at power substations.So as to realize the desired power control characteristics, a system is proposed which consists of WTU (wayside telecommunication unit ), zone controller at each power substation, Train Traffic Control Center and BIF( Broad Information Field Network). The BIF connects all the facilities[1]. The WTU communicates with trains using radio waves and with the zone controller using the Wayside Optical Network.Beforehand, a train time table suitable for energy saving is scheduled using the railway power simulation. The Train Traffic Control Center broadcasts three-dimensional "macro targets" for all trains in both directions. Using local conditions, the zone controller composes a "macro target" into a "zone run-curve" .Firstly, trains are able to execute the operation of "target shooting" using the zone run-curve. Secondary, regenerated braking power is effectively transferred to another accelerating train. Thirdly, even if the train schedule has been disrupted severely, trains do not restart simultaneously, so the peak load at substations goes down successfully. Thus, the proposed dynamic power supply strategy for future shinkansen trains realizes not only energy saving, but also conserves the world resources.
Automated Finding of the Willis Ring in MR Angiography Images Using Fuzzy Knowledge Base
Authors: Syoji Kobashi, Katsuya Kondo, Yutaka Hata
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper proposes an automated method for findingthe Willis ring from the human brain MR angiography(MRA) images, which can depict cerebral arteries withhigh contrast. It strongly helps screening of unrupturedcerebral aneurysm in MRA images. The proposedmethod consists of (1) segmenting cerebral arteries fromMRA images, (2) skeletonization of artery trees, and detectionof furcations, and (3) finding furcations in theWillis ring using genetic algorithm (GA) based on fuzzyknowledge base (fuzzy KB). Fuzzy KB gives knowledgeabout the Willis ring that consists of arteries andfurcations. GA finds a set of furcations by optimizing anobjective function. The objective function used by GAestimates fitness of a set of furcations using fuzzy KB.Our method was first applied to a 3-D phantom data generatedby computer simulation. The result demonstratedthat our method detected all suitable furcations correctly.Next, it was applied to MRA volume data of two normalhealthy volunteers. In any cases, the proposed methoddetected desired all furcations in the Willis ring.
A fast transformation method to semantic query optimisation
Authors: A. Sayli, B. Lowden
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Semantic query optimisation is a comparatively recent approach for the transformation of a given query into equivalent alternative queries using matching rules in order to select an optimum query based on the costs of executing these alternative queries. The most important aspect of this optimisation approach is that this resultant query can be processed more efficiently than the original query. This paper describes how a near optimal alternative query may be found in far less time than existing approaches. The method uses the concept of a 'search ratio' associated with each matching rule. The search ratio of a matching rule is based on the cost of the antecedent and consequent conditions of the rule. This cost is related to the number of instances in the database determined by these conditions. This knowledge about the number of instances is available and can be recorded when the rules are first derived. We then compare search ratios of rules to select the most restrictive rules for the construction of a near optimum query. The technique works efficiently regardless of the number of matching rules, since resources are not used to construct all alternative queries. This means that transformation and selection costs are minimised in our system. It is hoped that this method will prove a viable alternative to the expensive optimisation process normally associated with semantic query optimisation.
On predictive parsing and extended context-free grammars
Authors: Anne Brüggemann-Klein, Derick Wood
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to only finite languages. We present a novel view on top-down predictive parser construction for extended context-free grammars that is based on the rewriting of partial syntax trees. This work is motivated by our development of ECFG, a Java toolkit for the manipulation of extended context-free grammars, and by our continuing investigation of XML.
Automata and coinduction (an exercise in coalgebra)
Authors: J. J.M.M. Rutten
Venue:  (1998)

The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra.
A forwarding strategy to reduce network impacts of PCS
Authors: R. Jain, Yi-Bing Lin, C. Lo, S. Mohan
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

We propose a per-user forwarding strategy for locating users who move from place to place while using personal communications services (PCS). The forwarding strategy augments the basic location strategy proposed in existing standards such as GSM and IS-41, with the objective of reducing network signalling and database loads in exchange for increased CPU processing and memory costs. With the forwarding strategy, calls to a given user will first query the user's home location register (HLR) to determine the first visitor location register (VLR) which the user was registered at, and then follow a chain of forwarding pointers to the user's current VLR. This strategy is useful for those users who receive calls infrequently relative to the rate at which they change registration areas. We use a reference PCS architecture and the notion of a user's call-to-mobility ratio (CMR) to quantify the costs and benefits of using forwarding and classes of users for whom it would be beneficial. We show that sender a variety of assumptions forwarding is likely to yield significant net benefits for certain classes of users, in exchange (possibly) for a small increase in mean call setup time. For instance, under certain cost assumptions, for users with CMR>1 forwarding can result in 20-60% savings over the basic strategy, with no increase in mean call setup time.
Thoughts on a Larch/ML and a New Application for LP
Authors: Jeannette M. Wing, Eugene Rollins, Amy M Zaremski
Venue:  (1992)

We describe a preliminary design for a Larch interface language for the programming language ML. [Since this design covers only a subset of Standard ML, we will refer to our interface language as Larch/ML rather than Larch/SML.] ML''s support for higher-order functions suggests a need to go beyond the first-order logical foundations of Larch languages. We also propose a new application, "specification matching", for the Larch Prover, which could benefit from extending LP to handle full first-order logic. This paper describes on-going work and suggests a number of open problems related to Larch/ML and to LP as used for specification matching. We assume rudimentary knowledge of Larch, its languages and two-tiered approach.
A Generic Task Strategy for Solving Routine Decision Making
Authors: Richard Fox
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

An algorithm to solve routine decision making problems is presented here. This algorithm combines plan-step generation to find actions that can be applied to solve the particular problem, plan-step assessment to evaluate how useful each action is within the context of the given problem, and plan-step assembly to select and sequence the best actions. These processes can themselves be implemented using the Generic Tasks of Hierarchical Classification, Routine Recognition and a variation of Abductive Assembly. This paper describes routine decision making problems, the routine decision making algorithm and demonstrates it through three knowledge-based systems.
Quadsim Student Manual
Authors: Marwan Shaban
Venue:  (1993)

Abstract 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
Parallelizing User-Defined Functions in Distributed Object-Relational DBMS
Authors: Kenneth W. Ng, Richard R. Muntz
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Full support of parallelism in object-relational database systems (ORDBMSs) is desired. The parallelization techniques developed for relational database systems are not adequate for ORDBMS because of the introduction of complex abstract data types and operations on ordered domains. In this paper, we consider a data stream paradigm and develop a query parallelization framework that exploits characteristics of user-defined functions in a ORDBMS during query optimization. By introducing the concept of windows and abstract data type orderings, we develop a novel approach for parallelizing user-defined functions in a distributed ORDBMS environment. The implementation issues in providing query services in ordered domains are also discussed.
Accumulators: New Logic Variable Abstractions for Functional Languages
Authors: Keshav Pingali, Kattamuri Ekanadham
Venue:  (1988)

Much attention has been focused by the declarative languages community on combining the functional and logic programming paradigms. In particular, there are many efforts to incorporate logic variables into functional languages. We propose a generalization of logic variables called accumulators which are eminently suited for incorporation into functional languages. We demonstrate the utility of accumulators by presenting examples which show that accumulators can be used profitably in many scientific applications to enhance storage efficiency and parallelism.