ppxscal/embedding_network huggingface dataset:
Optimizing a Linear Algorithm for Real-Time Robotic Control using Chronic Cortical Ensemble Recordings in Monkeys
Authors: Johan Wessberg
Venue: Journal of Cognitive Neuroscience (2004)

Previous work in our laboratory has demonstrated that a simple linear model can be used to translate cortical neuronal activity into real-time motor control commands that allow a robot arm to mimic the intended hand movements of trained primates. Here, we describe the results of a comprehensive analysis of the contribution of single cortical neurons to this linear model. Key to the operation of this model was the observation that a large percentage of cortical neurons located in both frontal and parietal cortical areas are tuned for hand position. In most neurons, hand position tuning was time-dependent, varying continuously during a 1-sec period before hand movement onset. The relevance of this physiological finding was demonstrated by showing that maximum contribution of individual neurons to the linear model was only achieved when optimal parameters for the impulse response functions describing time-varying neuronal position tuning were selected. Optimal parameters included impulse response functions with 1.0- to 1.4-sec time length and 50- to 100-msec bins. Although reliable generalization and long-term predictions (60&ndash;90 min) could be achieved after 10-min training sessions, we noticed that the model performance degraded over long periods. Part of this degradation was accounted by the observation that neuronal position tuning varied significantly throughout the duration (60&ndash;90 min) of a recording session. Altogether, these results indicate that the experimental paradigm described here may be useful not only to investigate aspects of neural population coding, but it may also provide a test bed for the development of clinically useful cortical prosthetic devices aimed at restoring motor functions in severely paralyzed patients.
Dynamic Algorithm Selection Using Reinforcement Learning
Authors: Warren Armstrong, Peter Christen, Eric McCreath, Alistair P. Rendell
Venue: Proceedings of the International Workshop on on Integrating AI and Data Mining (2006)

It is often the case that many algorithms exist to solve a single problem, each possessing different performance characteristics. The usual approach in this situation is to manually select the algorithm which has the best average performance. However, this strategy has drawbacks in cases where the optimal algorithm changes during an invocation of the program, in response to changes in the program's state and the computational environment. This paper presents a prototype tool that uses reinforcement learning to guide algorithm selection at runtime, matching the algorithm used to the current state of the computation. The tool is applied to a simulation similar to those used in some computational chemistry problems. It is shown that the low dimensionality of the problem enables the optimal choice of algorithm to be determined quickly, and that the learning system can react rapidly to phase changes in the target program.
Machine-Mediated Communication: The Technology
Authors: Adel Elsayed
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Advances in communication technology are pushing the boundaries of machine support from the pure signalling domain to the cognitive domain. This is giving rise to the new multidisciplinary approach of machine-mediated communication. In this context, machines need to be guided by a humancommunication paradigm. Moreover, with a diverse interest in this emerging area of research, a unified framework is required to which we could map the various contributions made by researchers. It is argued that a classification of the different types of user-machine interactions could be a starting point. In this classification, it is proposed that any type of interface activity could be identified as one or more of four types: observation, operation, conversation or articulation.
Blind identification of FIR channels carrying multiple finite alphabet signals
Authors: A.-J. van der Veen, S. Talwar, A. Paulraj
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The finite alphabet property of digital communication signals, along with oversampling techniques, enables the blind identification and equalization of an unknown FIR channel carrying a superposition of such signals, provided they have the same (known) period. Applied to multi-user wireless communications, the same framework allows the blind separation of multiple finite alphabet signals received at all arbitrary antenna arrays through an unknown multipath propagation environment with finite delay spread. An algorithm is proposed and tested on simulated data.
Deploying Auctions over Ad Hoc Networks
Authors: Alia Fourati, Khaldoun Al Agha
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

The emergence of new mobile and wireless networks, with novel capabilities, offers opportunities to widen classical Internet-based applications with new ways of use and possibilities. In this paper, we focus on a famous and widely used e-commerce application: auctions, and propose their deployment over ad hoc networks. We prove that such a novel mobile commerce application presents significant advantages with regard to conventional auction models. For the proposed auction model, we have particularly focused on crucial requirements generated by the ad hoc context. Actually, we have identified and then provided security and fairness requirements. Security is provided through threshold cryptography mechanisms, whereas fairness is provided on the basis of rounds duration calculation. Finally, a simulation model of our auctions scheme shows that the theoretical fair round duration can be optimized according to the number of bidders. Performances evaluation presents optimistic results promising a realistic and realizable deployment of this mobile auctions model.
The interlaced chirp Z transform
Authors: Indranil Sarkar, Adly T. Fam
Venue: Signal Processing (2006)

In this paper we introduce the interlaced chirp Z transform (Interlaced CZT), It is based on the computation of several carefully staggered CZT that are progressively interlaced to result in a spectrum that has denser frequency samples where needed. This simple modification of the CZT is shown to result in significant computational savings over the regular CZT, as well as the zoom CZT (ZCZT). The CZT computes uniformly spaced frequency samples over a desired range with an efficiency similar to that of the FFT algorithm. In practice, several CZT's over increasingly smaller ranges are required to obtain denser frequency samples where needed. This process is referred to as the ZCZT. The interlaced CZT improves on the ZCZT by interlacing successive CZT's such that, in each step, the previous samples are included with the new ones, resulting in dense frequency sampling with increased computational efficiency. The regular CZT is also compared to the ZCZT based on a typical regimen and the conditions under which either is superior are elucidated.
Metastability of CDMA cellular systems
Authors: Nelson Antunes, Christine Fricker, Philippe Robert, Danielle Tibi
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

In this paper, it is shown that the coexistence of a variety of different traffics in third generation cellular networks may lead to a very undesirable behavior of the whole network: a metastability property. When this property holds, the state of the network fluctuates on a very long time scale between different set of states. These long oscillations of the network make impossible to predict the average performances of some of the key characteristics of the connections, such as the handoff blocking rate or the probability of call blocking. As a consequence, the quality of service provided by such a network can be guaranteed only by, sometimes poor, lower bounds. Experiments of a UMTS network with this behavior are presented and the analysis of a corresponding simplified mathematical model is developed. The practical implications in the design of radio resource management for CDMA cellular networks are discussed.
Addressing a workload characterization study to the design of consistency protocols
Authors: Salvador Petit, Julio Sahuquillo, Ana Pont, David Kaeli
Venue: The Journal of Supercomputing (2006)

Shared Virtual Memory (SVM) provides a low-cost and effective way to implement the shared-memory programming paradigm. SVMs utilize a number of concepts that include consistency models/protocols, sharing patterns, false sharing, and fragmentation issues. The range of issues encountered in an SVM introduces a level of complexity and presents a challenge to many SVM researchers.This paper presents a careful study of SVM systems focusing on how the workload characteristics can affect the performace of consistency protocols. This knowledge is used to propose a novel consistency protocol that improves the system performance.This paper pursues two main goals: (i) to illustrate how different SVM workload characteristics are interrelated, and (ii) to motivate the design of a new multiple-writer memory consistency protocol. To achieve the first goal, we provide a detailed workload characterization analysis and discussion on how consistency models and protocols work. To achieve the second goal, we describe a software-based SVM protocol that achieves better performance than a hardware protocol proposed in the literature. In some workloads, the speedup obtained over the baseline protocol is more than 20%.
Including SMP in Grids as Execution Platform and Other Extensions in GRID Superscalar
Authors: Josep M. Perez, Rosa M. Badia, Jesus Labarta
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

GRID superscalar provides a very easy to use programming environment for enabling applications on the grid. Although the system already has many features, there are some areas that we wanted to enhance. In this paper we present a new version of GRID superscalar based on code annotations that includes full renaming support for scalar, array and structure parameters. We also present a tracing mechanism that allows fine tuning GRID superscalar applications, and improved support for running on SMP hosts.
Delay-dependent stability and stabilizability of uncertain jump bilinear stochastic systems with mode-dependent time-delays
Authors: Zhi-Hong Guan, Wu-Hua Chen, Jianxin Xu
Venue: International Journal of Systems Science (2005)

This paper considers the problems of robust stability and robust stabilizability for a class of uncertain jump bilinear stochastic systems with mode-dependent time delays. By transforming the jump system under consideration into an equivalent descriptor jump system, a new stochastic Lyapunov functional is introduced for stability analysis and control design. Novel delay-dependent sufficient conditions in terms of linear matrix inequalities are derived for robust stability and robust stabilizability. Two numerical examples are given for the illustration of the proposed theoretical results.
Adaptive Call Admission Control Based on Enhanced Genetic Algorithm in Wireless/Mobile Network
Authors: Sheng-Ling Wang, Yi-Bin Hou, Jian-Hui Huang, Zhang-Qin Huang
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

An adaptive threshold-based Call Admission Control (CAC) scheme used in wireless/mobile network for multiclass services is proposed. In the scheme, each class's CAC thresholds are solved through establishing a rewardpenalty model which tries to maximize network's revenue in terms of each class's average new call arrival rate and average handoff call arrival rate, the reward or penalty when network accepts or rejects one class's call etc. To guarantee the real time running of CAC algorithm, an enhanced Genetic Algorithm is designed. Analyses show that the CAC thresholds indeed change adaptively with the average call arrival rate. The performance comparison between the proposed scheme and Mobile IP Reservation(MIR) scheme shows that with the increase of average call arrival rate, the average new Call Blocking Probability(CBP) and the average Handoff Dropping Probability (HDP) within 2000 simulation intervals of the proposed scheme are confined to lower levels, and they show approximatively periodical trends of first rise and then decline. While these two performance metrics of MIR always increase. At last, the analysis shows the proposed scheme outperforms MIR in terms of network's revenue.
Regression-based Hand Pose Estimation from Multiple Cameras
Authors: Teofilo E. de Campos, David W. Murray
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The RVM-based learning method for whole body pose estimation proposed by Agarwal and Triggs is adapted to hand pose recovery. To help overcome the difficulties presented by the greater degree of self-occlusion and the wider range of poses exhibited in hand imagery, the adaptation proposes a method for combining multiple views. Comparisons of performance using single versus multiple views are reported for both synthesized and real imagery, and the effects of the number of image measurements and the number of training samples on performance are explored.
A Negotiation Model for Ontology Mapping
Authors: Cassia Trojahn, Marcia Moraes, Paulo Quaresma, Renata Vieira
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper presents an agent negotiation model for ontology mapping. We consider that different agents working on the basis of particular approaches arrive to distinct mapping results that must be shared, compared, chosen and agreed. Then, the final mapping result must reflect a better solution than individual approaches.
A GRID based Framework and tools for automating production of cross media content
Authors: Pierfrancesco Bellini, Ivan Bruno, Paolo Nesi
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

The evolution of content distribution for entertainment and infotainment is urging better pricing and value-for-money for industry products and services. Content providers, aggregators and distributors constantly need to adopt innovative means for reducing costs and to satisfy the user needs. AXMEDIS Framework aims at providing technical solutions and tools for automating content production, formatting, protection and distribution. The solution described in the paper was designed as a distributed environment based on the GRID technology and provides an efficient management of content production/finalization as well as the dynamic service discovery and composition, distributed resource management and adaptive media delivery. AXMEDIS is a large IST FP6 Integrated Project of Research and Development, in which a set of enabling technologies are developed to cope with the above mentioned problems.
Multi-Resolution Spin-Images
Authors: H. Quynh Dinh, Steven Kropac
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Johnson and Hebert's spin-images have been applied to the registration of range images and object recognition with much success because they are rotation, scale, and pose invariant. In this paper we address two issues concerning spin-images, namely: (1) comparing uncompressed spinimages across large datasets is costly, and (2) a method to select the appropriate bin size and image width for spinimages is not clearly defined.Our solution to these issues is a multi-resolution method that generates a pyramid of spin-images by successively decreasing the spin-image size by powers of two. To efficiently correlate surface points, we compare spin-images in a low-to-high resolution manner. Once multi-resolution spin-images are generated for a given object, we have found that the different resolutions can also be used to compare objects that have differing or non-uniform point densities. To select the appropriate bin sizes for comparing such objects, we use the ratio of the average edge lengths of the objects. We also show preliminary results of using the pyramid to converge on the appropriate image width by traversing the pyramid in a low-to-high resolution manner looking for the highest resolution at which the fewest number of highly correlated points are found to match a given feature point.
Marker method for the solution of nonlinear diffusion equations
Authors: Jerome L. V. Lewandowski
Venue: Journal of Computational and Applied Mathematics (2006)

The marker method for the solution of nonlinear diffusion equations is described. The method relies on the definition of a convective field associated with the underlying partial differential equation; the information about the approximate solution is associated with the response of an ensemble of markers to this convective field. Some key aspects of the method, such as the selection of the shape function and the initial loading, are discussed in some detail. Numerical experiments show that the method is accurate in determining the long time behavior of nonlinear diffusion equations. The marker method can be applied to an ensemble of nonlinear dispersive partial differential equations.
Using Ontologies to Support Customisation and Maintain Interoperability in Distributed Information Systems with Application to the Domain Name System
Authors: Nickolas J. G. Falkner, Paul D. Coddington, Andrew L. Wendelborn
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Global distributed systems must be standards-based to allow interoperability between all of their components. While this guarantees interoperability, it often causes local inflexibility and an inability to adapt to specialised local requirements. We show how local flexibility and global consistency can coexist by changing the way that we represent these systems. The proven technologies already in use in the Semantic Web, to support and interpret metadata annotation, provide a well-tested starting point. We can use OWL ontologies and RDF to describe distributed systems using a knowledge-based approach. This allows us to maintain separate local and global operational spaces which, in turn, gives us local flexibility and global consistency. The annotated and well-defined data is better structured, more easily maintained and less prone to errors since its purpose can be clearly determined prior to use. To illustrate the application of our approach in distributed systems, we present our implementation of an ontologically-based Domain Name System (DNS) server and client. We also present performance figures to demonstrate that the use of this approach does not add significant overhead to system performance.
Combining linguistic and statistical analysis to extract relations from web documents
Authors: Fabian M. Suchanek, Georgiana Ifrim, Gerhard Weikum
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

The World Wide Web provides a nearly endless source of knowledge, which is mostly given in natural language. A first step towards exploiting this data automatically could be to extract pairs of a given semantic relation from text documents - for example all pairs of a person and her birthdate. One strategy for this task is to find text patterns that express the semantic relation, to generalize these patterns, and to apply them to a corpus to find new pairs. In this paper, we show that this approach profits significantly when deep linguistic structures are used instead of surface text patterns. We demonstrate how linguistic structures can be represented for machine learning, and we provide a theoretical analysis of the pattern matching approach. We show the benefits of our approach by extensive experiments with our prototype system LEILA.
Vendors Upgrade Their Physics Processing to Improve Gaming
Authors: David Geer
Venue: Computer (2006)

Graphics-engine vendors are looking or ways to improve the processing of the calculations necessary to create more realistic effects and interactions between players and game objects.
A Consensus-Based Approach for Ontology Integration
Authors: Ngoc Thanh Nguyen, Michal Rusin
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Ontologies become a very important elements of modern information systems. In many cases creating a new system involves performing integration of existing ontologies. During the integration process it is often necessary to resolve conflicts between ontologies. In this paper we focus on ontology conflicts which appear in integration process on the instance level. We propose algorithms which use consensus methods and can be used to integrate selected structures in ontology.
Mining quantitative correlated patterns using an information-theoretic approach
Authors: Yiping Ke, James Cheng, Wilfred Ng
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Existing research on mining quantitative databases mainly focuses on mining associations. However, mining associations is too expensive to be practical in many cases. In this paper, we study mining correlations from quantitative databases and show that it is a more effective approach than mining associations. We propose a new notion of Quantitative Correlated Patterns (QCPs), which is founded on two formal concepts, mutual information and all-confidence. We first devise a normalization on mutual information and apply it to QCP mining to capture the dependency between the attributes. We further adopt all-confidence as a quality measure to control, at a finer granularity, the dependency between the attributes with specific quantitative intervals. We also propose a supervised method to combine the consecutive intervals of the quantitative attributes based on mutual information, such that the interval combining is guided by the dependency between the attributes. We develop an algorithm, QCoMine, to efficiently mine QCPs by utilizing normalized mutual information and all-confidence to perform a two-level pruning. Our experiments verify the efficiency of QCoMine and the quality of the QCPs.
Change Point Analysis for Sequence of Normal MeansBased on Multiple Comparison Procedure
Authors: Tsunehisa Imada, Hideyuki Douke
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this study we consider change point analysis for a sequence of normal means. Specifically, we construct a procedure for finding all change points in a single test by using multiple comparison procedure.We determine the critical value for pairwise comparisonfor a specified significance level.Then we consider the power of the test for our multiple compairson procedure.Finally we give some numerical examples regarding the critical value and the power of the test.
Graphs and obstructions in four dimensions
Authors: Hein van der Holst
Venue: Journal of Combinatorial Theory Series B (2006)

For any graph G = (V, E) without loops, let C2(G) denote the regular CW-complex obtained from G by attaching to each circuit C of G a disc. We show that if G is the suspension of a flat graph, then C2(G) has an embedding into 4-space. Furthermore, we show that for any graph G in the collection of graphs that can be obtained from K7 and K3,3,1,1 by a series of ΔY- and YΔ-transformations, c2(G) cannot be embedded into 4-space.