The main objective of this paper consists of the state look-ahead path and the counting path. The proposed counter is a single mode counter, which sequences through a fixed set of pre assigned count states, of which each next count state represents the next counter value in sequence. The counter is partitioned into uniform 2-bit synchronous up counting modules. Next state transitions in countin...

How to help learners plan a navigation path on the Web is an important issue in web-based learning/education. Our approach to this issue is to allow the learners to preview a sequence of web pages as navigation path plan. In this paper, we introduce an assistant system that enables learners to plan the navigation path in a self-directed way before navigating hyperspace provided by web-based lea...

This paper describes a framework for constructing network services for accessing media objects. The framework, called end-to-end media paths, provides a new approach for building multimedia applications from component pieces. Based on input from the user and resource requirements from the media object, the system first discovers the sequence of nodes (end-to-end path) that both connect the sour...

In this study we investigate the problem of generating a smooth, planar reference path, given a family of discrete optimal paths. In conjunction with a path representation by a finite sequence of square cells, the generated path is supposed to stay inside a feasible channel, while minimizing certain performance criteria. Constrained optimization problems are formulated subject to geometric (lin...

Accurate knowledge point sequences and clear learning paths are the compass for learners to travel in sea of massive knowledge, they can out way improve their experience. Generating based on reasoning is conductive optimizing allocation educational resources improving quality higher education, this has a profound influence reform entire field. In view this, study explored generation recommendat...

Abstract— Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There are no. of scheduling algorithms such as HEFT [1] use mean execution time based b-level for task priority and SHCP [2] use task priority based on simple critical path...

It was the problem of finding the minimum value of the sum of the distances of the path through all cities Overview TSP. We propose an authentication with the problem that the deformation sum of the distances of the path to be a constant value. In this document, it is intended to construct an authentication function robust implementation is easy and the Blog. After it was shown that the first, ...

Biped robots have specific dynamical constraints and stability problems which reduce significantly their motion range. In these conditions, motion planning used for mobile robots cannot be applied to biped robots. In this paper, the path planning problem is seen as finding a sequence of footholds in a 3D environment, keeping robot stability, motion continuity and working within the structural c...