نتایج جستجو برای: BFS
تعداد نتایج: 939 فیلتر نتایج به سال:
در این تحقیق اثر وجود پله (bfs و ffs) بر جریان و انتقال حرارت در جابه جایی اجباری نانوسیال آب- مس در کانال مورد مطالعه قرار گرفته است.نتایج نشان دادند تغییرات سرعت بی بعد در وضعیت bfs برعکس حالت ffs بوده و در حالت ffs نسبت به حالت bfs شدت تغییرات در سرعت کمتر است. در همه ی اعداد رینولدز بررسی شده در حالت bfs در پشت پله گردابه هایی به وجود می آید. این گردابه ها با افزایش عدد رینولدز باریک تر و ک...
There is mounting evidence that Fc epsilon RII (CD23) and its soluble fragments (IgE-binding factors [BFs] or soluble CD23) have pleiotropic activities. IgE-BFs are formed mainly by the proteolytic cleavage of surface Fc epsilon RII; they are first released as 37- and 33-kD unstable molecules that are subsequently transformed into 25-kD IgE-BFs. In this study, purified and radioiodinated 37-kD ...
We consider the problem of Breadth First Search (BFS) traversal on massive sparse undirected graphs. Despite the existence of simple linear time algorithms in the RAM model, it was considered non-viable for massive graphs because of the I/O cost it incurs. Munagala and Ranade [29] and later Mehlhorn and Meyer [27] gave efficient algorithms (refered to as MR BFS and MM BFS, respectively) for com...
A new method has been presented, which leads to a significant improvement of the adsorption ability of blast furnace slag (BFS). An ultra-high pressure water jet mill cavitation disintegrator and a controlled vacuum freeze dryer were used to disintegrate amorphous BFS. Specific surface areas of both BFS and disintegrated slag (BFS-D) were measured using the S method. BFS-D was obtained with an ...
Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable until recently, because of the large number of I/Os it incurs. Ajwani et al. [3] showed that the randomized variant of the o(n) I/O algorithm of Mehlhorn and Meyer [24] (MM BFS) can compute the BFS level decomposition for large graphs (around a billion edges) in a few hours for small diameter gra...
BFS is one of the classical graph theory algorithms, typically expressed under the imperative style. However, it has applications in other domains such as artiicial intelligence. All known algorithms of BFS use iteration. This article focuses on the information maintained by BFS during exploration of an arbitrary graph component. To better understand the structure of this information, BFS is re...
Brain Fag Syndrome (BFS) is a psychiatric disorder associated with study affecting two to four out of every ten African students. One of the consequences of this illness is early foreclosure of education in affected students. Etiological factors such as nervous predisposition, motivation for achievement, and psychostimulant use have been found associated with it. However, the contributions of s...
The primary auditory cortex (AI) modulates the sound information processing in the lemniscal subcortical nuclei, including the anteroventral cochlear nucleus (AVCN), in a frequency-specific manner. The dorsal cochlear nucleus (DCN) is a non-lemniscal subcortical nucleus but it is tonotopically organized like the AVCN. However, it remains unclear how the AI modulates the sound information proces...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید