42 research outputs found

    Decoding X-ray observations from centres of galaxy clusters using MCMC

    Full text link
    We correct for the use of electron densities instead of total gas density in the pressure fits which were used to derive the local free-fall times (tff_{\rm ff}) in the original paper

    Role of Optical Network in Cloud/Fog Computing

    Get PDF
    This chapter is a study of exploring the role of the optical network in the cloud/fog computing environment. With the growing network issues, unified and cost-effective computing services and efficient utilization of optical resources are required for building smart applications. Fog computing provides the foundation platform for implementing cyber-physical system (CPS) applications which require ultra-low latency. Also, the digital revolution of fog/cloud computing using optical resources has upgraded the education system by intertwined VR using the fog nodes. Presently, the current technologies face many challenges such as ultra-low delay, optimum bandwidth, and minimum energy consumption to promote virtual reality (VR)-based and electroencephalogram (EEG)-based gaming applications. Ultra-low delay, optimum bandwidth, and minimum energy consumption. Therefore, an Optical-Fog layer is introduced to provide a novel, secure, highly distributed, and ultra-dense fog computing infrastructure. Also, for optimum utilization of optical resources, a novel concept of OpticalFogNode is introduced that provides computation and storage capabilities at the Optical-Fog layer in the software defined networking (SDN)-based optical network. It efficiently facilitates the dynamic deployment of new distributed SDN-based OpticalFogNode which supports low-latency services with minimum energy as well as bandwidth usage. Therefore, an EEG-based VR framework is also introduced that uses the resources of the optical network in the cloud/fog computing environment

    Optimizing the scheduling of electrified public transport system in Malta

    Get PDF
    In this paper, we describe a comparative analysis of a bus route scheduling problem as part of timetable trips. We consider the current uptake of electric buses as a viable public transportation option that will eventually phase out the diesel-engine-based buses. We note that, with the increasing number of electric buses, the complexity related to the scheduling also increases, especially stemming from the charging requirement and the dedicated infrastructure behind it. The aim of our comparative study is to highlight the brevity with which a multi-agent-system-based scheduling method can be helpful as compared to the classical mixed-integer linear-programming-based approach. The multi-agent approach we design is centralized with asymmetric communication between the master agent, the bus agent, and the depot agent, which makes it possible to solve the multi-depot scheduling problem in almost real time as opposed to the classical optimizer, which sees a multi-depot problem as a combinatorial heuristic NP-hard problem, which, for large system cases, can be computationally inefficient to solve. We test the efficacy of the multi-agent algorithm and also compare the same with the MILP objective designed in harmony with the multi-agent system. We test the comparisons first on a small network and then extend the scheduling application to real data extracted from the public transport of the Maltese Islands.peer-reviewe

    Accelerated surgery versus standard care in hip fracture (HIP ATTACK): an international, randomised, controlled trial

    Get PDF

    The development and validation of a scoring tool to predict the operative duration of elective laparoscopic cholecystectomy

    Get PDF
    Background: The ability to accurately predict operative duration has the potential to optimise theatre efficiency and utilisation, thus reducing costs and increasing staff and patient satisfaction. With laparoscopic cholecystectomy being one of the most commonly performed procedures worldwide, a tool to predict operative duration could be extremely beneficial to healthcare organisations. Methods: Data collected from the CholeS study on patients undergoing cholecystectomy in UK and Irish hospitals between 04/2014 and 05/2014 were used to study operative duration. A multivariable binary logistic regression model was produced in order to identify significant independent predictors of long (> 90 min) operations. The resulting model was converted to a risk score, which was subsequently validated on second cohort of patients using ROC curves. Results: After exclusions, data were available for 7227 patients in the derivation (CholeS) cohort. The median operative duration was 60 min (interquartile range 45–85), with 17.7% of operations lasting longer than 90 min. Ten factors were found to be significant independent predictors of operative durations > 90 min, including ASA, age, previous surgical admissions, BMI, gallbladder wall thickness and CBD diameter. A risk score was then produced from these factors, and applied to a cohort of 2405 patients from a tertiary centre for external validation. This returned an area under the ROC curve of 0.708 (SE = 0.013, p  90 min increasing more than eightfold from 5.1 to 41.8% in the extremes of the score. Conclusion: The scoring tool produced in this study was found to be significantly predictive of long operative durations on validation in an external cohort. As such, the tool may have the potential to enable organisations to better organise theatre lists and deliver greater efficiencies in care

    Cross-terms allocation of line losses using game theory

    No full text
    The power loss on a branch are the function of power flows which are caused by various participants present in the network and it varies nearly quadratic with respect to these power flows. There are several methods present in literature to unbundle or allocate the branch power losses based on different assumptions. In this paper, three game theoretic models are presented and compared, namely, Nash equilibrium, Shapley value and nucleolus, so as to allocate the cross-terms in branch power flow to each participant of the network. Additionally, these game theoretic models are compared with some of the classical methods present in the literature. Further, it is observed that all these game theoretic models give the same solution for the allocation of the branch losses. It satisfies all the axioms of fairness and provide unbiased solution for loss allocation. The results are discussed and illustrated using an example

    Formation of Bidding Zones Based on Linear Bottleneck Games

    No full text

    Decomposition of Settlement Residues Using Loss Compensated DC-OPF Model

    No full text
    corecore