Accidental injection of lignocaine with adrenaline in subarachnoid space: a case report

Drug errors are very common in medical field especially in anaesthesia where it’s the game of drugs. Here, we are presenting a case in which accidentally we injected lignocaine with adrenaline in place of heavy bupivacaine. Patient was of geriatric age group and posted for lower limb surgery under combined spinal epidural anaesthesia after placement of epidural catheter lumber puncture was done and 3ml of lignocaine with adrenaline was injected. After this patient develop complete sensory, motor blockade with hypotension. Level of block was up to T12 level patient was monitored for signs and symptoms of ransient neurologic syndrome (TNS) and anterior spinal artery syndrome for 24 hours. After 24 hours patient develop no complications and posted for surgery under general anaesthesia.so we have to be very careful about the labelling of drugs

Spread and defend infection in graphs

The spread of an infection, a contagion, meme, emotion, message and various other spreadable objects have been discussed in several works. Burning and firefighting have been discussed in particular on static graphs. Graph burning simulates the notion of the spread of "fire" throughout a graph (plus, one unburned node burned at each time-step); graph firefighting simulates the defending of nodes by placing firefighters on the nodes which have not been already burned while the fire is being spread (started by only a single fire source). This article studies a combination of firefighting and burning on a graph class which is a variation (generalization) of temporal graphs. Nodes can be infected from "outside" a network. We present a notion of both upgrading (of unburned nodes, similar to firefighting) and repairing (of infected nodes). The nodes which are burned, firefighted, or repaired are chosen probabilistically. So a variable amount of nodes are allowed to be infected, upgraded and repaired in each time step. In the model presented in this article, both burning and firefighting proceed concurrently, we introduce such a system to enable the community to study the notion of spread of an infection and the notion of upgrade/repair against each other. The graph class that we study (on which, these processes are simulated) is a variation of temporal graph class in which at each time-step, probabilistically, a communication takes place (iff an edge exists in that time step). In addition, a node can be "worn out" and thus can be removed from the network, and a new healthy node can be added to the network as well. This class of graphs enables systems with high complexity to be able to be simulated and studied

Training need assessment of nursing personnel as super specialty tertiary care hospitals in Northern India

Background - Super specialty tertiary care hospital equips nurses with the requisite knowledge and skills to deliver high quality care in their practice areas. This has necessitated adopting a structured approach to the training needs assessment (TNA) to identify the development needs of the nursing workforce at a tertiary care centre. This study involves Micro Level – Task/Job analysis i.e. identifies and describes all the skills performed by employees in a particular job and the knowledge, skills, attitudes and other behaviours needed for successful job performance. Aim and objectives: The study explores the training needs of nursing personnel at super specialty tertiary care hospital in northern India by analyzing the areas of knowledge and skills deficit as perceived by the nurses and assessing the expectations of doctors, about the role of nurses and deficiencies in their current knowledge, skills Design: Structured questionnaire based descriptive cross sectional study Methods: A set of questionnaire were framed using core competencies of nurses listed by Massachusetts department of higher education and nursing council of Hongkong and A questionnaire based descriptive cross sectional study among nurses, faculty, senior residents and patients were done. Results: The total sample collected for the study was 274 which included 19 faculty, 44 senior résidents, 211 nurses. Training needs identified to be further developed for Grade II and grade I nurses both by nurses and doctors are maximum in patient care and research domain followed by managerial/administrative and communication domain. Training needs agreed to be promoted for ANS’s are maximum in managerial/ administrative and communication domain. Training needs recognized for DNS’s /NS/CNO are maximum in managerial/ administrative and research domain followed by communication domain Conclusion – This study reflects the training need assessment of nurses in a super specialty tertiary care hospita

Lattice Linear Problems vs Algorithms

Modelling problems using predicates that induce a partial order among global states was introduced as a way to permit asynchronous execution in multiprocessor systems. A key property of such problems is that the predicate induces one lattice in the state space which guarantees that the execution is correct even if nodes execute with old information about their neighbours. Thus, a compiler that is aware of this property can ignore data dependencies and allow the application to continue its execution with the available data rather than waiting for the most recent one. Unfortunately, many interesting problems do not exhibit lattice linearity. This issue was alleviated with the introduction of eventually lattice linear algorithms. Such algorithms induce a partial order in a subset of the state space even though the problem cannot be defined by a predicate under which the states form a partial order. This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It also introduces a new class of algorithms called (fully) lattice linear algorithms. A characteristic of these algorithms is that the entire reachable state space is partitioned into one or more lattices and the initial state locks into one of these lattices. Thus, under a few additional constraints, the initial state can uniquely determine the final state. For demonstration, we present lattice linear self-stabilizing algorithms for minimal dominating set and graph colouring problems, and a parallel processing 2-approximation algorithm for vertex cover. The algorithm for minimal dominating set converges in n moves, and that for graph colouring converges in n+2m moves. The algorithm for vertex cover is the first lattice linear approximation algorithm for an NP-Hard problem; it converges in n moves. Some part is cut due to 1920 character limit. Please see the pdf for full abstract.Comment: arXiv admin note: text overlap with arXiv:2209.1470

Lattice Linearity in Assembling Myopic Robots on an Infinite Triangular Grid

In this paper, we study the problem of gathering distance-1 myopic robots on an infinite triangular grid. We show that the algorithm developed by Goswami et al. (SSS, 2022) is lattice linear. This implies that a distributed scheduler, assumed therein, is not required for this algorithm: it runs correctly in asynchrony. It also implies that the algorithm works correctly even if the robots are equipped with a unidirectional \textit{camera} to see the neighbouring robots (rather than an omnidirectional one, which would be required under a distributed scheduler). Due to lattice linearity, we can predetermine the point of gathering. We also show that this algorithm converges in $2n$ rounds, which is lower than that ($2.5(n+1)$ rounds) shown in Goswami et al.Comment: arXiv admin note: text overlap with arXiv:2302.0720

THE EFFECT OF UPANAHA SWEDA AND VATARI GUGGULU IN THE MANAGEMENT OF JANUSANDHIGATA VATA (KNEE OSTEOARTHRITIS): A COMPARATIVE STUDY

Every man derives the happiness and benefit of his life through locomotion i.e., using his joints. For the minute if he loses this power of locomotion he not only feels himself a miserable creature but also becomes a burden both of his family and society. The loss or reduction in his locomotive power is due to dysfunction of the joints causing an impediment to his movements. If not treated in time, the disease makes man disable. Sandhigata Vata is most common articular disorder. It is a type of Vata Vyadhi which mainly occurs in Vriddhavastha, due to Dhatukshaya. Sandhigata Vata can be correlated with osteoarthritis (OA) which is one such chronic, degenerative, inflammatory disease and has a great impact on the quality of the life of an individual. Different modalities of treatment have been explained in the classics to tackle the condition effectively. The present study was aimed to assess clinically the effect of Upanaha Sweda and Vatari Guggulu in the management of Janusandhigata Vata. In this study total 42 patients were divided in 2 groups. In Group A, patients were treated with only Upanaha Sweda and other group patients were treated with Upanaha Sweda and Vatari Guggulu. Results obtained were analyzed for statistical significance which shows group B in which Vatari Guggulu and Upanaha Sweda were given, was more effective in bringing relief in signs and symptoms of Janusandhigata Vata

Fetus-in-fetu: A Rare Congenital Anomaly

Two cases of fetus-in-fetu, on which we performed surgery in 2003 and 2006, are being reported. Both the cases presented with a lump in the abdomen. Radiology confirmed the diagnosis. The lumps were found in the retroperitoneum and successfully excised. Because of the rarity of the condition, these two cases are being reported with relevant salient features and are discussed in the light of available literature. Key words: Abdominal lump, axial skeleton, fetus-in-fetu, retroperitoneal, teratom

Multiplication and Modulo are Lattice Linear

In this paper, we analyze lattice linearity of multiplication and modulo operations. We demonstrate that these operations are lattice linear and the parallel processing algorithms that we study for both these operations are able to exploit the lattice linearity of their respective problems. This implies that these algorithms can be implemented in asynchronous environments, where the nodes are allowed to read old information from each other and are still guaranteed to converge within the same time complexity. These algorithms also exhibit properties similar to snap-stabilization, i.e., starting from an arbitrary state, the system follows the trace strictly according to its specification