53 research outputs found
Chromatographic analysis of sympathomimetic amines after fluorescence derivatization with benzocoumarin-3-carboxylic acid chloride
This work reports the use of a new fluorescent reagents in derivatization procedures prior toTLC and HPLC separations of sympathomimetic amines. Experiments were performed to optimize the reaction conditions /time, temperature, reagent amount, choice and amount of catalyst)
Isolation and Structure Elucidation of Sterols and Glucoclionasterol from Arthrocnenum Glaucum Ung. Sterb'
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machine-level integers (bit-vectors) is an open problem. This is particularly relevant for the verification of low-level code. We propose several novel algorithms to generate ranking functions for relations over machine integers: a complete method based on a reduction to Presburger arithmetic, and a template-matching approach for predefined classes of ranking functions based on reduction to SAT- and QBF-solving. The utility of our algorithms is demonstrated on examples drawn from Windows device drivers
Determination of Sulfhydryl Groups in Proteins and Enzymes by Indirect Amperometric Titration
R. Hamm and K. Hofmann1,2 described in 1965 a method for the determination of sulfhydryl groups by indirect amperometric titration of proteins with silver nitrate. This method is very useful because it can be applied to turbid solutions, suspensions or homogenates of miofibrills, muscle extracts or enzymes. We modified the above mentioned method using phenylmercuric acetate instead of AgN03 for the preincubation
Quantitation of chlorophenoxy acid herbicides by high-performance liquid chromatography with coulometric detection
The study of productivity and elements of its structure of the winter soft wheat varieties sown after sunflower
At present new varieties and hybrids capable to produce high and stable grain yields are of great demand. One of the main requirements to which they must meet is the ability to withstand environmental factors that reduce their productivity. Sunflower is a severe forecrop that extremely dries the soil, and it in its turn affects the productivity. Therefore, testing and selection of varieties able to withstand unfavourable conditions is of great urgency. This paper presents the study results of productivity and elements of its structure of 18 winter soft wheat varieties. The studies were carried out in the fields of the FSBSI “ARC “Donskoy”. Sowing was carried out with a Wintersteiger Plotseed planter with 4–6 cm of seeding depth. The seeding rate was 550 germinating grains per1 m². Registration plot was 10 m² with 4-time periodicity. The winter soft wheat variety “Don 107” was used as a standard. According to a complex of traits, there were identified the varieties “Krasa Dona”, “Lilit”, “Volnitsa”, “Lidiya”, sown after sunflower which are able to produce high yields (6.9–7.5 t / ha), large number of grains per ear (30.7–36.2 pcs.) and 1000-kernel weight (41.1–45.5 g). The analysis found out that the productivity of winter soft wheat varieties had an average positive correlation between the number of productive stems (r = 0.32±0.24) and 1000-kernel weight (r = 0.43±0.22). There was a weak positive correlation between productivity, the number of kernels per ear, kernel weight per ear (r = 0.25±0.24 and r = 0.21±0.24 respectively)
Loop Leaping with Closures
Loop leaping is the colloquial name given to a form of program analysis in which summaries are derived for nested loops starting from the innermost loop and proceeding in a bottom-up fashion considering one more loop at a time. Loop leaping contrasts with classical approaches to finding loop invariants that are iterative; loop leaping is compositional requiring each stratum in the nest of loops to be considered exactly once. The approach is attractive in predicate abstraction where disjunctive domains are increasingly used that present long ascending chains. This paper proposes a simple and an efficient approach for loop leaping for these domains based on viewing loops as closure operators
- …
