Search results for: constraint solving

Authors: Aouaouche Elmaouhab, Hassina Beggar

Abstract:

Solving multi-objective discrete optimization applications has always been limited by the resources of one machine: By computing power or by memory, most often both. To speed up the calculations, the grid computing represents a primary solution for the treatment of these applications through the parallelization of these resolution methods. In this work, we are interested in the study of some methods for solving multiple objective integer linear programming problem based on Branch-and-Bound and the study of grid computing technology. This study allowed us to propose an implementation of the method of Abbas and Al on the grid by reducing the execution time. To enhance our contribution, the main results are presented.

Keywords: multi-objective optimization, integer linear programming, grid computing, parallel computing

Procedia PDF Downloads 457

Authors: Yildiray Keskin, Omer Acan, Murat Akkus

Abstract:

In this paper, the solution of fractional diffusion equations is presented by means of the reduced differential transform method. Fractional partial differential equations have special importance in engineering and sciences. Application of reduced differential transform method to this problem shows the rapid convergence of the sequence constructed by this method to the exact solution. The numerical results show that the approach is easy to implement and accurate when applied to fractional diffusion equations. The method introduces a promising tool for solving many fractional partial differential equations.

Keywords: fractional diffusion equations, Caputo fractional derivative, reduced differential transform method, partial

Procedia PDF Downloads 495

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 448

Authors: Hitham Yami

Abstract:

This study will focus primarily on assessing the availability requirements of the electronic management of oil companies in Libya, and the mean objectives of the research applying electronic management and make recommendations and steps to approach electronic management. There are limited research and statistical analysis to support electronic management in Libyan companies. The groundwork for the proposed approach is to develop independent variables and the dependent variables to be restructured after it Alntra side of the field and the side to get the data to achieve the desired results and solving the problem faced by the Libyan Oil Corporation. All these strategies are proposed to achieve the goal, and solving Libyan oil installations.

Keywords: oil company’s revenue, independent variables, electronic management, Libyan oil corporation

Procedia PDF Downloads 239

Authors: Jelili Kunle Adedeji, Toeb Akorede Akinbola

Abstract:

The problem of vehicle mishap as a result of miscalculation, recklessness, or malfunction of some part in a vehicle is acknowledged to be a global issue. In most of the cases, it results into death or life injuries, all over the world; the issue becomes a nightmare to the stakeholders on how to curb mishaps on our roads due to these endemic factors. Hence this research typically examined the design of a device, specifically for learners that can lead to a society of intelligent vehicles (traffic) without withdrawing the driving authority from them, unlike pre-existing systems. Though ILASS shears a lot of principle with existing advance drivers assistance systems, yet there are two fundamental differences between ILASS system and existing systems. Firstly ILASS is meant to accept continuous input from the throttle at all time such that the devices will not constraint the driving process unnecessarily and ensure a change of speed at any point in time. Secondly, it made use of a variable threshold distance between the host vehicle and front vehicle which can be set by the host driver under the constraint of road maintenance agency, who communicates the minimum possible threshold for a different lane to the host vehicle. The results obtained from the simulation of the ILASS system concluded that ILASS is a good solution to road accidents, particularly road accident which occurs as a result of driving at high speed.

Keywords: front-vehicle, host-speed, threshold-distance, ILASS

Procedia PDF Downloads 149

Authors: Wolfram Jahn, Jose Manuel Munita

Abstract:

While computational fluid dynamics (CFD) simulations of fire scenarios are commonly used in the design of buildings, less attention has been given to the use of CFD simulations as an operational tool for the fire services. The reason of this lack of attention lies mainly in the fact that CFD simulations typically take large periods of time to complete, and their results would thus not be available in time to be of use during an emergency. Firefighters often face uncertain conditions when entering a building to attack a fire. They would greatly benefit from a technology based on predictive fire simulations, able to assist their decision-making process. The principal constraint to faster CFD simulations is the fine grid necessary to solve accurately the physical processes that govern a fire. This paper explores the possibility of overcoming this constraint and using coarse grid CFD simulations for fire scenarios, and proposes a methodology to use the simulation results in a meaningful way that can be used by the fire fighters during an emergency. Data from real scale compartment fire tests were used to compare CFD fire models with different grid arrangements, and empirical correlations were obtained to interpolate data points into the grids. The results show that the strongly predominant effect of the heat release rate of the fire on the fluid dynamics allows for the use of coarse grids with relatively low overall impact of simulation results. Simulations with an acceptable level of accuracy could be run in real time, thus making them useful as a forecasting tool for emergency response purposes.

Keywords: CFD, fire simulations, emergency response, forecast

Procedia PDF Downloads 289

Authors: Milad Yousefi, Moslem Yousefi, Ricarpo Poley, Amer Nordin Darus

Abstract:

Design optimization of heat exchangers is a very complicated task that has been traditionally carried out based on a trial-and-error procedure. To overcome the difficulties of the conventional design approaches especially when a large number of variables, constraints and objectives are involved, a new method based on a well-stablished evolutionary algorithm, particle swarm optimization (PSO), weighted sum approach and a novel constraint handling strategy is presented in this study. Since, the conventional constraint handling strategies are not effective and easy-to-implement in multi-objective algorithms, a novel feasibility-based ranking strategy is introduced which is both extremely user-friendly and effective. A case study from industry has been investigated to illustrate the performance of the presented approach. The results show that the proposed algorithm can find the near pareto-optimal with higher accuracy when it is compared to conventional non-dominated sorting genetic algorithm II (NSGA-II). Moreover, the difficulties of a trial-and-error process for setting the penalty parameters is solved in this algorithm.

Keywords: Heat exchanger, Multi-objective optimization, Particle swarm optimization, NSGA-II Constraints handling.

Procedia PDF Downloads 534

Authors: S. A. M. Yatim, Z. B. Ibrahim, K. I. Othman, M. Suleiman

Abstract:

The method of solving second order stiff ordinary differential equation (ODEs) that is based on backward differentiation formula (BDF) is considered in this paper. We derived the method by increasing the order of the existing method using an improved strategy in choosing the step size. Numerical results are presented to compare the efficiency of the proposed method to the MATLAB’s suite of ODEs solvers namely ode15s and ode23s. The method was found to be efficient to solve second order ordinary differential equation.

Keywords: backward differentiation formulae, block backward differentiation formulae, stiff ordinary differential equation, variable step size

Procedia PDF Downloads 472

Authors: Mustafa Ekici

Abstract:

Natural convection is a basic process which is important in a wide variety of practical applications. In essence, a heated fluid expands and rises from buoyancy due to decreased density. Numerous papers have been written on natural or mixed convection in vertical ducts heated on the side. These equations have been proved to be valuable tools for the modelling of many phenomena such as fluid dynamics. Finding solutions to such equations or system of equations are in general not an easy task. We propose a method, which is called differential transform method, of solving a non-linear equations and compare the results with some of the other techniques. Illustrative examples shows that the results are in good agreement.

Keywords: differential transform method, momentum, energy equation, boundry value problem

Procedia PDF Downloads 438

Authors: Guilherme Baldo Carlos

Abstract:

The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving.

Keywords: genetic algorithm, evolutionary algorithm, scheduling, flexible job-shop scheduling

Procedia PDF Downloads 121

Authors: Angel G. De Leon Hernandez

Abstract:

A structure is defined as a physical system or, in certain cases, an arrangement of connected elements, capable of bearing certain loads. The structures are presented in every part of the daily life, e.g., in the designing of buildings, vehicles and mechanisms. The main goal of a structure designer is to develop a secure, aesthetic and maintainable system, considering the constraint imposed to every case. With the advances in the technology during the last decades, the capabilities of solving engineering problems have increased enormously. Nowadays the computers, play a critical roll in the structural analysis, pitifully, for university students the vast majority of these software are inaccessible due to the high complexity and cost they represent, even when the software manufacturers offer student versions. This is exactly the reason why the idea of developing a more reachable and easy-to-use computing tool. This program is designed as a tool for the university students enrolled in courser related to the structures analysis and designs, as a complementary instrument to achieve a better understanding of this area and to avoid all the tedious calculations. Also, the program can be useful for graduated engineers in the field of structural design and analysis. A graphical user interphase is included in the program to make it even simpler to operate it and understand the information requested and the obtained results. In the present document are included the theoretical basics in which the program is based to solve the structural analysis, the logical path followed in order to develop the program, the theoretical results, a discussion about the results and the validation of those results.

Keywords: stiffness matrix method, structural analysis, Matlab® applications, programming

Procedia PDF Downloads 98

Authors: Yang-Kuei Lin, Yin-Yi Chou

Abstract:

In this research, we have considered operating room scheduling problem. The objective is to minimize total operating cost. The total operating cost includes idle cost and overtime cost. We have proposed a dispatching rule that can guarantee to find feasible solutions for the studied problem efficiently. We compared the proposed dispatching rule with the optimal solutions found by solving Inter Programming, and other solutions found by using modified existing dispatching rules. The computational results indicates that the proposed heuristic can find near optimal solutions efficiently.

Keywords: assignment, dispatching rule, operation rooms, scheduling

Procedia PDF Downloads 210

Authors: Baobao Chang, Konrad Schneider, Vogel Roland, Gert Heinrich

Abstract:

In this work, the influence of annealing on the mechanical αc-relaxation behavior of isotactic polypropylene (iPP) was investigated. The results suggest that the mechanical αc-relaxation behavior depends strongly on the confinement force on the polymer chains in the intermediate phase and the thickness of the intermediate phase. After quenching at 10°C, abundant crystallites with a wide size distribution are formed. The polymer chains in the intermediate phase are constrained by the crystallites, giving rise to one broad αc-relaxation peak. With an annealing temperature between 60°C~105°C, imperfect lamellae melting releases part of the constraint force, which reduces the conformational ordering of the polymer chains neighboring the amorphous phase. Consequently, two separate αc-relaxation peaks could be observed which are labeled as αc1-relaxation and αc2-relaxation. αc1-relaxation and αc2-relaxation describe the relaxation behavior of polymer chains in the region close to the amorphous phase and the crystalline phase, respectively. Both relaxation peaks shift to a higher temperature as annealing temperature increases. With an annealing temperature higher than 105°C, the new crystalline phase is formed in the intermediate phase, which enhances the constraint force on the polymer chains. αc1-relaxation peak is broadened obviously and its position shifts to a higher temperature as annealing temperature increases. Moreover, αc2-relaxation is undetectable because that the polymer chains in the region between the initial crystalline phase and the newly formed crystalline phase are strongly confined.

Keywords: annealing, αc-relaxation, isotactic-polypropylene, intermediate phase

Procedia PDF Downloads 322

Authors: Anne Mette Nyvad, Ken Ramshøj Christensen

Abstract:

In the syntax literature, it has standardly been assumed that relative clauses and complement wh-clauses are islands for extraction in English, and that constraints on extraction from syntactic islands are universal. However, the Mainland Scandinavian languages has been known to provide counterexamples. Previous research on Danish has shown that neither relative clauses nor embedded questions are strong islands in Danish. Instead, extraction from this type of syntactic environment is degraded due to structural complexity and it interacts with nonstructural factors such as the frequency of occurrence of the matrix verb, the possibility of temporary misanalysis leading to semantic incongruity and exposure over time. We argue that these facts can be accounted for with parametric variation in the availability of CP-recursion, resulting in the patterns observed, as Danish would then “suspend” the ban on movement out of relative clauses and embedded questions. Given that Danish does not seem to adhere to allegedly universal syntactic constraints, such as the Complex NP Constraint and the Wh-Island Constraint, what happens in L2 English? We present results from a study investigating how native Danish speakers judge extractions from island structures in L2 English. Our findings suggest that Danes transfer their native language parameter setting when asked to judge island constructions in English. This is compatible with the Full Transfer Full Access Hypothesis, as the latter predicts that Danish would have difficulties resetting their [+/- CP-recursion] parameter in English because they are not exposed to negative evidence.

Keywords: syntax, islands, second language acquisition, danish

Procedia PDF Downloads 92

Authors: Z. B. Ibrahim, N. Ismail, K. I. Othman

Abstract:

Fuzzy Differential Equations (FDEs) play an important role in modelling many real life phenomena. The FDEs are used to model the behaviour of the problems that are subjected to uncertainty, vague or imprecise information that constantly arise in mathematical models in various branches of science and engineering. These uncertainties have to be taken into account in order to obtain a more realistic model and many of these models are often difficult and sometimes impossible to obtain the analytic solutions. Thus, many authors have attempted to extend or modified the existing numerical methods developed for solving Ordinary Differential Equations (ODEs) into fuzzy version in order to suit for solving the FDEs. Therefore, in this paper, we proposed the development of a fuzzy version of three-point block method based on Block Backward Differentiation Formulas (FBBDF) for the numerical solution of first order FDEs. The three-point block FBBDF method are implemented in uniform step size produces three new approximations simultaneously at each integration step using the same back values. Newton iteration of the FBBDF is formulated and the implementation is based on the predictor and corrector formulas in the PECE mode. For greater efficiency of the block method, the coefficients of the FBBDF are stored at the start of the program. The proposed FBBDF is validated through numerical results on some standard problems found in the literature and comparisons are made with the existing fuzzy version of the Modified Simpson and Euler methods in terms of the accuracy of the approximated solutions. The numerical results show that the FBBDF method performs better in terms of accuracy when compared to the Euler method when solving the FDEs.

Keywords: block, backward differentiation formulas, first order, fuzzy differential equations

Procedia PDF Downloads 294

Authors: Mohammed Belloufi, Rachid Benzine, Badreddine Sellami

Abstract:

Conjugate gradient methods is useful for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. It is well known that the search direction plays a main role in the line search method. In this paper, we propose a search direction with the Wolfe line search technique for solving unconstrained optimization problems. Under the above line searches and some assumptions, the global convergence properties of the given methods are discussed. Numerical results and comparisons with other CG methods are given.

Keywords: unconstrained optimization, conjugate gradient method, strong Wolfe line search, global convergence

Procedia PDF Downloads 390

Authors: Yun Hang Stanley Cheung

Abstract:

In recent years, many educators and entrepreneurs have often suggested that students’ and workers’ ability of the adversity response is very important, it would affect problem-solving strategies and ultimate success in their career or life. The meaning of resilience is discussed as the process of bouncing back and the ability to adapt well in adversity’s response, being resilient does not mean to live without any stress and difficulty, but to grow and thrive under pressure. The purpose of this study is to describe the process of resilience and adversity’s response. The use of the narrative inquiry aims for understanding the experiential process of adversity response, and the problem-solving strategies (such as emotion control, motivation, decisions making process), as well as making the experience become life story, which may be evaluated by its teller and its listeners. The narrative study describes the researcher’s self-experience of adversity’s response to the recovery of the seriously burnt injury from a hill fire at his 12 years old, as well as the adversities and obstacles related to the tragedy after the physical recovery. Sense-Making Theory and McCormack’s Lenses were used for constructive perspective and data analyzing. To conclude, this study has described the life story of fighting the adversities, also, those narratives come out some suggestions, which point out positive thinking is necessary to build up resilience and the ability of immediate adversity response. Also, some problem-solving strategies toward adversities are discussed, which are helpful for resilience education for youth and young adult.

Keywords: adversity response, life story, narrative inquiry, resilience

Procedia PDF Downloads 277

Authors: Leizhang Wang, Baocang Wang

Abstract:

General Sieve Kernel (G6K) is considered as currently the fastest algorithm for the shortest vector problem (SVP) and record holder of open SVP challenge. We study the lattice basis quality improvement effects of the Workout proposed in G6K, which is composed of a series of pumps to solve SVP. Firstly, we use a low-dimensional pump output basis to propose a predictor to predict the quality of high-dimensional Pumps output basis. Both theoretical analysis and experimental tests are performed to illustrate that it is more computationally expensive to solve the LWE problems by using a G6K default SVP solving strategy (Workout) than these lattice reduction algorithms (e.g. BKZ 2.0, Progressive BKZ, Pump, and Jump BKZ) with sieving as their SVP oracle. Secondly, the default Workout in G6K is optimized to achieve a stronger reduction and lower computational cost. Thirdly, we combine the optimized Workout and the Pump output basis quality predictor to further reduce the computational cost by optimizing LWE instances selection strategy. In fact, we can solve the TU LWE challenge (n = 65, q = 4225, = 0:005) 13.6 times faster than the G6K default Workout. Fourthly, we consider a combined two-stage (Preprocessing by BKZ- and a big Pump) LWE solving strategy. Both stages use dimension for free technology to give new theoretical security estimations of several LWE-based cryptographic schemes. The security estimations show that the securities of these schemes with the conservative Newhope’s core-SVP model are somewhat overestimated. In addition, in the case of LAC scheme, LWE instances selection strategy can be optimized to further improve the LWE-solving efficiency even by 15% and 57%. Finally, some experiments are implemented to examine the effects of our strategies on the Normal Form LWE problems, and the results demonstrate that the combined strategy is four times faster than that of Newhope.

Keywords: LWE, G6K, pump estimator, LWE instances selection strategy, dimension for free

Procedia PDF Downloads 38

Authors: Sagir M. Yusuf, Chris Baber

Abstract:

In this paper, we describe how Bayesian inferential reasoning will contributes in obtaining a well-satisfied prediction for Distributed Constraint Optimization Problems (DCOPs) with uncertainties. We also demonstrate how DCOPs could be merged to multi-agent knowledge understand and prediction (i.e. Situation Awareness). The DCOPs functions were merged with Bayesian Belief Network (BBN) in the form of situation, awareness, and utility nodes. We describe how the uncertainties can be represented to the BBN and make an effective prediction using the expectation-maximization algorithm or conjugate gradient descent algorithm. The idea of variable prediction using Bayesian inference may reduce the number of variables in agents’ sampling domain and also allow missing variables estimations. Experiment results proved that the BBN perform compelling predictions with samples containing uncertainties than the perfect samples. That is, Bayesian inference can help in handling uncertainties and dynamism of DCOPs, which is the current issue in the DCOPs community. We show how Bayesian inference could be formalized with Distributed Situation Awareness (DSA) using uncertain and missing agents’ data. The whole framework was tested on multi-UAV mission for forest fire searching. Future work focuses on augmenting existing architecture to deal with dynamic DCOPs algorithms and multi-agent information merging.

Keywords: DCOP, multi-agent reasoning, Bayesian reasoning, swarm intelligence

Procedia PDF Downloads 95

Authors: Manideepa Saha, Jahnavi Chakrabarty

Abstract:

Generalized Jacobi (GJ) and Generalized Gauss-Seidel (GGS) methods are most effective than conventional Jacobi and Gauss-Seidel methods for solving linear system of equations. It is known that GJ and GGS methods converge for strictly diagonally dominant (SDD) and for M-matrices. In this paper, we study the convergence of GJ and GGS converge for symmetric positive definite (SPD) matrices, L-matrices and H-matrices. We introduce a generalization of successive overrelaxation (SOR) method for solving linear systems and discuss its convergence for the classes of SDD matrices, SPD matrices, M-matrices, L-matrices and for H-matrices. Advantages of generalized SOR method are established through numerical experiments over GJ, GGS, and SOR methods.

Keywords: convergence, Gauss-Seidel, iterative method, Jacobi, SOR

Procedia PDF Downloads 158

Authors: Ouafa Amira, Jiangshe Zhang

Abstract:

Clustering is an unsupervised machine learning technique; its aim is to extract the data structures, in which similar data objects are grouped in the same cluster, whereas dissimilar objects are grouped in different clusters. Clustering methods are widely utilized in different fields, such as: image processing, computer vision , and pattern recognition, etc. Fuzzy c-means clustering (fcm) is one of the most well known fuzzy clustering methods. It is based on solving an optimization problem, in which a minimization of a given cost function has been studied. This minimization aims to decrease the dissimilarity inside clusters, where the dissimilarity here is measured by the distances between data objects and cluster centers. The degree of belonging of a data point in a cluster is measured by a membership function which is included in the interval [0, 1]. In fcm clustering, the membership degree is constrained with the condition that the sum of a data object’s memberships in all clusters must be equal to one. This constraint can cause several problems, specially when our data objects are included in a noisy space. Regularization approach took a part in fuzzy c-means clustering technique. This process introduces an additional information in order to solve an ill-posed optimization problem. In this study, we focus on regularization by relative entropy approach, where in our optimization problem we aim to minimize the dissimilarity inside clusters. Finding an appropriate membership degree to each data object is our objective, because an appropriate membership degree leads to an accurate clustering result. Our clustering results in synthetic data sets, gaussian based data sets, and real world data sets show that our proposed model achieves a good accuracy.

Keywords: clustering, fuzzy c-means, regularization, relative entropy

Procedia PDF Downloads 242

Authors: Mohammadreza Akbari, Pooya Soleimani Besheli, Reza khalili, Sara Akbari, Davood Domiri Ganji

Abstract:

In this symposium, our aims are accuracy, capabilities and power at solving of the complicate non-linear differential at the reaction chemical in the catalyst reactor (heterogeneous reaction). Our purpose is to enhance the ability of solving the mentioned nonlinear differential equations at chemical engineering and similar issues with a simple and innovative approach which entitled ‘’Akbari-Ganji's Method’’ or ‘’AGM’’. In this paper we solve many examples of nonlinear differential equations of chemical reactions and its investigate. The chemical reactor with the energy changing (non-isotherm) in two reactors of mixed and plug are separately studied and the nonlinear differential equations obtained from the reaction behavior in these systems are solved by a new method. Practically, the reactions with the energy changing (heat or cold) have an important effect on designing and function of the reactors. This means that possibility of reaching the optimal conditions of operation for the maximum conversion depending on nonlinear nature of the reaction velocity toward temperature, results in the complexity of the operation in the reactor. In this case, the differential equation set which governs the reactors can be obtained simultaneous solution of mass equilibrium and energy and temperature changing at concentration.

Keywords: new method (AGM), nonlinear differential equation, tubular and mixed reactors, catalyst bed

Procedia PDF Downloads 354

Authors: Irena Smetackova

Abstract:

The important part of school mathematics are word problems which represent the connection between school knowledge and life reality. To find the reasons why students consider word problems to be difficult, it is necessary to take into consideration the motivational settings, besides mathematical knowledge and reading skills. Our goal is to identify whether the familiar or unfamiliar context of math word problem influences solving success rate and if so, whether the reasons are motivational or cognitive. For this purpose, we conducted three steps study in group of fifty pupils 9-10 years old. In the first step, we asked pupils to create ‘the best’ word problems for entered numerical formula. The set of 19 word problems with different contexts were selected. In the second step, pupils were asked to evaluate (without solving) how they like each item and how easy it is for them. The 6 word problems with low preference and low estimated success rate were selected and combined with other 6 problems with high preference and success rate. In the third step, the same pupils were asked to solve the word problems. The analysis showed that pupils attitudes and solving toward word problems varied by the context. The strong gender patterns both in preferred contexts and in estimated success rates were identified however the real success rate did not differ so strongly. The success gap between word problems with and without preferred contexts were stronger than the gap between problems with and without real experience with the context. The hypothesis that motivational factors are more important than cognitive factors was confirmed.

Keywords: mathematics, context of reality, motivation, cognition, word problems

Procedia PDF Downloads 169

Authors: Reina Kawase, Yuzuru Matsuoka

Abstract:

To mitigate climate change, to reduce CO2 emission from steel sector, energy intensive sector, is essential. One of the effective countermeasure is recycling of iron scrap and shifting to electric arc furnace. This research analyzes the feasibility of iron scrap recycling with considering demand-supply balance and quantifies the effective by CO2 emission reduction. Generally, the quality of steel made from iron scrap is lower than the quality of steel made from basic oxygen furnace. So, the constraint of demand side is goods-wise steel demand and that of supply side is generation of iron scap. Material Stock and Flow Model (MSFM_demand) was developed to estimate goods-wise steel demand and generation of iron scrap and was applied to 35 regions which aggregated countries in the world for 2005-2050. The crude steel production was estimated under two case; BaU case (No countermeasures) and CM case (With countermeasures). For all the estimation periods, crude steel production is greater than generation of iron scrap. This makes it impossible to substitute electric arc furnaces for all the basic oxygen furnaces. Even though 100% recycling rate of iron scrap, under BaU case, CO2 emission in 2050 increases by 12% compared to that in 2005. With same condition, 32% of CO2 emission reduction is achieved in CM case. With a constraint from demand side, the reduction potential is 6% (CM case).

Keywords: iron scrap recycling, CO2 emission reduction, steel demand, MSFM demand

Procedia PDF Downloads 524

Authors: Khushi Chhajed

Abstract:

Context: Color has been found to have an impact on cognitive performance. Due to the negative connotation associated with red, it has been found to impair performance on intellectual tasks. Aim: This study aims to assess the effect of color on individuals' anagram solving ability. Methodology: An experimental study was conducted on 66 participants in the age group of 18–24 years. A self-made anagram assessment tool was administered. Participants were expected to solve the tool in three colors- red, blue and grey. Results: A lower score was found when presented with the color blue as compared to red. The study also found that participants took relatively greater time to solve the red colored sheet. However these results are inconsistent with pre-existing literature. Conclusion: Hence, an association between color and performance on cognitive tasks can be seen. Future directions and potential limitations are discussed.

Keywords: color psychology, experiment, anagram, performance

Procedia PDF Downloads 58

Authors: Karla Hrbackova, Irena Balaban Cakirpaloglu

Abstract:

This paper is a report on self-regulation in socially rejected pupils. A certain form of social rejection can be found in almost every class within the school environment. Research shows that due to social rejection mechanisms supporting the individual´s effort of reintegration into the group are not triggered. Paradoxically the opposite tendency arises, i.e., an increase in selfish and defeating behaviour. The link between peer exposure and self-regulation is likely to vary as a function of a type and quality of peer interaction (e.g., rejection or acceptance). The paper aims to clarify the level of self-regulation related to interpersonal cognitive problem-solving within the process of social rejection in a school class. The research was done on a sample of 1,133 upper-primary school pupils using the Means-Ends Problem Solving technique (MEPS) and peer sociometric nomination. The results showed that the level of self-regulated skills is related to the status of social rejection. Socially rejected pupils achieve lower levels of self-regulation than other classmates. We found deficiency in the regulation of behaviour, emotions and the regulation of will in the peer rejected pupils with the exception of cognitive regulation in which no differences were detected between socially rejected pupils and other classmates. The results have implications for early prevention and intervention efforts to foster adaptive self-regulation and reduce the risk of later social rejection.

Keywords: interpersonal cognitive problem-solving, self-regulation, socially rejected pupils, upper-primary school pupils

Procedia PDF Downloads 147

Authors: Anteneh Getachew Gebrie, Rabian Wangkeeree

Abstract:

The purpose of this paper is to introduce iterative algorithm solving split system of minimization problem given as a task of finding a common minimizer point of finite family of proper, lower semicontinuous convex functions and whose image under a bounded linear operator is also common minimizer point of another finite family of proper, lower semicontinuous convex functions. We obtain strong convergence of the sequence generated by our algorithm under some suitable conditions on the parameters. The iterative schemes are developed with a way of selecting the step sizes such that the information of operator norm is not necessary. Some applications and numerical experiment is given to analyse the efficiency of our algorithm.

Keywords: Hilbert Space, minimization problems, Moreau-Yosida approximate, split feasibility problem

Procedia PDF Downloads 113

Authors: Fuziyah Ishak, Siti Norazura Ahmad

Abstract:

Volterra integro-differential equations appear in many models for real life phenomena. Since analytical solutions for this type of differential equations are hard and at times impossible to attain, engineers and scientists resort to numerical solutions that can be made as accurately as possible. Conventionally, numerical methods for ordinary differential equations are adapted to solve Volterra integro-differential equations. In this paper, numerical solution for solving Volterra integro-differential equation using extended trapezoidal method is described. Formulae for the integral and differential parts of the equation are presented. Numerical results show that the extended method is suitable for solving first order Volterra integro-differential equations.

Keywords: accuracy, extended trapezoidal method, numerical solution, Volterra integro-differential equations

Procedia PDF Downloads 397

Authors: Eki Ruskartina, Vincent F. Yu, Budi Santosa, A. A. N. Perwira Redi

Abstract:

This paper introduces symbiotic organism search (SOS) for solving capacitated vehicle routing problem (CVRP). SOS is a new approach in metaheuristics fields and never been used to solve discrete problems. A sophisticated decoding method to deal with a discrete problem setting in CVRP is applied using the basic symbiotic organism search (SOS) framework. The performance of the algorithm was evaluated on a set of benchmark instances and compared results with best known solution. The computational results show that the proposed algorithm can produce good solution as a preliminary testing. These results indicated that the proposed SOS can be applied as an alternative to solve the capacitated vehicle routing problem.

Keywords: symbiotic organism search, capacitated vehicle routing problem, metaheuristic

Procedia PDF Downloads 604

Authors: Javad Jamali Khouei, Mohammadreza Khoshravan

Abstract:

Considering that application of functionally graded material is increasing in most industries, it seems necessary to present a methodology for designing optimal profile of structures such as plate under mechanical loading which is highly consumed in industries. Therefore, volume fraction variation profile of functionally graded circular plate which has been considered two-directional is optimized so that stress of structure is minimized. For this purpose, equilibrium equations of two-directional functionally graded circular plate are solved by applying semi analytical-numerical method under mechanical loading and support conditions. By solving equilibrium equations, deflections and stresses are obtained in terms of control variables of volume fraction variation profile. As a result, the problem formula can be defined as an optimization problem by aiming at minimization of critical von-mises stress under constraints of deflections, stress and a physical constraint relating to structure of material. Then, the related problem can be solved with help of one of the metaheuristic algorithms such as genetic algorithm. Results of optimization for the applied model under constraints and loadings and boundary conditions show that functionally graded plate should be graded only in radial direction and there is no need for volume fraction variation of the constituent particles in thickness direction. For validating results, optimal values of the obtained design variables are graphically evaluated.

Keywords: two-directional functionally graded material, single objective optimization, semi analytical-numerical solution, genetic algorithm, graphical solution with contour

Procedia PDF Downloads 257