Objective. The purpose of this study was to examine alterations in blood-flow signals (BFS) from human teeth during an alignment and leveling phase (superelastic wire 0.014'') in a clinical orthodontic treatment using laser doppler flowmetry (LDF). Materials and Methods. Recordings were made in 12 maxillary left central incisors. The basal value of the BFS from each tooth (without orthodontic f...

Breadth-first Search (BFS) is a fundamental graph theory algorithm that is extensively used to abstract various challenging computational problems. Due to the fine-grained irregular memory accesses, parallelization of BFS can exhibit limited performance on cache-based systems. In this paper, we study the relationship between the topology of input graphs and the performance of BFS on multicore s...

Graph analytics on social networks, Web data, and communication networks has been widely used in a plethora of applications. Many graph analytics algorithms are based on breadth-first search (BFS) graph traversal, which is not only time-consuming for large datasets but also involves much redundant computation when executed multiple times from different start vertices. In this paper, we propose ...

The Brain Fag Syndrome (BFS) is defined in the Diagnostic and Statistical Manual of Mental Disorders (DSM-IV) as a culture bound syndrome. BFS is a tetrad of somatic complaints; cognitive impairments; sleep related complaints; and other somatic impairments. Prince first described this psychiatric illness associated with study among African students in 1960. There have been questions relating to...

The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general ...

The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. When the BFS algorithm is parallelized by distributing the graph betw...

A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph. In this paper, we study traversal problems in a temporal graph. Graph traversals, such as DFS and BFS, are basic operations for processing and studying a graph. While both DFS an...

Backward-facing step (BFS) is a model that provides several applicative features in engineering. The complex phenomena of BFS flow have crucial impact on any application. Therefore, this study comprehensively investigates the characteristics with various shapes. backward-facing (F-BFS) fillets were tested at intervals Reynolds number 50 smaller than Re 400 using CFD approach. Based computationa...

One of the fundamental algorithms in analytical graph databases is breadth-first search (BFS). It is the basis of reachability queries, centrality computations, neighborhood enumeration, and many other commonly-used algorithms. We take the idea of purely array-based BFSs introduced in the sequential multi-source MS-BFS algorithm and extend this approach tomulti-threaded singleandmulti-source BF...

objectives: this study aimed to evaluate the effect of different ceramic surface treatments after machining grinding on the biaxial flexural strength (bfs) of machinable dental ceramics with different crystalline phases. materials and methods: disk-shape specimens (10mm in diameter and 1.3mm in thickness) of machinable ceramic cores (two silica-based and one zirconia-based ceramics) were prepar...