107 research outputs found

    Assessment of Response Time for New Multi Level Feedback Queue Scheduler

    Full text link
    Response time is one of the characteristics of scheduler, happens to be a prominent attribute of any CPU scheduling algorithm. The proposed New Multi Level Feedback Queue [NMLFQ] Scheduler is compared with dynamic, real time, Dependent Activity Scheduling Algorithm (DASA) and Lockes Best Effort Scheduling Algorithm (LBESA). We abbreviated beneficial result of NMLFQ scheduler in comparison with dynamic best effort schedulers with respect to response time.Comment: 7 pages, 5 figure

    Proximate composition, calcium and phosphorus contents of five varieties of deep sea fishes of Andhra coast

    Get PDF
    Five varieties of deep sea fishes Psenes Indicus, Decapterus day/, Priacanthus sp. Centrolophus niger and deep sea pink prawn (Solenocera hextii) were collected from the deep-sea fishing vessels of Fishery Survey of India from VIsakhapatnam base. These were analysed for their proximate composition, calcium and phosphorus contents in the edible muscle portions. Sensory evaluation of the edible muscle of these fishes was carried out and found to be tasty and acceptable. The fat content is very high in these deep-sea fishes and they deserve consideration while developing suitable processing techniques

    Towards Communication-Efficient Quantum Oblivious Key Distribution

    Get PDF
    Oblivious Transfer, a fundamental problem in the field of secure multi-party computation is defined as follows: A database DB of N bits held by Bob is queried by a user Alice who is interested in the bit DB_b in such a way that (1) Alice learns DB_b and only DB_b and (2) Bob does not learn anything about Alice's choice b. While solutions to this problem in the classical domain rely largely on unproven computational complexity theoretic assumptions, it is also known that perfect solutions that guarantee both database and user privacy are impossible in the quantum domain. Jakobi et al. [Phys. Rev. A, 83(2), 022301, Feb 2011] proposed a protocol for Oblivious Transfer using well known QKD techniques to establish an Oblivious Key to solve this problem. Their solution provided a good degree of database and user privacy (using physical principles like impossibility of perfectly distinguishing non-orthogonal quantum states and the impossibility of superluminal communication) while being loss-resistant and implementable with commercial QKD devices (due to the use of SARG04). However, their Quantum Oblivious Key Distribution (QOKD) protocol requires a communication complexity of O(N log N). Since modern databases can be extremely large, it is important to reduce this communication as much as possible. In this paper, we first suggest a modification of their protocol wherein the number of qubits that need to be exchanged is reduced to O(N). A subsequent generalization reduces the quantum communication complexity even further in such a way that only a few hundred qubits are needed to be transferred even for very large databases.Comment: 7 page

    One-pot synthesis of orthogonally protected dipeptide selenazoles employing Nα-amino selenocarboxamides and α-bromomethyl ketones

    Get PDF
    A simple and efficient protocol for the synthesis of selenazole containing dipeptidomimetics using Nα-amino selenocarboxamides and α-bromomethyl ketones is described. All the compounds made were isolated in good yields and fully characterized. © 2014 Elsevier Ltd

    CASE REPORT: Chorangiophagus Parasiticus: A Rare Case Report

    Get PDF
    Malformations are common in twin pregency compared to singleton pregnancy. One such rare anomaly is Chorangiophagus parasiticus also known as twin to twin transfusion which is an asymmetric abnormality of monozygotic twins, where asymmetric twin survive by parasitisizing normal twin. It’s a rare condition with an incidence of 1 in 35.000 deliveries. We report such a case with complete autopsy findings

    Utilisation of blood clam Anadara granosa

    Get PDF
    Blood clam (Anadara granosa) forms a fishery of considerable magnitude in the Kakinada Bay where an estimated 20001 are landed annually. Ini addition culture technology for blood clam has been standardised In India, throwing open the possibility of large scale farming of this species. Presently clam meat is burnt along with shell to produce lime. In order to optimise the utilisation Of blood clam as against the existing gross under utilisation Kakinada Research Centre of CIFT has developed the technologies for Icing, freezing and canning of the clam. A pickled product and sausage are the other products developed by the Centre. The paper describes the technologies developed for utilisation of blood clam

    Magneto-Optic Field Coupling in Optical Fiber Bragg Gratings

    Get PDF
    The invention is a magneto-optic coupled magnetic sensor that comprises a standard optical fiber Bragg grating system. The system includes an optical fiber with at least one Bragg grating therein. The optical fiber has at least an inner core and a cladding that surrounds the inner core. The optical fiber is part of an optical system that includes an interrogation device that provides a light wave through the optical fiber and a system to determine the change in the index of refraction of the optical fiber. The cladding of the optical fiber comprises at least a portion of which is made up of ferromagnetic particles so that the ferromagnetic particles are subject to the light wave provided by the interrogation system. When a magnetic field is present, the ferromagnetic particles change the optical properties of the sensor directly

    Two-tape finite automata with quantum and classical states

    Full text link
    {\it Two-way finite automata with quantum and classical states} (2QCFA) were introduced by Ambainis and Watrous, and {\it two-way two-tape deterministic finite automata} (2TFA) were introduced by Rabin and Scott. In this paper we study 2TFA and propose a new computing model called {\it two-way two-tape finite automata with quantum and classical states} (2TQCFA). First, we give efficient 2TFA algorithms for recognizing languages which can be recognized by 2QCFA. Second, we give efficient 2TQCFA algorithms to recognize several languages whose status vis-a-vis 2QCFA have been posed as open questions, such as Lsquare={anbn2nN}L_{square}=\{a^{n}b^{n^{2}}\mid n\in \mathbf{N}\}. Third, we show that {anbnknN}\{a^{n}b^{n^{k}}\mid n\in \mathbf{N}\} can be recognized by {\it (k+1)(k+1)-tape deterministic finite automata} ((k+1)(k+1)TFA). Finally, we introduce {\it kk-tape automata with quantum and classical states} (kkTQCFA) and prove that {anbnknN}\{a^{n}b^{n^{k}}\mid n\in \mathbf{N}\} can be recognized by kkTQCFA.Comment: 25 page
    corecore