Vaccines: Propaganda and Practice

Vaccines are a cost effective, time tested means of reducing morbidity and mortality. As more and more new vaccines are introduced and more diseases come under the purview of ‘vaccination net’, the routine immunization program is sidelined.\ud This is compounded by vaccination practices in private health care system and anti vaccine propaganda and confusing pro vaccine propaganda. The primary purpose of the vaccine is shifting from prevention of diseases to monetary gains for the health care providers and manufacturers. There is a need to regulate the vaccination practices in the private health care system especially in the developing countries. The regulatory process should educate not only the community but also the health care providers and take adequate measures to control the ‘vaccine market forces

Creative Design of a Device that not only Cleans the Teeth but also Anti-Germinates

In the past various methods have been found to clean the teeth but until recently not much importance has been given to the anti-germinating idea. After analyzing the causes of tooth decay the importance of anti-germinating has been found. Now there are various devices available to clean and anti-germinate the teeth but a system that combines both cleaning and anti-germinating has not been produced on a mass scale yet. In this report we first study the history and evolution of cleaning the teeth. Then the various devices and chemicals used today to clean the teeth are analyzed. This is followed by the project analysis. Some designs that could provide a solution for the problem are found. Out of this the best design is found out considering factors like effort required, cost, efficiency, time. The various possible subsystems of the device are listed. The morphological analysis is then done. The most efficient and cost effective combination of subsystems is selected .This is the solution for the problem. The specification and size of the parts of the device is also given

Co-Scheduling Algorithms for High-Throughput Workload Execution

This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem, and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to to faster workload completion time and to faster response times on average (hence increasing system throughput and saving energy), for significant benefits over traditional scheduling from both the user and system perspectives

An Advanced Caching Solution to Cluster Storage Environment

Clustered storage is the deployment of multiple data servers working together to improve reliability, capacity and performance. Clustering divides workloads to every storage server to control and monitor workload transfer and file access between servers without taking into account of the physical location of the file. Solid State Drives (SSD) can be considered as a more sophisticated version of a USB memory stick since the memory stick does not have any moving part associated with it and moreover, data is stored in microchips. In this paper, we give an overview of an advanced caching solution to improve IO and application performance by using flash storage in cluster storage environment. It is a cluster storage solution with two highly scalable servers with optimizations to ensure fast service failovers and deploying one or two solid state drives as the cache devices for faster and better performance. The software supports write-back caching policy where both read and write requests on hot regions of drivesare cached. With write-back, write requests to the hot regions are acknowledged immediately after it is written to the cache device and this (dirty) data will be flushed to back-end virtual drive in the background. Flushing of dirty data will be performed by the flush manager of the software under different scenarios like amount dirty data reaches a threshold, IO activity during a time interval is low etc. The solution effectively harnesses the flash storage performance potential by retaining only frequently accessed data in flash for quick retrieval. The solution provides unmatched efficiency, performance, support and reliability for enterprises or storage world

GROUNDWATER CHEMICAL STUDIES USING STATISTICAL ANALYSIS IN COIMBATORE CORPORATION, TAMIL NADU, INDIA

In place with comprehend the hydrochemistry and the probable contamination of groundwater for drinking and irrigation purposes, 60 groundwater samples have been collected from Coimbatore Corporation region in march 2014 and various physicochemical parameters (pH, EC, TDS, Alkalinity, TH, Ca2+, Mg2+, Na+, K+, Fe2+, NH3, NO2-, NO3-, Cl-, F-, SO42- and PO42-) were analysed. The concentrations of physiochemical parameters in the studied samples were compared with the WHO standards to study the suitability of water for drinking purpose. The statistical analysis  “Q-mode factor†and “cluster analyses†were carried out and found that geology and exchange between the river water and the groundwater plays a dominant role in the hydro chemical evolution of groundwater. Cluster tree diagram reveals that 41.67% of the study area comes under cluster I, II and III classification. Cluster tree clearly reveals that elevation high automatically geochemical concentration is low. The geochemical concentration is inversely proposed to elevation. A long term management strategy should be formulated for the protection of groundwater resources for drinking and agricultural activities

Implementation of Distributed Time Exchange Based Cooperative Forwarding

In this paper, we design and implement time exchange (TE) based cooperative forwarding where nodes use transmission time slots as incentives for relaying. We focus on distributed joint time slot exchange and relay selection in the sum goodput maximization of the overall network. We formulate the design objective as a mixed integer nonlinear programming (MINLP) problem and provide a polynomial time distributed solution of the MINLP. We implement the designed algorithm in the software defined radio enabled USRP nodes of the ORBIT indoor wireless testbed. The ORBIT grid is used as a global control plane for exchange of control information between the USRP nodes. Experimental results suggest that TE can significantly increase the sum goodput of the network. We also demonstrate the performance of a goodput optimization algorithm that is proportionally fair.Comment: Accepted in 2012 Military Communications Conferenc

Formalization of SOA concepts with mathematical foundation

With the development of the IT industry, agility and dynamicity are the two expected characteristics from any business enterprise. Service oriented architecture (SOA) is emerging as a promising approach aiming to address the current trends/needs of enterprise business applications. The current work aims at giving an overview of the conceptual model of SOA based on set theory approach. Also, it posits mathematical definitions for service, logical service, environment service and application definition with the help of general systems theory and mathematical foundation. With the help of mathematical model, the definition and functionality of services enhances SOA principles which can be used efficiently in integrating heterogeneous components

Co-scheduling algorithms for high-throughput workload execution

International audienceThis paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem , and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to faster workload completion time (40% improvement on average over traditional scheduling) and to faster response times (50% improvement). Hence co-scheduling increases system throughput and saves energy, leading to significant benefits from both the user and system perspectives

Co-scheduling algorithms for cache-partitioned systems

Cache-partitioned architectures allow subsections of theshared last-level cache (LLC) to be exclusively reserved for someapplications. This technique dramatically limits interactions between applicationsthat are concurrently executing on a multi-core machine. Consider n applications that execute concurrently, with the objective to minimize the makespan, defined as the maximum completion time of the n applications.Key scheduling questions are: (i) which proportionof cache and (ii) how many processors should be given to each application?Here, we assign rational numbers of processors to each application,since they can be shared across applications through multi-threading.In this paper, we provide answers to (i) and (ii) for perfectly parallel applications.Even though the problem is shown to be NP-complete, we give key elements to determinethe subset of applications that should share the LLC(while remaining ones only use their smaller private cache). Building upon these results,we design efficient heuristics for general applications.Extensive simulations demonstrate the usefulness of co-schedulingwhen our efficient cache partitioning strategies are deployed

Implantless press fit graft fixation technique at Patella for MPFL reconstruction

Patellofemoral instability is one of the most prevalent knee disorders in adolescents. It is often multifactorial and complex. Often accompanied by insufficiency or tear of MPFL ligament. MPFL is primary soft tissue stabiliser of patella and acts as checkrein of lateral patella dislocation. There have been variations in surgical techniques including different choices of surgical techniques, graft material and fixation methods, despite these there is no conclusive evidence that a particular surgical option is superior to another. Recurrent Patella instability requires individualised surgical planning . In this article we present a surgical technique which is implantless socket type of press-fit fixation at patella