ppxscal/embedding_network huggingface dataset:
Processing Objects at Different Levels of Specificity
Authors: L. K. Tyler, E. A. Stamatakis, P. Bright, K. Acres, S. Abdallah, J. M. Rodd, H. E. Moss
Venue: Journal of Cognitive Neuroscience (2004)

How objects are represented and processed in the brain is a central topic in cognitive neuroscience. Previous studies have shown that knowledge of objects is represented in a feature-based distributed neural system primarily involving occipital and temporal cortical regions. Research with nonhuman primates suggest that these features are structured in a hierarchical system with posterior neurons in the inferior temporal cortex representing simple features and anterior neurons in the perirhinal cortex representing complex conjunctions of features (Bussey & Saksida, 2002; Murray & Bussey, 1999). On this account, the perirhinal cortex plays a crucial role in object identification by integrating information from different sensory systems into more complex polymodal feature conjunctions. We tested the implications of these claims for human object processing in an event-related fMRI study in which we presented colored pictures of common objects for 19 subjects to name at two levels of specificity - basic and domain. We reasoned that domain-level naming requires access to a coarser-grained representation of objects, thus involving only posterior regions of the inferior temporal cortex. In contrast, basic-level naming requires finer-grained discrimination to differentiate between similar objects, and thus should involve anterior temporal regions, including the perirhinal cortex. We found that object processing always activated the fusiform gyrus bilaterally, irrespective of the task, whereas the perirhinal cortex was only activated when the task required finer-grained discriminations. These results suggest that the same kind of hierarchical structure, which has been proposed for object processing in the monkey temporal cortex, functions in the human.
A generic recursion toolbox for Haskell or: scrap your boilerplate systematically
Authors: Deling Ren, Martin Erwig
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

Haskell programmers who deal with complex data types often need to apply functions to specific nodes deeply nested inside of terms. Typically, implementations for those applications require so-called boilerplate code, which recursively visits the nodes and carries the functions to the places where they need to be applied. The scrap-your-boilerplate approach proposed by Lämmel and Peyton Jones tries to solve this problem by defining a general traversal design pattern that performs the traversal automatically so that the programmers can focus on the code that performs the actual transformation.In practice we often encounter applications that require variations of the recursion schema and call for more sophisticated generic traversals. Defining such traversals from scratch requires a profound understanding of the underlying mechanism and is everything but trivial.In this paper we analyze the problem domain of recursive traversal strategies, by integrating and extending previous approaches. We then extend the scrap-your-boilerplate approach by rich traversal strategies and by a combination of transformations and accumulations, which leads to a comprehensive recursive traversal library Reclib in a statically typed framework.We define a two-layer library targeted at general programmers and programmers with knowledge in traversal strategies. The highlevel interface defines a universal combinator that can be customized to different one-pass traversal strategies with different coverage and different traversal order. The lower-layer interface provides a set of primitives that can be used for defining more sophisticated traversal strategies such as fixpoint traversals. The interfaceis simple and succinct. Like the original scrap-your-boilerplate approach, it makes use of rank-2 polymorphism and functional dependencies, implemented in GHC.
Distributed web-based expert system for launch operations
Authors: Jorge E. Bardina, Rajkumar Thirumalainambi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The simulation and modeling of launch operations is based on a representation of the organization of the operations suitable to experiment of the physical, procedural, software, hardware and psychological aspects of space flight operations. The virtual test bed consists of a weather expert system to advice on the effect of weather to the launch operations. It also simulates toxic gas dispersion model, and the risk impact on human health. Since all modeling and simulation is based on the internet, it could reduce the cost of operations of launch and range safety by conducting extensive research before a particular launch. Each model has an independent decision making module to derive the best decision for launch.
Consistent estimation of autoregressive parameters from noisy observations based on two interacting Kalman filters
Authors: D. Labarre, E. Grivel, Y. Berthoumieu, E. Todini, M. Najim
Venue: Signal Processing (2006)

The estimation of the parameters of an autoregressive process (AR) from noisy observations is still a challenging problem. In this paper, we propose to sequentially estimate both the signal and the parameters, avoiding a non-linear approach such as the extended Kalman filter. The method is based on two conditionally linked Kalman filters running in parallel. Once a new observation is available, the first filter uses the latest estimated AR parameters to estimate the signal, while the second filter uses the estimated signal to update the AR parameters. This approach can be viewed as a recursive instrumental variable-based method and hence has the advantage of providing consistent estimates of the parameters from noisy observations. A comparative study with existing algorithms illustrates the performances of the proposed method when the additive noise is either white or coloured.
Numerical solution of nonlinear wave equations in stratified dispersive media
Authors: Ch. Karle, J. Schweitzer, M. Hochbruck, E. W. Laedke, K. H. Spatschek
Venue: Journal of Computational Physics (2006)

Nonlinear wave motion in dispersive media is solvecl numerically. The model applies to laser propagation in a relativistic plasma. The latter causes, besides dispersion, nonlinear effects due to relativistic mass variation in the presence of strong laser pulses. A new variant of the Gautschi-type integrator for reducing the number of time steps is proposed as a fast solver for such nonlinear wave-equations. In order to reduce the number of spatial grid points, a physically motivated quasi-envelope approach (QEA) is introduced. The new method turns out to reduce the computational time significantly compared to the standard leap-frog scheme.
Cross-Modal Interactions between Audition, Touch, and Vision in Endogenous Spatial Attention: ERP Evidence on Preparatory States and Sensory Modulations
Authors: Martin Eimer, José Van Velzen, Jon Driver
Venue: Journal of Cognitive Neuroscience (2002)

Recent behavioral and event-related brain potential (ERP) studies have revealed cross-modal interactions in endogenous spatial attention between vision and audition, plus vision and touch. The present ERP study investigated whether these interactions reflect supramodal attentional control mechanisms, and whether similar cross-modal interactions also exist between audition and touch. Participants directed attention to the side indicated by a cue to detect infrequent auditory or tactile targets at the cued side. The relevant modality (audition or touch) was blocked. Attentional control processes were reflected in systematic ERP modulations elicited during cued shifts of attention. An anterior negativity contralateral to the cued side was followed by a contralateral positivity at posterior sites. These effects were similar whether the cue signaled which side was relevant for audition or for touch. They also resembled previously observed ERP modulations for shifts of visual attention, thus implicating supramodal mechanisms in the control of spatial attention. Following each cue, single auditory, tactile, or visual stimuli were presented at the cued or uncued side. Although stimuli in task-irrelevant modalities could be completely ignored, visual and auditory ERPs were nevertheless affected by spatial attention when touch was relevant, revealing cross-modal interactions. When audition was relevant, visual ERPs, but not tactile ERPs, were affected by spatial attention, indicating that touch can be decoupled from cross-modal attention when task-irrelevant.
Visualization by information type on mobile device
Authors: Hee Yong Yoo, Suh Hyun Cheon
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

The number of mobile device users is increasing for its convenience of information searching and its guaranteed mobility. Unlike desktop environment with large display screens, these mobile devices have a limitation to present information on small screens. Though hardware performance of mobile device is improving, the problem of displaying information on such small screens will still remain. This paper proposes information visualization method as a solution to the above problem. Information visualization method effectively layouts and efficiently navigates information on small a screen considering given resources and process power of mobile devices.
Post-sampling aliasing control for natural images
Authors: D. A. F. Florencio, R. W. Schafer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Sampling and reconstruction are usually analyzed under the framework of linear signal processing. Powerful tools like the Fourier transform and optimum linear filter design techniques, allow for a very precise analysis of the process. In particular, an optimum linear filter of any length can be derived under most situations. Many of these tools are not available for non-linear systems, and it is usually difficult to find an optimum non-linear system under any criteria. The authors analyze the possibility of using non-linear filtering in the interpolation of subsampled images. They show that a very simple (5/spl times/5) non-linear reconstruction filter outperforms (for the images analyzed) linear filters of up to 256/spl times/256, including optimum (separable) Wiener filters of any size.
Reducing lead time for modeling in CAD simulation softwares
Authors: Jai Thomas, Mitchel J. Keil, Jorge Rodriguez
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Flexible components, such as rubber hoses, are subject to large elastic deformations during movement of the rigid components to which they are attached. Currently, there is no inherent capability in any solid modeling software to accurately depict the shape of the hose between any two attachment points. Keil (2001) made the hose model in ADAMS/View simulation software. Keil (2002) stated that it is a very time consuming and cumbersome process to set up the model with the flexible beams and its associated joints for modeling of a flexible body without any user errors. This paper presents a method to automatically build a flexible element model using the principles of spatial orientation and vector mathematics. These accurate mathematical principles would maintain the precision in the flexible element model as suggested by Keil while reducing the time for building a hose model to minutes from hours.
Semantic Learning for Audio Applications: A Computer Vision Approach
Authors: Rahul Sukthankar, Yan Ke, Derek Hoiem
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Recent work in machine learning has significantly benefited semantic extraction tasks in computer vision, particularly for object recognition and image retrieval. We argue that the computer vision techniques that have been successfully applied in those settings can effectively be translated to other domains, such as audio. This claim is supported by recent results in music vs. speech classification, structure from sound, robust music identification and sound object recognition. This paper focuses on two such audio applications and demonstrates how ideas from computer vision map naturally to these problems.
Demonic fixed points
Authors: Fairouz Tchier
Venue: Acta Cybernetica (2006)

We deal with a relational model for the demonic semantics of programs. The demonic semantics of a while loop is given as a fixed point of a function involving the demonic operators. This motivates us to investigate the fixed points of these functions. We give the expression of the greatest fixed point with respect to the demonic ordering (demonic inclusion) of the semantic function. We prove that this greatest fixed coincides with the least fixed point with respect to the usual ordering (angelic inclusion) of the same function. This is followed by an example of application.
Implementing a Native IMS Location Service Enabler over a Prototypical IMS Core Network Testbed
Authors: Peter Reichl, Sandford Bessler, Joachim Fabini, Rudolf Pailer, Joachim Zeiss
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 imminent introduction of the 3GPP IP Multimedia Subsystem (IMS) into commercial mobile networks is considered to be a major step towards All-IP based Next Generation Networks. This has immediate consequences both for the migration of the core network as well as the integration of future mobile services and applications. This paper presents an experimental testbed which has been designed as a minimal standard-compliant IMS core network. We discuss major practical requirements and describe our implementation of this "IMS in a bottle" approach. Furthermore, we introduce an IMS native location service enabler based on the IMS Presence System and demonstrate that this service can be integrated efficiently into the IMS core environment.
The use of discrete event simulation in a design for six sigma project
Authors: Michael J. Seifert
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes how a risk event to customer satisfaction for a food service facility was identified, validated, and eventually mitigated through the use of a discrete event simulation as part of a Design for Six Sigma project. Further described is how simulation was utilized to identify leading indicators to the risk event, to give pre-warning of the occurrence as well as to perform what if tests to validate mitigation practices and contingency plans. The results presented demonstrate how a simulation model coupled with Six Sigma can design a superior process in regards to predictability and reliability.
Trust-based agent community for collaborative recommendation
Authors: Jianshu Weng, Chunyan Miao, Angela Goh, Zhiqi Shen, Robert Gay
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

There exist a number of similarity-based recommendation communities, within which similar users' opinions are collected by users' agents to make predictions of their opinions on a new item. Similarity-based recommendation communities suffer from some significant limitations, such as scalability and susceptibility to the noise. In this paper, we propose a trust-based community to overcome these limitations. The trust-based recommendation community incorporates trust into the domain of item recommendation. Experimental results based on a real dataset show that trust-based community manages to outperform its similarity-based counterpart in terms of prediction accuracy, coverage, and robustness in the presence of noise.
Invariant cones and convex sets for bilinear control systems and parabolic type of semigroups
Authors: O. G. Do Rocio, L. A. B. San Martin, A. J. Santana
Venue: Journal of Dynamical and Control Systems (2006)

This paper studies invariant cones for bilinear control systems and relates them to the controllability of the system. The full picture is provided by the parabolic type of a semigroup.
Handling Overload in Publish/Subscribe Systems
Authors: Zbigniew Jerzak, Christof Fetzer
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

A new approach for handling overload in Publish/ Subscribe systems is presented. We address the issues of how to cope (1) with the limitations imposed by the external environment (e.g., network congestion or link failures) and (2) the limitations resulting directly from within the service itself (e.g., high message load). These two issues are handled in a graceful way while ensuring that the most valuable information is given the highest chance of a successful delivery.
Incremental Learning By Decomposition
Authors: Abdelhamid Bouchachia
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Adaptivity in neural networks aims at equipping learning algorithms with the ability to self-update as new training data becomes available. In many application, data arrives over long periods of time, hence the traditional one-shot training phase cannot be applied. The most appropriate training methodology in such circumstances is incremental learning (IL). The present paper introduces a new IL algorithm dedicated to classification problems. The basic idea is to incrementally generate prototyped categories which are then linked to their corresponding classes. Numerical simulations show the performance of the proposed algorithm.
Computing in the Presence of Timing Failures
Authors: Gadi Taubenfeld
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints are not met. In the immense body of work on the designing fault-tolerant systems, the type of failures that are usually considered are, process failures, link failures, messages loss and memory failures; and it is usually (implicitly) assumed that there are no timing failures. In this paper we investigate the ability to recover automatically from transient timing failures. We introduce and formally define the concept of algorithms that are resilient to timing failures, and demonstrate the importance of the new concept by presenting consensus and mutual exclusion algorithms, using atomic registers only, that are resilient to timing failures.
Joint Optimization of Word Alignment and Epenthesis Generation for Chinese to Taiwanese Sign Synthesis
Authors: Yu-Hsien Chiu Chung-Hsien Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This work proposes a novel approach to translate Chinese to Taiwanese sign language and to synthesize sign videos. An aligned bilingual corpus of Chinese and Taiwanese Sign Language (TSL) with linguistic and signing information is also presented for sign language translation. A two-pass alignment in syntax level and phrase level is developed to obtain the optimal alignment between Chinese sentences and Taiwanese sign sequences. For sign video synthesis, a scoring function is presented to develop motion transition-balanced sign videos with rich combinations of intersign transitions. Finally, the maximum a posteriori (MAP) algorithm is employed for sign video synthesis based on joint optimization of two-pass word alignment and intersign epenthesis generation. Several experiments are conducted in an educational environment to evaluate the performance on the comprehension of sign expression. The proposed approach outperforms the IBM Model 2 in sign language translation. Moreover, deaf students perceived sign videos generated by the proposed method to be satisfactory.
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Authors: Ralf Kusters
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Finding such extensions has turned out to be a nontrivial task. In this work, we propose a simple, yet expressive general computational model for systems of Interactive Turing Machines (ITMs) where the runtime of the ITMs may be polynomial per activation and may depend on the length of the input received. One distinguishing feature of our model is that the systems of ITMs that we consider involve a generic mechanism for addressing dynamically generated copies of ITMs. We study properties of such systems and, in particular, show that systems satisfying a certain acyclicity condition run in polynomial time. Based on our general computational model, we state different notions of simulation-based security in a uniform and concise way, study their relationships, and prove a general composition theorem for composing a polynomial number of copies of protocols, where the polynomial is determined by the environment. The simplicity of our model is demonstrated by the fact that many of our results can be proved by mere equational reasoning based on a few equational principles on systems.
A duality between q-multiplicities in tensor products and q-multiplicities of weights for the root systems B, C or D
Authors: Cédric Lecouvey
Venue: Journal of Combinatorial Theory Series A (2006)

Starting from Jacobi-Trudi type determinantal expressions for the Schur functions of types B, C and D, we define a natural q-analogue of the multiplicity [V(λ) : M(µ)] when M(µ) is a tensor product of row or column shaped modules defined by µ. We prove that these q-multiplicities are equal to certain Kostka-Foulkes polynomials related to the root systems C or D. Finally we express the corresponding multiplicities in terms of Kostka numbers.
Context-aware Caching for Wireless Internet Applications
Authors: Wenlan Feng, Liang Zhang, Beihong Jin, Zhihua Fan
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

The recent advances in wireless networking technologies and the growing success of mobile computing devices, such as PDA, pocket PC and third generation mobile phone, are enabling new classes of applications that present challenging problems to designers. The intrinsic constraints from limited device resources and frequent mobile disconnections cause that wireless applications can not be working smoothly as those in the traditional wired internet. Context-aware caching is a suitable approach to improve the quality of services in wireless applications. In this paper, we describe a context model, by which all contexts is divided into three categories as sensed, defined and derived. For the context prediction and selection in caching, we propose a weight-based data hoarding algorithm to select or update cached data objects. Two applications are introduced throughout in this paper to illustrate the effectiveness of context-aware caching.
Thorough Checking Revisited
Authors: Shiva Nejati, Mihaela Gheorghiu, Marsha Chechik
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

Recent years have seen a proliferation of 3-valued models for capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about such systems is either inexpensive and imprecise (compositional checking), or expensive and precise (thorough checking). In this paper, we prove that thorough and compositional checks for temporal formulas in their disjunctive forms coincide, which leads to an effective procedure for thorough checking of a variety of abstract models and the entire \mu-calculus.
Why spoofing is serious internet fraud
Authors: Tamara Dinev
Venue: Communications of the ACM (2006)

Fake Web sites fool the unwary into divulging personal data, undermining all consumers' trust in e-commerce, no matter how trustworthy the authentic online business truly is.