ppxscal/embedding_network huggingface dataset:
Multi-Sensory Face Biometric Fusion (for Personal Identification)
Authors: Ognjen Arandjeloví, Riad Hammoud, Roberto Cipolla
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The objective of this work is to recognize faces using sets of images in visual and thermal spectra. This is challenging because the former is greatly affected by illumination changes, while the latter frequently contains occlusions due to eye-wear and is inherently less discriminative. Our method is based on a fusion of the two modalities. Specifically: we examine (i) the effects of preprocessing of data in each domain, (ii) the fusion of holistic and local facial appearance, and (iii) propose an algorithm for combining the similarity scores in visual and thermal spectra in the presence of prescription glasses and significant pose variations, using a small number of training images (5-7). Our system achieved a high correct identification rate of 97% on a freely available test set of 29 individuals and extreme illumination changes.
A general framework for accurate and fast regression by data summarization in random decision trees
Authors: Wei Fan, Joe McCloskey, Philip S. Yu
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Predicting the values of continuous variable as a function of several independent variables is one of the most important problems for data mining. A very large number of regression methods, both parametric and nonparametric, have been proposed in the past. However, since the list is quite extensive and many of these models make rather explicit, strong yet different assumptions about the type of applicable problems and involve a lot of parameters and options, choosing the appropriate regression methodology and then specifying the parameter values is a none-trivial, sometimes frustrating, task for data mining practitioners. Choosing the inappropriate methodology can have rather disappointing results. This issue is against the general utility of data mining software. For example,linear regression methods are straightforward and well-understood. However, since the linear assumption is very strong, its performance is compromised for complicated non-linear problems. Kernel-based methods perform quite well if the kernel functions are selected correctly. In this paper, we propose a straightforward approach based on summarizing the training data using an ensemble of random decisions trees. It requires very little knowledge from the user, yet is applicable to every type of regression problem that we are currently aware of. We have experimented on a wide range of problems including those that parametric methods performwell, a large selection of benchmark datasets for nonparametric regression, as well as highly non-linear stochastic problems. Our results are either significantly better than or identical to many approaches that are known to perform well on these problems.
A Workflow Model Supporting Flexible Process Based on Extensible Organization
Authors: Hongli Wu, Baolin Yin, Xia Zhao, Gang Xiang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

How to make business process flexibly adapted to the changes of organization is the key problem for an enterprise to improve its competitive power. Aimed at providing a solution to this problem, a new flexible workflow model based on extensible organization definition is put forward. The proposed model is composed of organization model and process model. In organization model the new concept of sub-organization has been introduced with the realization mechanism, making the organization model extensible qualified. In process model all sub-organizations and workgroups are allowed to create sub-process independently and refer to sub-process dynamically. Compared with the traditional workflow model with the capability of sub-process definition, the proposed model reduces the effects on business process imposed by the change of enterprise organization structure, gains much more flexibility, and provides management means at all administrative levels.
Interaction between Syntax Processing in Language and in Music: An ERP Study
Authors: Stefan Koelsch, Thomas C. Gunter, Matthias Wittfoth, Daniela Sammler
Venue: Journal of Cognitive Neuroscience (2005)

The present study investigated simultaneous processing of language and music using visually presented sentences and auditorily presented chord sequences. Music-syntactically regular and irregular chord functions were presented synchronously with syntactically correct or incorrect words, or with words that had either a high or a low semantic cloze probability. Music-syntactically irregular chords elicited an early right anterior negativity (ERAN). Syntactically incorrect words elicited a left anterior negativity (LAN). The LAN was clearly reduced when words were presented simultaneously with music-syntactically irregular chord functions. Processing of high and low cloze-probability words as indexed by the N400 was not affected by the presentation of irregular chord functions. In a control experiment, the LAN was not affected by physically deviant tones that elicited a mismatch negativity (MMN). Results demonstrate that processing of musical syntax (as reflected in the ERAN) interacts with the processing of linguistic syntax (as reflected in the LAN), and that this interaction is not due to a general effect of deviance-related negativities that precede an LAN. Findings thus indicate a strong overlap of neural resources involved in the processing of syntax in language and music.
Link Information Consistency Methods Using Update Notification on theWeb
Authors: Yukiyo Takasago, Aki Kobayashi, Katsunori Yamaoka, Yoshinori Sakai
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The Cooperative Web Architecture (CWA) was proposed for relevant information retrieval using Web-Graph. In CWA, the Web servers maintain and deliver the neighboring link information (Web-Subgraph). When events that change the Web-Graph occur, the Web servers notify each other of the change in order to synchronize Web-Subgraphs. In this paper, we propose a synchronization method to solve a problem of inconsistency among Web-Subgraphs. This problem occurs because of the time difference between notifications. When multiple events occur simultaneously, the range of notification becomes invalid. Therefore the inconsistency problem occurs. We proposed two types of synchronization methods, then we compare and analyze their respective characteristics. Moreover we discuss feasibility from the viewpoint of traffic.
Active array sensor location calibration
Authors: B. C. Ng, A. Nehorai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Sensor array processing algorithms for source localization often require precise knowledge of the sensor locations, which is usually not available in practice. Errors in the sensor locations have been known to degrade severely the performance of these algorithms. The authors propose an iterative Newton-type maximum likelihood array sensor location calibration algorithm using known source signals. A Cramer-Rao bound (CRB) expression for the sensor location parameters is found for this problem. Numerical results illustrate that the maximum likelihood calibration algorithm attains the Cramer-Rao bound asymptotically.
Energy and Spatial Reuse Efficient Network-Wide Real-Time Data Broadcasting in Mobile Ad Hoc Networks
Authors: Bulent Tavli, Wendi B. Heinzelman
Venue: IEEE Transactions on Mobile Computing (2006)

In this paper, we present NB-TRACE, which is an energy-efficient network-wide voice broadcasting architecture for mobile ad hoc networks. In the NB-TRACE architecture, the network is organized into overlapping clusters through a distributed algorithm, where the clusterheads create a nonconnected dominating set. Channel access is regulated through a distributed TDMA scheme maintained by the clusterheads. The first group of packets of a broadcast session is broadcast through flooding, where each data rebroadcast is preceded by an acknowledgment to the upstream node. Nodes that do not get an acknowledgment for a predetermined time, except the clusterheads, cease to rebroadcast, which prunes the redundant retransmissions. The connected dominating set formed through this basic algorithm is broken in time due to node mobility. The network responds to the broken links through multiple mechanisms to ensure the maintenance of the connected dominating set. We compare NB-TRACE with four network layer broadcast routing algorithms (Flooding, Gossiping, Counter-based broadcasting, and Distance-based broadcasting) and three medium access control protocols (IEEE 802.11, SMAC, and MH-TRACE) through extensive ns-2 simulations. Our results show that NB-TRACE outperforms other network/MAC layer combinations in minimizing energy dissipation and optimizing spatial reuse, while producing competitive QoS performance.
Simulation worldviews: so what?
Authors: Michael Pidd
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The simulation pioneers had no choice but to write code if they wished to conduct a computer simulation. Hence the early interest in simulation worldviews, which allowed an application model to be separated from a simulation engine. Nowadays, few simulations are developed this way and few students are taught the various simulation world-views, though they figure in many textbooks. Does this matter, or is an interest in simulation worldviews just a historical curiosity?
The communication complexity of the Hamming distance problem
Authors: Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
Venue: Information Processing Letters (2006)

We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d. We prove a quantum lower bound of Ω(d) qubits in the general interactive model with shared prior entanglement. We also construct a classical protocol of O(d log d) bits in the restricted Simultaneous Message Passing model with public random coins, improving previous protocols of O(d2) bits [A.C.-C. Yao, On the power of quantum fingerprinting, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 77-81], and O(d log n) bits [D. Gavinsky, J. Kempe, R. de Wolf, Quantum communication cannot simulate a public coin, quant-ph/0411051, 2004].
Depth cues for augmented reality stakeout
Authors: Volkert Jurgens, Andy Cockburn, Mark Billinghurst
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

We present the results of a study that compares a range of depth cues for an augmented reality (AR) stakeout application. AR stakeout is the process of placing a real pole on a virtual marker on the ground. Such an application is for example relevant for construction work or surveying. In AR stakeout, interaction takes place at a distance of about 2m from the eye; a distance that has been neglected by AR depth perception research. We compared the performance of six different AR depth cue conditions at two different accuracy requirements. Subjective preferences were strongly in favour of "cast circle", a depth cue introduced in this paper, while there was no significant difference in performance between the conditions. An analysis of the movement patterns indicated that the participants' targeting strategy relied on kinesthetic rather than visual feedback. These movement patterns provide a vantage point for future strategies of targeting support.
Mobile data service fuels the desire for uniqueness
Authors: Se-Joon Hong, Kar Yan Tam, Jinwoo Kim
Venue: Communications of the ACM (2006)

Mobile content creators and service providers can leverage users' desire to be unique to expand revenue.
Voronoi modelling of the void structure in three dimensional and near-planar random fibre networks.
Authors: Valeriy Luchnikov, Nikolai Medvedev, William Sampson
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

A representation of the porous space of computer models of random fibre networks by Voronoi networks is introduced. The lengths of the pores are determined as the lengths of the Voronoi bonds, and the bottleneck radii as the minimal radii of the Delaunay empty sphere along the bonds. Three dimensional and approximately two dimensional networks are considered and found to exhibit very similar void structures. The distributions of the pore bottlenecks and bond lengths and bond length tortuosities are shown to be well approximated by Normal and half-Normal distributions respectively; the distribution of tortuosities is approximately exponential.
New Methods in Fractal Imaging
Authors: Michael F. Barnsley, John Hutchinson
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In this paper we draw attention to some recent advances in fractal geometry and point out several ways in which they apply to digital imaging. Simple applications include a method for animating backgrounds in the production of synthetic content, including seascapes, forests, and skies; a novel low-cost technique for creating animated talking heads with unique look-and-feel; and the sharing of engaging graphics, at low bandwidth, between wireless devices such as cellphones. These advances make use of an addressing system which may be associated with the "top" of the attractor of an iterated function system (IFS). Previous computer graphics applications of IFS theory have focused on models based on the attractors and the invariant measures of IFSs. The addressing system enables the establishment of mappings between attractors; it is these transformations, rather than the attractors themselves, that underlie the digital imaging ideas introduced here.
H.264 Error Resilience Coding Based on Multi-hypothesis Motion Compensated Prediction and Adaptive Intra-refresh
Authors: Yuh-Chou Tsai, Chia-Ming Tsai, Chia-Wen Lin
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, we propose novel schemes to enhance the error robustness of multi-hypothesis motion-compensate predictive (MHMCP) coder without sacrificing the coding efficiency significantly. The proposed method utilizes the concept of reference picture interleaving and data partitioning to make the MHMCP-coded video more resilient to channel errors, especially for burst channel error. Besides, we also propose a scheme of integrating adaptive intrarefresh into the proposed MHMCP coder to further improve the error recovery speed. Extensive simulation results show that the proposed methods can effectively and quickly mitigate the error propagation and the penalty on coding efficiency for clean channels due to the inserted error resilience features is rather minor.
Reactivation of a Dormant Representation of an Auditory Stimulus Feature
Authors: Walter Ritter, Hilary Gomes, Nelson Cowan, Elyse Sussman, Herbert G. Vaughan,  Jr.
Venue: Journal of Cognitive Neuroscience (1998)

Research with the mismatch negativity component of eventrelated potentials has uncovered a system that detects change in the acoustic environment on an automatic basis. The system is considered to compare incoming stimuli to representations of the past and to emit an MMN if change is detected.Previous investigations have shown that the relevant memory of the past can become dormant and then be reactivated by a reminder stimulus. It is unclear, however, whether what is reactivated is an holistic representation of stimuli or separate representations of features of stimuli. The present study provides data that supports the latter possibility but leaves open the former one.
A Multi-HMM Approach to ECG Segmentation
Authors: Julien Thomas, Cedric Rose, Francois Charpillet
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Pharmaceutic studies require to analyze thousands of ECGs in order to evaluate the side effects of a new drug. In this paper we present a new approach to automatic ECG segmentation based on hierarchic continuous density hidden Markov models. We applied a wavelet transform to the signals in order to highlight the discontinuities in the modeled ECGs. A training base of standard 12-lead ECGs segmented by cardiologists was used to evaluate the performance of our method. We used a Bayesian HMM clustering algorithm to partition the training base, and we improved the method by using a multi-model approach. We present a statistical analysis of the results where we compare different automatic methods to the segmentation of the cardiologist.
Lexical and Sublexical Components of Age-related Changes in Neural Activation during Visual Word Identification
Authors: Wythe L. Whiting, David J. Madden, Linda K. Langley, Laura L. Denny, Timothy G. Turkington, James M. Provenzale, Thomas C. Hawk, R. Edward Coleman
Venue: Journal of Cognitive Neuroscience (2003)

Positron emission tomography data (Madden, Langley, et al., 2002) were analyzed to investigate adult age differences in the relation between neural activation and the lexical (word frequency) and sublexical (word length) components of visual word identification. The differential influence of these components on reaction time (RT) for word/nonword discrimination (lexical decision) was generally similar for the two age groups, with word frequency accounting for a greater proportion of lexical decision RT variance relative to word length. The influence of word length on RT, however, was relatively greater for older adults. Activation in regions of the ventral occipito-temporal cortex was related to the RT changes associated with word frequency and length for older adults, but not for younger adults. Specifically, older adults' frequency effects were related to activation in both anterior (Brodmann's area [BA] 37) and posterior (BAs 17 and 18) regions of the occipito-temporal pathway, whereas word length effects were only associated with posterior activation (BA 17). We conclude that aging affects the neural mechanisms supporting word identification performance although behavioral measures of this ability are generally constant as a function of age.
Applied Research on Logistics Grid Based on ASP
Authors: Bo Yan, Yiyun Chen, Zhiyong Zhang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

This paper analyzes the status and tendency of network logistic, grid and ASP around the world, and explains the technical route of Networked-Logistic Grid (Netlog), which can be divided into three layers, including the layer of grid foundation, the layer of grid application enabled and the layer of grid application realizing separately for the grid basic service, domain related grid middleware and grid application. The target of Netlog is to research the architecture of Netlog system, establish the platform of Netlog system and develop the networked-logistic agile grid service system including publishing, finding, exchanging, scheduling and optimizing the logistics resources in order to support completely the creation, operation and integrated optimization of the networked-logistic based on Globus and Web Service Resource Framework. AS core enabled technologies of the networked logistics, grid and ASP will play important roles in deploying optimally resources in logistics industry, improving the whole competitive power of medium and small-sized enterprises and accelerating the development of the logistic software industry.
Service Selection Modeling in Networked Environments
Authors: Ruixi Yuan, Qianchuan Zhao, Hong Cai, Wenyu Wang, Hui Li
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Service selection research is an important area in consumer behavior analysis and the latter has been extensively studied in economics and sociology. In this paper, we present an analysis and numerical studies on the aggregate behavior of consumer choices under some realistic information networks, such as smallworld and scale-free networks. We demonstrate that sparse and local connectivity in information networks will enable the aggregated customer choices to converge to multiple steady equilibriums. This is contrasted with the classical monopolistic steady equilibrium in full-meshed information network. Therefore, the topology of customer information networks has significant effect on the service selection equilibriums. Therefore, the customer behavior in realistic networked environments requires further study and may provide new insights in service models.
Context-aware privacy protection with profile management
Authors: Anelia Mitseva, Mohamad Imine, Neeli R. Prasad
Venue: Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots (2006)

Hotspot services will be offered in small, highly-populated public places like airports, hospitals, etc. They will play their assistive roles in the people's life only if they are secure, trusted, and nonobtrusive. Some of the challenges faced are the seamless operation between WLAN-based hotspots and other emerging wireless data networks technologies, for example body sensor networks; the exploitation of context- and location-aware information provided from the hotspot service; matching the user needs with differentiated services; preserving the privacy of the user's sensitive data and anonymity. To answer these challenges, a new solution for context-aware privacy protection for any type of fine-grained user sensitive data with profiles of the user, context, scenario and service is proposed. Based on assessment of current context and situation, the user delegates actions for protecting his privacy to the proposed mechanism that acts on his behalf. The discussed solution is presented with a medical scenario. Components model, interaction sequence, algorithm for privacy safeguarding and system implementation are described.
An object-oriented approach to datatype-generic programming
Authors: Adriaan Moors, Frank Piessens, Wouter Joosen
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming (2006)

Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented languages. However, unlike genericity, DGP has not received much attention in the OO community. Nonetheless, in the context of functional languages, it has proven to make programs more robust with respect to changes in the type structure, as well as in many other applications, such as type-safe XML processing and marshalling. To carry these strengths over to an OO language, we present an extensible library for lightweight DGP in Scala, based on an existing lightweight approach in Haskell. We discuss the challenges in developing and using our library, and explore ways to overcome them.