ppxscal/embedding_network huggingface dataset:
Mobile Robotics Planning Using Abstract Markov Decision Processes
Authors: Pierre Laroche, Francois Charpillet, Rene Schott
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Markov Decision Processes have been successfully used in robotics for indoor robot navigation problems. They allow to compute optimal sequences of actions in order to achieve a given goal, accounting for actuators uncertainties. But MDPs are weak to avoid unknown obstacles. At the opposite reactive navigators are particularly adapted to that, and don't need any prior knowledge about the environment. But they are unable to plan the set of actions that will permit the realization of a given mission. We present a new state aggregation technique for Markov Decision Processes, such that part of the work usually dedicated to the planner is achieved by a reactive navigator. Thus some characteristics of our environments, such as width of corridors, have not to be considered, which allows to cluster states together, significantly reducing the state space. As a consequence, policies are computed faster and are shown to be at least as efficient as optimal ones.
Learning and Adaptation in Real-Time Decision Support Systems of a Semiotic Type
Authors: Alexander P. Eremeyev, Paulina V. Shutova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper describes the learning and adaptation methods for the real-time decision support systems (RTDSSs) of a semiotic type intended for operative-dispatching management of a complex object or a process. It is taken into consideration RTDSSs are mostly oriented towards open and dynamic problem domains, where incompleteness and uncertainty of inputinformation are present.
Exploiting the locality of data structures in multithreaded architecture
Authors: Yoon Ho Kim, Soo Hong Kim, Dae Woong Rhee, Heung Hwan Kim, Juno Chang, Sang Youg Han
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Multithreaded architectures taking a hybrid approach of von Neumann computers and dataflow computers are recently in active research. Multithreaded architectures can improve the performance by the locality exploitation within threads and asynchronous parallel execution among threads. However, it has been overlooked how to exploit effectively the locality of large shared data structures among threads in multithreaded architectures. In this paper, we propose a new data structure, called IB-structure, which is an extension of I-structure to facilitate the distribution of data structure and exploit the locality of data structure, and implement it on multithreaded architecture DAVRID (DAtaflow Von Neumann RISC hybrID). The simulation results show that IB-structure is superior to I-structure over several benchmarks.
Adjustment of fetal ponderal growth curves according to a mixture model
Authors: Stefania Tentoni, Paola Astolfi, Antonio De Pasquale, Laura Zonta
Venue:  (2001)

In the distribution of birthweight by gestation age (GA) several authors have observed an excess of babies large for GA, suggesting that pregnancy length might be, in many cases, underestimated by the reported last menstrual period (LMP). In a sample of 2,723,453 single liveborns, selected from the 1990-94 newborns in Italy (ISTAT), we observed positively skewed weight distributions in GA classes >35 weeks, markedly bimodal at 30-32 weeks. This suggests that the observations by GA might be not really homogeneous, and that large babies might follow a secondary birthweight distribution shifted to the right tail. In order to define reliable fetal ponderal growth curves, we have modeled the data by a two-component normal mixture distribution, where the major component accounts for the normal process of growth while the secondary one accounts for large babies. The mixture model provides a more robust way to correct the growth centile curves for large babies. For each GA, the model parameters have been estimated, as well as the threshold values for a probabilistic clustering of the observations. The secondary component ranges from ~7% to ~27% of the total distribution, with a maximum at the 30th week, and then vanishes by the 35th week. The values of its parameters suggest that in large-for-GA babies the pregnancy duration might be underestimated of about six weeks.
Quantitative Software Reliability Modeling from Testing to Operation
Authors: Chin-Yu Huang, Sy-Yen Kuo, Jung-Hua Lo, Michael R. Lyu
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

In this paper, we first describe how several existing software reliability growth models based on Non-homogeneous Poisson Processes (NHPPs) can be derived based on a unified theory for NHPP models. Under this general framework, we can verify existing NHPP models and derive new NHPP models. The approach covers a number of known models under different conditions. Based on these approaches, we show a method of estimating and computing software reliability growth during operational phase. We can use this method to describe the transitions from testing phase to operational phase. That is, we propose a method of predicting the fault detection rate to reflect changes in the user's operational environments. The proposed method offers a quantitative analysis on software failure behavior in field operation and provides useful feedback information to the development process.
An Algorithmic Model of the Time Profile of the State of a Group of Single-type Equipment for Analysis of the Risk of Reduction in Group Productivity below the Given Value
Authors: V. E. Marlei, V. B. Muravnik, N. I. Nekhoroshkin, Yu. K. Stolyarov, V. V. Tubol'tseva
Venue: Automation and Remote Control (2003)

A model was proposed to analyze the operability state of a group of single-type equipment of a production system with regard for dependence of the group failure intensity on quality of operation and maintenance and the mean age of equipment.
Pseudo-Real-Time Phenomenon in an Augmented Distributed Virtual Environment (ADVE) with Lag
Authors: Hor Li San
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper introduces the actualization of a new communication channel under a pseudo-real-time phenomenon, in an Augmented Distributed Virtual Environment (ADVE) framework through the implementation of a Prediction Feedback Loop (PFL), upon the existence of the unavoidable lag derived from the natural and artificial temporal factors. By implementing PFL, the ADVE framework is enriched with predictive characteristic where it is able to predict and foreshow information of a remotely controlled avatar (virtual body) in the ADVE. Based on the predictive results, interactions between a locally controlled avatar and a remotely controlled avatar in the ADVE can be carried out smoothly, effectively and strategically under an illusory real-time phenomenon without influence from the existence of lag. With this Pseudo-real-time Channel, we would like to bring forth a new era of effective man-to-man virtual communication over the network without inefficiency caused by the unavoidable lag, whether it is solvable or unsolvable.
Plan-Related Negation in Story Understanding
Authors: Solomon E Shimony
Venue:  (1989)

This paper discusses simple uses of negation in story understanding. We show that the meaning of a negated sentence is not simply its logical form, but also indicates an ``expectation'''' that its non-negated form would hold. We extend the representation of plans to handle the counterfactual statements needed for negation, by treating plans as objects. We present a theory incorporating the extra meaning into a story-understanding system based on first-order plans. The plan representation introduced here is shown to be useful for understanding stories where agents change their plans, even in stories without negative sentences. 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
Vind(x): Using the User through Cooperative Annotation
Authors: Louis Vuurpijl, Lambert Schomaker, Egon van den Broek
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper, the image retrieval system Vind(x) is described. The architecture of the system and first user-experiences are reported. Using Vind(x), users on the Internet may cooperatively annotate objects in paintings by use of the pen or mouse. The collected data can be searched through query-by-drawing techniques, but can also serve as an (ever-growing) training and benchmark set for the development of automated image retrieval systems of the future. Several other examples of cooperative annotation are presented in order to underline the importance of this concept for the design of pattern recognition systems and the labelingof large quantities of scanned documents or online data.
On path selection for traffic with bandwidth guarantees
Authors: Qingming Ma, P. Steenkiste
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Transmission of multimedia streams imposes a minimum-bandwidth requirement on the path being used to ensure end-to-end Quality-of-Service (QoS) guarantees. While any shortest-path algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the network load are needed to achieve efficient resource utilization. We present a systematic evaluation of four routing algorithms that offer different tradeoffs between limiting the path hop count and balancing the network load. Our evaluation considers not only the call blocking rate but also the fairness to requests for different bandwidths, robustness to inaccurate routing information, and sensitivity to the routing information update frequency. It evaluates not only the performance of these algorithms for the sessions with bandwidth guarantees, but also their impact on the lower priority best-effort sessions. Our results show that a routing algorithm that gives preference to limiting the hop count performs better when the network load is heavy, while an algorithm that gives preference to balancing the network load performs slightly better when the network load is light. We also show that the performance of using pre-computed paths with a few discrete bandwidth requests is comparable to that of computing paths on-demand, which implies feasibility of class-based routing. We observe that the routing information update interval can be set reasonably large to reduce routing overhead without sacrificing the overall performance, although an increased number of sessions can be misrouted.
Special Web Standards Presentation
Authors: Stan Magee
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The World Wide Web is a network of electronic sites linked to form a global electronic network for creating, changing, transmitting and viewing information in text, graphics and audio format. This presentation discusses the first documented method for classifying Web software standards so the 300+ Web standards can be easily indexed to a Web application. This indexing method will save software engineer time and money in finding the correct standard for the task.
Events and Sightings
Authors: Mary Croarken, Nathan Ensmenger
Venue: IEEE Annals of the History of Computing (2003)

Information technology in the Ukraine The Stretch/Harvest Reunion, 28-29 September 2002Second Conference on the History and Heritage of Scientific and Technical Information SystemsMoscow colloquium in honor of Sergei Alexeyevich Lebedev
Quantum multi-prover interactive proof systems with limited prior entanglement
Authors: Hirotada Kobayashi, Keiji Matsumoto
Venue: Journal of Computer and System Sciences (2003)

This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. It is proved that the class of languages having quantum multi-prover interactive proof systems is necessarily contained in NEXP, under the assumption that provers are allowed to share at most polynomially many prior-entangled qubits. This implies that, in particular, if provers do not share any prior entanglement with each other, the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, in the case a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP.
Deformable Organ Modeling with Multi-Layer Particle Systems
Venue: Proceedings of the International Conference on Information Visualisation (2000)

In this paper, we describe a general methodology for reconstruction and animation of volumetric deformable objects. In the scope of a medical application, we want to simulate the motion and the form alteration of the internal anatomical organs. Multi-layer particle systems are well adapted to represent the geometry. However, several problems occur related to the structure of our model and the nature of internal forces. For this, we have introduced the necessary tools to overcome these problems and to handle the dynamic and deformable behavior of cancerous tissues and organs. Our particle system seems to be suitable to be integrated in radiation dose evaluation software, developed within the European BIOMED2-ARROW project by North Western Medical Physics team, in Manchester.
Using Model Checking to Generate Tests from Specifications
Authors: Paul E. Ammann, Paul E. Black, William Majurski
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

We apply a model checker to the problem of test generation using a new application of mutation analysis. We define syntactic operators, each of which produces a slight variation on a given model. The operators define a form of mutation analysis at the level of the model checker specification. A model checker generates counterexamples which distinguish the variations from the original specification. The counterexamples can easily be turned into complete test cases, that is, with inputs and expected results. We define two classes of operators: those that produce test cases from which a correct implementation must differ, and those that produce test cases with which it must agree.There are substantial advantages to combining a model checker with mutation analysis. First, test case generation is automatic; each counterexample is a complete test case. Second, in sharp contrast to program-based mutation analysis, equivalent mutant identification is also automatic. We apply our method to an example specification and evaluate the resulting test sets with coverage metrics on a Java implementation.
A Comparison Between Single-agent and Multi-agent Classification of Documents
Authors: S. Peng, S. Mukhopadhyay, R. Raje, M. Palakal
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

Information services such as searching, retrieval, and filtering are playing a dominant role in our life during the current information age. One critical functionality of these information services is to obtain effective classification for input documents. Thesaurus(vocabulary)-based document representation followed by clustering constitutes a popular approach to document classification. However, two alternatives exist to construct the information classificationsystem. The first one uses a single, monolithic, huge thesaurus and classifies all documents by one centralized machine. The second one exploits distributed computing environmentsby allowing multiple agents with small thesauri to collaborate with each other over a computer network. The objective of this paper is to compare these two approaches (i.e., single-agent and multi-agent) in terms of various criteria including response time, quality of classification, and economic/privacy considerations. Two experimental studies, involving classification of Computer Science and Medline documents, are presented to compare the performanceof a single-agent system with that of a multi-agent system in real world settings. These results indicate that a collaborative multi-agent system constitutes a attractive methodologyfor classifying a large volume of information efficiently, when the thesaurus is large.
Geometrical parameter influence on behaviour of reticulated timber domes
Authors: D. H. Pan, U. A. Girhammar
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this paper, reticulated timber domes of triangular network shape with decking and bottom tension ring are considered. The dome is subjected to evenly distributed load over entire dome. The dome model is generated by a preprocessor program DOMEIN and analysed by ABAQUS. The behaviour of reticulated timber domes with respect to a number of geometrical parameters is evaluated. It is found that the optimum height-diameter ratio is ≈ 0.3, that straight beams in the triangular networks are preferred to curved beams, and that perpendicular purlins are preferable to parallel purlins.
ControlWare: A Middleware Architecture for Feedback Control of Software Performance
Authors: Ronghua Zhang, Chenyang Lu, Tarek F. Abdelzaher, John A. Stankovic
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Attainment of software performance assurances in open, largely unpredictable environments has recently become an important focus for real-time research. Unlike closed embedded systems, many contemporary distributed real-time applications operate in environments where offered load and available resources suffer considerable random fluctuations, thereby complicating the performance assurance problem. Feedback control theory has recently been identified as a promising analytic foundation for controlling performance of such unpredictable, poorly modeled software systems, the same way other engineering disciplines have used this theory for physical process control.In this paper, we describe the design and implementation of ControlWare, a middleware QoS-control architecture based on control theory, motivated by the needs of performance-assured Internet services. It offers a new type of guarantees we call convergence guarantees that lie between hard and probabilistic guarantees. The efficacy of the architecture in achieving its QoS goals under realistic load conditions is demonstrated in the context of web server and proxy QoS management.
Intelligent Educational Environments Based on the Semantic Web Technologies
Authors: Michael G. Panteleyev, Dmitry V. Puzankov, Pavel V. Sazykin, Denis A. Sergeyev
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The advanced educational technologies and environments must provide personalized learning services within broad spectrum of user needs. The Semantic Web is considered to be a promising way to meet this requirement.In this paper the main directions of eLearning systems evolution and stages of each direction are defined. The roles of ontologies and intelligent agents in such systems are recognized. We identify and describe five layers of ontologies needed in future eLearning systems. Different levels of educational queries and scenarios of its processing are considered. An approach to constructing of personalized learning program based on the Semantic Web technologies is proposed. To ensure the maximal flexibility the eLearning system is organized as a multi-agent system (MAS) composed by three kind of agents: student agent, search agent and course constructing agent. In conclusion some MAS software implementation issues are shortly considered.
Sense: A Service Navigation System linked to a Real-time Advertising Distribution Service
Authors: Ichizo Kogiku, Minoru Katayama, Takashige Hoshiai
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Sense: A Service Navigation System is an agent system supporting interaction between the end user (consumer) and service provider (producer) in an open, distributed object environment. It navigates among the latest multimedia network services based on the end userÕs wishes, profile and situations. Its service navigation strategy is a key feature of Sense; it navigates based not merely on pre-registered user information, but taking into consideration the history of service selection by the user, advertising information from the service provider and other clues. Moreover, Sense makes use of object services available in the open distributed processing environment, such as traders and service type repositories, enabling it to take the initiative in proposing the latest multimedia network services.
Resident Evil 2 & 3 Official Guide, Vol. 3
Authors: Dan Birlew, Stephen Frost
Venue:  (2003)

:BradyGames' Resident Evil 2 3 Official Strategy Guide covers both Resident Evil 2 and Resident Evil 3: Nemesis in one comprehensive guide. Step-by-step walkthroughs to guide players successfully through each adventure. Detailed area maps for both games are also provided. Expert boss tactics show gamers how to defeat each ghastly beast! Comprehensive item and weapon lists. Game secrets and bonuses in both games are revealed!
Sparse Hard Sets for P Yield Space-Efficient Algorithms
Authors: Mitsunori Ogihara
Venue:  (1996)

In 1978, Hartmanis conjectured that there exist no sparse complete sets for P under logspace many-one reductions. In this paper, in support of the conjecture, it is shown that if P has sparse hard sets under logspace many-one reductions, then P is a subset of DSPACE[log^2 n]. 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
Professional Apache Security
Authors: Tony Mobily, Sandip Bhattacharya, Mark Wilcox, Debashish Bhattacharjee, Brian Rickabaugh
Venue:  (2003)

:Apache provides many features that can be used to either compromise server security or gather information about a server that the administrator would prefer kept secret. Of course, these features aren't there to create security holes, but the more complex the configuration, the more chances there are of creating an unanticipated use of the server. Understanding what is, and what is not, expected behavior is essential, both when creating the server configuration and detecting possible misuse. There is no such thing as a totally one hundred percent secure server. In this book we delve into crucial aspects of Apache security, and practical ways of setting up a safer, more secure implementation of an Apache server. This book is a tutorial, a resource, and a reference for Apache administrators, security analysts, web developers, and system architects, who want to secure Apache on UNIX and its variant platforms.