ppxscal/embedding_network huggingface dataset:
Graded Functional Activation in the Visuospatial System with the Amount of Task Demand
Authors: P. A. Carpenter, M. A. Just, T. A. Keller, W. Eddy, K. Thulborn
Venue: Journal of Cognitive Neuroscience (1999)

Two studies examined how the amount and type of computational demand are related to fMRI-measured activation in three bilateral cortical regions involved in the Shepard-Metzler (1971) mental-rotation paradigm. The amount of demand for the computation of visuospatial coordinates was manipulated by presenting mental rotation problems with increasing angular disparity (0, 40, 80, or 120&deg;). Activation in both the left and right intraparietal sulcal regions increased linearly with angular disparity in two separate studies. Activation also occurred in the fusiform gyrus and inferior temporal regions, regions that are primarily associated with the processes of object and object-part identification. By contrast, the demand for object recognition and rotation processes was relatively low, and the demand for executing saccades was high in a control condition that required making a systematic visual scan of two grids. The grid-scanning condition resulted in relatively less activation in the parietal and inferior temporal regions but considerable activation in frontal areas that are associated with planning and executing saccades, including the precentral gyrus and sulcus into the posterior middle frontal region.These data suggest that the amount of activation in the various cortical regions that support visuospatial processing is related to the amount, as well as to the type, of computational demand.
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
Authors: Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics: (1) it is false-name-proof, (2) each winner is included in a Pareto efficient allocation, and (3) as long as a Pareto efficient allocation is achieved, the protocol is robust against the collusion of losers and the outcome is in the core. As far as the authors are aware, the GM-SMA is the first protocol that satisfies all three of these characteristics.The basic ideas of the GM-SMA are as follows: (i) It is based on the VCG protocol, i.e., the payment of a winner in this protocol is identical to the payment in one instance of the Groves mechanism, which is a class of protocols that includes the VCG. (ii) When calculating the payment of a bidder, we approximate the valuations of other bidders by using a submodular valuation function (submodular approximation). Simulation results show that the GM-SMA achieves a better social surplus and seller's revenue than existing false-name-proof protocols, as long as the submodular approximation is close enough to the original valuations.
Identifying Transcription Factor Binding Sites in Promoters of Human Genes
Authors: Wei Shi, Wanlei Zhou
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Transcription factor binding sites play an important role in the regulation of gene expression. This study develops a different computational approach to discover putative TFBSs in 17407 human promoters. 89 8-mer sequences are discovered from this research, including 12 new putative TFBSs. All these 12 putative TFBSs show peaks at the location upstream from TSS. 30 out of 89 sequences were also discovered by FitzGerald et al.(FitzGerald et al. 2004), 63 out of 89 sequences match the motifs discovered by Xie et al.(Xie et al. 2005) and 20 out of 89 sequences match the TRANSFAC motifs built from TRANSFAC database by Xie et al. The only predicted TFBS by FitzGerald is verified by our research.
Design of Knowledge Management Learning System based on Service-Oriented Architecture
Authors: Wan-Jen Chang, Hsuan-Hung Chen, Hui-Kai Su, Yuan-Sun Chu, Kim-Joan Chen
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper, we propose a framework of Knowledge Management Learning System (KMLS) for adult education based on a learning process and a Service- Oriented Architecture (SOA). Accordingly, this paper presents a case example to describe how to aid adult learning and making e-Learning more effective according to the principles of constructivism, knowledge management (KM) and the characteristics of adult learning and lifelong learning.
Evidence That Autobiographic Memory Retrieval Does Not Become Independent of the Hippocampus: An fMRI Study Contrasting Very Recent with Remote Events
Authors: P. V. Rekkas, R. Todd Constable
Venue: Journal of Cognitive Neuroscience (2005)

Traditional consolidation theory, which seeks to explain how new memories are incorporated into the preexisting neural architecture, stipulates that the hippocampus plays a time-limited role in this process. However, although there is abundant research showing that the hippocampus is necessary for the initial (encoding) phase, there is very little experimental evidence with human subjects proving that the structure ceases to play a role in the retrieval of episodic items from memory stores. To test this hypothesis, we investigated recall activation associated with recent memories (2.5 days) versus remote memories (mean of 8 years) using functional magnetic resonance imaging. In accordance with the multiple memory trace theory, recall of consolidated autobiographic information, represented by the remote condition, was not independent of the hippocampus. Both types of memory retrieval produced significant activation in parahippocampal, prefrontal, and midtemporal gyri, the parietal&ndash;temporal junction, and a medial region of cortex spanning the posterior cingulate and precuneus gyri. However, where recent events activated bilateral regions of the caudate nucleus, remote events yielded significantly greater activation within the hippocampus proper. The results challenge traditional consolidation theory, which would predict greater hippocampal activity for recent events. Furthermore, they highlight the interplay between multiple memory systems in the brain. We argue that our particular question format, which encouraged depth of recall and did not require a prescan interview, as well as our delineation of the recent and remote time periods, were the determining factors for the observed pattern of hippocampal activation.
Mining UnstructuredWeb Pages to EnhanceWeb Information Retrieval
Authors: Hsin-Chang Yang, Chung-Hong Lee
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

One major approach for information finding in the WWW is to navigate through some web directories and browse them for the goal pages. However, such directories are generally constructed manually and have disadvantages of narrow coverage and inconsistency. In this work, we propose a machine learning approach that automatically constructs a navigational structure for the WWW to help information finding. A self-organizing map is constructed to train the web pages and obtain two feature maps, which reveal the relationships among web pages and thematic keywords respectively. We then use these maps to develop a structure that may assist the users finding the information they need. We used a small set of web pages in the experiments and obtained promising result.
Mission Operations Planning: Beyond MAPGEN
Authors: John L. Bresina, Paul H. Morris
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

The MAPGEN system was deployed in the Mars Exploration Rover mission as a mission-critical component of the ground operations system. MAPGEN, which was jointly developed by ARC and JPL, represents a successful mission infusion of planning technology. The MER mission has operated spectacularly for over two years now, and we have learned valuable lessons regarding application of mixedinitiative planning technology to mission operations. These lessons have spawned new research in mixedinitiative planning and have influenced the design of a new ground operations system, called ENSEMBLE, that is base-lined for the Phoenix and Mars Science Laboratory missions. This paper discusses some of the lessons learned from the MER mission infusion experience and presents a preliminary report on these subsequent developments.
Research on Grid-Based Traffic Simulation Platform
Authors: Jiankun Wu, Linpeng Huang, Jian Cao, Minglu Li, Xin Wang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

With the improvement of the traffic complexity extent, the solution of traffic problems becomes more and more difficult in the reality, so traffic simulation is an effective method for analyzing the traffic states and problems. As the simulation area becomes larger and more complicate, which requires large computing and storage resources, it can't be resolved by the traditional computing technology. Due to grid technology's advantages on such aspects, a new simulation architecture named GHA, which implements the HLA's [4] component as grid service and combined with the agent technology is presented in this paper. Thus the simulation architecture can offer high-capable computing resources to solve the complex traffic issues with great expansibility and flexibility; moreover, it also makes solid foundation to the authenticity of traffic simulation by adopting agent model the character of traffic entity. At last, a traffic simulation platform is implemented based on GHA and the performance tests are given.
Explor@Graph Scenarios Editor - Designing a Collaborative Task
Authors: Aude Dufresne
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The Explor@Graph system is tool where scenarios are designed as conceptual graphs, and used as an LMS. It is integrated to a forum for collaborative tasks.
Assume-Guarantee Reasoning for Deadlock
Authors: Sagar Chaki, Nishant Sinha
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We extend the learning-based automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm L^F that constructs the minimal deterministic failure automaton accepting any unknown regular failure set using a minimally adequate teacher. We show how L^F can be used for compositional regular failure language containment, and deadlock detection, using non-circular and circular assume guarantee rules. We present an implementation of our techniques and encouraging experimental results on several non-trivial benchmarks.
A Locality-Aware Cooperative Cache Management Protocol to Improve Network File System Performance
Authors: Song Jiang, Fabrizio Petrini, Xiaoning Ding, Xiaodong Zhang
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

In a distributed environment the utilization of file buffer caches in different clients may vary greatly. Cooperative caching is used to increase cache utilization by coordinating the usage of distributed caches. Existing cooperative caching protocols mainly address organizational issues, paying little attention to exploiting locality of file access patterns. We propose a locality-aware cooperative caching protocol, called LAC, that is based on analysis and manipulation of data block reuse distance to effectively predict cache utilization and the probability of data reuse. Using a dynamically controlled synchronization technique, we make local information consistently comparable among clients. The system is highly scalable in the sense that global coordination is achieved without centralized control.
Is it Now Time to Establish Visualization Science as a Scientific Discipline?
Authors: Remo Burkhard
Venue: Proceedings of the conference on Information Visualization (2006)

It is now time to establish Visualization Science as a scientific discipline. The proposed deadline to achieve this is 2010. Today, research areas in visualization are isolated. What is missing is the big picture and mutual agendas. To establish Visualization Science as a discipline, researchers need to agree on the origins and areas of visualization research; then on the long-term (e.g., 2020) research goals. The benefit of an established discipline is more impact, both in teaching (curricula) and research (e.g., Framework Programmes of the European Union). This article aims to start the discussion on a synthesis through extended definitions and a big picture. It provides an example for a sharp and extended definition of a field that today is vaguely defined: Information Architecture. Finally, it proposes a draft of the big picture of the fields, the Visualization Science Fingerprint, thus a step towards an established Visualization Science.
The virtual site museum: a multi-purpose, authoritative, and functional virtual heritage resource
Authors: Young-Seok Kim, Thenkurussi Kesavadas, Samuel M. Paley
Venue: Presence: Teleoperators and Virtual Environments (2006)

The Virtual Site Museum is an interactive virtual reality interface for various purposes including archaeological research, education, and public demonstration. Its virtual environment contains precise, authoritative, and integrated archaeological and historical files culled from published and unpublished excavation records and the various art museums, which preserve artifacts from the real archaeological site. Running in real-time, it provides full-body immersion, 3D ancient figure animation, and a virtual artifacts interface and corresponding user-oriented interactions in a functional virtual environment. The first of the sites to be documented in the Virtual Site Museum was the Northwest Palace of King Ashurnasirpal II (883-859 BC), located in northeastern Iraq, a famous Assyrian world heritage archaeological site. In this paper we describe how we applied Virtual Reality (VR) to a cultural heritage in peril, and how we are adapting previously generated PC versions to UNIX platforms. We also explain our experiences and achievements in archaeological research and classroom accessibility.
Implementing the high level architecture in the Virtual Test Bed
Authors: José Sepúlveda, Luis Rabelo, Jaebok Park, Frank Riddick, Cary Peaden
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Virtual Test Bed (VTB) is a prototype of a virtual engineering environment to study operations of current and future space vehicles, spaceports, and ranges. The High-Level Architecture (HLA) as defined by the Department of Defense (DoD), is the main environment. The VTB/HLA implementation described here represents different systems that interact in the simulation of a Space Shuttle liftoff. This example implementation displays the collaboration of a simplified version of the Space Shuttle Simulation Model and a simulation of the Launch Scrub Evaluation Model. Spaceports and ranges are complex systems. This VTB framework is a collaborative computing environment that integrates in a seamless fashion simulation models that represent the different stages in the lifecycle of a complex system. A complex system is a non-linear system of systems whose interactions bring together interesting emergent properties that are very difficult to visualize and/or study by using the traditional approach of decomposition.
Blind Watermarking Based on the Wavelet Transform
Authors: Jui-Cheng Yen, Hun-Chen Chen, Jui-Hsiang Juan
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

This paper proposes a blind watermarking scheme based on the wavelet transform. We generate a pseudo-random sequence by an 1D logistic map as operands and control codes. The original image is decomposed into ten subbands by the 3-level wavelet transform and the original watermark is transformed into a noise watermark. Then, the noise watermark is used to replace the third or fourth bit of the integer part of the absolute values of wavelet coefficients in LH3 or HL3 randomly. Simulation results indicate 1) the proposed scheme can resist JPEG2000 compression attack with compression ratio above 10.31; 2) the PSNRs of the watermarked images are larger than 43; 3) the performance of the proposed scheme is better than an existing scheme.
On Cache Coherency and Memory Consistency Issues in NoC Based Shared Memory Multiprocessor SoC Architectures
Authors: Frederic Petrot, Alain Greiner, Pascal Gomez
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The concept of network on chip (NoC) is a recent breakthrough in the system on chip (SoC) design area. A lot of work has been done to define efficient NoC architectures and implementations. In this paper, our goal is twofold. Firstly, we want to outline that the use of a NoC based sharedmemory multiprocessor SoC challenges the application integrator because of the underlying assumptions of software, namely cache coherency and memory consistency. These problems are well known in general purpose shared memory multiprocessors. However, when designing a SoC, we benefit on the one hand from the knowledge of the applications, the much simpler usage of virtual memory, lower interconnect latencies and very high bandwidth at lost cost, but on the other hand we suffer from more tight design constraints (yield, power, predictable performances, ...). Secondly, we define simple and yet attractive solutions -in term of design time and hardware cost- to both problems in the context of application specific multiprocessor SoCs.
Determinants of IP Version 6 Adoption
Authors: Anat Hovav, Yoo Jung Kim
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The implementation of a new Internet standard such as IPv6 depends on the usefulness of the technology to the adopting organizations and the environment in which they operate. The adoption of IPv6 in Korea is mostly driven by a governmental strategy that created high network externalities and developed related technologies. However, the speed of adoption is hindered due to lack of information and limited perceived business value.
Distributed policy processing in active-service based infrastructures: Research Articles
Authors: Wei Yu, Sriram Chellappan, Dong Xuan, Wei Zhao
Venue: International Journal of Communication Systems (2006)

More and more applications in the Internet are requiring an intelligent service infrastructure to provide customized services. In this paper, we present an infrastructure, which can transparently and effectively provide customized active-services to end users and dynamically adapt to changing customized policies in large distributed heterogeneous environments. The infrastructure consists of two components: the policy agent and middleware box. Particularly, our technologies include: (1) Generic active-service based infrastructure, where the policy agent can integrate policies requested by applications, and middleware boxes can transparently execute services and (2) Distributed policy processing in the middleware box. We study two policy partitioning schemes to achieve conflict-free policies for distributed policy processing and guarantee the correctness of the policy execution. We conduct extensive performance evaluations on different schemes proposed. Our experimental results demonstrate that our policy partitioning schemes can effectively generate partition-capable and conflict-free policy sets. The evaluation results also show that distributed policy processing can achieve over 70&percnt; increase in performance&#x002F;price ratio with proper assignment of the policy distribution degree compared to a purely centralized approach. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Cascade Scheme for Concurrent Errors Detection
Authors: Ilya Levin, Vladimir Ostrovsky, Osnat Keren, Vladimir Sinelnikov
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The paper deals with synthesis technique for designing circuits with cascade errors detection. The proposed technique is based on partitioning a scheme into a number of cascades followed by parity checking their output logic. The algorithm for partitioning the scheme into cascades is provided. An universal scheme of Finite State Machine (FSM) with the cascade errors detection is presented and investigated. The scheme does not require any redundant coding variables. Benchmark results are presented and show significantly low overhead requirement.
An adaptive clustering for multiple object tracking in sequences in and beyond the visible spectrum
Authors: Severine Dubuisson
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper, we propose a method to track multiple deformable objects in sequences (with a static camera) in and beyond the visible spectrum by combining Gabor filtering and clustering. In a first step, a set of Gabor filter banks is used to filter the difference image between two consecutive frames. Then, the moving areas are sampled by randomly positioning particles in high magnitude area of the filtered image. Finally, these points are clustered to obtain one class for each moving object. The novelty in our method is in using cluster information from the previous frame to classify new particles in the current frame. This makes our method robust to occlusions, objects entering and leaving the field of view, objects stopping and starting, and moving objects getting really close to each other.
Reflective Hierarchical State-Machines for Self-Adaptable Distributed Transaction Coordination
Authors: Yan Wang, Weihai Yu
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Current transaction processing systems often lack the desired property to adapt their behavior to the ever-changing environment and the run-time context. Concerning a particular application domain, there could be various extended transaction coordination models, each focusing on solving specific problems. However, they are usually not targeted to manage the complicated situations with a mixture of these problems. Providing an overall transaction model for such mixture of problems is impractical, if not impossible. Our solution to this challenging issue is to build a self-adaptable transaction coordination framework. Rather than providing yet another transaction model, this framework hosts different transaction coordination protocols in the existing transaction patterns, and makes them adaptable according to the changing application context. Transaction coordination systems can choose their desired transaction patterns at the beginning of transactions, or switch their patterns at run-time if necessary. To make this possible, a formal hierarchical state-machine is incorporated into the framework, and reflection method is adopted. Experimentation of this framework is based on J2EE Activity Services. Mobile transaction coordination scenario is used throughout the paper as an illustration of how the framework may be applied practically.