ppxscal/embedding_network huggingface dataset:
Computational Tasks in Bronchoscope Navigation During Computer-Assisted Transbronchial Biopsy
Authors: Jarosław Bułat, Krzysztof Duda, Mirosław Socha, Paweł Turcza, Tomasz Zieliński, Mariusz Duplaga
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The paper presents algorithmic solutions dedicated to computer navigation system which is to assist bronchoscope positioning during transbronchial needle-aspiration biopsy. The navigation exploits principle of on-line registration of real images coming from endoscope camera and virtual ones generated on the base of computed-tomography (CT) data of a patient. When these images are similar an assumption is made that the bronchoscope and virtual camera have approximately the same position and view direction. In the paper the following computational aspects are described: correction of camera lens distortion, fast approximate estimation of endoscope ego-motion, reconstruction of bronchial tree from CT data by means of their segmentation and its centerline calculation, virtual views generation, registration of real and virtual images via maximization of their mutual information and, finally, efficient parallel and network implementation of the navigation system which is under development.
An Improved Simplex-Genetic Method to Solve Hard Linear Programming Problems
Authors: Juan Frausto-Solís, Alma Nieto-Yáñez
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Linear programming (LP) is an important field of optimization. Even though, interior point methods are polynomial algorithms, many LP practical problems are solved more efficiently by the primal and dual revised simplex methods (RSM); however, RSM has a poor performance in hard LP problems (HLPP) as in the Klee-Minty Cubes problem. Among LP methods, the hybrid method known as Simplex-Genetic (SG) is very robust to solve HLPP. The objective of SG is to obtain the optimal solution of a HLPP, taking advantages from each one of the combined methods -a genetic algorithm (GA) and the classical primal RSM-. In this paper a new SG method named Improved Simplex Genetic Method (ISG) is presented. ISG combines a GA (with special genetic operators) with both primal and dual RSM. Numerical experimentation using some instances of the Klee-Minty cubes problem shows that ISG has a better performance than both RSM and SG.
Gradient or Contours Cues? A Gating Experiment for the Timing of the Emotional Information
Authors: Nicolas Audibert, Véronique Aubergé
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

This work aims at measuring the anticipated perception of emotions on minimal linguistic units, to evaluate if the underlying cognitive processing is compatible with the hypothesis of gradient contours. Selected monosyllabic stimuli extracted from an expressive corpus and expressing anxiety, disappointment, disgust, disquiet, joy, resignation, sadness and satisfaction, were gradually presented to naïve judges in a gating experiment. Results strengthen the hypothesis of gradient processing by showing that identification along successive gates of most of expressions follow a linear pattern typical of a contour-like processing, while expressions of satisfaction present distinct gradient values that make possible an early identification of affective values.
A second-order difference scheme for a parameterized singular perturbation problem
Authors: Zhongdi Cen
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we consider a singularly perturbed quasilinear boundary value problem depending on a parameter. The problem is discretized using a hybrid difference scheme on Shishkin-type meshes. We show that the scheme is second-order convergent, in the discrete maximum norm, independent of singular perturbation parameter. Numerical experiments support these theoretical results.
Verifying Temporal and Epistemic Properties of Web Service Compositions
Authors: Alessio Lomuscio, Hongyang Qu, Marek Sergot, Monika Solanki
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Model checking Web service behaviour has remained limited to checking safety and liveness properties. However when viewed as a multi agent system, the system composition can be analysed by considering additional properties which capture the knowledge acquired by services during their interactions. In this paper we present a novel approach to model checking service composition where in addition to safety and liveness, epistemic properties are analysed and verified. To do this we use a specialised system description language (ISPL) paired with a symbolic model checker (MCMAS) optimised for the verification of temporal and epistemic modalities. We report on experimental results obtained by analysing the composition for a Loan Approval Service.
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
Authors: Michael Polacek, Karl F. Doerner, Richard F. Hartl, Vittorio Maniezzo
Venue: Journal of Heuristics (2008)

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. The proposed Variable Neighborhood Search (VNS) is a simple and robust solution technique which tackles the basic problem as well as its extensions. The VNS shows excellent results on four different benchmark sets. Particularly, for all 120 instances the best known solution could be found and in 71 cases a new best solution was achieved.
Discovering Compound and Proper Nouns
Authors: Grzegorz Protaziuk, Marzena Kryszkiewicz, Henryk Rybinski, Alexandre Delteil
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The identification of appropriate text tokens (words or sequences of words representing concepts) is one of the most important tasks of text preprocessing and may have great influence on the final results of text analysis. In our paper, we introduce a new approach to discovering compound nouns, including proper compound nouns. Our approach combines the data mining methods with shallow lexical analysis. We propose a simple pattern language for specifying grammatical patterns to be satisfied by extracted compound nouns. Our method requires annotating the words with part of speech tags, thus to this extent, it is language-dependent. Based on the data mining GSP algorithm, we propose T-GSP as its modification for extracting frequent text patterns, and in particular, frequent word sequences that satisfy given grammatical rules. The obtained sequences are regarded as candidates for compound nouns. The experiments have proven very high quality of the method.
The Internet and the European Parliament elections: Theoretical perspectives, empirical investigations and proposals for research
Authors: Wainer Lusoli
Venue: Information Polity (2005)

This article reviews the existing literature on the study of on-line aspects of elections along three well-rehearsed theoretical frameworks: equalisation vs. normalisation, information vs. engagement, and mobilisation vs. reinforcement. It then examines the contribution of this volume to the field, first by direct reference to existing literature, then more generally, touching upon the notion of the 'comparative' - theoretical, geographical and empirical. I examine the contribution of the articles, considered as a collective effort, in relation to the increasing specialisation in the study of on-line aspects of elections. Then the framing of issues and the evidence presented within and across individual articles are used to assess the import of the internet for election campaigns with respect to increasing pluralism, professionalisation, and audience activity (or the lack thereof). It will be argued that this theme issue represents a first, necessary contribution towards gaining a cross-national understanding of the growing role of the internet for electoral practice. The last section further elaborates on possible future directions of online campaign studies, drawing on the study of the 2004 EP online election.
Hippocampus-Inspired Spiking Neural Network on FPGA
Authors: Maizura Mokhtar, David M. Halliday, Andy M. Tyrrell
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

There is now a great interest in exploiting the capabilities of hardware devices; especially the reconfigurable properties of FPGA to implement and study the dynamics of neural networks, specifically a biological inspired neural network. FPGA has a much greater appeal than other modes of implementation because an FPGA implementation offers the flexibility of simple software (re-)configuration in comparison to other digital ASICs. In this paper a hippocampus-inspired spiking neural network is implemented on an FPGA, in order to take advantage of these two characteristics as well as to achieve autonomy for a neuro-controller device.
A Contourlet-Based Method for Wavelet Neural Network Automatic Target Recognition
Authors: Xue Mei, Liangzheng Xia, Jiuxian Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

An object recognition algorithm is put forward based on statistical character of contourlet transform and multi-object wavelet neural network (MWNN). A contourlet-based feature extraction method is proposed, which forms the feature vector taking advantage of the statistical attribution in each sub-band of contourlet transform. And then the extracted features are weighted according to their dispersion degree of data. WNN is used as classifier, which combines the extraction local singularity of wavelet transform and adaptive of artificial neural network. With the application in an aircraft recognition system, the experimental data showed the efficiency of this algorithm for automation target recognition.Keywords: Automatic target recpgnition, Wavelet neural network, Contourlet transform, Feature extraction.
Fuzzy Control of a Real Time Inverted Pendulum System
Authors: Selcuk Kizir, Zafer Bingul, Cuneyt Oysu
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In this study, a real-time control of the cart-pole inverted pendulum system was developed using fuzzy logic controller. Swing-up and stabilization of the inverted pendulum were implemented directly in fuzzy logic controller. The fuzzy logic controller designed in the Matlab-Simulink environment was embedded in a dSPACE DS1103 DSP controller board. Swing-up algorithm brings the pendulum near to its inverted position in 10 seconds from downward position. In order to test the robustness of the fuzzy logic controller internal (changing model parameters) and external disturbances (applying external forces) were applied on the inverted pendulum. The inverted pendulum system was shown to be robust to the external and internal disturbances. The maximum errors of the pendulum angle to the impulse input were between 1.89° and 4.6449° in the robustness tests.
The rise and decline of a visionary policy: Swedish ICT-policy in retrospect
Authors: Patrik Hall, Karl Löfgren
Venue: Information Polity (2004)

During the 1990s a new policy area - ICT-policy - evolved in Swedish politics. It manifested itself through a number of unprecedented initiatives from the government including a new type of institutional set-up. These initiatives all encompassed an underlying idea of governing the new policy area in a manner different from previous modes of governing which emphasised a parliamentary chain of command. Governing concepts such as "dialogue", "networks" and "visionary hearings" became cornerstones for "leading" Sweden into the new "information society". In this article we have the ambition to analyse how a new phenomenon in politics have been received in an age characterised by deregulation, new paradigms in governance and a welfare state in transition. Based on a comprehensive interview survey and a discourse analysis of official documents we can conclude that the new modes of governance have not been efficient tools to accomplish the high ambitions and objectives of the policy. Rather, the new institutions set up to manage 'the future' have in many cases become 'garbage cans' for issues the traditional "institutions" have not been capable of managing. Moreover, they have in confrontation with old institutions become omitted from actual influence.
Time-Bounded and Space-Bounded Sensing in Wireless Sensor Networks
Authors: Olga Saukh, Robert Sauter, Pedro José Marrón
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Most papers on sensing in wireless sensor networks use only very simple sensors, e.g. humidity or temperature, to illustrate their concepts. However, in a large number of scenarios including structural health monitoring, more complex sensors that usually employ medium to high frequency sampling and post-processing are required. Additionally, to capture an event completely several sensors of different types are needed which have to be in range of the event and used in a timely manner. We study the problem of time-bounded and space-bounded sensing where parallel use of different sensors on the same node is impossible and not all nodes possess all required sensors. We provide a model formalizing the requirements and present algorithms for spatial grouping and temporal scheduling to tackle these problems.
Path-Based Access Control for Enterprise Networks
Authors: Matthew Burnside, Angelos D. Keromytis
Venue: Proceedings of the 11th international conference on Information Security (2008)

Enterprise networks are ubiquitious and increasingly complex. The mechanisms for defining security policies in these networks have not kept up with the advancements in networking technology. In most cases, system administrators define policies on a per-application basis, and subsequently, these policies do not interact. For example, there is no mechanism that allows a web server to communicate decisions based on its ruleset to a firewall in front of it, even though decisions being made at the web server may be relevant to decisions at the firewall. In this paper, we describe a path-based access control system for service-oriented architecture (SOA)-style networks which allows services to pass access-control-related information to neighboring services, as the services process requests from outsiders and from each other. Path-based access control defends networks against a class of attacks wherein individual services make correct access control decisions but the resulting global network behavior is incorrect. We demonstrate the system in two forms, using graph-based policies and by leveraging the KeyNote trust management system.
A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules
Authors: Jean-François Baget
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of these datatypes is inspired by the work done for RDF/RDFS, keeping sound and complete projection-based algorithms for deduction has led to strong syntactic restrictions (datatyped concept nodes of a target graph cannot be generic). This restriction, however, allows us to smoothly upgrade our extension to rules, and to introduce functional relations (that compute the value of datatyped concept nodes) while keeping sound and complete reasonings.
ILP Through Propositionalization and Stochastic k-Term DNF Learning
Authors: Aline Paes, Filip Železný, Gerson Zaverucha, David Page, Ashwin Srinivasan
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

One promising family of search strategies to alleviate runtime and storage requirements of ILP systems is that of stochastic local search methods, which have been successfully applied to hard propositional tasks such as satisfiability. Stochastic local search algorithms for propositional satisfiability benefit from the ability to quickly test whether a truth assignment satisfies a formula. Because of that many possible solutions can be tested and scored in a short time. In contrast, testing whether a clause covers an example in ILP takes much longer, so that far fewer possible solutions can be tested in the same time. Therefore in this paper we investigate stochastic local search in ILP using a relational propositionalized problem instead of directly use the first-order clauses space of solutions.
Merging Adaptive Hypermedia and Intelligent Tutoring Systems Using Knowledge Spaces
Authors: Amanda Nicholas, Brent Martin
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Adaptive Hypermedia and Intelligent Tutoring Systems are both used for computer-based instruction, but their strengths lie in different areas. Adaptive Hypermedia is better suited to the instruction of concepts, while Intelligent Tutoring Systems generally assist in the use of these concepts to solve problems. A general instruction system requires both of these methods of instruction to provide a full learning environment. This paper describes a proposed method of combining Adaptive Hypermedia and Intelligent Tutoring Systems using Knowledge Spaces, a method of mathematically modeling a domain.
Combining Isabelle and QEPCAD-B in the Prover's Palette
Authors: Laura I. Meikle, Jacques D. Fleuriot
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

We present the Prover's Palette, a framework for combining mathematical tools, and describe an integration of the theorem prover Isabelle with the computer algebra system QEPCAD-B following this approach. Examples are used to show how results from QEPCAD can be used in a variety of ways, with and without trust. We include new functionality for instantiating witnesses automatically and auto-running where applicable. We conclude that user-centric design yields systems integrations which are extremely versatile and easy to use.
Catenary Support Vector Machines
Authors: Kin Fai Kan, Christian R. Shelton
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Many problems require making sequential decisions. For these problems, the benefit of acquiring further information must be weighed against the costs. In this paper, we describe the catenary support vector machine (catSVM), a margin-based method to solve sequential stopping problems. We provide theoretical guarantees for catSVM on future testing examples. We evaluated the performance of catSVM on UCI benchmark data and also applied it to the task of face detection. The experimental results show that catSVM can achieve a better cost tradeoff than single-stage SVM and chained boosting.
Evolutionary Meta Compilation: Evolving Programs Using Real World Engineering Tools
Authors: Jamie Cullen
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

A general purpose system and technique is presented for the separation of target program compilation and fitness evaluation from the primary evolutionary computation system. Preliminary results are presented for two broadly different domains: (1) Software generated in the C programming language, (2) Hardware designs in Verilog, suitable for synthesis. The presented approach frees the developer from implementing and debugging a complex interpreter, and potentially enables the rapid integration of previously unsupported languages, as well as complex methods of fitness evaluation, by leveraging the availability of external tools. It also enables engineers (especially those in industry) to use preferred/approved tools for which source code may not be readily available, or which may be cost or time prohibitive to reimplement. Efficiency gains are also expected, particularly for complex domains where the fitness evaluation is computationally intensive.
Mitos: Design and Evaluation of a DBMS-Based Web Search Engine
Authors: Panagiotis Papadakos, Yannis Theoharis, Yannis Marketakis, Nikos Armenatzoglou, Yannis Tzitzikas
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Engineering a Web search engine offering effective and efficient information retrieval is a challenging task. Mitos is a recently developed search engine that offers a wide spectrum of functionalities. A rather unusual design choice is that its index is based on an object-relational database system, instead of the classical inverted file. This paper discusses the benefits and the drawbacks of this choice (compared to inverted files), proposes three different database representations, and reports comparative experimental results. Two of these representations are one order of magnitude more space economical and two orders of magnitude faster in query evaluation, than the plain relational representation.
Personalized search based on user intention through the hierarchical phrase vector model
Authors: GunWoo Park, JinGi Chae, Dae Hee Lee, SangHoon Lee
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

There are many kinds of personalizing approaches in the area of web information retrieval. But it is still unclear whether personalization is consistently effective on different queries for different users, and under different search contexts. In this paper, we study this problem and propose a personalized search approach that can easily extend a conventional search engine. We present an intelligent relevance-evaluation framework for user Intention-based personalized search based on web-mining and machine learning approaches. Users can navigate through the prior user's intention by their own needs. This is especially useful for polysemous and poor queries. By analyzing the results, we reveal that there is an unique representation of intention under different queries, contexts and users. Furthermore, we reveal that this knowledge is very important in improving retrieval performance by filtering the results, recommending a new query, and distinguishing user's characteristics. Proposed personalized search engine HPS(Hierachical Phrase Search) can provide more predictive information by clearly identifying the searcher's intention at query-time.
Survey of Scanner and Printer Forensics at Purdue University
Authors: Nitin Khanna, Aravind K. Mikkilineni, George T. Chiu, Jan P. Allebach, Edward J. Delp
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

This paper describes methods for forensic characterization of scanners and printers. This is important in verifying the trust and authenticity of data and the device that created it. An overview of current forensic methods, along with current improvements of these methods is presented. Near-perfect identification of source scanner and printer is shown to be possible using these techniques.