نتایج جستجو برای: effector is planned toward its goal position using generalized visibility graph

تعداد نتایج: 9273030  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده ریاضی 1390

abstract: in the paper of black and scholes (1973) a closed form solution for the price of a european option is derived . as extension to the black and scholes model with constant volatility, option pricing model with time varying volatility have been suggested within the frame work of generalized autoregressive conditional heteroskedasticity (garch) . these processes can explain a number of em...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز - دانشکده علوم طبیعی 1391

in recent years many researchers have been focused on interaction of small molecules with dna. dna is generally the primary intracellular of anticancer drugs, so the interaction between small molecules and dna can cause dna damage in cancer cells, blocking the division of cancer cells and resulting in cell death. the flavonoids are a large group of polyphenolic natural products that are widely ...

2004
M. Benosman G. Le Vey L. Lanari

In this work is considered the problem of rest-to-rest motion in a desired pre-fixed time for planar flexible manipulators. We introduce a simple idea permitting the minimization of end-effector residual vibration when reaching a desired angular equilibrium position, in a pre-fixed desired travelling time. The results hold without considering internal elastic damping effect, using a classical c...

Kailash Lachhwani Suresh Nehra

In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...

Journal: :Discrete & Computational Geometry 1995
James Abello Ömer Egecioglu Krishna Kumar

The recognition problem for visibility graphs of simple polygons is not known to be in NP, nor is it known to be NP-hard. It is, however, known to be in PSPACE. Further, every such visibility graph can be dismantled as a sequence of visibility graphs of convex fans. Any nondegenerate configuration of n points can be associated with a maximal chain in the weak Bruhat order of the symmetric group...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم انسانی 1389

abstract this study examines the relationship between reading anxiety and difficulty of texts as well as the relationship between reading anxiety and students perceived difficulty of the texts. since difficulty is a relative concept, i limited its definition by sticking to the readability formula. we also took students perceived difficulty levels into account. therefore, in the present study, ...

2011
Yann Disser

This thesis is concerned with simple agents that move from vertex to vertex along straight lines inside a simple polygon with the goal of reconstructing the visibility graph. The visibility graph has a node for each vertex of the polygon with an edge between two nodes if the corresponding vertices see each other, i.e., if they can be connected by a straight line inside the polygon. While at a v...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سیستان و بلوچستان 1390

seismic retrofit strategies have been developed in the past few decades following the introduction of new seismic provisions and the availability of advanced materials and methods. it can be observed that new approaches to deal with more lateral forces are more innovative and more energy absorbent. in line with this, there is a growing trend toward the use of steel shear walls as a system with ...

Journal: :international journal of industrial mathematics 2015
s. z. aghamohammadi‎

‎the narumi-katayama index was the first topological index defined‎ ‎by the product of some graph theoretical quantities‎. ‎let $g$ be a ‎simple graph with vertex set $v = {v_1,ldots‎, ‎v_n }$ and $d(v)$ be‎ ‎the degree of vertex $v$ in the graph $g$‎. ‎the narumi-katayama ‎index is defined as $nk(g) = prod_{vin v}d(v)$‎. ‎in this paper,‎ ‎the narumi-katayama index is generalized using a $n$-ve...

Journal: :Int. J. Comput. Geometry Appl. 2000
David Bremner Thomas C. Shermer

A visibility relation can be viewed as a graph: the uncountable graph of a visibility relationship between points in a polygon P is called the point visibility graph (PVG) of P. In this paper we explore the use of perfect graphs to characterize tractable subprob-lems of visibility problems. Our main result is a characterization of which polygons are guaranteed to have weakly triangulated PVGs, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید