ppxscal/embedding_network huggingface dataset:
A Service-oriented Approach for the Parallelization of Data-intensive Algorithms in a Grid-enabled Cluster
Authors: Chun-Wu Chen, Uwe Roehm
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We investigate how clusters and grid computing can be combined with a service-oriented architecture. An important application is the parallelization of dataintensive algorithms as they are common in life sciences, such as the sequence alignment problem. We developed a prototype of a service-oriented parallel Basic Local Alignment Search Tool (BLAST) [1]. Using a standard grid middleware, the Globus Toolkit [19], we have distributed data and logic over several cluster nodes, all of which have access to a shared database. This allows us to parallelize BLAST by combining both functional and domain decomposition. In an experimental performance evaluation, we investigate the scalability and performance of the developed BLAST service. Our results show that dataintensive algorithms can be effectively parallelized using a service-oriented approach, offering linear scalability. At the same time, our approach facilitates the sharing of functionality through a programmatic interface and further offers plug-and-play extensibility.
A Flexible Grid Framework for Automatic Protein-Ligand Docking
Authors: David Abramson, Celine Amoreira, Kim K. Baldridge, Laura Berstis, Chris Kondrick, Tom Peachey
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Many important and fundamental questions in biology and biochemistry can be better understood through investigations performed at the protein-ligand or drugreceptor level. A variety of techniques have been used over the years, and it is an area of active research. In this paper we illustrate an approach that leverages a number of different computational chemistry approaches, and combines these with non-linear optimization algorithms and grid based high performance computing platforms. The result is a very flexible, high performance method of evaluating protein-ligand interaction algorithms. We illustrate the approach by evaluating a hybrid molecular modeling and quantum theoretical based algorithm.
Artificial Agents and the Art of Persuasion
Authors: Paul Rudman, Mary Zajicek
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

We present the results of an experiment in support of our position that communication between Humans and Artificial Agents will only succeed when agents follow the unwritten rules of human social interaction. We have examined two situations of simulated human-agent interaction, where the agent interrupts with sensible but unsolicited suggestions. Our examination of the humans' reactions show the importance of not criticising people's existing view of a situation, but rather offering information to persuade them to change their view voluntarily.
Online Case-Based Learning: Design and Preliminary Evaluation of the eCASE Environment
Authors: Pantelis M. Papadopoulos, Stavros N. Demetriadis, Ioannis G. Stamelos, Ioannis A. Tsoukalas
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Case-based learning is expected to enhance students' awareness of the various contextual factors, which affect problem solving in ill structured domains. An interesting question is always how to engage students in efficient processing of the case-based learning material. In this work, we present the design and preliminary evaluation results of the eCASE environment, a generic web-based environment for supporting case-based instruction. eCASE allows instructors to develop appropriate study paths for students to criss-cross the case-based information landscape. Furthermore, it supports students' study by providing scripts, which scaffold them when processing the learning material. A script in eCASE models the cognitive processes related to context awareness and guides students to focus on important events, recall relative cases and reach useful conclusions. First evaluation results indicate that students acknowledge the learning efficiency of scripted material. However, design improvements are also necessary to make scripts more appealing and less monotonous for students.
Interactive optimization in cooperative environments
Authors: Joelma de Moura Ferreira, Hugo A. Dantas do Nascimento, Eduardo Simões de Albuquerque
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computational environment for interaction and visualization. We demonstrate its functionality by presenting a multi-user system for interactive graph drawing.
A framework for adaptive synchronization of distributed simulations
Authors: Bertan Altuntas, Richard A. Wysk
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Increased complexity of simulation models and the related modeling needs for global supply chains have necessitated the execution of simulations on multiple processors. While distributed simulation promises reduced complexity (as the result of decomposition), increased parallelism and convenient analysis of geographically distributed systems, it poses a challenging problem: synchronizing the distributed simulation federates. This paper discusses a new discrete event distributed simulation framework, which is designed with two goals in mind: (1) easy and fast development of distributed simulations and (2) efficient adaptive synchronization of simulation processes. This research uses state machine models for the automated synthesis of so called 'local synchronization agents' and an adaptive synchronization algorithm has been developed based on pacing of simulation processes using real-time. Upon completion, this scalable framework is expected to shorten the lead-time to develop distributed simulation systems with reasonable performance characteristics.
Adaptive MAC Scheme for Wireless LAN Based on Dynamic Group Constructions
Authors: Ken'ichi Yasuda, Shigeaki Tagashira, Satoshi Fujita
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In wireless LAN, several terminals could share a single communication channel by using an appropriate media access control (MAC) mechanism. However, existing MAC schemes for wireless LAN have serious drawbacks such that it significantly degrades the throughput if it frequently occurs a collision of frames or a useless assignment of communication bandwidth. In this paper, we propose a new MAC scheme for wireless LAN to realize an efficient utilization of the communication bandwidth while suppressing the probability of frame collisions. The basic idea of the scheme is to conduct a channel assignment for each group which is dynamically constructed based on the unique identifier that is assigned to each terminal beforehand. The scheme could be customized by appropriately tuning parameters according to the given communication environment. The effect of the scheme is estimated by simulation. By the result of simulations, it is confirmed that the proposed scheme could achieve a stable performance for any access frequency.
JASMINA: An observing behaviours experiment of java threads migration mechanisms over JXTA
Authors: Edgardo Ambrosi, Marco Bianchi, Carlo Gaibisso, Giorgio Gambosi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

An extended distribution of computations for multi threading Java applications, requires an extended communication infrastructure. Since large scientific communities wish to adopt the java paradigm as basis language for their resource-consuming and spaceconsuming algorithms, then wide JVM computational farms represent an important goal. We propose an interesting experiment, called JASMINA, concerning the deploying of JVMs instances on JXTA platform. JASMINA purposes is to show the first attempt to discover, aggregating and manage a wide JVM farms over JXTA platform. We discuss about the adopted embedding of JXTA paradigm into JVM architecture, and we show some observed behaviours from the effects of JXTA properties on the execution and distribution of Java applications.
Hamiltonicity in 3-connected claw-free graphs
Authors: Hong-Jian Lai, Yehong Shao, Mingquan Zhan
Venue: Journal of Combinatorial Theory Series B (2006)

Kuipers and Veldman conjectured that any 3-connected claw-free graph with order v and minimum degree δ ≥ (v+6)/10 is Hamiltonian for v sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order v, and if δ (H) ≥ (v + 5)/10, then either H is Hamiltonian, or δ(H) = (v+5)/10 and the Ryjáček's closure cl(H) of H is the line graph of a graph obtained from the Petersen graph P10 by adding (v - 15)/10 pendant edges at each vertex of P10.
Transformation invariant component analysis for binary images
Authors: Zoran Zivkovic, Jakob Verbeek
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

There are various situations where image data is binary: character recognition, result of image segmentation etc. As a first contribution, we compare Gaussian based principal component analysis (PCA), which is often used to model images, and "binary PCA" which models the binary data more naturally using Bernoulli distributions. Furthermore, we address the problem of data alignment. Image data is often perturbed by some global transformations such as shifting, rotation, scaling etc. In such cases the data needs to be transformed to some canonical aligned form. As a second contribution, we extend the binary PCA to the "transformation invariant mixture of binary PCAs" which simultaneously corrects the data for a set of global transformations and learns the binary PCA model on the aligned data.
Morse Functions for Activity Classification Using Spatiotemporal Volumes
Authors: Naresh P. Cuntoor
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Activities can be represented using spatiotemporal volumes or xyt cubes that are formed by stacking frames in a video sequence. Objects moving in the scene carve out patterns in the volume. In this paper we present an algebraic way of characterizing the topology of the volume using Morse theory. We propose a Morse function based on dynamics of moving objects and use the critical points and the associated critical values as a signature of the activity. Experiments using the TSA airport surveillance dataset are used to demonstrate the usefulness of the proposed method for activity recognition.
Efficient Evaluation of Radial Queries using the Target Tree
Authors: Michael D. Morse, Jignesh M. Patel, William I. Grosky
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper, we propose a novel indexing structure, called the target tree, which is designed to efficiently answer a new type of spatial query, called a radial query. A radial query seeks to find all objects in the spatial data set that intersect with line segments emanating from a single, designated target point. Many existing and emerging biomedical applications use radial queries, including surgical planning in neurosurgery. Traditional spatial indexing structures such as the R*-tree and quadtree perform poorly on such radial queries. A target tree uses a regular hierarchical decomposition of space using wedge shapes that emanate from the target point, resulting in an index structure that is very efficient for evaluating radial queries. We present a detailed performance evaluation of the target tree, comparing with the R*-tree and quadtree indexing methods, and show that the target tree method outperforms these existing methods by at least a factor of 2-10.
The first functional demonstration of optical virtual concatenation as a technique for achieving terabit networking
Authors: Akira Hirano, Luc Renambot, Byungil Jeong, Jason Leigh, Alan Verlo, Venkatram Vishwanath, Rajvikram Singh, Julieta Aguilera, Andrew Johnson, Thomas A. DeFanti, Lance Long, Nicholas Schwarz, Maxine Brown, Naohide Nagatsu, Yukio Tsukishima, Masahito Tomizawa, Yutaka Miyamoto, Masahiko Jinno, Yoshihiro Takigawa, Osamu Ishida
Venue: Future Generation Computer Systems (2006)

The optical virtual concatenation (OVC) function of The Terabit LAN was demonstrated for the first time at the iGrid 2005 workshop in San Diego, California. The TERAbit-LAN establishes a lambda group path (LGP) for an application where the number of lambdas/L2 connections in a LGP can be specified by the application. Each LGP is logically treated as one end-to-end optical path, so during parallel transport, the LGP channels have no relative latency deviation. However, optical path diversity (e.g. restoration) can cause LGP relative latency deviations and negatively affect quality of service. OVC hardware developed by NTT compensates for relative latency deviations to achieve a virtual bulk transport for the Electronic Visualization Laboratory's (EVL) Scalable Adaptive Graphics Environment application.
First responder information flow simulation: a tool for technology assessment
Authors: C. Donald Robinson, Donald E. Brown
Venue: Proceedings of the 37th conference on Winter simulation (2005)

New information technology is becoming available for first responders at a rapid rate. Often this new technology comes with not only new capabilities but also a high price tag. Policy makers and emergency managers need a way to assess which portfolio of technologies achieves the greatest benefit at a minimal cost. Assessing these technologies in a real world setting not only takes a long time but is also often cost-prohibitive. Thus, using computer simulation to assess the benefits of new technologies would yield significant insight into the usefulness of new technologies in a cost and time-efficient manner. A computer simulation combining an agent-based architecture and GIS information called Disaster Response Information Flow and Technology Simulator (DRIFTS) is developed to model the information flow in a disaster setting. DRIFTS, combined with a response surface methodology, can be used to assess different types of information technologies for disaster response.
Numerical estimates of local and global motions of the Lorenz attractor
Authors: B. G. Kukharenko
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

The Lorenz equations are studied numerically. It is shown that the Lorenz strange attractor can comprise attraction domains, or real-time attractors in the vicinity of a stable fixed point, and transient sets or conductors, which are related to jumps between the fixed points. It has been found that long sequences of nearly periodic stable local orbits near each stable fixed point of the Lorenz equations are real-time attractors for the Lorenz attractor. The laws of motion are revealed for these sequences of local orbits. The backbone curves are found for three universal transient processes, which represent all long sequences of local orbits of the Lorenz attractor. It has been found that the conductors of the Lorenz attractor are represented by nearly subharmonic transient process for 3 time-variables defined by the Lorenz equations. 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
Head mounted display with peripheral vision
Authors: Jin-uk Baek, Jaehoon Jung, Gerard J. Kim
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In paper, we present a new inexpensive HMD design that provides peripheral vision by attaching two small low resolution LCD's on its sides. We are currently experimenting with the design to identify the appropriate system parameters, and planning to assess the effectiveness in terms of user felt presence and task performance.
On the complexity of the DNA simplified partial digest problem
Authors: Jacek Blazewicz, Marta Kasprzak
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

The problem to be addressed is one of the genome mapping of DNA molecules. The new approach -- the Simplified Partial Digest Problem (SPDP), is analyzed. This approach is easy in laboratory implementation and robust with respect to measurement errors. In the paper, it is formulated in terms of a combinatorial search problem and proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O(n log n)-time algorithm is given, where n is a number of restriction sites.
Hybrid Control Based on Improved Radial Basis Function Network for Electro-hydraulic Servo System
Authors: Peng Yang, Jun Xu, Jie He, Lihua Liang, Guobin Li
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Because of the perturbations and disturbances of electro-hydraulic servo systems, the normal controller can't obtain good output responses under various conditions. A hybrid control strategy base on improved Radial Basis Function (RBF) network was presented for the tracking problem. An offline optimization algorithm was employed to choose the number of hidden units of RBF network. Based on the theory of optimization in groups, different online learning algorithms were used to adjust centers and estimate connection weights. The hybrid controller combined this improved RBF network with traditional PID control, and it was applied to electro-hydraulic servo system of ship test bed. Simulation results show that the servo system has good dynamic performance and nice robustness with this hybrid controller.
An Intelligent Collaborative Virtual Environment for Team Training -- A Preliminary Report
Authors: Raul A. Aguilar, Angelica de Antonio, Ricardo Imbert
Venue: Proceedings of the 15th International Conference on Computing (2006)

The Computer Supported Collaborative Learning (CSCL) is a paradigm that can be viewed as an evolution of individual learning done in Intelligent Tutoring Systems (ITS) and Learning Environments (LE) to a group learning environments. In this paper a Team Training Strategy (TTS) is decribed, which involves the use of an Intelligent Collaborative Virtual Environment (ICVE) that incorporates a Pedagogical Virtual Agent (PVA) to assist the group during the execution stage. We are developing an ICVE to support the requeriments of each phase of the TTS; in this report we describe the advances and the ongoing work of the ICVE.
Multiview Geometry for Texture Mapping 2D Images Onto 3D Range Data
Authors: Lingyun Liu, Ioannis Stamos, Gene Yu, George Wolberg, Siavash Zokai
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

The photorealistic modeling of large-scale scenes, such as urban structures, requires a fusion of range sensing technology and traditional digital photography. This paper presents a system that integrates multiview geometry and automated 3D registration techniques for texture mapping 2D images onto 3D range data. The 3D range scans and the 2D photographs are respectively used to generate a pair of 3D models of the scene. The first model consists of a dense 3D point cloud, produced by using a 3D-to-3D registration method that matches 3D lines in the range images. The second model consists of a sparse 3D point cloud, produced by applying a multiview geometry (structure-from-motion) algorithm directly on a sequence of 2D photographs. This paper introduces a novel algorithm for automatically recovering the rotation, scale, and translation that best aligns the dense and sparse models. This alignment is necessary to enable the photographs to be optimally texture mapped onto the dense model. The contribution of this work is that it merges the benefits of multiview geometry with automated registration of 3D range scans to produce photorealistic models with minimal human interaction. We present results from experiments in large-scale urban scenes.
Stochastic Reinforcement in Evolutionary Multi-Agent Game Playing of Dots-and-Boxes
Authors: Anthony Knittel, Terry Bossomaier, Mike Harre, Allan Snyder
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

An evolutionary multi-agent system is described that develops a rule-based approach to playing the game Dots and Boxes, under a probabilistic reinforcement learning paradigm. The process and behaviour using probabilistic action selection with a Boltzmann distribution is compared with an alternative technique using an Artificial Economy. The probabilistic system developed was played against a rule-based software opponent, and able to produce behaviour under a self-organising process able to perform better than the software opponent it was trained against.
Connection and stratification in research collaboration: an analysis of the COLLNET network
Authors: Yin Li-chun, Hildrun Kretschmer, Robert A. Hanneman, Liu Ze-yuan
Venue: Information Processing and Management: an International Journal (2006)

Co-authorship among scientists represents a prototype of a social network. By mapping the graph containing all relevant publications of members in an international collaboration network: COLLNET, we infer the structural mechanisms that govern the topology of this social system. The structure of the network affects the information available to individuals, and their opportunities to collaborate. The structure of the network also affects the overall flow of information, and the nature of the scientific community. We present a number of measures of both the macro- (whole-network) and micro- (actor-centered) structure of collaboration, and apply these to COLLNET. We find that this scientific community displays many aspects of a "small-world," and is somewhat vulnerable to disruption should major figures become inactive. We also find inequality in the roles played by individuals in the network. The inequalities, however, do not create a closed and isolated "core" or elite.
A Propagation of Virtual Space Information Using a Peer-to-peer Architecture for Massively Multiplayer Online Games
Authors: Shin Ito, Hiroki Saito, Hajime Sogawa, Yoshito Tobe
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

The spread of Massively Multiplayer Online Game (MMOG) which is the multiplayer playing game in virtual space via the Internet is the one of major topic in today's Internet. A typical architecture of MMOG is based on a client-server (C/S) model. Because of the traffic that concentrates at the server, the response time between the server and clients is being increased. In this paper, to overcome this problem, we propose a novel method of propagating information of clients using peer-to-peer (P2P) multicast. In the proposed method, the clients can send their information without broadcasting to each other.