ppxscal/embedding_network huggingface dataset:
Motor Learning of Compatible and Incompatible Visuomotor Maps
Authors: Scott T. Grafton, Joanna Salidis, Daniel B. Willingham
Venue: Journal of Cognitive Neuroscience (2001)

Brain imaging studies demonstrate increasing activity in limb motor areas during early motor skill learning, consistent with functional reorganization occurring at the motor output level. Nevertheless, behavioral studies reveal that visually guided skills can also be learned with respect to target location or possibly eye movements. The current experiments examined motor learning under compatible and incompatible perceptual/motor conditions to identify brain areas involved in different perceptual&ndash;motor transformations. Subjects tracked a continuously moving target with a joystick-controlled cursor. The target moved in a repeating sequence embedded within random movements to block sequence awareness. Psychophysical studies of behavioral transfer from incompatible (joystick and cursor moving in opposite directions) to compatible tracking established that incompatible learning was occurring with respect to target location. Positron emission tomography (PET) functional imaging of compatible learning identified increasing activity throughout the precentral gyrus, maximal in the arm area. Incompatible learning also led to increasing activity in the precentral gyrus, maximal in the putative frontal eye fields. When the incompatible task was switched to a compatible response and the previously learned sequence was reintroduced, there was an increase in arm motor cortex. The results show that learning-related increases of brain activity are dynamic, with recruitment of multiple motor output areas, contingent on task demands. Visually guided motor sequences can be linked to either oculomotor or arm motor areas. Rather than identifying changes of motor output maps, the data from imaging experiments may better reflect modulation of inputs to multiple motor areas.
DMDC: Delayed Memory Dependence Checking through Age-Based Filtering
Authors: Fernando Castro, Luis Pinuel, Daniel Chaver, Manuel Prieto, Michael Huang, Francisco Tirado
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-order execution of memory instructions. Traditional CAM-based associative queues can be very slow and energy hungry. In this paper we introduce two new management schemes. The first one is a filtering scheme based on simple age-tracking. This scheme can easily avoid 95-98% of associative load queue (LQ) searches using only a few registers. This translates into significant power savings. More importantly, however, this filtering makes our second scheme, Delayed Memory Dependence Checking (DMDC), practical. With a small hash table, DMDC completely avoids the need for an associative LQ and relies on indexing-based checking at the commit phase and hence cuts the energy spent on LQ by an average of 95%. At an average of about 0.3%, the performance impact is negligible. When the energy cost of the increased execution time is factored in, the processor still makes net energy savings of about 3-8%, depending on the configuration and the applications.
Document Retrieval in Pen-Based Media Data
Authors: Sascha Schimke, Claus Vielhauer
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The rise of devices with pen as the primary input option (personal digital assistants and Tablet PCs) or specially equipped ink pens for capturing scripture on paper will produce large amounts of handwritten or hand drawn documents. In this paper we describe a prototype implementation of a search system for this kind of pen-based documents without involving character recognition. Although in the last years handwriting recognition systems experienced large performance improvements, they lack in situations of drawing recognition and for people, having a very unclear script style. Our algorithm for handwriting retrieval achieves in database tests with 59 documents from twelve users a performance of about 81% recall and precision rate.
On process-algebraic verification of asynchronous circuits
Authors: X. Wang, M. Kwiatkowska
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

This paper develops a theoretical basis for using process algebra and associated model checking tools to verify asynchronous circuits. We extend existing verification theory for asynchronous circuits, and integrate it into the framework of standard process algebra theory. Our theory permits analysis of safeness (i.e. choke) and progress (i.e. illegal stop, divergence and relative starvation) conditions. We show how the model can be translated into CSP, and how the satisfaction of safeness and progress requirements can be reduced to refinement checks in CSP.
A New Genetic Algorithm for Loop Tiling
Authors: Saeed Parsa, Shahriar Lotfi
Venue: The Journal of Supercomputing (2006)

Tiling is a known problem especially in the field of computational geometry and its related engineering branches. In fact, a tile is a set of points in the Cartesian space. The goal is to partition the space of the points as tiles with optimal dimensions and shapes such that a number of predefined semantic relations holds amongst the tiles. So far, this problem has been solved in special cases with two or three dimensions. The problem of determining the optimal tile is an NP-Hard problem. Presenting a novel constraint genetic algorithm in this paper, we have been able to solve the tiling problem in Cartesian spaces with more than two dimensions, for the loop parallelization problem.
Cell Multiprocessor Communication Network: Built for Speed
Authors: Michael Kistler, Michael Perrone, Fabrizio Petrini
Venue: IEEE Micro (2006)

Multicore designs promise various power-performance and area-performance benefits. But inadequate design of the on-chip communication network can deprive applications of these benefits. To illuminate this important point in multicore processor design, the authors analyze the Cell processor's communication network, using a series of benchmarks involving DMA traffic patterns and synchronization protocols.
Security in sensor networks: industry trends, present and future research directions
Authors: Adrian Perrig
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

Security is of critical importance for the successful deployment of sensor networks, since it can ensure properties such as data integrity, secrecy, and availability. We have the unique opportunity to ensure security even for early deployments of sensor networks, which could avoid alarming news articles and help fend off corporate and consumer security and privacy fears. In this talk, I will discuss the most important security issues in sensor networks, present realistic attacker models, comment on industry trends for achieving security, and highlight present and future research directions.
Identification of parametric linear models with cyclostationary inputs
Authors: S. Prakriya, D. Hatzinakos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Identification of non-parametric linear systems with cyclostationary inputs has received considerable attention in recent years. However, identification of parametric linear models has received very little attention. In this paper, some methods are proposed for identification of moving average (MA) and autoregressive moving average (ARMA) linear models with fractionally spaced data input using only the output sequence. It is shown that q-length MA and MA part of ARMA can be identified using only q points of the cyclic autocorrelation provided it is nonzero at two or more incommensurate cycle frequencies. This can be ensured by using the sum of cycle frequency separated signals or by using signals with a low frequency pilot. Computer simulations are presented to support the methods.
Robust Estimation of Background for Fixed Cameras
Authors: Aristodemos Pnevmatikakis, Lazaros Polymenakos
Venue: Proceedings of the 15th International Conference on Computing (2006)

This paper proposes a robust background estimator for fixed cameras, to be used for foreground segmentation in tracking systems. The estimator is based on a variation of Stauffer's dynamic background algorithm, where the background learning rate is spatiotemporally adapted. The adaptation is based on the position, size and velocity of the various foreground objects already detected. The evidence for the initialization and tracking of the foreground objects is obtained by combining a pixel map showing the temporal persistence of each image pixel and the edge binary image. The spatiotemporal adaptation of the learning rate overcomes the problem of fading immobile or slowly moving objects into the background encountered in all to-date variations of Stauffer's algorithm, while the combination with edge information allows for objects already present in the scene at startup time and new objects to be treated by the same image processing module.
StarBED and SpringOS: large-scale general purpose network testbed and supporting software
Authors: Toshiyuki Miyachi, Ken-ichi Chinen, Yoichi Shinoda
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

New technologies for the Internet should be evaluated on environments dedicated to experiments, in order to avoid influences to critical services on the Internet. Generally software simulation and small testbed using real nodes are used to satisfy these requirements. There are several stages in developing new technologies, however, and these technologies may not satisfy requirements for all stages.We pointed the gap between the Internet and environment for experiment, especially in aspects of scale, complexity and reality. We proposed and implemented StarBED which is a testbed based on lots of actual nodes, in order to build large-scale, complex and realistic environments for experiments. StarBED consists of 512 PCs and switches which connect these PCs. The PCs on StarBED are designed to run 10 virtual PCs on a physical PC. It enables to build a topology for experiments using up to 5120 nodes. It is difficult to manage and control such a lot of nodes. We also designed and implemented SpringOS, which is a supporting software for making experiments. SpringOS makes the topology and drives the scenario for experiment according to the user's configuration automatically.Many experiments were performed on StarBED, and this shows StarBED's effectiveness.
Forming efficient agent groups for completing complex tasks
Authors: Efrat Manisterski, Esther David, Sarit Kraus, Nicholas R. Jennings
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working together. In particular, each task is assumed to be composed of several subtasks and involves an associated predetermined and known overall payment (set by the task's owner) for its completion. However, the division of this payment among the corresponding contributors is not predefined. Now to accomplish a particular task, all its subtasks need to be allocated to agents with the necessary capabilities and the agents' corresponding costs need to fall within the preset overall task payment. For this scenario, we first provide a cooperative agent system designer with a practical solution that achieves an efficient allocation. However, this solution is not applicable for non-cooperative settings. Consequently, we go on to provide a detailed analysis where we prove that certain design goals cannot be achieved if the agents are self interested. Specifically, we prove that for the general case, no protocol achieving the efficient solution can exist that is individually rational and budget balanced. We show that although efficient protocols may exist in some settings, these will inevitably be setting-specific.
Three Dimensional Layered Approach for Analyzing Value Chain Re-organization Cross ICT Industries for Converged Mobile Multimedia Services
Authors: Yun Jiang, Laurent Gille
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

ICT innovations, while driving technological advances, also create new services and new value chain structures. The nascent mobile multimedia services exhibit distinct attributes from conventional telecom, broadcast and Internet services. While traditional two-dimensional approach for value chain analysis serves less inadequate for the complex value system structures of converged mobile multimedia service. This paper thus, proposes a three dimensional layered approach for analyzing value chain re-organization cross ICT industries under convergent market context. The case of mobile TV is studied as a representative application of converged mobile multimedia services, by applying this approach to diagnose its value system composition in functional, industry and application dimensions.
Spatio-Temporal MRF model and its Application to Traffic Flow Analyses
Authors: Shunsuke KAMIJO
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

One of the most important application on Intelligent Transporting System (ITS) is to analyze various traffic activities and construct traffic monitoring system. However, such analyses in previous works have been done by manual inspection to huge amount of traffic images. The major reason why automated analyses of traffic images have been failed is that there does not exist any robust tracking algorithms against such crowded situations at intersections. In order to resolve such a problem, we have developed the tracking algorithm based on Spatio-Temporal Markov Random Field model which is robust against occlusion and clutter problems in 2000. This algorithm is then improved to deal with the problem of illumination variation which is the other dif- ficult problem in computer vision technology. Utilizing this tracking algorithm, an application to acquire traffic flow statistics based on operation hierarchy. This system is able to acquire traffic event statistics such as vehicle counts distinguishing travel directions, velocities, frequent paths and so on.
exploRase: Exploratory Data Analysis of Systems Biology Data
Authors: Michael Lawrence, Eun-Kyung Lee, Dianne Cook, Heike Hofmann, Eve Wurtele
Venue: Proceedings of the Fourth International Conference on Coordinated & Multiple Views in Exploratory Visualization (2006)

exploRase is a software tool for the exploratory analysis of systems biology data. Exploration of complex biochemical systems requires the integration of experimental data, such as transcriptomic, proteomic, and metabolomic data, with biochemical networks. The networks specify the relationships between the entities (transcripts, proteins, metabolites) described by the "omics" data and therefore serve as a unifying framework for the analysis. exploRase delegates to the interactive graphics platform GGobi for the display of the experimental data in scatterplots, parallel coordinate plots, barcharts, and more. The plots are interlinked so that brushing an entity in one plot will result in its being brushed in the others. The GGobi plots are linked to a network display, so that corresponding node glyphs in the network are also brushed. exploRase provides a graphical user interface (GUI) with tables containing entity metadata fields, such as biological function. The tables have a color column that is synchronized with the brushing of the GGobi plots and the network view. We demonstrate the usefulness of exploRase by analyzing a transcriptomic dataset that compares a biotin-deficient Arabidopsis mutant with the wildtype. The next steps in development include implictly linking views across datasets via network relationships
jViz.Rna - An Interactive Graphical Tool for Visualizing RNA Secondary Structure Including Pseudoknots
Authors: Kay C. Wiese, Edward Glen
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In order for structure prediction researchers to better understand the results of their algorithms and to enable life science researchers to interpret RNA structure easily, it is helpful to provide them with a flexible and powerful tool for RNA secondary structure visualization. jViz.Rna is a multi-platform visualization tool capable of displaying RNA secondary structures encoded in a variety of file formats. A single structure can be shown using the linear Feynman, circular Feynman, dot plot, and classical structure visualization models. The resulting drawings are dynamic and can easily be further modified by the user. Any of the drawings produced can be saved to disk enabling easy dissemination. The unique usage of a spring model for classical structure drawing allows for clear visualization of pseudoknots with minimal overlaps. The addition of a locality tool allows for the isolation of pseudoknotted regions or other regions of interest. Availability: http://jviz.research.iat.sfu.ca
Optimal threshold policies in a two-class preemptive priority queue with admission and termination control
Authors: Gido A. Brouns, Jan Van Der Wal
Venue: Queueing Systems: Theory and Applications (2006)

We consider a two-class $$M^{\lambda_1, \lambda_2}|M^{\mu}|1$$ 1 preemptive priority queue in which there are two essential, on-line decisions that have to be taken. The first is the decision to either accept or reject new type-1 or type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-1 or type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of, decisions.
Stabilizers: a modular checkpointing abstraction for concurrent functional programs
Authors: Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
Venue: ACM SIGPLAN Notices (2006)

Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execution in multi-threaded code is not obvious, however. For a thread to correctly rexecute a region of code, it must ensure that all other threads which have witnessed its unwanted effects within that region are also reverted to a meaningful earlier state. If not done properly, data inconsistencies and other undesirable behavior may result. however, automatically determining what constitutes a consistent global checkpoint is not straightforward since thread interactions are a dynamic property of the program.In this paper, we present a safe and efficient checkpointing mechanism for Concurrent ML (CML) that can be used to recover from transient faults. We introduce a new linguistic abstraction called stabilizers that permits the specification of per-thread monitors and the restoration of globally consistent checkpoints. Safe global states are computed through lightweight monitoring of communication events among threads (e.g. message-passing operations or updates to shared variables).Our experimental results on several realistic, multithreaded, server-style CML applications, including a web server and a windowing toolkit, show that the overheads to use stabilizers are small, and lead us to conclude that they are a viable mechanism for defining safe checkpoints in concurrent functional programs.
Fast projection algorithm and its step size control
Authors: M. Tanaka, Y. Kaneda, S. Makino, J. Kojima
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Of the many adaptive filtering algorithms, the normalized LMS (NLMS) algorithm is generally used in practice because of its simplicity. The computational complexity of the NLMS algorithm is low, however, convergence is very slow and tracking is poor for a colored input signal such as speech. The projection algorithm was proposed as a generalization of the NLMS algorithm. This paper provides a fast projection algorithm and a step size control to obtain the same steady-state excess mean squared error (MSE) for various projection orders. Computer simulations for colored noise and speech input signal confirm the effectiveness of the projection algorithm and the step size control.
Dual-Homing Based Scalable Partia Multicast Protection
Authors: Jianping Wang, Mei Yang, Bin Yang S. Q. Zheng
Venue: IEEE Transactions on Computers (2006)

In this paper, we propose a scalable multicast protection scheme based on a dual-homing architecture where each destination host is connected to two edge routers. Under such an architecture, there are two paths from the source of a multicast session to each destination host, which provides a certain level of protection for the data traffic from the source to the destination host. The protection level varies from 0 percent to 100 percent against a single link failure, depending on the number of shared links between these two paths. The major advantage of the proposed scheme lies in its scalability due to the fact that the protection is provided by constructing a dual-homing architecture at the access network while keeping the routing protocols in the core network unchanged. The selection of dual edge routers plays an important role in enhancing the protection level. Two problems arise for the proposed dual-homing partial multicast protection scheme. One is to calculate the survivability from the source to any pair of edge routers. The other is to assign a pair of edge routers for each destination host such that the total survivability is maximized for the multicast session subject to the port number constraint of each edge router. We propose an optimal algorithm to solve the first problem. We prove the decision version of the second problem is NP-complete and propose two heuristic algorithms to solve it. Simulation results show that the proposed heuristic algorithms achieve performance close to the calculated lower bound.
Global exponential stability of generalized recurrent neural networks with discrete and distributed delays
Authors: Yurong Liu, Zidong Wang, Xiaohui Liu
Venue: Neural Networks (2006)

This paper is concerned with analysis problem for the global exponential stability of a class of recurrent neural networks (RNNs) with mixed discrete and distributed delays. We first prove the existence and uniqueness of the equilibrium point under mild conditions, assuming neither differentiability nor strict monotonicity for the activation function. Then, by employing a new Lyapunov-Krasovskii functional, a linear matrix inequality (LMI) approach is developed to establish sufficient conditions for the RNNs to be globally exponentially stable. Therefore, the global exponential stability of the delayed RNNs can be easily checked by utilizing the numerically efficient Matlab LMI toolbox, and no tuning of parameters is required. A simulation example is exploited to show the usefulness of the derived LMI-based stability conditions.
Distributed Reconfiguration for Traffic Changes in IP-Over-WDM Networks
Authors: N. Sreenath, Balaji Palanisamy
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

In IP-Over-WDM networks, a set of lightpaths (alloptical communication paths) established between IP routers defines the virtual topology. In the event of changes in traffic, the objective function value of the network (virtual topology) may be affected leading to decreased network performance. Thus, the underlying virtual topology needs to be changed in response to the changing traffic patterns at the higher layers. This process of changing the virtual topology to meet the traffic requirement is called as reconfiguration. In this paper, we propose a distributed algorithm for virtual topology reconfiguration in the event of traffic changes in IP-Over-WDM networks.