In this paper an acceleration method for finding the nearest ray–object intersection for ray tracing purposes is presented. We use the concept of BSP trees enriched by rope trees. These are used to accelerate the traversal of the BSP tree. We give a comparison of experimental results between the technique based on BSP tree and uniform spatial subdivision.

objective: runt-related transcription factor 2 (runx2) and osterix (osx) as two specific osteoblast transcription factors and distal-less homeobox 5 (dlx5) as a non-specific one are of paramount importance in regulating osteoblast related genes including osteocalcin, bone sialoprotein (bsp), osteopontin and collagen type iα1. the present study sets out to investigate whether epigenetic regulati...

Acidic phosphoproteins of mineralized tissues such as bone and dentin are believed to play important roles in HA (hydroxyapatite) nucleation and growth. BSP (bone sialoprotein) is the most potent known nucleator of HA, an activity that is thought to be dependent on phosphorylation of the protein. The present study identifies the role phosphate groups play in mineral formation. Recombinant BSP a...

This thesis falls within the formal verification of parallel programs. The aim of formal verifi-cation is to ensure that a program will run as it should, without making mistakes, blocking, or terminatingabnormally. This is even more important in the parallel computation field, where the cost of calculationscan be very high. The bsp model (Bulk Synchronous Parallelism) is a model of ...

BACKGROUND In this clinical trial we compared the effects of broccoli sprouts powder, as an alternative and complementary treatment, to those of standard triple therapy, as a common medical treatment, on cardiovascular risk factors following the H.pylori eradication in patients with type 2 diabetes. METHODS Eighty-six type 2 diabetic patients with positive H.pylori stool antigen test (HpSAg) ...

We developed BSP-SLIM, a new method for ligand-protein blind docking using low-resolution protein structures. For a given sequence, protein structures are first predicted by I-TASSER; putative ligand binding sites are transferred from holo-template structures which are analogous to the I-TASSER models; ligand-protein docking conformations are then constructed by shape and chemical match of liga...

The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel computers. Nevertheless, when programming in ‘BSP style’, the running time of the implementation of an algorithm can be very dependent on the underlying communications library. In this study, an overview of existing approache...

In this paper, a broadcast scheduling problem (BSP) in a time division multiple access (TDMA) ad hoc network is analyzed in terms of its computational complexity. In a TDMA frame, time is divided into equal length transmission slots. The objective of the considered version of BSP is to provide a collision free broadcast schedule which minimizes the total frame length. Wang & Ansari (1997) have ...

We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plane. We assume that the BSP uses only axis-parallel cutting lines. These lower bounds imply that, in the worst case, a BSP tree of height O(log n) must have size (n log n) and a BSP tree of size O(n) must have height (n)...