University of Bahrain

About: University of Bahrain is a education organization based out in Madīnat ‘Īsá, Bahrain. It is known for research contribution in the topics: Thin film & Doping. The organization has 1650 authors who have published 3405 publications receiving 48162 citations. The organization is also known as: Bahrain University & UoB.

An International Consortium Update: Pathophysiology, Diagnosis, and Treatment of Polycystic Ovarian Syndrome in Adolescence.

Abstract: This paper represents an international collaboration of paediatric endocrine and other societies (listed in the Appendix) under the International Consortium of Paediatric Endocrinology (ICPE) aiming to improve worldwide care of adolescent girls with polycystic ovary syndrome (PCOS)1. The manuscript examines pathophysiology and guidelines for the diagnosis and management of PCOS during adolescence. The complex pathophysiology of PCOS involves the interaction of genetic and epigenetic changes, primary ovarian abnormalities, neuroendocrine alterations, and endocrine and metabolic modifiers such as anti-Mullerian hormone, hyperinsulinemia, insulin resistance, adiposity, and adiponectin levels. Appropriate diagnosis of adolescent PCOS should include adequate and careful evaluation of symptoms, such as hirsutism, severe acne, and menstrual irregularities 2 years beyond menarche, and elevated androgen levels. Polycystic ovarian morphology on ultrasound without hyperandrogenism or menstrual irregularities should not be used to diagnose adolescent PCOS. Hyperinsulinemia, insulin resistance, and obesity may be present in adolescents with PCOS, but are not considered to be diagnostic criteria. Treatment of adolescent PCOS should include lifestyle intervention, local therapies, and medications. Insulin sensitizers like metformin and oral contraceptive pills provide short-term benefits on PCOS symptoms. There are limited data on anti-androgens and combined therapies showing additive/synergistic actions for adolescents. Reproductive aspects and transition should be taken into account when managing adolescents.

A comparative study of topological properties of hypercubes and star graphs

Abstract: Undertakes a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties are derived for the star graph and are compared with the corresponding properties of the hypercube. Among other results, the authors determine necessary and sufficient conditions for shortest path routing and characterize maximum-sized families of parallel paths between any two nodes of the star graph. These parallel paths are proven of minimum length within a small additive constant. They also define greedy and asymptotically balanced spanning trees to support broadcasting and personalized communication on the star graph. These results confirm the already claimed topological superiority of the star graph over the hypercube. >

Lee distance and topological properties of k-ary n-cubes

Abstract: In this paper, we consider various topological properties of a k-ary n-cube (Q/sub n//sup k/) using Lee distance. We feel that Lee distance is a natural metric for defining and studying a Q/sub n//sup k/. After defining a Q/sub n//sup k/ graph using Lee distance, we show how to find all disjoint paths between any two nodes. Given a sequence of radix k numbers, a function mapping the sequence to a Gray code sequence is presented, and this function is used to generate a Hamiltonian cycle. Embedding the graph of a mesh and the graph of a binary hypercube into the graph of a Q/sub n//sup k/ is considered. Using a k-ary Gray code, we show the embedding of a k(n/sub 1/)/spl times/k(n/sub 2/)/spl times/.../spl times/k(n/sub m/)-dimensional mesh into a Q/sub n//sup k/ where n=/spl Sigma//sub i=l//sup m/n/sub i/. Then using a single digit, 4-ary reflective Gray code, we demonstrate embedding a Q/sub n/ into Q/sub [n/2]//sup 4/. We look at how Lee distance may be applied to the problem of resource placement in a Q/sub n//sup k/ by using a Lee distance error-correcting code. Although the results in this paper are only preliminary, Lee distance error-correcting codes have not been applied previously to this problem. Finally, we consider how Lee distance can be applied to message routing and single-node broadcasting in a Q/sub n//sup k/. In this section we present two single-node broadcasting algorithms that are optimal when single-port and multi-port I/O is used. >