The aim of this study was to characterize a conventional and a pressed porcelain for zirconia core as to biaxial flexural strength (BFS), apparent fracture toughness (FT) and microstructure composition, and to investigate the effect of glaze cooling rate on the BFS of the zirconia/porcelain bilayers. Monolayers of conventional porcelain Vita VM9 and pressed porcelain Vita PM9 (n=15) (12 mm diam...

UNLABELLED Adequate polymerization plays an important role on the longevity of the composite resin restorations. OBJECTIVES The aim of this study was to evaluate the effect of light-curing units, curing mode techniques and storage media on sorption, solubility and biaxial flexural strength (BFS) of a composite resin. MATERIAL AND METHODS Two hundred and forty specimens were made of one comp...

The influences of natural bamboo fibers (BFs) weight fraction on the microstructure, quasi-static and dynamic compressive responses epoxy resin matrix composites were investigated with aid scanning electron microscope, electronic universal testing machine modified Split Hopkinson pressure bar (SHPB) setup. properties BFs/epoxy suggested that strength strongly improved addition BFs, which was at...

In the past, several attempts have been made to deal with the state space explosion problem by equipping a depth-first search (DFS) algorithm with a state cache, or by avoiding collision detection, thereby keeping the state hash table at a fixed size. Most of these attempts are tailored specifically for DFS, and are often not guaranteed to terminate and/or to exhaustively visit all the states. ...

Based on explicit numerical constructions for Kolmogorov’s superpositions (KS) linear size circuits are possible. Because classical Boolean as well as threshold logic implementations require exponential size in the worst case, it follows that size-optimal solutions for arbitrary Boolean functions (BFs) should rely (at least partly) on KS. In this paper, we will present previous theoretical resu...

Strongly Connected Component (SCC) based searching is one of the most popular LTL model checking algorithms. When the SCCs are huge, the counterexample generation process can be time-consuming, especially when dealing with fairness assumptions. In this work, we propose a GPU accelerated counterexample generation algorithm, which improves the performance by parallelizing the Breadth First Search...

Breadth-First Search (BFS) is one of the most important kernels in graph computing. It is the main kernel of the Graph500 rating that evaluates performance of large supercomputers and multiprocessor nodes in terms of traversed edges per second (TEPS). In this paper we present the results of BFS performance evaluation on a recently released high-performance Intel Xeon Phi coprocessor. We examine...

In the upcoming exa-scale era, the exploitation of data locality in parallel programs is very important because it benefits both program performance and energy efficiency. However, this is a hard topic for graph algorithms such as the breadth first search (BFS) due to the irregular data access patterns. This study analyzes the exploitation of data locality in the BFS and its impact on the energ...

Graph is a widely used data structure and graph algorithms, such as breadth-first search (BFS), are regarded as key components in a great number of applications. Recent studies have attempted to accelerate graph algorithms on highly parallel graphics processing unit (GPU). Although many graph algorithms based on large graphs exhibit abundant parallelism, their performance on GPU still faces for...