ppxscal/embedding_network huggingface dataset:
Simulating Agent Based Processing in an ADS Using C++ SIM
Authors: Chiewon Lee, Junghwan Kim, Jerry Stach, E. K. Park
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Currently public networks have an enormous number of computers capable of providing many services. Autonomous mobile agents are being used to access their information sources. These agents are modeled in the context of network simulation as mobile network processes. This paper demonstrates distributed mobile agents can be simulated effectively using C++ over CSIM. C++ over CSIM achieves the clarity and logic of agent based simulation for network services. Inheritance and specialization under object orientation allow the design and reuse of simulation objects. This combination facilitates rather straightforward simulation designs that are scalable, accurate, flexible and generalizable. The design for such large scale simulation is sketched and the run time behavior of the simulator is analyzed.
Superposing Connectors
Authors: Michel Wermelinger, Antónia Lopes, José Luiz Fiadeiro
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

The ability to construct architectural connectors in a systematic and controlled way has been argued to promote reuse and incremental development, e.g., as a way of superposing, à la Carte, services like security over a given communication protocol. Towards this goal, we present a notion of high-order connector, i.e., a connector that takes connectors as parameters, for superposing coordination mechanisms over the interactions that are handled by the connectors that are passed as actual arguments. The notion is developed over the language COMMUNITY that we have been using for formalising aspects of architectural design and illustrated with examples inspired by the case study.
Model-based assessment of physicochemical properties of drug delivery materials
Authors: Liliana Ironi, Stefania Tentoni
Venue:  (1999)

A model-based system, specifically designed for the automated modeling of the mechanical behavior of viscoelastic materials, has been used to investigate the mucoadhesive performance of a class of polymers candidate for use as drug carriers within new-concept controlled-release delivery systems. Such an approach is cheaper than the traditional purely experimental one as well as more informative about the polymer-mucus interaction . The system integrates qualitative and quantitative techniques to make the most of the available heterogeneous and interdisciplinary knowledge with a consequent gain in computational efficiency and robustness.
Processor-Ring Communication: A Tight Asymptotic Bound on Packet WaitingTimes
Authors: E. G. Coffman,  Jr., Nabil Kahale, F. T. Leighton
Venue:  (1996)

We consider $N$ processors communicating unidirectionally over a closed transmission channel, or ring. Each message is assembled into a fixed-length packet. Packets to be sent are generated at random times by the processors, and the transit times spent by packets on the ring are also random. Packets being forwarded, i.e., packets already on the ring, have priority over waiting packets. The objective of this paper is to analyze packet waiting times under a greedy policy, within a discrete Markov model that retains the over-all structure of a practical system, but is simple enough so that explicit results can be proved. Independent, identical Bernoulli processes model message generation at the processors, and i.i.d. geometric random variables model the transit times. Our emphasis is on asymptotic behavior for large ring sizes, $N$, when the respective rate parameters have the scaling $\la /N$ and $\mu /N$. Our main result shows that, if the traffic intensity is fixed at $\rho = \la / \mu > 1$, then as $N \to \infty$ the expected time a message waits to be put on the ring is bounded by a constant. This result verifies that the expected waiting time under the greedy policy is within a constant factor of that under an optimal policy.
Group analysis of the von K&#x00E1;rm&#x00E1;n--Howarth equation. Part II. Physical invariant solutions
Authors: S. V. Khabirov, G. Ünal
Venue: Communications in Nonlinear Science and Numerical Simulation (2002)

Physically meaningful group invariant solutions of the von Kármán-Howarth equation corresponding to the optimal system of one-dimensional subalgebras have been obtained completely. These solutions may be used to study the decay of the isotropic turbulence.
Issues in scaling multimedia collaboration tools for remote instruction
Authors: K. Maly, H. A. Wahab, C. M. Overstreet, A. Gupta, M. Kumar, R. Srivatsava
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Today a plethora of multimedia, hyperlink software and hardware components are available, as well as teleconferencing systems supporting collaborative work. However, few systems are easy for people to use for real applications such as support of remote instruction. Most importantly, none of these tools scale to use by more than a few users simultaneously. We describe our vision for a system which will support interactive remote instruction (IRI) to support college-level education across spatial boundaries in a manner largely transparent to students and faculty. We have implemented a prototype of this system which has been used to evaluate both the user-interface design and performance requirements. The goal is to have a user interface which models most of the interactions which occurs in a regular classroom. A key focus in this paper is the assessment of system requirements necessary to support large classes. That means that multimedia tools must support O(10), rather than O(1), simultaneous users and user-system interaction protocols must be effective and accepted by students and faculty with diverse backgrounds and computer sophistication.
UNIX System Administration: A Beginner's Guide, 1 edition
Authors: Steve Maxwell
Venue:  (2002)

:Learn to administer UNIX from both a network and single system perspective with help from this introductory resource. You'll get clear advice on everything from installation and configuration to setting up important services such as Web Server, FTP, SNMP, DNS, as well as other key functions. You'll also find specific information for the Solaris, HP-UX, and AIX platforms. 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
Operating system support for high-performance, real-time CORBA
Authors: A. Gokhale, D. C. Schmidt, T. Harrison, G. Parulkar
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

A broad range of applications (such as avionics, telecommunication systems, and multimedia on demand) require various types of real-time guarantees from the underlying middleware, operating systems, and networks to achieve their quality of service (QoS). In addition to providing real-time guarantees and end-to-end QoS, the underlying services used by these applications must be reliable, flexible, and reusable. Requirements for reliability, flexibility and reusability motivate the use of object-oriented middleware like the Common Object Request Broker Architecture (CORBA). However the performance of current CORBA implementations is not suitable for latency-sensitive real-time applications, including both hard real-time systems (e.g., avionics), and constrained latency systems (e.g., teleconferencing). This paper describes key changes that must be made to the CORBA specifications, existing CORBA implementations, and the underlying operating system to develop real-time ORBs (RT ORBs). RT ORBs must deliver real-time guarantees and end-to-end QoS to latency-sensitive applications. While many operating systems now support real-time scheduling, they do not provide integrated solutions. The main thesis of this paper is that advances in real-time distributed object computing can be achieved only by simultaneously integrating techniques and tools that simplify application development; optimize application, I/O subsystem, and network performance; and systematically measure performance to pinpoint and alleviate bottlenecks.
A two-level evolution strategy (balancing global and local search)
Authors: Cees H.M. Kemenade
Venue:  (1995)

Evolution Strategies apply mutation and recombination operators in order to create their offspring. Both operators have a different role in the evolution process: recombination should combine information of different individuals, while mutation performs a kind of random walk to introduce new values. In an ES these operators are always applied together, but their different roles suggest that it might be better to apply them independently and at different rates. In order to do so the ES has been split into two levels. The resulting Modular Evolution Strategy consists of a population of local optimizers and a distributed population manager. Both parts have their own specific role in the optimization process. As a result of its modularity this method can be adapted more easily to specific classes of numerical optimization problems, and introduction of adaptive mechanisms is relatively easy. A further interesting aspect about this algorithm is that it does not need any global communication, and therefore can be parallelized easily. Many problems can be expressed as numerical optimization problems. Especially when the dimension of the input space and the number of local optima is high these problems tend to be very difficult. In order to obtain an efficient solver one has to gather information regarding the function to be optimized. Evolution based learning can be used to obtain this information. This paper contains results obtained with the Modular Evolution Strategy and compares these results to those obtained with other evolution based method. The results look promising.
Formal verification for distributed real-time control: periodic Producer/Consumer
Authors: S. Koppenhoefer, J. Decotignie
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The Producer/Consumer (P/C) has been used to model communication in networks. The model states that in a system there is a producer of a given information and one or more consumers of this information. With this model different kinds of communication failures may occur. In this paper with the help of the adapted synchronous model (ASM), we show two methods for formally verifying the necessary conditions to avoid buffer overwrites in the P/C model. Specifically, we explore the constraints on communication parameters in distributed periodic control and more generally, we demonstrate how behavioral properties can be analyzed using formal methods.
On Supporting Weakly-Connected Browsing in a Mobile Web Environment
Authors: Hong Va Leong, Dennis McLeod, Antonio Si, Stanley M. T. Yau
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

A mobile environment is weakly connected, characterized by low communication bandwidth and poor connectivity. Conventional paradigm for surfing mobile web documents is ineffective since portions of a document could be corrupted during transmission and it is expensive to retransmit the whole document. It is important that the high content-bearing portions should be transmitted successfully so that a mobile client could at least obtain a high level content and determine if the corrupted portions need to be retransmitted.We have proposed a multi-resolution transmission paradigm, which allows higher content-bearing portions of a web document to be transmitted, by partitioning it into multiple organizational units and associating an information content with each unit. The client can explore the higher content-bearing portion earlier and terminate browsing an irrelevant document sooner.In this paper, we extend our previous work and propose a fault-tolerant multi-resolution transmission scheme, which allows units of higher information content to be recovered from transmission error. The client can obtain an overall content of a web document and either terminate the transmission of the remaining portions or decide if the corrupted portions need to be retransmitted. We demonstrate its feasibility with a prototype and with simulation results.
Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
Authors: Hoong Chuin Lau, Zhe Liang
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. Experimental results show that our approach yields very good solutions when compared with the benchmarking solutions.
An Environment for the Facilitation of Robotic Programming
Authors: Artem Lifschitz
Venue:  (1999)

I have developed, tested, and evaluated a robot programming environment organized as a library of flexible data structures to facilitate the creation of robotics programs. Abstractions are the basis of all of the achievements of Computer Science, and if it were possible to create a truly flexible, generic abstraction for the programming of robots -- the science of robotics could advance at a faster pace. For this reason, I have attempted to implement the abstraction of low-level commands, and the assembling of them into hierarchies of higher-level actions. My libraries provide mechanisms for the manipulation and queuing of actions, as well as for the timing of low-level sensing and actuation. I have tested these libraries by implementing a cooperative multi-agent formation algorithm in the SoccerServer environment. Often, when a new level of abstraction is introduced -- significant overhead is added. However, I have conducted experiments to show that there is no significant overhead in using this system by comparing the performance of SoccerServer agents that have been programmed using it against the performance of other agents. 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
Some Efficient Techniques for Simulating Memory
Authors: Peter S. Magnusson, Bengt Werner
Venue:  (1994)

We describe novel techniques used for efficient simulation of memory in SimICS, an instruction level simulator developed at SICS. The design has focused on efficiently supporting the simulation of multiprocessors, analyzing complex memory hierarchies and running large binaries with a mixture of system-level and user-level code. A software caching mechanism (the Simulator Translation Cache, STC) improves the performance of interpreted memory operations by reducing the number of calls to complex memory simulation code. A lazy memory allocation scheme reduces the size of the simulator process. A well-defined internal interface to generic memory simulation simplifies user extensions. Leveraging on a flexible interpreter based on threaded code allows runtime selection of statistics gathering, memory profiling, and cache simulation with low overhead. The result is a memory simulation that supports a range of features for use in computer architecture research, program profiling, and debugging. (NOTE: A later version was published in the 28th Annual Simulation Symposium)
Modeling coping behavior in virtual humans: don't worry, be happy
Authors: Stacy Marsella, Jonathan Gratch
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This article builds on insights into how humans cope with emotion to guide the design of virtual humans. Although coping is increasingly viewed in the psychological literature as having a central role in human adaptive behavior, it has been largely ignored in computational models of emotion. In this paper, we show how psychological research on the interplay between human emotion, cognition and coping behavior can serve as a central organizing principle for the behavior of human-like autonomous agents. We present a detailed domain-independent model of coping based on this framework that significantly extends our previous work. We argue that this perspective provides novel insights into realizing adaptive behavior.
An Adaptive Parallel Grouping Algorithm for B-WLL MAC Protocol
Authors: Min-Su Kim, Tae-Young Byun, Sun-Woo Lee, Sung-Ho Hwang, Ki-Jun Han, Sung-Jo Kim
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this paper, we propose an adaptive parallel grouping algorithm that may reduce the number of collisions and increase overall throughput of B-WLL MAC protocol. Also, we present a method for independently executing the adaptive parallel grouping algorithm to reduce the signaling traffic overheads.
An Efficient Logging Scheme for Recoverable Distributed Shared Memory Systems
Authors: Taesoon Park, Sungbok Cho, Heon Y. Yeom
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

This paper presents a new logging scheme for recoverable distributed shared memory systems. In the previous schemes, the logging is performed whenever a new data item is accessed or written by a process. However, in the proposed scheme, only the data item accessed by multiple processes is logged when it is invalidated by the overwritten. Moreover, the logging is performed at one process responsible for that data item unlike the other schemes in which every process accessing the data item performs the logging. As a result, the amount and the frequency of logging can be significantly reduced. The performance of the proposed scheme is analyzed using extensive simulation study and our new logging scheme shows superior performance in various system environments.
Classifying and Detecting Plan-Based Misconceptions
Authors: Randall J. Calistri
Venue:  (1989)

In order to maintain a truly cooperative dialogue, a natural language system must be able to recognize misconceptions in the user''s plans, and yet the diversity of mistakes that can occur makes this task appear overwhelming from the very beginning. However, it is possible to organize plan failures into fifteen different categories of plan-based misconceptions. These categories can be further simplified to five detectable types of misconceptions which only need to be checked in a narrow region of the plan hierarchy. This theory is implemented in a program called Pathfinder, which can detect misconceptions from all five simplified classes.
Active Tracking and Cloning of Facial Expressions Using Spatio-Temporal Information
Authors: Lijun Yin, Anup Basu, Matt T. Yourst
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper presents a new method to analyze and synthesize facial expressions, in which a spatio-temporal gradient based method (i.e., optical flow) is exploited to estimate the movement of facial feature points. We proposed a method (called motion correlation) to improve the conventional block correlation method for obtaining motion vectors. The tracking of facial expressions under an active camera is addressed. With the motion vectors estimated,a facial expression can be cloned by adjusting the existing 3-D facial model, or synthesized by using different facial models. The experimental results demonstrate that the approach proposed is feasible for applications such as low bit rate video coding and face animation.
Inorder Traversal of a Binary Tree and its Inversion
Authors: David Gries, Jan L. A. Van de Snepscheut
Venue:  (1987)

NOT AVAILABLE
A cognitive complexity measure for the design process
Authors: S. Sinha, A. I. Thomson, B. Kumar
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This paper shows as to how information content may be used to quantify the complexity of a design process. The results presented in this paper are based on the fact that cognitive complexity of the design process is dependent on the context, which in turn consists of a number of factors known as Complexity Generating Factors (CGF). It is shown that information content associated with 'resources' (CGF) gives an indication of the complexity within the design activity. The methodology suggested uses 'information' as a parameter for establishing complexity index to the design process. The content of information has been measured analogically using Shanon's Entropic equation used in information theory.
Checking Multi-Agent Systems Behavior Properties
Authors: Michael Dekhtyar, Alexander Dikovsky, Mars Valiev
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The complexity of checking multi-agent systems behavior properties is studied. The behavior properties are formulated using first order temporal logic languages and are checked relative to the state transition systems determined by the multi-agent system definition. Various tight complexity bounds of the behavior properties are established under natural structural and semantic restrictions on agent programs and actions. Several interesting deterministic or nondeterministic polynomial time problem classes are established.
Stabilization of cooperative information agents in unpredictable environment: a logic programming approach
Authors: Phan Minh Dung, Do Duc Hanh, Phan Minh Thang
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Stabilization of a system of information agents represents a capability to eventually get correct information. We argue that the stabilization of a system could be understood as the convergence of the behavior of the whole system toward the behavior of a "superagent", who has the sensing and computing capabilities of all agents combined. We give sufficient conditions for stabilization.
Empirical Evaluation of Hypertextual Information Access from Program Text
Authors: Jussi Koskinen
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

HyperSoft is a hypertext-based software maintenance support tool. HyperSoft provides various transient hypertextual access structures (THASs), which are formed automatically on the basis of the situation-dependent information needs of software engineers. THASs highlight the relevant parts of the program and enable nonlinear browsing between them. The system also supports various graphical views whose elements are linked to the program text. In this paper we represent the empirical results of the effects of using these hypertextual structures in relation to a set of sample information requests. The results indicate significantly better task performance as compared to using Program comprehension [6, 19, 211 is a process which aims to enhance the level of knowledge about issues which are important to the fulfillment of programming and maintenance tasks. The relation between software maintenance and program comprehension is such that typically program comprehension is needed in order to perform software maintenance tasks successfully. Although many kinds of complex software maintenance tasks and ways to categorize them exist, at the basic level most of them require information access from the program text in order to be performed