ppxscal/embedding_network huggingface dataset:
Analysis of Single-Unit Responses to Emotional Scenes in Human Ventromedial Prefrontal Cortex
Authors: Hiroto Kawasaki, Ralph Adolphs, Hiroyuki Oya, Christopher Kovach, Hanna Damasio, Olaf Kaufman, Matthew Howard Iii
Venue: Journal of Cognitive Neuroscience (2005)

Lesion and functional imaging studies in humans have shown that the ventral and medial prefrontal cortex is critically involved in the processing of emotional stimuli, but both of these methods have limited spatiotemporal resolution. Conversely, neurophysiological studies of emotion in nonhuman primates typically rely on stimuli that do not require elaborate cognitive processing. To begin bridging this gap, we recorded from a total of 267 neurons in the left and right orbital and anterior cingulate cortices of four patients who had chronically implanted depth electrodes for monitoring epilepsy. Peristimulus activity was recorded to standardized, complex visual scenes depicting neutral, pleasant, or aversive content. Recording locations were verified with postoperative magnetic resonance imaging. Using a conservative, multistep statistical evaluation, we found significant responses in 56 neurons; 16 of these were selective for only one emotion class, most often aversive. The findings suggest sparse and widely distributed processing of emotional value in the prefrontal cortex, with a predominance of responses to aversive stimuli.
CEDA Currents
Venue: IEEE Design Test (2006)

This newsletter covers news, research, and events related to the IEEE Council on Electronic Design Automation.
Codec Design for Variable-Length to Fixed-Length Data Conversion for H.263
Authors: Chua-Chin Wang, Gang-Neng Sung, Jia-Hao Li
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A codec (encoder-decoder) design for interfacing variable-length and fixed-length data conversion is proposed in this paper. The poor memory efficiency of the variable-length compression approach can be avoided while its advantages can be preserved. The introduction of the proposed codec converts the variable-length symbols into fixed-length packets which can be hardwaredly and parallelly processing without waiting for any other information, which indicates the decoding process is context-free. The proposed codec encodes extra symbols in the redundant bits of the padding bits of the fixed-length packets. This novel encoding scheme relaxes the intrinsic poor bit rate of the traditional fixed-length data compression.
Cooperative Cutting Work for Two 2-dof Robots with RNN Model
Authors: Yingda Dai, Masami Konishi, Jun Imai
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

This paper presents a general recurrent neural network (RNN) model for online control of timevarying robot manipulators. The robot manipulators with the different setting parameters are cooperatively work on an unknown curve tracing. Each joint of the manipulator is respectively provided a learning method to optimize trajectory by training RNN model. In this paper, the proposed RNN model shorten the period of learning and improve the cooperative accuracy than the existing neural networks for solving the problems such as cutting or welding special type of wares. More complicated constructive is to fit for the online cooperation. Simulation results show the effectiveness of this approach, and that the proposed RNN model can successfully learning the inverse dynamics of robot manipulators, perform accurate tracking for a general trajectory.
Real-Time Audio Watermarking System Prototype
Authors: Jose Juan Garcia Hernandez, Mariko Nakano Miyatake, Hector Perez Meana
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

A Real-Time audio watermarking system is presented. System contains two circuits: the marker circuit and the detector circuit. Watermark detection is blind, so, there is no necessary original signal to detect embedded information. Watermark detection does not need a synchronization stage; therefore, detection is carried out on any time. Both, marker and detector are implemented in a commercial Digital Signal Processor Starter Kit from Texas Instruments and are fully host-independent.
Switched-capacitor track-and-hold amplifier with low sensitivity to op-amp imperfections
Authors: Hirokazu Yoshizawa, Gabor C. Temes
Venue: Analog Integrated Circuits and Signal Processing (2006)

This paper describes a high-precision switched-capacitor (SC) track-and-hold amplifier (THA) stage. It uses a novel continuous-time correlated double sampling (CDS) scheme to desensitize the operation to amplifier imperfections. Unlike earlier predictive-CDS THAs, the circuit does not need a sample-and-held input signal for its operation. During the tracking period, an auxiliary continuous-time signal path is established, which predicts the output voltage during the holding period. This allows accurate operation even for low amplifier gains and large offsets over a wide input frequency range. Extensive simulations were performed to compare the performance of the proposed THA with earlier circuits utilizing CDS. The results verify that its operation is far more robust than that of any previously described THA.
A road timetableTM to aid vehicle routing and scheduling
Authors: Richard Eglese, Will Maden, Alan Slater
Venue: Computers and Operations Research (2006)

Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and the season of the year. Significant journey time differences occur mainly due to recurring instances and variations in levels of traffic congestion throughout the year. This paper examines the issues involved in constructing a database of road times for a road network that uses time-dependent data on the travel times for individual roads in the network to provide the expected times and distances between locations for journeys starting at different times. The benefits of time-dependent vehicle routing and scheduling systems are demonstrated by using real-world data for the road network in the north west of England.
Saccadic Performance as a Function of the Presence and Disappearance of Auditory and Visual Fixation Stimuli
Authors: Tracy L. Taylor, Raymond M. Klein, Douglas P. Munoz
Venue: Journal of Cognitive Neuroscience (1999)

Relative to when a fixated stimulus remains visible, saccadic latencies are facilitated when a fixated stimulus is extinguished simultaneously with or prior to the appearance of an eccentric auditory, visual, or combined visual-auditory target. In a study of nine human subjects, we determined whether such facilitation (the "gap effect") occurs equivalently for the disappearance of fixated auditory stimuli and fixated visual stimuli. In the present study, a fixated auditory (noise) stimulus remained present (overlap) or else was extinguished simultaneously with (step) or 200 msec prior to (gap) the appearance of a visual, auditory (tone), or combined visual-auditory target 10&deg; to the left or right of fixation. The results demonstrated equivalent facilitatory effects due to the disappearance of fixated auditory and visual stimuli and are consistent with the presumed role of the superior colliculus in the gap effect.
Efficient Access Control in Wireless Network
Authors: Kun Wang, Zhenguo Ding, Lihua Zhou
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

To use role-based access control (RBAC) in wireless network is difficult than that in wired network. RBAC needs to search relative tables to get the user's permissions. We present an access control judgment algorithm which bases on artificial neural network (ANN). The algorithm reduces the data transmission using bit string to express roles and permissions. The algorithm employs set theory to represent roles and their inheritance hierarchy, as well as conflicted permissions. It uses selected roles as input vectors and the matching permissions which contain no conflict as the output vectors to train the ANN. Then it uses the trained ANN to compute directly users' permissions when the system is under running condition, instead of searching tables. That improves the efficiency of access control. The algorithm is simple and efficient, which makes it easy to be realized in wireless networks.
Traffic-aware routing for real-time communications in wireless multi-hop networks: Research Articles
Authors: Shouyi Yin, Yongqiang Xiong, Qian Zhang, Xiaokang Lin
Venue: Wireless Communications Mobile Computing (2006)

In this paper, we propose a novel traffic-aware routing metric for real-time communications (RTC) in wireless multi-hop networks. Our routing metric, path predicted transmission time (PPTT), is designed to choose a high-quality path for RTC flow between a source and a destination. PPTT can serve as both single-radio and multi-radio routing metric for RTC flow.RTC has critical quality of service (QoS) requirements in terms of delay, bandwidth and so on. Traditional measurement-based routing schemes ignore the interference from the coming RTC flow itself (i.e. self-traffic), so they may choose the inefficient path to serve the coming RTC flow due to the inaccurate quality estimation of the transmission path. PPTT takes explicit consideration of both self-traffic and neighbouring traffic interfering with the RTC flow, and thus offers an accurate estimation of path transmission delay. Through differentiating the links by the wireless channel&#x002F;radio they are using, PPTT has the capability to choose a high-quality path for the coming RTC flow in both single-radio and multi-radio networks.To evaluate the performance, we implement PPTT scheme and study its performance in a wireless multi-hop testbed consisting of 32 nodes equipped with two IEEE 802.11a&#x002F;b&#x002F;g combo cards, and we also conduct extensive simulations with different random topologies in network simulator NS-2 for a more comprehensive comparison. The results of simulation and experiment show that this routing metric outperforms other non-traffic-aware one such as expected transmission count (ETX) and weighted cumulative expected transmission time (WCETT) in terms of delay and goodput in both single-radio and multi-radio wireless networks. Copyright &copy; 2006 John Wiley & Sons, Ltd.This work has been done when the first author was visiting wireless and networking group, Microsoft Research Asia.
Asymptotic error constants of cubically convergent zero finding methods
Authors: Naoki Osada
Venue: Journal of Computational and Applied Mathematics (2006)

The Laguerre family of iteration functions for finding multiple zeros is considered. This family is algebraically equivalent to the multiple zero counterpart of Hansen-Patrick family. The asymptotic error constant for the Laguerre family is given. The magnitude of asymptotic error constants for cubically convergent iteration functions for finding multiple real zeros of real functions are compared. Numerical examples are given.
Implementing a Self-Timed Low-Power Java Accelerator for Network-on-Chip Applications
Authors: Zheng Liang, Juha Plosila, Lu Yan, Kaisa Sere
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

This paper presents an advanced self-timed Java accelerator core which has extremely low power consumption while providing sufficient performance for even the most demanding real-time telecommunication and multimedia applications. The goal is that the accelerator can be directly attached to any general-purpose processor core running some Java-intensive application software. Asynchronous self-timed circuit technology, where timing is based on local handshakes between circuit blocks instead of a global clock signal, provides a promising platform for obtaining a highly modular low-power Java accelerator implementation.
Scheme and Functional Programming 2006: paper abstracts
Authors: Robert Bruce Findler
Venue: ACM SIGPLAN Notices (2006)

The Scheme and Functional Programming workshop will be held in Portland, OR on September 17th 2006, in conjunction with ICFP. The purpose of the workshop is to discuss experience with and future developments of the Scheme programming language, as well as general aspects of computer science loosely centered on the general theme of Scheme.Come to hear Manuel Serrano talk about HOP, his new language for programming the web, a status report from the R6RS editors, and presentations of the work below. I look forward to seeing you in Portland!
Towards security labelling
Authors: Chuchang Liu, Mehmet A. Orgun
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Security labels are applied for numerous reasons, including the handling of data communicated between open systems. The information contained within a security label can be utilised to perform access control decisions, specify protective measure, and aid in the determination of additional handling restrictions required by a communications security policy. This paper concerns the issues regarding security labelling in open systems. We propose a security labelling framework for such systems; and further, based on this framework, we develop a mechanically checkable model for security labelling systems and discuss its implementation issues. This model provides a functional base for future design and implementation of security labelling systems.
Attention Mechanisms in Visual Search - An fMRI Study
Authors: Ute Leonards, Stefan Sunaert, Paul Van Hecke, Guy A. Orban
Venue: Journal of Cognitive Neuroscience (2000)

The human visual system is usually confronted with many different objects at a time, with only some of them reaching consciousness. Reaction-time studies have revealed two different strategies by which objects are selected for further processing: an automatic, efficient search process, and a conscious, so-called inefficient search [Treisman, A. (1991). Search, similarity, and integration of features between and within dimensions. Journal of Experimental Psychology: Human Perception and Performance, 17, 652-676; Treisman, A., & Gelade, G. (1980). A feature integration theory of attention. Cognitive Psychology, 12, 97-136; Wolfe, J. M. (1996). Visual search. In H. Pashler (Ed.), Attention. London: University College London Press]. Two different theories have been proposed to account for these search processes. Parallel theories presume that both types of search are treated by a single mechanism that is modulated by attentional and computational demands. Serial theories, in contrast, propose that parallel processing may underlie efficient search, but inefficient searching requires an additional serial mechanism, an attentional "spotlight" (Treisman, A., 1991) that successively shifts attention to different locations in the visual field. Using functional magnetic resonance imaging (fMRI), we show that the cerebral networks involved in efficient and inefficient search overlap almost completely. Only the superior frontal region, known to be involved in working memory [Courtney, S. M., Petit, L., Maisog, J. M., Ungerleider, L. G., & Haxby, J. V. (1998). An area specialized for spatial working memory in human frontal cortex. Science, 279, 1347-1351], and distinct from the frontal eye fields, that control spatial shifts of attention, was specifically involved in inefficient search. Activity modulations correlated with subjects' behavior best in the extrastriate cortical areas, where the amount of activity depended on the number of distracting elements in the display. Such a correlation was not observed in the parietal and frontal regions, usually assumed as being involved in spatial attention processing. These results can be interpreted in two ways: the most likely is that visual search does not require serial processing, otherwise we must assume the existence of a serial searchlight that operates in the extrastriate cortex but differs from the visuospatial shifts of attention involving the parietal and frontal regions.
News Briefs
Venue: IT Professional (2006)

New Panel Aims to Identify Risks and Challenges; IPv6 to Influence $97 Billion in US Government Spending; Microsoft Debuts MySpace for IT; Report: New Hackers Up to Old Tricks; Study: People and Processes Important in Security; Internet Explorer 7 for Windows XP Available; Mozilla Releases Newest Firefox; MySQL Boosts Service Features for Enterprise Clients; Cisco Presents Next-Generation Virtual Meeting Technology; Dell Unveils Two- and Four-Socket Servers, Integrates Oracle; Sophos Confident in its Vista Protection; Microsoft to Release EU-Compliant Vista; EPA Announces New Computer Efficiency Requirements; Skype Introduces Video Calling for Mac Users, Aims for Legitimacy; Sony Recalls Additional Notebook Batteries. 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
Approximating component selection
Authors: Michael Roy Fox, David C. Brogan, Paul F. Reynolds,  Jr.
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected components. We address the second of these challenges through analysis of Component Selection (CS), the NP-complete process of selecting a minimal set of components to satisfy a set of objectives. Due to the high order of computational complexity of CS, we examine approximating solutions that make the CS process practicable. We define two variations of CS and prove that good approximations to optimal solutions result from applying a standard Greedy selection algorithm to each. Despite our creation of approximable variations of CS, we conjecture that any proof of the inapproximability of CS will reveal theoretical limitations of its practicality. We conclude that reasonably constrained variations of CS can be solved satisfactorily, and efficiently, but more general cases appear to never be solvable in a similar manner.
"Am I Disturbing You?": A Research Model for Investigating the Use of Mobile Phones in Social Settings
Authors: Robert C. Nickerson, Henri Isaac
Venue: Proceedings of the International Conference on Mobile Business (2006)

Mobile business is conducted extensively through mobile phones, which, unlike wired e-commerce client computers, can be used anywhere and anytime, and consequently are often used in social settings such as while walking on a sidewalk, eating in a restaurant, driving a car, and waiting for an airplane. Use of mobile phones in these situations affects not only the user but also co-located people who can be bothered by ringing phones, overheard conversations, and clicking keys. The purpose of this paper is to present a research model that we are using to investigate the acceptable use of mobile phones in social situations. The model examines both voice and text use of mobile phones in various social settings, and incorporates the location and time of use. The paper also introduces an empirical research study we are conducting in which we have obtained data from over 1000 people in five countries.
A Framework for Temporal Content Modeling of Video Data Using an Ontological Infrastructure
Authors: Behrang QasemiZadeh, Hadi Rastgou Haghi, Mohammadreza Kangavari
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Semantic video retrieval has emerged in the last decade as one of the most important features of pervasive multimedia systems. In this paper, a novel framework for temporal semantic video modeling based on ontologies is introduced. This proposed framework produces an ontological infrastructure named temporal ontology for semantic representation of video data independent of domain. This ontology later can be used to answer temporal queries.
A wide-area Distribution Network for free software
Authors: Arno Bakker, Maarten Van Steen, Andrew S. Tanenbaum
Venue: ACM Transactions on Internet Technology (TOIT) (2006)

The Globe Distribution Network (GDN) is an application for the efficient, worldwide distribution of freely redistributable software packages. Distribution is made efficient by encapsulating the software into special distributed objects which efficiently replicate themselves near to the downloading clients. The Globe Distribution Network takes a novel, optimistic approach to stop the illegal distribution of copyrighted and illicit material via the network. Instead of having moderators check the packages at upload time, illegal content is removed and its uploader's access to the network permanently revoked only when the violation is discovered. Other protective measures defend the GDN against internal and external attacks to its availability. By exploiting the replication of the software and using fault-tolerant server software, the Globe Distribution Network achieves high availability. A prototype implementation of the GDN is available from http://www.cs.vu.nl/globe/.
An Integrated Segmentation and Classification Approach Applied to Multiple Sclerosis Analysis
Authors: Ayelet Akselrod-Ballin, Meirav Galun, Ronen Basri, Achi Brandt, Moshe John Gomori, Massimo Filippi, Paula Valsasina
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present a novel multiscale approach that combines segmentation with classification to detect abnormal brain structures in medical imagery, and demonstrate its utility in detecting multiple sclerosis lesions in 3D MRI data. Our method uses segmentation to obtain a hierarchical decomposition of a multi-channel, anisotropic MRI scan. It then produces a rich set of features describing the segments in terms of intensity, shape, location, and neighborhood relations. These features are then fed into a decision tree-based classifier, trained with data labeled by experts, enabling the detection of lesions in all scales. Unlike common approaches that use voxel-by-voxel analysis, our system can utilize regional properties that are often important for characterizing abnormal brain structures. We provide experiments showing successful detections of lesions in both simulated and real MR images.