КОРЕКЦІЯ МЕТАБОЛІЧНИХ ПОРУШЕНЬ ТА КИСНЕВОГО ЗАБЕЗПЕЧЕННЯ НИЖНІХ КІНЦІВОК ПРИ КОМОРБІДНИХ СТАНАХ

Представлено результати особливостей змін рівня сечової кислоти і показників оксигенації артеріальної та венозної крові у хворих на ІХС: стабільну стенокардію напруження із супутнім цукровим діабетом (ЦД) 2 типу, ускладненим мікро-макроангіопатією нижніх кінцівок до та після лікування альфа-ліпоєвою кислотою. Відмічено зниження рівня сечової кислоти та зростання параметрів кисневого забезпечення нижніх кінцівок після отримання курсу лікування альфа-ліпоєвою кислотою

Absence of Scaling in the Integer Quantum Hall Effect

We have studied the conductivity peak in the transition region between the two lowest integer Quantum Hall states using transmission measurements of edge magnetoplasmons. The width of the transition region is found to increase linearly with frequency but remains finite when extrapolated to zero frequency and temperature. Contrary to prevalent theoretical pictures, our data does not show the scaling characteristics of critical phenomena.These results suggest that a different mechanism governs the transition in our experiment.Comment: Minor changes and new references include

Purification of recombinant extracellular proteases from Bacillus pumilus for ß-amyloid peptide cleavage

© 2016 Pleiades Publishing, Ltd. Using the expression vector pGP382 containing a constitutive promoter (P degQ36 ) and an affinity tag (Strep-tag), we have obtained highly purified recombinant Bacillus pumilus 3-19 proteinases with different substrate specificities: glutamylendopeptidase (GseBp), subtilisin-like protease (AprBp), and metalloendopeptidase (MprBp). The products of the hydrolysis of the ß-amyloid peptide by the bacterial proteases from B. pumilus have been studied. The findings on the potential of the practical application of these bacterial enzymes as the agents preventing the development of the Alzheimer's disease are presented

Sparse Kneser graphs are Hamiltonian

For integers k≥1 and n≥2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k-element subsets of {1,…,n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k+1,k) are also known as the odd graphs. We settle an old problem due to Meredith, Lloyd, and Biggs from the 1970s, proving that for every k≥3, the odd graph K(2k+1,k) has a Hamilton cycle. This and a known conditional result due to Johnson imply that all Kneser graphs of the form K(2k+2a,k) with k≥3 and a≥0 have a Hamilton cycle. We also prove that K(2k+1,k) has at least 22k−6 distinct Hamilton cycles for k≥6. Our proofs are based on a reduction of the Hamiltonicity problem in the odd graph to the problem of finding a spanning tree in a suitably defined hypergraph on Dyck words

Inositol Phosphates and their Biological Effects

The paper is dedicated to data analysis on inositol phosphates nature distribution, structure and biological functions as well as enzymes - phytases - capable to hydrolyze these hardly digestible compounds and their complexes. Pharmaceutical application of inositol phosphates in treatment and prevention of various inflammatory and cancer diseases is discussed

Optimization of cultivation media for heterologous gene expression of adamalysin-like melalloendopeptidase Bacillus pumilus

© 2015 Rudakova et al. The paper is dedicated to selecting main components of the nutrient medium and additional sources of nutrients for the maximum production of adamalysin-like metalloproteinase Bacillus pumilus. For convenience, the gene of metalloproteinase MprBp was cloned in protein-deficient strain B. subtilis BG2036. During the study, optimal concentration of peptone, inorganic phosphate, and casein was selected. Besides, it was shown that the enzyme production is stimulated by kasamino acids, leucine, alanine, asparagine, glutamine, as well as calcium and magnesium ions

A novel Bacillus intermedius extracellular alkaline phosphatase: Isolation, physico-chemical and catalytic characteristics

A new alkaline phosphatase was obtained as homogeneous preparation from culture filtrate of the spore-forming Bacillus intermedius. B. intermedius phosphatase was shown to be monomer with molecular weight of 47 kDa. The enzyme possesses phosphomonoesterase and phosphodiesterase activities and exhibits a broad specificity towards a wide variety of substrates. The purified phosphatase had an optimum temperature of 50°C, optimum pH of 9.5 and was stable until 60°C at pH 8-10. The effect of divalent metal ions and thiol reagents on catalytic activity of the enzyme was studied

Ring Currents and the PCP Rule

According to the recently discovered PCP rule, the intensity of cyclic conjugation in the fivemembered rings of polycyclic conjugated hydrocarbons related to acenaphthylene and fluoranthene increases with the number of phenyl-cyclopentadienyl (PCP) fragments present in the molecule. The validity of this regularity was first observed by studying the energy effects of cyclic conjugation in the fivemembered rings of these systems. In order to show that the PCP rule is not an artifact of the method employed, it is necessary to confirm its validity by other approaches. We now show that the PCP rule is in perfect agreement with calculated topological π-electron ring-currents, ostensibly an independent, quantitative, theoretical – albeit, it is here argued, likewise also graph-theoretical – measure of cyclic conjugation in the individual rings of polycyclic π-electron systems. In addition, we show that the molecularstructure dependency of the ring currents in acenaphthylene and fluoranthene congeners also agrees with other, earlier-established, regularities for cyclic conjugation

Algorithmic Analysis of Array-Accessing Programs

For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single array whose length is potentially unbounded, and whose elements range over pairs from Σ × D, where Σ is a finite alphabet and D is a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) solvable in Ex-pspace for programs with arbitrarily nested loops if array elements range over a finite data domain, and (3) decidable for a restricted class of programs with doubly-nested loops. The third result establishes connections to automata and logics defining languages over data words