ppxscal/embedding_network huggingface dataset:
Ensemble Classifiers for Medical Diagnosis of Knee Osteoarthritis Using Gait Data
Authors: Nigar Sen Koktas, Nese Yalabik, Gunes Yavuzer
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Automated or semi-automated gait analysis systems are important in assisting physicians for diagnosis of various diseases. The objective of this study is to discuss ensemble methods for gait classification as a part of preliminary studies of designing a semi-automated diagnosis system. For this purpose gait data is collected from 110 sick subjects (having knee Osteoarthritis (OA)) and 91 age-matched normal subjects. A set of Multilayer Perceptrons (MLPs) is trained by using joint angle and time-distance parameters of gait as features. Large dimensional feature vector is decomposed into feature subsets and the ones selected by gait expert are used to categorize subjects into two classes; healthy and patient. Ensemble of MLPs is built using these distinct feature subsets and diversification of classifiers is analyzed by cross-validation approach and confusion matrices. High diversifications observed in the confusion matrices suggested that using combining methods would help. Indeed, when a proper combining rule is applied to decomposed sets, more accurate results are obtained. The result suggests that ensemble of MLPs could be applied in the automated diagnosis of gait disorders in a clinical context.
Synaesthetic Photisms Influence Visual Perception
Authors: Daniel Smilek, Mike J. Dixon, Cera Cudahy, Philip M. Merikle
Venue: Journal of Cognitive Neuroscience (2001)

When C, a digit-color synaesthete, views black digits, she reports that each digit elicits a highly specific color (a photism), which is experienced as though the color was externally projected onto the digit. We evaluated this claim by assessing whether C's photisms influenced her ability to perceive visually presented digits. C identified and localized target digits presented against backgrounds that were either congruent or incongruent with the color of her photism for the digits. The results showed that C was poorer at identifying and localizing digits on congruent than incongruent trials. Such differences in performance between congruent and incongruent trials were not found with nonsynaesthete control participants. These results suggest that C's colored photisms influence her perception of black digits. We propose a model in which color information influences the perception of digits through reentrant pathways in the visual system.
On Quality-of-Service and Publish-Subscribe
Authors: Stefan Behnel, Ludger Fiege, Gero Muhl
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Publish-subscribe is a powerful paradigm for distributed communication based on decoupled producers and consumers of information. Its event-driven nature makes it very appealing for large-scale data dissemination infrastructures. Various architectures were proposed in recent years that provide very diverse features. However, there are few well-defined metrics in the publish-subscribe area that would allow their evaluation and comparison. In this paper, we provide a broad overview of relevant quality-of-service metrics and describe their specific meaning in the context of distributed and decentralized publish-subscribe systems. Our goal is to provide a common base for future evaluations of emerging systems and for the design of qualityof- service aware publish-subscribe infrastructures.
Static Detection of Vulnerabilities in x86 Executables
Authors: Marco Cova, Viktoria Felmetsger, Greg Banks, Giovanni Vigna
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

In the last few years, several approaches have been proposed to perform vulnerability analysis of applications written in high-level languages. However, little has been done to automatically identify security-relevant flaws in binary code. In this paper, we present a novel approach to the identification of vulnerabilities in x86 executables in ELF binary format. Our approach is based on static analysis and symbolic execution techniques. We implemented our approach in a proof-of-concept tool and used it to detect taint-style vulnerabilities in binary code. The results of our evaluation show that our approach is both practical and effective.
A Comprehensive RMS Model for P2P e-Commerce Communities
Authors: Yuansheng Zhong, Dongping Hu, Maojun Huang, Deren Chen
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In order to overcome the deficiencies of current reputation management system (RMS) for P2P e- Commerce communities (ECCs), a comprehensive RMS model is presented. This model is composed of a reference model, a directed graph of feedback relationship (DGFR), and a protocol for management of transaction among peers within the ECC. It provides the possibility for different pair of peers with different trust values between them at different time. The model also differentiates apparently between the feedback trust and trade trust. By the tool of DGFR, the model is integrated with the average transaction money per peer and average rating it receives. It gives a preferable solution to several ordinary trust cheat in the reputation-based ECC and help implement a practical RMS in an ECC.
A Novel Asymptotic Deterministic Randomness Based Watermarking Scheme
Authors: Kai Wang, Wenjiang Pei, Zhenya He, Yiu-ming Cheung
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

To improve systems' resistance to attack based on symbolic dynamics, this paper presents a new digital watermarking method utilizing asymptotic deterministic randomness. Different from most of the existing chaotic watermarking methods, the asymptotic deterministic randomness with private key is utilized to encrypt watermarking image. The simulation results show that this proposed watermarking system has better security performance than chaotic map watermarking systems.
Initialization of online simulation models
Authors: André Hanisch, Juri Tolujew, Thomas Schulze
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Online simulation is a relatively new control strategy for short-term decision-making for the control and management of processes in existing systems. In contrast to traditional "non-terminating" simulation, online simulation cannot use a transient phase to tune the models because the simulation models need to run very quickly and also need to deliver results right from the start. In this context, the initialization of such online simulation models represents a special problem. It requires mapping between the system-describing variables in the model and the available data in the real system. This paper examines two different methods of initialization. Special emphasis is placed on explaining the approach of parent model synchronization. Both initialization approaches are transferred to the context of analyzing and forecasting pedestrian flows in a public building. A first prototypical implementation in SLX is also briefly presented.
Electronic government accessibility for people with blindness or low vision who utilize assistive computer technology
Authors: Matthew S. Mingus
Venue:  (2006)

Citizen access to electronic government information and services continues to enjoy an expansionary phase in local government. This expansionary phase holds a prominent place in service delivery strategic planning as governments address on-going operational challenges caused by increased fiscal pressures and greater accountability to the citizenry for their actions. Since the advent of the World Wide Web, in the mid 1990s, static information and interactive applications are available on government websites to facilitate information dissemination and citizen interaction. The presence of electronically delivered information and services may not address the accessibility needs of people with blindness or low vision who utilize assistive computer technology. Inaccessible websites can occur when accessibility-oriented development is absent from local government's web design process. Minimal research has been conducted to discover potential barriers preventing people with blindness or low vision who utilize assistive computer technology from accessing electronic delivery of government information and services through an official government website. This study consists of a cross-sectional survey of 472 local governments in a Midwestern state. Fifty-six local governments responded to the survey. The results indicate that 100% of respondents have accessibility design errors programmed into their official home pages. A key factor related to the number of accessibility design errors present on home pages is the work experience of a web developer. Additionally, subordinate web pages, linked to an official home page, demonstrate a similar number of instances of accessibility design errors as an official home page. This finding suggests errors are prevalent throughout entire websites. Finally, the presence of a formalized web development process is also a key factor related to the number of accessibility design errors present on home pages.
Efficient steady-state analysis of second-order fluid stochastic Petri nets
Authors: M. Gribaudo, R. Gaeta
Venue: Performance Evaluation (2006)

This paper presents an efficient solution technique for the steady-state analysis of the second-order stochastic fluid model underlying a second-order fluid stochastic Petri net (FSPN) with constant flow and transition rates, and a single bounded fluid place. The new solution technique is an extension of existing solution techniques developed for (first-order) Fluid Models; the solution algorithm uses upwind semi-discretization and Matrix Geometric techniques to efficiently compute the steady-state probabilities of the mixed discrete and continuous state space of the model. The effectiveness of our technique is proven first on a simple producer-consumer second-order FSPN model and then on a complex example taken from the literature where the analysis of the completion time distribution and the packet loss probability of short-lived TCP connections is investigated through the decomposition of a model for the whole system into several (simpler) sub-models; the interaction between the different submodels is handled by iterating their solution until the complete model solution converges according to a fixed point algorithm. The introduction of a second-order FSPN in a fixed point iteration scheme has been made possible thanks to the efficiency of the proposed solution technique.
Measuring Skin Topographic Structures through Capacitance Image Analysis
Authors: Alessandro Bevilacqua, Alessandro Gherardi, Roberto Guerrieri
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

In dermatology and in cosmetic science, the detailed analysis of the skin surface is still a key requirement to evaluate the effectiveness of medical or cosmetic treatments. Nowadays, the assessment of skin surface topographic structures such as wrinkles or micro-relief 3D profile is mainly obtained by profilometric analysis. Even though such an analysis gives a high level of detail, it is not suitable for in vivo studies since it requires the use of silicone cast replica of the skin. However, in the last few years a portable capacitive device has been proposed for in vivo skin topography characterization. This work presents the method we have developed to assess the capability of the capacitive device to provide reliable absolute measures of the skin surface structures. Extensive experiments carried out by comparing the measures achieved by means of the capacitive device and an optical profilometer allow us to validate our method.
The effect of precursor system on the resistivity and oxidation susceptibility of C/SiC nanocomposites en route to electronic grade nanomaterials
Authors: Cezary Czosnek, Mariusz Dryga, Jerzy F. Janik
Venue: Microelectronic Engineering (2005)

Presented are results of a study on specific technological properties of affordable C/SiC composite nanomaterials obtained via pyrolysis of several pitch/silicon-bearing precursor systems (elemental Si, silica SiO"2, poly(carbomethylsilane) [-CH"2-Si(H)CH"3-]"n, commercial SiC). For pyrolysis at 1300^oC, the formation of nanosized SiC is detected in the systems with elemental Si and poly(carbomethylsilane) while 1650^oC pyrolysis is required for silica to achieve such conversion. In situ formed nano-SiC is homogeneously dispersed in the simultaneously evolving graphitic carbon matrix of the composites. Reactivities vs. CO"2, electrical resistivities, and surface properties of the nanocomposites are determined. Significant differences and patterns in the properties among the materials obtained from these precursor systems and at the selected pyrolysis temperatures are clearly established. Among others, the data suggest potential for carbon removal from the most reactive nanocomposites via reactions with CO"2 to yield unique nano-SiC powder products for further processing towards electronic and ceramic applications.
Person Verification by Lip-Motion
Authors: Maycel Isaac Faraj, Josef Bigun
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper describes a new motion based feature extraction technique for speaker recognition using orientation estimation in 2D manifolds. The motion is estimated by computing the components of the structure tensor from which normal flows are extracted. By projecting the 3D spatiotemporal data to 2-D planes we obtain projection coefficients which we use to evaluate the 3-D orientations of brightness patterns in TV like 2D image sequences. This corresponds to the solutions of simple matrix eigenvalue problems in 2D, affording increased computational efficiency. An implementation based on joint lip movements and speech is presented along with experiments which confirm the theory, exhibiting a recognition rate of 98% on the publicly available XM2VTS database.
A Regularization Method for the Proximal Point Algorithm
Authors: Hong-Kun Xu
Venue: Journal of Global Optimization (2006)

A regularization method for the proximal point algorithm of finding a zero for a maximal monotone operator in a Hilbert space is proposed. Strong convergence of this algorithm is proved.
Distributed Garbage Collection Algorithms for Timestamped Data
Authors: Umakishore Ramachandran
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

There is an important class of interactive multimedia applications that deals with stream data from distributed sources. Indexing the data temporally facilitates ordering individual streams as well as correlating items from different streams. The Stampede programming system organizes stream data into channels that are distributed and synchronized data structures that contain timestamped items. A Stampede program is a data flow graph of threads and channels. Stampede semantics for channels allow concurrent access from multiple threads for input and output. While a channel holds timestamped items, the semantics do not place any restriction on either the production or consumption order of these items. Furthermore, timestamps of items in a channel need not be contiguous. These flexibilities are required due to the dynamic and parallel structure of stream-oriented applications targeted by the Stampede system. Under such circumstances, a key issue is the "garbage collection” (GC) of channel items. In this paper, we present and compare three different GC algorithms: 1) REF is a simple algorithm that keeps a reference count on individual items; 2) TGC is a distributed algorithm for computing a global low watermark for timestamp values of interest in the entire application; 3) DGC is another distributed algorithm that uses information about the dependencies between the producers and consumers of data streams to compute a low water mark local to each node of the data flow graph. DGC can simultaneously eliminate garbage from channels and unneeded computations from threads. In tests performed using an interactive application, DGC enjoys nearly 30 percent reduction in the application memory footprint compared to TGC and REF. DGC and REF are also shown to be more scalable compared to TGC.
Computationally Sound Compositional Logic for Key Exchange Protocols
Authors: Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventional runs of a protocol against a probabilistic polynomial-time attacker. Since reasoning about an unbounded number of runs of a protocol involves inductionlike arguments about properties preserved by each run, we formulate a specification of secure key exchange that is closed under general composition with steps that use the key. We present formal proof rules based on this gamebased condition, and prove that the proof rules are sound over a computational semantics. The proof system is used to establish security of a standard protocol in the computational model.
A Hybrid Approach to Cleansing Software Measurement Data
Authors: Taghi M. Khoshgoftaar
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Data is extremely important in empirical software engineering. Techniques that provide insight into potential anomalies or inaccuracies in a dataset are becoming an increasingly important way for a data analyst to cope with flawed data. We present a novel hybrid procedure for quantitative outcome correction along with controlled experiments using a real-world software measurement dataset to demonstrate the usefulness of our technique. Instances that are deemed to be noisy relative to the dependent variable, which represents the number of faults recorded in the program module, are cleansed by replacing the original value with a more appropriate alternative value.
Multiuser array beamforming based on a neural network mapping
Authors: A. Perez-Neira, M. A. Lagunas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper addresses the problem of simultaneous multiuser service. To find a feasible solution to the collision problem, two time reference multibeamformer systems are developed (BPSK TRMB and frequency framing TRMB). Based on a two-stage architecture, they enlarge the potential of existing separating neural networks and the algorithm (EM). Their goal is to perform a low computational simultaneous digital demodulation of users. The results support the frequency framing TRMB as the more robust system, which is able to give service to users in very degradated SNR scenarios; only the decoupling weights and their corresponding High Order Statistics learning is the overhead from a pure superposition of single channel receivers.
bitSPADE: A Lattice-based Sequential Pattern Mining Algorithm Using Bitmap Representation
Authors: Sujeevan Aseervatham, Aomar Osmani, Emmanuel Viennet
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Sequential pattern mining allows to discover temporal relationship between items within a database. The patterns can then be used to generate association rules. When the databases are very large, the execution speed and the memory usage of the mining algorithm become critical parameters. Previous research has focused on either one of the two parameters. In this paper, we present bitSPADE, a novel algorithm that combines the best features of SPAM, one of the fastest algorithm, and SPADE, one of the most memory efficient algorithm. Moreover, we introduce a new pruning strategy that enables bitSPADE to reach high performances. Experimental evaluations showed that bitSPADE ensures an efficient tradeoff between speed and memory usage by outperforming SPADE by both speed and memory usage factors more than 3.4 and SPAM by a memory consumption factor up to more than an order of magnitude.
A quantitative simulator for dynamic memory managers
Authors: J. M. Chang
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

In the last thirty years, several dynamic memory management schemes have been proposed. Such schemes include first fit, best fit, segregated fit, and buddy systems. Because the performance (speed and memory utilization) of each scheme differs, software engineers often face difficult choices in selecting the most suitable approach for their applications. In this paper, a quantitative simulator for dynamic memory management and memory tracing techniques are presented. This simulator receives dynamic memory management traces and performs allocations according to schemes (first fit, best fit, buddy systems, and segregated fit) defined by the user. At the end of each simulation run, different performance metrics are reported to the users. By using this approach, software engineers can evaluate system performance and decide which algorithm is the most suitable for their applications.
Spectral Methods for Automatic Multiscale Data Clustering
Authors: Arik Azran, Zoubin Ghahramani
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new insights into how the method works and uses these to derive new algorithms which given the data alone automatically learn different plausible data partitionings. The main theoretical contribution is a generalization of a key result in the field, the multicut lemma [7]. We use this generalization to derive two algorithms. The first uses the eigenvalues of a given affinity matrix to infer the number of clusters in data, and the second combines learning the affinity matrix with inferring the number of clusters. A hierarchical implementation of the algorithms is also derived. The algorithms are theoretically motivated and demonstrated on nontrivial data sets.
The Design on the AISO System using various rule and pattern Analysis of User on the HomeNetwork
Authors: Wonshik Na, Kyungsang Sung, Hae-Seok Oh
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

It has been highlighted and spread that the cutting edge system and intelligence home system raised from dramatic development of IT technology. Through the progressed Application of Home Networking Tech. and diverse multi-media, there are plenty of efforts to pursue the realization of human convenience. As a home networking services is on the increase, so is the demand for context-aware services, utilizing a profile of users as well as various context information, a sensor, and other environmental information in order to recognize a pattern of users' activities. And more enhanced services that can analyze users' pattern of behaviors and reflect individual tendency in the service should be offered so that users can obtain the information they want much faster. Thus, an intellectual control model will be discussed herein, which can offer active service based on a pattern of users' behaviors, in order to suggest a device that predicts users' activities and operates in a more intelligent way.