2 resultados para topological equivalence of attractors
em University of Connecticut - USA
Resumo:
A number of tight urinary epithelia, as exemplified by the turtle bladder, acidify the luminal solution by active transport of H+ across the luminal cell membrane. The rate of active H+ transport (JH) decreases as the electrochemical potential difference for H+ [delta mu H = mu H(lumen) - mu H(serosa)] across the epithelium is increased. The luminal cell membrane has a low permeability for H+ equivalents and a high electrical resistance compared with the basolateral cell membrane. Changes in JH thus reflect changes in active H+ transport across the luminal membrane. To examine the control of JH by delta mu H in the turtle bladder, transepithelial electrical potential differences (delta psi) were imposed at constant acid-base conditions or the luminal pH was varied at delta psi = 0 and constant serosal PCO2 and pH. When the luminal compartment was acidified from pH 7 to 4 or was made electrically positive, JH decreased as a linear function of delta mu H as previously described. When the luminal compartment was made alkaline from pH 7 to 9 or was made electrically negative, JH reached a maximal value, which was the same whether the delta mu H was imposed as a delta pH or a delta psi. The nonlinear JH vs. delta mu H relation does not result from changes in the number of pumps in the luminal membrane or from changes in the intracellular pH, but is a characteristic of the H+ pumps themselves. We propose a general scheme, which, because of its structural features, can account for the nonlinearity of the JH vs. delta mu H relations and, more specifically, for the kinetic equivalence of the effects of the chemical and electrical components of delta mu H. According to this model, the pump complex consists of two components: a catalytic unit at the cytoplasmic side of the luminal membrane, which mediates the ATP-driven H+ translocation, and a transmembrane channel, which mediates the transfer of H+ from the catalytic unit to the luminal solution. These two components may be linked through a buffer compartment for H+ (an antechamber).
Resumo:
Digital terrain models (DTM) typically contain large numbers of postings, from hundreds of thousands to billions. Many algorithms that run on DTMs require topological knowledge of the postings, such as finding nearest neighbors, finding the posting closest to a chosen location, etc. If the postings are arranged irregu- larly, topological information is costly to compute and to store. This paper offers a practical approach to organizing and searching irregularly-space data sets by presenting a collection of efficient algorithms (O(N),O(lgN)) that compute important topological relationships with only a simple supporting data structure. These relationships include finding the postings within a window, locating the posting nearest a point of interest, finding the neighborhood of postings nearest a point of interest, and ordering the neighborhood counter-clockwise. These algorithms depend only on two sorted arrays of two-element tuples, holding a planimetric coordinate and an integer identification number indicating which posting the coordinate belongs to. There is one array for each planimetric coordinate (eastings and northings). These two arrays cost minimal overhead to create and store but permit the data to remain arranged irregularly.