نتایج جستجو برای: 90o sharp bend
تعداد نتایج: 50211 فیلتر نتایج به سال:
Flagellar beating of hyperactivated golden hamster spermatozoa was analyzed in detail using digital image analysis and was compared to that of nonhyperactivated (activated) spermatozoa in order to understand the change in flagellar beating during hyperactivation and the active microtubule sliding that brought about the change in flagellar beating. Hyperactivated flagellar beating, which was cha...
The human homologue of the neu oncogene is frequently found in human tumors. Certain amino acid substitutions at position 664 in the transmembrane domain of the neu oncogene-encoded p185 protein product are known to cause malignant transformation of cells. Using conformational energy analysis based on ECEPP (empirical conformational energies for polypeptides program), we have previously determi...
Resonance Raman spectra were obtained for 2-nitrophenol in cyclohexane solution with excitation wavelengths in resonance with the charge-transfer (CT) proton transfer band absorption. These spectra indicate that the Franck-Condon region photodissociation dynamics have multidimensional character with motion along more than 15 normal modes: the nominal CCH bend+CC stretch nu(12) (1326 cm(-1)), th...
Epitopes for a panel of anti-αVβ3 monoclonal antibodies (mAbs) were investigated to explore the activation mechanism of αVβ3 integrin. Experiments utilizing αV/αIIb domain-swapping chimeras revealed that among the nine mAbs tested, five recognized the ligand-binding β-propeller domain and four recognized the thigh domain, which is the upper leg of the αV chain. Interestingly, the four mAbs incl...
We consider embeddings of planar graphs in R where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of O(n...
We study drawings of graphs of maximum degree six on the hexagonal (triangular) grid, with the main focus of keeping the number of bends small. We give algorithms that achieve 3.5n + 3.5 bends for all simple graphs. We also prove optimal lower bounds on the number of bends for K7, and give asymptotic lower bounds for graph classes of varying connectivity.
We interpreted flow dynamics of the Kahiltna Pass Basin accumulation zone on Mount McKinley, Alaska, USA, using 40, 100 and 900MHz ground-penetrating radar profiles and GPS surface velocity measurements. We found dipping, englacial surface-conformable strata that experienced vertical thickening as the glacier flowed westward from a steep, higher-velocity (60ma) region into flat terrain associat...
In this paper, a novel and efficient method for skew detection in document images is proposed. The proposed method is based on connected component blotching and linear regression. The proposed algorithm works well irrespective of the type of script even for a wide range of skew angle (with in ±90o).
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید