نتایج جستجو برای: leap graphs

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

Journal: :The Journal of chemical physics 2012
David Orendorff Eric Mjolsness

A new algorithm, "HiER-leap" (hierarchical exact reaction-leaping), is derived which improves on the computational properties of the ER-leap algorithm for exact accelerated simulation of stochastic chemical kinetics. Unlike ER-leap, HiER-leap utilizes a hierarchical or divide-and-conquer organization of reaction channels into tightly coupled "blocks" and is thereby able to speed up systems with...

Journal: :iranian journal of mathematical chemistry 2012
h. r. mostafaei a. zaeembashi m. ostad rahimi

a graph that contains a hamiltonian cycle is called a hamiltonian graph. in this paper wecompute the first and the second geometric – arithmetic indices of hamiltonian graphs. thenwe apply our results to obtain some bounds for fullerene.

Journal: :iranian journal of mathematical chemistry 0
b basavanagoud karnatak university dharwad s. patil karnatak university v r desai karnatak university m tavakoli ferdowsi university of mashhad a r ashrafi university of kashan

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

Journal: :Veterinary immunology and immunopathology 2004
Yong-An Zhang Jun Zou Chin-I Chang Christopher J Secombes

The sequences and gene organisation of two LEAP-2 molecules (LEAP-2A and LEAP-2B) from rainbow trout, Oncorhynchus mykiss are presented. Both genes consist of a 3 exon/2 intron structure, with exon sizes comparable to known mammalian genes. LEAP-2A notably differs from LEAP-2B in having larger introns and a larger 3' UTR. The predicted proteins contain a signal peptide and prodomain, followed b...

2009
WU Wenbing

With the method of kinematics, the paper gives a new definition for “leap” and “leap-development”, and suggests that the essential property of “leap” is “acceleration”. By analysis of leap development mechanism, the paper puts forward the leap development strategy and the approach of carrying out the strategy for China conventional enterprises. Keyword: Leap development mechanism, Conventional ...

ژورنال: :مجله پژوهش های برنامه ریزی و سیاستگذاری انرژی 0

برنامه ریزی انرژی و بهره گیری از ابزارهای طراحی سیاست های انرژی و زیست محیطی یکی از مهمترین مسائل استراتژیکی است که جهت تأمین تقاضای انرژی در جوامع امروزی بدان پرداخته می شود. از این رو در این مقاله، ساختار مصرف نهایی انرژی در ایران با استفاده از مدل ساز لیپ تصویر گردیده است. بدین منظور، در مرحله نخست ساختار مصرف انرژی کشور تحلیل شده و رفتار تاریخی سیستم انرژی ارزیابی گردیده است. سپس، روش مدلسا...

2015
Alexander Chan Tzipora Halevi Nasir D. Memon

The Leap Motion controller is a consumer gesture sensor aimed to augment a user’s interactive experience with their computer. Using infrared sensors, it is able to collect data about the position and motions of a user’s hands. This data allows the Leap to be used as an authentication device. This study explores the possibility of performing both login as well as continuous authentication using ...

2011
Edward H. Bovey

A clustered randomized design was used in which 28 inclusive preschool classrooms were randomly assigned to receive 2 years of training and coaching to fidelity in the LEAP (Learning Experiences and Alternative Program for Preschoolers and Their Parents) preschool model, and 28 inclusive classes were assigned to receive intervention manuals only. In total, 177 intervention classroom children an...

2013
Hillel Avni Nir Shavit Adi Suissa

We introduce Leap-List, a concurrent data-structure that is tailored to provide linearizable range queries. A lookup in Leap-List takes O(log n) and is comparable to a balanced binary search tree or to a skip-list. However, in Leap-List, each node holds up-to K immutable key-value pairs, so collecting a linearizable range is K times faster than the same operation performed non-linearizably on a...

Journal: :transactions on combinatorics 2012
mehdi eliasi

the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...

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

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