ppxscal/embedding_network huggingface dataset:
Robust multi-target tracking using spatio-temporal context
Authors: Hieu T. Nguyen, Qiang Ji, Arnold W. M. Smeulders
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In multi-target tracking, the maintaining of the correct identity of targets is challenging. In the presented tracking method, accurate target identification is achieved by incorporating the appearance information of the spatial and temporal context of each target. The spatial context of a target involves local background and nearby targets. The first contribution of the paper is to provide a new discriminative model for multi-target tracking with the embedded classification of each target against its context. As a result, the tracker not only searches for the image region similar to the target but also avoids latching on nearby targets or on a background region. The temporal context of a target includes its appearances seen during tracking in the past. The past appearances are used to train a probabilistic PCA that is used as the measurement model of the target at the present. As the second contribution, we develop a new incremental scheme for probabilistic PCA. It can update accurately the full set of parameters including a noise parameter still ignored in related literature. The experiments show robust tracking performance under the condition of severe clutter, occlusions and pose changes.
Scientific visualization as an interpretive and expressive medium
Authors: Douglas N. Gordin, Daniel C. Edelson, Louis M. Gomez
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

As a powerful technique for the visual representation of complex data, scientific visualization offers the potential to help secondary school science students learn through active inquiry. Over a period of several years, we have been conducting research in the design of scientific visualization environments that support inquiry-based learning. The goal is to support students in a multi-stage learning process that culminates in open-ended research projects. In the early stages, learners should gain familiarity with scientific visualization techniques and the phenomena depicted. In the later stages, students conduct investigations that use scientific visualization techniques to explore open-ended questions. Through the process of conducting inquiry with scientific visualization students can gain an understanding of its usefulness for originating and answering scientific questions.
Mark D'Esposito with Michael S. Gazzaniga
Authors: Staff
Venue: Journal of Cognitive Neuroscience (2004)

Fifteen years ago, Mike Gazzaniga founded the Journal of Cognitive Neuroscience. This year, Mike has decided to step down as Editor-in-Chief and pass on the torch. From the humble beginnings of putting together JOCN in his garage, Mike has transformed JOCN into the leading voice of cognitive neuroscientists, and a journal on steep upward trajectory. This is a tough act to follow and these are big shoes to fill. With the start of JOCN, and a few years later the Cognitive Neuroscience Society, Mike launched a scientific discipline. As the new Editors and I undertake the enormous responsibility of carrying on Mike's tradition of handling the publication of JOCN with innovation and integrity, we thought it would be appropriate to begin a our first issue with a few words from Mike himself. As you will see, we have asked him some difficult questions, and as usual, Mike's answers are not only remarkably insightful but will undoubtedly guide and inspire us regarding our direction over the next fifteen years. 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
A Tree for All Seasons
Authors: George Mihaila, Ioana Stanoi
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

The performance of in-memory databases is significantly affected by the number of data blocks fetched from memory into the processor-resident cache. In recent years, various tree-based indexes have been proposed for main memory databases. A common assumption in the analysis of these indexes is that there is no data in the cache that can be reused between key lookups, i.e. the system has a cold cache for each lookup. In practice, though, the "temperature of the cache is strongly dependent on the application. For example, a warm cache is typical for OLTP applications that query the same index over and over with little computation in between lookups. In this paper, we present a comparative study of the cache behavior of various B+-tree-based indexes which shows that none of them performs best in all cases. Also, we propose a lightweight technique for improving the cache behavior of any B+-tree based index that performs best in all settings.
Dynamic Adaptive Navigation via MAIS Reflective Framework
Authors: Marzia Adorni, Daniela Micucci
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

The wide diffusion of mobile devices and the increasing availability of wireless networks claim applications able to adapt their behaviour with respect to the running context. This paper presents Dynamic Adaptive Navigation (DAN), a novel approach that may be exploited to build adaptive information systems. DAN provides the user with different navigation modalities. The observation of QoS features concerning the users, the devices, and the network drive the selection of the actual navigation modality that is intended as the best available. The navigation modalities are modelled via graphs describing the synthesis/expansion process that must be performed on the information. Applications to be adaptive, either implicitly or explicitly, rely on reflection. Since DAN may be used to build adaptive applications, it should rely on reflective mechanisms too. DAN exploits the ones provided by the MAIS (Multichannel Adaptive Information System) architecture. Indeed, MAIS provides via reflective classes the visibility of the QoS-related aspects of the underlying system objects, being them devices or users. Finally, to verify the usefulness of the ideas, DAN approach has been chosen to develop a new version of PDBudget, a system that supports the academic administration in analysing and evaluating the didactic workload for each lecturer at the University of Milano-Bicocca.
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
Authors: Lawrence M. Leemis, Matthew J. Duggan, John H. Drew, Jeffrey A. Mallozzi, Kerry W. Connell
Venue: Networks (2006)

We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, series-parallel reduction, and conditioning. Examples illustrate the use of the three techniques. &copy; 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(3), 143&ndash;165 2006
Automation of constructing equations of geometric objects in the method of R-functions
Authors: K. V. Maksimenko-Sheiko, A. M. Matsevityi, T. I. Sheiko
Venue: Cybernetics and Systems Analysis (2006)

Based on R-functions, a general algorithm is proposed for automatic construction of predicate and analytical functions of a geometrical object consisting of a given list of standard primitives. Normalized functions of standard primitives with alphabetic parameters are constructed that determine the position, sizes, and orientation of the primitives. The capabilities of automation of constructing equations of geometrical objects from standard primitives are illustrated with the help of the system POLYE.
Generalized Indexing for Energy-Efficient Access to Partially Ordered Broadcast Data inWireless Networks
Authors: Dimitrios Katsaros, Nikos Dimokas, Yannis Manolopoulos
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Energy conservation and access efficiency are two fundamental though competing goals in broadcastwireless networks. To tackle the energy penalty from sequential searching, the interleaving of index with data items has been proposed. Although, quite important contributions exist on providing broadcast indexes, they have one or more of the following problems. Firstly, all of them assume total ordering among broadcast data, and none considers the more general case of partial ordering. Secondly, they are balanced structures, which does not fit the "linear (one-dimensional) structure" of the wireless medium, in which imbalanced structures may offer significant advantages. Thirdly, they do not take into account the skewness in the access pattern, which prohibits larger performance gains to be reaped. Finally, they require all index items to be of equal size, which may not always give the optimal performance. To cope with all these problems, we introduce a new imbalanced treestructured index. The new index is shown to be a generalization of two previously proposed high-performance indexes, and it introduces for the first time the problem of indexing partially ordered broadcast data. We present an experimental analysis of the proposed method, contrasting it with competing techniques. The analysis exhibits the efficiency of the proposed index in reducing the energy consumption without noticeably worsening the access latency.
Energy Reduction through Crosstalk Avoidance Coding in NoC Paradigm
Authors: Partha Pratim Pande, Haibo Zhu, Amlan Ganguly, Cristian Grecu
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Commercial designs are currently integrating from 10 to 100 embedded functional and storage blocks in a single SoC and the number is likely to increase significantly in the near future. With this ever increasing degree of integration, design of communication architectures for big SoCs is a challenge. The communication requirements of these large Multi Processor SoCs (MP-SoCs) are convened by the emerging network-on-a-chip (NoC) paradigm. The basic operations of NoC infrastructures are governed by on-chip packet-switched networks. Crosstalk between adjacent wires is an issue in NoC communication fabrics and it can cause timing violations and extra power dissipation. Crosstalk avoidance codes (CACs) can be used to improve signal integrity and also reduce the coupling capacitance and hence the energy dissipation of a wire segment. By incorporating Crosstalk Avoidance Coding (CAC) in NoC data streams we are able to reduce communication energy, which will help to decrease the energy dissipation as a whole.
One-sided Post-processing for the Discontinuous Galerkin Method Using ENO Type Stencil Choosing and the Local Edge Detection Method
Authors: Rick Archibald, Anne Gelb, Sigal Gottlieb, Jennifer Ryan
Venue: Journal of Scientific Computing (2006)

In a previous paper by Ryan and Shu [Ryan, J. K., and Shu, C.-W. (2003). \hboxMethods Appl. Anal. 10(2), 295---307], a one-sided post-processing technique for the discontinuous Galerkin method was introduced for reconstructing solutions near computational boundaries and discontinuities in the boundaries, as well as for changes in mesh size. This technique requires prior knowledge of the discontinuity location in order to determine whether to use centered, partially one-sided, or one-sided post-processing. We now present two alternative stencil choosing schemes to automate the choice of post-processing stencil. The first is an ENO type stencil choosing procedure, which is designed to choose centered post-processing in smooth regions and one-sided or partially one-sided post-processing near a discontinuity, and the second method is based on the edge detection method designed by Archibald, Gelb, and Yoon [Archibald, R., Gelb, A., and Yoon, J. (2005). SIAM J. Numeric. Anal. 43, 259---279; Archibald, R., Gelb, A., and Yoon, J. (2006). Appl. Numeric. Math. (submitted)]. We compare these stencil choosing techniques and analyze their respective strengths and weaknesses. Finally, the automated stencil choices are applied in conjunction with the appropriate post-processing procedures and it is determine that the resulting numerical solutions are of the correct order.
Efficient Recommender Systems
Authors: Dirk Bergemanm, Deran Ozmen
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)

We study the efficient allocation of buyers in the presence of recommender systems. A recommender system affects the market in two ways: (i) it creates value by reducing product uncertainty for the customers and hence (ii) its recommendations can be offered as add-ons, which generates informational externalities. We investigate the impact of these factors on the efficient allocation of buyers across different products. We find that the efficient allocation requires that the seller with the recommender system has full market share. If the recommender system is sufficiently effective in reducing uncertainty, it is optimal to have some products to be purchased by a larger group of people than others. The large group consists of customers with flexible tastes.
Modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting
Authors: Huahao Shou, Hongwei Lin, Ralph R. Martin, Guojin Wang
Venue: Journal of Computational and Applied Mathematics (2006)

This paper extends the modified affine arithmetic in matrix form method for bivariate polynomial evaluation and algebraic curve plotting in 2D to modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting in 3D. Experimental comparison shows that modified affine arithmetic in tensor form is not only more accurate but also much faster than standard affine arithmetic when evaluating trivariate polynomials.
Low rank detection of multichannel Gaussian signals using a constrained inverse
Authors: P. Strobach
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

A constructive procedure for the design of low rank detectors in the multichannel case of Gaussian detection of known transient signals in noise is described. These detectors consist of two consecutive blocks: a data and noise dependent "compression stage" which maps the significant signal energy into a subspace of minimal dimension followed by a minimal set of subspace matched filters which point in the directions in which the signal is much stronger than the noise. 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
Conditional Fault-Tolerant Hamiltonicity of Star Graphs
Authors: Jung-Sheng Fu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The star graph possesses many nice topological properties. In this study, we show that for any n dimensional star graph (n \geqslant 4) with2n \leqslant - 7 edge faults in which each node is incident to at least two non-faulty edges, there exists a fault-free Hamiltonian cycle. Compare with the corresponding study in hypercube, our method is rather succinct.
Adaptive provisioning using virtual machines and autonomous role-based management
Authors: Kyrre Begnum, Mark Burgess, John Sechrest
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

A modern server system must deliver a complex set of obligations towards its users. We study the concept of roles as autonomous encapsulations of a set of promises. Using virtualization and configuration management, every defined role for a reallife computer system can be realized as a self managing agent that is aware of other, related roles within the same broader context. A prototype implementation that provides web hotel services for customers is presented and discussed.
SIP Terminal Mobility for both IPv4 and IPv6
Authors: Che-Hua Yeh, Quincy Wu, Yi-Bing Lin
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Session Initiation Protocol (SIP) supports application layer mobility during a session. In this paper the architecture design on the protocol stack implementation of SIP terminal mobility is described, and the performance of SIP user agents developed with open-source libraries are measured from empirical experiments. The experiments are performed in both IPv4 and IPv6 environment. In the best case, the delay of SIP mobility only takes 38ms in SIP signaling exchange, for both IPv4 and IPv6. Therefore, SIP mobility is suitable for supporting seamless handover in VoIP communications.
Serial Attention Mechanisms in Visual Search: A Direct Behavioral Demonstration
Authors: Emanuela Bricolo
Venue: Journal of Cognitive Neuroscience (2002)

In visual search, inefficient performance of human observers is typically characterized by a steady increase in reaction time with the number of array elements&mdash;the so-called set-size effect. In general, set-size effects are taken to indicate that processing of the array elements depends on limited-capacity resources, that is, it involves attention. Contrasting theories have been proposed to account for this attentional involvement, however. While some theories have attributed set-size effects to the intervention of serial attention mechanisms, others have explained set-size effects in terms of parallel, competitive architectures. Conclusive evidence in favor of one or the other notion is still lacking. Especially in view of the wide use of visual search paradigms to explore the functional neuroanatomy of attentional mechanisms in the primate brain, it becomes essential that the nature of the attentional involvement in these paradigms be clearly defined at the behavioral level. Here we report a series of experiments showing that highly inefficient search indeed recruits serial attention deployment to the individual array elements. In addition, we describe a number of behavioral signatures of serial attention in visual search that can be used in future investigations to attest a similar involvement of serial attention in other search paradigms. We claim that only after having recognized these signatures can one be confident that truly serial mechanisms are engaged in a given visual search task, thus making it amenable for exploring the functional neuroanatomy underlying its performance.
A virtual reality-based exercise system for hand rehabilitation post-stroke
Authors: Sergei V. Adamovich, Alma S. Merians, Rares Boian, Jeffrey A. Lewis, Marilyn Tremaine, Grigore S. Burdea, Michael Recce, Howard Poizner
Venue: Presence: Teleoperators and Virtual Environments (2005)

This paper presents preliminary results from a virtual reality (VR)-based system for hand rehabilitation that uses a CyberGlove and a Rutgers Master II-ND haptic glove. This computerized system trains finger range of motion, finger flexion speed, independence of finger motion, and finger strength using specific VR simulation exercises. A remote Web-based monitoring station was developed to allow telerehabilitation interventions. The remote therapist observes simplified versions of the patient exercises that are updated in real time. Patient data is stored transparently in an Oracle database, which is also Web accessible through a portal GUI. Thus the remote therapist or attending physician can graph exercise outcomes and thus evaluate patient outcomes at a distance. Data from the VR simulations is complemented by clinical measurements of hand function and strength. Eight chronic post-stroke subjects participated in a pilot study of the above system. In keeping with variability in both their lesion size and site and in their initial upper extremity function, each subject showed improvement on a unique combination of movement parameters in VR training. Importantly, these improvements transferred to gains on clinical tests, as well as to significant reductions in task-completion times for the prehension of real objects. These results are indicative of the potential feasibility of this exercise system for rehabilitation in patients with hand dysfunction resulting from neurological impairment.
The u-MUSE System: An Integrated UPnP AV Home Entertainment System supporting RUI Service and Device Mobility
Authors: Hyunju Lee, Sangwook Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In this paper, we present the u-MUSE system which is an integrated UPnP AV home entertainment system performing role of control center for various heterogeneous AV devices in home network via the integrated controller. The integrated controller is an integrated module of Control Point and MediaRenderer to support simultaneously control and rendering in same device. The u-MUSE system supports remote user interface service which is based on remote frame buffer (RFB) protocol and remote user interface technology. Users can directly access and control to remote devices. To support device mobility and various multimedia services such as control service or playback service ubiquitously in home, we embedded the integrated controller in mobile device of the system.
Supporting software reuse by the individual programmer
Authors: Min-Sheng Hsieh, Ewan Tempero
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Despite its long history and its benefits, software reuse has yet to become a common practise among software programmers. While there is much ongoing research, it focuses on large-scale organisation-level techniques and methodologies. There is very little research that considers reuse at the personal level as an important factor. The lack of focus and tool support has limited the potential for developers to reuse their past efforts. This paper introduces ICRT (Individual Code Reuse Tool), which provides support for an individual to efficiently reuse code fragments written in the past. ICRT uses the CBR methodology to manage the code fragments, and is integrated with the Eclipse IDE.
Deep Visibility in Enterprise Value Networks: Knowledge Models, Real-Time Monitoring and E-Commerce
Authors: Mao Chen, Anca-Andreea Ivan, Jakka Sairamesh
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)

Value networks represent a novel approach to model complex enterprise relationships from the perspective of value creation, propagation, and evolution. The success of a value network relies on timely sensing of business insights from high volume process and product performance information. This paper addresses three major challenges of value network-driven enterprise e-commerce analysis: (1) unifying the business knowledge of multiple enterprises and their diverse and conflicting objectives in the value network, (2) sensing the value network and processes through a real-time system, and (3) analyzing the quantifiable value each enterprise contributes to the value network. The solution presented in this paper consists of a semantic knowledge model capturing multienterprise objectives and relationships between performance metrics, and a system to monitor, integrate, and analyze enterprise performance information.