ppxscal/embedding_network huggingface dataset:
Extended Naive Bayes classifier for mixed data
Authors: Chung-Chian Hsu, Yan-Ping Huang, Keng-Wei Chang
Venue: Expert Systems with Applications: An International Journal (2008)

Naive Bayes induction algorithm is very popular in classification field. Traditional method for dealing with numeric data is to discrete numeric attributes data into symbols. The difference of distinct discredited criteria has significant effect on performance. Moreover, several researches had recently employed the normal distribution to handle numeric data, but using only one value to estimate the population easily leads to the incorrect estimation. Therefore, the research for classification of mixed data using Naive Bayes classifiers is not very successful. In this paper, we propose a classification method, Extended Naive Bayes (ENB), which is capable for handling mixed data. The experimental results have demonstrated the efficiency of our algorithm in comparison with other classification algorithms ex. CART, DT and MLP's.
On the number of shredders
Authors: Tibor Jordán
Venue: Journal of Graph Theory (1999)

A subset S of k vertices in a k-connected graph G is a shredder, if G - S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [Cheriyan Thurimella, Proc 28th Ann ACM Symp, 1996]. If G contains no meshing shredders (in particular, if k &le; 3), the sharp upper bound [ (n - k - 1)-2] is proven. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 195-200, 1999
A mobile audio messages streaming system
Authors: Mabel Vazquez, Pierre Vincent
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this paper we describe a mobile audio messages streaming system, whose aim is to create and deliver streaming of voice messages to mobile phones. Streaming is a very attractive multimedia service that has many applications. It allows users to open a connection with a server to receive media and start to play it as soon as sufficient information has arrived. As mobile phones have different capabilities, it has not been easy to develop a streaming application that fits most mobile devices. This project presents a solution to implement this application in a way to reach most mobile phones even if originally they lack of features to allow streaming.
Automatic Mutation Testing and Simulation on OWL-S Specified Web Services
Authors: Shufang Lee, Xiaoying Bai, Yinong Chen
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Web Ontology Language for Services (OWL-S) is a standard XML-based language for specifying workflows and integration semantics among Web services (WS), which form composite WS. This paper analyzes the fault patterns of OWL-S specified composite WS and their workflows, proposes an ontology-based mutation analysis method, and applies specification-based mutation techniques for composite WS simulation and testing. Four categories of OWL-S mutant operators are specified, including data mutation, condition mutation, control flow mutation, and data flow mutation. Finally, the paper studies the ontology-based input mutation technique using a BookFinder service as a case study, which shows that ontology-based mutation provides viable test adequacy criteria for testing OWL-S specified composite WS.
Maximum empirical likelihood estimation of continuous-time models with conditional characteristic functions
Authors: Qingfeng Liu, Yoshihiko Nishiyama
Venue: Mathematics and Computers in Simulation (2008)

For some popular financial continuous-time models, tractable expressions of likelihood functions are unknown. For that reason, the maximum likelihood estimation method is infeasible. Fortunately, closed functional forms of conditional characteristic functions of some of these models are known. We construct an empirical likelihood estimation method using tractable conditional characteristic functions to estimate such a model. This method resolves the problem of covariance matrix singularity in the standard generalized method of moments and fully utilizes information in conditional moment restrictions. It is applicable to many popular financial models such as some diffusion models, jump diffusion models, and stochastic volatility models. Using a Monte Carlo comparison, we show that this method provides superior performance compared to other methods in some situations.
Sobolev orthogonal polynomials defined via gradient on the unit ball
Authors: Yuan Xu
Venue: Journal of Approximation Theory (2008)

An explicit family of polynomials on the unit ball B^d of R^d is constructed, so that it is an orthonormal family with respect to the inner product=@r@!"B"^"d@?f(x).@?g(x)dx+L(fg),where @r>0, @? is the gradient, and L(fg) is either the inner product on the sphere S^d^-^1 or f(0)g(0).
Reflecting human behavior to motivate desirable lifestyle
Authors: Tatsuo Nakajima, Vili Lehdonvirta, Eiji Tokunaga, Hiroaki Kimura
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Ambient lifestyle feedback systems are embedded computer systems designed to motivate changes in a person's lifestyle by reflecting an interpretation of targeted behavior back to the person. Other interactive systems including "serious games" have been applied for the same purpose in areas such as nutrition, health and energy conservation, but they suffer from drawbacks such as inaccurate self-reporting, burdens placed on the user, and lack of effective feedback. Ambient lifestyle feedback systems overcome these challenges by relying on passive observation, calm presentation style and emotionally engaging feedback content. In this paper, we present an ambient lifestyle feedback system concept and provide insights from the design and implementation of two prototype systems, Virtual Aquarium and Mona Lisa Bookshelf. In particular, we discuss the theory and practice of effective feedback design by drawing on elementary behavioral psychology and small-scale user studies. The work is aimed at aiding in the design of ambient persuasive technologies and ambient interaction in general.
Mathematical modeling of time fractional reaction-diffusion systems
Authors: V. Gafiychuk, B. Datsko, V. Meleshko
Venue: Journal of Computational and Applied Mathematics (2008)

We study a fractional reaction-diffusion system with two types of variables: activator and inhibitor. The interactions between components are modeled by cubical nonlinearity. Linearization of the system around the homogeneous state provides information about the stability of the solutions which is quite different from linear stability analysis of the regular system with integer derivatives. It is shown that by combining the fractional derivatives index with the ratio of characteristic times, it is possible to find the marginal value of the index where the oscillatory instability arises. The increase of the value of fractional derivative index leads to the time periodic solutions. The domains of existing periodic solutions for different parameters of the problem are obtained. A computer simulation of the corresponding nonlinear fractional ordinary differential equations is presented. For the fractional reaction-diffusion systems it is established that there exists a set of stable spatio-temporal structures of the one-dimensional system under the Neumann and periodic boundary conditions. The characteristic features of these solutions consist of the transformation of the steady-state dissipative structures to homogeneous oscillations or space temporary structures at a certain value of fractional index and the ratio of characteristic times of system.
Foundations for Web Services Orchestrations: Functional and QoS Aspects, Jointly
Authors: Sidney Rosario, Albert Benveniste, Stefan Haar, Claude Jard
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Web Services Orchestrations require a firm mathematical basis for their development, regarding both their functional and QoS characteristics. We provide such a basis in the form of a model based on colored Petri net systems. Our approach allows evaluatingend-to-end QoS of the orchestration with the help of the QoS of the called sites.
Comparative tempo-spatial pattern analysis: CTSPA
Authors: Y. Xie, X. Ye
Venue: International Journal of Geographical Information Science (2007)

A new method is illustrated for describing the characteristics of urban pattern changes over different time periods. This method employs vector geometry, paired centroids, shared boundary lines, and overlain polygons. Three new statistics are proposed for characterizing local polygon feature changes in quantity, shape, and size. These statistics are standardized, based on conventional theories from urban geography such as directional concentric zones and user-designated corridors to document both regional and global patterns of land-use change. This method is used to analyse land-use changes in metropolitan Detroit between 1990 and 2000. The Detroit case study indicates that the CTSPA statistics are effective in describing urban spatial pattern changes and in characterizing the evolution of discrete urban landscapes over selected periods.
A Method to Correct Systematic Bias in Affymetrix SNP Arrays
Authors: Lin Wan, Wenjiang J. Fu, Minghua Deng, Minping Qian
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Affymetrix SNP arrays are important tools and widely used for both genotyping and copy number estimation. We found previously that systematic bias exists in Affymetrix SNP arrays and leads to loss of accuracy in copy number estimations. In this paper, we showed that systematic bias within SNP arrays is multiplicative effect (or additive effects in the log scale) to probe intensities. Based on this observation, a method was introduced to correct the systematic bias within SNP arrays.
Methods of Chebyshev points of convex sets and their applications
Authors: T. I. Belykh, V. P. Bulatov, E. N. Yas'Kova
Venue: Automation and Remote Control (2008)

Consideration is given to methods of Chebyshev points in convex programming and their applications in optimal control. These methods belong to a class of cutting-immersion methods whose idea is in the approximation of convex sets by concave polyhedra.
Transactional memory: from semantics to silicon
Authors: Ali-Reza Adl-Tabatabai
Venue: Proceedings of the 1st international workshop on Multicore software engineering (2008)

Multi-core architectures bring parallel programming into the mainstream. Parallel programming poses many new challenges to the developer, one of which is synchronizing concurrent access to shared memory by multiple threads. Programmers have traditionally used locks for synchronization, but locks have well-known pitfalls: Simplistic coarse-grained locking does not scale well, while more sophisticated fine-grained locking risks introducing deadlocks and data races. Furthermore, scalable libraries written using fine-grained locks cannot be easily composed in a way that retains scalability and avoids deadlock and data races. Transactional memory provides new synchronization constructs that alleviate many of the pitfalls of lock-based synchronization. In this talk, I will present our recent work on transactional memory. I will describe the transactional memory stack we have developed at Intel's programming systems lab. This stack includes new transactional memory language constructs for C and Java, compiler optimizations for these constructs, and high-performance transactional memory runtimes. I will also describe how hardware acceleration can improve the performance of transactional memory. Finally, I will discuss the challenges we face in bringing transactional memory into the mainstream
A game approach for multi-channel allocation in multi-hop wireless networks
Authors: Lin Gao, Xinbing Wang
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-hoc networks. In this paper, we study the competitive multi-radio channel allocation problem in multi-hop wireless networks in detail. We model the channel allocation problem as a static cooperative game, in which some players collaborate to achieve high date rate. We propose the min-max coalition-proof Nash equilibrium (MMCPNE) channel allocation scheme in the game, which is aiming to max the achieved date rates of communication links. We study the existence of MMCPNE and prove the necessary conditions for MMCPNE. Furthermore, we propose several algorithms that enable the selfish players to converge to MMCPNE. Simulation results show that MMCPNE outperforms CPNE and NE schemes in terms of achieved data rates of the multi-hop links due to cooperation gain.
An Analysis Framework of Factors Influencing China Software and Information Service Offshore Outsourcing
Authors: Ning Zhang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Offshore outsourcing has become popular because of cost or skill advantage. China is considered as one of major global software and information service offshore destinations, but it cannot compete with India right now. Based on literature review, this paper first presents an overview of the industry. Then 38 service providers in China are investigated to give a firm-level analysis of the industry. A framework of factors influencing the industry is presented. Influence factors are classified into macro factors, middle factors, and micro factors, each of which is analyzed in detail. It is concluded that China software and information service offshore outsourcing industry is of great potential, but needs marketing and advertising.
Breast Imaging Using Transmission Ultrasound: Reconstructing Tissue Parameters of Sound Speed and Attenuation
Authors: Cuiping Li, Neb Duric, Lianjie Huang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Multiple tissue parameters are useful for early breast cancer detection and diagnosis. Ultrasound tomography is a new, important imaging modality for our Computerized Ultrasound Risk Evaluation (CURE) prototype, which employs a ring transducer array to scan the whole breast in a water tank. We use our bent-ray time-of-flight ultrasound tomography to reconstruct sound speeds of breasts with different densities. In addition, we develop an ultrasound attenuation reconstruction method based on complex-signal energy ratios. We apply our reconstruction techniques to in vitro and in vivo breast data acquired using the CURE device. Our reconstruction results demonstrate that CURE has great potential to reliably measure multiple mass characteristics by combining sound-speed, attenuation and reflection images.
BITPEER: continuous subspace skyline computation with distributed bitmap indexes
Authors: Katerina Fotiadou, Evaggelia Pitoura
Venue: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems (2008)

In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to include all points necessary for computing the skyline at any subspace. We present an algorithm for computing extended skylines using a bitmap representation along with a storage efficient bucket-based variation of this representation. We provide a caching scheme so that subspace skyline queries can re-use the results of previously computed similar queries. We also introduce a method for grouping continuous subspace queries for supporting their efficient computation. Finally, we present preliminary experimental results of the performance of our approach.
Network-constrained regularization and variable selection for analysis of genomic data
Authors: Caiyan Li, Hongzhe Li
Venue: Bioinformatics (2008)

Motivation: Graphs or networks are common ways of depicting information. In biology in particular, many different biological processes are represented by graphs, such as regulatory networks or metabolic pathways. This kind of a priori information gathered over many years of biomedical research is a useful supplement to the standard numerical genomic data such as microarray gene-expression data. How to incorporate information encoded by the known biological networks or graphs into analysis of numerical data raises interesting statistical challenges. In this article, we introduce a network-constrained regularization procedure for linear regression analysis in order to incorporate the information from these graphs into an analysis of the numerical data, where the network is represented as a graph and its corresponding Laplacian matrix. We define a network-constrained penalty function that penalizes the L1-norm of the coefficients but encourages smoothness of the coefficients on the network. Results: Simulation studies indicated that the method is quite effective in identifying genes and subnetworks that are related to disease and has higher sensitivity than the commonly used procedures that do not use the pathway structure information. Application to one glioblastoma microarray gene-expression dataset identified several subnetworks on several of the Kyoto Encyclopedia of Genes and Genomes (KEGG) transcriptional pathways that are related to survival from glioblastoma, many of which were supported by published literatures. Conclusions: The proposed network-constrained regularization procedure efficiently utilizes the known pathway structures in identifying the relevant genes and the subnetworks that might be related to phenotype in a general regression framework. As more biological networks are identified and documented in databases, the proposed method should find more applications in identifying the subnetworks that are related to diseases and other biological processes. Contact: hongzhe@mail.med.upenn.edu
An approach for extracting non-manifold mid-surfaces of thin-wall solids using chordal axis transform
Authors: William Roshan Quadros
Venue: Engineering with Computers (2008)

This paper proposes an approach for extracting non-manifold mid-surfaces of thin-wall solids using the chordal axis transform (CAT) (Prasad in CNLS Newsletter&#x2014;Center for Nonlinear Studies, Los Alamos National Laboratory, vol 139, 1997). There is great demand for extracting mid-surfaces as it is used in dimension reduction. Quadros and Shimada previously used CAT in extracting 2-manifold mid-surfaces of a particular type of thin-wall solids. The proposed approach is an extension of the previous approach (Quadros and Shimada in 11th international meshing roundtable, 2002) in order to extract non-manifold mid-surfaces of general thin-wall solids. The three steps involved in extracting the mid-surface of a thin-wall solid are: (1) generating a tet mesh of a thin-wall solid without inserting interior nodes; (2) generating a raw mid-surface by smart cutting of tets; and (3) remeshing the raw mid-surface via smart clean-up. In the proposed approach, a discrete model (i.e., a tet mesh without any interior nodes) is used instead of working directly on a CAD model. The smart cutting of tets using CAT yields correct topology at the non-manifold region in the raw mid-surface. As the raw mid-surface is not directly suitable for engineering purposes, it is trimmed using a smart clean-up procedure and then remeshed. The proposed approach has been implemented using C++ in commercial ALGOR finite element analysis software. The proposed approach is computationally efficient and has shown effective results on industrial models.
Artificial Evolution
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2008)

Cover artist David Hart discusses his background, work, and inspiration.
Intelligent Video Surveillance Networks: Data Protection Challenges
Authors: Fanny Coudert, Jos Dumortier
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Video surveillance techniques are evolving from static and passive cameras documenting events to dynamic and preventive networks. Two trends lead this change: the shift towards wireless IP systems and the emergence of video analytics. The former allows for flexible networks, massive customization whereas the later comes to solve the problem of increase network complexity. This evolution brings however new threats for individual freedoms, challenging in particular the application of data protection safeguards. This paper takes the prototype developed by DYVINE project as example for the next generation of video surveillance networks and analyses its potential threats from a data protection standpoint.
Efficient implementation of constant coefficient division under quantization constraints
Authors: Juan A. Lopez, Gabriel Caffarena, Ruzica Jevtic, Carlos Carreras, Octavio Nieto-Taladriz
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Division is one of the basic operations of arithmetic algorithms, but the cost associated to its hardware implementation exceeds the reasonable limits for most dedicated architectures. This paper provides a systematic algorithm that (a) transforms the constant coefficient division into a constant coefficient multiplication, selectable under some given constraints, and (b) optimizes the resulting multiplier by analyzing the quantization noise inherent to the finite wordlength implementation process. Consequently, this algorithm achieves reduced-area, high-speed constant coefficient dividers that maintain the accuracy in the range of represented numbers. The theorems and presented results confirm that the proposed algorithm computes the most suitable fraction under a given set of noise constraints.
COMP Superscalar: Bringing GRID Superscalar and GCM Together
Authors: Enric Tejedor, Rosa M. Badia
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

This paper presents the design, implementation and evaluation of COMP Superscalar, a new and componentised version of the GRID superscalar framework that enables the easy development of Grid-unaware applications. By means of a simple programming model, COMP Superscalar keeps the Grid as transparent as possible to the programmer. Moreover, the performance of the applications is optimized by exploiting their inherent concurrency when executing them on the Grid. The runtime of COMP Superscalar has been designed to follow the Grid Component Model (GCM) and is therefore formed by several components, each one encapsulating a given functionality identified in GRID superscalar.
Image denoising by thresholding in the wavelet domain and implementation in FPGA using VHDL
Authors: Anand Paul, K. Bharanitharan, R. Sakthivel
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Wavelet transform has the advantage of visualizing the parameter both in Time and Frequency Domain this technique has been effective in noise removal with minimum side effects on important features such as image details and edges. This paper gives VLSI architecture implementation in FPGA for image processing. The image decomposed into L levels and the detail and approximation coefficients are found and the denoising using Hard and Soft thresholding is applied and the denoised coefficients are reconstructed to get the denoised image. Efficient hardware implementation based on FPGA technology is proposed.