ppxscal/embedding_network huggingface dataset:
Skew Estimation and Segmentation of Text Line in Video Frames
Authors: Chengjun Zhu, Chao Li, Lei Gao, Xiong Zhang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

A method is proposed to segment text from complex background for recognition task. First we estimate the skew of text line and rotate it to the horizontal one. Second, a sampling method based on color edge is proposed to get portion of the text pixels and non-text pixels. Then, k-means algorithm is used to partition the sampled pixels into k clusters. Third, we take the centroid and standard deviation of clusters to segment text image into k binary images. Finally, stroke-filtering is used to select correct one from k binary images. Experiments result shows that the proposed method performs much better than the previous methods.
Implementation Issues of an Incremental and Decremental SVM
Authors: Honorius Gâlmeanu, Răzvan Andonie
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Incremental and decremental processes of training a support vector machine (SVM) resumes to the migration of vectors in and out of the support set along with modifying the associated thresholds. This paper gives an overview of all the boundary conditions implied by vector migration through the incremental / decremental process. The analysis will show that the same procedures, with very slight variations, can be used for both the incremental and decremental learning. The case of vectors with duplicate contribution is also considered. Migration of vectors among sets on decreasing the regularization parameter is given particularly attention. Experimental data show the possibility of modifying this parameter on a large scale, varying it from complete training (overfitting) to a calibrated value.
Run Time Detection of Blocking Time Violations in Real-Time Systems
Authors: Osmar M. dos Santos, Andy Wellings
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

The run-time support mechanism usually deployed for monitoring the timing requirements of real-time systems is based on deadline monitoring, i.e., the system calls specific application code whenever a deadline is violated. However, from a fault-tolerance point-of-view, deadline miss is the final error in a chain of errors that results from some fault in the execution of one or more threads. Recognising this, major real-time programming standards, like Ada, POSIX and the RTSJ, have proposed different mechanisms for monitoring the execution time of threads. Nevertheless, in order to provide a complete fault-tolerance approach against timing errors, the potential blocking time of threads also has to be monitored. In this paper, we propose a mechanism for monitoring the blocking time of threads in the context of both basic priority inheritance and priority ceiling protocols. We also implement and evaluate the mechanism with the definition of blocking-time clocks and timers (extending the POSIX standard), via the modification of the open-source operating system MaRTE OS.
Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
Authors: Reinier Bröker, Denis Charles, Kristin Lauter
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

We present a new method to evaluate large degree isogenies between elliptic curves over finite fields. Previous approaches all have exponential running time in the logarithm of the degree. If the endomorphism ring of the elliptic curve is `small' we can do much better, and we present an algorithm with a running time that is polynomial in the logarithm of the degree. We give several applications of our techniques to pairing based cryptography.
Nonmonotonic Description Logics --- Requirements, Theory, and Implementations
Authors: Piero A. Bonatti
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

The Semantic Web and a number of modern knowledge-based applications have turned ontologies into a familiar and popular ICT notion. Description Logics (DLs) are one of the major formalisms for encoding ontologies.Many "users" of such formalisms --- that is, ontologies writers --- would appreciate DLs to have nonmonotonic features. For example, it would be appealing to describe taxonomies by means of general default properties that may be later overridden in special cases; a similar behavior is supported by all object-oriented languages, after all. However, nonmonotonic extensions of DLs involve many tricky technical problems.This talk will briefly illustrate some of the major requirements for nonmonotonic description logics and some of the formalisms currently available. Then we shall point out the major problems that still have to be solved in order to apply standard tableaux optimization techniques to nonmonotonic DLs. Since DLs are usually at least PSPACE-hard, such optimization techniques are crucial in making these formalisms usable in practice.For example, it seems very difficult to find a tableaux system for a fragment of nonmonotonic DLs where a tableau needs not be stored entirely in memory (because it is enough to construct and verify a single branch at each iteration, for example).Since "traditional" nonmonotonic semantics are not completely satisfactory, it may be possible to solve both semantic shortcomings and optimization problems by adopting suitable new logics.
Analog-digital techniques in autopilot design
Authors: W. T. Hunter, R. L. Johnson
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

The analytical and computer techniques employed in the design of aircraft and missile autopilot systems at Douglas Aircraft Company are presented. Roles assigned to digital and analog computation are discussed with the associated reasons for such assignment. The mutual support provided by both types of computation is stressed. Typical examples are used for illustration.
Co-Annotea: A System for Tagging Relationships Between Multiple Mixed-Media Objects
Authors: Jane Hunter, Ronald Schroeter
Venue: IEEE MultiMedia (2008)

The Co-Annotea system allows users to annotate multiple mixed-media objects and the relationships between them to enable fast and efficient tagging and correlation of large multimedia collections.
An evaluation of analog and digital computers
Authors: G. D. McCann, John L. Barnes, Floyd Steele, Louis Ridenour, A. W. Vance
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

I would like to begin this meeting by first introducing them to you, and I will start with John L. Barnes, on my far right, Associate Director of the Electro-Mechanical Engineering Department, North American Aviation, Inc., Downey, California. Next is Floyd Steel, Vice President in charge of Engineering, Digital Control Systems, La Jolla, California. On my left is Louis Ridenour, Vice President, International Telemeter Corporation, Los Angeles, California. On my far left is Arthur W. Vance, Research Section Head, RCA Laboratory Division, Princeton, New Jersey.
Comparing the Pre- and Post-specified Peer Models for Key Agreement
Authors: Alfred Menezes, Berkant Ustaoglu
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this paper we compare the security assurances provided by the Canetti-Krawczyk security definitions for key agreement in the pre- and post-specified peer models. We give examples of protocols that are secure in one model but insecure in the other. We also enhance the Canetti-Krawczyk security models and definitions to encompass a class of protocols that are executable and secure in both the pre- and post-specified peer models.
Flexible Component Analysis for Sparse, Smooth, Nonnegative Coding or Representation
Authors: Andrzej Cichocki, Anh Huy Phan, Rafal Zdunek, Li-Qing Zhang
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In the paper, we present a new approach to multi-way Blind Source Separation (BSS) and corresponding 3D tensor factorization that has many potential applications in neuroscience and multi-sensory or multidimensional data analysis, and neural sparse coding. We propose to use a set of local cost functions with flexible penalty and regularization terms whose simultaneous or sequential (one by one) minimization via a projected gradient technique leads to simple Hebbian-like local algorithms that work well not only for an over-determined case but also (under some weak conditions) for an under-determined case (i.e., a system which has less sensors than sources). The experimental results confirm the validity and high performance of the developed algorithms, especially with usage of the multi-layer hierarchical approach.
A Customizable Framework to Access and Interconnect Clinical Patient Data and Molecular Biology Information
Authors: Thoralf Töpel
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This work presents a customizable software framework that supports the analysis of correlations between genotype and phenotype within an integrated database in the context of metabolic disorders. The basis for the examination of relations between genotypes and phenotypes is the information from different life science data sources, merged by a mediator-based system in an integrated database. A graphical web interface enables user queries to the integrated data and the trace of connections to corresponding data objects in different information domains. As a result of this work, a web-based prototype of the system is presented. In the context of an example scenario, the framework was used to integrate clinical and molecular biology data for rare metabolic diseases. The framework offers software tools to integrate almost any life science data and to prepare the content for user-specific presentation.
Reachability in Linear Dynamical Systems
Authors: Emmanuel Hainry
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Dynamical systems allow to modelize various phenomena or processes by only describing their local behaviour. It is however useful to understand the behaviour in a more global way. Checking the reachability of a point for example is a fundamental problem. In this document we will show that this problem that is undecidable in the general case is in fact decidable for a natural class of continuous-time dynamical systems: linear systems. For this, we will use results from the algebraic numbers theory such as Gelfond-Schneider's theorem.
A New Self-adaptative Crossover Operator for Real-Coded Evolutionary Algorithms
Authors: Manuel E. Gegúndez, Pablo Palacios, José L. Álvarez
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

In this paper we propose a new self-adaptative crossover operator for real coded evolutionary algorithms. This operator has the capacity to simulate other real-coded crossover operators dynamically and, therefore, it has the capacity to achieve exploration and exploitation dynamically during the evolutionary process according to the best individuals. In other words, the proposed crossover operator may handle the generational diversity of the population in such a way that it may either generate additional population diversity from the current one, allowing exploration to take effect, or use the diversity previously generated to exploit the better solutions.In order to test the performance of this crossover, we have used a set of test functions and have made a comparative study of the proposed crossover against other classic crossover operators. The analysis of the results allows us to affirm that the proposed operator has a very suitable behavior; although, it should be noted that it offers a better behavior applied to complex search spaces than simple ones.
NICAD: Accurate Detection of Near-Miss Intentional Clones Using Flexible Pretty-Printing and Code Normalization
Authors: Chanchal K. Roy, James R. Cordy
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

This paper examines the effectiveness of a new language-specific parser-based but lightweight clone detection approach. Exploiting a novel application of a source transformation system, the method accurately finds near-miss clones using an efficient text line comparison technique. The transformation system assists the methodin three ways. First, using agile parsing it provides user-specified flexible pretty-printing to remove noise, standardize formatting and break program statements into parts such that potential changes can be detected as simple linewise text differences. Second, it provides efficient flexible extraction of potential clones to be compared using island grammars and agile parsing to select granularities and enumerate potential clones. Third, using transformation rules it provides flexible code normalization to allow for local editing differences between similar code segments and filtering out of uninteresting parts of potential clones. In this paper we introduce the theory and practice of the framework and demonstrate its use in finding function clones in C code. Early experiments indicate that the method is capable of finding near-miss clones with high precision and recall, and with reasonable performance.
Inferring Regulatory Networks from Time Series Expression Data and Relational Data Via Inductive Logic Programming
Authors: Irene M. Ong, Scott E. Topper, David Page, Vítor Santos Costa
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Determining the underlying regulatory mechanism of genetic networks is one of the central challenges of computational biology. Numerous methods have been developed and applied to the important but complex task of reverse engineering regulatory networks from high-throughput gene expression data. However, many challenges remain. In this paper, we are interested in learning rules that will reveal the causal genes for the expression variation from various relational data sources in addition to gene expression data. Following our previous work where we showed that time series gene expression data could potentially uncover causal effects, we describe an application of an inductive logic programming (ILP) system, to the task of identifying important regulatory relationships from discretized time series gene expression data, protein-protein interaction, protein phosphorylation and transcription factor data about the organism. Specifically, we learn rules for predicting gene expression levels at the next time step based on the available relational data and then generalize the learned theory to visualize a pruned network of important interactions. We evaluate and present experimental results on microarray experiments from Gasch et al on Saccharomyces cerevisiae.
Analysis and comparison of aircraft landing control using recurrent neural networks and genetic algorithms approaches
Authors: Jih-Gau Juang, Hou-Kai Chiou, Li-Hsiang Chien
Venue: Neurocomputing (2008)

This paper presents an intelligent aircraft automatic landing controller that uses recurrent neural networks (RNN) with genetic algorithms (GAs) to improve the performance of conventional automatic landing system (ALS) and guide the aircraft to a safe landing. Real-time recurrent learning (RTRL) is applied to train the RNN that uses gradient-descent of the error function with respect to the weights to perform the weights updates. Convergence analysis of system error is provided. The control scheme utilizes five crossover methods of GAs to search optimal control parameters. Simulations show that the proposed intelligent controller has better performance than the conventional controller.
A Bayesian Approach for Liver Analysis: Algorithm and Validation Study
Authors: Moti Freiman, Ofer Eliassaf, Yoav Taieb, Leo Joskowicz, Jacob Sosna
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We present a new method for the simultaneous, nearly automatic segmentation of liver contours, vessels, and metastatic lesions from abdominal CTA scans. The method repeatedly applies multi-resolution, multi-class smoothed Bayesian classification followed by morphological adjustment and active contours refinement. It uses multi-class and voxel neighborhood information to compute an accurate intensity distribution function for each class. The method requires only one or two user-defined voxel seeds, with no manual adjustment of internal parameters. A retrospective study on two validated clinical datasets totaling 56 CTAs was performed. We obtained correlations of 0.98 and 0.99 with a manual ground truth liver volume estimation for the first and second databases, and a total score of 67.87 for the second database. These results suggest that our method is accurate, efficient, and robust to seed selection compared to manually generated ground truth segmentation and to other semi-automatic segmentation methods.
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
Authors: Thomas Colcombet, Christof Löding
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

In this paper we lift the result of Hashiguchi of decidability of the restricted star-height problem for words to the level of finite trees. Formally, we show that it is decidable, given a regular tree language L and a natural number k whether L can be described by a disjunctive μ-calculus formula with at most k nesting of fixpoints. We show the same result for disjunctive μ-formulas allowing substitution. The latter result is equivalent to deciding if the language is definable by a regular expression with nesting depth at most k of Kleene-stars.The proof, following the approach of Kirsten in the word case, goes by reduction to the decidability of the limitedness problem for non-deterministic nested distance desert automata over trees. We solve this problem in the more general framework of alternating tree automata.
Experimental Studies on the Interaction of Jets with the Vortex Wake of Slender Bodies
Authors: K. Kontis
Venue: Journal of Visualization (2005)

An experimental study has been conducted to examine the low-speed aerodynamic characteristics of a pair of circular jets behaviour in the vortex-wake of a blunted cone cylinder-body combination with and without a 70&deg; leading edge sweep delta wing. The induced flow-field was examined via two-dimensional hot-wire anemometry surveys. Comparisons were made between the induced wake with and without the circular jets. The flow field over the models was visualized using smoke and oil flow visualization. The jet-pair was found to undergo severe distortion within a very short distance from the nozzle exits. The shape of the jets was shown to change considerably when placed in the vortex wake flow field of the models, which caused the jet-pair to spread and become entrained within the vortices and wake created by the models.
QoS Route Discovery of Ad Hoc Networks Based on Intelligence Computing
Authors: Cong Jin, Shu-Wei Jin
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Focusing on the disadvantageous factors of dynamic environment and node's limited performances of Ad Hoc networks (AHN), a new quality of service (QoS) route discovery method, namely QGAANT, based on quantum genetic algorithm (QGA) and ant colony algorithm (ACA) was presented. Using the route switching policy based on probability, we can reduce network overhead caused by flooding. In this paper, QGA was used to adjust the search direction so as to avoid the problem of stagnancy routes. The simulations were carried out to compare the QGAANT, the algorithm based on ant colony only and the traditional on-demand routing algorithm each other. The simulations results show that QGAANT is more adaptable AHN.
Probabilistic Motion Switch Tracking Method Based on Mean Shift and Double Model Filters
Authors: Risheng Han, Zhongliang Jing, Gang Xiao
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Mean shift tracking fails when the velocity of target is so large that the target's window kernel in the previous frame can not cover the target in the current frame. Combination of mean shift and single Kalman filter also fails when the target's velocity changed suddenly. To deal with the problem of tracking image target that has large and changing velocity, an efficient image tracking method integrated mean shift and double model filters is proposed. Two motion models can switch each other by using a probabilistic likelihood. Experiment results show the method integrated mean shift and double model filters can successfully keep tracking target, no matter the target's velocity is large or small, changing or constant, with modest requirement of computation resource.
User centric media in the future internet: trends and challenges
Authors: Oscar Mayora, Petros Daras, Marianna Panebarco, Nick Achilleopoulos, Peter Stollenmayer, Doug Williams, Nadia Magnenat-Thalmann, Carmen Guerrero, Michiel Pelt, Tim McGrath, Eugenia Fuenmayor, David Salama, Federico Alvarez, Elias Kalapanidas, Alex Shani, Jean-Yves Le Moine
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The evolution of the Internet is being leaded by two main threads, one driven by industry through the evolution of networking infrastructures and the other driven by producers of content either in a professional or non professional way. Moreover, due to the explosion of the World Wide Web (which has started as a document repository) and its successful descendants (Semantic Web and Web 2.0), along with the dramatic increase of net-based audiovisual material (networked media) that has been produced by professional and amateur users, Internet is rapidly transforming to a full fledged virtual environment that facilitates services, interaction and communication. Therefore the vision that the Future Internet will be an Internet of Media centered in the user as content consumer and creator is starting now to be a reality. In this context, a series of new technical and social Challenges are emerging in order to enable this vision to thoroughly become true. In this paper, we present some of these Challenges and trends as a result of previous discussions within the User Centric Media Cluster of EU projects on Networked Media.