Search results for: median problem

Authors: Cristian Cazacu, Bela Kobulniczky

Abstract:

Even though nowadays the median area of the Bucharest’s Sector 1 owns one of the best reputations in terms of quality of life level, the problems in urban planning from the last twenty years, as well as those related to the urban environment, became more and more obvious and shrill. And all this happened as long as non-compliance with urban and spatial planning laws, corroborated with uncontrolled territorial expansion on certain areas and faulty management of public and private spaces were more acute. The action of all these factors has been felt more and more strongly in the territory in the last twenty years, generating the degradation of the quality of the urban environment and affecting in parallel the general level of the inhabitants¬’ quality of life. Our methodology is based on analyzing a wide range of environmental parameters and it is also based on using advanced resources and skills for mapping planning and environmental dysfunctions as well as the possibility of integrating information into GIS programs, all data sets corroborated with problems related to spatial planning management and inaccuracies of the urbanistic sector. In the end, we managed to obtain a calculated and realistic image of the dysfunctions and a quantitative view of their magnitude in the territory. We also succeeded to create a full general map of the degree of degradation of the urban environment by typologies of urban tissues. Moreover, the methods applied by us can also be used globally to calculate and create realistic images and intelligent maps over the quality of the environment in areas larger than this one. Our study shows that environmental degradation occurred differently in the urban tissues from our study area, depending on several factors, reviewing the faulty way in which the processes of recovery / urban regeneration of the gap in recent years have led to the creation of new territorial dysfunctions. The general, centralized results show that the analyzed space has a much wider range of problems than initially thought, although notoriety and social etiquette place them far above other spaces from the same city of study.

Keywords: environment, GIS, planning, urban tissues

Procedia PDF Downloads 147

Authors: Meng-Hui Chen, Chiao-Wei Yu, Pei-Chann Chang

Abstract:

Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods.

Keywords: traveling salesman problem, artificial chromosomes, greedy search, imperial competitive algorithm

Procedia PDF Downloads 458

Authors: Praveen Vayalamkuzhi, Veeraragavan Amirthalingam

Abstract:

Studies on safety on highways are becoming the need of the hour as over 400 lives are lost every day in India due to road crashes. In order to evaluate the factors that lead to different levels of crash severity, it is necessary to investigate the level of safety of highways and their relation to crashes. In the present study, an attempt is made to identify the factors that contribute to road crashes and to quantify their effect on the severity of road crashes. The study was carried out on a four-lane divided rural highway in India. The variables considered in the analysis includes components of horizontal alignment of highway, viz., straight or curve section; time of day, driveway density, presence of median; median opening; gradient; operating speed; and annual average daily traffic. These variables were considered after a preliminary analysis. The major complexities in the study are the heterogeneous traffic and the speed variation between different classes of vehicles along the highway. To quantify the impact of each of these factors, statistical analyses were carried out using Logit model and also negative binomial regression. The output from the statistical models proved that the variables viz., horizontal components of the highway alignment; driveway density; time of day; operating speed as well as annual average daily traffic show significant relation with the severity of crashes viz., fatal as well as injury crashes. Further, the annual average daily traffic has significant effect on the severity compared to other variables. The contribution of highway horizontal components on crash severity is also significant. Logit models can predict crashes better than the negative binomial regression models. The results of the study will help the transport planners to look into these aspects at the planning stage itself in the case of highways operated under heterogeneous traffic flow condition.

Keywords: geometric design, heterogeneous traffic, road crash, statistical analysis, level of safety

Procedia PDF Downloads 302

Authors: Kim Kennedy, Daren Gibson, Stephanie Flukes, Chandra Diwakarla, Lisa Spalding, Leanne Pilkington, Andrew Redfern

Abstract:

Introduction: The mortality gap in Aboriginal Head and Neck Cancer is well known, but the reasons for poorer survival are not well established. Aim: We aimed to evaluate the locoregional and metastatic involvement, and stage at diagnosis, in Aboriginal compared with non-Aboriginal patients. Methods: We performed a retrospective cohort analysis of 320 HNC patients from a single centre in Western Australia, identifying 80 Aboriginal patients and 240 non-Aboriginal patients matched on a 1:3 ratio by sites, histology, rurality, and age. We collected data on the patient characteristics, tumour features, regions involved, stage at diagnosis, treatment history, and survival and relapse patterns, including sites of metastatic and locoregional involvement. Results: Aboriginal patients had a significantly higher incidence of lung metastases (26.3% versus 13.7%, p=0.009). Aboriginal patients also had a numerically but non-statistically significant higher incidence of thoracic nodal involvement (10% vs 5.8%) and malignant pleural effusions (3.8% vs 2.5%). Aboriginal patients also had a numerically but not statistically significantly higher incidence of adrenal and bony involvement. Interestingly, non-Aboriginal patients had an increased rate of cutaneous (2.1% vs 0%) and liver metastases (4.6% vs 2.5%) compared with Aboriginal patients. In terms of locoregional involvement, Aboriginal patients were more than twice as likely to have contralateral neck involvement (58.8% vs 24.2%, p<0.00001), and 30% more likely to have ipsilateral neck lymph node involvement (78.8% vs 60%, p=0.002) than non-Aboriginal patients. Aboriginal patients had significantly more advanced disease at diagnosis (p=0.008). Aboriginal compared with non-Aboriginal patients were less likely to present with stage I (7.5% vs 22.5%), stage II (11.3% vs 13.8%), or stage III disease (13.8% vs 17.1%), and more likely to present with more advanced stage IVA (42.5% vs 34.6%), stage IVB (15% vs 7.1%), or stage IVC (10% vs 5%) disease (p=0.008). Number of regions of disease involvement was higher in Aboriginal patients (median 3, mean 3.64, range 1-10) compared with non-Aboriginal patients (median 2, mean 2.80, range 1-12). Conclusion: Aboriginal patients had a significantly higher incidence of lung metastases, and significantly more frequent involvement of ipsilateral and contralateral neck lymph nodes. Aboriginal patients also had significantly more advanced disease at presentation with a higher stage at diagnosis. We are performing further analyses to investigate explanations for these findings.

Keywords: head and neck cancer, Aboriginal, metastases, locoregional, pattern of relapse, sites of disease

Procedia PDF Downloads 69

Authors: Saud Al Taj

Abstract:

Employer branding is considered as a useful tool for addressing the global-local problem facing complex organisations that have operations scattered across the globe and face challenges of dealing with the local environment alongside. Despite being an established field of study within the Western developed world, there is little empirical evidence concerning the relevance of employer branding to global companies that operate in the under-developed economies. This paper fills this gap by gaining rich insight into the implementation of employer branding programs in a foreign multinational operating in Pakistan dealing with the global-local problem. The study is qualitative in nature and employs semi-structured and focus group interviews with senior/middle managers and local frontline employees to deeply examine the phenomenon in case organisation. Findings suggest that authenticity is required in employer brands to enable them to respond to the local needs thereby leading to the resolution of the global-local problem. However, the role of signaling theory is key to the development of authentic employer brands as it stresses on the need to establish an efficient and effective signaling environment wherein signals travel in both directions (from signal designers to receivers and backwards) and facilitate firms with the global-local problem. The paper also identifies future avenues of research for the employer branding field.

Keywords: authenticity, counter-signals, employer branding, global-local problem, signaling theory

Procedia PDF Downloads 367

Authors: Carla Van De Sande, Jana Vandenberg

Abstract:

Just like physical skills, cognitive skills grow rusty over time unless they are regularly used and practiced, so academic breaks can have negative consequences on student learning and success. The Keeping in School Shape (KiSS) program is an engaging, accessible, and cost-effective intervention that harnesses the benefits of retrieval practice by using technology to help students maintain proficiency over breaks from school by delivering a daily review problem via text message or email. A growth mindset is promoted through feedback messages encouraging students to try again if they get a problem wrong and to take on a challenging problem if they get a problem correct. This paper reports on the relationship between confidence, accuracy, and decision-making during the implementation of the KiSS Program at a large university during winter break for students enrolled in an engineering introductory Calculus course sequence.

Keywords: growth mindset, learning loss, on-the-go learning, retrieval practice

Procedia PDF Downloads 205

Authors: F. Hamidi, N. Amiri, H. Mishmast Nehi

Abstract:

The Bilevel Programming (BP) model has been presented for a decision making process that consists of two decision makers in a hierarchical structure. In fact, BP is a model for a static two person game (the leader player in the upper level and the follower player in the lower level) wherein each player tries to optimize his/her personal objective function under dependent constraints; this game is sequential and non-cooperative. The decision making variables are divided between the two players and one’s choice affects the other’s benefit and choices. In other words, BP consists of two nested optimization problems with two objective functions (upper and lower) where the constraint region of the upper level problem is implicitly determined by the lower level problem. In real cases, the coefficients of an optimization problem may not be precise, i.e. they may be interval. In this paper we develop an algorithm for solving interval bilevel linear fractional programming problems. That is to say, bilevel problems in which both objective functions are linear fractional, the coefficients are interval and the common constraint region is a polyhedron. From the original problem, the best and the worst bilevel linear fractional problems have been derived and then, using the extended Charnes and Cooper transformation, each fractional problem can be reduced to a linear problem. Then we can find the best and the worst optimal values of the leader objective function by two algorithms.

Keywords: best and worst optimal solutions, bilevel programming, fractional, interval coefficients

Procedia PDF Downloads 446

Authors: María L. Jalón, Feargal Brennan

Abstract:

A non-stationary stochastic optimization methodology is applied to an OWC (oscillating water column) to find the design that maximizes the wave energy extraction. Different temporal cycles are considered to represent the long-term variability of the wave climate at the site in the optimization problem. The results of the non-stationary stochastic optimization problem are compared against those obtained by a stationary stochastic optimization problem. The comparative analysis reveals that the proposed non-stationary optimization provides designs with a better fit to reality. However, the stationarity assumption can be adequate when looking at averaged system response.

Keywords: non-stationary stochastic optimization, oscillating water, temporal variability, wave energy

Procedia PDF Downloads 373

Authors: Antonin Ponsich, Eric Alfredo Rincon Garcia, Roman Anselmo Mora Gutierrez, Miguel Angel Gutierrez Andrade, Sergio Gerardo De Los Cobos Silva, Pedro Lara Velzquez

Abstract:

The electoral zone design problem consists in redrawing the boundaries of legislative districts for electoral purposes in such a way that federal or state requirements are fulfilled. In Mexico, this process has been historically carried out by the National Electoral Institute (INE), by optimizing an integer nonlinear programming model, in which population equality and compactness of the designed districts are considered as two conflicting objective functions, while contiguity is included as a hard constraint. The solution technique used by the INE is a Simulated Annealing (SA) based algorithm, which handles the multi-objective nature of the problem through an aggregation function. The present work represents the first intent to apply a classical Multi-Objective Evolutionary Algorithm (MOEA), the second version of the Non-dominated Sorting Genetic Algorithm (NSGA-II), to this hard combinatorial problem. First results show that, when compared with the SA algorithm, the NSGA-II obtains promising results. The MOEA manages to produce well-distributed solutions over a wide-spread front, even though some convergence troubles for some instances constitute an issue, which should be corrected in future adaptations of MOEAs to the redistricting problem.

Keywords: multi-objective optimization, NSGA-II, redistricting, zone design problem

Procedia PDF Downloads 367

Authors: Yohtahe Woldegerima Berhe, Tadesse Belayneh Melkie, Girmay Fitiwi Lema, Marye Getnet, Wubie Birlie Chekol

Abstract:

Introduction: Anxiety was repeatedly reported as the worst aspect of the perioperative time. The objective of this study was to assess the prevalence of preoperative anxiety among adult surgical patients at the University of Gondar Comprehensive Specialized Hospital (UoGCSH), Northwest Ethiopia. Methodology: Hospital-based cross-sectional study was conducted among surgical patients at the university hospital. After obtaining ethical approval, 407 surgical patients were approached during the preoperative period. Preoperative anxiety was assessed by the State-Trait Anxiety Inventory. The association between variables was determined by using binary logistic regression analysis. The strength of association was described in adjusted odds ratio (AOR) and a p-value < 0.05 at a 95% confidence interval which was considered statistically significant. Results: A total of 400 patients were included in this study, with a 98.3% response rate. Preoperative anxiety was observed among 237 (59.3%) patients, and the median (IQR) STAI score was 50 (40 – 56.7). age ≥ 60 years (AOR: 5.7, CI: 1.6 – 20.4, P: 0.007), emergency surgery (AOR: 2.5, CI: 1.3 – 4.7, P: 0.005), preoperative pain (AOR: 2.6, CI: 1.2 – 5.4, P: 0.005), and rural residency (AOR: 1.8, CI: 1.1 – 2.9, P: 0.031) were found significantly associated with preoperative anxiety. Conclusions: The prevalence of preoperative anxiety among surgical patients was high. Older age (≥ 60 years), emergency surgery, preoperative pain, and rural residency were found to be significantly associated with preoperative anxiety. Assessment for preoperative anxiety should be a routine component of preoperative assessment of both elective and emergency surgical patients. Preoperative pain should be appropriately managed as it can help to reduce preoperative anxiety. Optimal anxiety reduction methods should be investigated and implemented in the hospital.

Keywords: preoperative anxiety, anxiety, anxiety of anesthesia and surgery, state-trait anxiety inventory, preoperative care

Procedia PDF Downloads 15

Authors: P. Parthiban, Sonu Rajak, N. Kannan, R. Dhanalakshmi

Abstract:

This paper deals with the Vehicle Routing Problem (VRP) with environmental considerations which is called Pollution Routing Problem (PRP). The objective is to minimize the operational and environmental costs. It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. In this context, we presented an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the PRP. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage a SOA is run on the resulting VRPTW solutions. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route in order to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm is able to provide good solutions.

Keywords: ant colony optimization, CO2 emissions, combinatorial optimization, speed optimization, vehicle routing

Procedia PDF Downloads 322

Authors: Imen Boudali, Marwa Ragmoun

Abstract:

The Vehicle Routing Problem with Hard Time Windows (VRPHTW) is a basic distribution management problem that models many real-world problems. The objective of the problem is to deliver a set of customers with known demands on minimum-cost vehicle routes while satisfying vehicle capacity and hard time windows for customers. In this paper, we propose to deal with our optimization problem by using a new hybrid stochastic algorithm based on two metaheuristics: Chemical Reaction Optimization (CRO) and Greedy Randomized Adaptive Search Procedure (GRASP). The first method is inspired by the natural process of chemical reactions enabling the transformation of unstable substances with excessive energy to stable ones. During this process, the molecules interact with each other through a series of elementary reactions to reach minimum energy for their existence. This property is embedded in CRO to solve the VRPHTW. In order to enhance the population diversity throughout the search process, we integrated the GRASP in our method. Simulation results on the base of Solomon’s benchmark instances show the very satisfactory performances of the proposed approach.

Keywords: Benchmark Problems, Combinatorial Optimization, Vehicle Routing Problem with Hard Time Windows, Meta-heuristics, Hybridization, GRASP, CRO

Procedia PDF Downloads 411

Authors: Alaa Sheta

Abstract:

Economic Load Dispatch (ELD) is one of the vital optimization problems in power system planning. Solving the ELD problems mean finding the best mixture of power unit outputs of all members of the power system network such that the total fuel cost is minimized while sustaining operation requirements limits satisfied across the entire dispatch phases. Many optimization techniques were proposed to solve this problem. A famous one is the Quadratic Programming (QP). QP is a very simple and fast method but it still suffer many problem as gradient methods that might trapped at local minimum solutions and cannot handle complex nonlinear functions. Numbers of metaheuristic algorithms were used to solve this problem such as Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO). In this paper, another meta-heuristic search algorithm named Differential Evolution (DE) is used to solve the ELD problem in power systems planning. The practicality of the proposed DE based algorithm is verified for three and six power generator system test cases. The gained results are compared to existing results based on QP, GAs and PSO. The developed results show that differential evolution is superior in obtaining a combination of power loads that fulfill the problem constraints and minimize the total fuel cost. DE found to be fast in converging to the optimal power generation loads and capable of handling the non-linearity of ELD problem. The proposed DE solution is able to minimize the cost of generated power, minimize the total power loss in the transmission and maximize the reliability of the power provided to the customers.

Keywords: economic load dispatch, power systems, optimization, differential evolution

Procedia PDF Downloads 282

Authors: Tunjo Perić, Franjo Bratić

Abstract:

In this paper the goal programming methodology for solving multiple objective problem of the technological variants and production plan optimization has been applied. The optimization criteria are determined and the multiple objective linear programming model for solving a problem of the technological variants and production plan optimization is formed and solved. Then the obtained results are analysed. The obtained results point out to the possibility of efficient application of the goal programming methodology in solving the problem of the technological variants and production plan optimization. The paper points out on the advantages of the application of the goal programming methodolohy compare to the Surrogat Worth Trade-off method in solving this problem.

Keywords: goal programming, multi objective programming, production plan, SWT method, technological variants

Procedia PDF Downloads 379

Authors: Samia Kouki

Abstract:

Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time.

Keywords: grid computing, permutation flow shop problem, branch and bound, load balancing

Procedia PDF Downloads 283

Authors: Afrah Aladwani, Alexander Mullen, Mohammad AlRashidi, Omamah Alfarisi, Faisal Alterkit, Abdulwahab Aladwani, Asit Kumar, Emad Eldosouky

Abstract:

Introduction: Trastuzumab is a HER-2 targeted humanized monoclonal antibody that significantly improves the therapeutic outcomes of metastatic and non-metastatic breast cancer. However, it is associated with increased risk of cardiotoxicity that ranges from mild decline in the cardiac ejection fraction to permanent cardiomyopathy. Concerns have been raised in treating eligible older patients. This study compares trastuzumab outcomes between two age cohorts in the Kuwait Cancer Control Centre (KCCC). Methods: In a prospective comparative observational study, 93 HER-2 positive breast cancer patients undergoing different chemotherapy protocols + trastuzumab were included and divided into two cohorts based on their age (˂60 and ≥60 years old). The baseline left ventricular ejection fraction (LVEF) was assessed and monitored every three months during trastuzumab treatment. Event of cardiotoxicity was defined as ≥10% decline in the LVEF from the baseline. The lower accepted normal limit of the LVEF was 50%. Results: The median baseline LVEF was 65% in both age cohorts (IQR 8% and 9% for older and younger patients respectively). Whereas, the median LVEF post-trastuzumab treatment was 51% and 55% in older and younger patients respectively (IQR 8%; p-value = 0.22), despite the fact that older patients had significantly lower exposure to anthracyclines compared to younger patients (60% and 84.1% respectively; p-value ˂0.001). 86.7% and 55.6% of older and younger patients, respectively, developed ≥10% decline in their LVEF from the baseline. Among those, only 29% of older and 27% of younger patients reached a LVEF value below 50% (p-value = 0.88). Statistically, age was the only factor that significantly correlated with trastuzumab induced cardiotoxicity (OR 4; p-value ˂0.012), but it did not increase the requirement for permanent discontinuation of treatment. A baseline LVEF value below 60% contributed to developing a post-treatment value below normal ranges (50%). Conclusion: Breast cancer patients aged 60 years and above in Kuwait were at 4-fold higher risk of developing ≥10% decline in their LVEF from the baseline than younger patients during trastuzumab treatment. Surprisingly, previous exposure to anthracyclines and multiple comorbidities were not associated with significant increased risk of cardiotoxicity.

Keywords: breast cancer, elderly, Trastuzumab, cardiotoxicity

Procedia PDF Downloads 205

Authors: Ken Hampshire, Thomas Mazzuchi, Shahram Sarkani

Abstract:

As a subset of metaheuristics, nature-inspired optimization algorithms such as particle swarm optimization (PSO) have shown promise both in solving intractable problems and in their extensibility to novel problem formulations due to their general approach requiring few assumptions. Unfortunately, single instantiations of algorithms require detailed tuning of parameters and cannot be proven to be best suited to a particular illustrative problem on account of the “no free lunch” (NFL) theorem. Using these algorithms in real-world problems requires exquisite knowledge of the many techniques and is not conducive to reconciling the various approaches to given classes of problems. This research aims to present a unified view of PSO-based approaches from the perspective of relevant systems engineering problems, with the express purpose of then eliciting the best solution for any problem formulation in an ensemble learning bucket of models approach. The central hypothesis of the research is that extending the PSO algorithms found in the literature to real-world optimization problems requires a general ensemble-based method for all problem formulations but a specific implementation and solution for any instance. The main results are a problem-based literature survey and a general method to find more globally optimal solutions for any systems engineering optimization problem.

Keywords: particle swarm optimization, nature-inspired optimization, metaheuristics, systems engineering, ensemble learning

Procedia PDF Downloads 98

Authors: Tun Myat Aung, Ni Ni Hla

Abstract:

This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.c

Keywords: discrete logarithm problem, general attacks, elliptic curve, prime field, binary field

Procedia PDF Downloads 233

Authors: R. Alramyan, S. Alsalamah, R. Alrashed, R. Alakel, F. Altheyeb, M. Alessa

Abstract:

Background: Nutritional support with total parenteral nutrition (TPN) is usually commenced with hematopoietic stem cell transplantation (HSCT) patients. However, it has its benefits and risks. Complications related to central venous catheter such as infections, and metabolic disturbances, including abnormal liver function, is usually of concern in such patients. Methods: A retrospective charts review of all pediatric patients who underwent HSCT between the period 2015-2018 in a tertiary hospital in Riyadh, Saudi Arabia. Patients' demographics, types of conditioning, type of nutrition, and patients' outcomes were collected. Statistical analysis was conducted using SPSS version 22. Frequencies and percentages were used to describe categorical variables. Mean, and standard deviation were used for continuous variables. A P value of less than 0.05 was considered as statically significant. Results: a total of 162 HSCTs were identified during the period mentioned. Indication of allogenic transplant included hemoglobinopathy in 50 patients (31%), acute lymphoblastic leukemia in 21 patients (13%). TPN was used in 96 patients (59.30%) for a median of 14 days, nasogastric tube feeding (NGT) in 16 (9.90%) patients for a median of 11 days, and 71 of patients (43.80%) were able to tolerate oral feeding. Out of the 96 patients (59.30%) who were dependent on TPN, 64 patients (66.7%) had severe mucositis in comparison to 17 patients (25.8%) who were either on NGT or tolerated oral intake. (P-value= 0.00). Sinusoidal obstruction syndrome (SOS) was seen in 14 patients (14.6%) who were receiving TPN compared to none in non-TPN patients (P=value 0.001). Moreover, majority of patients who had SOS received myeloablative conditioning therapy for non-malignant disease (hemoglobinopathy). However, there were no statistically significant differences in Graft-vs-Host Disease (both acute and chronic), bacteremia, and patient outcome between both groups. Conclusions: Nutritional support using TPN is used in majority of patients, especially post-myeloablative conditioning associated with severe mucositis. TPN was associated with VOD, especially in hemoglobinopathy patients who received myeloablative therapy. This may emphasize on use of preventative measures such as fluid restriction, use of diuretics, or defibrotide in high-risk patients.

Keywords: hematopoeitic stem cell transplant, HSCT, stem cell transplant, sinusoidal obstruction syndrome, total parenteral nutrition

Procedia PDF Downloads 157

Authors: Ernesto Linan, Linda Cruz, Lucero Becerra

Abstract:

In this paper, a new hybridized algorithm based on Chemical Reaction Optimization and Simulated Annealing is proposed to solve the alignment sequence Problem. The Chemical Reaction Optimization is a population-based meta-heuristic algorithm based on the principles of a chemical reaction. Simulated Annealing is applied to solve a large number of combinatorial optimization problems of general-purpose. In this paper, we propose hybridization between Chemical Reaction Optimization algorithm and Simulated Annealing in order to solve the Sequence Alignment Problem. An initial population of molecules is defined at beginning of the proposed algorithm, where each molecule represents a sequence alignment problem. In order to simulate inter-molecule collisions, the process of Chemical Reaction is placed inside the Metropolis Cycle at certain values of temperature. Inside this cycle, change of molecules is done due to collisions; some molecules are accepted by applying Boltzmann probability. The results with the hybrid scheme are better than the results obtained separately.

Keywords: chemical reaction optimization, sequence alignment problem, simulated annealing algorithm, metaheuristics

Procedia PDF Downloads 211

Authors: Rouhallah Bagheri, Morteza Mahmoudi, Hadi Moheb-Alizadeh

Abstract:

This paper aims at developing a multi-objective model for supplier selection and order allocation problem in stochastic environment, where purchasing cost, percentage of delivered items with delay and percentage of rejected items provided by each supplier are supposed to be stochastic parameters following any arbitrary probability distribution. In this regard, dependent chance programming is used which maximizes probability of the event that total purchasing cost, total delivered items with delay and total rejected items are less than or equal to pre-determined values given by decision maker. The abovementioned stochastic multi-objective programming problem is then transformed into a stochastic single objective programming problem using minimum deviation method. In the next step, the further problem is solved applying a genetic algorithm, which performs a simulation process in order to calculate the stochastic objective function as its fitness function. Finally, the impact of stochastic parameters on the given solution is examined via a sensitivity analysis exploiting coefficient of variation. The results show that whatever stochastic parameters have greater coefficients of variation, the value of the objective function in the stochastic single objective programming problem is deteriorated.

Keywords: supplier selection, order allocation, dependent chance programming, genetic algorithm

Procedia PDF Downloads 313

Authors: Thirakorn Maneerat, Darunee Jongudomkarn, Jiraporn Khiewyoo

Abstract:

Family quality of life of families who have persons with disabilities is a core concern in government services and community health promotion to deal with the multidimensionality of today’s health and societal issues. The number of families who have persons with disabilities in Thailand is gradually increasing. However, facilitation and evaluation of such family quality of life are limited by the lack of feasible tools. As a consequence, service provided for the families is not optimally facilitated and evaluated. This paper is part of a larger project which is aimed to develop a scale for measuring of family quality of life of families who have persons with developmental disabilities in Thailand, presenting the results of a three-round Delphi method involving 11 experts. The study was obtained during December 2013 to May 2014. The first round consisted of open-ended questionnaire and content analysis of the answers. The second round comprised a 5-point Likert scale structured questionnaire based on the first round analysis, with required the experts to identify the most relevant studied tool aspects. Their feedbacks levels of agreements were statistic analysis using the median, interquartile range and quartile deviation. The included criteria for items acceptance were greater than 3.50 of the median, lesser than 1.50 of interquartile range, and 0.65 or less of a quartile deviation. Finally, the proposed questionnaire was structured and validated by the experts in the third round. The results found that across all three rounds, the experts achieved 100% agreement on the five factors regarding to quality of life of a family who have person with disability were considered. These five factors with 38 items were included: 1) 10 items of family interactions; 2) 9 items of child rearing; 3) 7 items of physical and material resources; 4) 5 items of social-emotional status; and 7 items of disability-related services and welfare. Next step of the study was examined the construct validity by using factor analysis methods.

Keywords: tool development, family quality of life scale, person with disability, Delphi study

Procedia PDF Downloads 353

Authors: Varun Singh, Mainak Bandyopadhyay, Maharana Pratap Singh

Abstract:

The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS) and traffic assignment problem (in transportation planning). Well known applications of evolutionary methods like Genetic Algorithms (GA), Ant Colony Optimization, Particle Swarm Optimization (PSO) have come up to solve complex optimization problems to overcome the shortcomings of existing shortest path analysis methods. It has been reported by various researchers that PSO performs better than other evolutionary optimization algorithms in terms of success rate and solution quality. Further Geographic Information Systems (GIS) have emerged as key information systems for geospatial data analysis and visualization. This research paper is focused towards the application of PSO for solving the shortest path problem between multiple points of interest (POI) based on spatial data of Allahabad City and traffic speed data collected using GPS. Geovisualization of results of analysis is carried out in GIS.

Keywords: particle swarm optimization, GIS, traffic data, outliers

Procedia PDF Downloads 483

Authors: Zhanar Imanova

Abstract:

Masses of real celestial bodies change anisotropically and reactive forces appear, and they need to be taken into account in the study of these bodies' dynamics. We studied the two-planet problem of three bodies with variable masses in the presence of reactive forces and obtained the equations of perturbed motion in Newton’s form equations. The motion equations in the orbital coordinate system, unlike the Lagrange equation, are convenient for taking into account the reactive forces. The perturbing force is expanded in terms of osculating elements. The expansion of perturbing functions is a time-consuming analytical calculation and results in very cumber some analytical expressions. In the considered problem, we obtained expansions of perturbing functions by small parameters up to and including the second degree. In the non resonant case, we obtained evolution equations in the Newton equation form. All symbolic calculations were done in Wolfram Mathematica.

Keywords: two-planet, three-body problem, variable mass, evolutionary equations

Procedia PDF Downloads 64

Authors: Ekta Jain, Kalpana Dahiya, Vanita Verma

Abstract:

This paper discusses a priority based imbalanced time minimization assignment problem dealing with the allocation of n jobs to m < n persons in which the project is carried out in two stages, viz. Stage-I and Stage-II. Stage-I consists of n1 ( < m) primary jobs and Stage-II consists of remaining (n-n1) secondary jobs which are commenced only after primary jobs are finished. Each job is to be allocated to exactly one person, and each person has to do at least one job. It is assumed that nature of the Stage-I jobs is such that one person can do exactly one primary job whereas a person can do more than one secondary job in Stage-II. In a particular stage, all persons start doing the jobs simultaneously, but if a person is doing more than one job, he does them one after the other in any order. The aim of the proposed study is to find the feasible assignment which minimizes the total time for the two stage execution of the project. For this, an iterative algorithm is proposed, which at each iteration, solves a constrained imbalanced time minimization assignment problem to generate a pair of Stage-I and Stage-II times. For solving this constrained problem, an algorithm is developed in the current paper. Later, alternate combinations based method to solve the priority based imbalanced problem is also discussed and a comparative study is carried out. Numerical illustrations are provided in support of the theory.

Keywords: assignment, imbalanced, priority, time minimization

Procedia PDF Downloads 234

Authors: Ahmet Faruk Akyuz, Hasan Sakir Bilge

Abstract:

Depth estimation using stereo images is a challenging problem in computer vision. Many different studies have been carried out to solve this problem. With advancing machine learning, tackling this problem is often done with neural network-based solutions. The images used in these studies are mostly in the visible spectrum. However, the need to use the Infrared (IR) spectrum for depth estimation has emerged because it gives better results than visible spectra in some conditions. At this point, we recommend using thermal-thermal (IR) image pairs for depth estimation. In this study, we used two well-known networks (PSMNet, FADNet) with minor modifications to demonstrate the viability of this idea.

Keywords: thermal stereo matching, deep neural networks, CNN, Depth estimation

Procedia PDF Downloads 279

Authors: Teklay Gebrecherkos

Abstract:

Background: Serological testing for SARS-CoV-2 plays an important role in epidemiological studies, in aiding the diagnosis of COVID-19 and assess vaccine responses. Little is known about the dynamics of SARS-CoV-2 serology in African settings. Here, we aimed to characterize the longitudinal antibody response profile to SARS-CoV-2 in Ethiopia. Methods: In this prospective study, a total of 102 PCR-confirmed COVID-19 patients were enrolled. We obtained 802 plasma samples collected serially. SARS-CoV-2 antibodies were determined using four lateral flow immune assays (LFIAs) and an electrochemiluminescent immunoassay. We determined longitudinal antibody response to SARS-CoV-2 as well as seroconversion dynamics. Results: Serological positivity rate ranged between 12%-91%, depending on timing after symptom onset. There was no difference in the positivity rate between severe and non-severe COVID-19 cases. The specificity ranged between 90%-97%. Agreement between different assays ranged between 84%-92%. The estimated positive predictive value (PPV) for IgM or IgG in a scenario with seroprevalence at 5% varies from 33% to 58%. Nonetheless, when the population seroprevalence increases to 25% and 50%, there is a corresponding increase in the estimated PPVs. The estimated negative-predictive value (NPV) in a low seroprevalence scenario (5%) is high (>99%). However, the estimated NPV in a high seroprevalence scenario (50%) for IgM or IgG is reduced significantly from 80% to 85%. Overall, 28/102 (27.5%) seroconverted by one or more assays tested within a median time of 11 (IQR: 9–15) days post symptom onset. The median seroconversion time among symptomatic cases tended to be shorter when compared to asymptomatic patients [9 (IQR: 6–11) vs. 15 (IQR: 13–21) days; p = 0.002]. Overall, seroconversion reached 100% 5.5 weeks after the onset of symptoms. Notably, of the remaining 74 COVID-19 patients included in the cohort, 64 (62.8%) were positive for antibodies at the time of enrollment, and 10 (9.8%) patients failed to mount a detectable antibody response by any of the assays tested during follow-up. Conclusions: Longitudinal assessment of antibody response in African COVID-19 patients revealed heterogeneous responses. This underscores the need for a comprehensive evaluation of serum assays before implementation. Factors associated with failure to seroconvert need further research.

Keywords: COVID-19, antibody, rapid diagnostic tests, ethiopia

Procedia PDF Downloads 82

Authors: Zhang Tianci, Ding Meng, Zuo Hongfu, Zeng Lina, Sun Zejun

Abstract:

Automation of airport operations can greatly improve ground movement efficiency. In this paper, we study the speed profile design problem for advanced airport ground movement control and guidance. The problem is constrained by the surface four-dimensional trajectory generated in taxi planning. A decomposed approach of two stages is presented to solve this problem efficiently. In the first stage, speeds are allocated at control points which ensure smooth speed profiles can be found later. In the second stage, detailed speed profiles of each taxi interval are generated according to the allocated control point speeds with the objective of minimizing the overall fuel consumption. We present a swarm intelligence based algorithm for the first-stage problem and a discrete variable driven enumeration method for the second-stage problem since it only has a small set of discrete variables. Experimental results demonstrate the presented methodology performs well on real world speed profile design problems.

Keywords: airport ground movement, fuel consumption, particle swarm optimization, smoothness, speed profile design

Procedia PDF Downloads 582

Authors: Sabri Sulaiman, Siti Hajar Abu Bakar Ah, Haris Abd Wahab

Abstract:

Street children is a global phenomenon and declared as a social problem by social researcher and scholars across the world. The insecure street environment exposes street children into various risk factors. One of them is the health and psychological problem. The objective of this study is to assess the health problem and psychological wellbeing of street children in Kuala Lumpur, Malaysia. The cross-sectional study involved 303 street children in Chow Kit, Kuala Lumpur. The study confirmed that the majority (95.7%) of street children who participated in the study have a health problem. The findings also demonstrated that the majority of them have issues related to their psychological wellbeing. The inputs from this study are instrumental for the suggestion of specific intervention to improve the health and psychology wellbeing of street children in Malaysia. Agencies which are responsible for the street children well-being can utilise the inputs to framing and improving the social care programmes for the children.

Keywords: street children, health status, psychology wellbeing, homeless

Procedia PDF Downloads 183

Authors: Abdulaziz Alageel, Martino Luis, Shuya Zhong

Abstract:

The main focus of this research study is on the challenges faced in decision-making in a supply chain network regarding the facility location while considering carbon emissions. The study aims (i) to locate facilities (i.e., distribution centeres) in a continuous space considering limitations of capacity and the costs associated with opening and (ii) to reduce the cost of carbon emissions by selecting the mode of transportation. The problem is formulated as mixed-integer linear programming. This study hybridised a greedy randomised adaptive search (GRASP) and variable neighborhood search (VNS) to deal with the problem. Well-known datasets from the literature (Brimberg et al. 2001) are used and adapted in order to assess the performance of the proposed method. The proposed hybrid method produces encouraging results based on computational analysis. The study also highlights some research avenues for future recommendations.

Keywords: supply chain, facility location, weber problem, sustainability

Procedia PDF Downloads 100