in present paper, a point to point optimal path is planned for a mobile manipulator with flexible links and joints. for this purpose, a perfect dynamic modeling is performed for mobile manipulators considering large deformation in links, shear effects, elastic joints, effect of gravitation, and non-holonomic constraints. to study large deformation of links, non-linear relation of displacement-s...

The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that the weight (e.g., travel-time) of each edge in the spatial network is constant. However, in real-world, edge-weights are timedependent and vary significantly in short durations, hence invalidating the existing solutio...

This paper describes the use of XML in three generic interacting speech technology systems. The first, a phonological syllable recognition system, generates feature-based finite-state automaton representations of phonotactic constraints in XML. It employs axioms of event logic to interpret multilinear representations of speech utterances and outputs candidate syllables to the second system, an ...

Association rule mining perhaps the most widely described technique among the minding paradigms. The temporal association rule mining in the association rule mining tries to find relations among items in datasets. The temporal association mining has strength in detecting the dynamic nature of databases. Unfortunately the current mining methods ignore the consideration of database content update...

Warehouse Database is a multidimensional model generally implemented in relational databases that contains a data repository. This data repository integrates valuable information from multiple data sources. This paper presents a procedure to generate the Dimension, Variable, and Relative dimension (DVR) of multidimensional cubes used in the Multidimensional On-Line Analytical Processing (MOLAP)...

This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an integration of two techniques: a correlogram matrix based technique to generate all the frequent 1and 2-itemset in a single scan over the database and a technique that uses vertical layout concept to generate the rest...

Shortest Path Problem where the time/cost have vague value is one of the most studied problems in Fuzzy sets and systems area. Thus numerous articles have focused on the Fuzzy Shortest Path Problem (FSPP) in a network. This paper, presents the fuzzy shortest length heuristic procedure if the length of the path in the network is trapezoidal fuzzy set where the highest similarity degree is utiliz...

A novel procedure is described for accelerating the convergence of Markov chain Monte Carlo computations. The algorithm uses an adaptive bootstrap technique to generate candidate steps in the Markov Chain. It is efficient for symmetric, convex probability distributions, similar to multivariate Gaussians, and it can be used for Bayesian estimation or for obtaining maximum likelihood solutions wi...

In Eurocrypt 2005, Wang et al. presented a collision attak on MD5. In their paper, they intoduced “Sufficient Condition” which would be needed to generate collisions. In this paper, we explain how to construct sufficent conditions of MD5 when a differential path is given. By applying our algorithm to a collision path given by Wang et al, we found that sufficient conditions introduced by them co...

The Relevance Vector Machine (RVM) is a recently developed machine learning framework capable of building simple models from large sets of candidate features. Here, we describe a protocol for using the RVM to explore very large numbers of candidate features, and a family of models which apply the power of the RVM to classifying and detecting interesting points and regions in biological sequence...