ppxscal/embedding_network huggingface dataset:
An Improved Support Vector Machine for the Classification of Imbalanced Biological Datasets
Authors: Haiying Wang, Huiru Zheng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Based on advances in statistical learning theory, Support Vector Machine (SVM) has demonstrated unique features and state-of-the-art performance in many real-world classification problems. However, conventional SVM utilizes a sign function to classify test data into different classes, which has shown some limitations that hinder its performance. This paper exploresthe feasibility of incorporating information theory-based approaches into SVM decision making process and demonstrated its application in the classification of imbalanced biological datasets. The results obtained indicated that by incorporating information theory-based technique, a significant improvement was achieved (p < 0.005), especially in the process of classification of imbalanced datasets. The proposed methodology not only can improve the overall prediction performance but also can make the classification with the SVM less sensitive to the selection of input parameters.
Content-based communication in disconnected mobile ad hoc networks
Authors: Julien Haillot, Frédéric Guidec
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Applications dedicated to information sharing, news distribution, service advertisement and discovery all need a communication model where information flows towards any interested receiver, rather than towards specifically set destinations. Content-based communication is a style of communication that perfectly fits the needs of such applications. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs). The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. Simulation results are presented, showing the efficiency of this protocol in a mobile ad hoc network composed of devices carried by pedestrians evolving in a campus environment.
Application of R-Functions Method and Parallel Computations to the Solution of 2D Elliptic Boundary Value Problems
Authors: Marcin Detka, Czesław Cichoń
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

In the paper, the R-function theory developed by Rvachew is applied to solve 2D elliptic boundary value problems. Unlike the well-established FEM or BEM method, this method requires dividing the solution into two parts. In the first part, the boundary conditions are satisfied exactly and in the second part, the differential equation is satisfied in an approximate way. In such a way, it is possible to formulate in one algorithm the so-called general structural solution of a boundary-value problem and use it for an arbitrary domain and arbitrary boundary conditions. The usefulness of the proposed computational method is verified using the example of the solution of the Laplace equation with mixed boundary conditions.
Learning, Information Extraction and the Web
Authors: Tom M. Mitchell
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Significant progress has been made recently in semi-supervised learning algorithms that require less labeled training data by utilizing unlabeled data. Much of this progress has been made in the context of natural language analysis (e.g., semi-supervised learning for named entity recognition and for relation extraction). This talk will overview progress in this area, present some of our own recent research, and explore the possibility that now is the right time to mount a community-wide effort to develop a never-ending natural language learning system.
GISTURISMO Massa-Carrara --- Advanced Territory's Dynamic Fruition Service for a Conscious Tourism
Authors: Antonio Luca
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

Providing detailed and comprehensive information on everything a region can offer in terms of tourist, environmental, cultural, architectural, sporting or eno-gastronomic supply, making use of the most advanced technologies in order to satisfy the ever more increasing requirements of visitors either occasional or not who want to consciously tackle a territory. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Integrated Approach for QoS-Aware Multicast Tree Maintenance
Authors: Wu-Hong Tsai, Yuan-Sun Chu
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

To maintain the quality of multicast tree in supporting dynamic membership is critical important for the tree receivers. We propose an integrated approach that combines core migration with local search to afford the receivers a consistent quality service. The main ideas behind the thought are always migrate the core to the tree topological center within limited overhead and provide multiple routes via local search for a new receiver to meet its quality requirements. Our algorithm aims to meet a predefined upper bound delay along path to individual receiver and satisfy the constraint of inter-destination delay variation among all receivers. Simulation results show that our proposed algorithm performs well in terms of constrains indicated above.
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
Authors: Bjørn Kjos-Hanssen, Anil Nerode
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

Algorithmic randomness is most often studied in the setting of the fair-coin measure on the Cantor space, or equivalently Lebesgue measure on the unit interval. It has also been considered for the Wiener measure on the space of continuous functions. Answering a question of Fouché, we show that Khintchine's law of the iterated logarithm holds at almost all points for each Martin-Löf random path of Brownian motion. In the terminology of Fouché, these are the complex oscillations. The main new idea of the proof is to take advantage of the Wiener-Carathéodory measure algebra isomorphism theorem.
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
Authors: Paweł Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We give an O(n + t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. Given a NFA accepting a language of polynomial growth, we can also determine the order of polynomial growth in O(n + t) time. We also give polynomial time algorithms to solve these problems for context-free grammars.
On the Use of Domain Terms in Source Code
Authors: Sonia Haiduc, Andrian Marcus
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Information about the problem domain of the software and the solution it implements is often embedded by developers in comments and identifiers. When using software developed by others or when are new to a project, programmers know little about how domain information is reflected in the source code. Programmers often learn about the domain from external sources such as books, articles, etc. Hence, it is important to use in comments and identifiers terms that are commonly known in the domain literature, as it is likely that programmers will use such terms when searching the source code. The paper presents a case study that investigated how domain terms are used in comments and identifiers. The study focused on three research questions: (1) to what degree are domain terms found in the source code of software from a particular problem domain?; (2) which is the preponderant source of domain terms: identifiers or comments?; and (3) to what degree are domain terms shared between several systems from the same problem domain? Within the studied software, we found that in average: 42% of the domain terms were used in the source code; 23% of the domain terms used in the source code are present in comments only, whereas only 11% in the identifiers alone, and there is a 63% agreement in the use of domain terms between any two software systems.
Recursive Bayesian Linear Discriminant for Classification
Authors: D. Huang, C. Xiang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Extracting proper features is crucial to the performance of a pattern recognition system. Since the goal of a pattern recognition system is to recognize a pattern correctly, a natural measure of "goodness" of extracted features is the probability of classification error. However, popular feature extraction techniques like principal component analysis (PCA), Fisher linear discriminant analysis (FLD), and independent component analysis (ICA) extract features that are not directly related to the classification accuracy. In this paper, we present two linear discriminant analysis algorithms (LDA) whose criterion functions are directly based on minimum probability of classification error, or the Bayes error. We term these two linear discriminants as recursive Bayesian linear discriminant I (RBLD-I) and recursive Bayesian linear discriminant II (RBLD-II). Experiments on databases from UCI Machine Learning Repository show that the two novel linear discriminants achieve superior classification performance over recursive FLD (RFLD).
Security Framework in a Virtual Large-Scale Disk System
Authors: Minoru Uehara
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Many enterprises proceed to introduce thin clients for internal control. In a thin client environment, a large capable storage is required. However, such storage is expensive. So, we propose novel storage based on PC data grid, and then we call it VLSD (Very Large-Scale Disk). We developed prototype storage of 70TB using VLSD. In our experience, we found that there are several security issues in VLSD. For example, conventional VLSD allows becoming, wiretap and alteration. In this paper, we propose a security framework for VLSD in order to solve these issues on security. Using, this framework, these issues can be solved. In addition, we evaluate the performance of this security framework.
Adaptive Balancing of Edge Extraction in LADAR-Referenced Navigation over Plain Area
Authors: Yi Lin, Lei Yan, Yuefeng Liu, Miao Jiang, Qingxi Tong
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Although high-resolution remote sensing (RS) images can supplement the reference map's deficiency in LADAR (Laser Radar) referenced navigation system over plain area, their different imaging modes still leave great errors' introduction into the positioning process. As positioning is commonly accomplished by matching the edges extracted as the obvious terrain characteristics, exploring automatic procedure for balancing mutual information is an important step to improve the system's performance. To solve this issue, this paper explores the criterion of edge-points ratio (EPR) based on wavelet multi-scale analysis extraction method, and then appropriate measures are applied for different conditions. EPR at various decomposition layer works as the key circle for adaptive balancing, and so related edge-distribution characteristics can be used individually, such as close-contour or line.
Modeling light scattering for virtual heritage
Authors: Diego Gutierrez, Veronica Sundstedt, Fermin Gomez, Alan Chalmers
Venue: Journal on Computing and Cultural Heritage (JOCCH) (2008)

Computer graphics, in particular high-fidelity rendering, make it possible to recreate cultural heritage on a computer, including a precise lighting simulation. Achieving maximum accuracy is of the highest importance when investigating how a site might have appeared in the past. Failure to use such high fidelity means there is a very real danger of misrepresenting the past. Although we can accurately simulate the propagation of light in the environment, little work has been undertaken into the effect that light scattering due to participating media (such as dust in the atmosphere) has on the perception of the site. In this article, we present the high-fidelity rendering pipeline including participating media. We also investigate how the appearance of an archaeological reconstruction is affected when dust is included in the simulation. The chosen site for our study is the ancient Egyptian temple of Kalabsha.
Applied Statistical Indicators to the Vehicle Routing Problem with Time Windows for Discriminate Appropriately the Best Algorithm
Authors: Jorge A. Ruiz-Vanoye, José A. Zárate M., Ocotlán Díaz-Parra, Vanesa Landero N.
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this paper, we propose indicators based on the position method of the descriptive statistic for the Vehicle Routing Problem with Time Windows (VRPTW). The indicators are based on the calculation of the median; they will serve altogether with the technique of discriminant analysis to select appropriately the algorithm that better solves an instance of the VRPTW.
ZapTV: Personalized User-Generated Content for Handheld Devices in DVB-H Mobile Networks
Authors: Yolanda Blanco-Fernández, José J. Pazos-Arias, Alberto Gil-Solla, Manuel Ramos-Cabrer, Martín López-Nores
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

During the last years, we had witnessed the boom of the digital market due to proliferation of emergent audiovisual services and increasing number of broadband networks. In this scenario, users insistently demand for innovative services for exchanging and sharing their own audiovisual contents and productions. In order to meet these needs, in this paper we propose the ZapTV system. Broadly speaking, this tool broadcasts user-generated audiovisual contents for handheld devices in a mobile network based on the DVB-H broadcasting standard. ZapTV offers diverse added-value services to these new active users, such as: (i) multi modal access (via Web and by handheld devices) to digital contents anywhere and anytime, (ii) availability of a return channel to transmit interactive contents that enhance the user's viewing experience, and (iii) annotation, sharing and personalized distribution of audiovisual contents. To achieve these goals, our system adopts both well-known technologies for broadcasting and semantic annotation of audiovisual contents (such as DVB-H and TV-Anytime), and emergent technology from the so-called Web 2.0, which permit the users to actively cooperate in tasks of generation, annotation and classification of digital contents.
Symbolic Reachability for Process Algebras with Recursive Data Types
Authors: Stefan Blom, Jaco Pol
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our algorithm supports recursive data types and allows unbounded non-determinism, which is needed to support open systems with data. The algorithm does not use any specific features of process algebras. That is, it will work for any system that consists of a fixed number of communicating processes, where in each atomic step only a subset of the processes participate. As proof of concept we have implemented the algorithm in the context of the μCRL toolset. We also compared the performance of this prototype with the performance of the existing explicit tools on a set of typical case studies.
Fuzzy control approach to mixed culture cultivation for PHB production process: nitrogen time profile synthesis
Authors: Petia D. Koprinkova-Hristova
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

The present paper considers the control problems of the mixed culture system where sugars (glucose) were converted to lactate by the microorganism L. delbrueckii and then the lactate was converted to PHB (poly-β-hydroxybutyrate) by the microorganism R. euthropha. The strategy to determine the optimal nitrogen concentration profile that maximizes the PHB production at the end of the process is discussed. Fuzzy rules based on experts' knowledge of the process and previous investigations are proposed. They are applied together with previously developed fuzzy approach that maintains the lactate concentration at its' optimal value by means of the dissolved oxygen concentration set point and the substrate (glucose) concentration feeding rate simultaneously. It is shown that the intelligent approach proposed here outperforms the classical control strategies applied before.
A Study of Malcode-Bearing Documents
Authors: Wei-Jen Li, Salvatore Stolfo, Angelos Stavrou, Elli Androulaki, Angelos D. Keromytis
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

By exploiting the object-oriented dynamic composability of modern document applications and formats, malcode hidden in otherwise inconspicuous documents can reach third-party applications that may harbor exploitable vulnerabilities otherwise unreachable by network-level service attacks. Such attacks can be very selective and difficult to detect compared to the typical network worm threat, owing to the complexity of these applications and data formats, as well as the multitude of document-exchange vectors. As a case study, this paper focuses on Microsoft Word documents as malcode carriers. We investigate the possibility of detecting embedded malcode in Word documents using two techniques: static content analysis using statistical models of typical document content, and run-time dynamic tests on diverse platforms. The experiments demonstrate these approaches can not only detect known malware, but also most zero-day attacks. We identify several problems with both approaches, representing both challenges in addressing the problem and opportunities for future research.
Several Enhancements to Hermite-Based Approximation of One-Variable Functions
Authors: Bartlomiej Beliczynski, Bernardete Ribeiro
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Several enhancements and comments to Hermite-based one-variable function approximation are presented. First of all we prove that a constant bias extracted from the function contributes to the error decrease. We demonstrate how to choose that bias. Secondly we show how to select a basis among orthonormal functions to achieve minimum error for a fixed dimension of an approximation space. Thirdly we prove that loss of orthonormality due to truncation of the argument range of the basis functions does not effect the overall error of approximation and the expansion coefficients. We show how this feature can be used. An application of the obtained results to ECG data compression is presented.
Improved Approximation Algorithms for Relay Placement
Authors: Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. Mitchell, Valentin Polishchuk, Jukka Suomela
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

In the relay placement problem the input is a set of sensors and a number r ¿ 1, the communication range of a relay. The objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. We present a 3.11-approximation algorithm, and show that the problem admits no PTAS, assuming P${}\ne{}$NP.
Built-In Self-Test Techniques
Authors: Edward McCluskey
Venue: IEEE Design Test (1985)

A system that includes self-test features must have facilities for generating test patterns and analyzing the resultant circuitresponse. This article surveys the structures that are used to implement these self-test functions. The various techniquesused to convert the system bistables into test scan paths are discussed. The addition of bistables associated with the I/Obonding pads so that the pads can be accessed via a scan path (external or boundary scan path) is described. Most designsuse linear-feedback shift registers for both test pattern generation and response analysis. The various linear-feedback shiftregister designs for pseudorandom or pseudoexhaustive input test pattern generation and for output response signature analysisare presented.
Functional Test Generation Based on Combined Random and Deterministic Search Methods
Authors: Eduardas Bareiša, Vacius Jusas, Kęstutis Motiejūnas, Rimantas Šeinauskas
Venue: Informatica (2007)

The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for functional test generation. In the paper presented analysis of random search methods and adjacent stimuli generation allowed formulating a practical method for generating functional tests. This method incorporates the analyzed termination conditions of generation, exploits the advantages of random and deterministic search, as well as the feature that the sets of the selected input stimuli can be merged easily in order to obtain a better set of test patterns.
On Convex Minimization over Base Polytopes
Authors: Kiyohito Nagano
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

This note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition algorithm for the separable convex function minimization problems helps us give simple sufficient conditions for the rationality of optimal solutions and that it leads us to some interesting properties, including the equivalence of the lexicographically optimal base problem, introduced by Fujishige, and the submodular utility allocation market problem, introduced by Jain and Vazirani. In addition, we develop an efficient implementation of the decomposition algorithm via parametric submodular function minimization algorithms. Moreover, we show that, in some remarkable cases, non-separable convex optimization problems over base polytopes can be solved in strongly polynomial time.