A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices. The minimal size of a total dominating set, the total domination number, is denoted by γt. The maximal size of an inclusionwise minimal total dominating set, the upper total domination num...

Direct policy search is a practical way to solve reinforcement learning (RL) problems involving continuous state and action spaces. The goal becomes finding policy parameters that maximize a noisy objective function. The Pegasus method converts this stochastic optimization problem into a deterministic one, by using fixed start states and fixed random number sequences for comparing policies (Ng ...

Paired helical filaments (PHF) is an aberrant structure present in the brain of Alzheimer's disease patients which has been correlated with their degree of dementia. In order to determine the structure of PHF, several studies have been performed using atomic force microscopy (AFM). However, those studies have the limitation that they have not been done in solution and the sample could be far fr...

We study the problem of multimodal dimensionality reduc6 6 tion assuming that data samples can be missing at training time, and 7 7 not all data modalities may be present at application time. Maximum 8 8 covariance analysis, as a generalization of PCA, has many desirable prop9 9 erties, but its application to practical problems is limited by its need for 10 10 perfectly paired data. We overcome...

Spoken Paired Word Pattern Written by Administrator Tuesday, 15 March 2011 09:37 Last Updated Monday, 21 March 2011 07:49 Technologies that recognize short spoken words from a small, predefined vocabulary have been commercially available from many years. In this paper, Spoken Paired Word (SPW) as a whole word template has been explored for utility and suitability in real time system, which has ...

The inflation GI of a graph G with n(G) vertices and m(G) edges is obtained from G by replacing every vertex of degree d of G by a clique Kd. A set S of vertices in a graph G is a paired dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired domination number γp(G) is the minimum cardinality of a paired d...

In this position paper we propose a consistent and unifying view to all those basic knowledge representation models that are based on the existence of two somehow opposite fuzzy concepts. A number of these basic models can be found in fuzzy logic and multi-valued logic literature. Here it is claimed that it is the semantic relationship between two paired concepts what determines the emergence o...

This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scaler data. Instead of comparing every pair of samples (the complete method), a partial method is used that makes more comparisons between closer samples than between more distant samples. A sorting algorithm is used to efficiently order t...