ppxscal/embedding_network huggingface dataset:
Wavelet based estimator for the self-similarity parameter of /spl alpha/-stable processes
Authors: P. Abry
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We, study self-similar processes with possibly infinite second order statistics and long-range dependence. To do so, we detail the statistical properties of the wavelet coefficients of /spl alpha/-stable self similar processes, used as a paradigm for those situations. We, then, propose a wavelet based estimator for the self-similarity parameter and analyse its statistical performance both theoretically and numerically. We show that it is unbiased, that its variance decreases as the inverse of the length of the data and that it can be easily implemented.
Applications of genetic algorithms to optimal multilevel design of MPLS-based networks
Authors: El-Sayed M. El-Alfy
Venue: Computer Communications (2007)

This paper proposes a design methodology based on the application of genetic algorithms (GA) to find a minimal-cost topological structure of MPLS-based networks. MPLS technology is currently deployed in designing the backbone infrastructure of service provider networks whereas other parts of the network are still operated using the traditional IP protocol. This makes the overall topological structure of MPLS-based networks naturally breaks into two prime sub-problems: access network design and backbone network design. The ultimate goal is to identify the locations of label-edge routers and label-switching routers, and to determine the interconnection links and their capacities to accommodate expected traffic demands. The locations of label edge routers depend on the demands of a given set of terminal networks which in turn affect the design of the backbone network. This problem is a highly constrained NP-hard optimization problem for which exact solution approaches do not scale well. We first present a multilevel design model that divides the optimal topology design into a set of linear programs. Then, we propose GA-based meta-heuristics for solving them. We also discuss the impact of encoding methods and genetic operators and parameters on the performance. Numerical results for the considered cases show that the proposed methodology is effective and gives optimal or close to optimal solutions as compared with the exact branch and bound method.
Design and Implementation of a Remote Medical-Care Supporting System
Authors: Akio Koyama, Junpei Arai, Satoshi Sasaki, Leonard Barolli
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In the last few years we have observed an explosive growth of multimedia computing, communication and applications. Information Technology (IT) has a great effect in our everyday life and is transforming the way people live, work, and interact with each other, and is impacting the way businesses, government services, education, entertainment, and medical-care are operating. In this research, we propose and develop a remote medical-care system for supporting nurses, care managers and care helpers during their work. The proposed system has three functions: a multi-point communication function using video images and voice, vital signs data auto-uploading and referring function, and a drip infusion monitoring function. In this paper, we present the proposed remote medical-care support system.
Coherence, Synchronization and State-sharing in Distributed Shared-memory Applications
Authors: R. Ananthanarayanan, Mustaque Ahamad, Richard J. LeBlanc
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Distributed shared memory consistency protocols suffer from poor performance due their lack of application spe cific knowledge which can be exploited in message passing systems. Explicit synchronization can be used in mem ory coherence activities to realize the benefits of applica tion specific information if the user is allowed to associate data with synchronization operations. In this paper, we present a refinement of synchronization and data sharing patterns and identify attributes that can be used to asso ciate data with suitably modified synchronization primi tives. We present modifications for semaphores, read-write locks, and barriers which can be used to implement a va riety of interaction patterns including mutual exclusion, producers-consumers, readers-writers etc. We claim that the performance of applications programmed using shared memory can be comparable to their message passing imple mentation which use intermediary entities such as mail boxes. On the other hand, programming is easier with our system, since it allows for richer patterns of interaction than when directly using low-level messages.
Similarity classifier using similarity measure derived from Yu's norms in classification of medical data sets
Authors: Pasi Luukka
Venue: Computers in Biology and Medicine (2007)

A new approach using a similarity measure based on Yu's norms is presented for the detection of erythemato-squamous diseases, diabetes, breast cancer, lung cancer and lymphography. The domain contains records of patients with known diagnoses. The results are very promising with all data sets and (in conclusion, can be drawn that) a similarity model derived from Yu's norms could be used for the diagnosis of patients taking into consideration the error rate. A similarity classifier derived from Yu's norms was used to detect the six erythemato-squamous diseases when 34 features defining six disease indications were used as inputs. The results confirmed that the proposed model has potential in detecting the erythemato-squamous diseases. The similarity model derived from Yu's norms achieved an accuracy rate (97.8%) which was higher than that of the stand-alone neural network model or the ANFIS model suggested in Ubeyli and Guler [Automatic detection of erythemato-squamous diseases using adaptive neuro-fuzzy inference systems, Comput. Biol. Med. 35 (2005) 421-433] or the similarity model based on Lukasiewicz similarity [Luukka and Leppalampi, Similarity classifier with generalized mean applied to medical data, Comput. Biol. Med. 36 (2006) 1026-1040]. With PIMA Indian diabetes, the detection model has an error rate of about 24% which is much better than the overall rate of 33% for diabetes. Also, a classifier was applied to the lung cancer data set and the results were to my knowledge better than before. When the lung cancer data were preprocessed with an entropy minimization technique and the classifier with similarity based on Yu's norm was applied, 99.99% accuracy was achieved. The use of this preprocessing method enhanced the results over 30%. In lymphography, entropy minimization also enhanced the results remarkably and 86.2% accuracy was achieved.
A Feature Extraction Metod for Multimedia data Analysis in Robot Wireless Sensor Networks
Authors: Heng Huang, Fillia Makedon, Dan Popa, Harry Stephanou, James Ford, Yurong Xu
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Multimedia sensor networking technologies have developed very rapidly in the last ten years. Robot wireless sensor networks are an increasingly capable platform and show great potential in environments from future battlefields to disaster discovery. Robot wireless sensor networks can enhance multimedia surveillance and provide the foundation for strategies based on multi-modal sensor integration. We illustrate this concept with an example feature extraction approach for image or video data: lines are extracted as image features from images transformed using the Hough transform technique. This approach enables features to be combined and constrained by their structure, allowing for example region correspondencemapping between images from different sensors or the same sensor in different time phases.
Distributed Storage with Compressed (1 out-of N) Codes
Authors: Peter Sobe
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Deletion-tolerant codes provide data availability despite storage failures and are commonly used for disk arrays and reliable storage in distributed systems. The codes used for that base on binary parity or on sophisticated cyclic codes with minimal storage overhead. But the calculations for these codes cause either a noticeable number of computation cycles or require a huge number of logic gates. In this paper, a different class of deletion-tolerant codes - (1 out-of N) codes - are analyzed with a focus on their application for distributed storage systems. It is shown that these codes when combined with compression can provide nearly the same low storage overhead as the traditional codes and allow a proper parallelization. Several variants of the code within the design space are discussed. (1 out-of N) codes are compared with parity codes in terms of required time for en- and decoding and their space requirements for parallel logic operations. An integration into a protocol for a distributed storage system is outlined.
Fast Decoding of Fibonacci Encoded Texts
Authors: Shmuel T. Klein
Venue: Proceedings of the 2007 Data Compression Conference (2007)

The Fibonacci code of order m . 2, denoted by Fibm, is defined as the (infinite) set of binary strings w, each of which is terminated by m 1s, and such that a substring of m consecutive 1s does not appear anywhere in w except at its right end.
Exploration path generation for multiple mobile robots using reaction-diffusion equation on a graph
Authors: Chomchana Trevai, Yusuke Fukazawa, Hideo Yuasa, Jun Ota, Tamio Arai, Hajime Asama
Venue: Integrated Computer-Aided Engineering (2004)

In this paper, we present a method to generate exploration path for multiple mobile robots in a restricted working area. In exploration mission by mobile robots, the goal is to minimize the overall exploration time and ensure a thorough exploration. The key problem to be solved is to generate effective exploration paths so that mobile robots share their exploration regions in a working area. During the exploration, in situations in which new obstacles are detected on the paths or some observation points are not reachable by a mobile robot, the generated paths will not permit a thorough exploration. New paths that can ensure thorough exploration must accasionally be re-planned. The method proposed here should re-plan paths with low computational cost. The proposed method is realized by the combination of (a) deployment of the observation points in a working area using a reaction-diffusion equation on a graph, and (b) clustering the observation points to generate exploration paths that have a uniform path length for each mobile robot. Using reaction-diffusion equation on a graph in an observation point deployment will decentralize the computation of each observation point position. The efficiency and robustness of the proposed method are evaluated in simulations and in real exploration missions by two mobile robots in indoor environments.
Design of a synchronization scheme for a bandwidth-on-demand multiplexer-demultiplexer pair based on wavelet packet tree filter banks
Authors: M. Sablatash
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

For a spectrum-efficient, bandwidth-on-demand multiplexer-demultiplexer for a multiuser, multicarrier communication system based on wavelet packet trees for downstream transmission, an innovative scheme for synchronization is proposed which uses a unique sync word at the root of the tree. An example filterbank tree with 8 leaves is used throughout the paper. For this example the creation of the unique 32-bit sync word is described. The multirate signal processing and construction and properties of 25 32/spl times/32 matrices required in the multiplexer to find locations of sync words at input ports to cancel the effects of data and insert the 32-bit sync word in a window in the correct location at the root of the tree is described. The ratio of maximum to minimum absolute values of eigenvalues of the matrices is used to ensure well-conditioning, since they must be inverted in the processing.
A Scheme for Low Path Loss in Object Monitoring with Sensor Network
Authors: Thanh Hai Trinh, Ji Hoon Kim, Hee Yong Youn
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

The usage of sensor network is rapidly growing, and monitoring mobile object is one of important applications of sensor network. A sensor node in the network has limited energy, and thus one key issue here is energy efficiency to prolong the network lifetime. In this paper we propose a new scheme minimizing the energy consumed for handling the path loss problem occurring between the tracking sensor and gateway node. This is achieved by dividing the sensor network into concentric layers and sectors to decrease the distance between the communicating nodes. Computer simulation shows that the proposed scheme can significantly lower the path loss compared to the existing target tracking scheme.
Software-gated pulse-Doppler ultrasound for a DSP-based blood flowmeter
Authors: A. Kraft
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Traditional short-gate pulse-Doppler devices rely on hardware gating to measure a blood vessel's velocity profile. In the same spirit as software radio, advanced digital signal processor (DSP) technologies suggest software gating as an alternative to traditional hardware gating methods. By way of computer simulation, this paper explores the viability of a software-gated pulse-Doppler technique for measuring a blood vessel's velocity profile. Simulations utilize a particle model that is then mixed, filtered, and sampled. Spectral analysis provides velocity profile information. Preliminary results suggest software gating is not only feasible but, also advantageous.
Smooth sensitivity and sampling in private data analysis
Authors: Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We introduce a new, generic framework for private data analysis.The goal of private data analysis is to release aggregate information about a data set while protecting the privacy of the individuals whose information the data set contains.Our framework allows one to release functions f of the data withinstance-based additive noise. That is, the noise magnitude is determined not only by the function we want to release, but also bythe database itself. One of the challenges is to ensure that the noise magnitude does not leak information about the database. To address that, we calibrate the noise magnitude to the smoothsensitivity of f on the database x --- a measure of variabilityof f in the neighborhood of the instance x. The new frameworkgreatly expands the applicability of output perturbation, a technique for protecting individuals' privacy by adding a smallamount of random noise to the released statistics. To our knowledge, this is the first formal analysis of the effect of instance-basednoise in the context of data privacy. Our framework raises many interesting algorithmic questions. Namely,to apply the framework one must compute or approximate the smoothsensitivity of f on x. We show how to do this efficiently for several different functions, including the median and the cost ofthe minimum spanning tree. We also give a generic procedure based on sampling that allows one to release f(x) accurately on manydatabases x. This procedure is applicable even when no efficient algorithm for approximating smooth sensitivity of f is known orwhen f is given as a black box. We illustrate the procedure by applying it to k-SED (k-means) clustering and learning mixtures of Gaussians.
Ïnfïnïty: a generic platform for application development and information sharing on mobile devices
Authors: Alvin Cheung, Tyrone Grandison, Christopher Johnson, Stefan Schönauer
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

Personal mobile devices, such as cell phones and PDAs, are undergoing continual improvements in computing power, storage, and connectivity. This trend presents many opportunities for information sharing and collaboration among massively distributed data sources. However, the current mobile environment, which consists of incompatible operating systems, development models, and communication options, has hindered application development and data sharing over ad hoc networks of mobile devices. In this paper, we present a middleware framework, called Ïnfïnïty, that unifies techniques for local (and remote) device data access, automatic communication channel selection, and application deployment across heterogeneous platforms. Ïnfïnïty enables information sharing and collaboration among mobile devices in a privacy-preserving manner. We describe the prototype implementation of Ïnfïnïty and demonstrate how it eases application development and supports a wide variety of application scenarios.
Robust composition: towards a unified approach to access control and concurrency control
Authors: Jonathan S. Shapiro
Venue:  (2006)

When separately written programs are composed so that they may cooperate, they may instead destructively interfere in unanticipated ways. These hazards limit the scale and functionality of the software systems we can successfully compose. This dissertation presents a framework for enabling those interactions between components needed for the cooperation we intend, while minimizing the hazards of destructive interference. Great progress on the composition problem has been made within the object paradigm, chiefly in the context of sequential, single-machine programming among benign components. We show how to extend this success to support robust composition of concurrent and potentially malicious components distributed over potentially malicious machines. We present E, a distributed, persistent, secure programming language, and CapDesk, a virus-safe desktop built in E, as embodiments of the techniques we explain.
DP-Miner: Design Pattern Discovery Using Matrix
Authors: Jing Dong, Dushyant S. Lad, Yajing Zhao
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Design patterns document expert design experience in software system development. They have been applied in many existing software systems. However, pattern information is generally lost in the source code. Discovering design patterns from source code may help understand system designs and further change the systems. In this paper, we present a novel approach to discovering design patterns by defining the structural characteristics of each design pattern in terms of weight and matrix. Our discovery process includes several analysis phases. Our approach is based on the XMI standard so that it is compatible with other techniques following such standard. We also develop a toolkit to support our approach. An industrial size case study is conducted to evaluate our approach and tool.
Enhanced, high resolution radar imaging based on robust regularization
Authors: M. Cetin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We propose an enhanced image reconstruction method for spotlight-mode synthetic aperture radar (SAR). Our approach involves extension of feature preserving regularization techniques developed in other applications to the complex-valued SAR imaging problem. Compared to conventional image formation schemes, our approach offers increased resolvability of point-scatterers, enhancement of object shapes, reduced sidelobes and reduced speckle. We present the effectiveness of the proposed method on synthetic and real SAR scenes.
Fuzzy Cerebellar Model Articulation Controller (FCMAC) for Vibration Control of Semi-Active Suspension System
Authors: Shiming Wang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The physical model of semi-active quarter-coach suspension was established based on the theories of Buckingham's Pi. According to the characteristics of system, a new intelligent control algorithm based on the Fuzzy logic control and cerebellar model articulation control techniques-Fuzzy cerebellar model articulation control (FCMAC) was presented and used to perform online control for the first time, novel weight-update laws were derived that guarantee the stability of closed-loop system, both information retrieval and learning rules were described by algebraic equations in matrix form. The results of experiment of closed -loop excited by three typical vibration signals showed that FCMAC control strategy can reduce the value of mean square root of vertical acceleration of semi-active suspension system to be lower 23%, 25% and 18% compared with the traditional control strategy such as PID.
Ballot casting assurance
Authors: Ben Adida, C. Andrew Neff
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

We propose that voting protocols be judged in part on ballot casting assurance, a property which complements universal verifiability. Some protocols already support ballot casting assurance, though the concept has not received adequate explicit emphasis. Ballot casting assurance captures two well known voting concepts - cast as intended, and recorded as cast - into one end-to-end property: Alice, the voter, should obtain immediate and direct assurance that her intended vote has "made it" into the tally. We review Neff's scheme, MarkPledge, and show that it provides ballot casting assurance. We also briefly show how Chaum's "Punchscan" system also provides ballot casting assurance, though under more complicated deployment assumptions. We show how ballot casting assurance opens the door to realistic failure detection and recovery in the middle of an election, a topic which has been ignored in much of the voting literature.
A Typology for Resource Profiling and Modeling
Authors: Charles M. Jenkins, Stephen V. Rice
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

A critical aspect of many simulation studies is the modeling of resources. A general typology, or multidimensional categorization, is proposed for characterizing resources. Such a characterization, or resource "profile," serves as a "meta-model" from which relevant properties may be identified and incorporated into a resource model. The typology is applicable across domains and is illustrated by example profiles of a mechanical resource (a tank), an electronic resource (a web service), and a living resource (an oilfield employee).