A comparative study of verbal IQ, performance IQ and verbal IQ-performance IQ disparity among Turner syndrome patients and patients with primary amenorrhoea due to other aetiologies

Background: Assessing disparity in IQ is important in selecting an occupation and thus helping people lead a productive life. In Turner syndrome patients, this shall be more important as assessment of verbal IQ- and performance IQ disparity could be used in helping them select an occupation so that productivity and quality of life is not grossly compromised.Methods: Based on karyotyping, 30 patients with turner syndrome and 30 patients with primary amenorrhoea due to other aetiologies were selected for the study. Cytogenetic analysis was done for every case using G-banding technique. Assessment of intellectual functions was done using Wechsler Adult Intelligence Scale (WAIS).Results: Mean value of PIQ of X0 (turner) was 74.67 and that of XX (other amenorrhoea patients) was 90.30. Mean value of VIQ of X0 (turner) was 93.67 and that of XX (other amenorrhoea patients) was 93.60. Mean value of VIQ and PIQ disparity of X0 (turner) was 18.67 and that of XX (other amenorrhoea patients) was 3.Conclusions: Turner syndrome patients have high VIQ-PIQ disparity when compared to other primary amenorrhoea patients

Excretion of lysine by Micrococcus glutamicus

Analysis of intracellular and extracellular lysine concentration during lysine fermentation by Micrococcus glutamicus AEC RN-13-6/1 indicated that lysine excretion occurs against a concentration gradient towards the end of the fermentation period. The capacity to excrete lysine against a concentration gradient may be a factor contributing to the high yield of lysine

Purification and properties of diaminopimelate decarboxylase of Micrococcus glutamicus

Diaminopimelate decarboxylase (EC 4.1.1.20) of Micrococcus glutamicus ATCC 13059 was purified to homogeneity. The enzyme had an apparent molecular weight of 191,000 as determined by gel filtration on Sephadex G-200. At protein concentrations of 20 and 10 μg per ml and in the absence of pyridoxal-5'-phosphate, it dissociated into a species of molecular weight 94,000. The polypeptide chain molecular weight as determined by sodium dodecyl sulphate Polyacrylamide gel electrophoresis was 100,000. The Km formeso diaminopimelate was 0.5 mM and that for pyridoxal-5'-phosphate was 0.6 μM. Sulphydryl groups and pyridoxal-5'-phosphate were essential for activity and stability. The enzyme was inhibited significantly by L-lysine and DL-aspartic β-semialdehyde

Aspartokinase of a lysine producing mutant of Micrococcus glutamicus

Aspartokinase from Micrococcus glutamicus AEC RN-13-6/1 [a homoserine requiring, S-(2-aminoethyl)-L-cysteine resistant, lysine producing strain] was purified 71 fold. The partially purified enzyme was inhibited by L-lysine. L-threonine, L-methionine, L-isoleucine, L-valine and L-phenylalanine activated the enzyme and reversed the inhibition by L-lysine. Aspartokinase activity was not derepressed by growth-limiting concentrations of L-threonine and/or L-methionine. It was not repressed by an excess of L-lysine (20 mM) and/or L-isoleucine (15.3 mM). The degree of activation or inhibition by amino acids was dependant on the composition of the growth medium. This observation is in contrast with the enzyme from the original (non-lysine-producing) strain which was inhibited by lysine or threonine and in a concerted manner by threonine plus lysine

Fisheye Consistency: Keeping Data in Synch in a Georeplicated World

Over the last thirty years, numerous consistency conditions for replicated data have been proposed and implemented. Popular examples of such conditions include linearizability (or atomicity), sequential consistency, causal consistency, and eventual consistency. These consistency conditions are usually defined independently from the computing entities (nodes) that manipulate the replicated data; i.e., they do not take into account how computing entities might be linked to one another, or geographically distributed. To address this lack, as a first contribution, this paper introduces the notion of proximity graph between computing nodes. If two nodes are connected in this graph, their operations must satisfy a strong consistency condition, while the operations invoked by other nodes are allowed to satisfy a weaker condition. The second contribution is the use of such a graph to provide a generic approach to the hybridization of data consistency conditions into the same system. We illustrate this approach on sequential consistency and causal consistency, and present a model in which all data operations are causally consistent, while operations by neighboring processes in the proximity graph are sequentially consistent. The third contribution of the paper is the design and the proof of a distributed algorithm based on this proximity graph, which combines sequential consistency and causal consistency (the resulting condition is called fisheye consistency). In doing so the paper not only extends the domain of consistency conditions, but provides a generic provably correct solution of direct relevance to modern georeplicated systems

The Methods to Improve Quality of Service by Accounting Secure Parameters

A solution to the problem of ensuring quality of service, providing a greater number of services with higher efficiency taking into account network security is proposed. In this paper, experiments were conducted to analyze the effect of self-similarity and attacks on the quality of service parameters. Method of buffering and control of channel capacity and calculating of routing cost method in the network, which take into account the parameters of traffic multifractality and the probability of detecting attacks in telecommunications networks were proposed. The both proposed methods accounting the given restrictions on the delay time and the number of lost packets for every type quality of service traffic. During simulation the parameters of transmitted traffic (self-similarity, intensity) and the parameters of network (current channel load, node buffer size) were changed and the maximum allowable load of network was determined. The results of analysis show that occurrence of overload when transmitting traffic over a switched channel associated with multifractal traffic characteristics and presence of attack. It was shown that proposed methods can reduce the lost data and improve the efficiency of network resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text overlap with arXiv:1904.0520

Birth registration and children's rights: a complex story

Birth registration is a fundamental right of all children and a basic function of all modern governments. So, given the extensive anticipated benefits of birth registration, there has been increasing interest from development organisations in implementing programmes on birth registration in countries with low rates of registration.But there is a significant lack of empirical research that explores the effects of birth registration, and if and how it benefits children in practice.Plan’s new research in India, Kenya, Sierra Leone and Vietnam reveals the results of an investigation into the impact of birth registration. What emerges is a complex picture of the interrelationship between children’s rights and birth registration. As a result, the report makes a series of important recommendations for governments and development partners

Revisit Sparse Polynomial Interpolation based on Randomized Kronecker Substitution

In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate polynomial interpolation to black-box univariate polynomial interpolation over any ring. The reduction algorithm leads to multivariate interpolation algorithms with better or the same complexities most cases when combining with various univariate interpolation algorithms. We also propose a modified univariate Ben-or and Tiwarri algorithm over the finite field, which has better total complexity than the Lagrange interpolation algorithm. Combining our reduction method and the modified univariate Ben-or and Tiwarri algorithm, we give a Monte Carlo multivariate interpolation algorithm, which has better total complexity in most cases for sparse interpolation of black-box polynomial over finite fields

Building cloud applications for challenged networks

Cloud computing has seen vast advancements and uptake in many parts of the world. However, many of the design patterns and deployment models are not very suitable for locations with challenged networks such as countries with no nearby datacenters. This paper describes the problem and discusses the options available for such locations, focusing specifically on community clouds as a short-term solution. The paper highlights the impact of recent trends in the development of cloud applications and how changing these could better help deployment in challenged networks. The paper also outlines the consequent challenges in bridging different cloud deployments, also known as cross-cloud computing