ppxscal/embedding_network huggingface dataset:
A Novel Adaptive Decision Making Agent Architecture Inspired by Human Behavior and Brain Study Models
Authors: L. K. Wickramasinghe, L. D. Alahakoon
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Intelligent agent technology, which expects to combine the marked trends in history of computing such as ubiquity, interconnection, intelligence, delegation and human orientation can be considered as a step towards the next stage of artificial intelligence. This new technology attempts to reduce the gap between man and machine. The remarkable ability ofa human being to make decisions is an ongoing learning and evolutionary process. Therefore, when reducing the man-machine gap, one of the main issues to address is how to make agents decision makers in a human oriented way. The paper presents novel conceptual agent framework to provide human like decisions inspired by human behavior and brain study models. The proposed learning and evolutionary agent architecture make the agent capableof handling the dynamism in the environment too. The experiments illustrated with the banking application demonstrate how the proposed framework enables a software agent to make decisions in a human oriented manner.
DynAlloy: upgrading alloy with actions
Authors: Marcelo F. Frias, Juan P. Galeotti, Carlos G. López Pombo, Nazareno M. Aguirre
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We present DynAlloy, an extension to the Alloy specification language to describe dynamic properties of systems using actions. Actions allow us to appropriately specify dynamic properties, particularly, properties regarding execution traces, in the style of dynamic logic specifications.We extend Alloy's syntax with a notation for partial correctness assertions, whose semantics relies on an adaptation of Dijkstra's weakest liberal precondition. These assertions, defined in terms of actions, allow us to easily express properties regarding executions, favoring the separation of concerns between the static and dynamic aspects of a system specification.We also extend the Alloy tool in such a way that DynAlloy specifications are also automatically analyzable, as standard Alloy specifications. We present the foundations, two case-studies, and empirical results evidencing that the analysis of DynAlloy specifications can be performed efficiently.
PICC: A Secure Mobile Agent Framework Based on Garbled Circuit
Authors: Min Yang, Shao-yin Huang, Zhi Wang, Zunping Cheng, Dilin Mao, Chuanshan Gao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The mobile agent paradigm has revealed many security concerns: how to protect mobile agents from malicious hosts or how to protect benign hosts from baleful agents, etc. This greatly limits its proliferation in the marketplace. In this paper, we propose a novel approach named PICC (Partly IterativeCrypto-Computing) to support autonomous mobile agent to accomplish secure computation on untrusty hosts. The basic tool in PICC is garbled circuit. The main advantage of PICC is that it provides a way to evaluate a Boolean function with cipher-text input directly without decrypting them first. The output of Boolean function is also in cipher-text form and can be fed back as a new input of next round secure computation. PICC makes it possible that mobile agents move autonomously and fulfill the secure computation without interacting with the agentsý originator.
Book review: Machine Learning of Robot Assembly Plans by Arberto Maria Segre (Kluwer Academic Publishers, 1988)
Venue: Issue 109 (July 1989) (1989)

This new hard-cover book is the commercialization of a 1987 Ph.D. thesis from the Coordinated Science Lab of University of Illinois entitled "Explanation-Based Learning of Generalized Robot Assembly Plans." In 233 pages the author describes an AI experiment in the form of a computer programs called ARMS (Acquiring Robotic Manufacturing Schemata). ARMS represents the application of Explanation-Based Learning (EBL) to a restricted robot manufacturing domain. In particular, the machine learning technique of generalizing problem-solving knowledge acquired from a single example has been applied to the problem of preparing a robot to perform the novel task of assembling pieces (washers, pegs, and blocks) into well-defined mechanisms.
Adaptive equalization of time-varying MIMO channels
Authors: Mihai Enescu, Marius Sirbu, Visa Koivunen
Venue: Signal Processing (2005)

This paper addresses the problem of adaptive multiple-input multiple-output (MIMO) equalization of time-varying channels (TVC).The proposed technique is based on Kalman filtering and decision feedback equalization. The time-varying channels can be estimated and tracked using a Kalman filter type of algorithm. An equalization technique for MIMO channels is derived based on a novel decision feedback equalizer structure. Moreover, we present a method to estimate the measurement and state noise variances used by the Kalman filter because they are crucial parameters in obtaining a reliable performance.The performance of the algorithm is investigated in simulations using realistic channels generated based on the COST 207 model. The results show that the algorithm performs well even in low SNR conditions or in difficult channel conditions.
AI in engineering
Authors: D. Sriram, R. Joobbani
Venue: Issue 92 (April 1985) (1985)

The papers in this special issue were compiled from responses to the announcement in the July 1984 issue of the SIGART newsletter and notices posted over the ARPAnet. The interest being shown in this area is reflected in the sixty papers received from over six countries. About half the papers were received over the computer network.
Unsupervised Learning of Object Features from Video Sequences
Authors: Marius Leordeanu, Robert Collins
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We develop an efficient algorithm for unsupervised learningof object models as constellations of features, from low resolution video sequences. The input images typically contain single or multiple objects that change in pose, scale and degree of occlusion. Also, the objects can move significantly between consecutive frames. The content of an input sequence is unlabeled so the learner has to cluster the data based on the data's implicit coherence over time and space. Our approach takes advantage of the dependent pairwise co-occurrences of objects' features within local neighborhoods vs. the independent behavior of unrelated features. We couple or decouple pairs of features based on a probabilistic interpretation of their pairwise statistics and then extract objects as connected components of features.
An Improved RSA-Based Access Control Scheme for Hierarchical Groups
Authors: Jiali Cao, Zheng-an Yao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

We reveal some drawbacks in Ghodosi's scheme and present an improved RSA-based access control scheme for hierurchical groups. The proposed scheme enjoys the following properties: The size of an individualýs share sequence is bounded by a small constant times the size of the RSA modulus corresponding to that group. The delegation of information flow from higher-level groups to lower-level groups is completely non-interactive. doesnýt require an on-line trusted authority to upgrade the system as soon as communication happened. The proposed scheme is resistant to conspiracy
Determining the Complexity of XML Documents
Authors: Mustafa H. Qureshi, M. H. Samadzadeh
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The eXtensible Markup Language (XML) is a recommendation of the World Wide Web Consortium (W3C). It is a public format and has been widely adopted as a means of interchanging information among computer programs. With XML documents being typically large, we need to have ways of improving their ease of use and maintainability by keeping their complexity low. This research focused on different ways of determining the complexity of XML documents based on various syntactic and structural aspects of these documents. An XML document represents a generic tree. XML documents are pre-order traversal of equivalent XML trees. One of the important findings was that documents with higher nesting levels had more weights and could therefore be viewed as being more complicated as compared to the documents with lower nesting levels. Another important finding was related to Document Type Definitions (DTDs). DTDs can be expressed as regular expressions providing means for calculating quantitative values.
WebPod: persistent Web browsing sessions with pocketable storage devices
Authors: Shaya Potter, Jason Nieh
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We present WebPod, a portable system that enables mobile users to use the same persistent, personalized web browsing session on any Internet-enabled device. No matter what computer is being used, WebPod provides a consistent browsing session, maintaining all of a user's plugins, bookmarks, browser web content, open browser windows, and browser configuration options and preferences. This is achieved by leveraging rapid improvements in capacity, cost, and size of portable storage devices. WebPod provides a virtualization and checkpoint/restart mechanism that decouples the browsing environment from the host, enabling web browsing sessions to be suspended to portable storage, carried around, and resumed from the storage device on another computer. WebPod virtualization also isolates web browsing sessions from the host, protecting the browsing privacy of the user and preventing malicious web content from damaging the host. We have implemented a Linux WebPod prototype and demonstrate its ability to quickly suspend and resume web browsing sessions, enabling a seamless web browsing experience for mobile users as they move among computers.
Active versus Passive Touch in Three Dimensions
Authors: Mark A. Symmons, Barry L. Richardson, Dianne B. Wuillemin, George H. VanDoorn
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Active subjects freely explored virtual threedimensional geometric shapes using a Phantom forcefeedback device. Each active subjectýs movements were used to guide a passive subject over the same stimuli. In Experiment 1 the active subjectýs movements were recorded and "played back" to the passive counterpart at a later time ¿ a delayed yoking. Two Phantoms were used in Experiment 2 so that as the active subject explored, the passive subject was guided simultaneously along the same movement pathway. Active exploration yielded significantly shorter latencies than did passive-guided exploration.
UTOPIA&mdash; <und>u</und>ser-friendly <und>t</und>ools for <und>op</und>erating <und>i</und>nformatics <und>a</und>pplications: Conference Reviews
Authors: S. R. Pettifer, J. R. Sinnott, T. K. Attwood
Venue: Comparative and Functional Genomics (2004)

Bioinformaticians routinely analyse vast amounts of information held both in large remote databases and in flat data files hosted on local machines. The contemporary toolkit available for this purpose consists of an ad hoc collection of data manipulation tools, scripting languages and visualization systems; these must often be combined in complex and bespoke ways, the result frequently being an unwieldy artefact capable of one specific task, which cannot easily be exploited or extended by other practitioners. Owing to the sizes of current databases and the scale of the analyses necessary, routine bioinformatics tasks are often automated, but many still require the unique experience and intuition of human researchers: this requires tools that support real-time interaction with complex datasets. Many existing tools have poor user interfaces and limited real-time performance when applied to realistically large datasets; much of the user's cognitive capacity is therefore focused on controlling the tool rather than on performing the research. The UTOPIA project is addressing some of these issues by building reusable software components that can be combined to make useful applications in the field of bioinformatics. Expertise in the fields of human computer interaction, high-performance rendering, and distributed systems is being guided by bioinformaticians and end-user biologists to create a toolkit that is both architecturally sound from a computing point of view, and directly addresses end-user and application-developer requirements. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Surfing the net for software engineering notes
Authors: Mark Doernhoefer
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Remember the good old days when your computer science professor assigned you a programming task that required you to turn in the source code (usually FORTRAN) and a flowchart? You'd run off, code up the assignment, get it to run correctly, then go back and write up the flowchart to match the program. That's how most of us learned to design software.
Keyword Search in DHT-Based Peer-to-Peer Networks
Authors: Yuh-Jzer Joung, Chien-Tse Fang, Li-Wei Yang
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these problems, and in which object insert, delete, and search can be efficiently performed. Some experimental results are also presented to support our claim.
On hardware for scientific computation
Authors: Charles B. Dunham
Venue: ACM SIGNUM Newsletter (1972)

W. J. Cody (SIGNUM Newsletter, January 1971, pp. 16--31) and others have been working on finding desirable characteristics of hardware for scientific computation. The author is somewhat skeptical of the value of this, in view of the following facts. First, manufacturers have a large investment in software for their current machines and are, therefore, reluctant to make any change which would require a major change to the software. Secondly, machines are used for many other purposes and manufacturers may feel that there will be more payoff in making improvements in other areas. Thirdly, numerical analysts are rarely consulted in the acquisition of new machines. It seems to the author that much more would be gained by the following two steps. First, a rating scheme might be developed which rates the ability of a given machine to do scientific computation. If this rating scheme is widely used in the acquisition of machines, incentive will be given to the manufacturers to improve their products. Secondly, it would be useful to have papers given by <u>users</u> of a given machine which list problems in use of the machine, bad points of the machine, tricks in getting around problems or bad points, good points of the machine, tricks for improving efficiency at the assembly language or FORTRAN level, and desirable modifications to that machines hardware. In particular, the problem of efficiently multiply or dividing by a power of the base is of interest: it should be noted that on some machines multiplying by a power of the base does not always give the true answer. In case the base is 2, special methods for halving a number are also of interest. By far the best study of machines to date is W. J. Cody's "The Influence of Machine Design on Numerical Algorithms", (Spring Joint Computer Conference, 1967, 305-309).
The sampling lens: making sense of saturated visualisations
Authors: Geoffrey Ellis, Enrico Bertini, Alan Dix
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Information visualisation systems frequently have to deal with large amounts of data and this often leads to saturated areas in the display with considerable overplotting. This paper introduces the Sampling Lens, a novel tool that utilises random sampling to reduce the clutter within a moveable region, thus allowing the user to uncover any potentially interesting patterns and trends in the data while still being able to view the sample in context. We demonstrate the versatility of the tool by adding sampling lenses to scatter and parallel co-ordinate visualisations. We also consider some implementation issues and present initial user evaluation results.
An adaptive method with rigorous error control for the Hamilton-Jacobi equations: part I: The one-dimensional steady state case
Authors: Bernardo Cockburn, Bayram Yenikaya
Venue: Applied Numerical Mathematics (2005)

In this paper, we introduce a new adaptive method for finding approximations for Hamilton-Jacobi equations whose L∞-distance to the viscosity solution is no bigger than a prescribed tolerance. This is done on the simple setting of a one-dimensional model problem with periodic boundary conditions. We consider this to be a stepping stone towards the more challenging goal of constructing such methods for general Hamilton-Jacobi equations. The method proceeds as follows. On any given grid, the approximate solution is computed by using a well-known monotone scheme; then, the quality of the approximation is tested by using an approximate a posteriori error estimate. If the error is bigger than the prescribed tolerance, a new grid is computed by solving a differential equation whose devising is the main contribution of the paper. A thorough numerical study of the method is performed which shows that rigorous error control is achieved, even though only an approximate a posteriori error estimate is used; the method is thus reliable. Furthermore, the numerical study also shows that the method is efficient and that it has an optimal computational complexity. These properties are independent of the value of the tolerance. Finally, we provide extensive numerical evidence indicating that the adaptive method converges to an approximate solution that can be characterized solely in terms of the tolerance, the artificial viscosity of the monotone scheme and the exact solution.
Noninterference through flow analysis
Authors: Kohei Honda, Nobuko Yoshida
Venue: Journal of Functional Programming (2005)

This paper proposes new syntactic inference rules which can directly extract information flow in a given typed process in the &pi;-calculus. In the flow analysis, a flow in a process is captured as a chain of possible interactions which transform differences in behaviours from one part of its interface to another part of its interface. Polarity in types plays a fundamental role in the analysis, which is elucidated via examples. We show that this inductive flow analysis can be used for giving simple proofs of noninterference in the secrecy analyses for the &pi;-calculus with linear&#x002F;affine typing, including its concurrent, stateful extensions.
Resilient-optimal interactive consistency in constant time
Authors: Michael Ben-Or, Ran El-Yaniv
Venue: Distributed Computing (2003)

For a complete network of n processors within which communication lines are private, we show how to achieve concurrently many Byzantine Agreements within constant expected time both on synchronous and asynchronous networks. As an immediate consequence, this provides a solution to the Interactive Consistency problem. Our algorithms tolerate up to (n - 1)/3 faulty processors in both the synchronous and asynchronous cases and are therefore resilient-optimal.In terms of time complexity, our results improve a time bound of O(log n) (for n concurrent agreements) which is immediately implied by the constant expected time Byzantine Agreement of Feldman and Micali (synchronous systems) and of Canetti and Rabin (asynchronous systems). In terms of resiliency, our results improve the resiliency bound of the constant time, O(4√n)-resilient algorithm of Ben-Or.An immediate application of our protocols is a constant expected time simulation of simultaneous broadcast channels over a network with private lines.
A Byzantine Resilient Multi-Path Key Establishment Scheme and Its Robustness Analysis for Sensor Networks
Authors: Dijiang Huang, Deep Medhi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Random key predistribution and pairwise key establishment schemes have been proposed for key management in large-scale sensor networks. In these schemes, after being deployed, sensors set up pairwise keys via preinstalled keys. The key establishment schemes are vulnerable to Byzantine attacks, i.e., packet dropping or altering. To counter these attacks, we propose a Byzantine resilient multi-path key establishment scheme that uses the Reed-Solomon errorcorrect coding scheme to improve resilience to Byzantine attacks. Our proposed scheme can tolerate at most t faulty key paths, where t = (n - k)/2 when (n, k) Reed-Solomon error-correct coding scheme is used. In addition, by using the Reed-solomon coding scheme, sensors can identify the faulty paths with minimal communication overhead.
A Novel Approach to Real-Time RTI Based Distributed Simulation System
Authors: Azzedine Boukerche, Kaiyuan Lu
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

HLA, a DoD high level architecture, is emerging as a standard platform for large-scale distributed interactive simulation systems. It mainly emphasizes on the reusability and interoperability of different simulation components. HLA was well designed and has been proved to have the ability to guarantee the desirable properties of reusability and the interoperability in distributed simulation systems from several aspects. However, HLA shows an apparent weakness when it comes to real-time simulation applications. Indeed, there are no specific rules provided with respect to real-time applications in HLA specifications. Therefore, there has not been any widely accepted real-time implementation specification for the HLA Run-Time Infrastructure (HLA-RTI). In this paper, we propose a novel real-time RTI architecture which addresses the weakness of HLA/RTI in terms of real-time applications. We discuss our design and the implementation of our real-time RTI architecture with an emphasis on the real-time RTI end-system.
Online customization with configurable standard models
Authors: Hyun Jung Lee, Jae Kyu Lee
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In electronic catalogs, commodities like computers and electronic equipment are specified as standard models even though a variety of possible alternative specifications can exist as a combination of selected options; therefore, customized configurations are essential to support various customers with individual needs. So the problem here is the selection of a standard model and reconfiguration with this selected model. An issue is that requirements may be fulfilled by more than one standard model. To develop an algorithm that can find the near minimum price without causing unacceptable computation effort, we devised the Standard Model Selection and Modification (SMSM) Algorithm. To establish the SMSM Algorithm, we propose the Concurrent Local Propagation procedure complemented with pruning capability owing to the nature of standard models. The effective strategies for selection of seed variables and stopping rules are devised through comparative experiments.