Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs

We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a perfect matching or not and (2) a unique perfect matching or not, are in the logspace complexity class \SPL. Since \SPL\ is contained in the logspace counting classes \oplus\L (in fact in \modk\ for all $k\geq 2$), \CeqL, and \PL, our upper bound places the above-mentioned matching problems in these counting classes as well. We also show that the search version, computing a perfect matching, for this class of graphs is in \FL^{\SPL}. Our results extend the same upper bounds for these problems over bipartite planar graphs known earlier. As our main technical result, we design a logspace computable and polynomially bounded weight function which isolates a minimum weight perfect matching in bipartite graphs embedded on surfaces of constant genus. We use results from algebraic topology for proving the correctness of the weight function.Comment: 23 pages, 13 figure

Sleep Apnea: More than Just a Noise

Obstructive sleep apnea is a sleep disorder of airflow at the nose and mouth during sleep. Patients with undiagnosed sleep apnea represent a major public health problem. Dentalprofessionals have a unique doctor patient relationship that can help them in recognizing the sleep disorder and managing the patients along with a physician or a sleep specialist. Oral appliance therapy is an important treatment modality for sleep apnea patients. This article discusses the etiology, clinical features, diagnosis and various treatment options with special reference to oral appliances used for obstructive sleep apne

Use of Artificial Neural Network for pre Design Cost Estimation of Building Projects

The motive of this study is to apply Artificial neural network (ANN) for pre design cost estimation of building projects to investigate and overcome problems of cost estimation at initial stages of building construction. And develop & test a Graphical User Interface (GUI) model of cost estimating for reinforced concrete buildings in the early design phase. An ANN GUI model can help the designers in taking decisions about implementation of the project at the initial phases of the design process

Perceptual and Acoustical assessment of voice in children with cleft lip and palate

BACKGROUND: The speech of individuals with cleft lip and palate is primarily characterized by nasality of oral speech because of cleft and or velopharyngeal dysfunction. OBJECTIVES: The aim of the present study is to investigate the acoustical assessment and perceptual rating measurements in cleft lip and palate children. METHODS: The study participants included 30 children with cleft lip and palate in the age range of 4 to 12 years. Prior parental consent was obtained for the inclusion of their children in the study. Speech samples of all the l the participants were recorded. Prerecorded speech samples of the individuals of the CLP groups were mixed and randomized and played,using headphone conditions in a quiet room. The SLPs speech language pathologists rated the nasality of the participant. Samples given for perceptual evaluation are 15 phonation samples of /ă/, /ɪ/ and /ŭ/ vowels vowel, 15 conversation samples and 30 subjects (3 oral sentences each so total 90 sentences). RESULTS: For the Phonation sample, SLP must evaluate the presence of hypernasality by Wilcoksons nasality scale. Acoustic analysis was done using PRAAT software. The spectral and temporal parameters were measured. The Kappa coefficient was 0.88 for inter-rater reliability for nasality rating scale, 0.82 for speech intelligibility,1.02 for speech understandability,1.00 for speech acceptability, which suggests substantial agreement between the raters for four different rating scales. CONCLUSION: Thus, to conclude in children with cleft lip and palate both acoustical and perceptual evaluation plays an important role while assessing the speech domain by using different kinds of speech stimuli

Combined orthodontics and surgical approach to class III malocclusion with anterior open bite in adults

Skeletal anterior open bite with Class III malocclusion in adults is one of the most difficult malocclusions to treat. Surgical intervening is a must, along with orthodontics in such complex cases. The most effective treatment option in adult patients with Class III malocclusion and the skeletal anterior open bite is surgical repositioning of the maxilla or both jaws. The present case report describes the treatment protocol for Class III malocclusion with an anterior open bite in adult, a novel orthodontic- surgical approach. A 24-year old male patient with a Class III malocclusion, anterior open bite (skeletal), poor facial aesthetics, mandibular and chin protrusion. The objective was to achieve ideal overjet and overbite, to achieve class 1 incisor, canine and molar relation. To correct anterior open bite and achieve Class I skeletal jaw bases and to achieve esthetically pleasing profile and functionally stable occlusion. Therefore, by correction of the dental and skeletal jaw relationship, we hoped to improve the patient’s self- esteem, confidence and improved oral health quality of life

New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs

We obtain the following new simultaneous time-space upper bounds for the directed reachability problem. (1) A polynomial-time, O(n^{2/3} * g^{1/3})-space algorithm for directed graphs embedded on orientable surfaces of genus g. (2) A polynomial-time, O(n^{2/3})-space algorithm for all H-minor-free graphs given the tree decomposition, and (3) for K_{3,3}-free and K_5-free graphs, a polynomial-time, O(n^{1/2 + epsilon})-space algorithm, for every epsilon > 0. For the general directed reachability problem, the best known simultaneous time-space upper bound is the BBRS bound, due to Barnes, Buss, Ruzzo, and Schieber, which achieves a space bound of O(n/2^{k * sqrt(log(n))}) with polynomial running time, for any constant k. It is a significant open question to improve this bound for reachability over general directed graphs. Our algorithms beat the BBRS bound for graphs embedded on surfaces of genus n/2^{omega(sqrt(log(n))}, and for all H-minor-free graphs. This significantly broadens the class of directed graphs for which the BBRS bound can be improved

Mind Control Robotic Arm: Augmentative and Alternative Communication in the Classroom Environment

In recent years, technological advancements have greatly benefited the field of prosthetics. A large number of disabled people depend on prosthetics because they are an important technology. In order to provide augmentative and alternative methods of communication to these disabled people with various neuromuscular disorders, we must make sure they are provided with appropriate equipment to express themselves. Different types of arms are evaluated under robotic technology in terms of resistance, usability, flexibility, cost, and potential (such as robotic, surgical, bionic, prosthetic, and static arms). The main problems with these techniques are their high cost, the difficulty of installing and maintaining them, and the possibility of requiring surgery may arise. As a result, this paper is going to provide a description of the idea for combining an EEG controlled smart prosthetic arm with a smart robotic hand. An electrode headset is used to capture the signals from the robotic hand in order to control the device. Creating a robot arm that can help disabled people lead a more independent life is the main objective of this paper