ppxscal/embedding_network huggingface dataset:
Multiagent systems as software architecture: another perspective on software engineering with multiagent systems
Authors: Danny Weyns, Tom Holvoet, Kurt Schelfthout
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The trend in agent-oriented software engineering is to consider multiagent systems (MASs) as a radically new way of engineering software. This position isolates agent-oriented software engineering from mainstream software engineering and could be one important reason why MASs are not widely adopted in industry yet.In this paper, we present another perspective on software engineering with MASs. We put forward MASs as software architecture. We give an overview of a reference architecture for situated MAS. This reference architecture extracts and generalizes common functions and structures from various applications we have studied and built. The reference architecture provides a blueprint for architectural design of MAS applications that share the come base of the systems it is derived from. Considering MASs essentially as software architecture paves the way to integration with mainstream software engineering.
Virtual ring routing: network routing inspired by DHTs
Authors: Matthew Caesar, Miguel Castro, Edmund B. Nightingale, Greg O'Shea, Antony Rowstron
Venue: ACM SIGCOMM Computer Communication Review (2006)

This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in Distributed Hash Tables (DHTs) but it does not rely on an underlying network routing protocol. It is implemented directly on top of the link layer. VRR provides both raditional point-to-point network routing and DHT routing to the node responsible for a hash table key.VRR can be used with any link layer technology but this paper describes a design and several implementations of VRR that are tuned for wireless networks. We evaluate the performance of VRR using simulations and measurements from a sensor network and an 802.11a testbed. The experimental results show that VRR provides robust performance across a wide range of environments and workloads. It performs comparably to, or better than, the best wireless routing protocol in each experiment. VRR performs well because of its unique features: it does not require network flooding or trans-lation between fixed identifiers and location-dependent addresses.
Collaboration Entities on Deterministic Finite Automata
Authors: Minjun Wang, Geoffrey Fox, Marlon Pierce
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

We have developed several types of collaborative applications. They are realizations of the Shared Event Model in Grid-base Collaboration, and examples of Peerto- Peer Grid computing. Each application type consists of collaboration entities, and they play different roles in collaboration. These entities are finite automaton-based in a collaboration session; in essence, they are just deterministic finite automata in the session. Intuitively, the entities in collaboration collaborate on events to keep showing the same output displays at each step, with one entity in controlling by capturing events, generating and sending out event messages to the others through a message broker, and the others in responding by rendering the received event messages. Specifically, they collaborate to share a common finite automaton in their respective instantiations, and reach a common state of the finite automaton at any collaboration step. Collaboration of the entities is therefore all about being in a same state of the finite automaton at each event.
Applications of a new ultimate bound on the trajectories of the Lorenz system to synchronization and estimation of the Hausdorff dimension
Authors: A. Pogromsky, G. Santoboni, H. Nijmeijer
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

In this paper a new bound on the trajectories of the Lorenz system is derived. This result is useful to show that the transverse stability of the origin in two Lorenz systems coupled in a drive-response manner is a necessary and sufficient condition for global asymptotic synchrony of the two systems. It also enables to simplify the derivation of an upper bound of the Hausdorff dimension of the Lorenz attractor.
Software engineering for large-scale multi-agent systems - SELMAS 2006: workshop report
Authors: Alessandro Garcia, Holger Giese, Alexander Romanovsky, Ricardo Choren, Ho-fung Leung, Carlos Lucena, Florian Klein, Eric Platon
Venue: ACM SIGSOFT Software Engineering Notes (2006)

This paper is intended to sum up the results of the 5th International Workshop on Software Engineering for Large-Scale Multi-Agent Systems (SELMAS 2006) held in Shanghai, China, May 22-23, 2006, as part of the 28th International Conference on Software Engineering (ICSE 2006). The main purpose of this workshop was to share and pool together the collective experience of people, both academics and practitioners, who are actively working on software engineering for large-scale multi-agent systems. A selected set of expanded workshop papers and invited papers will appear in the 5th edition of the book Software Engineering for Multi-Agent Systems (LNCS, Springer, 2007). The theme of this workshop edition was "Building Dependable Multi-Agent Systems". The workshop consisted of an opening presentation, several paper presentations organized into four technical sessions, two keynotes and two discussion groups. During the workshop we informally reviewed ongoing and previous work and debated a number of important issues. The SELMAS 2006 Web site can be found at <www.teccomm.les.inf.puc-rio.br/selmas2006>. We begin by presenting an overview of our goals and the workshop structure, and then focus on the workshop technical program and results.
Synergy of Symmetric Region Grow and Active Contour in Reconstruction of a 3D Rat
Authors: Shu-Yen Wan, Chian-Hung Hou
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The general goal of this work is modeling and reconstruction of a three-dimensional (3D) rat from a series of two-dimensional (2D) images captured from an inexpensive digital camera. We proposed a hybrid segmentation method that incorporates symmetric region grow (symRG) and active contour modeling (ACM) to robustly extract regions of interest (ROIs), such as organs, spines, and vessels. symRG is employed to enhance the segmentation performance while the edge information passed from the ACM can help prevent over-segmentation. We built a component-based software platform that includes the symRG and ACM components as well as the other image enhancement, post-segmentation processing, surface rendering components allowing the user to dynamically compose a streamlined 3D rat reconstruction procedure or script. The example dataset in this paper include 284 slices of 2D rat whole-body images. Separate scripts were used to model and visualize the body, heart, lung, stomach, and head. Few user-imposed parameters were required and the whole processing , from loading series of 2D images towards 3D rendition to demonstrate the results, is within two minutes.
Blind Wiener filtering: estimation of a random signal in noise using little prior knowledge
Authors: D. W. Tufts, A. A. Shah
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors present a method for estimating a random signal component from a data vector consisting of a piece of a narrowband random sequence corrupted with additive noise. The correlation structure of the sequence is unknown. The method is based on rank reduction principles presented by Scharf and Tufts (1987). It achieves a lower mean squared estimation error than an unbiased minimum variance estimator at the expense of introducing bias into the estimate. Its superior performance over short data records makes it useful in rapidly changing signal environments. The performance of the method is analyzed and simulations to demonstrate its effectiveness are presented.
A Novel Invisible Color Image Watermarking Scheme Using Image Adaptive Watermark Creation and Robust Insertion-Extraction
Authors: Saraju P. Mohanty, Parthasarathy Guturu, Elias Kougianos, Nishikanta Pati
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this paper we present a robust and novel strategic invisible approach for insertion-extraction of a digital watermark, a color image, into color images. The novelty of our scheme lies in determining a perceptually important sub-image in the host image so that slight tampering of the sub-image will affect the aesthetic of the host image significantly. This eliminates the possibility of watermark removal, which in turn makes the watermark secure and robust. The other novel feature of our algorithm is the creation of a compound watermark image, called effective watermark, using the input user watermark (logo) and attributes of host image, which facilitates robust insertion-extraction processes. The effective watermark creation consists of two distinct phases: In the first phase, a statistical image is synthesized from a perceptually important subimage of the host image and in the second phase, a compound image is created by fusing the input logo and synthetic statistical image. Results of exhaustive experimentation using standard benchmarks demonstrates the robustness and efficacy of our approach.
Proceedings of the 12th annual international conference on Mobile computing and networking
Venue: International Conference on Mobile Computing and Networking (2006)

It is my pleasure to welcome you to the 12th edition of MobiCom, the premier Conference on mobile computing and communications. We are happy to have this event back on the beautiful West Coast of the United States, after a very successful edition last year in Cologne, Germany. It has been my honor to serve as General Chair.We have an outstanding technical program, starting with three tutorials on three very timely topics (mobility models, delay tolerant routing and RFIDs). The main conference technical sessions feature competitively selected papers in a broad range of mobile computing topics - from sensor networks to urban meshes, cellular services and wireless foundations and models. Two internationally renowned authorities in the wireless and mobile computing fields will deliver invited speeches. Dr Andrew Viterbi, Viterbi Foundation, will be the Keynote speaker. Dr. Deborah Estrin, Professor, Computer Science Dept, UCLA, and Director of the Center for Embedded Networked Sensing (CENS) at UCLA will be the Athena Lecturer, delivering a talk on "Wireless Sensing Systems: From ecosystems to human systems". Jointly with the conference, there will be eight outstanding Workshops that deal with more specialized topics in various areas of mobile, wireless networking and computing: VANET, WISE, WMASH, WINTECH, MOBISHARE, CRAWDED, DIWANS, WUWNET. To complete the picture, there will be a Poster session, and a Student Competition session. The main theme that emerges from these diverse contributions, and the main message to our attendees, is the coming together of very different wireless technologies, from low power sensor radios to ad hoc networks, mesh and cellular networks to enable integrated, pervasive mobile computing. The synergy of these networks will provide the structure that can support and integrate emerging mobile applications ranging from mobile sensor platforms to vehicular networks and broadband mobile Internet services.
Mobile Bicycle Monitoring System
Authors: Aki Honkasuo, Arto Hamalainen, Pekka Jappinen, Juha Jaaskelainen, Jari Porras
Venue: Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications (2006)

Bicycling is a popular way both for traveling as well as for exercising. In order to monitor the exercise and to get the most out of it, the user wants to see some data. Different types of sensors exists that can be used to collect variety of data from the bicycle. These sensors as such are rather cheap but combining them to some external system, e.g. analysis server or just larger display could easily increase the price. Also the properties of the existing systems are quite poor.
Application-Tailored Cache Consistency for Wide-Area File Systems
Authors: Ming Zhao, Renato J. Figueiredo
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

The inability to perform optimizations based on application-specific information presents a hurdle to the deployment of pervasive LAN file systems across WAN environments. This paper proposes a novel approach addressing this problem through application-tailored caching and consistency in widearea file systems. It leverages widely available Network File System (NFS) deployments without any modifications to kernels nor applications, and employs middleware to dynamically establish Grid-wide Virtual File System (GVFS) sessions with application-tailored cache consistency. Two consistency models are discussed in this paper: a relaxed model based on invalidation polling, and a stronger model based on delegation and callback. Experimental evaluation based on microbenchmarks and scientific applications show that with application-tailored cache consistency, GVFS is able to both improve application runtimes and reduce server load significantly, compared to kernel-level NFS in WAN.
Augmented telexistence in smart space
Authors: Ig-Jae Kim, Sang-Yup Lee, Sang Chul Ahn, Hyoung-Gon Kim
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In this paper, we present the new environment for telexistence using our smart space which we have built for interactive space. We've developed several component modules for telexistence, such as display module for large scale display system, interaction module for multimodal interaction, video module for streaming and rendering module for augmented composition in our smart space. Those systems are well-integrated and allow for augmented telexistence functionality which is more natural and also give a beyond face-to-face communication between remote users. Based on our proposed environment, we can create new possibilities for immersive and interactive communication across the space.
Real-time data attack isolation for commercial database applications
Authors: Peng Liu, Hai Wang, Lunquan Li
Venue: Journal of Network and Computer Applications (2006)

Traditional database security mechanisms are very limited in defending against data attacks. Authorized but malicious transactions can make a database useless by impairing its integrity and availability. This paper presents the design of a real-time data attack isolation system, denoted DAIS. DAIS isolates likely suspicious actions before a definite determination of intrusion is reported. In this way, the database can be immunized from many malicious transactions. DAIS is a COTS-DBMS-specific implementation of a general isolation algorithm that we developed [Liu P, Jajodia S, McCollum CD. Intrusion confinement by isolation in information systems. Journal of Computer Security, 2000;8(4):243-79]. In this paper, the design of the first DAIS prototype, which is for Oracle Server 9.2, is discussed. DAIS uses triggers and transaction profiles to keep track of the items read and written by transactions, isolates attacks by rewriting user SQL statements, and is transparent to end users. The DAIS design is very general. In addition to Oracle, it can be easily adapted to support many other database application platforms such as Microsoft SQL Server, Sybase, and Informix.
Local Features, All Grown Up
Authors: Andrea Vedaldi, Stefano Soatto
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a technique to adapt the domain of local features through the matching process to augment their discriminative power. We start with local affine features selected and normalized independently in training and test images, and jointly expand their domain as part of the correspondence process, akin to a (non-rigid) registration task that yields a (multi-view) segmentation of the object of interest from clutter, including the detection of occlusions. We show how our growth process can be used to validate putative affine matches, to match a given "template" (an image of an object without clutter) to a cluttered and partially occluded image, and to match two images that contain the same unknown object in different clutter under different occlusions (unsupervised object detection).
Integrating Learning Objects to Business Processes
Authors: Juha Puustjarvi
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The fast development of technologies requires specialized skills that need to be renewed frequently. For example, the semantic web technologies related to knowledge centric organizations require specialized skills of the employees. In this paper, we present how such skills can be achieved by learning processes that are integrated to the tasks of the business processes of a knowledge centric organization. The gains of such learning processes are that they are just-in-time, tailored to their specific needs, and ideally integrated into day-to-day work patterns. In order to illustrate our approach we present an overview of the BPMN and show how it can be used for attaching learning objects to the business process diagram. Then we show how we attach metadata to the learning objects, called guides, and to the business process tasks. In order to standardize the used metadata items we have developed ontologies that give the semantics for the metadata items (keywords). The gain of using standardized metadata items is that it facilitates automatic integration of the learning objects and reuse of the learning objects
Localization in underwater sensor networks: survey and challenges
Authors: Vijay Chandrasekhar, Winston KG Seah, Yoo Sang Choo, How Voon Ee
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

In underwater sensor networks (UWSNs), determining the location of every sensor is important and the process of estimating the location of each node in a sensor network is known as localization. While various localization algorithms have been proposed for terrestrial sensor networks, there are relatively few localization schemes for UWSNs. The characteristics of underwater sensor networks are fundamentally different from that of terrestrial networks. Underwater acoustic channels are characterized by harsh physical layer environments with stringent bandwidth limitations. The variable speed of sound and the long propagation delays under water pose a unique set of challenges for localization in UWSN. This paper explores the different localization algorithms that are relevant to underwater sensor networks, and the challenges in meeting the requirements posed by emerging applications for such networks, e.g. offshore engineering.
On the numerical evaluation of fractional derivatives in multi-degree-of-freedom systems
Authors: André Schmidt, Lothar Gaul
Venue: Signal Processing (2006)

The numerical evaluation of fractional derivatives requires a high number of computations due to their nonlocal character. Particularly in the case of a multi-degree-of-freedom (mdof) system that is described by a fractional differential equation in time and is solved numerically by time integration, the numerical effort and the storage requirements explode. Therefore, a new method for the numerical evaluation of fractional derivatives is presented which reduces the numerical effort of mdof systems drastically. The algorithm is based on the Grünwald definition of fractional derivatives and, in contrast to some other concepts, maintains its benefits. The algorithm is applied to the equation of motion of a viscoelastic member, the properties of which are described by a fractional constitutive equation. Comparative calculations demonstrate the accuracy of the algorithm and the reduction in computation time and storage requirements.
A Novel BP Algorithm Based on Self-adaptive Parameters and Performance Analysis
Authors: Haibin Cai, Liangxu Liu, Qiying Cao
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

The standard back-propagation(BP) algorithm converges slowly and is easy to trap into local minimum, which is the main reason why it cannot be used widely in practical applications. Therefore, a new BP algorithm based on selfadaptive parameters, called the SAPBP algorithm for short, is put forward in this paper. The convergence stability is enhanced by adding the positive matrix in Hessian Matrix. The SAPBP algorithm is used in approximating nonlinear function in order to test its performance. The data of simulation experiment have proved that the improved algorithm can converges very fast and avoid trapping into local minimum. The convergence stability, also, is very good. The results demonstrate the proposed scheme is efficient, and has good performance.
A Tool for Long-Range Dependent Analysis via the R/S Statistic
Authors: Julio C. Ramirez Pacheco, Deni Torres Roman
Venue: Proceedings of the 15th International Conference on Computing (2006)

Self-similarity and long-range dependence have been found to apply as models of traffic in modern computer networks. This behavior has important implications for the design, analysis, control and performance of such networks, thus an accurate identification and quantification of such behavior is important. A novel tool for the analysis of longrange dependence via the R/S statistic is presented. The tool, R/S Analyzer, facilitates the analysis of LRD traces by providing a two-step approach for estimating the Hurst parameter. The accuracy of the tool is tested by using several synthetic and real long-range dependent traces with known Hurst parameter. A comparison of the tool against similar tools for long-range dependence analysis is performed. We show that our tool presents better estimates of the Hurst parameter and behaves better against aggregation in time.
Qualitative dynamical analysis of queueing networks with inhibition
Authors: V. Guffens, E. Gelenbe, G. Bastin
Venue: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems (2006)

An approximate dynamical extension of queueing theory result is described and is applied to Jackson's and G's Networks. It is shown that the dynamics of these networks may be represented by non-linear compartmental systems which are cooperative for the former case and may sometimes be competitive for the latter case. The implications in term of stability are discussed and an illustrative example is provided.
InteMon: continuous mining of sensor data in large-scale self-infrastructures
Authors: Evan Hoke, Jimeng Sun, John D. Strunk, Gregory R. Ganger, Christos Faloutsos
Venue: ACM SIGOPS Operating Systems Review (2006)

Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon, a prototype monitoring and mining system for data centers. It uses the SNMP protocol to monitor a new data center at Carnegie Mellon. It stores the monitoring data in a MySQL database, allowing visualization of the time-series data using a JSP web-based frontend interface for system administrators. What sets InteMon apart from other cluster monitoring systems is its ability to automatically analyze correlations in the monitoring data in real time and alert administrators of potential anomalies. It uses efficient, state of the art stream mining methods to report broken correlations among input streams. It also uses these methods to intelligently compress historical data and avoid the need for administrators to configure threshold-based monitoring bands.