ppxscal/embedding_network huggingface dataset:
The Recognition Graph - Language Independent Adaptable On-line Cursive Script Recognition
Authors: Jakob Sternby, Christer Friberg
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

One of the difficulties involved in providing commercially acceptable cursive script recognition solutions has been that the training of most systems have been greatly dependent upon dictionaries. In this paper we present a new technique for dictionary interaction in on-line cursive script recognition. It retrieves all possible paths through a segmentation graph, that correspond to words in a dictionary, in a very efficient way. Furthermore we present new ideas of how to treat secondary strokes in the on-line segmentation graph. The novel system has been tested on large data with very competitive results.
Current status and challenges of ferroelectric memory devices
Authors: H. Kohlstedt, Y. Mustafa, A. Gerber, A. Petraru, M. Fitsilis, R. Meyer, U. Böttger, R. Waser
Venue: Microelectronic Engineering (2005)

article-67-abstract
Dynamic Configuration of Semantic-Based Service Provisioning to Portable Devices
Authors: Antonio Corradi, Rebecca Montanari, Alessandra Toninelli
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Context-awareness is starting to emerge as a key driving principle for the design and provisioning of pervasive services in pervasive computing environments. Semantic languages seem to provide effective means to express, process and reason about context information and to facilitate knowledge sharing and interoperability among previously unknown entities. However, the exploitation of semantic languages for the design and deployment of context-aware applications requires to address several issues. In particular, semantic languages require complex and heavyweight support facilities, e.g., reasoning engines, ontology repositories and knowledge management tools, that may not fit the capabilities of portable devices, especially of resource-limited ones. Novel middleware-level solutions are required to transparently and dynamically adapt semantic-based service provisioning to the properties of different access devices. The paper proposes a novel middleware that exploits the visibility of two kinds of metadata, user/device/service profiles and policies, to tailor the configuration of the semantic support functionalities needed to access semantic-based services, and that offers a wide set of mechanisms for making viable semantic-based service provisioning to resource-constrained portable devices.
Distributed implementation of a self-organizing appliance middleware
Authors: Michael Hellenschmidt
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

A middleware for real ad-hoc cooperation of distributed device ensembles must support self-organization of its components. Self-organization means that the independence of the ensembles' components is ensured, that the ensemble is dynamically extensible by new components and that real distributed implementation is possible. Furthermore the data-flow of messages within the ensemble may not be statically determined. This article presents the distributed implementation of the SodaPop model for distributed device ensembles of physical heterogeneous devices as well as the distributed handling of conflict resolution strategies that guarantee the data-flow even if there are competing components. The proposed approach relies on the principle of device representatives. Here physical devices host their components and disburden them from communication and service composition strategies.
A unified fitness function calculation rule for flag conditions to improve evolutionary testing
Authors: Xiyang Liu, Hehui Liu, Bin Wang, Ping Chen, Xiyao Cai
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Evolutionary testing (ET), automatically generating test data with good quality, is an effective technique based on evolutionary algorithm. However, the presence of flag variables will make it degenerate to random testing in structural testing. Much of previous work has addressed this problem, but all can be characterized as program-specific. In this paper, flag cost function is introduced as the main component of fitness function, whose value changes with the variation of flag problem. Based on this, a unified fitness calculation rule for flag conditions is proposed. The experiments on programs with flag problems, once considered as inextricable in previous work, and the Traffic Alert and Collision Avoidance System (TCAS) code showed the effectiveness of our unified approach.
Feature Selection for Clustering Problems: a Hybrid Algorithm that Iterates Between k-means and a Bayesian Filter
Authors: Eduardo R. Hruschka, Thiago F. Covoes, Estevam R. Jr. Hruschka, Nelson F. F. Ebecken
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

There are two fundamentally different approaches for feature selection: wrapper and filter. It is also possible to combine them, obtaining hybrid approaches. This paper describes a hybrid method for selecting relevant features in clustering problems. The proposed approach is based on the combination of the widely known k-means algorithm and a Bayesian filter, which is based on the Markov Blanket concept. Since the number of clusters and the subset of relevant features are usually inter-related, we propose a method that iterates between clustering (assuming that the number of clusters is not known a priori) and filtering. Experiments in a number of datasets show that the proposed approach allows selecting features that provide good partitions.
Ontology Urbanization for Semantic Integration: Dealing with Semantics within Large and Dynamic Enterprises
Authors: Said Izza, Lucien Vincent, Patrick Burlat
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

Nowadays, Enterprise Application Integration (EAI) constitutes a real and growing need for most of enterprises, especially for large and dynamic enterprises of heterogeneous, autonomous and distributed information systems. Actually, the major problem of EAI is the heterogeneity problem, especially the semantic integration one. This latter is not correctly addressed by today's solutions, which focus mainly on technical and syntactical integration. Dealing with the semantic aspect, which will certainly promote EAI by providing it more consistency and robustness, needs some appropriate principles such as the knowledge or ontology urbanization. This latter constitutes the main focus of this paper. It aims to favour the semantic application integration, precisely by providing it more appropriate knowledge structuring that can help any enterprise to correctly capture, structure and master its semantics, which constitutes a big challenge for several enterprises that are in quest of more flexibility and manageability.
A model of goal-directed spatial navigation based on rodent neurophysiological data
Authors: Anatoly Gorshechnikov
Venue:  (2005)

This dissertation presents a biophysical model that combines evidence from neurophysiological studies of goal-directed spatial navigation in the rat into a single algorithm based on bidirectional graph search. Application of this algorithm allows the model to simulate behavioral and neurophysiological data from rats performing memory-dependent spatial tasks. The behavioral component is represented as a virtual animal in a virtual environment. The neurophysiological component is represented as a network of simulated neurons, which receives sensory input from the environment and directs the movement of the animal. The binding of the physiology and behavior in the model allows several experimental phenomena to be addressed, such as (1) activities of the principal cells in the hippocampal area are correlated with an animal's position in space; (2) this positional information degrades after a lesion that disconnects the hippocampus from the medial septum; (3) after lesions of the medial septum, reduction of hippocampal theta rhythm is correlated with an impairment in spatial tasks; (4) cells in the hippocampus tend to fire at a preferred phase of the theta cycle, and (5) the arrival of different inputs to the hippocampus corresponds to specific phases of the theta cycle. The model shows how these physiological properties allow such behavioral functions as successful navigation through various mazes towards a desired goal, selection of a goal on the basis of distance and salience, and reshaping its knowledge about the environment. The latter is based on a thoroughly analyzed spatially and temporally local spike-timing-dependent synaptic modification rule. Four types of gated learning are compared in the context of simulated behavior. Presynaptic and dual OR (triggered by either presynaptic or postsynaptic activity) gatings are more noise tolerant and produce experience-dependent changes in place cell firing patterns shown experimentally. Postsynaptic gating leads to a better competition between input patterns. Dual AND gating (based on the simultaneous presence of both presynaptic and postsynaptic activity) leads to stabilization of the network activity. Each of these gatings can be used to subserve different aspects of the exploratory behavior. The proposed model can be further extended to more general problem-solving based on classical graph search.
Simulation documents available from NTIS
Authors: Tuncer I. Ören
Venue: ACM SIGSIM Simulation Digest (1975)

What is NTIS: The NTIS (National Technical Information Service) of the U.S. Department of Commerce is a central source for the public sale of (i) Government-sponsored research and development reports, (ii) Government analyses prepared by Federal agencies, their contractors or grantees, (iii) Federally sponsored translations, and (iv) some reports written in foreign languages. The NTIS reports exist in paper copy (PC) or in micro-riche (MF) and are available indefinitely. NTIS ships about 12000 documents daily.
Incremental gradient descent imputation method for missing data in learning classifier systems
Authors: Daqian Gu, Yang Gao
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Learning with incomplete or missing data has been a major challenge in learning classifier system. One method for covering missing data is imputing missing values based on the statistic of known values. Another is marking them matching arbitrary case. A new approach using incremental gradient descent imputation model is proposed in this paper, which use the relationship among variables to estimate the missing value. And, some experiments are conducted in order to compare the performance of new approach and other classical covering methods.
An Area-Efficient High-Speed AES S-Box Method
Authors: Richard Hobson, Scott Wakelin
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

The Advanced Encryption Standard makes repeated use of a performance limiting randomization step, SubBytes, which invokes an S-Box logic function to scramble 8 data inputs. This paper introduces a new method for implementing S-Box (and a variant, called T-Box) logic functions. The method is as fast as previous methods, but uses only one quarter of the gates of other fast methods. In addition, the method can produce a differential output which helps to speed up downstream exclusive-Or logic.
A Convergence Proof for the Population Based Incremental Learning Algorithm
Authors: R. Rastegar, A. Hariri, M. Mazoochi
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Here we propose a convergence proof for the population based incremental learning (PBIL). In our approach, first, we model the PBIL by the Markov process and approximate its behavior using Ordinary Differential Equation (ODE). Then we prove that the corresponding ODE doesn't have any stable stationary points in [0,1]n, n is the number of variables, except the local maxima of the function to be optimized. Finally we show that this ODE and consequently the PBIL converge to one of these stable attractors.
A benchmark for the sorting network problem
Authors: Michal Bidlo
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Consider a compare-swap operation that compares and possibly swaps the values of its two operands (a, b), so that we obtain a pair (a, b) satisfying a &le; b after execution. A sorting network is a sequence of compare-swap operations that depends only on the number of elements to be sorted [1]. Let's call the compare-swap operation as a comparator. An advantage of sorting networks against the classical sorting algorithms is that the number of comparators is fixed for a given number of inputs. Thus they can be easily implemented in hardware. Figure 1 shows an example of a three-input sorting network and its alternative symbol.
Using unsupervised learning of a finite Dirichlet mixture model to improve pattern recognition applications
Authors: Nizar Bouguila, Djemel Ziou
Venue: Pattern Recognition Letters (2005)

Mixture modeling is the problem of identifying and modeling components in a given set of data. Gaussians are widely used in mixture modeling. At the same time, other models such as Dirichlet distributions have not received attention. In this paper, we present an unsupervised algorithm for learning a finite Dirichlet mixture model. The proposed approach for estimating the parameters of a Dirichlet mixture is based on the maximum likelihood (ML) expressed in a Riemannian space. Experimental results are presented for the following applications: summarization of texture image databases for efficient retrieval, and human skin color modeling and its application to skin detection in multimedia databases.
An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites
Authors: Henry C. M. Leung, Francis Y. L. Chin
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Finding common patterns, or motifs, from a set of DNA sequences is an important problem in molecular biology. Most motif-discovering algorithms/software require the length of the motif as input. Motivated by the fact that the motif's length is usually unknown in practice, Styczynski et al. introduced the Extended (l, d)-Motif Problem (EMP), where the motif's length is not an input parameter. Unfortunately, the algorithm given by Styczynski et al. to solve EMP can take an unacceptably long time to run, e.g. over 3 months to discover a length-14 motif. This paper makes two main contributions. First, we eliminate another input parameter from EMP: the minimum number of binding sites in the DNA sequences. Fewer input parameters not only reduces the burden of the user, but also may give more realistic/robust results since restrictions on length or on the number of binding sites make little sense when the best motif may not be the longest nor have the largest number of binding sites. Second, we develop an efficient algorithm to solve our redefined problem. The algorithm is also a fast solution for EMP (without any sacrifice to accuracy) making EMP practical.
A Statistics-Based Sensor Selection Scheme for Continuous Probabilistic Queries in Sensor Networks
Authors: Song Han, Edward Chan, Reynold Cheng, Kam-Yiu Lam
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

An approach to improve the reliability of query results based on error-prone sensors is to use redundant sensors. However, this approach is expensive; moreover, some sensors may malfunction and their readings need to be discarded. In this paper, we propose a statistical approach to decide which sensors to be used to answer a query. In particular, we propose to solve the problem with the aid of continuous probabilistic query (CPQ), which is originally used to manage uncertain data and is associated with a probabilistic guarantee on the query result. Based on the historical data values from the sensors, the query type, and the requirement on the query, we present methods to select an appropriate set of sensors and provide reliable answers for aggregate queries. Our algorithm is demonstrated in simulation experiments to provide accurate and robust query results.
Context-aware Multimedia Provisioning for Pervasive Games
Authors: David Linner, Fabian Kirsch, Ilja Radusch, Stephan Steglich
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Pervasive Gaming, mobile gaming applications interweaved into the real world, is an emerging field for context-aware multimedia applications. Mobile multimedia applications are fostered by the improvement of hardware technology and the emergence of new devices with sufficient networking and processing capabilities. However, these extending possibilities also increase the complexity of software development due to the distributed mobile environment. This paper presents a framework enabling rapid development and easy deployment of scalable, contextaware multimedia applications for mobile environments. Subsequently, the development of "Cron", a Pervasive Game operating in the city area of Berlin, Germany, is introduced to prove the framework concept and demonstrate its features as well as potential for further research.
ConstrainedMotif: A Periodicity Constraint Based Algorithm to Predict Cell-Cycle Associated Promoter Motifs Using Time-Course Gene Expression Data
Authors: Yingren Liu, Karuturi R. Krishna Murthy, Wing-Kin Sung
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Motivation: Cell-cycle associated promoter motif prediction is very important to understand the cell-cycle control and process. Modeling genome-wide gene expression as a function of the promoter sequence motif features has drawn great attention recently. The proposed techniques using this approach are not specific to cell-cycle associated motif discovery, hence find aperiodic motif weights across the time-course and lower sensitivity. Motifs are scored based on the successive model error reduction steps which may not reveal all relevant motifs since they are alternatives for the model. Another, drawback is, these methods output a list of sequences which may either contain several instances of a dominating motif box (a set of alternative sequence motifs) such as MCB or only a few instances of an important box. Results: To address the above problems, we propose a multi-step constrained optimization based position weight matrix (PWM) motif finding methodology called ConstrainedMotif. It models the cell-cycle regulated gene expression as a linear function of the motif features while the weights of them are constrained to be periodic across the time-course. The score of a motif is the error reduction in the prediction by that motif alone. The multi-step modeling starts with a set of sequences and output a ranked list of cell-cycle associated PWM motifs. We evaluate this methodology using S. Cerevesiae cell-cycle data published by Spellman et al. The results show that ConstrainedMotif is more sensitive and most of the instances of the boxes are represented by the respective matching PWMs. Software: giscompute.gis.nus.edu.sg/~karu/cdcAnal/motif
Effects of low temperature annealing on the ultrathin La2O3 gate dielectric; comparison of post deposition annealing and post metallization annealing
Authors: J. A. Ng, Y. Kuroki, N. Sugii, K. Kakushima, S.-I. Ohmi, K. Tsutsui, T. Hattori, H. Iwai, H. Wong
Venue: Microelectronic Engineering (2005)

This work reports the effects of low-temperature post-deposition annealing (PDA) and post-metallization annealing (PMA) on the electrical properties of ultrathin (with EOT ranging from 1.29 nm to 2.33 nm) La2O3 gate dielectric films. We found that positive charges were generated during the PDA as evidenced by the negative flat-band voltage (VFB) shift. Forming of La-silicate interface layer and a reduction in the channel mobility are found for the PDA samples at temperature higher than 300°C. Better electrical characteristics were achieved by the PMA. The PMA sample has a peak channel mobility of 319 cm2/Vs.
Parameter-Free Spatial Data Mining Using MDL
Authors: Spiros Papadimitriou, Aristides Gionis, Panayiotis Tsaparas, Risto A. Vaisanen, Heikki Mannila, Christos Faloutsos
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatial correlation and feature co-occurrence patterns, without any parameters. In particular, we employ the Minimum Description Length (MDL) principle coupled with a natural way of compressing regions. This defines what "good" means: a feature co-occurrence pattern is good, if it helps us better compress the set of locations for these features. Conversely, a spatial correlation is good, if it helps us better compress the set of features in the corresponding region. Our approach is scalable for large datasets (both number of locations and of features). We evaluate our method on both real and synthetic datasets.
Performance Comparison of TCP Traffic over Mobile IPv4 and IPv6 Networks and a Mobile Network Deployment Approach
Authors: Sujeong Chang, Jaehyung Park, Yonggwan Won, Mijeong Yang, Min Young Chung
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In order to help ISPs to deploy a mobile IP network into current internet environment with satisfying users' mobility requirements, this paper evaluates and compares the performance of MIPv4 and MIPv6 networks. This paper shows that TCP performance in MIPv6 network outperforms that of MIPv4 network in terms of amount of dropped packets and lasting the connection with mobile node and corresponding node. And so, in this paper, we design a simple deployment approach which all mobile node operates in MIPv6 networks under fixed IPv4 network environments.
Relations Between Quantum Maps and Quantum States
Authors: M. Asorey, A. Kossakowski, G. Marmo, E. C. Sudarshan
Venue: Open Systems Information Dynamics (2005)

The relation between completely positive maps and compound states is investigated in terms of the notion of quantum conditional probability.
Embedded Sensing of Structures: A Reality Check
Authors: Krishna Chintalapudi, Jeongyeup Paek, Nupur Kothari, Sumit Rangwala, Ramesh Govindan, Erik Johnson
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

With the advent of miniaturized sensing technology, it has become possible to envision smart structures containing millions of sensors embedded in concrete for autonomously detecting and locating incipient damage. Where are we today in our march towards this vision of autonomous structural health monitoring (SHM) using networked embedded sensing? In this paper, we summarize some of the systems we have developed towards this vision. Wisden is a wireless sensor network that allows continuous monitoring of structures and NetSHM is a programmable system that allows civil engineers to implement and deploy SHM techniques without having to understand the intricacies of wireless sensor networking. We highlight our experiences in developing these systems, and discuss the implications of our experiences on the achievability of the overall vision.