Computer Graphics (CG) and Virtual Reality (VR) technologies have rapidly improved in recent years. It enabled us to develop some useful systems such as air hockey, catch ball, tennis and horseback riding for sports field, surgical simulations and support systems for medical field, calligraphy and flower arrangement for educational field. The good training systems have force feedback for users ...

A screen for mutations affecting flower formation was carried out and several filamentous flower (fil) alleles were identified. In fil mutants, floral primordia occasionally give rise to pedicels lacking flowers at their ends. This defect is dramatically enhanced in fil rev double mutants, in which every floral primordium produces a flowerless pedicel. These data suggest that the FIL and REV ge...

We searched for bioactive substances involved in flower bud formation of Arabidopsis thaliana. some significantly decreasing HPLC peaks were detected in the extract of flower buds-forming A. thaliana compared with that of the non-flower bud-forming stage. Compound 1, which corresponded to the most decreased HPLC peak, was isolated from aerial parts of A. thaliana. From NmR and ms data, compound...

This Paper aims at classification of flower images by means of Gist descriptor and statistical features using SVM classifier. With advances in digital image processing, automated classification of flower images over large categories of dataset is possible by knowing the name of the flower. In case of unknown species name, classification of flower image can be performed by its visual content. Th...

We compared microsporogenesis and flower development in Eucalyptus urophylla × E. tereticornis. In this study, although microsporogenesis and cytokinesis occurred simultaneously during meiosis of pollen mother cells, we observed a strong asynchronism in different anthers from a flower bud. The developmental period of microsporogenesis in anthers originated from the long thrum before the short t...

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

With each coassociative coalgebra, we associate an oriented graph. The coproduct ∆, obeying the coassociativity equation (∆ ⊗ id)∆ = (id ⊗ ∆)∆ is then viewed as a physical propagator which can convey information. We notice that such a coproduct is non local. To recover locality we have to break the coassociativity of the coproduct and restore it, in some sense by introducing another coproduct ∆̃...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...