In vivo monitoring of nanoparticle delivery is essential to better understand cellular and molecular interactions of nanoparticles with tissue and to better plan nanoparticle-mediated therapies. We developed a three-dimensional ultrasound and photoacoustic (PA) imaging system and a spectroscopic PA imaging algorithm to identify and quantify the presence of nanoparticles and other tissue constit...

A nanoscale, synthetic perturbation was all that was required to nudge a natural, self–assembly process toward significantly higher order. Nanolithography was used to impose the perturbation which ultimately led to an organized nanoparticle array. Specifically, liquid–phase pulsed laser induced dewetting (PLiD) was used to transform metallic thin film strips into nanoparticle arrays. Initially,...

We investigated the expansion features of femtosecond laser generated tungsten nanoparticle plumes in vacuum. Fast gated images showed distinct two components expansion features, viz., plasma and nanoparticle plumes, separated by time of appearance. The persistence of plasma and nanoparticle plumes are 500 ns and 100 ls, respectively, and propagating with velocities differed by 25 times. The es...

An equivalence graph is a vertex disjoint union of complete graphs. For a graph G, let eq(G) be the irdnimum number of equivalence subgraphs of G needed to cover all edges of G. Similarly, let cc(G) be the minimum number of complete subgraphs of G needed to cover all its edges. Let H be a graph on n vertices with ma,'dmal degree _~d (and minimal degree --~ 1), and let G=I~ be its complement. We...

Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References

Composable safety certification envisions reuse of safety case argument-fragments together with safety-relevant components in order to reduce the cost and time needed to achieve certification. The argumentfragments could cover safety aspects relevant for different contexts in which the component can be used. Creating argument-fragments for the out-of-context components is time-consuming and cur...

In this paper a schema of graphical parameters is proposed. Based on the parameter integrity introduced by Barefoot, Entringer and Swart, members Ψ(G) of this schema have the general form Ψ(G) = min{ |S| + ψ(G − S) : S ⊂ V (G) }, where ψ(G) is another given graphical parameter. Examples include integrity, mean integrity, connectivity and vertex cover number. General results and bounds for the s...

We show that there exists a Martin-Löf random degree which has a strong minimal cover.