The electronic properties of a modified magnetic quantum dot are studied. The modified magnetic quantum dot is a quantum structure that is formed by spatially inhomogeneous distributions of magnetic fields. Electrons are magnetically confined to the plane where the magnetic fields inside and outside the dot are different from each other. The energy spectrum exhibits quite different features dep...

no abstract

Aconitine-modified sodium channels in the neuroblastoma cell membrane were investigated with patch-clamp technique in outside-out configuration. When aconitine (0.1 mmol/l) was present in the pipette solution two types of modified single sodium channels were observed. The first type showed openings with normal amplitude (slope conductance 15.5 pS) and bursting behaviour. The second type of modi...

Abstract. Climate change is expected to have detrimental consequences on fragile ecosystems, threatening biodiversity, as well food security of millions people. Trees are likely play a central role in mitigating these impacts. The microclimatic conditions below tree canopies usually differ substantially from the ambient macroclimate vegetation can buffer temperature changes and variability. coo...

PURPOSE The purpose of this study was to compare four graft-tunnel angles (GTA), the femoral GTA formed by three different femoral tunneling techniques (the outside-in, a modified inside-out technique in the posterior sag position with knee hyperflexion, and the conventional inside-out technique) and the tibia GTA in 3-dimensional (3D) knee flexion models, as well as to examine the influence of...

In this paper, we introduce a modified fence fill algorithm for filling a polygon. Fence fill algorithm is a modified edge fill algorithm. As opposed to the edge fill algorithm that fills pixels starting from the polygon edge to the maximum screen coordinates, the fence fill algorithm fills pixels bounded by the polygon edge and the fence. This involves large number of calculations to find the ...

Hierarchical A∗ (HA∗) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA∗ prioritizes search in refined grammars using Viterbi outside costs computed in coarser grammars. We present Bridge Hierarchical A∗ (BHA∗), a modified Hierarchial A∗ algorithm which computes a novel outside cost called a bridge outside cost. These bridge costs mix finer outside sc...

This document may contain material from IETF Documents or IETF Contributions published or made publicly available before November 10, 2008. The person(s) controlling the copyright in some of this material may not have granted the IETF Trust the right to allow modifications of such material outside the IETF Standards Process. Without obtaining an adequate license from the person(s) controlling t...

This document may contain material from IETF Documents or IETF Contributions published or made publicly available before November 10, 2008. The person(s) controlling the copyright in some of this material may not have granted the IETF Trust the right to allow modifications of such material outside the IETF Standards Process. Without obtaining an adequate license from the person(s) controlling t...