ppxscal/embedding_network huggingface dataset:
Dissociating the Neural Mechanisms of Visual Attention in Change Detection Using Functional MRI
Authors: Scott A. Huettel, Güven Güzeldere, Gregory Mccarthy
Venue: Journal of Cognitive Neuroscience (2001)

We investigated using functional magnetic resonance imaging (fMRI) the neural processes associated with performance of a change-detection task. In this task, two versions of the same picture are presented in alternation, separated by a brief mask interval. Even when the two pictures greatly differ (e.g., as when a building is in different locations), subjects report that identification of the change is difficult and often take 30 or more seconds to identify the change. This phenomenon of "change blindness" provides a powerful and novel paradigm for segregating components of visual attention using fMRI that can otherwise be confounded in short-duration tasks. By using a response-contingent event-related analysis technique, we successfully dissociated brain regions associated with different processing components of a visual change-detection task. Activation in the calcarine cortex was associated with task onset, but did not vary with the duration of visual search. In contrast, the pattern of activation in dorsal and ventral visual areas was temporally associated with the duration of visual search. As such, our results support a distinction between brain regions whose activation is modulated by attentional demands of the visual task (extrastriate cortex) and those that are not affected by it (primary visual cortex). A second network of areas including central sulcus, insular, and inferior frontal cortical areas, along with the thalamus and basal ganglia, showed phasic activation tied to the execution of responses. Finally, parietal and frontal regions showed systematic deactivations during task performance, consistent with previous reports that these regions may be associated with nontask semantic processing. We conclude that detection of change, when transient visual cues are not present, requires activation of extrastriate visual regions and frontal regions responsible for eye movements. These results suggest that studies of change blindness can inform understanding of more general attentional processing.
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Authors: Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zhang, Lizhu Zhou
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns from scratch periodically by checking the entire transaction database, which consists of XML query patterns transformed from user queries. However, it is nontrivial to maintain such discovered frequent patterns in real XML databases because there may incur frequent updates that may not only invalidate some existing frequent query patterns but also generate some new frequent ones. Accordingly, existing proposals are inefficient for the evolution of the transaction database. To address these problems, this paper presents an efficient algorithm IPS-FXQPMiner for mining frequent XML query patterns without candidate maintenance and costly tree-containment checking. We transform XML queries into sequences through a oneto- one mapping and then mine the frequent sequences to generate frequent XML query patterns. More importantly, based on IPS-FXQPMiner, an efficient incremental algorithm, Incre-FXQPMiner is proposed to incrementally mine frequent XML query patterns, which can minimize the I/O and computation requirements for handling incremental updates. Our experimental study on various real-life datasets demonstrates the efficiency and scalability of our algorithms over previous known alternatives.
Numerical Methods and Nature
Authors: E. Turkel
Venue: Journal of Scientific Computing (2006)

In many numerical procedures one wishes to improve the basic approach either to improve efficiency or else to improve accuracy. Frequently this is based on an analysis of the properties of the discrete system being solved. Using a linear algebra approach one then improves the algorithm. We review methods that instead use a continuous analysis and properties of the differential equation rather than the algebraic system. We shall see that frequently one wishes to develop methods that destroy the physical significance of intermediate results. We present cases where this procedure works and others where it fails. Finally we present the opposite case where the physical intuition can be used to develop improved algorithms.
Variable-Range Transmission Power Control in Wireless Ad Hoc Networks
Authors: Javier Gomez, Andrew T. Campbell
Venue: IEEE Transactions on Mobile Computing (2007)

In this paper, we investigate the impact of variable-range transmission power control on the physical and network connectivity, on network capacity, and on power savings in wireless multihop networks. First, using previous work by Steele [18], we show that, for a path attenuation factor \alpha = 2, the average range of links in a planar random network of A m2 having n nodes is \sim c {\frac{\sqrt{A}}{n-1}}. We show that this average range is approximately half the range obtained when common-range transmission control is used. Combining this result and previous work by Gupta and Kumar [8], we derive an expression for the average traffic carrying capacity of variable-range-based multihop networks. For \alpha = 2, we show that this capacity remains constant even when more nodes are added to the network. Second, we derive a model that approximates the signaling overhead of a routing protocol as a function of the transmission range and node mobility for both route discovery and route maintenance. We show that there is an optimum setting for the transmission range, not necessarily the minimum, which maximizes the capacity available to nodes in the presence of node mobility. The results presented in this paper highlight the need to design future MAC and routing protocols for wireless ad hoc and sensor networks based, not on common-range which is prevalent today, but on variable-range power control.
Privacy & Security Issues Related to Match Scores
Authors: Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Security and privacy issues remains a major hurdle in wide deployment of biometric based authentication system. For example, unauthorized access or regeneration of face templates has serious implications on the privacy of the concerned users. For robust and practical implementation of such system it is necessary to identify and explore the possible ways by which reconstruction of template is feasible. In this paper, we show that even match scores carries sufficient information for reconstruction of the original face templates. We propose a novel non-iterative scheme to reconstruct face templates from match scores. We use an affine transformation of the images to approximate the behavior of a given face recognition system using an independent set of face templates termed as "break-in" set. Selected templates from the break-in set are matched only once with the enrolled template of the target account and match scores are recorded. These scores are then embedded in the approximating affine space along with break-in set templates to compute the co-ordinates of the target template. The inverse transformation is used to reconstruct the original target template. We present the reconstruction of templates for a commercial off the shelf (COTS) face recognition system. The COTS system is set to operate at 1% False Acceptance Rate and 99% True Acceptance Rate with 100 enrollments. We observed that with proposed scheme, at most 450 attempts are required to achieve a 0.93 probability of break into the COTS face recognition system by choosing a random gallery target.
An Online Discriminative Approach to Background Subtraction
Authors: Li Cheng, Shaojun Wang, Dale Schuurmans, Terry Caelli, S. V. N. Vishwanathan
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

We present a simple, principled approach to detecting foreground objects in video sequences in real-time. Our method is based on an on-line discriminative learning technique that is able to cope with illumination changes due to discontinuous switching, or illumination drifts caused by slower processes such as varying time of the day. Starting from a discriminative learning principle, we derive a training algorithm that, for each pixel, computes a weighted linear combination of selected past observations with time-decay. We present experimental results that show the proposed approach outperforms existing methods on both synthetic sequencse and real video data.
Truels, or Survival of the Weakest
Authors: Pau Amengual, Raul Toral
Venue: Computing in Science and Engineering (2006)

We're all familiar with the concept of duels. They can be deadly, such as those fought between two suitors vying for a lady's affections or sheriffs and outlaws battling it out in the American Old West, or they can end in both parties enjoying a beer, with the loser buying a round after an intense game of darts. A duel is simply a game with two players, each having a probability of winning that game and each having an intrinsic marksmanship, or ability, associated with his or her performance. Of course, the worst player--the one with the worst marksmanship--might have an advantage such as extra bullets or extra points, but in a normal unbiased situation, common sense tells us that the higher the marksmanship, the higher the probability of winning the duel. The mathematical treatment of this game confirms our simple expectations. If more than two players participate, a series of duels might be needed to determine the absolute winner. This is the case in sports tournaments, which pair teams in all possible ways until the ultimate winner emerges. A truel is a generalization of a duel involving three players and slightly different rules.
Stochastic Petri Nets for modelling and simulation
Authors: Peter J. Haas
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Stochastic Petri nets (SPNs) have proven to be a powerful and enduring graphically-oriented framework for modelling and performance analysis of complex systems. This tutorial focuses on the use of SPNs in discrete-event simulation. After describing the basic SPN building blocks and discussing the modelling power of the formalism, we present elements of a steady-state simulation theory for SPNs. Specifically, we provide conditions on the building blocks of an SPN that ensure long-run stability for the underlying marking process (or for a sequence of delays determined by the marking process) and the validity of estimation procedures such as the regenerative method, the method of batch means, and spectral methods.
Distributed breadth-first search LTL model checking
Authors: Jiří Barnat, Ivana Černá
Venue: Formal Methods in System Design (2006)

We propose a parallel distributed memory on-the-fly algorithm for enumerative LTL model checking. The algorithm is designed for networks of workstations communicating via MPI. The detection of cycles (faulty runs) effectively employs the so-called back-level edges. In particular, a parallel level synchronized breadth-first search of the graph is performed to discover all back-level edges, and for each level the back-level edges are checked in parallel by a nested search procedure to confirm or refute the presence of a cycle. Several improvements of the basic algorithm are presented and advantages and drawbacks of their application to distributed LTL model checking are discussed.
Designing a Multipurpose Virtual Laboratory to Support Communities of Practice in Physics
Authors: Silvia Gabrielli, Markus Hodapp, Roberto Ranon
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper reports our recent work within the EuroTeV project, aimed at designing a Multipurpose Virtual Laboratory (MVL) to support collaboration among several European institutes, working in the area of physics research. Specifically, we discuss the type of support MVL can provrde to knowledge creation and sharing within its community of users. We also highlight how the digital resources available in this environment might be reused by virtual communities of learners, thus helping to bridge the gap between the worlds of eScience work and education.
New developments in ranking and selection: an empirical comparison of the three main approaches
Authors: Jürgen Branke, Stephen E. Chick, Christian Schmidt
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Selection procedures are used in many applications to select the best of a finite set of alternatives, as in discrete optimization with simulation. There are a wide variety of procedures, which begs the question of which selection procedure to select. This paper (a) summarizes the main structural approaches to deriving selection procedures, (b) describes an innovative empirical testbed, and (c) summarizes results from work in progress that provides the most exhaustive assessment of selection procedures to date. The most efficient and easiest to control procedures allocate samples with a Bayesian model for uncertainty about the means, and use a new expected opportunity cost-based stopping rule.
A Feature-Augmented Grammar for Automated Media Production
Authors: Freddy Choi, Richard Beales, Jonathan Hearn, Stuart E. Middleton, Matthew Addis, Christos Mangos
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The IST Polymnia project is creating a fully automated system for personalised video generation, including content creation, selection and composition. This paper presents a linguistically motivated solution using context-free feature-augmented grammar rules to describe editing tasks and hence automate video editing. The solution is media and application independent.
A Multi-Start Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows
Authors: Humberto Cesar Brandao de Oliveira, Germano Crispim Vasconcelos, Guilherme Bastos Alvarenga
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

Vehicle Routing Problems have been analyzed to reduce transportation costs of people and goods. More particularly, the Vehicle Routing Problem with Time Windows (VRPTW) imposes the period of time of customer availability as a constraint, a very common characteristic in real world picking up and delivery problems. Using minimization of the total distance as the main objective to be fulfilled, this work implements an efficient hybrid system which associates a nonmonotonic Simulated Annealing technique to a Hill Climbing Strategy with Random Restart (Multi-Start). The algorithm performance is evaluated by comparing the results achieved with the best published works found in the literature of the 56 Solomon instances. The results outperformed or paired the individual best previous results in 36 out of the 56 instances.
A comparison of screening methods for colorectal cancer using simulation modeling
Authors: Ali Tafazzoli, Stephen D. Roberts, Reid M. Ness, Robert S. Dittus
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We used a discrete-event simulation model of the natural history of Colorectal Cancer (CRC) to do a cost-effectiveness analysis comparing the latest CRC screening strategies recommended by the American Gastroenterological Association (AGA) and the newest screening modalities for which clinical efficacy has been established. Cost-effectiveness was based on discounted costs and quality-adjusted life-years. A probabilistic sensitivity analysis examined the uncertainty in important parameter estimates. Considering all populations (average and high risk), annual Fecal Occult Blood Test (FOBT), Sigmoidoscopy every five years and annual FOBT, and Colonoscopy every ten years were the three strategies that demonstrated a greater than 50% probability of not being dominated in probabilistic sensitivity analysis. Depending on the maximum acceptable marginal cost-effectiveness value, any of these procedures have a high likelihood of becoming preferred (most effective strategy given a specific cost limit per Quality-Adjusted Life-Year (QALY) saved).
A Real-Time Yield Management Framework for E-Services
Authors: Parijat Dube, Yezekael Hayel
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)

Yield management for e-services is an exciting extension of the traditional yield management techniques employed in hotel and airline industry. We propose a framework for realtime yield mangement of e-services. The framework employs demand forecasting, yield managament and customer behavior monitoring modules. Yield management is used to optimize resource allocation with market segmentation in prices. In eservices an important service measure is the perceived delay. We use queueing theory to model the dependence of the perceived delay on the demand and providers' capacity. Using numerical examples we show the gain in revenue that can be realised by firms in different types of markets with different buying power of customers.
Named entity recognition for Hungarian using various machine learning algorithms
Authors: Richárd Farkas, György Szarvas, András Kocsor
Venue: Acta Cybernetica (2006)

In this paper we introduce a statistical Named Entity recognizer (NER) system for the Hungarian language. We examined three methods for identifying and disambiguating proper nouns (Artificial Neural Network, Support Vector Machine, C4.5 Decision Tree), their combinations and the effects of dimensionality reduction as well. We used a segment of Szeged Corpus [5] for training and validation purposes, which consists of short business news articles collected from MTI (Hungarian News Agency, www.mti.hu). Our results were presented at the Second Conference on Hungarian Computational Linguistics [7]. Our system makes use of both language dependent features (describing the orthography of proper nouns in Hungarian) and other, language independent information such as capitalization. Since we avoided the inclusion of large gazetteers of pre-classified entities, the system remains portable across languages without requiring any major modification, as long as the few specialized orthographical and syntactic characteristics are collected for a new target language. The best performing model achieved an F measure accuracy of 91.95%.
Wavelet based detectors
Authors: R. D. Priebe, K. W. Baugh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Many processes can be described as time-scale in that signals arising from these processes exhibit constant time-bandwidth products. This feature is exploitable by wavelet transform techniques. A wavelet transform based detector is detailed and its performance evaluated relative to the short time Fourier transform.
Probabilistic Enhanced Mapping with the Generative Tabular Model
Authors: Rodolphe Priam, Mohamed Nadif
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Visualization of the massive datasets needs new methods which are able to quickly and easily reveal their contents. The projection of the data cloud is an interesting paradigm in spite of its difficulty to be explored when data plots are too numerous. So we study a new way to show a bi-dimensional projection from a multidimensional data cloud: our generative model constructs a tabular view of the projected cloud. We are able to show the high densities areas by their non equidistributed discretization. This approach is an alternative to the self-organizing map when a projection does already exist. The resulting pixel views of a dataset are illustrated by projecting a data sample of real images: it becomes possible to observe how are laid out the class labels or the frequencies of a group of modalities without being lost because of a zoom enlarging change for instance. The conclusion gives perspectives to this original promising point of view to get a readable projection for a statistical data analysis of large data samples.
Parallel Asynchronous Watershed Algorithm-Architecture
Authors: Bruno Galilee Franck Mamalet Marc Renaudin
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

A joint algorithm-architecture study has resulted into a new version of a picture segmentation system complying with multimedia mobile terminal constraints, i.e., real-time computing, and low power consumption. Previously published watershed segmentation algorithms required at least three global synchronization points: minima detection, labeling and flooding. This paper presents a new fully asynchronous algorithm, where pixels can compute their local data in parallel and independently from one another, and which requires only a unique final global synchronization point. This paper provides a formal demonstration of the convergence and correctness of this new parallel asynchronous algorithm using a mathematical model of data propagation in a graph: the associative net formalism. We demonstrate the simplicity of implementation of this algorithm on parallel processor arrays. We explore, simulate, and validate several configurations of the algorithm-architecture using a "SystemC” model. Simulations reveal an image segmentation rate up to 66,000 QCIF images/sec, i.e., a speed-up factor of more than 1,000 times compared with state of the art watershed algorithms. A fine grain processor array design using STmicroelectronics 0.18\mu m CMOS technology confirms that this new approach is a breakthrough in the domain of real-time image segmentation.
Across the Great Divide
Authors: David Alan Grier
Venue: Computer (2006)

Like the computer age, the era of global trade has come with a new sense of standardization.
Reasoning about action and cooperation
Authors: Luigi Sauro, Jelle Gerbrandy, Wiebe van der Hoek, Michael Wooldridge
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a logic for reasoning both about the ability of agents to cooperate to execute complex actions, and how this relates to their ability to reach certain states of affairs. We show how the logic can be obtained in a modularised way, by combining a model for reasoning about actions and their effects with a model that describes what actions an agent can perform. More precisely, we show how one can combine an action logic which resembles Propositional Dynamic Logic with a cooperation logic which resembles Coalition Logic. We give a sound and complete axiomatisation for the logic, illustrate its use by means of an example, and discuss possible future extensions to it.
Mobile interaction with the real world
Authors: Enrico Rukzio, Massimo Paolucci, Tim Finin, Paul Wisner, Terry Payne
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

The main goal of the workshop is to discuss approaches that use a mobile device (e.g. mobile phone, smartphone, PDA) for interactions with objects in the real world. Relevant topics include (but are not limited to) mobile interaction with the real world; mobile devices as user interfaces for terminals and vending machines; and Frameworks, middleware and APIs for the development of applications that take mobile interactions with the real world into account. The workshop combines technical presentations with the presentation of prototypes and focussed discussions to drive interaction between participants.