An experience with double puncture laparoscopy in sterilization camps

Background: For tubal sterilization the common technique preferred in sterilization camps by government institutions is minilap (modified Pomeroy’s) technique as it is safe and has minimal complications. There are few published articles in India where Double Puncture Laparoscopic technique is used in sterilization camps as it needs expertise. In the present study we would like to share our experience with double puncture laparoscopy (DPL) technique in sterilization camps. The aim of the study is to assess the failure rates and complications of double puncture laparoscopy (DPL) technique in sterilization camps.Methods: Laparoscopic sterilization camps were held in urban, rural and tribal areas from April 2010 to March 2015 and a total of 9,218 cases were done .The failure rates and complications were recorded and analyzed.Results: Failure rate was seen in 0.13% of cases. Technical failure was mainly due to adhesions (0.06%) followed by pelvic inflammatory disease (0.03%).The commonest complication encountered was infection at the port site (0.9%)and bleeding from port site(0.66%).Conclusions: Laparoscopic sterilization by falope rings is getting more and more popular in our country. A camp approach is the best way of managing large number of women requiring sterilization in rural and tribal areas. Camp organization by a person experienced in laparoscopy and management of any complications that may arise makes the camps a safe alternative to modified Pomeroy’s.

An Efficient Storage Mechanism to Distribute Disk Load in a VoD Server

In this paper, a storage mechanism is devised to balance the load and to provide immediate service to the clients with a start-up delay of 2ms to 7 ms. The video storage is based on the probability of the clients requesting for the video. Videos with higher probability of being requested are stored and replicated to ensure guaranteed retrieval. Parity generation scheme is employed to provide reliability to non-popular videos. The system is also capable of handling disk failures transparently and thereby providing a reliable service to the clients

An Integrated Quality-of-Service Model for Video-on-Demand Application.

The tremendous growth of the Internet paradigm has given rise to Quality of Service (QoS) problems in heterogeneous, ubiquitous, distributed real time applications such as video-on-Demand (VoD). The challenging task in VoD applications is to satisfy diverse client requests for discrete videos with restrained resources by invoking versatile QoS schemes. In this paper, a hybrid QoS strategy, which is a combination of batching and recursive patching is implemented in the local server to ensure starvation-free resource management thereby enhancing the throughput. Batching shares network resources efficiently whereas recursive patching is adopted to reduce the time difference between the requests. The suggested algorithm delivers the complete video to the users based on one of the three communication channels: broadcast, multicast and unicast depending on whether the video is very popular, average popular and least popular respectively. The experimental results show that our strategy accomplishes 35% - 40% reduction in terms of blocking ratio and throughput is 10% - 15% higher than the Poon’s strategy, which guarantees that not only the resources are efficiently utilized but also a suitable Quality of Service is provided to each user

Design of Techniques to Enhance the Services for Mobile Video-on-Demand Applications

The current generation of mobile clients have incessant demand for services. Providing Video-on-Demand (VoD) services to these clients require a new paradigm. This paper presents an architecture for Mobile Video-on-Demand. Several schemes that reduces the load on the video server, thereby increasing the number of requests that need to be served is proposed. The Distributed Indexing reduces the storage load on the server and reduces the time to search for a video. The Chaining Technique increases the acceptance of requests and thereby reduces the rejection rate. Two types of hand-offs are defined :Video Server Hand-off and a Client Hand-off. These provide the continuity of services to the mobile clients. The Windowing Scheme which includes Session Management is proposed. This scheme control the flow of segments. All these schemes have been simulated and the results are presente

Correlation between ultrasound-guided subglottic diameter and little finger breadth with the outer diameter of the endotracheal tube in paediatric patients – A prospective observational study

Background and Aims: Selection of an appropriate endotracheal tube (ETT) in paediatric patients is a challenging situation. The purpose of this study was to compare whether measurement of subglottic diameter with ultrasound or the age-old little finger width correlates better with the outer diameter (OD) of the ETT used for intubation. Methods: Following approval from the Institutional Ethics board and a written informed consent from parent or guardian, this prospective observational study was carried out on 60 American Society of Anesthesiologists physical status I and II patients aged 6 months–8 years, scheduled for elective surgery under general anaesthesia requiring oral endotracheal intubation. Preoperatively ultrasound-guided subglottic diameter (USGD) and little finger breadth (LFB) measurements were taken. On the day of surgery, intubation was done with an uncuffed ETT, whose OD was noted. The concordance and agreeability between two techniques for estimation of the OD of the ETT were measured by Lin's concordance correlation coefficient. Further, the bias and precision between the techniques and the inter-changeability of the techniques were assessed by using Bland and Altman and Mountain plotting, respectively. Results: Lin's concordance correlation coefficient between USGD and LFB with the OD of the ETT was found to be 0.29 (0.13–0.41) and 0.46 (0.29–0.6), respectively. Conclusion: Overall, neither USGD nor LFB can be used as a reliable tool to predict the OD of the ETT. Registered in Clinical Trial Registry of India. REF/2016/08/011955

Data sharing strategy for guaranteeing quality-of-service in VoD application

The phenomenal growth in the distributed multimedia applications has accelerated the popularity of Video-on-Demand (VoD) system. The vital task of multimedia applications is to satisfy diverse client's request for distinct video with confined resources by using assorted Quality-of-Service (QoS) procedures. In this paper a fusion of data sharing techniques like batching and recursive patching is applied in the local server for ensuring Quality-of-Service to the clients and enabling higher throughput. The network resources are apportioned appropriately using batching and the time difference between the requests is minified by recursive patching. The suggested algorithm renders the entire video to the clients using true VoD, near VoD using multicast or broadcast scheme depending on popularity of the video. The experimental results indicate that our approach accomplishes 2 reduction in blocking ratio and throughput is 10 - 15 greater than the Poon's strategy 15, which depicts that not only the resources are efficiently utilized but also a suitable Quality-of-Service is provided to each client. ©2006 IEEE

Determination of Optimal Buffer Allotment for Video-on-Demand Server

The tremendous growth of Internet in popularity especially in the domains of entertainment, education and business had lead to the research on various alternatives to improve the performance of the Video-on-Demand system. The challenge in Video-on-Demand application is to stream uninterrupted, synchronous multimedia data from a video server to a client by utilizing the available resources like bandwidth (channel) and buffer appropriately. The quantity of resource required increases with the increase in the number of clients. As the number of clients increase, the server will reach a limit on the storage capacity. In case of further increase in the load, new servers are to be added which further incurs additional cost. In this context managing the buffer and the channel effectively enables faster retrieval and transfer of multimedia data by providing suitable Quality-of-Service to the client. In this paper, we propose an efficient method to allocate buffer in the local server by using channels in proportion to the popularity of the video. The algorithm reduces start-up latency and reneging probability by utilizing both the channels and buffer effectively thereby the videos are downloaded faster reducing the blocking ratio of the requested video. The results m

Efficient channel allocation based on priority of the video in VoD systems

Today's technology offers easy access to multimedia services through high-speed communication networks. A Video-on-Demand (VoD) service allows customers to connect to an on-line video server and asynchronously watch videos. A Video-on-Demand system is typically implemented by Client-Server architecture. This paper presents a scheme of channel allocation based on priority of the requested video, to increase efficient channel utilization and lower the download time. This allocation scheme shows better performance when compared to conventional way of allocating channels