ppxscal/embedding_network huggingface dataset:
Dynamic Modeling in Inductive Inference
Authors: John Case, Timo Kötzing
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

Introduced is a new inductive inference paradigm, Dynamic Modeling. Within this learning paradigm, for example, function h learns function g iff, in the i-th iteration, h and g both produce output, h gets the sequence of all outputs from g in prior iterations as input, g gets all the outputs from h in prior iterations as input, and, from some iteration on, the sequence of h's outputs will be programs for the output sequence of g.Dynamic Modeling provides an idealization of, for example, a social interaction in which h seeks to discover program models of g's behavior it sees in interacting with g, and h openly discloses to g its sequence of candidate program models to see what g says back.Sample results: every g can be so learned by some h; there are g that can only be learned by an h if g can also learn that h back; there are extremely secretive h which cannot be learned back by any g they learn, but which, nonetheless, succeed in learning infinitely many g; quadratictime learnablity is strictly more powerful than lintime learnablity.This latter result, as well as others, follow immediately from general correspondence theorems obtained from a unified approach to the paradigms within inductive inference.Many proofs, some sophisticated, employ machine self-reference, a.k.a., recursion theorems.
A General Approach to Predict the Performance Order of TSP Family Problems
Authors: P. Fritzsche, D. Rexachs, E. Luque
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Parallel computers provide an efficient and economical way to solve large-scale and/or time-constrained scientific, engineering, and industry problems. Consequently, there is a need to predict the performance order of both deterministic and non-deterministic parallel algorithms.The performance prediction of the traveling salesman problem (TSP) is a challenging problem because similar input data sets may cause significant variability in execution times. Parallel performance of data-dependent algorithms depends on the problem size, the number of processors, and other parameters. Discovering the main other parameters is the real key to obtain a good estimation of performance order.This paper presents a novel methodology to the problem of predicting the performance of a parallel algorithm for solving the TSP. The entire process explores data in search of patterns and/or relationships detecting the main parameters that affect performance. Then, it uses the measured values for this limited number of inputs to produce a multiple-linear-regression model. Finally, the regression equation allows for predicting how the algorithm will respond when given new input data sets. The preliminary experimental results are quite promising.
Scaling Topic Maps
Authors: Mare Wilhelm Küster, Graham Moore
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

The encyclopédie of Diderot and d'Alembert is unique in building an open discourse model based on maps of knowledge and a wide-ranging coverage of the knowledge of its time. d'Alembert's Discours préliminaire prefigured many of the topic map paradigms down to the very metaphor.However, the encyclopédie was still bound by the inevitable restrictions of the print medium. A completely non-literary example, the nascent European eGovernment Resource Network (section 2), shows the need to transcend the encyclopedic model. In many cases we need both distributed registries and repositories. These requirements give rise to prototypical implementations for cross-implementation linked registries (section 3) that gives a hint at how registries can genuinely scale to a distributed world of knowledge.
Runtime Verification of C Programs
Authors: Klaus Havelund
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

We present in this paper a framework, Rmor, for monitoring the execution of C programs against state machines, expressed in a textual (non-graphical) format in files separate from the program. The state machine language has been inspired by a graphical state machine language Rmor recently developed at the Jet Propulsion Laboratory, as an alternative to using Linear Temporal Logic (LTL) for requirements capture. Transitions between states are labeled with abstract event names and Boolean expressions over such. The abstract events are connected to code fragments using an aspect-oriented pointcut language similar to AspectJ's or AspectC's pointcut language. The system is implemented in the C analysis and transformation package Cil, and is programmed in Ocaml, the implementation language of Cil. The work is closely related to the notion of stateful aspects within aspect-oriented programming, where pointcut languages are extended with temporal assertions over the execution trace.
Cognitive Categorization in Medical Structures Modeling and Image Understanding
Authors: Lidia Ogiela, Ryszard Tadeusiewicz, Marek R. Ogiela
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

This study presents new classes of cognitive categorization systems, with particular emphasis on one selected system class: UBIAS (Understanding Based Image Analysis Systems) used to analyze images. The purpose of defining new classes of cognitive categorization systems is to conduct an in-depth analysis of various kinds of data with particular attention to the semantic/meaning contents of the data analyzed. The presented techniques of semantic analysis are based on using cognitive data analysis. This paper presents new opportunities for applying cognitive categorization techniques to model semantic interpretations of selected medical images. Methods of computational intelligence for developing a syntactic-based semantic description of selected medical visualizations with particular attention to leg bones are detailed. The presented methodology makes it possible to find, for each biological structure, its semantic description and allows the semantic meaning of visible deformation or pathology to be formulated. The presented approach also proves that artificial intelligence methods based on linguistic mechanisms can be used to develop new classes of intelligent information systems – UBIAS Systems.
Improving the Efficiency of Misuse Detection by Means of the q-gram Distance
Authors: Slobodan Petrovic, Sverre Bakke
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Misuse detection-based intrusion detection systems (IDS) perform search through a database of attack signatures in order to detect whether any of them are present in incoming traffic. For such testing, fault-tolerant distance measures are needed. One of the appropriate distance measures of this kind is constrained edit distance, but the time complexity of its computation is too high. We propose a two-phase indexless search procedure for application in misuse detection-based IDS that makes use of q-gram distance instead of the constrained edit distance. We study how well q-gram distance approximates edit distance with special constraints needed in IDS applications. We compare the performances of the search procedure with the two distances applied in it. Experimental results show that the procedure with the q-gram distance implemented achieves for higher values of q almost the same accuracy as the one with the constrained edit distance implemented, but the efficiency of the procedure that implements the q-gram distance is much better.
Fabrication of CNTs/Cu composite thin films for interconnects application
Authors: Ping Liu, Dong Xu, Zijiong Li, Bo Zhao, Eric Siu-Wai Kong, Yafei Zhang
Venue: Microelectronic Engineering (2008)

Carbon nanotubes/copper (CNTs/Cu) composite thin films were fabricated by combined electrophoresis and electroplating techniques. Electrical properties and structure of both CNTs/Cu thin films and the reference pure Cu thin films were investigated after annealing at different temperatures. The sheet electrical resistance of CNTs/Cu films decreases faster than that of pure Cu films with increase of annealing temperature. The grain size of CNTs/Cu film becomes much larger than that of pure Cu film at the same annealing temperature. The peak relative intensity of Cu (111) plane in CNTs/Cu film was stronger than that of pure Cu film. CNTs/Cu composite thin films, with better electrical properties than that of conventional pure Cu thin films, have been fabricated by electrophoresis and electroplating deposition techniques.
What Do Semantics Matter When the Meat Is Overcooked?
Authors: José Luiz Fiadeiro
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the configuration of global computers and an operational model of service-oriented dynamic reconfiguration based on a resolution-like mechanism similar to concurrent constraint programming. A resolution step involves a goal executed by a business activity and a clause that corresponds to a complex service. Unification captures service discovery, ranking and selection based on SLA-constraint optimisation and interpretations between specifications of conversations expected by the goal and provided by the discovered service. The resolvent is a reconfiguration of the original business activity that results from binding the goal with the discovered service.
A new multi-objective algorithm for a project selection problem
Authors: S. Ghorbani, M. Rabbani
Venue: Advances in Engineering Software (2009)

Project selection problem is an incessant problem, which every organization face. It, in fact, plays a key role in prosperity of the company. Meta-heuristic methods are the well-reputed methods which have been employed to solve a variety of multi-objective problems forming the real world problems. In this paper, a new multi-objective algorithm for project selection problem is studied. Two objective functions have been considered to maximize total expected benefit of selected projects and minimize the summation of the absolute variation of allotted resource between each successive time periods. A meta-heuristic multi-objective is proposed to obtain diverse locally non-dominated solutions. The proposed algorithm is compared, based on some prominent metrics, with a well-known genetic algorithm, i.e. NSGA-II. The computational results show the superiority of the proposed algorithm in comparison with NSGA-II.
Adaptive Routing of Cruising Taxis by Mutual Exchange of Pathways
Authors: Kosuke Yamamoto, Kentaro Uesugi, Toyohide Watanabe
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The tremendous development of information and communication technology had large influence for service management in the taxi dispatching work. However, taxi drivers who want to drive in "cruising taxis" decide their travel routes by depending on their own heuristics. As a result, traffic jams and local excess supplies have often been occurred. In this paper, we propose an adaptive routing method in the cruising taxis. In our method, pathways where many customers are expected to exist are assigned to drivers. This assignment changes dynamically adapting to changes of taxis' positions. Our simulation experiment shows that our method was able to gain more customers than the existing means of cruising taxis.
Advances in Acoustic Modeling for the Recognition of Czech
Authors: Jiří Kopecký, Ondřej Glembek, Martin Karafiát
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper presents recent advances in Automatic Speech Recognition for the Czech Language. Improvements were achieved both in acoustic and language modeling. We mainly aim on the acoustic part of the issue. The results are presented in two contexts, the lecture recognition and SpeeCon+Temic test set. The paper shows the impact of using advanced modeling techniques such as HLDA, VTLN and CMLLR. On the lecture test set, we show that training acoustic models using word networks together with the pronunciation dictionary gives about 4---5% absolute performance improvement as opposed to using direct phonetic transcriptions. An effect of incorporating the "schwa" phoneme in the training phase shows a slight improvement.
Locating and Understanding Features of Complex Software Systems by Synchronizing Time-, Collaboration- and Code-Focused Views on Execution Traces
Authors: Johannes Bohnet, Stefan Voigt, Juergen Doellner
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Extending or modifying features of complex software systems is often a highly time-consuming and cost-intensive task as, before hand, the features have to be located within the code and to be understood in detail. To support developers in performing this task, we propose a technique that takes execution traces and implementation unit structuring as input data and provides various views there upon. Views focus on different trace characteristics, namely they are time-,collaboration-, and code-focused. Synchronizing the views creates a rich user interface that helps developers to effectively identify and understand feature relevant parts of the implementation.
Proving Properties of Lazy Functional Programs with Sparkle
Authors: Maarten Mol, Marko Eekelen, Rinus Plasmeijer
Venue: Central European Functional Programming School: Second Summer School, CEFP 2007, Cluj-Napoca, Romania, June 23-30, 2007, Revised Selected Lectures (2008)

This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The purpose of a proof assistant is to use formal reasoning to verify the correctness of a computer program. Formal reasoning is very powerful, but is unfortunately also difficult to carry out.Due to their mathematical nature, functional programming languages are well suited for formal reasoning. Moreover, Sparkle offers specialized support for reasoning about Clean, and is integrated into its official development environment. These factors make Sparkle a proof assistant that is relatively easy to use.This paper provides both theoretical background for formal reasoning, and detailed information about using Sparkle in practice. Special attention will be given to specific aspects that arise due to lazy evaluation and due to the existence of strictness annotations. Several assignments are included in the text, which provide hands-on experience with Sparkle.
Mixed-Initiative Relaxation of Constraints in Critiquing Dialogues
Authors: David Mcsherry, David W. Aha
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Eliminating previously recommended items in a critiquing dialogue prevents the user from navigating back to acceptable items she critiqued earlier in the dialogue. An equally serious problem if previous recommendations are not eliminated is that acceptable items may be unreachable by any sequence of critiques. Progressive critiquing solves this dilemma while also making it easier for users to recognize when none of the available items are acceptable. In this paper, we present theoretical and empirical results that demonstrate the benefits of a critiquing strategy in which the user gives priority to constraints that must be satisfied in a progressive critiquing dialogue. We also present a new version of progressive critiquing in which mixed-initiative relaxation of constraints introduced by user critiquing choices that depart from this strategy greatly reduces their impact on dialogue outcomes.
Plenary lecture III: from micro to nano: the development of nanoelectronics and its trend
Authors: Lili He
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

Nanoelectronics is becoming a very important research area in past decades. Certain progresses has made in the practical application more recently which shows an attractive future of wider application. This talk will present a summary review of current development of nanoelectronics. In particular, Monte Carlo simulation of quantum transport in nano-scale transistor, as one of the important research areas of nanoelectronics, will be discussed. Numerical simulations are used to predict the charge transport through a ballistic nano-transistor. Two carrier transport models are primarily used here; the numerical simulation of the ballistic Boltzmann equation and the Non-equilibrium Green's function formalism for quantum transport. The aim of this work is to develop an accurate Monte Carlo based quantum transport simulator that provides a physically rigorous treatment of charge transport and phase breaking inelastic scattering in nano-scaled devices. Further we highlight the role played by high dielectric stacks in such nano-MOSFETs and the dramatic lowering of electron mobility in the channel. In second part of this talk, certain experimental data in the synthesis and characterization of indium selenide (In2Se3) nanowires (NWs), and the fabrication of prototype memory devices using these NWs, will be presented. As most nanoelectronics device is still in its infancy, it is very hard to be clearly predicted which aspects of nanoelectronics currently under research will lead to mature field and eventually to practical applications, and thus impact our daily life as microelectronics has done. This talk will present some most recent experimental data in nanoelectronic device, and computer simulation results in nanoscale device, and eventually an overview of recent path from micro to nano electronics.
Advanced Methods for Target Navigation using Microelectrode Recordings in Stereotactic Neurosurgery for Deep Brain Stimulation
Authors: Petr Gemmar, Oliver Gronz, Thorsten Henrichs, Frank Hertel
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This study describes novel methods for navigating and placing of electrodes into specific structures in the basal ganglia for deep brain stimulation (DBS), as it is common in the treatment of Parkinson's disease. Critical to these procedures in neurosurgery is the localization and identification of different target structures such as subthalamic nucleus (STN) along the electrode's trajectory and finding the best position for the stimulating electrode. Typically, microelectrode recordings (MER) of local neural activity along up to five parallel trajectories are used by neurosurgeons for detecting the target region and creating the anatomic positions of the electrodes by imagination. We developed a method for automatic classification of the MER signals, which provides an electrode model with patient specific borders of the STN. In addition, a method is provided for finding the best matching of the electrode model with a 3D model of the STN. As a result, a 2.5D visualization of the target region is produced with the most probable positions of the electrodes and their intersections.
Secure Communication between Web Browsers and NFC Targets by the Example of an e-Ticketing System
Authors: Gerald Madlmayr, Peter Kleebauer, Josef Langer, Josef Scharinger
Venue: Proceedings of the 9th international conference on E-Commerce and Web Technologies (2008)

Near Field Communication (NFC) is a radio frequency (RF) based proximity coupling technology allowing transactions within a range of up to 10 cm. Using NFC technology for transactions like payment or ticketing in the real world brings a great benefit in terms of time savings, usability and process optimization. Therefore we propose an e-ticketing system making use of this proximity technology especially focusing on security aspects of the system as well as the distribution of the tickets.While other systems rely on ticket distribution via SMS or home-printing a paper ticket, our approach is based on a browser plug-in in combination with a contactless RFID reader at the client side. This installation is used to transfer the e-ticket from a ticket server to the user's PC client and to write the ticket over the proximity interface into the secure element of the NFC target. Thus an NFC target, a contactless smartcard or an NFC enabled mobile phone, can be used as a secure token. With this implementation we are able to bridge the gap between electronic internet transactions and the physical world in a secure way. Also the validation of the ticket at the point-of-access is based on this contactless technology. Our findings provide practical implications to implement web applications using NFC technology successfully.
Bounded Model Checking with Description Logic Reasoning
Authors: Shoham Ben-David, Richard Trefler, Grant Weddell
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the system is unfolded until a given depth, and translated into a CNF formula. A SAT solver is then applied to the CNF formula, to find a satisfying assignment. Such a satisfying assignment, if found, demonstrates an error in the model of the concurrent system.Description Logic (DL) is a family of knowledge representation formalisms, for which reasoning is based on tableaux techniques. We show how Description Logic can serve as a natural setting for representing and solving a BMC problem. We formulate a bounded model checking problem as a consistency problem in the DL dialect $\cal{ALCI}$. Our formulation results in a compact representation of the model, one that is linear in the size of the model description, and does not involve any unfolding of the model. Experimental results, using the DL reasoner FaCT + + , significantly improve on a previous approach that used DL reasoning for model checking.
Ant Colony Optimization Applied to Feature Selection in Fuzzy Classifiers
Authors: Susana M. Vieira, João M. Sousa, Thomas A. Runkler
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In practice, classifiers are often build based on data or heuristic information. The number of potential features is usually large. One of the most important tasks in classification systems is to identify the most relevant features, because less relevant features can be interpreted as noise that reduces the classification accuracy, even for fuzzy classifiers which are somehow robust to noise. This paper proposes an ant colony optimization (ACO) algorithm for the feature selection problem. The goal is to find the set of features that reveals the best classification accuracy for a fuzzy classifier. The performance of the method is compared to other features selection methods based on tree search methods.