Home About us Contact
|
Home About us Contact | ||
|
|
||
One Edge (one + edge)
Selected AbstractsMicrohardness studies on as-grown (111) faces of some alkaline earth nitratesCRYSTAL RESEARCH AND TECHNOLOGY, Issue 6 2009P. V. Raja Shekar Abstract Single crystals of Sr(NO3)2, Ba(NO3)2 and Pb(NO3)2 are grown from their aqueous solutions at a constant temperature of 35 °C by slow evaporation technique. Crystals of size 8 to 10 mm along one edge are obtained in a period of 10 days. Chemical etching technique has been employed to study the dislocations in these crystals. The dislocations are randomly distributed and the dislocation density is about 104 to 105 /cm2. Microhardness studies are made on as,grown (111) faces of these crystals upto a load of 100 g. The hardness of the crystals increases with an increase in load and thereafter it becomes independent of the applied load. These results are discussed on the basis of reverse indentation size effect. Meyer index number n for these crystals is estimated at both low and high load regions. An analysis of hardness data of these crystals as well as some other cubic crystals like alums and alkali halates are discussed using Gilman,Chin parameter Hv/C44, where Hv is the microhardness and C44 is the shear constant. (© 2009 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) [source] On conjectures of Frankl and El-ZaharJOURNAL OF GRAPH THEORY, Issue 4 2008Bernardo Llano Abstract An induced subgraph of a graph is called a derived subgraph of if contains no isolated vertices. An edge e of is said to be residual if e occurs in more than half of the derived subgraphs of . In this article, we prove that every simple graph with at least one edge contains a non-residual edge. This was conjectured by El-Zahar in 1997. © 2008 Wiley Periodicals, Inc. J Graph Theory 57: 344,352, 2008 [source] On the maximum number of cycles in a planar graphJOURNAL OF GRAPH THEORY, Issue 3 2008R. E. L. Aldred Abstract Let G be a graph on p vertices with q edges and let r,=,q,,,p,=,1. We show that G has at most cycles. We also show that if G is planar, then G has at most 2r,,,1,=,o(2r,,,1) cycles. The planar result is best possible in the sense that any prism, that is, the Cartesian product of a cycle and a path with one edge, has more than 2r,,,1 cycles. © Wiley Periodicals, Inc. J. Graph Theory 57: 255,264, 2008 [source] The strongly connected reliability of complete digraphsNETWORKS: AN INTERNATIONAL JOURNAL, Issue 3 2005J.I. Brown Abstract Given a digraph D, consider the model where each vertex is always operational, but the edges are independently operational with probability p. The strongly connected reliability of D, scRel(D,p), is the probability that the spanning subgraph of D consisting of the operational edges is strongly connected. One can view strongly connected reliability as the probability that any vertex can send information to any other vertex, given that edges fail independently. There are very few classes for which there is an efficient algorithm for calculating the strongly connected reliability. This article presents the fist polynomial time algorithm for computing the strongly connected reliability of complete digraphs, that is, digraphs in which every vertex is joined to every other vertex by exactly one edge (one in each direction). © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45(3), 165,168 2005 [source] A phase transition for avoiding a giant componentRANDOM STRUCTURES AND ALGORITHMS, Issue 2 2006Tom Bohman Let c be a constant and (e1,f1),(e2,f2),,,(ecn,fcn) be a sequence of ordered pairs of edges from the complete graph Kn chosen uniformly and independently at random. We prove that there exists a constant c2 such that if c > c2, then whp every graph which contains at least one edge from each ordered pair (ei,fi) has a component of size ,(n), and, if c < c2, then whp there is a graph containing at least one edge from each pair that has no component with more than O(n1,, vertices, where , is a constant that depends on c2 , c. The constant c2 is roughly 0.97677. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006 [source] Hemopexin: The primary specific carrier of plasma heme,BIOCHEMISTRY AND MOLECULAR BIOLOGY EDUCATION, Issue 5 2002Marco Mattu Abstract Hemopexin (HPX) is the primary specific carrier of plasma heme and participates in its clearance by transport to the liver. After delivering the heme intracellularly, HPX is released intact into the bloodstream. HPX is formed by two four-bladed ,-propeller domains, resembling two thick disks that lock together at a 90° angle; the face of the N-terminal ,-propeller domain packs against one edge of the C-terminal domain. Each propeller blade comprises a four-stranded antiparallel ,-sheet, with the first and the fourth blades tied together by disulfide bridges. The heme ligand is bound between the two four-bladed ,-propeller domains in a pocket formed by the interdomain linker peptide. Residues His-213 and His-266 coordinate the heme iron atom giving a stable bis-histidyl Fe(III) complex. Heme release results from opening of the heme binding pocket, through movement of the two ,-propeller domains and/or the interdomain linker peptide. [source] 2333: Cultivation of limbal stem cells-derived corneal epithelium on different biologic materials for clinical transplantationACTA OPHTHALMOLOGICA, Issue 2010G PETROVSKI Purpose To develop simple, reproducible, animal-materials free method for cultivating limbal stem-cells and differentiating them into corneal epithelium on different human biologic materials for clinical transplantation. Methods The limbal tissues (2x2mm) were harvested from cadavers not more than 8 hours after death and proliferated in vitro on cell culture tissue plates, human amniotic membranes (HAM) or human lens capsules in medium containing human AB serum. Cell viability was tested using the MTT assay and annexin-FITC/Propidium Iodide positivity methods. Molecular gene and immunofluorescent marker studies for stemness, proliferation and differentiation were used for the analysis. Results Over a period of one year, 50 limbal tissue explants were cultivated. Emergence of cells at one edge of the explants occurred within 24 hours from culturing and formed monolayer within 14 days. Although the speed of cell growth varied among donors and types of media for growth, inadequate growth at two weeks was never recorded. The viability of the cells at 7 and 14 days of cultivation was higher than 96% except in case of HAM use where viability was below 80%. The growing cells were characterized for their positivity for stemness (P63, ABCG2), proliferation (ki67) and epithelial cell markers CK 3, 8, 12, 14, 18 and 19. Conclusion We demonstrate a simple, animal-materials free technique for generating corneal epithelium from cadavers or alternatively from autologous donors for viable cell growth on different biologic materials for transplantation. The growth of corneal epithelium on lens capsules proved to be superior compared to the other cultivation techiques. [source] | ||||||||||