Search results for: directional overcurrent relay coordination problem

Authors: Muktadir Ahmed, Sayed Akhlakur Rahaman, Mridha Shihab Mahmud

Abstract:

The parents of Bangladesh have scarcity of knowledge about children play. Most of them do not know which toys are perfect for their children. Appropriate toys for playing is one of the most significant parts of children development from early age, besides for proper amelioration of children’s mental growth and brain capacities, toys play an emergent role. So selection of proper toy for children is very important. A toy forms the sagacity of a child and instructs child’s attitude. In this era of globalization to keep pace with everything children toys are also going forward but in a deleterious way. Maximum toys are now battery-driven and for this psychological developments of children are not increasing in effective way; therefore, pedagogical toys are proper selection. This type of toy inspires the wisdom and helps a child to reveal himself/herself. Pedagogical toys are attractive to children and help to stimulate their imagination. Pedagogical toys help them to build senso-motoric skills and hand-eye coordination. In this study, some children divided into two groups, one group played with pedagogical toys and another group played with conventional toys. This study is going to exhibit the difference between pedagogical and conventional toys for kids. The main aim of this study is to reveal the potency of pedagogical toy for children. To implement this study two Daycare Centers (DCC) Projapoti 1 & 3 of Mymensingh city had chosen. Every DCC having 1.5-6 years old children but for this study 2-5 years old children had been selected. The children of Projapoti-1 played with pedagogical toys and the children of Projapoti-2 played with conventional toys. After 6 weeks of study, the children of Projapoti-1 proved that they have improved their skills more than those children of Projapoti-3 who were playing with conventional toys. The children of Projapoti-1 have developed their touch sensation, muscular movement, imitation power, hand-eye coordination whereas the children of Projapoti-3 have only developed their muscular movement fairly (while running after battery driven toys) which is not better than those children of Projapoti-1. They cannot imitate like the children of Projapoti-1. They just had fun from playing virtual games, battery driven toys, watching cartoons etc. Actually, it is not possible to develop a child’s brain without pedagogical toy.

Keywords: brain development, mental growth, pedagogical toys, play for children

Procedia PDF Downloads 321

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 178

Authors: Vijaya K. Srivastava, Davide Spinello

Abstract:

This paper presents established 3ⁿ 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 167

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 477

Authors: Awad Khireldin, Colin Law

Abstract:

Runways are the major infrastructure of airports around the world. Efficient operations of runways are key to ensure that airports are running smoothly with minimal delays. There are many factors that affect the efficiency of runway operations, such as the aircraft wake separation, runways system configuration, the fleet mix, and the runways separation distance. This paper aims to address how to maximize runway operations using a Discrete Event Simulation model. A case study of Cairo International Airport (CIA) is developed to maximize the utilizing of three parallel runways using a simulation model. Different scenarios have been designed where every runway could be assigned for arrival, departure, or mixed operations. A benchmarking study was also included to compare the actual to the proposed results to spot the potential improvements. The simulation model shows that there is a significant difference in utilization and delays between the actual and the proposed ones, there are several recommendations that can be provided to airport management, in the short and long term, to increase the efficiency and to reduce the delays. By including the recommendation with different operations scenarios, such as upgrading the airport slot Coordination from Level 1 to Level 2 in the short term. In the long run, discuss the possibilities to increase the International Air Transport association (IATA) slot coordination to Level 3 as more flights are expected to be handled by the airport. Technological advancements such as radar in the approach full airside simulation model could improve the airport performance where the airport is recommended to review the standard operations procedures with the appropriate authorities. Also, the airport can adopt a future operational plan to accommodate the forecasted additional traffic density in case of adding a fourth terminal building to increase the airport capacity.

Keywords: airport performance, runway, discrete event simulation, capacity, airside

Procedia PDF Downloads 114

Authors: Ron Dick, P. S. D. V. Prasadarao, Glenn Coltman

Abstract:

Agenesis of the corpus callosum (ACC) is a failure to develop corpus callosum - the large bundle of fibers of the brain that connects the two cerebral hemispheres. It can occur as a partial or complete absence of the corpus callosum. In the general population, its estimated prevalence rate is 1 in 4000 and a wide range of genetic, infectious, vascular, and toxic causes have been attributed to this heterogeneous condition. The diagnosis of ACC is often achieved by neuroimaging procedures. Though persons with ACC can perform normally on intelligence tests they generally present with a range of neuropsychological and social deficits. The deficit profile is characterized by poor coordination of motor movements, slow reaction time, processing speed and, poor memory. Socially, they present with deficits in communication, language processing, the theory of mind, and interpersonal relationships. The present paper illustrates the role of neuropsychological assessment with implications to psychosocial management in a case of agenesis of the corpus callosum. Method: A 27-year old left handed Caucasian male with a history of ACC was self-referred for a neuropsychological assessment to assist him in his employment options. Parents noted significant difficulties with coordination and balance at an early age of 2-3 years and he was diagnosed with dyspraxia at the age of 14 years. History also indicated visual impairment, hypotonia, poor muscle coordination, and delayed development of motor milestones. MRI scan indicated agenesis of the corpus callosum with ventricular morphology, widely spaced parallel lateral ventricles and mild dilatation of the posterior horns; it also showed colpocephaly—a disproportionate enlargement of the occipital horns of the lateral ventricles which might be affecting his motor abilities and visual defects. The MRI scan ruled out other structural abnormalities or neonatal brain injury. At the time of assessment, the subject presented with such problems as poor coordination, slowed processing speed, poor organizational skills and time management, and difficulty with social cues and facial expressions. A comprehensive neuropsychological assessment was planned and conducted to assist in identifying the current neuropsychological profile to facilitate the formulation of a psychosocial and occupational rehabilitation programme. Results: General intellectual functioning was within the average range and his performance on memory-related tasks was adequate. Significant visuospatial and visuoconstructional deficits were evident across tests; constructional difficulties were seen in tasks such as copying a complex figure, building a tower and manipulating blocks. Poor visual scanning ability and visual motor speed were evident. Socially, the subject reported heightened social anxiety, difficulty in responding to cues in the social environment, and difficulty in developing intimate relationships. Conclusion: Persons with ACC are known to present with specific cognitive deficits and problems in social situations. Findings from the current neuropsychological assessment indicated significant visuospatial difficulties, poor visual scanning and problems in social interactions. His general intellectual functioning was within the average range. Based on the findings from the comprehensive neuropsychological assessment, a structured psychosocial rehabilitation programme was developed and recommended.

Keywords: agenesis, callosum, corpus, neuropsychology, psychosocial, rehabilitation

Procedia PDF Downloads 273

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 459

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 264

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 329

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 133

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 383

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 306

Authors: Mustafa M. Donma, Ayşen Haksayar, Bahadır Batar, Buse Tepe, Birol Topçu, Orkide Donma

Abstract:

Childhood obesity is an ever-increasing health problem. The Association of obesity with severe chronic diseases such as diabetes and cardiovascular diseases makes the problem life-threatening. Aside from psychological, societal and metabolic factors, genetic polymorphisms have gained importance concerning etiology in recent years. The aim of this study was to evaluate the relationship between rs10455872 gene polymorphism in the Lipoprotein (a) locus and the development of childhood obesity. This was a prospective study carried out according to the Helsinki Declarations. The study protocol was approved by the Institutional Ethics Committee. This study was supported by Tekirdag Namik Kemal University Rectorate, Scientific Research Projects Coordination Unit. Project No: NKUBAP.02.TU.20.278. A total of 180 children (103 obese (OB) and 77 healthy), aged 6-18 years, without any acute or chronic disease, participated in the study. Two different groups were created: OB and healthy control. Each group was divided into two further groups depending on the nature of the polymorphism. Anthropometric measurements were taken during the detailed physical examination. Laboratory tests and TANITA measurements were performed. For the statistical evaluations, SPSS version 28.0 was used. A P-value smaller than 0.05 was the statistical significance degree. The distribution of lipoprotein (a) rs10455872 gene polymorphism did not differ between OB and healthy children. Children with AG genotype in both OB and control groups had lower body mass index (BMI), diagnostic obesity notation model assessment index (DONMA II), body fat ratio (BFR), C-reactive protein (CRP), and metabolic syndrome index (MetS index) values compared to children with normal AA genotype. In the OB group, serum iron, vitamin B12, hemoglobin, MCV, and MCH values were found to be higher in the AG genotype group than those of children with the normal AA genotype. A significant correlation was found between the MetS index and BFR among OB children with normal homozygous genotype. MetS index increased as BFR increased in this group. However, such a correlation was not observed in the OB group with heterozygous AG genotype. To the best of our knowledge, the association of lipoprotein (a) rs10455872 gene polymorphism with the etiology of childhood obesity has not been studied yet. Therefore, this study was the first report suggesting polymorphism with AG genotype as a good risk factor for obesity.

Keywords: child, gene polymorphism, lipoprotein (a), obesity, rs10455872

Procedia PDF Downloads 69

Authors: Christian Meinecke, Bernd Scholz-Reiter

Abstract:

The integrated problem of production and distribution scheduling is relevant in many industrial applications. Thus, many heuristics to solve this integrated problem have been developed in the last decade. Most of these heuristics use a sequential working principal or a single decomposition and integration approach to separate and solve sub-problems. A heuristic using a multi-step decomposition and integration approach is presented in this paper and evaluated in a case study. The result show significant improved results compared with sequential scheduling heuristics.

Keywords: production and outbound distribution, integrated planning, heuristic, decomposition, integration

Procedia PDF Downloads 425

Authors: Hichem Kmimech, Achref Jabeur Telmoudi, Lotfi Nabli

Abstract:

The estimation of the initial marking minimum (MIM) is a crucial problem in labeled Petri nets. In the case of multiple choices, the search for the initial marking leads to a problem of optimization of the minimum allocation of resources with two constraints. The first concerns the firing sequence that could be legal on the initial marking with respect to the firing vector. The second deals with the total number of tokens that can be minimal. In this article, the MIM problem is solved by the meta-heuristic particle swarm optimization (PSO). The proposed approach presents the advantages of PSO to satisfy the two previous constraints and find all possible combinations of minimum initial marking with the best computing time. This method, more efficient than conventional ones, has an excellent impact on the resolution of the MIM problem. We prove through a set of definitions, lemmas, and examples, the effectiveness of our approach.

Keywords: marking, production system, labeled Petri nets, particle swarm optimization

Procedia PDF Downloads 174

Authors: Elijah Cavan

Abstract:

In Major League Sports (MLB, NBA, NHL, NFL), it is the Front Office Staff (FOS) who make decisions about who plays for their respective team. The FOS bear the brunt of the responsibility for acquiring players through drafting, trading and signing players in free agency while typically contesting with maximum roster salary constraints. The players themselves are volatile assets of these teams- their value fluctuates with age and performance. A simple comparison can be made when viewing players as assets. The problem here is similar to that of optimizing your investment portfolio. The The goal is ultimately to maximize your periodic returns while tolerating a fixed risk (degree of uncertainty/ potential loss). Each franchise may value assets differently, and some may only tolerate lower risk levels- these are examples of factors that introduce additional constraints into the model. In this talk, we will detail the mathematical formulation of this problem as a constrained optimization problem- which can be solved with classical machine learning methods but is also well posed as a problem to be solved on quantum computers

Keywords: optimization, financial mathematics, sports analytics, simulated annealing

Procedia PDF Downloads 110

Authors: Francys Souza, Alberto Ohashi, Dorival Leao

Abstract:

We present a general solution for finding the ε-optimal controls for non-Markovian stochastic systems as stochastic differential equations driven by Brownian motion, which is a problem recognized as a difficult solution. The contribution appears in the development of mathematical tools to deal with modeling and control of non-Markovian systems, whose applicability in different areas is well known. The methodology used consists to discretize the problem through a random discretization. In this way, we transform an infinite dimensional problem in a finite dimensional, thereafter we use measurable selection arguments, to find a control on an explicit form for the discretized problem. Then, we prove the control found for the discretized problem is a ε-optimal control for the original problem. Our theory provides a concrete description of a rather general class, among the principals, we can highlight financial problems such as portfolio control, hedging, super-hedging, pairs-trading and others. Therefore, our main contribution is the development of a tool to explicitly the ε-optimal control for non-Markovian stochastic systems. The pathwise analysis was made through a random discretization jointly with measurable selection arguments, has provided us with a structure to transform an infinite dimensional problem into a finite dimensional. The theory is applied to stochastic control problems based on path-dependent stochastic differential equations, where both drift and diffusion components are controlled. We are able to explicitly show optimal control with our method.

Keywords: dynamic programming equation, optimal control, stochastic control, stochastic differential equation

Procedia PDF Downloads 182

Authors: Dorra Kallel, Ines Kanoun, Diala Dhouib

Abstract:

This paper elaborates a Systematic Literature Review SLR) to select the most outstanding studies that address the Menu Planning Problem (MPP) and to classify them according to the to the three following criteria: the used methods, types of patients and the required constraints. At first, a set of 4165 studies was selected. After applying the SLR’s guidelines, this collection was filtered to 13 studies using specific inclusion and exclusion criteria as well as an accurate analysis of each study. Second, the selected papers were invested to answer the proposed research questions. Finally, data synthesis and new perspectives for future works are incorporated in the closing section.

Keywords: Menu Planning Problem (MPP), Systematic Literature Review (SLR), classification, exact and approaches methods

Procedia PDF Downloads 272

Authors: Masoud Shahmanzari

Abstract:

The aim of this paper is to present a Variable Neighborhood Search (VNS) with Tabu Search (TS) conditions for the Roaming Salesman Problem (RSP). The RSP is a special case of the well-known traveling salesman problem (TSP) where a set of cities with time-dependent rewards and a set of campaign days are given. Each city can be visited on any day and a subset of cities can be visited multiple times. The goal is to determine an optimal campaign schedule consist of daily open/closed tours that visit some cities and maximizes the total net benefit while respecting daily maximum tour duration constraints and the necessity to return campaign base frequently. This problem arises in several real-life applications and particularly in election logistics where depots are not fixed. We formulate the problem as a mixed integer linear programming (MILP), in which we capture as many real-world aspects of the RSP as possible. We also present a hybrid metaheuristic algorithm based on a VNS with TS conditions. The initial feasible solution is constructed via a new matheuristc approach based on the decomposition of the original problem. Next, this solution is improved in terms of the collected rewards using the proposed local search procedure. We consider a set of 81 cities in Turkey and a campaign of 30 days as our largest instance. Computational results on real-world instances show that the developed algorithm could find near-optimal solutions effectively.

Keywords: optimization, routing, election logistics, heuristics

Procedia PDF Downloads 84

Authors: J. Andrade-Garda, A. Anguera, J. Ares-Casal, M. Hidalgo-Lorenzo, J.-A. Lara, D. Lizcano, S. Suárez-Garaboa

Abstract:

In the current constantly changing economic context, collaborative networks allow partners to undertake projects that would not be possible if attempted by them individually. These projects usually involve the performance of a group of tasks (named roles) that have to be distributed among the partners. Thus, an allocation/matching problem arises that will be referred to as Role-Partner Allocation problem. In real life this situation is addressed by negotiation between partners in order to reach ad hoc agreements. Besides taking a long time and being hard work, both historical evidence and economic analysis show that such approach is not recommended. Instead, the allocation process should be automated by means of a centralized matching scheme. However, as a preliminary step to start the search for such a matching mechanism (or even the development of a new one), the problem and its core components must be specified. To this end, this paper establishes (i) the definition of the problem and its constraints, (ii) the key features of the involved elements (i.e., roles and partners); and (iii) how to create preference lists both for roles and partners. Only this way it will be possible to conduct subsequent methodological research on the solution method.     

Keywords: collaborative network, matching, partner, preference list, role

Procedia PDF Downloads 226

Authors: Yu-Chen Hu

Abstract:

Gene editing by CRISPR and gene regulation by microRNA or CRISPR activation have dramatically changed the way to manipulate cellular gene expression and cell fate. In recent years, various gene editing and gene manipulation technologies have been applied to control stem cell differentiation to enhance tissue regeneration. This research will focus on how to develop CRISPR, CRISPR activation (CRISPRa), CRISPR inhibition (CRISPRi), as well as bi-directional CRISPR-AI gene regulation technologies to control cell differentiation and bone regeneration. Moreover, in this study, CRISPR/Cas13d-mediated RNA editng for miRNA editing and bone regeneration will be discussed.

Keywords: gene therapy, bone regeneration, stem cell, CRISPR, gene regulation

Procedia PDF Downloads 83

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 454

Authors: Sagir M. Yusuf, Chris Baber

Abstract:

In this paper, we describe how to achieve knowledge understanding and prediction (Situation Awareness (SA)) for multiple-agents conducting searching activity using Bayesian inferential reasoning and learning. Bayesian Belief Network was used to monitor agents' knowledge about their environment, and cases are recorded for the network training using expectation-maximisation or gradient descent algorithm. The well trained network will be used for decision making and environmental situation prediction. Forest fire searching by multiple UAVs was the use case. UAVs are tasked to explore a forest and find a fire for urgent actions by the fire wardens. The paper focused on two problems: (i) effective agents’ path planning strategy and (ii) knowledge understanding and prediction (SA). The path planning problem by inspiring animal mode of foraging using Lévy distribution augmented with Bayesian reasoning was fully described in this paper. Results proof that the Lévy flight strategy performs better than the previous fixed-pattern (e.g., parallel sweeps) approaches in terms of energy and time utilisation. We also introduced a waypoint assessment strategy called k-previous waypoints assessment. It improves the performance of the ordinary levy flight by saving agent’s resources and mission time through redundant search avoidance. The agents (UAVs) are to report their mission knowledge at the central server for interpretation and prediction purposes. Bayesian reasoning and learning were used for the SA and results proof effectiveness in different environments scenario in terms of prediction and effective knowledge representation. The prediction accuracy was measured using learning error rate, logarithm loss, and Brier score and the result proves that little agents mission that can be used for prediction within the same or different environment. Finally, we described a situation-based knowledge visualization and prediction technique for heterogeneous multi-UAV mission. While this paper proves linkage of Bayesian reasoning and learning with SA and effective searching strategy, future works is focusing on simplifying the architecture.

Keywords: Levy flight, distributed constraint optimization problem, multi-agent system, multi-robot coordination, autonomous system, swarm intelligence

Procedia PDF Downloads 139

Authors: Nuhu Mohammed Gali, Kenichi Matsui

Abstract:

Climate change poses a significant threat to agriculture and food security in Africa. The UNFCC recognized the need to address climate change adaptation in the broader context of sustainable development. African countries have initiated a governance system for adapting and responding to climate change in their Nationally Determined Contributions (NDCs). Despite the implementation limitations, Africa’s adaptation initiatives highlight the need to strengthen and expand adaptation responses. This paper looks at the extent to which South-South cooperation facilitates the implementation of adaptation actions between nations for agriculture and sustainable development. We conducted a literature review and content analysis of reports prepared by international organizations, reflecting the diversity of adaptation activities taking place in Sub-Saharan Africa. Our analysis of the connection between adaptation and nationally determined contributions (NDCs) showed that climate actions are mainstreamed into sustainable development. The NDCs in many countries on climate change adaptation action for agriculture aimed to strengthen the resilience of the poor. We found that climate-smart agriculture is the core of many countries target to end hunger. We revealed that South-South Cooperation, in terms of capacity, technology, and financial support, can help countries to achieve their climate action priorities and the Sustainable Development Goals (SDGs). We found that inadequate policy and regulatory frameworks between countries, differences in development priorities and strategies, poor communication, inadequate coordination, and the lack of local engagement and advocacy are some key barriers to South-South Cooperation in Africa. We recommend a multi-dimensional partnership, provisionoffinancialresources, systemic approach for coordination and engagement to promote and achieve the potential of SSC in Africa.

Keywords: climate change, adaptation, food security, sustainable development goals

Procedia PDF Downloads 120

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 361

Authors: M. Ramesh, Manish K. Niranjan

Abstract:

The electronic, structural and thermoelectric properties of Mg₂SiSn (110) surface are investigated within the framework of first principle density functional theory and semi classical Boltzmann approach. In particular, directional dependent thermoelectric properties such as electrical conductivity, thermal conductivity, Seebeck coefficient and figure of merit are explored. The (110)-oriented Mg₂SiSn surface exhibits narrow indirect band gap of ~0.17 eV. The thermoelectric properties are found to be significant along the y-axis at 300 K and along x-axis at 500 K. The figure of merit (ZT) for hole carrier concentration is found to be significantly large having magnitude 0.83 (along x-axis) at 500 K and 0.26 (y-axis) at 300 K. Our results suggest that Mg₂SiSn (110) surface is promising for various thermoelectric applications due to its overall good thermoelectric properties.

Keywords: thermoelectric, surface science, semiconducting silicide, first principles calculations

Procedia PDF Downloads 221

Authors: Weicheng Luo, Wenzhi Zhao

Abstract:

Plants growth in desert often suffered from stresses like water deficit, wind erosion and sand burial. Thus, plants in desert always have unique strategies to adapt these stresses. However, data regarding how clonal shrubs withstand wind erosion and sand burial in natural habitats remain relatively scarce. Therefore, we selected a common clonal shrub Calligonum arborescens to study the adaptive strategies of clonal plants to sand dune environment in a transitional zone of desert and Hexi Oasis of China. Our results show that sand burial is one of the essential prerequisites for the survival of C. arborescens rhizome fragments. Both the time and degrees of sand burial and wind erosion had significantly effects on clonal reproduction and growth of C. arborescens. With increasing burial depth, the number of ramets and biomass production significantly decreased. There is same change trend in severe erosion treatments. However, the number of ramets and biomass production significantly increased in moderate erosion treatments. Rhizome severed greatly decreased ramet number and biomass production under both sand burial and severe erosion treatments. That indicated that both sand burial and severe erosion had negative effects on the clonal growth of C. arborescens, but moderate wind erosion had positive effects. And rhizome connections alleviated the negative effects of sand burial and of severe erosion on the growth and performance of C. arborescens. Most fragments of C. arborescens grew in the directions of northeastern and southwestern. Ramet number and biomass, rhizome length and biomass in these two directions were significantly higher than those found in other directions. Interestingly, these directions were perpendicular to the prevailing wind direction. Distribution of C. arborescens differed in different habitats. The total number of individuals was significantly higher in inter-dune areas and on windward slopes than on the top and leeward slopes of dunes; more clonal ramets were produced on the top of dunes than elsewhere, and a few were found on leeward slopes. The mainly reason is that ramets on windward and top of dunes can easily suffered with moderated wind erosion which promoted clonal growth and reproduction of C. arborescens. These results indicated that C. arborescens adapted sand dune environment through directional growth and patchy distribution, and sand-burial and wind erosion were the key factors which led to the directional growth and patchiness of C. arborescens.

Keywords: adaptive strategy, Calligonum arborescens Litv, clonal fragment, desert-oasis transitional zone, sand burial and wind erosion

Procedia PDF Downloads 235

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 202

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 441

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 366