Didn't find any results in this catalog!
But we have some results in other catalogs.displaying 1000 best results Help
Search results for: FRET
-
FREE RADICAL BIOLOGY AND MEDICINE
Journals -
FREE RADICAL RESEARCH
Journals -
INTERFACES AND FREE BOUNDARIES
Journals -
Long-Distance FRET Analysis: A Monte Carlo Simulation Study
PublicationZaproponowano nową metodę na rozszerzenie zakresu stosowalności rezonansowego transferu energii (FRET) przetestowaną przy pomocy metody Monte Carlo. Otrzymane rezultaty dowodzą, że wydajność procesu FRET może być znacząco zwiększona w porównaniu z wydajnością pojedynczego akceptora, gdy dla ustalonej od donora umieścimy układ blisko siebie położonych akceptorów na makromolekule. Z drugiej strony metoda ta umożliwia zwiększenie...
-
Isocyanate-Free Polyurethanes
PublicationIsocyanate-free polyurethanes (also called non-isocyanate polyurethanes, or NIPUs) are alternatives to the conventional (commercially used) polyurethanes synthesized using di- or polyisocyanates, polyols, and chain extenders with low molecular weight. The major routes of NIPUs’ synthesis involve polyaddition of cyclic carbonates and di- or polyamines, polycondensation of carbamates, and diols. The most important intermediates are...
-
Structural Model of the Bilitranslocase Transmembrane Domain Supported by NMR and FRET Data
Publication -
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Revista de Llengua i Dret
Journals -
Revista Catalana de Dret Public
Journals