Search results for: multiclassification problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 7167

Search results for: multiclassification problem

7017 Optimal Relaxation Parameters for Obtaining Efficient Iterative Methods for the Solution of Electromagnetic Scattering Problems

Authors: Nadaniela Egidi, Pierluigi Maponi

Abstract:

The approximate solution of a time-harmonic electromagnetic scattering problem for inhomogeneous media is required in several application contexts, and its two-dimensional formulation is a Fredholm integral equation of the second kind. This integral equation provides a formulation for the direct scattering problem, but it has to be solved several times also in the numerical solution of the corresponding inverse scattering problem. The discretization of this Fredholm equation produces large and dense linear systems that are usually solved by iterative methods. In order to improve the efficiency of these iterative methods, we use the Symmetric SOR preconditioning, and we propose an algorithm for the evaluation of the associated relaxation parameter. We show the efficiency of the proposed algorithm by several numerical experiments, where we use two Krylov subspace methods, i.e., Bi-CGSTAB and GMRES.

Keywords: Fredholm integral equation, iterative method, preconditioning, scattering problem

Procedia PDF Downloads 104
7016 Benders Decomposition Approach to Solve the Hybrid Flow Shop Scheduling Problem

Authors: Ebrahim Asadi-Gangraj

Abstract:

Hybrid flow shop scheduling problem (HFS) contains sequencing in a flow shop where, at any stage, there exist one or more related or unrelated parallel machines. This production system is a common manufacturing environment in many real industries, such as the steel manufacturing, ceramic tile manufacturing, and car assembly industries. In this research, a mixed integer linear programming (MILP) model is presented for the hybrid flow shop scheduling problem, in which, the objective consists of minimizing the maximum completion time (makespan). For this purpose, a Benders Decomposition (BD) method is developed to solve the research problem. The proposed approach is tested on some test problems, small to moderate scale. The experimental results show that the Benders decomposition approach can solve the hybrid flow shop scheduling problem in a reasonable time, especially for small and moderate-size test problems.

Keywords: hybrid flow shop, mixed integer linear programming, Benders decomposition, makespan

Procedia PDF Downloads 188
7015 A Versatile Algorithm to Propose Optimized Solutions to the Dengue Disease Problem

Authors: Fernando L. P. Santos, Luiz G. Lyra, Helenice O. Florentino, Daniela R. Cantane

Abstract:

Dengue is a febrile infectious disease caused by a virus of the family Flaviridae. It is transmitted by the bite of mosquitoes, usually of the genus Aedes aegypti. It occurs in tropical and subtropical areas of the world. This disease has been a major public health problem worldwide, especially in tropical countries such as Brazil, and its incidence has increased in recent years. Dengue is a subject of intense research. Efficient forms of mosquito control must be considered. In this work, the mono-objective optimal control problem was solved for analysing the dengue disease problem. Chemical and biological controls were considered in the mathematical aspect. This model describes the dynamics of mosquitoes in water and winged phases. We applied the genetic algorithms (GA) to obtain optimal strategies for the control of dengue. Numerical simulations have been performed to verify the versatility and the applicability of this algorithm. On the basis of the present results we may recommend the GA to solve optimal control problem with a large region of feasibility.

Keywords: genetic algorithm, dengue, Aedes aegypti, biological control, chemical control

Procedia PDF Downloads 349
7014 Data Collection with Bounded-Sized Messages in Wireless Sensor Networks

Authors: Min Kyung An

Abstract:

In this paper, we study the data collection problem in Wireless Sensor Networks (WSNs) adopting the two interference models: The graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the problem is to compute schedules with the minimum number of timeslots, that is, to compute the minimum latency schedules, such that data from every node can be collected without any collision or interference to a sink node. While existing works studied the problem with unit-sized and unbounded-sized message models, we investigate the problem with the bounded-sized message model, and introduce a constant factor approximation algorithm. To the best known of our knowledge, our result is the first result of the data collection problem with bounded-sized model in both interference models.

Keywords: data collection, collision-free, interference-free, physical interference model, SINR, approximation, bounded-sized message model, wireless sensor networks

Procedia PDF Downloads 221
7013 Demonstration of Logical Inconsistency in the Discussion of the Problem of Evil

Authors: Mohammad Soltani Renani

Abstract:

The problem of evil is one of the heated battlegrounds of the idea of theism and its critics. Since time immemorial and in various philosophical schools and religions, the belief in an Omniscient, Omnipotent, and Absolutely Good God has been considered inconsistent with the existence of the evil in the universe. The theist thinkers have generally adopted one of the following four ways for answering this problem: denial of the existence of evil or considering it to be relative, privation theory of evil, attribution of evil to something other than God, and depiction of an alternative picture of God. Defense or criticism of these alternative answers have given rise to an extensive and unending dispute. However, evaluation of the presupposition and context upon/in which a question is raised precedes offering an answer to it. This point in the discussion of the problem of evil is of paramount importance for both parties, i.e., questioners and answerers, that the attributes of knowledge, power, love, good-will, among others, can be supposed to be infinite only in the essence of the attributed and the domain of potentiality but what can be realized in the domain of actuality is always finite. Therefore, infinite nature of Divine Attributes and realization of evil belong to two spheres. Divine Attributes are infinite (absolute) in Divine Essence, but when they are created, each one becomes bounded by the other. This boundedness is a result of the state of being surrounded of the attributes by each other in finite world of possibility. Evil also appears in this limited world. This inconsistency leads to the collapse of the problem of evil from within: the place of infinity of the Divine Attributes, in the words of Muslim mystics, lies in the Holiest Manifestation [Feyze Aqdas] while evil emerges in the Holy Manifestation where the Divine Attributes become bounded by each other. This idea is neither a new answer to the problem of evil nor a defense of theism; rather it reveals a logical inconsistency in the discussion of the problem of evil.

Keywords: problem of evil, infinity of divine attributes, boundedness of divine attributes, holiest manifestation, holy manifestation

Procedia PDF Downloads 146
7012 The Solution of the Direct Problem of Electrical Prospecting with Direct Current Under Conditions of Ground Surface Relief

Authors: Balgaisha Mukanova, Tolkyn Mirgalikyzy

Abstract:

Theory of interpretation of electromagnetic fields studied in the electrical prospecting with direct current is mainly developed for the case of a horizontal surface observation. However in practice we often have to work in difficult terrain surface. Conducting interpretation without the influence of topography can cause non-existent anomalies on sections. This raises the problem of studying the impact of different shapes of ground surface relief on the results of electrical prospecting's research. This research examines the numerical solutions of the direct problem of electrical prospecting for two-dimensional and three-dimensional media, taking into account the terrain. The problem is solved using the method of integral equations. The density of secondary currents on the relief surface is obtained.

Keywords: ground surface relief, method of integral equations, numerical method, electromagnetic

Procedia PDF Downloads 363
7011 Problem Solving in Mathematics Education: A Case Study of Nigerian Secondary School Mathematics Teachers’ Conceptions in Relation to Classroom Instruction

Authors: Carol Okigbo

Abstract:

Mathematical problem solving has long been accorded an important place in mathematics curricula at every education level in both advanced and emerging economies. Its classroom approaches have varied, such as teaching for problem-solving, teaching about problem-solving, and teaching mathematics through problem-solving. It requires engaging in tasks for which the solution methods are not eminent, making sense of problems and persevering in solving them by exhibiting processes, strategies, appropriate attitude, and adequate exposure. Teachers play important roles in helping students acquire competency in problem-solving; thus, they are expected to be good problem-solvers and have proper conceptions of problem-solving. Studies show that teachers’ conceptions influence their decisions about what to teach and how to teach. Therefore, how teachers view their roles in teaching problem-solving will depend on their pedagogical conceptions of problem-solving. If teaching problem-solving is a major component of secondary school mathematics instruction, as recommended by researchers and mathematics educators, then it is necessary to establish teachers’ conceptions, what they do, and how they approach problem-solving. This study is designed to determine secondary school teachers’ conceptions regarding mathematical problem solving, its current situation, how teachers’ conceptions relate to their demographics, as well as the interaction patterns in the mathematics classroom. There have been many studies of mathematics problem solving, some of which addressed teachers’ conceptions using single-method approaches, thereby presenting only limited views of this important phenomenon. To address the problem more holistically, this study adopted an integrated mixed methods approach which involved a quantitative survey, qualitative analysis of open-ended responses, and ethnographic observations of teachers in class. Data for the analysis came from a random sample of 327 secondary school mathematics teachers in two Nigerian states - Anambra State and Enugu State who completed a 45-item questionnaire. Ten of the items elicited demographic information, 11 items were open-ended questions, and 25 items were Likert-type questions. Of the 327 teachers who responded to the questionnaires, 37 were randomly selected and observed in their classes. Data analysis using ANOVA, t-tests, chi-square tests, and open coding showed that the teachers had different conceptions about problem-solving, which fall into three main themes: practice on exercises and word application problems, a process of solving mathematical problems, and a way of teaching mathematics. Teachers reported that no period is set aside for problem-solving; typically, teachers solve problems on the board, teach problem-solving strategies, and allow students time to struggle with problems on their own. The result shows a significant difference between male and female teachers’ conception of problems solving, a significant relationship among teachers’ conceptions and academic qualifications, and teachers who have spent ten years or more teaching mathematics were significantly different from the group with seven to nine years of experience in terms of their conceptions of problem-solving.

Keywords: conceptions, education, mathematics, problem solving, teacher

Procedia PDF Downloads 76
7010 Optimizing Approach for Sifting Process to Solve a Common Type of Empirical Mode Decomposition Mode Mixing

Authors: Saad Al-Baddai, Karema Al-Subari, Elmar Lang, Bernd Ludwig

Abstract:

Empirical mode decomposition (EMD), a new data-driven of time-series decomposition, has the advantage of supposing that a time series is non-linear or non-stationary, as is implicitly achieved in Fourier decomposition. However, the EMD suffers of mode mixing problem in some cases. The aim of this paper is to present a solution for a common type of signals causing of EMD mode mixing problem, in case a signal suffers of an intermittency. By an artificial example, the solution shows superior performance in terms of cope EMD mode mixing problem comparing with the conventional EMD and Ensemble Empirical Mode decomposition (EEMD). Furthermore, the over-sifting problem is also completely avoided; and computation load is reduced roughly six times compared with EEMD, an ensemble number of 50.

Keywords: empirical mode decomposition (EMD), mode mixing, sifting process, over-sifting

Procedia PDF Downloads 394
7009 Prototyping the Problem Oriented Medical Record for Connected Health Based on TypeGraphQL

Authors: Sabah Mohammed, Jinan Fiaidhi, Darien Sawyer

Abstract:

Data integration of health through connected services can save lives in the event of a medical emergency or provide efficient and effective interventions for the benefit of the patients through the integration of bedside and bench side clinical research. Such integration will support all wind of change in healthcare by being predictive, pre-emptive, personalized, problem-oriented and participatory. Prototyping a healthcare system that enables data integration has been a big challenge for healthcare for a long time. However, an innovative solution started to emerge by focusing on problem lists where everything can connect the problem list forming a growing graph. This notion was introduced by Dr. Lawrence Weed in early 70’s, but the enabling technologies weren’t mature enough to provide a successful implementation prototype. In this article, we are describing our efforts in prototyping Dr. Lawrence Weed's problem-oriented medical record (POMR) and his patient case schema (SOAP) to shape a prototype for connected health. For this, we are using the TypeGraphQL API and our enterprise-based QL4POMR to describe a Web-Based gateway for healthcare services connectivity. Our prototype has reported success in connecting to the HL7 FHIR medical record and the OpenTarget biomedical repositories.

Keywords: connected health, problem-oriented healthcare record, SOAP, QL4POMR, typegraphQL

Procedia PDF Downloads 97
7008 A Petri Net Model to Obtain the Throughput of Unreliable Production Lines in the Buffer Allocation Problem

Authors: Joselito Medina-Marin, Alexandr Karelin, Ana Tarasenko, Juan Carlos Seck-Tuoh-Mora, Norberto Hernandez-Romero, Eva Selene Hernandez-Gress

Abstract:

A production line designer faces with several challenges in manufacturing system design. One of them is the assignment of buffer slots in between every machine of the production line in order to maximize the throughput of the whole line, which is known as the Buffer Allocation Problem (BAP). The BAP is a combinatorial problem that depends on the number of machines and the total number of slots to be distributed on the production line. In this paper, we are proposing a Petri Net (PN) Model to obtain the throughput in unreliable production lines, based on PN mathematical tools and the decomposition method. The results obtained by this methodology are similar to those presented in previous works, and the number of machines is not a hard restriction.

Keywords: buffer allocation problem, Petri Nets, throughput, production lines

Procedia PDF Downloads 307
7007 Inverse Cauchy Problem of Doubly Connected Domains via Spectral Meshless Radial Point Interpolation

Authors: Elyas Shivanian

Abstract:

In this paper, the spectral meshless radial point interpolation (SMRPI) technique is applied to the Cauchy problems of two-dimensional elliptic PDEs in doubly connected domains. It is obtained the unknown data on the inner boundary of the domain while overspecified boundary data are imposed on the outer boundary of the domain by using the SMRPI. Shape functions, which are constructed through point interpolation method using the radial basis functions, help us to treat problem locally with the aim of high order convergence rate. In this way, localization in SMRPI can reduce the ill-conditioning for Cauchy problem. Furthermore, we improve previous results and it is revealed the SMRPI is more accurate and stable by adding strong perturbations.

Keywords: cauchy problem, doubly connected domain, radial basis function, shape function

Procedia PDF Downloads 278
7006 Stability of Out-Of-Plane Equilibrium Points in the Elliptic Restricted Three-Body Problem with Oblateness up to Zonal Harmonic J₄ of Both Primaries

Authors: Kanshio Richard Tyokyaa, Jagadish Singh

Abstract:

In this paper, we examined the location and stability of Out-Of-Plane Equilibrium points in the elliptic restricted three-body problem of an infinitesimal body when both primaries are taken as oblate spheroids with oblateness up to zonal harmonic J₄. The positions of the Equilibrium points L₆,₇ and their stability depend on the oblateness of the primaries and the eccentricity of their orbits. We explored the problem numerically to show the effects of parameters involved in the position and stability of the Out-Of-Plane Equilibrium points for the systems: HD188753 and Gliese 667. It is found that their positions are affected by the oblateness of the primaries, eccentricity and the semi-major axis of the orbits, but its stability behavior remains unchanged and is unstable.

Keywords: out-of-plane, equilibrium points, stability, elliptic restricted three-body problem, oblateness, zonal harmonic

Procedia PDF Downloads 193
7005 Cars Redistribution Optimization Problem in the Free-Float Car-Sharing

Authors: Amine Ait-Ouahmed, Didier Josselin, Fen Zhou

Abstract:

Free-Float car-sharing is an one-way car-sharing service where cars are available anytime and anywhere in the streets such that no dedicated stations are needed. This means that after driving a car you can park it anywhere. This car-sharing system creates an imbalance car distribution in the cites which can be regulated by staff agents through the redistribution of cars. In this paper, we aim to solve the car-reservation and agents traveling problem so that the number of successful cars’ reservations could be maximized. Beside, we also tend to minimize the distance traveled by agents for cars redistribution. To this end, we present a mixed integer linear programming formulation for the car-sharing problem.

Keywords: one-way car-sharing, vehicle redistribution, car reservation, linear programming

Procedia PDF Downloads 348
7004 Bounded Solution Method for Geometric Programming Problem with Varying Parameters

Authors: Abdullah Ali H. Ahmadini, Firoz Ahmad, Intekhab Alam

Abstract:

Geometric programming problem (GPP) is a well-known non-linear optimization problem having a wide range of applications in many engineering problems. The structure of GPP is quite dynamic and easily fit to the various decision-making processes. The aim of this paper is to highlight the bounded solution method for GPP with special reference to variation among right-hand side parameters. Thus this paper is taken the advantage of two-level mathematical programming problems and determines the solution of the objective function in a specified interval called lower and upper bounds. The beauty of the proposed bounded solution method is that it does not require sensitivity analyses of the obtained optimal solution. The value of the objective function is directly calculated under varying parameters. To show the validity and applicability of the proposed method, a numerical example is presented. The system reliability optimization problem is also illustrated and found that the value of the objective function lies between the range of lower and upper bounds, respectively. At last, conclusions and future research are depicted based on the discussed work.

Keywords: varying parameters, geometric programming problem, bounded solution method, system reliability optimization

Procedia PDF Downloads 133
7003 The Relationship between Self Concept Clarity and Need for Absolute Truth and Problem Solving and Symptoms of Stress in Homosexual Male

Authors: Gizem Akcan, Erdinc Ozturk

Abstract:

When it is examined as historically, it has caught attention that homosexual people try to behave as heterosexual or come out to have a place in community. Homosexual people have identity confusion during identity development, they have high levels of need for absolute truth and their psychological well being is affected negatively because of high levels of need for absolute truth and they have problems about self concept clarity. People who have problems about self concept clarity have problems on problem solving and show lots of symptoms of stress. People who have clear self concept use healthier coping strategies to solve problems. The purpose of this study is to show whether need for absolute truth predicts problem solving and symptoms of stress via mediator effect of self concept clarity or not on homosexual men. The participants of this study were 200 homosexual men. The ages of participants were 20-50. In addition, Demographic Information Form, Self Concept Clarity Scale, Need for Absolute Truth Scale, Stres Self-Assessment Checklist and Problem Solving Inventory were applied to the participants. The assessment of the data was made with confirmatory factor analysis and structural equation modeling analysis. According to the results of this study, need for absolute truth predicts problem solving and symptoms of stress via mediator effect of self concept clarity on homosexual men.

Keywords: need for absolute truth, self concept clarity, symptoms of stress, problem solving

Procedia PDF Downloads 224
7002 Solving Directional Overcurrent Relay Coordination Problem Using Artificial Bees Colony

Authors: M. H. Hussain, I. Musirin, A. F. Abidin, S. R. A. Rahim

Abstract:

This paper presents the implementation of Artificial Bees Colony (ABC) algorithm in solving Directional OverCurrent Relays (DOCRs) coordination problem for near-end faults occurring in fixed network topology. The coordination optimization of DOCRs is formulated as linear programming (LP) problem. The objective function is introduced to minimize the operating time of the associated relay which depends on the time multiplier setting. The proposed technique is to taken as a technique for comparison purpose in order to highlight its superiority. The proposed algorithms have been tested successfully on 8 bus test system. The simulation results demonstrated that the ABC algorithm which has been proved to have good search ability is capable in dealing with constraint optimization problems.

Keywords: artificial bees colony, directional overcurrent relay coordination problem, relay settings, time multiplier setting

Procedia PDF Downloads 330
7001 Efficient Numerical Simulation for LDC

Authors: Badr Alkahtani

Abstract:

In this poster, numerical solutions of two-dimensional and three-dimensional lid driven cavity are presented by solving the steady Navier-Stokes equations at high Reynolds numbers where it becomes difficult. Lid driven cavity is where the a fluid contained in a cube and the upper wall is moving. In two dimensions, we use the streamfunction-vorticity formulation to solve the problem in a square domain. A numerical method is employed to discretize the problem in the x and y directions with a spectral collocation method. The problem is coded in the MATLAB programming environment. Solutions at high Reynolds numbers are obtained up to Re=20000 on a fine grid of 131 * 131. Also in this presentation, the numerical solutions for the three-dimensional lid-driven cavity problem are obtained by solving the velocity-vorticity formulation of the Navier-Stokes equations (which is the first time that this has been simulated with special boundary conditions) for various Reynolds numbers. A spectral collocation method is employed to discretize the y and z directions and a finite difference method is used to discretize the x direction. Numerical solutions are obtained for Reynolds number up to 200. , The work prepared here is to show the efficiency of methods used to simulate the physical problem where accurate simulations of lid driven cavity are obtained at high Reynolds number as mentioned above. The result for the two dimensional problem is far from the previous researcher result.

Keywords: lid driven cavity, navier-stokes, simulation, Reynolds number

Procedia PDF Downloads 715
7000 Dealing the Disruptive Behaviour amongst Students with Autism through Circus

Authors: K. A. Razhiyah

Abstract:

Disruptive behavior is a problem that is usually associated with those with autism. There is a need to overcome this behavioral problem because the negative impact of this problem does not only effect the social relation of the students but also can cause uneasiness to those around them. This condition will be worse if the techniques used failed to motivate students to change the behaviour. The purpose of this study was to determine the effect of the circus games technique on the disruptive behavior amongst students with autism. The positive results of the intervention that was carried out for three months show the reduction in disruptive behaviour, and also improvement in the turn-taking and focusing ability aspect. Positive changes shown by the students had an encouraging effect and in a way are helping them in the teaching and learning process.

Keywords: autism, desruptive behaviour, circus, effect

Procedia PDF Downloads 248
6999 Improved Artificial Bee Colony Algorithm for Non-Convex Economic Power Dispatch Problem

Authors: Badr M. Alshammari, T. Guesmi

Abstract:

This study presents a modified version of the artificial bee colony (ABC) algorithm by including a local search technique for solving the non-convex economic power dispatch problem. The local search step is incorporated at the end of each iteration. Total system losses, valve-point loading effects and prohibited operating zones have been incorporated in the problem formulation. Thus, the problem becomes highly nonlinear and with discontinuous objective function. The proposed technique is validated using an IEEE benchmark system with ten thermal units. Simulation results demonstrate that the proposed optimization algorithm has better convergence characteristics in comparison with the original ABC algorithm.

Keywords: economic power dispatch, artificial bee colony, valve-point loading effects, prohibited operating zones

Procedia PDF Downloads 257
6998 Childhood Obesity: Future Direction and Education Priorities

Authors: Zahra Ranjbar

Abstract:

Interpretive structural modeling (ISM) is a well-established methodology for identifying relationships among specific variables, which define a problem or an issue. In this study most important variables that have critical role in children obesity problem were introduce by ISM questionnaire technique and their relationships were determine. Our findings suggested that sedentary activities are top level variables and school teachers and administrators, public education and scientific collaborations are bottom level variables in children obesity problem. Control of dietary, Physical education program, parents, government and motivation strategies variables are depend to other variables. They are very sensitive to external variables. Also, physical education program, parents, government, motivation, school teachers and administrators, public education and collaboration variables have strong driving power. They are linkage factors; it means that they can be effective on children obesity problem directly.

Keywords: ISM, variable, obesity, physical education, children

Procedia PDF Downloads 456
6997 Evaluation of the exIWO Algorithm Based on the Traveling Salesman Problem

Authors: Daniel Kostrzewa, Henryk Josiński

Abstract:

The expanded Invasive Weed Optimization algorithm (exIWO) is an optimization metaheuristic modelled on the original IWO version created by the researchers from the University of Tehran. The authors of the present paper have extended the exIWO algorithm introducing a set of both deterministic and non-deterministic strategies of individuals’ selection. The goal of the project was to evaluate the exIWO by testing its usefulness for solving some test instances of the traveling salesman problem (TSP) taken from the TSPLIB collection which allows comparing the experimental results with optimal values.

Keywords: expanded invasive weed optimization algorithm (exIWO), traveling salesman problem (TSP), heuristic approach, inversion operator

Procedia PDF Downloads 836
6996 A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem

Authors: Mohsen Ziaee

Abstract:

In this paper, a mixed integer linear programming (MILP) model is presented to solve the flexible job shop scheduling problem (FJSP). This problem is one of the hardest combinatorial problems. The objective considered is the minimization of the makespan. The computational results of the proposed MILP model were compared with those of the best known mathematical model in the literature in terms of the computational time. The results show that our model has better performance with respect to all the considered performance measures including relative percentage deviation (RPD) value, number of constraints, and total number of variables. By this improved mathematical model, larger FJS problems can be optimally solved in reasonable time, and therefore, the model would be a better tool for the performance evaluation of the approximation algorithms developed for the problem.

Keywords: scheduling, flexible job shop, makespan, mixed integer linear programming

Procedia PDF Downloads 184
6995 Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem

Authors: Vijaya K. Srivastava, Davide Spinello

Abstract:

This paper presents established 3n enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method.

Keywords: integer programming, mixed integer programming, multi-objective optimization, Reliability Redundancy Allocation

Procedia PDF Downloads 171
6994 Bi-Criteria Vehicle Routing Problem for Possibility Environment

Authors: Bezhan Ghvaberidze

Abstract:

A multiple criteria optimization approach for the solution of the Fuzzy Vehicle Routing Problem (FVRP) is proposed. For the possibility environment the levels of movements between customers are calculated by the constructed simulation interactive algorithm. The first criterion of the bi-criteria optimization problem - minimization of the expectation of total fuzzy travel time on closed routes is constructed for the FVRP. A new, second criterion – maximization of feasibility of movement on the closed routes is constructed by the Choquet finite averaging operator. The FVRP is reduced to the bi-criteria partitioning problem for the so called “promising” routes which were selected from the all admissible closed routes. The convenient selection of the “promising” routes allows us to solve the reduced problem in the real-time computing. For the numerical solution of the bi-criteria partitioning problem the -constraint approach is used. An exact algorithm is implemented based on D. Knuth’s Dancing Links technique and the algorithm DLX. The Main objective was to present the new approach for FVRP, when there are some difficulties while moving on the roads. This approach is called FVRP for extreme conditions (FVRP-EC) on the roads. Also, the aim of this paper was to construct the solving model of the constructed FVRP. Results are illustrated on the numerical example where all Pareto-optimal solutions are found. Also, an approach for more complex model FVRP with time windows was developed. A numerical example is presented in which optimal routes are constructed for extreme conditions on the roads.

Keywords: combinatorial optimization, Fuzzy Vehicle routing problem, multiple objective programming, possibility theory

Procedia PDF Downloads 485
6993 Overcoming 4-to-1 Decryption Failure of the Rabin Cryptosystem

Authors: Muhammad Rezal Kamel Ariffin, Muhammad Asyraf Asbullah

Abstract:

The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by the 4-to-1 decryption output is overcome efficiently in this work. The proposed scheme to overcome the decryption failure issue (known as the AAβ-cryptosystem) is constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.

Keywords: Rabin cryptosystem, 4-to-1 decryption failure, square root modulo problem, integer factorization problem

Procedia PDF Downloads 475
6992 Nurse Schedule Problem in Mubarak Al Kabeer Hospital

Authors: Khaled Al-Mansour, Nawaf Esmael, Abdulaziz Al-Zaid, Mohammed Al Ateeqi, Ali Al-Yousfi, Sayed Al-Zalzalah

Abstract:

In this project we will create the new schedule of nurse according to the preference of them. We did our project in Mubarak Al Kabeer Hospital (in Kuwait). The project aims to optimize the schedule of nurses in Mubarak Al Kabeer Hospital. The schedule of the nurses was studied and understood well to do any modification for their schedule to make the nurses feel as much comfort as they are. First constraints were found to know what things we can change and what things we can’t, the hard constraints are the hospital and ministry policies where we can’t change anything about, and the soft constraints are things that make nurses more comfortable. Data were collected and nurses were interviewed to know what is more better for them. All these constraints and date have been formulated to mathematical equations. This report will first contain an introduction to the topic which includes details of the problem definition. It will also contain information regarding the optimization of a nurse schedule and its contents and importance; furthermore, the report will contain information about the data needed to solve the problem and how it was collected. The problem requires formulation and that is also to be shown. The methodology will be explained which will state what has already been done. We used the lingo software to find the best schedule for the nurse. The schedule has been made according to what the nurses prefer, and also took consideration of the hospital policy when we make the schedule.

Keywords: nurse schedule problem, Kuwait, hospital policy, optimization of schedules

Procedia PDF Downloads 268
6991 An Earth Mover’s Distance Algorithm Based DDoS Detection Mechanism in SDN

Authors: Yang Zhou, Kangfeng Zheng, Wei Ni, Ren Ping Liu

Abstract:

Software-defined networking (SDN) provides a solution for scalable network framework with decoupled control and data plane. However, this architecture also induces a particular distributed denial-of-service (DDoS) attack that can affect or even overwhelm the SDN network. DDoS attack detection problem has to date been mostly researched as entropy comparison problem. However, this problem lacks the utilization of SDN, and the results are not accurate. In this paper, we propose a DDoS attack detection method, which interprets DDoS detection as a signature matching problem and is formulated as Earth Mover’s Distance (EMD) model. Considering the feasibility and accuracy, we further propose to define the cost function of EMD to be a generalized Kullback-Leibler divergence. Simulation results show that our proposed method can detect DDoS attacks by comparing EMD values with the ones computed in the case without attacks. Moreover, our method can significantly increase the true positive rate of detection.

Keywords: DDoS detection, EMD, relative entropy, SDN

Procedia PDF Downloads 338
6990 Pricing European Continuous-Installment Options under Regime-Switching Models

Authors: Saghar Heidari

Abstract:

In this paper, we study the valuation problem of European continuous-installment options under Markov-modulated models with a partial differential equation approach. Due to the opportunity for continuing or stopping to pay installments, the valuation problem under regime-switching models can be formulated as coupled partial differential equations (CPDE) with free boundary features. To value the installment options, we express the truncated CPDE as a linear complementarity problem (LCP), then a finite element method is proposed to solve the resulted variational inequality. Under some appropriate assumptions, we establish the stability of the method and illustrate some numerical results to examine the rate of convergence and accuracy of the proposed method for the pricing problem under the regime-switching model.

Keywords: continuous-installment option, European option, regime-switching model, finite element method

Procedia PDF Downloads 137
6989 Multiparametric Optimization of Water Treatment Process for Thermal Power Plants

Authors: Balgaisha Mukanova, Natalya Glazyrina, Sergey Glazyrin

Abstract:

The formulated problem of optimization of the technological process of water treatment for thermal power plants is considered in this article. The problem is of multiparametric nature. To optimize the process, namely, reduce the amount of waste water, a new technology was developed to reuse such water. A mathematical model of the technology of wastewater reuse was developed. Optimization parameters were determined. The model consists of a material balance equation, an equation describing the kinetics of ion exchange for the non-equilibrium case and an equation for the ion exchange isotherm. The material balance equation includes a nonlinear term that depends on the kinetics of ion exchange. A direct problem of calculating the impurity concentration at the outlet of the water treatment plant was numerically solved. The direct problem was approximated by an implicit point-to-point computation difference scheme. The inverse problem was formulated as relates to determination of the parameters of the mathematical model of the water treatment plant operating in non-equilibrium conditions. The formulated inverse problem was solved. Following the results of calculation the time of start of the filter regeneration process was determined, as well as the period of regeneration process and the amount of regeneration and wash water. Multi-parameter optimization of water treatment process for thermal power plants allowed decreasing the amount of wastewater by 15%.

Keywords: direct problem, multiparametric optimization, optimization parameters, water treatment

Procedia PDF Downloads 387
6988 Efficient Filtering of Graph Based Data Using Graph Partitioning

Authors: Nileshkumar Vaishnav, Aditya Tatu

Abstract:

An algebraic framework for processing graph signals axiomatically designates the graph adjacency matrix as the shift operator. In this setup, we often encounter a problem wherein we know the filtered output and the filter coefficients, and need to find out the input graph signal. Solution to this problem using direct approach requires O(N3) operations, where N is the number of vertices in graph. In this paper, we adapt the spectral graph partitioning method for partitioning of graphs and use it to reduce the computational cost of the filtering problem. We use the example of denoising of the temperature data to illustrate the efficacy of the approach.

Keywords: graph signal processing, graph partitioning, inverse filtering on graphs, algebraic signal processing

Procedia PDF Downloads 311