نتایج جستجو برای: caterpillar
تعداد نتایج: 1695 فیلتر نتایج به سال:
With the development of bionic engineering, research into bionic robots has become a popular topic. In this field, the design of robotic mechanisms to realize the locomotion of insects forms a significant research branch. The current paper presents a caterpillar robotic mechanism that is composed of our newly-developed self-assembly modular robots (Sambot). A trapezoidal wave locomotion gait is...
We study the roughening process and morphology transition of organic semiconductor thin film induced by molecular orientation in the model of molecular semiconductor copper hexadecafluorophthalocyanine (F16CuPc) using both experiment and simulation. The growth behaviour of F16CuPc thin film with the thickness, D, on SiO2 substrate takes on two processes divided by a critical thickness: (1) D ≤ ...
A variety of agricultural plant species, including corn, respond to insect herbivore damage by releasing large quantities of volatile compounds and, as a result, become highly attractive to parasitic wasps that attack the herbivores. An elicitor of plant volatiles, N-(17-hydroxylinolenoyl)-L-glutamine, named volicitin and isolated from beet armyworm caterpillars, is a key component in plant rec...
A paper on the subject of grass-grub and subterranean caterpillar control was read at the -1950 Grassland Conference at Invercargill; the work has been continued and the Ashburton Station has issued a pamphlet giving more definite recommendations than in the previous paper. The present paper is confined to control ,of grass-grubs, but the same treatment will automatically kill porina (subterran...
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest number k for which G has a strong k-edge-coloring. A Halin graph is a planar graph consisting of a tree with no vertex of degree tw...
Evaluation of combinations of flower odor compounds in northern Florida revealed that linalool was synergistic in attractiveness with phenylacetaldehyde (PAA) to the migratory moth velvetbean caterpillar ( Anticarsia gemmatalis Hübner). This noctuid was the most common species collected from traps with a binary lure composed of PAA and linalool, with over 900 males and females collected in Sep ...
Thirty-nine commercial varieties of head cabbage were evaluated for feeding preference of the diamondback moth (DBM), Plutella xylostella, at Kula, Hawaii, USA. Varieties were evaluated for density of caterpillars, extent of feeding damage and percentage of marketable heads. Twelve out of 39 (31%) varieties that showed the least DBM caterpillar damage and produced high percentage of marketable ...
We consider the problems of finding a caterpillar tree in a graph. We first prove that, unless P=NP, there is no approximation algorithms for finding a minimum spanning caterpillar in a graph within a factor of f(n); where f(n) is any polynomial time computable function of n, the order of the graph. Then we present a quadratic integer programming formulation for the problem that can be a base f...
A (simple undirected) graph G = (V,E) with m edges is graceful if it has a distinct vertex labeling f : V −→ {0, 1, 2, 3, . . . ,m} which induces a set of distinct edge labels {|f(u)− f(v)| | uv ∈ E, u, v ∈ V }. The famous Ringel-Kotzig conjecture [9, 15] is that all trees are graceful. The base of a tree T is obtained from T by deleting its one-degree vertices. A caterpillar is a tree whose ba...
We characterize two types of bar-visibility graphs on the Mobius band (abbreviated "BVGMs"), in which vertices correspond to intervals that are parallel or orthogonal to the axis of the band, depen ding on type, and in which adjacency corresponds to orthogonal visibility of intervals. BVGMs with intervals orthogonal to the axis are shown to be equivalent to the "polar visibility graphs" studie...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید