Activation of Progesterone Receptor by ATP

Progesterone-receptor complex from freshly prepared hen oviduct cytosol acquired the ability to bind to isolated nuclei, DNA-cellulose and ATP-Sepharose when incubated with 5-10 mM ATP at 4°C. The extent of this ATP-dependent activation was higher when compared with heat-activation achieved by warming the progesterone- receptor complex at 23 °C. The transformation of progesterone-receptor complex which occurred in a time-dependent manner was only partially dependent on hormone presence. The ATP effect was selective in causing this transformation whereas ADP, AMP and cAMP failed to show any such effect. The non-hydrolizable analogs of ATP, adenosine 5'-[a,/3-methylene]triphosphate and adenosine 5-[/l,y-imido]triphosphate were also found to be ineffective. Presence of 10 mM sodium molybdate blocked both the ATP and the heat-activation of progesterone-receptor complex. Mn" or Mg` had no detectable effect on the receptor activation but the presence of Ca" increased the extent of ATP-activation slightly. EDTA presence (> 5 mM) decreased the extent of receptor activation by about 40 % and was, therefore, not included in the buffers used for activation studies. Divalent cations were also ineffective when tested in the presence of 1- 5 mM EDTA. The properties of progesterone-receptor complex remained intact under the above conditions when analyzed for steroid-binding specificity and Scatchard analysis. However, the ATP-activated progesterone-receptor complex lost the ability to aggregate when tested on low-salt sucrose gradients. ATP was equally effective in activating the rat-uterine estradiol-receptor complex at 4 "C and influenced the transformation of 4-S receptor form into a 5-S form when analyzed on sucrose gradients containing 0.3 M KCI. The presence of ATP also increased the rate of activation of progesterone-receptor complex at 23 °C. These findings suggest a role for ATP in receptor function and offer a convenient method of studying the process of receptor activation at low temperature and mild assay conditions.

On Distance Energy of Graphs

The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed.

ON DISTANCE ENERGY OF GRAPHS

The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed.

Electron donor sites on Y2O3 catalyst as a function of the activation temperature

Cochin University of Science and Technology

Study on the determination of molecular distance in organic dye mixtures using dual beam thermal lens technique

A sensitive method based on the principle of photothermal phenomena to study the energy transfer processes in organic dye mixtures is presented. A dual beam thermal lens method can be very effectively used as an alternate technique to determine the molecular distance between donor and acceptor in fluorescein–rhodamine B mixture using optical parametric oscillator.

Molecular characterization of the nitrifying bacterial consortia employed for the activation of bioreactors used in brackish and marine aquaculture systems

The addition of commercial nitrifying bacterial products has resulted in significant improvement of nitrification efficiency in recirculating aquaculture systems (RAS). We developed two nitrifying bacterial consortia (NBC) from marine and brackish water as start up cultures for immobilizing commercialized nitrifying bioreactors for RAS. In the present study, the community compositions of the NBC were analyzed by universal 16S rRNA gene and bacterial amoA gene sequencing and fluorescence in situ hybridization (FISH). This study demonstrated that both the consortia involved autotrophic nitrifiers, denitrifiers as well as heterotrophs. Abundant taxa of the brackish water heterotrophic bacterial isolates were Paenibacillus and Beijerinckia spp. whereas in the marine consortia they were Flavobacterium, Cytophaga and Gramella species. The bacterial amoA clones were clustered together with high similarity to Nitrosomonas sp. and uncultured beta Proteobacteria. FISH analysis detected ammonia oxidizers belonging to b subclass of proteobacteria and Nitrosospira sp. in both the consortia, and Nitrosococcus mobilis lineage only in the brackish water consortium and the halophilic Nitrosomonas sp. only in the marine consortium. However, nitrite oxidizers, Nitrobacter sp. and phylum Nitrospira were detected in both the consortia. The metabolites from nitrifiers might have been used by heterotrophs as carbon and energy sources making the consortia a stable biofilm.

Strongly distance-balanced graphs and graph products

A graph G is strongly distance-balanced if for every edge uv of G and every i 0 the number of vertices x with d.x; u/ D d.x; v/ 1 D i equals the number of vertices y with d.y; v/ D d.y; u/ 1 D i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distancebalanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity O.mn/ for their recognition, wheremis the number of edges and n the number of vertices of the graph in question, are given

Equal opportunity networks, distance-balanced graphs, and Wiener game

Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2  dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced.