ppxscal/embedding_network huggingface dataset:
Statistical Linearity Calibration of Time-To-Digital Converters Using a Free-Running Ring Oscillator
Authors: Jochen Rivoir
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Precise and fast time measurements have many applications in test that can be covered cost effectively by vernier delay line (VDL) based time-to-digital converters (TDC), implemented fully digitally in a modern CMOS process. Their inherent non-linearity can be measured using a statistical code density method that relies on uniformly distributed time events. This paper discusses using a simple free-running ring oscillator with a choice of oscillation periods to generate sufficiently uniformly distributed calibration events. The uniformity requirement is shown to exclude a huge number of small oscillation period ranges, which are too coherent with the TDC's internal clock. A simple algorithm for checking suitability of a randomly chosen period from a non-perfectly stable, jittered ring oscillator is presented. Number and size of suitable period ranges are given analytically. For a VDLbased TDC design in 90 nm CMOS, a sufficiently large range of suitable oscillation periods will on average found after the third try; under worst case conditions with 99.99% confidence after trying 256 period choices. The proposed method enables TDCs with digital-only, fully autonomous calibration.
Alluvion and cascade: fast data dissemination schemes in multihop wireless networks
Authors: Ranjan Pal
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

Common information dissemination through multihop broadcasting is a key application in many wireless network operations. In all such applications the data transmission rate of broadcast plays a vital role in determining network performance. In this paper we propose two schemes for maximizing the broadcast rate in case of static wireless networks. Our two novel deterministic heuristic approaches, Alluvion and Cascade, effectively solve the problem. Both these algorithms are based on the idea of formation of spanning(broadcast) trees and then using a pipelined TDMA scheme to find the transmission rate. Alluvion, on an average performs significantly better than existing approaches like Deluge by atleast 80 percent which in turn proves the efficiency of our heuristic. Cascade, on the other hand performs better than Alluvion for small networks and can push upto 125 percent improvement over Deluge.
Revisiting neighbor discovery with interferences consideration
Authors: Elyes Ben Hamida, Guillaume Chelius, Eric Fleury
Venue: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks (2006)

In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic models which do not take into account problems resulting from low level layers, such as the physical layer. One of the peculiarities of radio communications is the presence of interferences which decrease the capacity of the medium.In this paper, we consider a random hello protocol inspired by aloha and we study the impact of the interferences on the neighbor discovery process. As expected, we prove that, in average and in the presence of interferences, a node discovers only a subset of its neighbors. We propose then an analytical model to compute the average number of nodes that a given node may expect to discover in its neighborhood.Finally, we present a hello protocol with sleep periods. We show how to optimize this protocol using our hybrid model. A real scenario stemming from the CAPNET project is then analyzed and studied.
Tree based broadcast in ad hoc networks
Authors: Alpár Jüttner, Ádám Magi
Venue: Mobile Networks and Applications (2005)

Although broadcasting using tree structure established in a network is a well known and widely used technique, it is typically claimed to be inappropriate for ad hoc networks, being the maintained tree very sensitive to network changes. On the contrary this paper presents an efficient tree based broadcasting scheme, which is reliable and stable even in case of the ever changing network structure of the ad hoc networks.To achieve this, first, a novel method is presented to maintain a spanning tree in an ad hoc network in a fully distributed, on-line and asynchronous way. Once the tree is established the broadcast itself is performed based on this tree. Some further improvements on the basic algorithm are also presented that reduce the resource requirements even more, increase the stability of the tree, enable the mobility of the nodes to be taken into account and make the method more configurable.As it is shown by simulation, the obtained broadcast scheme is stable, reliable and it uses small amount of resources: the acyclic structure of the broadcast tree ensures that the nodes get the broadcast messages only once, so the broadcast needs little bandwidth and the nodes need not store the recent broadcast messages, reducing the computational and memory requirements.As a byproduct a technique is proposed to measure the mobility of the nodes. This technique needs no additional GPS device or any geographical information but it is based on the stability of the links of the node.
Dynamics of a Temporo-Fronto-Parietal Network during Sustained Spatial or Spectral Auditory Processing
Authors: Aurélie Bidet-caulet, Olivier Bertrand
Venue: Journal of Cognitive Neuroscience (2005)

Animal and human studies have suggested that posterior temporal, parietal, and frontal regions are specifically involved in auditory spatial (location and motion) processing, forming a putative dorsal "where" pathway. We used scalp EEG and current density mapping to investigate the dynamics of this network in human subjects presented with a varying acoustic stream in a two-factor paradigm: spatial versus pitch variations, focused versus diverted attention. The main findings were: (i) a temporo-parieto-frontal network was activated during the whole duration of the stream in all conditions and modulated by attention; (ii) the left superior temporal cortex was the only region showing different activations for pitch and spatial variations. Therefore, parietal and frontal regions would be involved in task-related processes (attention and motor preparation), whereas the differential processing of acoustic spatial and object-related features seems to take place at the temporal level.
On information hiding and network management
Authors: Kenneth L. Calvert, James Griffioen
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

No single administration controls the entire Internet. Instead, competing providers work together to enforce of a wide variety of network management policies, including policies that limit the flow of management information itself. In many cases these policies are designed to keep information about the state of the network from "leaking" outside the network. In this position paper, we consider the ramifications of such information-hiding policies for network management. We discuss mechanisms that might be used to enforce such policies, and argue for an open access policy.
Tunable Kernels for Tracking
Authors: Vasu Parameswaran, Visvanathan Ramesh, Imad Zoghlami
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a tunable representation for tracking that simultaneously encodes appearance and geometry in a manner that enables the use of mean-shift iterations for tracking. The classic formulation of the tracking problem using mean-shift iterations encodes spatial information very loosely (i.e. using radially symmetric kernels). A problem with such a formulation is that it becomes easy for the tracker to get confused with other objects having the same feature distribution but different spatial configurations of features. Subsequent approaches have addressed this issue but not to the degree of generality required for tracking specific classes of objects and motions (e.g. humans walking). In this paper, we formulate the tracking problem in a manner that encodes the spatial configuration of features along with their density and yet retains robustness to spatial deformations and feature density variations. The encoding of spatial configuration is done using a set of kernels whose parameters can be optimized for a given class of objects and motions, off-line. The formulation enables the use of meanshift iterations and runs in real-time. We demonstrate better tracking results on synthetic and real image sequences as compared to the original mean-shift tracker.
Optimal Super-peer Selection for Large-scale P2P System
Authors: Su-Hong Min, Joanne Holliday, Dong-Sub Cho
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The peer-to-peer (P2P) systems have grown significantly over the last few years due to their potential for sharing various resources. Unstructured hybrid P2P system can improve the performance of the entire network and system using SP (Super-peer), which has the responsibility for query processing instead of OPs (Ordinary-Peer). In these systems, selecting the best SP to join is an important problem, but it is difficult to choose the optimal SP by the various reasons such as heterogeneous capacity, content similarity and dynamic capacity change. In this paper, we present the SP selection's problem and SP selection strategy based on dynamic capacity of the SP and content similarity. Also we measure the SP's score with weight to the factors distance cost, processing power and content similarity. Through the simulation, we show query processing performance is improved when OPs use our strategy to choose the best SP
Polarization Multiplexing and Demultiplexing for Appearance-Based Modeling
Authors: Oana G. Cula, Kristin J. Dana, Dinesh K. Pai
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Polarization has been used in numerous prior studies for separating diffuse and specular reflectance components, but in this work we show that it also can be used to separate surface reflectance contributions from individual light sources. Our approach is called polarization multiplexing and it has a significant impact in appearance modeling where the image as a function of illumination direction is needed. Multiple unknown light sources can illuminate the scene simultaneously, and the individual contributions to the overall surface reflectance are estimated. Polarization multiplexing relies on the relationship between the light source direction and the intensity modulation. Inverting this transformation enables the individual intensity contributions to be estimated. In addition to polarization multiplexing, we show that phase histograms from the intensity modulations can be used to estimate scene properties including the number of light sources.
Inverse \alpha-Cuts and Interval [a,b) -Cuts
Authors: Zhaohao Sun, Jun Han
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper will propose the symmetric form of \alpha -cut: inverse \alpha -cut, and then \alpha -induced fuzzy set and examine their properties. Further, it introduces interval cut, interval induced fuzzy set and examines their properties. The proposed approach will facilitate research of fuzzy set theory and fuzzy systems.
Object Detection Based on Weighted Adaptive Prediction in Lifting Scheme Transform
Authors: Mahdi Amiri, Hamid R. Rabiee
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This paper presents a new algorithm for detecting user-selected objects in a sequence of images based on a new weighted adaptive lifting scheme transform. In our algorithm, we first select a set of coefficients as object features in the wavelet transform domain and then build an adaptive transform considering the selected features. The goal of the designed adaptive transform is to "vanish" the selected features as much as possible in the transform domain. After applying both non-adaptive and adaptive transforms to a given test image, the corresponding transform domain coefficients are compared for detecting the object of interest. We have verified our claim with experimental results on 1-D signals and real images.
Visual language semantics specification in the VisPro system
Authors: Ke-Bing Zhang, Mehmet A. Orgun, Kang Zhang
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

VisPro is a general-purpose visual language generation system, which can produce a wide range of diagrammatic visual programming languages (VPLs) based on Reserved Graph Grammar (RGG), a context sensitive graph grammar. This paper presents an approach to specify the semantic execution sequence of VPLs based on VisPro. In this approach, we use an ordering mechanism to facilitate the parsing formalism of Reserved Graph Grammar to determine semantic execution sequence of super-nodes in visual programs of the VPLs.
Factors Affecting Use of Resources for Asthma Patients
Authors: Bayram Şahin, Mehtap Tatar
Venue: Journal of Medical Systems (2006)

Objective: This study aims at exploring the variance in resources used for management and treatment of asthma disease and analyzing the impact of patient and physician characteristics on total test expenditures and the number of drugs prescribed as resource utilization variables. Study setting: The study was undertaken in Hacettepe University Chest Diseases Polyclinic and Allergy Unit. 387 asthma patients visiting the unit between August 2000 and March 2001, were included in the study. Results: The regression analysis showed that patient characteristics did not have a statistically meaningful impact on total test expenditures (p > 0.05). The laboratory test expenditures for patients who referred to academicians (professors and associate professors) were higher compared to patients who referred to their counterparts (p < 0.05). Similarly, the laboratory test expenditures for patients referred to two physicians in the allergy unit were higher and statistically meaningful (p < 0.05) than patients who referred to 8 physicians in the chest diseases polyclinic. When factors affecting the number of drugs prescribed is analyzed it was found that duration of treatment, severity of disease, quality of life, frequency of referral to a physician in the last 6 months were meaningful (p < 0.05). Conclusions: The variances in total test expenditures for different academic careers and specialties indicate the need to standardize the treatment process for asthma and to reconsider medical education.
Semantic role labeling of prepositional phrases
Authors: Patrick Ye, Timothy Baldwin
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2006)

We propose a method for labelling prepositional phrases according to two different semantic role classifications, as contained in the Penn treebank and the CoNLL 2004 Semantic Role Labeling data set. Our results illustrate the difficulties in determining preposition semantics, but also demonstrate the potential for PP semantic role labelling to improve the performance of a holistic semantic role labelling system.
The Perception of Voice Onset Time: An fMRI Investigation of Phonetic Category Structure
Authors: Sheila E. Blumstein, Emily B. Myers, Jesse Rissman
Venue: Journal of Cognitive Neuroscience (2005)

This study explored the neural systems underlying the perception of phonetic category structure by investigating the perception of a voice onset time (VOT) continuum in a phonetic categorization task. Stimuli consisted of five synthetic speech stimuli which ranged in VOT from 0 msec ([da]) to 40 msec ([ta]). Results from 12 subjects showed that the neural system is sensitive to VOT differences of 10 msec and that details of phonetic category structure are retained throughout the phonetic processing stream. Both the left inferior frontal gyrus (IFG) and cingulate showed graded activation as a function of category membership with increasing activation as stimuli approached the phonetic category boundary. These results are consistent with the view that the left IFG is involved in phonetic decision processes, with the extent of activation influenced by increased resources devoted to resolving phonetic category membership and/or selecting between competing phonetic categories. Activation patterns in the cingulate suggest that it is sensitive to stimulus difficulty and resolving response conflict. In contrast, activation in the posterior left middle temporal gyrus and the left angular gyrus showed modulation of activation only to the "best fit" of the phonetic category, suggesting that these areas are involved in mapping sound structure to its phonetic representation. The superior temporal gyrus (STG) bilaterally showed weaker sensitivity to the differences in phonetic category structure, providing further evidence that the STG is involved in the early analysis of the sensory properties of speech.
Novel multirate processing of beamspace noise eigenvectors
Authors: M. D. Zoltowski, G. M. Kautz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

A novel implementation of Root-MUSIC is introduced based on the observation that the MUSIC null spectrum created with a beamspace noise eigenvector is bandpass exhibiting nulls at the locations of in-band sources. Thus, after telescoping to element space and modulating to broad-side, the telescoped noise eigenvector may be decimated yielding a small order polynomial with the separation between signal roots increased by the decimation factor. Depending on the out-of-band response of the beamformers, the telescoped noise eigenvector may be passed through a lowpass filter prior to decimation to preserve in-band source nulls. A low cost algorithm is realized by invoking linearity and performing the modulation, filtering, and decimation operations a-priori on the beamformers yielding a transformation to be applied to the beamspace noise eigenvectors.
Joint parameter and state estimation based on particle filtering and stochastic approximation
Authors: Xiaojun Yang, Kunlin Shi, Keyi Xing
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, an adaptive estimation algorithm is proposed for non-linear dynamic systems with unknown parameters based on combination of particle filtering and SPSA technique. The estimates of parameters are obtained by state samples and maximum-likelihood estimation under particle filtering, and the SPSA is used to approximate the gradient of target function. The proposed algorithm achieves joint estimation of dynamic state and static parameters. Simulation result demonstrates the efficiency of the algorithm.
An Effective Technique for Personalization Recommendation Based on Access Sequential Patterns
Authors: Xiaoqiu Tan, Min Yao, Miaojun Xu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Considering that personalization recommendation systems based on association rules suffer from some limitations that a lot of time is spent on matching current user session with all discovered patterns in patterns database, authors propose a new approach to build personalization recommendation system based on access sequential patterns discovered form usage data and highly compressed into a tree structure. During personalization recommendation stage we just need to intercept nearest access subsequence from current user session to match some sub paths of the tree. The speed of pattern matching is improved enormously, which satisfies the need of real-time recommendation better. The results of experiments show the proposed methodology can achieve better recommendation effectiveness.
A Novel Microarray Gene Selection Method Based on Consistency
Authors: Yingjie Hu, Shaoning Pang, Ilkka Havukkala
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Consistency modeling for gene selection is a new topic emerging from recent cancer bioinformatics research. The result of classification or clustering on a training set was often found very different from the same operations on a testing set. Here, we address this issue as a consistency problem. We propose a new concept of performance-based consistency and a new novel gene selection method, Genetic Algorithm Gene Selection method in terms of consistency (GAGSc). The proposed consistency concept and GAGSc method were investigated on eight benchmark microarray and proteomic datasets. The experimental results show that the different microarray datasets have different consistency characteristics, and that better consistency can lead to an unbiased and reproducible outcome with good disease prediction accuracy. More importantly, GAGSc has demonstrated that gene selection, with the proposed consistency measurement, is able to enhance the reproducibility in microarray diagnosis experiments.
A Novel Large Capacity Image Hiding Method Based on the Orthogonal Chaotic Sequences
Authors: Yaqin Zhao, Nan Zhao, Guanghui Ren, Bo Zhang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, a new scheme of hiding multiple secret images into the same cover image is proposed based on the orthogonal chaotic sequences and wavelet transform. Firstly, the secret images are spreaded spectrum with orthogonal pseudo-random chaotic sequences into the spreaded spectrum signals, where chaotic sequences are filtered according to their self-correlation and mutual-correlation characteristics, and they are also utilized as the keys while recovering the secret images because of their sensitivity to the initial values. Then, the secret images can be embedded into the same cover image in wavelet domain simultaneously because all the spreaded secret images are orthogonal. Different from the traditional methods, this method can not only be better in terms of imperceptibility, security and robustness, but also improve the information hidden capacity of a cover image. The experimental results show that the proposed method is able to achieve robustness, imperceptibility and authenticity in image hiding.
Efficient paging in large-scale urban mesh networks
Authors: Stephan Bohacek, Vinay Sridhara, Lei Lou
Venue: Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots (2006)

The task of forming a route can be broken into two parts, finding any route to the desired host and refining that route so it is suitable for the conenction. We refer to this first task as paging and it consists of simply delivering a single packet to the destination. Traditional MANET routing protocols perform this task via flooding. However, when the number of nodes ranges into the thousands, flooding becomes highly inefficient. In the case of cellular networks, paging is performed with one or more base stations broadcasting a page message. However, in large-scale urban networks, nodes are not necessarily in direct contact with the infrastructure, hence such techniques are not applicable. In this paper, the topology and architecture of a large-scale urban mesh network is examined and a scheme is developed for paging. This scheme is designed for and takes advantage of the topology, mobility, and architecture found in urban mesh networks. The resulting scheme is highly efficient in that it generates little overhead and is scalable.