ppxscal/embedding_network huggingface dataset:
When Keeping in Mind Supports Later Bringing to Mind: Neural Markers of Phonological Rehearsal Predict Subsequent Remembering
Authors: Lila Davachi, Anat Maril, Anthony D. Wagner
Venue: Journal of Cognitive Neuroscience (2001)

The ability to bring to mind a past experience depends on the cognitive and neural processes that are engaged during the experience and that support memory formation. A central and much debated question is whether the processes that underlie rote verbal rehearsal&mdash;that is, working memory mechanisms that keep information in mind&mdash;impact memory formation and subsequent remembering. The present study used event-related functional magnetic resonance imaging (fMRI) to explore the relation between working memory maintenance operations and long-term memory. Specifically, we investigated whether the magnitude of activation in neural regions supporting the on-line maintenance of verbal codes is predictive of subsequent memory for words that were rote-rehearsed during learning. Furthermore, during rote rehearsal, the extent of neural activation in regions associated with semantic retrieval was assessed to determine the role that incidental semantic elaboration may play in subsequent memory for rote-rehearsed items. Results revealed that (a) the magnitude of activation in neural regions previously associated with phonological rehearsal (left prefrontal, bilateral parietal, supplementary motor, and cerebellar regions) was correlated with subsequent memory, and (b) while rote rehearsal did not&mdash;on average&mdash;elicit activation in an anterior left prefrontal region associated with semantic retrieval, activation in this region was greater for trials that were subsequently better remembered. Contrary to the prevalent view that rote rehearsal does not impact learning, these data suggest that phonological maintenance mechanisms, in addition to semantic elaboration, support the encoding of an experience such that it can be later remembered.
Managing Wireless Health Monitoring for Patients with Disabilities
Authors: Upkar Varshney
Venue: IT Professional (2006)

A quality wireless health-monitoring system requires diverse quality-of-service levels, context awareness, and network traffic management.
FFT and Convolution Performance in Image Filtering on GPU
Authors: Ond!rej Fialka, Martin Cadik
Venue: Proceedings of the conference on Information Visualization (2006)

Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphics-hardware (GPU) is very desirable to preserve interactivity of the main visualization tool itself. In this article we take a close look on GPU implementation of two basic approaches to image filtering - Fast Fourier Transform (frequency domain) and convolution (spatial domain). We evaluate these methods in terms of the performance in real time applications and suitability for GPU implementation. Convolution yields better performance than Fast Fourier Transform (FFT) in many cases; however, this observation cannot be generalized. In this article we identify conditions under which the FFT gives better performance than the corresponding convolution and we assess the different kernel sizes and issues of application of multiple filters on one image.
Tips for successful practice of simulation
Authors: Deborah A. Sadowski, Mark R. Grabau
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Succeeding with a technology as powerful as simulation involves much more than the technical aspects you may have been trained in. The parts of a simulation study that are outside the realm of modeling and analysis can make or break the project. This paper explores the most common pitfalls in performing simulation studies and identifies approaches for avoiding these problems.
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers
Authors: Ismail Ababneh
Venue: Journal of Systems and Software (2006)

This paper presents an efficient free-list submesh allocation scheme for two-dimensional mesh-connected systems. The scheme maintains an unordered list of free submeshes. For allocation, it selects the first free submesh that has at least the same size as the request, and when the selected submesh is larger than the request the part actually allocated is one that has the largest number of busy neighbors and mesh boundary processors. Whereas the best previously proposed schemes have time complexities that are either quadratic or cubic in the number of free or allocated submeshes, the time complexity of the proposed scheme is linear in the number of free submeshes. To evaluate the effectiveness of the scheme, its system performance in terms of parameters such as the average job turnaround time was compared to that of promising previously proposed schemes. Simulation results show that the scheme performs at least as well as these schemes, yet it has the lowest time complexity.
Every Linear Threshold Function has a Low-Weight Approximator
Authors: Rocco A. Servedio
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

Given any linear threshold function f on n Boolean variables, we construct a linear threshold function g which disagrees with f on at most an \in fraction of inputs and has integer weights each of magnitude at most \sqrt n· 2 x O(1/ \in^2). We show that the construction is optimal in terms of its dependence on n by proving a lower bound of O(\sqrt n) on the weights required to approximate a particular linear threshold function.
Multi-Target Tracking - Linking Identities using Bayesian Network Inference
Authors: Peter Nillius, Josephine Sullivan, Stefan Carlsson
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one another, as in football and surveillance tracking. We present an approach to solving this labeling problem. When isolated, a target can be tracked and its identity maintained. While, if targets interact this is not always the case. This paper assumes a track graph exists, denoting when targets are isolated and describing how they interact. Measures of similarity between isolated tracks are defined. The goal is to associate the identities of the isolated tracks, by exploiting the graph constraints and similarity measures. We formulate this as a Bayesian network inference problem, allowing us to use standard message propagation to find the most probable set of paths in an efficient way. The high complexity inevitable in large problems is gracefully reduced by removing dependency links between tracks. We apply the method to a 10 min sequence of an international football game and compare results to ground truth.
ns-2 models for simulating a novel beyond 3G cellular multi-hop network
Authors: Anthony Lo, Jinglong Zhou, Martin Jacobsson, Ignas Niemegeers
Venue: Proceeding from the 2006 workshop on ns-2: the IP network simulator (2006)

Universal Mobile Telecommunications System (UMTS) is a third-generation cellular network that enables high-speed wireless Internet connectivity. On the other hand, the IEEE 802.11 ad hoc mode enables peer-to-peer short-range communications without infrastructure support. In this paper, we describe the design and implementation of a novel integrated UMTS and IEEE 802.11 ad hoc network modules in the Network Simulator (ns-2). The implementation is described from an overall design architecture to the realization of different architectural parts. A new mobile gateway is specially designed for the integrated network. With the hierarchical addressing mechanism, routing for the integrated network from wired network via UMTS network to the ad hoc network is realized. Simulations were carried out to validate the design and implementation in ns-2. Using our ns-2 modules, protocol designers can design and evaluate new protocols that run on such an integrated network.
Euclidean push-pull partial covering problems
Authors: Yoshiaki Ohsawa, Frank Plastria, Kazuki Tamura
Venue: Computers and Operations Research (2006)

This paper considers a bicriteria model to locate a semi-obnoxious facility within a convex polygon. Assuming that a given number of closest points and farthest points may be neglected in the analysis, it considers simultaneously the resulting push and pull partial covering criteria with Euclidean distances. Although both objectives are neither concave or convex, low complexity polynomial algorithms to find all the efficient solutions and the tradeoffs involved are developed by way of higher-order Voronoi diagrams. Comparison of the tradeoff for full covering and partial covering enables decision makers to understand to what extent the maximin and minimax criteria are improved at the expense of neglecting some points. The extensions to different sets of points pulling and pushing the facility and to weighted points are discussed. All methods are illustrated via small scale examples.
An Open System for Spatial Information Services
Authors: Hua Xu, Qiang Wu, Houjie Cao, Shibo Zhang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The development of an open system is important to allow for future expansion of capabilities because of the proliferation of spatial data, systems and applications. In this paper, the system architecture provides a distributed, interoperable and scalable environment. It is intended to unify the multiplicity of approaches and technologies to spatial information system. The spatial model, focusing on the scalable representation, shared data space and effective verification, is a useful method for better simulation, visualization and analysis over space and time. Furthermore, the system offers services based on components or subsystems to facilitate the creation and extension of applications and information communities.
Program analysis using random interpretation
Authors: George C. Necula
Venue:  (2005)

This dissertation describes a new program analysis technique called random interpretation that uses the power of randomization to verify and discover program properties. Random interpretation is inspired by, and combines the strengths of, the two complementary techniques for program analysis: random testing and abstract interpretation. Random testing is simple and finds real bugs in programs, but cannot prove absence of bugs. Abstract interpretation, on the other hand, is a class of sound and deterministic program analyses that find all bugs, but also report spurious bugs (false positives). Often these analyses are complicated and have long running time. In this dissertation, we describe few random interpretation based program analyses that are more efficient as well as simpler than their deterministic counterparts that had been state-of-the-art for almost 30 years. We then show how to extend these intra-procedural analyses to an inter-procedural setting, and how to combine these analyses. We also discuss our experience experimenting with some of these algorithms.
Components for a pervasive information dissemination architecture
Authors: Jan Moons, Carlos De Backer, Herwig Mannaert
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In this paper we explore the requirements of pervasive information dissemination architectures. We identify five critical components that should be present in such a system - the real-virtual bridge, the data representation component, the information presentation component, the security component and the middleware - and provide an overview of the various implementation options. We also present our current proof-ofconcept system including the choices we have made with regard to the five components. Using cheap RFID tags and readers, stock PDA's and an ontology-based back-end, this proof-of-concept implementation represents a low-cost and realistic pervasive campus information system. The goal of this paper is to spark discussion as to the suitability of this architecture as a pervasive education environment.
Cognitive Requirements for Vestibular and Ocular Motor Processing in Healthy Adults and Patients with Unilateral Vestibular Lesions
Authors: M. E. Talkowski, M. S. Redfern, J. R. Jennings, J. M. Furman
Venue: Journal of Cognitive Neuroscience (2005)

This study investigated the role of cognition in the vestibulo-ocular reflex (VOR) and ocular pursuit using a dual-task paradigm in patients with unilateral peripheral vestibular loss and healthy adults. We hypothesized that cognitive resources are involved in successful processing and integration of vestibular and ocular motor sensory information, and this requirement would be greater in patients with vestibular dysfunction. Sixteen well-compensated patients with surgically confirmed absent unilateral peripheral vestibular function and 16 healthy age- and sex-matched controls underwent seven combinations of vestibular-only, visual-only, and visual&ndash;vestibular stimuli while performing three different information processing tasks. Visual&ndash;vestibular stimuli included a semicircular canal and an otolith stimulus provided through seated chair rotations; fixation on a laser target and sinusoidal smooth pursuit while still; and fixation on a head-fixed laser target during chair rotations. The information processing tasks were three different auditory reaction time (RT) tasks: (1) simple RT, (2) disjunctive RT, and (3) choice RT. Our results showed increases in RTs in both patients and controls under all vestibular-only stimulation conditions and during ocular pursuit. Patients showed greater increases in RTs during vestibular stimulation and the more complex disjunctive and choice RT tasks. No differences between the groups were found during the visual-only or visual&ndash;vestibular interaction conditions. These results reveal interference between vestibulo-ocular processing and a concurrent RT task, suggesting that the VOR and the ocular motor system are dependent upon cognitive resources to some extent, and thus, are not fully automatic systems. We speculate that this interference with cognition occurs as a result of the sensory integration required for resolving inputs from multiple sensory streams. The particularly large decrement in information processing task performance of the patients compared with controls during vestibular stimulation suggests that compensation for unilateral vestibular loss requires continued cognitive resources.
Evidently Evidentiary
Authors: Daniel E. Geer Jr.
Venue: IEEE Security and Privacy (2006)

1 December 2006, new rules of civil procedure take effect in the US court system. The product of nearly 10 years' effort, the core purpose of these rules is that if digital information is to be used as evidence with legal value, a set of procedures must govern the examination and use of that evidence. All you security people, archivists, and system administrators, pay attention: the quiz will take place under oath.
Regional Brain Activity Associated with Visual Backward Masking
Authors: Michael F. Green, David Glahn, Stephen A. Engel, Keith H. Nuechterlein, Fred Sabb, Magda Strojwas, Mark S. Cohen
Venue: Journal of Cognitive Neuroscience (2005)

In visual backward masking, the visibility of a briefly presented visual target is disrupted by a mask that is presented shortly thereafter. The goal of the current study was to identify regions in the human cortex that may provide the neural basis of visual masking. We searched for areas whose activity correlated with perception as we systematically varied the strength of masking. A total of 13 subjects performed a backward masking task during functional magnetic resonance imaging. Target and mask were presented at three delay intervals (34, 68, and 102 msec) and behavioral measures confirmed that the targets were more visible at longer masking intervals. Two sets of regions of interest were identified: Distinct regions in the visual cortex (V1/ V2, LO, hMT&plus;) were segregated using scans to localize visual processing drawn from the existing literature. Additional cortical regions were selected in a data-driven approach based on their activity during the backward masking task. For each set, we determined the regions whose magnitude of activation increased at longer masking intervals. Nine of the subjects provided valid behavioral performance data on the visual masking task and imaging data from these subjects were used for subsequent analysis. The scans of visual processing areas identified four regions, including: early visual areas (V1 and V2), the motion-sensitive regions in the lateral occipital (LO) lobe (hMT&plus;), and two components (dorsal and ventral) of the object-sensitive region, LO. Of these, the ventral and dorsal LO regions were sensitive to the strength of the mask. For the data-driven approach, six regions were identified on the basis of a difference map in which all masking intervals were contrasted with rest. These included the inferior parietal, anterior cingulate, precentral, insula, thalamic, and occipital areas. The predicted effects of more activity with weaker masking were seen in the thalamus, inferior parietal, and anterior cingulate. This study isolated three types of visual processing areas. The first included regions that subserve key stages of vision (including object and motion processing). The second type responded to the presentation of brief ly presented visual stimuli, regardless of masking interval. The third type (selected from the first two) included regions sensitive to the interval between the target and mask. These latter regions (including ventral LO, inferior parietal, anterior cingulate, and thalamus) may form the neural substrate of backward masking.
An Integrated Approach Using Data Mining & Genetic Algorithm in Customer Credit Risk Prediction of Installment Purchase Financing
Authors: Soo-Cheon Kweon, Yeong-Wha Sawng, Seung-Ho Kim
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Based on customer information, data relating to details of financing and payment histories from a financial institution, we derived single models using multilayer perceptions model(MLP), multiple discriminant analysis(MDA), and decision tree model(DTM). The results obtained from these single models were subsequently compared with the results from an integrated model that was developed using genetic algorithm. This study not only verifies existing single models and but also attempts to overcome the limitations of these approaches. While our comparative analysis of single models for the purpose of identifying the best-fit model relies upon existing techniques, this study presents a new methodology to build an integrated approach using data mining and genetic algorithm.
Security in the Nebula computer architecture
Authors: William B. Dietz, Leland Szewerenko
Venue: ACM SIGSMALL Newsletter (1983)

The problem of security in multi-function computer systems arises because the software in such systems is too complex to be proven to be correct. Multilevel secure operating systems attempt to deal with this problem by dividing the applications software into separate "tasks" and controlling the ways in which these tasks interact. While the internal behavior of each task still cannot be guaranteed, the security of the system as a whole can be demonstrated, provided the restrictions on task interaction can be enforced.To control the interaction of tasks, it must be possible to isolate each task from undesired examination or interference by other tasks. This isolation is usually accomplished by providing each untrusted task with its own "virtual" environment. The trusted system software and the hardware are responsible for making sure that an untrusted program cannot operate outside its own environment and that the physical resources allocated to establish the virtual environment do not violate the isolation requirements. Communication between these virtual environments is then controlled by the trusted system software.Ultimately, the realization of such an operating system structure produces a quantity of "trusted system software" that still must be verified to insure the security of the system. To practically realize such a system, careful design of the software and hardware is required to minimize the amount of verified code and isolate it from corruption by the unverified system software.The Nebula computer architecture includes a set of mechanisms that are designed to provide the isolation necessary to establish a secure system. Of more practical importance is the fact that these mechanisms will allow valid operations to be identified with minimal overhead and to proceed with minimal interference. These mechanisms are described below under the general headings of virtual addressing, protection states, secure user I/0 and task execution control.
Monitoring the Earth System Grid with MDS4
Authors: Ann Chervenak, Jennifer M. Schopf, Laura Pearlman, Mei-Hui Su, Shishir Bharathi, Luca Cinquini, Mike D'Arcy, Neill Miller, David Bernholdt
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In production Grids for scientific applications, service and resource failures must be detected and addressed quickly. In this paper, we describe the monitoring infrastructure used by the Earth System Grid (ESG) project, a scientific collaboration that supports global climate research. ESG uses the Globus Toolkit Monitoring and Discovery System (MDS4) to monitor its resources. We describe how the MDS4 Index Service collects information about ESG resources and how the MDS4 Trigger Service checks specified failure conditions and notifies system administrators when failures occur. We present monitoring statistics for May 2006 and describe our experiences using MDS4 to monitor ESG resources over the last two years.
Development and Evaluation of Decision-Making Model for Stock Markets
Authors: Jovita Nenortaite, Rimvydas Simutis
Venue: Journal of Global Optimization (2006)

The paper introduces an intelligent decision-making model which is based on the application of artificial neural networks (ANN) and swarm intelligence technologies. The proposed model is used to generate one-step forward investment decisions for stock markets. The ANN are used to make the analysis of daily stock returns and to calculate one day forward decision for purchase of the stocks. Subsequently the Particle Swarm Optimization (PSO) algorithm is applied in order to select the "the best" ANN for the future investment decisions and to adapt the weights of other networks towards the weights of the best network. The experimental investigations were made considering different forms of decision-making model: different number of ANN, ANN inputs, sliding windows, and commission fees. The paper introduces the decision-making model, its evaluation results and discusses its application possibilities.