ppxscal/embedding_network huggingface dataset:
A Neural Model of Smooth Pursuit Control and Motion Perception by Cortical Area MST
Authors: Christopher Pack, Stephen Grossberg, Ennio Mingolla
Venue: Journal of Cognitive Neuroscience (2001)

Smooth pursuit eye movements (SPEMs) are eye rotations that are used to maintain fixation on a moving target. Such rotations complicate the interpretation of the retinal image, because they nullify the retinal motion of the target, while generating retinal motion of stationary objects in the background. This poses a problem for the oculomotor system, which must track the stabilized target image while suppressing the optokinetic reflex, which would move the eye in the direction of the retinal background motion (opposite to the direction in which the target is moving). Similarly, the perceptual system must estimate the actual direction and speed of moving objects in spite of the confounding effects of the eye rotation. This paper proposes a neural model to account for the ability of primates to accomplish these tasks. The model simulates the neurophysiological properties of cell types found in the superior temporal sulcus of the macaque monkey, specifically the medial superior temporal (MST) region. These cells process signals related to target motion, background motion, and receive an efference copy of eye velocity during pursuit movements. The model focuses on the interactions between cells in the ventral and dorsal subdivisions of MST, which are hypothesized to process target velocity and background motion, respectively. The model explains how these signals can be combined to explain behavioral data about pursuit maintenance and perceptual data from human studies, including the Aubert&ndash;Fleischl phenomenon and the Filehne Illusion, thereby clarifying the functional significance of neurophysiological data about these MST cell properties. It is suggested that the connectivity used in the model may represent a general strategy used by the brain in analyzing the visual world.
Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT
Authors: Victor Khomenko, Maciej Koutny, Alex Yakovlev
Venue: Fundamenta Informaticae (2005)

The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is deriving equations for logic gates implementing each output signal of the circuit. This is usually done using reachability graphs.In this paper, we avoid constructing the reachability graph of an STG, which can lead to state space explosion, and instead use only the information about causality and structural conflicts between the events involved in a finite and complete prefix of its unfolding. We propose an efficient algorithm for logic synthesis based on the Incremental Boolean Satisfiability (SAT) approach. Experimental results show that this technique leads not only to huge memory savings when compared with the methods based on reachability graphs, but also to significant speedups in many cases, without affecting the quality of the solution.
Exploiting Even Partition to Accelerate Structure Join
Authors: Guoliang Li, Jianhua Feng, Yong Zhang, Na Ta, Lizhu Zhou
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

Among most of the approaches about XML query processing, structure join is more popular and efficient. The evaluation of structural relationship in the join, specifically the parent-child or ancestordescendant relationship, between XML element sets has imposed a great challenge on efficient XML query processing. In this paper, we present, PRIAM, an efficient algorithm for structure join by evenly partitioning the input element sets, which skips many more ancestor or descendant elements than previous algorithms. PRIAM accelerates structure join dramatically, but requires neither the order of input element sets nor any indices. Moreover, when the distribution of elements of a particular tag/label is skew, general partition-based techniques are not costefficient, however, PRIAM partitions the two input sets into different buckets evenly and only the structure join of suit buckets is helpful to the result, therefore it avoids scanning the two input sets many times and is efficient. In addition, PRIAM is portable to various coding schemes. Our extensive experiments show that PRIAM significantly outperforms previous ones.
Fault diagnosis of physical defects using unknown behavior model
Authors: Xiao-Qing Wen, Hideo Tamamoto, Kewal K. Saluja, Kozo Kinoshita
Venue: Journal of Computer Science and Technology (2005)

A new fault model, called the X-fault model, is proposed for fault diagnosis of physical defects with unknown behaviors by using X symbols. An efficient X-fault simulation method and an efficient X-fault diagnostic reasoning method are presented. Fault diagnosis based on the X-fault model can improve the accuracy of failure analysis for a wide range of physical defects in complex and deep submicron integrated circuits.
Complete Stability Analysis of Neutral-Type First Order Two-Time-Delay Systems with Cross-Talking Delays
Authors: Rifat Sipahi, Nejat Olgac
Venue: SIAM Journal on Control and Optimization (2006)

The stability robustness of first order linear time invariant dynamics of neutral type with multiple time delays against delay uncertainties is taken into consideration. We depart from a simpler investigation of Hale and Huang [J. Math. Anal. Appl., 178 (1993), pp. 344-362], which studies the same problem for retarded-type systems. On this basis we further introduce two challenging features by including (a) terms that add neutral dynamics and (b) an additional term that introduces cross-talk between the multiple delays. To the best of the authors&apos; knowledge, the stability posture of this class of systems can be treated only by a unique procedure. It is known as cluster treatment of characteristic roots (CTCR), which was recently developed for retarded-type dynamics. We first show the applicability of CTCR to the stability analysis of neutral-type multiple-delay dynamics. Next, we prove the well-known "small-delay" phenomenon for the dynamics at hand, interestingly, as a natural by-product of the CTCR paradigm. Finally, we present several case studies to display the steps and the strengths of CTCR. This deployment is scalable to treat similar problems with higher order dynamics, which have direct ramifications to some practical control applications.
Learning collaboration strategies for committees of learning agents
Authors: Enric Plaza, Santiago Ontañón
Venue: Autonomous Agents and Multi-Agent Systems (2006)

A main issue in cooperation in multi-agent systems is how an agent decides in which situations is better to cooperate with other agents, and with which agents does the agent cooperate. Specifically in this paper we focus on multi-agent systems composed of learning agents, where the goal of the agents is to achieve a high accuracy on predicting the correct solution of the problems they encounter. For that purpose, when encountering a new problem each agent has to decide whether to solve it individually or to ask other agents for collaboration. We will see that learning agents can collaborate forming committees in order to improve performance. Moreover, in this paper we will present a proactive learning approach that will allow the agents to learn when to convene a committee and with which agents to invite to join the committee. Our experiments show that learning results in smaller committees while maintaining (and sometimes improving) the problem solving accuracy than forming committees composed of all agents.
Protocol and Connectivity Based Overlay Level Capacity Calculation of P2P Networks
Authors: Kasim Oztoprak, Hurevren Kilic
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper, we proposed a metric for P2P networks based on Shannon's L-channel capacity calculation idea. The metric calculates the maximum rate of information (in bits per second) that can be transmitted over P2P network (a.k.a. combinatorial capacity) caused by protocol and overlay-level connectivity. We suggest P2P systems to be modeled as a discrete noiseless channel on which the protocol together with dynamically changing overlay-level instant connectivity topology defines a Shannon Language. In experimental works, we applied the metric first to the Gnutella 0.6 protocol for which message traffic explosion is a known problem and then to its time-based clustering version. The obtained results are compared with other two known metrics' namely, number of query hits and unit query-hit response time, results and potential correlations among them are discussed.
Spatial vs. multi-user diversity trade-offs for cross-layer scheduling in limited feedback systems
Authors: José López Vicario, Carles Antón-Haro
Venue: Signal Processing (2006)

In this paper, we explore spatial vs. multi-user diversity trade-offs in a cellular system with or without bandwidth restrictions in the feedback channel. More precisely, we are interested in assessing the impact of both antenna selection and space-time coding strategies in such a multi-user system. The centralized scheduler makes an extensive use of physical layer measures and, hence, this constitutes a cross-layer design. Performance assessment is conducted both analytically and by means of computer simulations, in terms of pdf and CDF distributions, average system capacity and throughput. Closed-form expressions are derived for the SNR densities associated to the different transmission configurations along with an approximate expression for system throughput.
Denoising by BV-duality
Authors: Stefan Kindermann, Stanley Osher, Jinjun Xu
Venue: Journal of Scientific Computing (2006)

In this paper we apply Meyer's G-norm for image processing problems. We use a definition of the G-norm as norm of linear functionals on BV, which seems to be more feasible for numerical computation. We establish the equivalence between Meyer's original definition and ours and show that computing the norm can be expressed as an interface problem. This allows us to define an algorithm based on the level set method for its solution. Alternatively we propose a fixed point method based on mean curvature type equations. A computation of the G-norm according to our definition additionally gives functions which can be used for denoising of simple structures in images under a high level of noise. We present some numerical computations of this denoising method which support this claim.
Parameterized Intractability of Distinguishing Substring Selection
Authors: Jens Gramm, Jiong Guo, Rolf Niedermeier
Venue: Theory of Computing Systems (2006)

A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-complete Distinguishing Substring Selection problem (DSSS for short) which asks, given a set of "good" strings and a set of "bad" strings, for a solution string which is, with respect to the Hamming metric, "away" from the good strings and "close" to the bad strings. More precisely, given integers dg, db, and L, we ask for a length-L string s such that s has Hamming distance at least dg to every length-L substring of the good strings and such that every bad string has a length-L substring with Hamming distance at most db to s. Studying the parameterized complexity of DSSS, we show that, already for binary alphabet, DSSS is W[1]-hard with respect to its natural parameters. This, in particular, implies that a recently given polynomial-time approximation scheme (PTAS) by Deng et al. cannot be replaced by a so-called efficient polynomial-time approximation scheme (EPTAS) unless an unlikely collapse in parameterized complexity theory occurs. This is seemingly the first computational biology problem for which such a border between PTAS (which exists) and EPTAS (which is unlikely to exist) could be established. By way of contrast, for a special case of DSSS, we present an exact fixed-parameter algorithm solving the problem efficiently. In this way we also exhibit a sharp border between fixed-parameter tractability and intractability results.
Fuzzy chaos generators for nonlinear dynamical systems
Authors: Zhong Li
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

A fuzzy chaos generator is proposed for chaotifying nonlinear dynamical systems via Tanaka-Sugeno (TS) fuzzy modeling. A discrete-time or continuous-time nonlinear system can first be formulated as a TS fuzzy model, and then a fuzzy anti-controller can be designed to make the nonlinear system chaotic. The generation of chaos is mathematically rigorous in the sense of Li & Yorke. An example is included to visualize the effect of the chaos generation method. 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
Distributed Computing for Efficient Hyperspectral Imaging Using Fully Heterogeneous Networks of Workstations
Authors: Antonio Plaza, Javier Plaza, David Valencia
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Hyperspectral imaging is a new technique which has become increasingly important in many remote sensing applications, including automatic target recognition for military and defense/security deployment, risk/hazard prevention and response including wild land fire tracking, biological threat detection, monitoring of oil spills and other types of chemical contamination, etc. Hyperspectral imaging applications generate massive volumes of data and require timely responses for swift decisions which depend upon high computing performance of algorithm analysis. Although most currently available parallel processing strategies for hyperspectral image analysis assume homogeneity in the computing platform, heterogeneous networks of workstations represent a very promising cost-effective solution expected to play a major role in the design of highperformance computing platforms for many on-going and planned remote sensing missions. This paper explores innovative techniques for mapping hyperspectral analysis algorithms onto heterogeneous networks of workstations available at NASA's Goddard Space Flight Center and University of Maryland. Experimental results reveal that heterogeneous networks of workstations represent a source of computational power that is both accessible and applicable in hyperspectral imaging studies.
Synchronization of chaos and small signal amplification in electron-hole plasma of germanium
Authors: K. M. Aliev, I. K. Kamilov, K. O. Ibragimov, N. S. Abakarova
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

The effect of an external harmonic signal on the screw instability of the current in the electron-hole plasma has been studied experimentally in Ge at 77 K and 300 K. The influence exerted by external signals with various amplitudes and frequencies, applied to a sample both additively and multiplicatively, on the synchronization, amplification and stability of the system in absolute and convective modes of instability excitation has been investigated at points of bifurcation in a wide region of the parametric space.
Learning against multiple opponents
Authors: Thuc Vu, Rob Powers, Yoav Shoham
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We address the problem of learning in repeated n-player (as opposed to 2-player) general-sum games, paying particular attention to the rarely addressed situation in which there are a mixture of agents of different types. We propose new criteria requiring that the agents employing a particular learning algorithm work together to achieve a joint best-response against a target class of opponents, while guaranteeing they each achieve at least their individual security-level payoff against any possible set of opponents. We then provide algorithms that provably meet these criteria for two target classes: stationary strategies and adaptive strategies with a bounded memory. We also demonstrate that the algorithm for stationary strategies outperforms existing algorithms in tests spanning a wide variety of repeated games with more than two players.
Silhouette Coherence for Camera Calibration under Circular Motion
Authors: Carlos Hernandez, Francis Schmitt Roberto Cipolla
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We present a new approach to camera calibration as a part of a complete and practical system to recover digital copies of sculpture from uncalibrated image sequences taken under turntable motion. In this paper, we introduce the concept of the silhouette coherence of a set of silhouettes generated by a 3D object. We show how the maximization of the silhouette coherence can be exploited to recover the camera poses and focal length. Silhouette coherence can be considered as a generalization of the well-known epipolar tangency constraint for calculating motion from silhouettes or outlines alone. Further, silhouette coherence exploits all the geometric information encoded in the silhouette (not just at epipolar tangency points) and can be used in many practical situations where point correspondences or outer epipolar tangents are unavailable. We present an algorithm for exploiting silhouette coherence to efficiently and reliably estimate camera motion. We use this algorithm to reconstruct very high quality 3D models from uncalibrated circular motion sequences, even when epipolar tangency points are not available or the silhouettes are truncated. The algorithm has been integrated into a practical system and has been tested on more than 50 uncalibrated sequences to produce high quality photo-realistic models. Three illustrative examples are included in this paper. The algorithm is also evaluated quantitatively by comparing it to a state-of-the-art system that exploits only epipolar tangents.
GAOM: Genetic Algorithm Based Ontology Matching
Authors: Junli Wang, Zhijun Ding, Changjun Jiang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In this paper a genetic algorithm-based optimization procedure for ontology matching problem is presented as a feature-matching process. First, from a global view, we model the problem of ontology matching as an optimization problem of a mapping between two compared ontologies, and every ontology has its associated feature sets. Second, as a powerful heuristic search strategy, genetic algorithm is employed for the ontology matching problem. Given a certain mapping as optimizing object for GA, fitness function is defined as a global similarity measure function between two ontologies based on feature sets. Finally, a set of experiments are conducted to analysis and evaluate the performance of GA in solving ontology matching problem.
An Extension of Evolutionary Ciphering System
Authors: Abdelaaziz Mouloudi, Fouzia Omary, Abderrahim Tragha, Abdelghani Bellaachia
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

The ciphering system presented in this paper is an extension of our ciphering system, which is already published [7]. Indeed, being given a plaintext, coded into binary and cut out in blocks of fixed size, we determine the lists of the positions of the various blocks constituting this plaintext and instead of applying the evolutionary ciphering algorithm to the lists of the positions of the characters of the plaintext, we apply it to the lists of the positions of the various blocks of the plaintext (coded in binary). This technique bars the way in front of all the attacks, which try to find the plaintext while being based on the study of the apparition frequencies of the characters in cipher text.
Product-focused Process Elicitation for Mobile Application Systems: A Wireless News Browser Case
Authors: Vesal Hakami, Ahamd Abdollahzadeh
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

The heterogeneous nature of mobile application systems, immaturity of the associated technologies, and insufficient knowledge about the effects of different methodologies denote the need for scrupulous adoption of a life cycle process in developing m-commerce systems. This paper promotes project-specific solutions as a basis for wide-ranging process elicitation efforts. The concept is elaborated by presenting a case study highlighting the best practices for designing and building a wireless news browsing application using a specialized recipe derived from an iterative-based framework. We apply a subset of UML diagrams for modeling the system; moreover, with respect to the high availability of competitive products and close comparability in mobile applications market, we have adopted a highly iterative process model with parallel execution of iterations to speed up our development strategy. Our product incorporates many of the ideas in the already existing feed reader applications to deliver the right mix of features and functionality.
The Design and Implementation of an Interactive Mobile Learning System
Authors: Hongru Qi, Minjuan Wang, Ren Tong, Ruimin Shen, Jiajun Wang, Yi Gao
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

With the fast development of mobile computing terminals and wireless network, Mobile Learning (ML) is becoming one of the most popular research and development areas in today's E-Learning. Through convenient and flexible mobile terminals and network, researchers and developers strive to provide users with teaching and learning resources and services that can be accessible anytime anywhere. This paper describes the design and implementation of a mobile learning system that can deliver live broadcast of realtime classroom teaching to online students with mobile devices. The system allows students to customize their ways of receiving, based on when and where they are tuning into the broadcast. To increase interactivity between the instructor and online students in large classes, the system also supports short text-messaging and instant polls. Through these venues, students can ask questions and make suggestions in real time, and the instructor can address them immediately
Developing an agent model of human performance in air traffic control operations using Apex cognitive architecture
Authors: Seung Man Lee, Ujwala Ravinder, James C. Johnston
Venue: Proceedings of the 37th conference on Winter simulation (2005)

For the analysis of large-scale complex systems, agent-based modeling and simulation has proven to provide a valuable research tool. The emphasis has, however, typically been on representing the dynamic behavior of physical entities such as aircraft. Simulation of human operators has often been minimal even though human behavior has an enormous impact on overall system performance and safety. Therefore, human capabilities and limitations need to be taken into account early in the system design process before irrevocable choices have been made. This paper reports on the development of agent models with human-like performance characteristics using a cognitive architecture. We present an agent model of an air traffic controller that is developed and incorporated into an agent-based simulation of the national airspace to support the design and evaluation of advanced air transportation concepts.