Results 221 to 230 of about 7,733 (263)

Precise Partitioning of Metallic Single-Wall Carbon Nanotubes and Enantiomers through Aqueous Two-Phase Extraction. [PDF]

ACS Nano
Li H, Zheng M, Fagan JA.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Starting and Resolving a Partitioned BRAIN

2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC), 2008
Time-triggered communication is a favored design strategy for safety-critical systems. However, the startup of time-triggered systems is a significant concern, since the time-line from which fault-tolerance is supported must be established in segmented mediums, e.g. multi-hop networks.
Michael Paulitsch, Brendan Hall
openaire   +1 more source

Resolving the partition function’s paradox of the hydrogen atom

Physica A: Statistical Mechanics and its Applications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Plastino, Ángel Luis, Rocca, Mario Carlos, Ferri, Gustavo Luis   +2 more
openaire   +3 more sources

Binary-space-partitioned images for resolving image-based visibility

IEEE Transactions on Visualization and Computer Graphics, 2004
We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting.
Fu, CW, Wong, TT, Tong, WS, Tang, CK, Hanson, AJ   +4 more
openaire   +3 more sources

On Partially Resolvable t–Partitions

1982
Publisher Summary This chapter discusses partially resolvable t -partitions. The chapter discusses primarily with the case |P|= 1, |S| = 1. The corresponding partially resolvable t -partitions are denoted by PRP t -( p, s, υ ; m ) provided P = { p }, S = { s }.
Charlotte Huang, Eric Mendelsohn, Alexander Rosa   +2 more
openaire   +1 more source

On vector space partitions and uniformly resolvable designs

Designs, Codes and Cryptography, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blinco, A. D., El-Zanati, S. I., Seelinger, G. F., Sissokho, P. A., Spence, L. E., Vanden Eynden, C.   +5 more
openaire   +2 more sources

Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors

1993 International Conference on Parallel Processing - ICPP'93 Vol2, 1993
We develop compile-time iteration partitioning techniques for private-cache shared-memory mulriprocessors. Our techniques assign loop iterations to a set of processors so that cache coherency traffic due io interprocessor communication is minimized and load balance is maintained.
Karen A. Tomko, Santosh G. Abraham
openaire   +1 more source

Resolving resource partitioning in parrotfishes (Scarini) using microhistology of feeding substrata

Coral Reefs, 2020
Parrotfishes (Scarini) are considered key agents in coral reef health and recovery, but the drivers of parrotfish–coral dynamics remain contentious. The prevailing view of parrotfishes as ecosystem engineers is based on the perceived removal of algal turf, macroalgae and sediment, but these are effects of feeding, not causes.
Georgina M. Nicholson, Kendall D. Clements   +1 more
openaire   +1 more source

On some resolving partitions for the lexicographic product of two graphs

International Journal of Computer Mathematics, 2016
Given a connected graph , the distance between two vertices is the length of a shortest u−v path in G. The distance between a vertex and a subset is defined as . An ordered partition of vertices of G is a resolving partition of G, if for any two different vertices u,v of G there exists such that .
Nicolas Campanelli, Ismael G. Yero
openaire   +1 more source