Interference Automata

We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate the increase in power, in terms of language recognition, of a classical Deterministic Finite Automaton (DFA) when endowed with the facility of optical interference. The question is in the spirit of Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis and J. Watrous, Two-way Finite Automata With Quantum and Classical States, Theoretical Computer Science, 287 (1), 299-311, (2002)] wherein the classical DFA is augmented with a quantum component of constant size. We test the power of 2OIA against the languages mentioned in the above paper. We give efficient 2OIA algorithms to recognize languages for which 2QCFA machines have been shown to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as open questions. Finally we show the existence of a language that cannot be recognized by a 2OIA but can be recognized by an $O(n^3)$ space Turing machine.Comment: 19 pages. A preliminary version appears under the title "On a Model of Computation based on Optical Interference" in Proc. of the 16-th Australasian Workshop on Combinatorial Algorithms (AWOCA'05), pp. 249-26

Bounding Run-Times of Local Adiabatic Algorithms

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic unordered search of van Dam et al. (How powerful is adiabatic quantum computation? Proc. IEEE FOCS, pp. 279-287, 2001) and Roland and Cerf (Physical Review A 65, 042308, 2002) when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in $\log N$, where $N$ is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.Comment: 11 page

Exploring Competitive Collection Usage and Satisfaction Among Students at Yogi Vemana University: A Study

University libraries play a crucial role in providing access to various information resources that are essential for academic and research development. Apart from the regular collection and services, libraries also need to focus on providing resources for competitive exams, as they help students prepare for various competitive exams and enhance their employability skills. This study focused on a specific population of competitive exam aspirants who use the Yogi Vemana University Library competitive exam section. A structured questionnaire was distributed to 200 students from various disciplines, and 192 (96%) responses were used for analysis. The findings indicate that the majority of respondents were male (61.46%) and aged between 21-25 years (35.42%). Most respondents visit the competitive cell once a week (30.21%), with the most popular exam being the Andhra Pradesh Public Service Commission (APPSC) group exams (84.90%). The most widely used type of book is the NET-JRF/SLET exam books (84.90%), and the main difficulty faced by respondents is the availability and currency of materials (73.08%). The purpose of this research is to investigate the usage and satisfaction levels of competitive collections and gain insights into how users use these collections. The study suggests that the university allocates a sufficient budget to the library for the development of competitive exam materials. Regular orientation programs and guest lectures are also recommended to create awareness of accessible online competitive sources and the latest information on competitive exams and better meet the needs and expectations of library users

A comparative study of total intravenous anesthesia with propofol/ketamine and propofol/tramadol combinations in orthopedic outpatient procedures

Background: Propofol opioid/nonopioid combinations provide adequate analgesia during and after surgery. The aim of this study was to compare the effect of anesthesia with propofol/ketamine versus propofol/tramadol on the haemodynamic parameters and pain in patients undergoing orthopaedic outpatient surgical procedures.Methods: Fifty patients with ASA status I-II between the age group of 20-50 years undergoing orthopaedic outpatient surgical procedures under general anesthesia were randomly assigned to propofol/ ketamine (n=25, group I) and propofol/ tramadol (n=25, group II) groups. Patients in group I were induced with propofol 150 μg/kg/min IV and ketamine 50 μg/kg/min IV and in group II induction was performed with propofol 150 μg/kg/min IV and tramadol 1 mg/kg/min. IV. The hemodynamic parameters, oxygen saturation (SpO2), respiration rate, sedation and pain were measured before and after induction at predefined time points and were compared between groups.Results: There was significant difference between groups in systolic blood pressure (SBP), diastolic blood pressure (DBP), heart rate (HR). SBP, DBP and HR were stable in patients induced with propofol/ketamine. The SBP, DBP and HR decreased significantly after induction with propofol/tramadol compared to premedication, but tends to return to normal after 25 minutes. No significant changes in SpO2 found in both the groups at all-time points. Both groups are sedated and showed no difference in pain score with few episodes of unpleasant dreams or hallucinations or adverse complications.Conclusions: Propofol/tramadol anesthesia in patients undergoing orthopaedic procedures provided stable hemodynamic and respiratory stability, sedation and pain reduction as effective as propofol/ketamine anesthesia

Comparative study of theophylline and doxofylline in the treatment of stable chronic obstructive pulmonary disease

Background: COPD is one of the major public health problems worldwide. Theophylline has been used in the treatment of COPD for decades. Doxofylline a new theophylline congener has been claimed to have better safety profile. The study was undertaken to compare theophylline and doxophylline at doses recommended and commonly used in clinical practice.Methods: The study was conducted in patients of COPD in TB chest department of Osmania medical college hospital. It was an open label, randomized, prospective parallel group study of 12 weeks duration. A total of 40 patients were divided in two groups. Group I was administered 400 mg theophylline sustained release tablets once daily orally and group II was administered doxofylline 400 mg twice a day orally. Spirometric variables symptom score, and adverse effects were recorded on days 0, week 1, week 6 and 12 of therapy. Data were compared and statistical analysis was performed using the Prism Graphpad 6, USA.Results: There was no statistically significant difference with respect to spirometric variables and symptom score in the two groups and no significant difference in two groups with respect to side effects (p>0.05).Conclusions: Both doxofylline and theophylline significantly improved spirometric values and there was significant improvement in symptoms – cough, shortness of breath and nocturnal severity of symptoms. There was a significant reduction in the use of at rescue medication during the treatment with both the drugs

Statistical Model Checking for Cops and Robbers Game on Random Graph Models

Cops and robbers problem has been studied over the decades with many variants and applications in graph searching problem. In this work, we study a variant of cops and robbers problem on graphs. In this variant, there are di�erent types of cops and a minimum number of each type of cops are required to catch a robber. We studied this model over various random graph models and analyzed the properties using statistical model checking. To the best of our knowledge this variant of the cops and robber problem has not been studied yet. We have used statistical techniques to estimate the probability of robber getting caught in di�erent random graph models. We seek to compare the ease of catching robbers performing random walk on graphs, especially complex networks. In this work, we report the experiments that yields interesting empirical results. Through the experiments we have observed that it is easier to catch a robber in Barab�asi Albert model than in Erd�os-R�enyi graph model. We have also experimented with k-Regular graphs and real street networks. In our work, the model is framed as the multi-agent based system and we have implemented a statistical model checker, SMCA tool which veri�es agents based systems using statistical techniques. SMCA tool can take the model in JAVA programming language and support Probabilistic - Bounded LTL logic for property specification

Awareness and Utilization of Library Resources and Services by the Students of Sri Sathya Sai Institute of Higher Learning, Anantapur Campus - A Study

The educational system\u27s support for education and research includes the library and information center, which significantly influences how people teach, learn, and conduct research. The present research investigated the extent to which undergraduate and postgraduate students from various departments at Sri Sathya Sai Institute of Higher Learning (SSSIHL), Anantapur Women\u27s Campus, make use of library resources for their academic purposes. The objective of this research is to assess the library resources, services, and facilities available at Sri Sathya Sai Institute of Higher Learning (SSSIHL), specifically at Anantapur, Andhra Pradesh. A comprehensive dataset was obtained from a group of 150 students who participated in the online survey and submitted full responses. The study\u27s result found that the majority of participants 32.67 percent visited the library twice a week. Mostly use the library to obtain books and reference materials, and the resources offered by the library. Approximately 62.67% of the participants visit the library to borrow books and read the competitive materials, and 59.33% of them used the OPAC search tool to find required documents in the library. Furthermore, a significant number of respondents (94.67 percent) consistently relied on subject textbooks for their academic needs. However, the study concluded that the extent of library resource utilization does not have a significant impact on students\u27 academic performance. Based on the study\u27s findings, several recommendations were proposed to enhance library usage. The most prominent suggestion was to acquire more current and pertinent information sources for the library, ensuring that students have access to the latest research and educational materials

Efficient and Reliable Secure Cloud Storage Schema of Block chain for Data De-duplication in Cloud

Minimizing Storage space and bandwidth is a challenging task in cloud computing, duplication is the main key term in cloud computing because of large and multiples of digital data stored in single cloud server. Because of rapid usage and expansion of high amount of data, data de-duplication is a challenging task for removing replica related data which has been stored in cloud to reduce storage and space of bandwidth. Secure de-duplication is also a challenging task in cloud storage environment. Convergent encryption based secure de-duplication approach is used traditionally to explore and identify duplicates from multiple users data with de-duplication sharing and uploading data in cloud environment. Because of large volume data, conventional approaches have not meet practical implementation of de-duplication requirements in cloud storage. So we aim that block chain based cloud storage with data de-duplication is the main problem in distributed file storage environment. For predicting dynamic file de-duplication in file sharing of distributed environment, propose a Novel Block chain based Secure De- duplication Authentication scheme (NBSDAS) with high reliability and confidentiality in which the files are distributed to multiple servers and the information of files is recorded on the time-stamped block chain whose central authorities are replaced to automatically decentralize cloud contracts. This proposed approach combined with genetic algorithm to predict and de-duplication with respect to processing dynamic files individually in cloud computing. Security analysis demonstrates that our de-duplication scheme can achieve the proposed security goals while it has limited overhead proved by simulation experiments with comparison to traditional approaches

THE CHARACTERIZED CONCEPT OF VAGUE CO-FRAMES

In this paper we introduce vague frame, vague co- frames, vague frame generated by frame and investigate some of its basic properties. In particular, some interesting characterizations closely related to the vague co- frames and vague cut sets on vague co-frame are given also studied their properties. Further we investigate the development of some important results and theorems about vague cut sets on vague co-frame