ppxscal/embedding_network huggingface dataset:
The On-Line Shortest Path Problem Under Partial Monitoring
Authors: András György, Tamás Linder, Gábor Lugosi, György Ottucsák
Venue: The Journal of Machine Learning Research (2007)

The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each round of a game a path between two distinguished vertices such that the loss of the chosen path (defined as the sum of the weights of its composing edges) be as small as possible. In a setting generalizing the multi-armed bandit problem, after choosing a path, the decision maker learns only the weights of those edges that belong to the chosen path. For this problem, an algorithm is given whose average cumulative loss in n rounds exceeds that of the best path, matched off-line to the entire sequence of the edge weights, by a quantity that is proportional to 1/√n and depends only polynomially on the number of edges of the graph. The algorithm can be implemented with complexity that is linear in the number of rounds n (i.e., the average complexity per round is constant) and in the number of edges. An extension to the so-called label efficient setting is also given, in which the decision maker is informed about the weights of the edges corresponding to the chosen path at a total of m ≪ n time instances. Another extension is shown where the decision maker competes against a time-varying path, a generalization of the problem of tracking the best expert. A version of the multi-armed bandit setting for shortest path is also discussed where the decision maker learns only the total weight of the chosen path but not the weights of the individual edges on the path. Applications to routing in packet switched networks along with simulation results are also presented.
An Algorithm to Detect P300 Potentials Based on F-Score Channel Selection and Support Vector Machines
Authors: Licai Yang, Jinliang Li, Yucui Yao, Guanglin Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

To improve the classification accuracy of P300 potentials and the training speed of optimal support vector machines (SVM) classifier, a novel P300 detection algorithm based on F-score channel selection and SVM is proposed in this paper. Using F-score channel selection method, we reduce the task-irrelevant EEG channels to enhance the detection accuracy of P300 potentials. Meanwhile, by a new training set selection method given in this paper, we divide the primal training set into a training set and a validation set. With this validation set, the test error of the SVM classifiers can be predicted more accurately and quickly. Our algorithm was tested with a P300 dataset from the BCI competition 2003. And the results showed that the algorithm achieved an accuracy of 100% in P300 detection within four repetitions.
Square Roots and Functional Decompositions of Boolean Functions
Authors: S. Rudeanu
Venue: IEEE Transactions on Computers (1976)

A square root of an isotone Boolean function f with respect to a variable xi was defined by Reischer and Simovici [10] as a Boolean function s such that holds identically. More generally, given a partition (T,Y,Z) of the set X = (x1,···,xn) of variables, we may be interested in finding a functional decomposition of the form
Classification of FTIR Gastric Cancer Data Using Wavelets and SVM
Authors: Cun-gui Cheng, Lu-yao Cheng, Run-sheng Xu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In order to improve the accuracy to diagnose rate earlier stage gastric cancer with Fourier Transform Infrared Spectroscopy (FTIR), a novel method of extraction of FTIR feature using continuous wavelet transform (CWT) analysis and classification using the support vector machine (SVM) was developed. To the FTIR of gastric normal tissue, early carcinoma and advanced gastric carcinoma, 9 feature parameters were extracted with continuous wavelet analysis. With SVM, all spectra were classified into two categories: normal or abnormal, which included early carcinoma and advanced gastric carcinoma. The accurate rate of poly and RBF kernel was high in all kernels. The accurate rate of poly kernel in normal, early carcinoma and advanced carcinoma were 100%, 96% and 100%, respectively. The accurate rate of RBF kernel in normal, early carcinoma and advanced carcinoma were 100%, 96% and 100%, respectively. The research result shows the feasibility of establishing the models with FTIR-CWT- SVM method to identify normal, early carcinoma and advanced gastric carcinoma.
A Quick Algorithm for Computing Core Based on the Positive Region
Authors: Wei-Dong Cai, Zhang-Yan Xu, Wei Song, Bing-Ru Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Some scholars provided the discernibility matrix based on the positive region. The time complexity of the algorithm for computing core with this discernibility matrix is O(|C| |U|2). For cutting down the time complexity of the algorithm, the definition of simplified discernibility matrix based on the positive region and the corresponding definition of the core are provided. At the same time, it is proved that this core is equivalent to the core based on the positive region. Since the partition of U/C is the key process for computing simplified discernibility matrix, a quick algorithm for computing U/C is designed with the idea of radix sorting. Its time complexity is O(|C| |U|). On this condition, a new algorithm for computing core based on the positive region is designed with the simplified discernibility. Its time complexity is cut down to max{O(|C| |U'pos| |U/C|), O(|C| |U|)}.
Management and analysis of DNA microarray data by using weighted trees
Authors: Trang Tran, Cam Chi Nguyen, Ngoc Minh Hoang
Venue: Journal of Global Optimization (2007)

We investigate discrete structures and combinatoric modeling of weighted prefix trees for managing and analyzing DNA microarray data. We describe the algorithms to construct the weighted trees for these data. Using these weighted trees with our algorithms, we propose methods to compute the appearance probability of a DNA microarray, to compare the informational distances in the expression of genes between the DNA microarrays, to search the characteristic microarrays and the group of candidate genes suggestive of a pathology.
Identifying clusters of functionally related genes in genomes
Authors: Gangman Yi, Sing-Hoi Sze, Michael R. Thon
Venue: Bioinformatics (2007)

Motivation: An increasing body of literature shows that genomes of eukaryotes can contain clusters of functionally related genes. Most approaches to identify gene clusters utilize microarray data or metabolic pathway databases to find groups of genes on chromosomes that are linked by common attributes. A generalized method that can find gene clusters regardless of the mechanism of origin would provide researchers with an unbiased method for finding clusters and studying the evolutionary forces that give rise to them. Results: We present an algorithm to identify gene clusters in eukaryotic genomes that utilizes functional categories defined in graph-based vocabularies such as the Gene Ontology (GO). Clusters identified in this manner need only have a common function and are not constrained by gene expression or other properties. We tested the algorithm by analyzing genomes of a representative set of species. We identified species-specific variation in percentage of clustered genes as well as in properties of gene clusters including size distribution and functional annotation. These properties may be diagnostic of the evolutionary forces that lead to the formation of gene clusters. Availability: A software implementation of the algorithm and example output files are available at http://fcg.tamu.edu/C_Hunter/. Contact: mthon@tamu.edu Supplementary information: Supplementary data are available at Bioinformatics online.
A Sharpness-Dependent Filter for Recovering Sharp Features in Repaired 3D Mesh Models
Authors: Chun-Yen Chen, Kuo-Young Cheng
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

This paper presents a sharpness-based method for hole-filling that can repair a 3D model such that its shape conforms to that of the original model. The method involves two processes: interpolation-based hole-filling, which produces an initial repaired model; and post-processing, which adjusts the shape of the initial repaired model to conform to that of the original model. In the interpolation-based hole-filling process, a surface interpolation algorithm based on the radial basis function creates a smooth implicit surface that fills the hole. Then, a regularized marching tetrahedral algorithm is used to triangulate the implicit surface. Finally a stitching and regulating strategy is applied to the surface patch and its neighboring boundary polygon meshes to produce an initial repaired mesh model, which is a regular mesh model suitable for post-processing. During post-processing, a sharpness dependent filtering algorithm is applied to the initial repaired model. This is an iterative procedure whereby each iteration step adjusts the face normal associated with each meshed polygon to recover the sharp features hidden in the repaired model. The experiment results demonstrate that the method is effective in repairing incomplete 3D mesh models.
Analysis of Transmission System Based on Phase Locked Loop
Authors: Chen-hao Qi, Man Feng, Le-nan Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Aiming at the serious problem in boosting demand for frequency resource, this paper proposes a new transmission system based on Phase Locked Loop (PLL). And Extended Binary Phase Shift Keying (EBPSK) with its optimized power spectrum is brought forward for efficient utilization of bandwidth. System parameters are discussed in detail and some comparisons are made. In the end, simulation results demonstrate that good Bit Error Rate (BER) performance can be obtained under some Signal Noise Ratio (SNR) condition.
Group Decision-Making Processes in Industrial Software Evolution
Authors: Miia-Maarit Saarelainen, Jussi Koskinen, Jarmo J. Ahonen, Irja Kankaanpaa, Henna Sivula, Heikki Lintinen, Paivi Juutilainen, Tero Tilus
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Software evolution decision-making is important. Decisions can be made by an individual or a group. Currently it is not known how decision-making is organized in software industry. However, that knowledge is needed to improve the decision-making processes. Therefore, we have studied 29 decisionmaking experts, who were involved in software evolution decision-making. The study was performed with qualitative methods, which enabled the gathering of versatile information concerning the views of the decision-makers. The study revealed group decisions are widely used both in private and public organizations and attitudes towards them are generally positive or neutral. The study provided information about usage of groups in the preparation phase of the decisions and in the actual decision-making phase. In most cases groups were used in the preparation phase. The revealed decision-making process is related to two theoretical process models. The findings help to understand industrial decision-making in this important, but empirically surprisingly scarcely studied area.
Face, Ear and Fingerprint: Designing Multibiometric Architectures
Authors: Andrea F. Abate, Michele Nappi, Daniel Riccio, Maria De Marsico
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The number of biometries as well as the number of publications about biometrics have noticeably grown in the last ten years. However, it was not possible yet to identify a bodily or behavioral feature able by itself to satisfy the acceptability and reliability constraints imposed by real applications. In this work we analyze the combination of the three different biometries face, ear and fingerprint using both a new multimodal schema, namely the N-Cross Testing Protocol, and a fast hierarchical architecture. Experimental results in the final part of our work provide a positive feedback.
Special Feature Learning with Computer Simulations
Authors: A. Bork
Venue: Computer (1979)

For successful classroom use, simulations must be integrated with other educational materials. The examples and methods described here have all been used in large introductory courses.
Resource and locality awareness in an incentive-based P2P live streaming system
Authors: Fabio Pianese, Diego Perino
Venue: Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV (2007)

One of the main challenges in P2P live streaming is the efficient allocation of the available resources. This paper presents an experimental evaluation of the effects of a local pairwise incentive mechanism applied to an unstructured mesh-based architecture. We focus on the relationship between resource availability in the system and the average quality of its data distribution paths, both in terms of bandwidth efficiency and awareness to network locality. We show via large scale testbed experiments based on the PULSE live streaming system that the introduction of appropriate incentive-based policies as the main peer selection mechanism can lead to a global content distribution mesh which has properties similar to tree-based structured systems.
Testing Software Design Modeled by Finite-State Machines
Authors: T. S. Chow
Venue: IEEE Transactions on Software Engineering (1978)

We propose a method of testing the correctness of control structures that can be modeled by a finite-state machine. Test results derived from the design are evaluated against the specification. No "executable" prototype is required. The method is based on a result in automata theory and can be applied to software testing. Its error-detecting capability is compared with that of other approaches. Application experience is summarized.
Implementing Virtual Practices using an Alternative Methodology to Develop Educational Software
Authors: Garcia Ivan, Garcia Josue
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Educational Software is one of the pillars of distance learning and educational systems and has become the basic tool for future generations of students. However, recent methodologies used in this development have too many problems: a lack of common theoretical frameworks which can be used by anyone in the project, and excessive formality in both technical and pedagogical factors. Activities employed in the development of educational software are complex because the process depends on the developer's expertise, aspects of software engineering, and the acquisition and implementation of pedagogical knowledge. We propose the introduction of "effective practices" within an alternative methodology to develop this kind of software. The identification of effective practices is focused internally to ensure the effective realization of the development process, and externally to guide the pedagogical monitoring of a project. Our effective practices provide the basis of an alternative methodology for the development of educational software under rigorous conditions that enable us to achieve a highly successful and repeatable process in the field of electronic instrumentation.
Urn Models and Beta-Splines
Authors: Ronald Goldman
Venue: IEEE Computer Graphics and Applications (1986)

Splines were originally studied in approximation theory where the focus is on approximating explicit functions of the form y = f(x) or z = f(x,y). These splines were later adopted by mathematicians and computer sicentists for use in computer-aided geometric design (CAGD) where the emphasis was shifted to parametric curves and surfaces. Initially the continuity conditions for splines developed in approximation theory were retained in CAGD, but it was soon realized that the old constraints were unnecessarily restrictive in this new context and that they could be relaxed without losing the essential property of smoothness. Beta-splines were developed to take advantage of this new freedom by introducing shape parameters into the constraint equations. These parameters could then be manipulated by a designer to change the shape of a curve of surface in an intuitively meaningful and useful way. Another seemingly unrelated context in which shape parameters appear is in blending functions constructed from discrete urn models. The purpose of this article is to begin to unify these two independent approaches to shape parameters, and in the process apply the techniques of urn models to gain some insight into the properties of Beta-splines.
Integrating automatic data acquisition with business processes experiences with SAP's auto-ID infrastructure
Authors: Christof Bornhövd, Tao Lin, Stephan Haller, Joachim Schaper
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Smart item technologies, like RFID and sensor networks, are considered to be the next big step in business process automation [1]. Through automatic and real-time data acquisition, these technologies can benefit a great variety of industries by improving the efficiency of their operations. SAP's Auto-ID infrastructure enables the integration of RFID and sensor technologies with existing business processes. In this paper we give an overview of the existing infrastructure, discuss lessons learned from successful customer pilots, and point out some of the open research issues.
Flexible State Update Mechanism for Large-Scale Distributed Wargame Simulations
Authors: Suiping Zhou, Wentong Cai, Stephen J. Turner, Junhu Wei, Wenbo Zong
Venue: Simulation (2007)

Large-scale wargame simulations may involve tens of thousands of entities and generally run on distributed simulation nodes. An important issue in constructing these applications is to reduce the amount of data transmitted among the distributed simulation nodes so that the network and the simulation nodes will not be flooded by the state update messages. To this end, we first propose a timeliness condition on how frequently the state updates of a local simulation entity need to be sent to other remote simulation nodes. A fleXible state update mechanism is then proposed to ensure the update intervals of the entities meet the required timeliness update condition and, in the meantime, balance the number of entities that need to be updated in each simulation time step (referred to here as the frame). EXperiments with a distributed wargame simulation indicate that the proposed mechanism can significantly reduce the number of messages sent over the network while still maintaining the simulation fidelity.
Easing the burden of fixed telephone lines on small-scale entrepreneurs in Nigeria: GSM lines to the rescue
Authors: John Olatunji Adeoti, Adetola Ibidunni Adeoti
Venue: Telematics and Informatics (2008)

The study reported in this paper investigated the socio-economic characteristics of the adopters of GSM lines and the factors determining the adoption of GSM lines by small-scale entrepreneurs in a major Nigerian city (Ibadan). The results of the study confirm the widely held notion that the advent of mobile telephony in Nigeria has significantly improved telephone access among the strata of the population that could not afford the relatively expensive and inefficient fixed telephone lines. The relatively lower cost of acquiring GSM lines stands out more than any other factor as the driver of decision to adopt GSM lines by small-scale entrepreneurs. Logistic regression analysis demonstrated that factors such as number of apprentices employed, sales turnover, and type of business are also important determinants of the adoption of GSM lines by small-scale entrepreneurs. The parameter estimates of these variables have positive sign and are statistically significant at 1% level. Results also suggest that the relatively new small-scale entrepreneurs are more proactive in the adoption of GSM lines than entrepreneurs that are older in business. In addition, the findings suggest that female small-scale entrepreneurs are generally younger in age though it is unclear whether they are more proactive than their male counterparts in the adoption of GSM lines. Entrepreneurs in service sectors are also more likely to adopt GSM lines than those in manufacturing.
Design and Implementation of a Highly Parameterised FPGA-Based Skeleton for Pairwise Biological Sequence Alignment
Authors: Khaled Benkrid, Ying Liu, Abdsamad Benkrid
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper presents the design and implementation of a generic and highly parameterised FPGA-based skeleton for pairwise biological sequence alignment. The skeleton is parameterised in terms of the sequence symbol type i.e. DNA, RNA, or Protein sequences, the sequence lengths, the match score i.e. the score attributed to a symbol match or the penalty attributed to a mismatch or gap, and the matching task. Instances of the skeleton implement the Smith-Waterman and the Needleman-Wunsch algorithms. The skeleton has been captured in the Handel-C language which makes it FPGA-platform-independent. It implements the sequence alignment algorithm in hand using a pipeline of basic processing elements, which are tailored to the supplied parameters. Actual hardware implementations of the Smith-Waterman algorithm for protein sequence alignment achieve speed-ups in excess of 100:1 compared to equivalent standard desktop software implementations.
QoS content management for P2P file-sharing applications
Authors: Michela Meo, Fabio Milan
Venue: Future Generation Computer Systems (2008)

Peer-to-peer (P2P) file-sharing applications allow large communities of users to share multimedia contents. According to their willingness to participate in the P2P community, nodes can switch on and off. An active node participates in the community by downloading content from other nodes and by allowing others to download content which are stored in its own memory. In this paper, we focus on the design of content management at the nodes. Basically, whenever a node retrieves some new content, it may store it in the shared memory and make it available to other users, or it may ''consume'' it on the fly. The storing policy impacts the effectiveness of the application to provide content to users. Indeed, if only few copies of a given content are available, it may happen that, while the nodes storing those copies are off, the content is not available. Based on the probability that this content unavailability occurs, we define a notion of Quality-of-Service (QoS) and we propose criteria for the QoS design of content management policies. Moreover, we consider a simple policy based on these criteria and we evaluate its performance by an analytical model based on a Markovian approach.
Special Feature: Specifying Resource Allocaton for the Cm* Multiprocessor
Authors: K. Schwan
Venue: IEEE Software (1986)

This mechanism is a first step toward automation. Using allocation heuristics, it compiles a programmer's high-level-language descriptions into explicit allocating statements allocating processor and memory resources.