نتایج جستجو برای: sand rose graph software

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

2015
Seong-Kyu Choe SEONG-KYU CHOE Kai Lin Nicholas R. Rhind Nathan D. Lawson Charles G. Sagerstrom Nicole M. Roy Anusha J ayaraman Sigalit Zchut

Hindbrain patterning requires many factors involved in early segmentation and later segment identity of the specific domains of the hindbrain. Hox proteins and their cofactors are of great importance durng segmentation of the hindbrain, because segmentation and/or segment identity are lost when any of them are lost. Previously, we have reported that Meis proteins synergize with Pbx, another Hox...

2009
Zhengying WEI Meng CAO Yiping TANG Bingheng LU

Aiming at complex labyrinth-channel emitters’ structure and the practical problem of clogging, this paper investigates the practical flow of water, mixed with sand escaped from filtering, in the labyrinth channel. CFD analysis has been performed on liquid-solid two-phase flow in labyrinthchannel emitters. Based on micro-PIV (particle image velocimetry) flow visualization technology, the flow in...

2011
Dan Quinlan Chunhua Liao

The development of future software for proposed new computer architectures is expected to make significant demands on compiler technologies. Significant rewriting of applications will be likely to support the use of new hardware features and preserve the current software investment. Existing compilers provide little support for the broad range of research efforts addressing exascale challenges,...

1992
E. R. Gansner

Directed graphs are ubiquitous in most aspects of software analysis. Presented abstractly, as a list of edges, a graph does not manifest much of the important structural information that becomes obvious if the graph displayed pictorially. This paper presents a technique for drawing directed graphs quickly and attractively. It also describes how a tool implementing this technique has been used, ...

Journal: :ILKOMNIKA: Journal of Computer Science and Applied Informatics 2020

Journal: :IEEJ Transactions on Electronics, Information and Systems 2004

Journal: :Journal of the Korea Society of Computer and Information 2016

Journal: :Discrete Applied Mathematics 1998
Anne Berry Jean Paul Bordat

In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to strengthen Dirac’s theorem (Dirac, 1961): ‘‘Every non-clique triangulated graph has at least two non-adjacent simplicial vertices’’, restricting the definition of a simplicial vertex; this also enables us to strengthen...

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

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