Search results for: p-hub median problem

Authors: Sourabh Joshi, Tarun Sharma, Anurag Sharma

Abstract:

Ant Colony Optimization is heuristic Algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Two variants of Ant Colony Optimization algorithm named Ant System and Max-Min Ant System are implemented in MATLAB to solve travelling Salesman Problem and the results are compared. In, this paper both systems are analyzed by solving the some Travelling Salesman Problem and depict which system solve the problem better in term of cost and time.

Keywords: Ant Colony Optimization, Travelling Salesman Problem, Ant System, Max-Min Ant System

Procedia PDF Downloads 483

Authors: Boris Melnikov, Dmitrii Chaikovskii, Elena Melnikova

Abstract:

The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix.

Keywords: optimization problems, DNA matrix, partially filled matrix, traveling salesman problem, heuristic algorithms

Procedia PDF Downloads 150

Authors: Cleto J. Sauer Jr., Rita C. Sauer, Chaider G. Andrade, Dóris F. Rabelo

Abstract:

Some patients with COVID-19 disease and difficult airway characteristics undergo to endotracheal intubation (ETI) procedure. The tracheal introducer, known as the bougie guide, can aid ETI in patients with difficult airway pattern. Realistic simulation (RS) is a methodology utilized for healthcare professionals training. To improve skills in using the bougie guide of physicians from Recôncavo da Bahia region in Brazil, during COVID-19 outbreak, RS training was carried out. Simulated scenario included the Nasco Lifeform realistic simulator for ETI and a bougie guide introducer. Training was a capacitation program organized by the Health Department of Bahia State. Objective: To report effects in participants´ self-confidence perception for using bougie guide after a RS based training. Methods: Descriptive study, secondary data extracted from questionnaires. Priority workplace and previous knowledge about bougie were reported on a preparticipation formulary. Participants also completed pre- and post-training qualitative self-assessment (10-point Likert scale) regarding to self-confidence in using bougie guide. Distribution analysis for qualitative data was performed with Wilcoxon Signed Rank Test, and self-confidence increase analysis in frequency contingency tables with Fisher's exact test. Results: From May to June 2020 a total of 36 physicians participated of training, 25 (69%) from primary care setting, 32 (89%) with no previous knowledge about the bougie guide utilization. For those who had previous knowledge about bougie pre-training self-confidence median was 6,5, and 2 for participants who had not. In overall there was an increase in self-confidence median for bougie utilization. Median (variation) before and after training was 2.5 (1-7) vs. 8 (4-10) (p <0.0001). Among those who had no previous knowledge about bougie (n = 32) an increase in self-confidence greater than 3 points for bougie utilization was reported by 31 vs. 1 participants (p = 0.71). Conclusions: Most of participants had no previous knowledge about using the bougie guide. RS training contributed to self-confidence increase for using bougie for ETI procedure. RS methodology can contribute for training in using the bougie guide for ETI procedure during COVID-19 outbreak.

Keywords: bougie, confidence, COVID-19, endotracheal intubation, realistic simulation

Procedia PDF Downloads 144

Authors: James Ladzekpo

Abstract:

Background: The urgent need to identify new pharmacological targets for diabetes treatment and prevention has been amplified by the disease's extensive impact on individuals and healthcare systems. A deeper insight into the biological underpinnings of diabetes is crucial for the creation of therapeutic strategies aimed at these biological processes. Current predictive models based on genetic variations fall short of accurately forecasting diabetes. Objectives: Our study aims to pinpoint key epigenetic factors that predispose individuals to diabetes. These factors will inform the development of an advanced predictive model that estimates diabetes risk from genetic profiles, utilizing state-of-the-art statistical and data mining methods. Methodology: We have implemented a recursive feature elimination with cross-validation using the support vector machine (SVM) approach for refined feature selection. Building on this, we developed six machine learning models, including logistic regression, k-Nearest Neighbors (k-NN), Naive Bayes, Random Forest, Gradient Boosting, and Multilayer Perceptron Neural Network, to evaluate their performance. Findings: The Gradient Boosting Classifier excelled, achieving a median recall of 92.17% and outstanding metrics such as area under the receiver operating characteristics curve (AUC) with a median of 68%, alongside median accuracy and precision scores of 76%. Through our machine learning analysis, we identified 31 genes significantly associated with diabetes traits, highlighting their potential as biomarkers and targets for diabetes management strategies. Conclusion: Particularly noteworthy were the Gradient Boosting Classifier and Multilayer Perceptron Neural Network, which demonstrated potential in diabetes outcome prediction. We recommend future investigations to incorporate larger cohorts and a wider array of predictive variables to enhance the models' predictive capabilities.

Keywords: diabetes, machine learning, prediction, biomarkers

Procedia PDF Downloads 55

Authors: Terence Soule, Tami Al Ghamdi

Abstract:

To study how to transfer knowledge from multiple source problems to the target problem, we modeled the Transfer Learning (TL) process using Genetic Algorithms as the model solver. TL is the process that aims to transfer learned data from one problem to another problem. The TL process aims to help Machine Learning (ML) algorithms find a solution to the problems. The Genetic Algorithms (GA) give researchers access to information that we have about how the old problem is solved. In this paper, we have five different source problems, and we transfer the knowledge to the target problem. We studied different scenarios of the target problem. The results showed combined knowledge from multiple source problems improves the GA performance. Also, the process of combining knowledge from several problems results in promoting diversity of the transferred population.

Keywords: transfer learning, genetic algorithm, evolutionary computation, source and target

Procedia PDF Downloads 140

Authors: Ruqayya Naheed Khan, Romaisa Shamim, Awais Amjad Malik, Awais Naeem, Amina Iqbal Khan, Asad Parvaiz

Abstract:

Objective: Patients undergoing axillary lymph node dissection (ALND) for metastatic lymph nodes in our hospital usually have drains placed in their axilla for a period of 6-10 days. We evaluated the post-op course of patients who underwent breast conservation surgery (BCS) along with ALND. Methods: A prospective cohort study was conducted at Shaukat Khanam Memorial Cancer Hospital from April 2017 to August 2017 including all lymph node positive breast cancer patients undergoing BCS with ALND. Patients were divided into two groups. Group A had no axillary drain while in Group B a drain was placed in axilla. Results: A total of 76 patients were included. 41 patients were included in group A and 35 patients in Group B. Median number of LNs dissected in group A was 17 and in group B was 15 (p value 0.443). Median operative time in group A was 84 min and in group B was 79 min (p value 0.223). Median hospital stay in both groups was 1 day (p value 0.78). At 2 weeks all patients in group A developed seroma as compared to none in group B (p value < 0.001). 3 of these patients in group A required aspiration of seroma due to pressure effects. Rest were managed conservatively. At 6 weeks only 50% patients had a seroma radiologically in Group A as compared to 33% in group B (p value 0.023). No intervention was required in any patients at week 6. QOL at 2 weeks was much better in Group A (7/41 patients had unsatisfactory response) as compared to group B (10/31 had unsatisfactory response). Results were statistically significant (p value 0.045). However, there wasn’t much difference in QOL at 6 weeks. Only 1 patient in group A had an unsatisfactory response. Average pain score at 2 weeks was similar in both groups (4.2 v/s 4.1 p value 0.73). Infection was seen in 1 patient in each group at 2 weeks (p value 0.668) and in only 1 patient in group A at 6 weeks (p value 0.067). Conclusion: We conclude from our study that there isn’t much difference in drain and no drain group in terms of wound infection and pain scores. No drain group is however associated with a better QOL in early post-op period.

Keywords: axillary drainage, axillary lymph node dissection, breast cancer, no drain in axilla

Procedia PDF Downloads 190

Authors: Beom-Seok Ko, Yoo-Seok Kim, Woo-Sung Lim, Ku-Sang Kim, Hyun-Ah Kim, Jin-Sun Lee, An-Bok Lee, Jin-Gu Bong, Tae-Hyun Kim, Sei-Hyun Ahn

Abstract:

Background: Breast conserving surgery (BCS) followed by radiation therapy is today standard therapy for early breast cancer. It is safe therapeutic procedure in early breast cancers, because it provides the same level of overall survival as mastectomy. There are a number of different types of incisions used to BCS. Avoiding scars on the breast is women’s desire. Numerous minimal approaches have evolved due to this concern. Periareolar incision is often used when the small tumor relatively close to the nipple. But periareolar incision has a disadvantages include limited exposure of the surgical field. In plastic surgery, various methods such as zigzag incisions have been recommended to achieve satisfactory esthetic results. Periareolar zigzag incision has the advantage of not only good surgical field but also contributed to better surgical scars. The purpose of this study was to evaluate the oncological safety of procedures by studying the status of the surgical margins of the excised tumor specimen and reduces the need for further surgery. Methods: Between January 2016 and September 2016, 148 women with breast cancer underwent BCS or mastectomy by the same surgeon in ASAN medical center. Patients with exclusion criteria were excluded from this study if they had a bilateral breast cancer or underwent resection of the other tumors or taken axillary dissection or performed other incision methods. Periareolar zigzag incision was performed and excision margins of the specimen were identified frozen sections and paraffin-embedded or permanent sections in all patients in this study. We retrospectively analyzed tumor characteristics, the operative time, size of specimen, the distance from the tumor to nipple. Results: A total of 148 patients were reviewed, 72 included in the final analysis, 76 excluded. The mean age of the patients was 52.6 (range 25-19 years), median tumor size was 1.6 cm (range, 0.2-8.8), median tumor distance from the nipple was 4.0 cm (range, 1.0-9.0), median excised specimen sized was 5.1 cm (range, 2.8-15.0), median operation time was 70.0 minute (range, 39-138). All patients were discharged with no sign of infection or skin necrosis. Free resection margin was confirmed by frozen biopsy and permanent biopsy in all samples. There were no patients underwent reoperation. Conclusions: We suggest that periareolar zigzag incision can provide a good surgical field to remove a relatively large tumor and may provide cosmetically good outcomes.

Keywords: periareolar zigzag incision, breast conserving surgery, breast cancer, resection margin

Procedia PDF Downloads 230

Authors: Ocotlán Díaz-Parra, Jorge A. Ruiz-Vanoye, Alejandro Fuentes-Penna, Beatriz Bernabe-Loranca, Patricia Ambrocio-Cruz, José J. Hernández-Flores

Abstract:

The Maritime Platform Transport Problem of Solid, Special and Dangerous Waste consist of to minimize the monetary value of carry different types of waste from one location to another location using ships. We offer a novel mathematical, the characterization of the problem and the use CPLEX to find the optimal values to solve the Solid, Special and Hazardous Waste Transportation Problem of offshore platforms instances of Mexican state-owned petroleum company (PEMEX). The set of instances used are WTPLib real instances and the tool CPLEX solver to solve the MPTPSSDW problem.

Keywords: oil platform, transport problem, waste, solid waste

Procedia PDF Downloads 471

Authors: Kalpana Dahiya

Abstract:

This paper discusses a two-level hierarchical time minimization transportation problem, which is an important class of transportation problems arising in industries. This problem has been studied by various researchers, and a number of polynomial time iterative algorithms are available to find its solution. All the existing algorithms, though efficient, have some shortcomings. The current study proposes an alternate solution algorithm for the problem that is more efficient in terms of computational time than the existing algorithms. The results justifying the underlying theory of the proposed algorithm are given. Further, a detailed comparison of the computational behaviour of all the algorithms for randomly generated instances of this problem of different sizes validates the efficiency of the proposed algorithm.

Keywords: global optimization, hierarchical optimization, transportation problem, concave minimization

Procedia PDF Downloads 162

Authors: Farzaneh Rajabighamchi, Stan van Hoesel, Christof Defryn

Abstract:

The generalized traveling salesman problem (GTSP) is an extension of the traveling salesman problem (TSP) where the set of nodes is partitioned into clusters, and the salesman must visit exactly one node per cluster. In this research, we apply the definition of the GTSP to an order picker routing problem with multiple locations per product. As such, each product represents a cluster and its corresponding nodes are the locations at which the product can be retrieved. To pick a certain product item from the warehouse, the picker needs to visit one of these locations during its pick tour. As all products are scattered throughout the warehouse, the product clusters not separated geographically. We propose an exact LP model as well as heuristic and meta-heuristic solution algorithms for the order picking problem with multiple product locations.

Keywords: warehouse optimization, order picking problem, generalised travelling salesman problem, heuristic algorithm

Procedia PDF Downloads 112

Authors: Ivan Baravy

Abstract:

Interpolation problem, as it was initially posed in terms of polynomials, is well researched. However, further mathematical developments extended it significantly. Trigonometric interpolation is widely used in Fourier analysis, while its generalized representation as exponential interpolation is applicable to such problem of mathematical physics as modelling of Ziegler-Biersack-Littmark repulsive interatomic potentials. Formulated for finite fields, this problem arises in decoding Reed--Solomon codes. This paper shows the relation between different interpretations of the problem through the class of matrices of special structure - Hankel matrices.

Keywords: Berlekamp-Massey algorithm, exponential interpolation, finite fields, Hankel matrices, Hankel polynomials

Procedia PDF Downloads 521

Authors: Stephan Koehler, Thomas Friedli

Abstract:

Performance measurement has evolved over time from a unidimensional short-term efficiency focused approach into a balanced multidimensional approach. Today, integrated performance measurement frameworks are often used to avoid local optimization and to encourage continuous improvement of an organization. In literature, the multidimensional characteristic of performance measurement is often described by competitive priorities. At the same time, on the highest abstraction level an effectiveness and efficiency dimension of performance measurement can be distinguished. This paper aims at a better understanding of the composition of effectiveness and efficiency and their relation in pharmaceutical quality control labs. The research comprises a lab-specific operationalization of effectiveness and efficiency and examines how the two dimensions are interlinked. The basis for the analysis represents a database of the University of St. Gallen including a divers set of 40 different pharmaceutical quality control labs. The research provides empirical evidence that labs with a high effectiveness also accompany a high efficiency. Lab effectiveness explains 29.5 % of the variance in lab efficiency. In addition, labs with an above median operational excellence performance have a statistically significantly higher lab effectiveness and lab efficiency compared to the below median performing labs.

Keywords: empirical study, operational excellence, performance measurement, pharmaceutical quality control lab

Procedia PDF Downloads 161

Authors: Mahmoud Lot

Abstract:

In this article, we will discuss the solution of elliptic optimal control problem. First, by using the nite element method, we obtain the discrete form of the problem. The obtained discrete problem is actually a large scale constrained optimization problem. Solving this optimization problem with traditional methods is difficult and requires a lot of CPU time and memory. But split Bergman method converts the constrained problem to an unconstrained, and hence it saves time and memory requirement. Then we use the split Bregman method for solving this problem, and examples show the speed and accuracy of split Bregman methods for solving these types of problems. We also use the SQP method for solving the examples and compare with the split Bregman method.

Keywords: Split Bregman Method, optimal control with elliptic partial differential equation constraint, finite element method

Procedia PDF Downloads 152

Authors: Mohsen Ziaee

Abstract:

Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases.

Keywords: scheduling, general flow shop scheduling problem, makespan, heuristic

Procedia PDF Downloads 207

Authors: Devendra Gupta, S. P. Ambesh, P. K Singh

Abstract:

Introduction: Minimally invasive coronary artery bypass grafting (MICABG) is a less invasive method of performing surgical revascularization. Minimally invasive direct coronary artery bypass (MIDCAB) provides many anesthetic challenges including one lung ventilation (OLV), managing myocardial ischemia, and pain. We present an early and midterm result of the use of this technique with OLV. Method: We enrolled 62 patients for analysis operated between 2008 and 2012. Patients were anesthetized and left endobronchial tube was placed. During the procedure left lung was isolated and one lung ventilation was maintained through right lung. Operation was performed utilizing off pump technique of coronary artery bypass grafting through a minimal invasive incision. Left internal mammary artery graft was done for single vessel disease and radial artery was utilized for other grafts if required. Postoperative ventilation was done with single lumen endotracheal tube. Median follow-up is 2.5 years (6 months to 4 years). Results: Median age was 58.5 years (41-77) and all were male. Single vessel disease was present in 36, double vessel in 24 and triple vessel disease in 2 patients. All the patients had normal left ventricular size and function. In 2 cases difficulty were encounter in placement of endobronchial tube. In 1 case cuff of endobronchial tube was ruptured during intubation. High airway pressure was developed on OLV in 1 case and surgery was accomplished with two lung anesthesia with low tidal volume. Mean postoperative ventilation time was 14.4 hour (11-22). There was no perioperative and 30 day mortality. Conversion to median sternotomy to complete the operation was done in 3.23% (2 out of 62 patients). One patient had acute myocardial infarction postoperatively and there were no deaths during follow-up. Conclusion: MICABG is a safe and effective method of revascularization with OLV in low risk candidates for coronary artery bypass grafting.

Keywords: MIDCABG, one lung ventilation, coronary artery bypass grafting, endobronchial tube

Procedia PDF Downloads 425

Authors: Cagri Memis, Muzaffer Kapanoglu

Abstract:

The school bus routing problem (SBRP) is a variant of the Vehicle Routing Problem (VRP) classified as a location-allocation-routing problem. In this study, the SBRP is decomposed into two sub-problems: (1) bus route generation and (2) bus stop selection to solve large instances of the SBRP in reasonable computational times. To solve the first sub-problem, we propose a genetic algorithm to generate bus routes. Once the routes have been fixed, a sub-problem remains of allocating students to stops considering the capacity of the buses and the walkability constraints of the students. While the exact method solves small-scale problems, treating large-scale problems with the exact method becomes complex due to computational problems, a deficiency that the genetic algorithm can overcome. Results obtained from the proposed approach on 150 instances up to 250 stops show that the matheuristic algorithm provides better solutions in reasonable computational times with respect to benchmark algorithms.

Keywords: genetic algorithm, matheuristic, school bus routing problem, vehicle routing problem

Procedia PDF Downloads 71

Authors: M. J. Alcedo, K. Ito, K. Maeda

Abstract:

A stockperson has a significant influence on the productivity and welfare of their animals. This influence may be good or bad depending on their stockmanship competence. In this study, stockmanship competence (SC) is defined as the capacity of the stockperson to ensure the welfare of their animals by providing their animal’s needs. The study was conducted to evaluate the stockmanship competence of backyard goat raisers and to examine its relationship to productivity and economic profitability. This was made possible by interviewing 101 backyard goat raisers who have undergone farmer livestock school on integrated goat management (FLS IGM) in Region I, Philippines on September 3-30, 2012 and March 4-17, 2013. Secondary data needed were gathered from the local government agencies involved. Data on stockmanship, goat productivity and farmer’s income before and after attending FLS-IGM were gathered through a semi-structured interview. Questions for stockamnship were based on the Philippine recommends on goat production, tips on goat raising and other scientific literature. Stockmanship competence index score (SCIS) was computed by summing the raw scores derived from each components of SC divided by the total number of components. Pearson correlation through SPSS was used to see the relationship between SC, productivity and income. Result showed that majority raised native and upgraded goats. The computed mean SCIS before and after undergoing FLS-IGM was 38.53% and 75.81%, respectively, an improvement of 49.17%. Both index scores resulted in significant differences in productivity and income. The median mature weight and mortality rate of goats before FLS-IGM, where SC was low, was 14 kg and 50% respectively. On the other hand, after stockmanship had improved, the median mature weight increased to 19 kgs and mortality rate decreased to 11.11%. Likewise, fewer goat diseases were observed by farmers as compared before. With regards to income, there was 127.34% difference on the median net income derived by farmers. Result implies that improved stockmanship competence can lead not only to increased productivity and income of backyard goat raisers but also welfare of the animal.

Keywords: stockmanship, backyard goat production, animal welfare, Philippines

Procedia PDF Downloads 322

Authors: Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguin

Abstract:

In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behavior of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. We illustrate this approach with 65 instances of the problem from the OR-Library. Moreover, we solve this problem with 40 new binarization techniques and we select the technical with the best results obtained. Finally, we make a comparison between results obtained in previous studies and the new binarization technique, that is, with roulette wheel as transfer function and V3 as discretization technique.

Keywords: binary cat swarm optimization, binarization methods, metaheuristic, set covering problem

Procedia PDF Downloads 396

Authors: Hernández Eva Selene, Reyna Mary Carmen, Rivera Héctor, Barragán Irving

Abstract:

We propose an approach that jointly addresses the layout of a facility and the scheduling of a sequence of jobs. In real production, these two problems are interrelated. However, they are treated separately in the literature. Our approach is an extension of the job shop problem with transportation delay, where the location of the machines is selected among possible sites. The model minimizes the makespan, using the short processing times rule with two algorithms; the first one considers all the permutations for the location of machines, and the second only a heuristic to select some specific permutations that reduces computational time. Some instances are proved and compared with literature.

Keywords: layout problem, job shop scheduling problem, concurrent scheduling and layout problem, metaheuristic

Procedia PDF Downloads 608

Authors: S. Nasri, H. Bouziri

Abstract:

Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes.

Keywords: dynamic network flow, load dependent transit time, evacuation strategy, earliest arrival flow problem, tabu search metaheuristic

Procedia PDF Downloads 372

Authors: Divyesh Patel, Tanuja Srivastava

Abstract:

This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.

Keywords: discrete tomography, exactly-1-4-adjacency, simulated annealing, binary matrices

Procedia PDF Downloads 406

Authors: Nazish Badar

Abstract:

Background: To investigate the epidemic resurgent wave of influenza A (H1N1) pdm09 infections during 2015-16 Influenza season(Nov,15 –Feb,16) we compared epidemiological features of influenza A (H1N1) pdm09 associated hospitalizations and deaths during this period in Pakistan. Methods: Respiratory samples were tested using CDC Real-Time RT-PCR protocols. Demographic and epidemiological data was analyzed using SPSS. Risk ratio was calculated between age groups to compare patients that were hospitalized and died due to influenza A (H1N1) pdm09 during this period. Results: A total of 1970 specimens were analyzed; influenza virus was detected in 494(25%) samples, including 458(93%) Influenza type A and 36(7%) influenza type B viruses. Amongst influenza A viruses, 351(77%) A(H1N1) pdm09 and 107(23%) were A/H3N2. Influenza A(H1N1)pdm09 peaked in January 2016 when 250(54%) of tested patients were positive. The resurgent waves increased hospitalizations due to pdmH1N1 as compared to the rest part of the year. Overall 267(76%) A(H1N1) pdm09 cases were hospitalized. Adults ≥18 years showed the highest relative risk of hospitalization (1.2). Median interval of hospitalization and symptom onset was five days for all age groups. During this period, a total of 34 laboratory-confirmed deaths associated with pandemic influenza A (H1N1) were reported out of 1970 cases, the case fatality rate was 1.72%. the male to female ratio was 2:1in reported deaths. The majority of the deaths during that period occurred in adults ≥18 years of age. Overall median age of the death cases was 42.8 years with underlying medical conditions. The median number of days between symptom onset was two days. The diagnosis upon admission in influenza-associated fatal cases was pneumonia (53%). Acute Respiratory Distress Syndrome 9 (26%), eight out of which (88%) required mechanical ventilation. Conclusions: The present resurgence of pandemic virus cannot be attributed to a single factor. The prolong cold and dry weather, possibility of drift in virus and absence of annual flu vaccination may have played an integrated role in resurfacing of pandemic virus.

Keywords: influenza A (H1N1)pdm 09, resurgence, epidemiology, Pakistan

Procedia PDF Downloads 197

Authors: Abubakar Sa’adatu Mohammed

Abstract:

This paper reports on a study of problem solving differences between expert and novice Problem solvers for effective physics teaching. Significant differences were found both at the conceptual level and at the level of critical thinking, creative thinking and reasoning. It is suggested for a successful solution of a problem, conceptual knowledge alone may not be sufficient. There is the need of the knowledge of how the conceptual knowledge should be applied (problem solving skills). It is hoped that this research might contribute to efforts of exploring ways for students to acquire a powerful conceptual toolkit based on experts like problem solvers approach for effective teaching delivery.

Keywords: conceptual knowledge, procedural knowledge, critical thinking, creative thinking, reasoning ability

Procedia PDF Downloads 299

Authors: Mahnaz Hosseinzadeh, Mohammad Reza Mehregan

Abstract:

In this paper, we have developed a morphological field to assist multi- methodology (combining methodologies together in whole or part) in Operations Research (OR) for the problem contexts in Iranian organizations. So, we have attempted to identify some dimensions for problem context according to Iranian organizational problems. Then, a general morphological program is designed which helps the OR practitioner to determine the suitable OR methodology as output for any configuration of conditions in a problem context as input and to reveal the fields necessary to be improved in OR. Applying such a program would have interesting results for OR practitioners.

Keywords: hard, soft and emancipatory operations research, General Morphological Analysis (GMA), multi-methodology, problem context

Procedia PDF Downloads 298

Authors: Hassan Manouzi, Taous-Meriem Laleg-Kirati

Abstract:

In this paper we study mathematically the eigenvalue problem for stochastic elliptic partial differential equation of Wick type. Using the Wick-product and the Wiener-Ito chaos expansion, the stochastic eigenvalue problem is reformulated as a system of an eigenvalue problem for a deterministic partial differential equation and elliptic partial differential equations by using the Fredholm alternative. To reduce the computational complexity of this system, we shall use a decomposition-coordination method. Once this approximation is performed, the statistics of the numerical solution can be easily evaluated.

Keywords: eigenvalue problem, Wick product, SPDEs, finite element, Wiener-Ito chaos expansion

Procedia PDF Downloads 359

Authors: I. Iroka, L. Mgidlana, J. Willoughby, S. Dhlamini, P. Nxumalo, S. Sefadi, A. Mthembu, E. Gerber, E. Brits

Abstract:

Introduction: Nephroblastoma is a common paediatric tumor with good survival rates when diagnosed and treated early. Method: This retrospective study aimed to describe the patients with nephroblastoma seen at Universitas Academic Hospital Complex between the years 2000 and 2020. Results: In the study period, there were 207 patients identified. The patient profile had slightly more male than female patients; the median age was under four years of age. The study found a median delay of one month between symptom onset and diagnosis; a common cause was a delay in seeking care. Patients diagnosed and treated more than a month after symptoms started had poorer survival rates. There was a higher rate of Stage IV disease compared to similar studies in South Africa. Good preoperative histology and no relapse had good survival rates.. Patients from Lesotho had longer delays and presented with more severe diseases than the South African cohort. Conclusion: Early identification and treatment lead to better outcomes. Health-seeking behaviour, misdiagnosis, and referral delays might contribute to the long delays. A targeted study for patients from Lesotho is recommended.

Keywords: nephroblastoma, South Africa, Lesotho, developing country

Procedia PDF Downloads 98

Authors: Sarwat Sultan, Shahzad Gul

Abstract:

This study was carried out to see the mediating role of problem solving styles (sensing, intuitive, feeling, and thinking) in the predictive relationship of gratitude with subjective well-being. A sample of 454 college students aged 20-26 years old participated in this study and provided data on the measures of gratitude, problem solving styles, and subjective well-being. Results indicated the significant relationships of gratitude with subjective well-being and problem solving styles of intuitive and thinking. Results further indicated the positive link of intuitive and thinking styles with subjective well-being. Findings also provided the evidence for the significant mediating role of problem solving styles in the relationship of gratitude with subjective well-being. The implication for this study is likely to enhance the medium to long term effects of gratitude on subjective well-being among students and as well as assessing its value in promoting psychological health and problem solving strategies among students.

Keywords: gratitude, subjective well-being, problem solving styles, college students

Procedia PDF Downloads 425

Authors: R. Ouafi, F. Ouafi

Abstract:

We study the problem of cutting a rectangular material entity into smaller sub-entities of trapezoidal forms with minimum waste of the material. This problem will be denoted TCP (Trapezoidal Cutting Problem). The TCP has many applications in manufacturing processes of various industries: pipe line design (petro chemistry), the design of airfoil (aeronautical) or cuts of the components of textile products. We introduce an orthogonal build to provide the optimal horizontal and vertical homogeneous strips. In this paper we develop a general heuristic search based upon orthogonal build. By solving two one-dimensional knapsack problems, we combine the horizontal and vertical homogeneous strips to give a non orthogonal cutting pattern.

Keywords: combinatorial optimization, cutting problem, heuristic

Procedia PDF Downloads 541

Authors: Ismail El Gayar, Ossama Ismail, Yousri El Gamal

Abstract:

This paper presented a technique to solve one of the transportation problems that faces us in real life which is the Bus Scheduling Problem. Most of the countries using buses in schools, companies and traveling offices as an example to transfer multiple passengers from many places to specific place and vice versa. This transferring process can cost time and money, so we build a decision support system that can solve this problem. In this paper, a genetic algorithm with the shortest path technique is used to generate a competitive solution to other well-known techniques. It also presents a comparison between our solution and other solutions for this problem.

Keywords: bus scheduling problem, decision support system, genetic algorithm, shortest path

Procedia PDF Downloads 414

Authors: Jong Yeop Kim, Ji Eun Kim, Hyun Jeong Kwak, Sook Young Lee

Abstract:

Background: This prospective, randomized, controlled study was performed to evaluate the usefulness of the McGrath VL compared to Macintosh laryngoscopy in children with expected normal airway during endotracheal intubation, by comparing the time to intubation and ease of intubation. Methods: Eighty-four patients, aged 1-10 years undergoing endotracheal intubation for elective surgery were randomly assigned to McGrath group (n = 42) or Macintosh group (n = 42). Anesthesia was induced with propofol 2.5-3.0 mg/kg and sevoflurane 5-8 vol%. Orotracheal intubation was performed 2 minutes after injection of rocuronium 0.6 mg/kg with McGrath VL or Macintosh laryngoscope. The primary outcome was time to intubation. The Cormack and Lehane glottic grade, intubation difficulty score (IDS), and success rate of intubation were assessed. Hemodynamic changes also were recorded. Results: Median time to intubation [interquartile range] was not different between the McGrath group and the Macintosh group (25.0 [22.8-28.3] s vs. 26.0 [24.0-29.0] s, p = 0.301). The incidence of grade I glottic view was significantly higher in theMcGrath group than in the Macintosh group (95% vs. 74%, p = 0.013). Median IDS was lower in the McGrath group than in the Macintosh group (0 [0-0] vs. 0 [0-1], p = 0.018). There were no significant differences in success rate on intubation or hemodynamics between the two groups. Conclusions: McGrath VL provides better laryngeal views and lower IDS, but similar intubation times and success rates compared to the Macintosh laryngoscope in children with the normal airway.

Keywords: intubation, Macintosh laryngoscopy, Mcgrath videolaryngoscopy, pediatrics

Procedia PDF Downloads 228