the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ ...

internationally, employability has recently become an increasingly controversial issue in higher education. the emergence of knowledge-based economies, accompanied by the by-products of globalization, has forced agricultural higher education systems all around the world to think twice about the quantity and quality of their courses. on one hand, there has been a surplus of highly educated gradu...

In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on di...

Let G be a graph with the usual shortest-path metric. A graph is δ-hyperbolic if for every geodesic triangle T , any side of T is contained in a δ-neighborhood of the union of the other two sides. A graph is chordal if every induced cycle has at most three edges. In this paper we study the relation between the hyperbolicity of the graph and some chordality properties which are natural generaliz...

Recently, path tracing has gained interest for real-time global illumination since it allows to simulate an unbiased result of the rendering equation. However, path tracing is still too slow for real-time applications and shows noise when displayed at interactive frame rates. The radiance of a pixel is computed by tracing a path, starting from the eye and connecting each point on the path with ...

With the program HistCiteTM it is possible to generate and visualize the most relevant papers in a set of documents retrieved from the Science Citation Index. Historical reconstructions of scientific developments can be represented chronologically as developments in networks of citation relations extracted from scientific literature. This study aims to go beyond the historical reconstruction of...

Rendering of photo-realistic images at interactive frame rates is currently an extensively researched area of computer graphics. Many of these approaches attempt to utilize the computational power of modern graphics hardware for ray tracing based methods. When using path tracing algorithms the ray paths are highly incoherent, hence we propose an efficient technique that minimizes the divergence...