Optimal Path Searching through Specified Routes using different Algorithms

To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive search and analyzed their results. The given problem is similar to Travelling Salesman Problem. Exhaustive search is a best algorithm to solve this problem as it checks each and every possibility and give the accurate result but it is an impractical solution because of huge time consumption. If no. of objects increased from 12 it takes hours to search the shortest path. Simulated annealing is emerged with some promising results with lower time cost. As of probabilistic nature, Simulated annealing could be non optimal but it gives a near optimal solution in a reasonable duration. Greedy algorithm is not a good choice for this problem. So, simulated annealing is proved best algorithm for this problem. The project has been implemented in C-language which takes input and store output in an Excel Workbook

Effects of computer reminders on complications of peripheral venous catheters and nurses' adherence to a guideline in paediatric care : a cluster randomised study

BACKGROUND: Reminder systems in electronic patient records (EPR) have proven to affect both health care professionals' behaviour and patient outcomes. The aim of this cluster randomised trial was to investigate the effects of implementing a clinical practice guideline (CPG) for peripheral venous catheters (PVCs) in paediatric care in the format of reminders integrated in the EPRs, on PVC-related complications, and on registered nurses' (RNs') self-reported adherence to the guideline. An additional aim was to study the relationship between contextual factors and the outcomes of the intervention. METHODS: The study involved 12 inpatient units at a paediatric university hospital. The reminders included choice of PVC, hygiene, maintenance, and daily inspection of PVC site. Primary outcome was documented signs and symptoms of PVC-related complications at removal, retrieved from the EPR. Secondary outcome was RNs' adherence to a PVC guideline, collected through a questionnaire that also included RNs' perceived work context, as measured by the Alberta Context Tool. Units were allocated into two strata, based on occurrence of PVCs. A blinded simple draw of lots from each stratum randomised six units to the control and intervention groups, respectively. Units were not blinded. The intervention group included 626 PVCs at baseline and 618 post-intervention and the control group 724 PVCs at baseline and 674 post-intervention. RNs included at baseline were 212 (65.4 %) and 208 (71.5 %) post-intervention. RESULTS: No significant effect was found for the computer reminders on PVC-related complications nor on RNs' adherence to the guideline recommendations. The complication rate at baseline and post-intervention was 40.6 % (95 % confidence interval (CI) 36.7-44.5) and 41.9 % (95 % CI 38.0-45.8), for the intervention group and 40.3 % (95 % CI 36.8-44.0) and 46.9 % (95 % CI 43.1-50.7) for the control. In general, RNs' self-rated work context varied from moderately low to moderately high, indicating that conditions for a successful implementation to occur were less optimal. CONCLUSIONS: The reminders might have benefitted from being accompanied by a tailored intervention that targeted specific barriers, such as the low frequency of recorded reasons for removal, the low adherence to daily inspection of PVC sites, and the lack of regular feedback to the RNs. TRIAL REGISTRATION: Current Controlled Trials ISRCTN44819426.