Search results for: charging problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 7207

Search results for: charging problem

7147 Flywheel Energy Storage Control Using SVPWM for Small Satellites Application

Authors: Noha El-Gohary, Thanaa El-Shater, A. A. Mahfouz, M. M. Sakr

Abstract:

Searching for high power conversion efficiency and long lifetime are important goals when designing a power supply subsystem for satellite applications. To fulfill these goals, this paper presents a power supply subsystem for small satellites in which flywheel energy storage system is used as a secondary power source instead of chemical battery. In this paper, the model of flywheel energy storage system is introduced; a DC bus regulation control algorithm for charging and discharging of flywheel based on space vector pulse width modulation technique and motor current control is also introduced. Simulation results showed the operation of the flywheel for charging and discharging mode during illumination and shadowed period. The advantages of the proposed system are confirmed by the simulation results of the power supply system.

Keywords: small-satellites, flywheel energy storage system, space vector pulse width modulation, power conversion

Procedia PDF Downloads 373
7146 Low-Cost Wireless Power Transfer System for Smart Recycling Containers

Authors: Juan Luis Leal, Rafael Maestre, Ovidio López

Abstract:

As innovation progresses, more possibilities are made available to increase the efficiency and reach of solutions for Smart Cities, most of which require the data provided by the Internet of Things (IoT) devices and may even have higher power requirements such as motors or actuators. A reliable power supply with the lowest maintenance is a requirement for the success of these solutions in the long term. Energy harvesting, mainly solar, becomes the solution of choice in most cases, but only if there is enough power to be harvested, which may depend on the device location (e.g., outdoors vs. indoor). This is the case of Smart Waste Containers with compaction systems, which have moderately high-power requirements, and may be installed in places with little sunlight for solar generation. It should be noted that waste is unloaded from the containers with cranes, so sudden and irregular movements may happen, making wired power unviable. In these cases, a wireless power supply may be a great alternative. This paper proposes a cost-effective two coil resonant wireless power transfer (WPT) system and describes its implementation, which has been carried out within an R&D project and validated in real settings with smart containers. Experimental results prove that the developed system achieves wireless power transmission up to 35W in the range of 5 cm to 1 m with a peak efficiency of 78%. The circuit is operated at relatively low resonant frequencies, which combined with enough wire-to-wire separation between the coil windings, reduce the losses caused by the proximity effect and, therefore, allow the use of common stranded wire instead of Litz wire, this without reducing the efficiency significantly. All these design considerations led to a final system that achieves a high efficiency for the desired charging range, simplifying the energy supply for Smart Containers as well as other devices that may benefit from a cost-effective wireless charging system.

Keywords: electromagnetic coupling, resonant wireless charging, smart recycling containers, wireless power transfer

Procedia PDF Downloads 67
7145 Using Convergent and Divergent Thinking in Creative Problem Solving in Mathematics

Authors: Keng Keh Lim, Zaleha Ismail, Yudariah Mohammad Yusof

Abstract:

This paper aims to find out how students using convergent and divergent thinking in creative problem solving to solve mathematical problems creatively. Eight engineering undergraduates in a local university took part in this study. They were divided into two groups. They solved the mathematical problems with the use of creative problem solving skills. Their solutions were collected and analyzed to reveal all the processes of problem solving, namely: problem definition, ideas generation, ideas evaluation, ideas judgment, and solution implementation. The result showed that the students were able to solve the mathematical problem with the use of creative problem solving skills.

Keywords: convergent thinking, divergent thinking, creative problem solving, creativity

Procedia PDF Downloads 321
7144 Fuzzy Vehicle Routing Problem for Extreme Environment

Authors: G. Sirbiladze, B. Ghvaberidze, B. Matsaberidze

Abstract:

A fuzzy vehicle routing problem is considered in the possibilistic environment. A new criterion, maximization of expectation of reliability for movement on closed routes is constructed. The objective of the research is to implement a two-stage scheme for solution of this problem. Based on the algorithm of preferences on the first stage, the sample of so-called “promising” routes will be selected. On the second stage, for the selected promising routes new bi-criteria problem will be solved - minimization of total traveled distance and maximization of reliability of routes. The problem will be stated as a fuzzy-partitioning problem. Two possible solutions of this scheme are considered.

Keywords: vehicle routing problem, fuzzy partitioning problem, multiple-criteria optimization, possibility theory

Procedia PDF Downloads 520
7143 Partial Knowledge Transfer Between the Source Problem and the Target Problem in Genetic Algorithms

Authors: Terence Soule, Tami Al Ghamdi

Abstract:

To study how the partial knowledge transfer may affect the Genetic Algorithm (GA) performance, we model the Transfer Learning (TL) process using GA as the model solver. The objective of the TL is to transfer the knowledge from one problem to another related problem. This process imitates how humans think in their daily life. In this paper, we proposed to study a case where the knowledge transferred from the S problem has less information than what the T problem needs. We sampled the transferred population using different strategies of TL. The results showed transfer part of the knowledge is helpful and speeds the GA process of finding a solution to the problem.

Keywords: transfer learning, partial transfer, evolutionary computation, genetic algorithm

Procedia PDF Downloads 99
7142 Bee Colony Optimization Applied to the Bin Packing Problem

Authors: Kenza Aida Amara, Bachir Djebbar

Abstract:

We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment.

Keywords: bee colony optimization, bin packing, heuristic algorithm, pretreatment

Procedia PDF Downloads 598
7141 A Method for Solving a Bi-Objective Transportation Problem under Fuzzy Environment

Authors: Sukhveer Singh, Sandeep Singh

Abstract:

A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem.

Keywords: uncertain transportation problem, efficient solution, ranking function, fuzzy transportation problem

Procedia PDF Downloads 488
7140 One-Way Electric Vehicle Carsharing in an Urban Area with Vehicle-To-Grid Option

Authors: Cem Isik Dogru, Salih Tekin, Kursad Derinkuyu

Abstract:

Electric vehicle (EV) carsharing is an alternative method to tackle urban transportation problems. This method can be applied by several options. One of the options is the one-way carsharing, which allow an EV to be taken at a designated location and leaving it on another specified location customer desires. Although it may increase users’ satisfaction, the issues, namely, demand dissatisfaction, relocation of EVs and charging schedules, must be dealt with. Also, excessive electricity has to be stored in batteries of EVs. To cope with aforementioned issues, two-step mixed integer programming (MIP) model is proposed. In first step, the integer programming model is used to determine amount of electricity to be sold to the grid in terms of time periods for extra profit. Determined amounts are provided from the batteries of EVs. Also, this step works in day-ahead electricity markets with forecast of periodical electricity prices. In second step, other MIP model optimizes daily operations of one-way carsharing: charging-discharging schedules, relocation of EVs to serve more demand and renting to maximize the profit of EV fleet owner. Due to complexity of the models, heuristic methods are introduced to attain a feasible solution and different price information scenarios are compared.

Keywords: electric vehicles, forecasting, mixed integer programming, one-way carsharing

Procedia PDF Downloads 100
7139 Smart Unmanned Parking System Based on Radio Frequency Identification Technology

Authors: Yu Qin

Abstract:

In order to tackle the ever-growing problem of the lack of parking space, this paper presents the design and implementation of a smart unmanned parking system that is based on RFID (radio frequency identification) technology and Wireless communication technology. This system uses RFID technology to achieve the identification function (transmitted by 2.4 G wireless module) and is equipped with an STM32L053 micro controller as the main control chip of the smart vehicle. This chip can accomplish automatic parking (in/out), charging and other functions. On this basis, it can also help users easily query the information that is stored in the database through the Internet. Experimental tests have shown that the system has the features of low power consumption and stable operation, among others. It can effectively improve the level of automation control of the parking lot management system and has enormous application prospects.

Keywords: RFID, embedded system, unmanned, parking management

Procedia PDF Downloads 300
7138 Cooperative Coevolution for Neuro-Evolution of Feed Forward Networks for Time Series Prediction Using Hidden Neuron Connections

Authors: Ravneil Nand

Abstract:

Cooperative coevolution uses problem decomposition methods to solve a larger problem. The problem decomposition deals with breaking down the larger problem into a number of smaller sub-problems depending on their method. Different problem decomposition methods have their own strengths and limitations depending on the neural network used and application problem. In this paper we are introducing a new problem decomposition method known as Hidden-Neuron Level Decomposition (HNL). The HNL method is competing with established problem decomposition method in time series prediction. The results show that the proposed approach has improved the results in some benchmark data sets when compared to the standalone method and has competitive results when compared to methods from literature.

Keywords: cooperative coevaluation, feed forward network, problem decomposition, neuron, synapse

Procedia PDF Downloads 302
7137 Drone Swarm Routing and Scheduling for Off-shore Wind Turbine Blades Inspection

Authors: Mohanad Al-Behadili, Xiang Song, Djamila Ouelhadj, Alex Fraess-Ehrfeld

Abstract:

In off-shore wind farms, turbine blade inspection accessibility under various sea states is very challenging and greatly affects the downtime of wind turbines. Maintenance of any offshore system is not an easy task due to the restricted logistics and accessibility. The multirotor unmanned helicopter is of increasing interest in inspection applications due to its manoeuvrability and payload capacity. These advantages increase when many of them are deployed simultaneously in a swarm. Hence this paper proposes a drone swarm framework for inspecting offshore wind turbine blades and nacelles so as to reduce downtime. One of the big challenges of this task is that when operating a drone swarm, an individual drone may not have enough power to fly and communicate during missions and it has no capability of refueling due to its small size. Once the drone power is drained, there are no signals transmitted and the links become intermittent. Vessels equipped with 5G masts and small power units are utilised as platforms for drones to recharge/swap batteries. The research work aims at designing a smart energy management system, which provides automated vessel and drone routing and recharging plans. To achieve this goal, a novel mathematical optimisation model is developed with the main objective of minimising the number of drones and vessels, which carry the charging stations, and the downtime of the wind turbines. There are a number of constraints to be considered, such as each wind turbine must be inspected once and only once by one drone; each drone can inspect at most one wind turbine after recharging, then fly back to the charging station; collision should be avoided during the drone flying; all wind turbines in the wind farm should be inspected within the given time window. We have developed a real-time Ant Colony Optimisation (ACO) algorithm to generate real-time and near-optimal solutions to the drone swarm routing problem. The schedule will generate efficient and real-time solutions to indicate the inspection tasks, time windows, and the optimal routes of the drones to access the turbines. Experiments are conducted to evaluate the quality of the solutions generated by ACO.

Keywords: drone swarm, routing, scheduling, optimisation model, ant colony optimisation

Procedia PDF Downloads 217
7136 Solution of Nonlinear Fractional Programming Problem with Bounded Parameters

Authors: Mrinal Jana, Geetanjali Panda

Abstract:

In this paper a methodology is developed to solve a nonlinear fractional programming problem in which the coefficients of the objective function and constraints are interval parameters. This model is transformed into a general optimization problem and relation between the original problem and the transformed problem is established. Finally the proposed methodology is illustrated through a numerical example.

Keywords: fractional programming, interval valued function, interval inequalities, partial order relation

Procedia PDF Downloads 487
7135 Exhaustive Study of Essential Constraint Satisfaction Problem Techniques Based on N-Queens Problem

Authors: Md. Ahsan Ayub, Kazi A. Kalpoma, Humaira Tasnim Proma, Syed Mehrab Kabir, Rakib Ibna Hamid Chowdhury

Abstract:

Constraint Satisfaction Problem (CSP) is observed in various applications, i.e., scheduling problems, timetabling problems, assignment problems, etc. Researchers adopt a CSP technique to tackle a certain problem; however, each technique follows different approaches and ways to solve a problem network. In our exhaustive study, it has been possible to visualize the processes of essential CSP algorithms from a very concrete constraint satisfaction example, NQueens Problem, in order to possess a deep understanding about how a particular constraint satisfaction problem will be dealt with by our studied and implemented techniques. Besides, benchmark results - time vs. value of N in N-Queens - have been generated from our implemented approaches, which help understand at what factor each algorithm produces solutions; especially, in N-Queens puzzle. Thus, extended decisions can be made to instantiate a real life problem within CSP’s framework.

Keywords: arc consistency (AC), backjumping algorithm (BJ), backtracking algorithm (BT), constraint satisfaction problem (CSP), forward checking (FC), least constrained values (LCV), maintaining arc consistency (MAC), minimum remaining values (MRV), N-Queens problem

Procedia PDF Downloads 330
7134 Explicit Iterative Scheme for Approximating a Common Solution of Generalized Mixed Equilibrium Problem and Fixed Point Problem for a Nonexpansive Semigroup in Hilbert Space

Authors: Mohammad Farid

Abstract:

In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area.

Keywords: generalized mixed equilibrium problem, fixed-point problem, nonexpansive semigroup, variational inequality problem, iterative algorithms, hybrid extragradient method

Procedia PDF Downloads 445
7133 Regret-Regression for Multi-Armed Bandit Problem

Authors: Deyadeen Ali Alshibani

Abstract:

In the literature, the multi-armed bandit problem as a statistical decision model of an agent trying to optimize his decisions while improving his information at the same time. There are several different algorithms models and their applications on this problem. In this paper, we evaluate the Regret-regression through comparing with Q-learning method. A simulation on determination of optimal treatment regime is presented in detail.

Keywords: optimal, bandit problem, optimization, dynamic programming

Procedia PDF Downloads 423
7132 A Fuzzy Programming Approach for Solving Intuitionistic Fuzzy Linear Fractional Programming Problem

Authors: Sujeet Kumar Singh, Shiv Prasad Yadav

Abstract:

This paper develops an approach for solving intuitionistic fuzzy linear fractional programming (IFLFP) problem where the cost of the objective function, the resources, and the technological coefficients are triangular intuitionistic fuzzy numbers. Here, the IFLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using fuzzy mathematical programming approach the transformed MOLFP problem is reduced into a single objective linear programming (LP) problem. The proposed procedure is illustrated through a numerical example.

Keywords: triangular intuitionistic fuzzy number, linear programming problem, multi objective linear programming problem, fuzzy mathematical programming, membership function

Procedia PDF Downloads 531
7131 Novel Method of In-Situ Tracking of Mechanical Changes in Composite Electrodes during Charging-Discharging by QCM-D

Authors: M. D. Levi, Netanel Shpigel, Sergey Sigalov, Gregory Salitra, Leonid Daikhin, Doron Aurbach

Abstract:

We have developed an in-situ method for tracking ions adsorption into composite nanoporous carbon electrodes based on quartz-crystal microbalance (QCM). In these first papers QCM was used as a simple gravimetric probe of compositional changes in carbon porous composite electrodes during their charging since variation of the electrode potential did not change significantly width of the resonance. In contrast, when we passed from nanoporous carbons to a composite Li-ion battery material such as LiFePO4 olivine, the change in the resonance width was comparable with change of the resonance frequency (polymeric binder PVdF was shown to be completely rigid when used in aqueous solutions). We have provided a quantitative hydrodynamic admittance model of ion-insertion processes into electrode host accompanied by intercalation-induced dimensional changes of electrode particles, and hence the entire electrode coating. The change in electrode deformation and the related porosity modify hydrodynamic solid-liquid interactions tracked by QCM with dissipation monitoring. Using admittance modeling, we are able to evaluate the changes of effective thickness and permeability/porosity of composite electrode caused by applied potential and as a function of cycle number. This unique non-destructive technique may have great advantage in early diagnostics of cycling life durability of batteries and supercapacitors.

Keywords: Li-ion batteries, particles deformations, QCM-D, viscoelasticity

Procedia PDF Downloads 411
7130 The Algorithm to Solve the Extend General Malfatti’s Problem in a Convex Circular Triangle

Authors: Ching-Shoei Chiang

Abstract:

The Malfatti’s Problem solves the problem of fitting 3 circles into a right triangle such that these 3 circles are tangent to each other, and each circle is also tangent to a pair of the triangle’s sides. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles inside the triangle with special tangency properties among circles and triangle sides; we call it extended general Malfatti’s problem. In the extended general Malfatti’s problem, call it Tri(Tn), where Tn is the triangle number, there are closed-form solutions for Tri(T₁) (inscribed circle) problem and Tri(T₂) (3 Malfatti’s circles) problem. These problems become more complex when n is greater than 2. In solving Tri(Tn) problem, n>2, algorithms have been proposed to solve these problems numerically. With a similar idea, this paper proposed an algorithm to find the radii of circles with the same tangency properties. Instead of the boundary of the triangle being a straight line, we use a convex circular arc as the boundary and try to find Tn circles inside this convex circular triangle with the same tangency properties among circles and boundary Carc. We call these problems the Carc(Tn) problems. The CPU time it takes for Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties, is less than one second.

Keywords: circle packing, computer-aided geometric design, geometric constraint solver, Malfatti’s problem

Procedia PDF Downloads 71
7129 Ubiquitous Scaffold Learning Environment Using Problem-based Learning Activities to Enhance Problem-solving Skills and Context Awareness

Authors: Noppadon Phumeechanya, Panita Wannapiroon

Abstract:

The purpose of this research is to design the ubiquitous scaffold learning environment using problem-based learning activities that enhance problem-solving skills and context awareness, and to evaluate the suitability of the ubiquitous scaffold learning environment using problem-based learning activities. We divide the research procedures into two phases. The first phase is to design the ubiquitous scaffold learning environment using problem-based learning activities, and the second is to evaluate the ubiquitous scaffold learning environment using problem-based learning activities. The sample group in this study consists of five experts selected using the purposive sampling method. We analyse data by arithmetic mean and standard deviation. The research findings are as follows; the ubiquitous scaffold learning environment using problem-based learning activities consists of three major steps, the first is preparation before learning. This prepares learners to acknowledge details and learn through u-LMS. The second is the learning process, where learning activities happen in the ubiquitous learning environment and learners learn online with scaffold systems for each step of problem solving. The third step is measurement and evaluation. The experts agree that the ubiquitous scaffold learning environment using problem-based learning activities is highly appropriate.

Keywords: ubiquitous learning environment scaffolding, learning activities, problem-based learning, problem-solving skills, context awareness

Procedia PDF Downloads 473
7128 Young Children’s Use of Representations in Problem Solving

Authors: Kamariah Abu Bakar, Jennifer Way

Abstract:

This study investigated how young children (six years old) constructed and used representations in mathematics classroom; particularly in problem solving. The purpose of this study is to explore the ways children used representations in solving addition problems and to determine whether their representations can play a supportive role in understanding the problem situation and solving them correctly. Data collection includes observations, children’s artifact, photographs and conversation with children during task completion. The results revealed that children were able to construct and use various representations in solving problems. However, they have certain preferences in generating representations to support their problem solving.

Keywords: young children, representations, addition, problem solving

Procedia PDF Downloads 426
7127 Comparative Study of Soliton Collisions in Uniform and Nonuniform Magnetized Plasma

Authors: Renu Tomar, Hitendra K. Malik, Raj P. Dahiya

Abstract:

Similar to the sound waves in air, plasmas support the propagation of ion waves, which evolve into the solitary structures when the effect of non linearity and dispersion are balanced. The ion acoustic solitary waves have been investigated in details in homogeneous plasmas, inhomogeneous plasmas, and magnetized plasmas. The ion acoustic solitary waves are also found to reflect from a density gradient or boundary present in the plasma after propagating. Another interesting feature of the solitary waves is their collision. In the present work, we carry out analytical calculations for the head-on collision of solitary waves in a magnetized plasma which has dust grains in addition to the ions and electrons. For this, we employ Poincar´e-Lighthill-Kuo (PLK) method. To lowest nonlinear order, the problem of colliding solitary waves leads to KdV (modified KdV) equations and also yields the phase shifts that occur in the interaction. These calculations are accomplished for the uniform and nonuniform plasmas, and the results on the soliton properties are discussed in detail.

Keywords: inhomogeneous magnetized plasma, dust charging, soliton collisions, magnetized plasma

Procedia PDF Downloads 441
7126 Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations

Authors: Liudmyla Koliechkina, Olena Dvirna

Abstract:

The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps.

Keywords: discrete set, linear combinatorial optimization, multi-objective optimization, Pareto solutions, partial permutation set, structural graph

Procedia PDF Downloads 136
7125 Theoretical Model of a Flat Plate Solar Collector Integrated with Phase Change Material

Authors: Mouna Hamed, Ammar B. Brahim

Abstract:

The objective of this work was to develop a theoretical model to study the dynamic thermal behavior of a flat plate solar collector integrated with a phase change material (PCM). The PCM acted as a heat source for the solar system during low intensity solar radiation and night. The energy balance equations for the various components of the collector as well as for the PCM were formulated and numerically solved using MATLAB computational program. The effect of natural convection on heat during the melting process was taken into account by using an effective thermal conductivity. The model was used to investigate the effect of inlet water temperature, water mass flow rate, and PCM thickness on the outlet water temperature and the melt fraction during charging and discharging modes. A comparison with a collector without PCM was made. Results showed that charging and discharging processes of PCM have six stages. The adding of PCM caused a decrease in temperature during charge and an increase during discharge. The rise was most enhanced for higher inlet water temperature, PCM thickness and for lower mass flow rate. Analysis indicated that the complete melting time was shorter than the solidification time due to the high heat transfer coefficient during melting. The increases in PCM height and mass flow rate were not linear with the melting and solidification times.

Keywords: thermal energy storage, phase change material, melting, solidification

Procedia PDF Downloads 317
7124 Thermally Stimulated Depolarization Current (TSDC) and Transient Current Study in Polysulfone (PSF) and Polyvinylidenefluoride (PVDF) Blends

Authors: S. Patel, T. Mitra, R. Dubey, J. Keller

Abstract:

In the present investigations, an attempt has been made to study the charge storage mechanism and mechanism for the flow of transient charging and discharging current in an amorphous polymer (Polysulfone) (PSF) and a semi-crystalline polar Polyvinylidene fluoride (PVDF) blends in ratio PSF: PVDF: 80:20;85:15;90:10 and 95:05 at various poling temperatures (i.e. 60, 75, 90 and 1150C) and with field strength (100, 150, 200 and 250kVcm⁻¹). Thermally stimulated depolarizing current TSDC thermograms for (Polysulfone (PSF) and Polyvinylidene fluoride (PVDF) Blends sample have been obtained under different polarizing conditions. Peaks are found at high-temperature side. The variation of structure on blending and poling condition affects the magnitude of TSDC. The activation energy values have been calculated using the initial rise method of Garlick and Gibson. The transient current with the similar polarizing condition has been investigated over a period of 3X10³ sec. The observed characteristics obey Curie-Von Schweidler law in the studied temperature range. The charging current versus polarizing temperature curves at a constant time, i.e., isochronal current characteristics were studied and the activation energies were calculated. The activation energy in transient thermograms calculated by different methods is in good agreement with the values obtained from TSDC studies.

Keywords: activation energy, polysulfone (PSF), polyvinylidenefluoride (PVDF), thermally stimulated depolarizing current (TSDC)

Procedia PDF Downloads 138
7123 On Optimum Stratification

Authors: M. G. M. Khan, V. D. Prasad, D. K. Rao

Abstract:

In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique.

Keywords: auxiliary variable, dynamic programming technique, nonlinear programming problem, optimum stratification, uniform distribution

Procedia PDF Downloads 301
7122 Genetic Algorithm for Solving the Flexible Job-Shop Scheduling Problem

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 117
7121 Number Sense Proficiency and Problem Solving Performance of Grade Seven Students

Authors: Laissa Mae Francisco, John Rolex Ingreso, Anna Krizel Menguito, Criselda Robrigado, Rej Maegan Tuazon

Abstract:

This study aims to determine and describe the existing relationship between number sense proficiency and problem-solving performance of grade seven students from Victorino Mapa High School, Manila. A paper pencil exam containing of 50-item number sense test and 5-item problem-solving test which measures their number sense proficiency and problem-solving performance adapted from McIntosh, Reys, and Bana were used as the research instruments. The data obtained from this study were interpreted and analyzed using the Pearson – Product Moment Coefficient of Correlation to determine the relationship between the two variables. It was found out that students who were low in number sense proficiency tend to be the students with poor problem-solving performance and students with medium number sense proficiency are most likely to have an average problem-solving performance. Likewise, students with high number sense proficiency are those who do excellently in problem-solving performance.

Keywords: number sense, performance, problem solving, proficiency

Procedia PDF Downloads 397
7120 Incorporating Polya’s Problem Solving Process: A Polytechnic Mathematics Module Case Study

Authors: Pei Chin Lim

Abstract:

School of Mathematics and Science of Singapore Polytechnic offers a Basic Mathematics module to students who did not pass GCE O-Level Additional Mathematics. These students are weaker in Mathematics. In particular, they struggle with word problems and tend to leave them blank in tests and examinations. In order to improve students’ problem-solving skills, the school redesigned the Basic Mathematics module to incorporate Polya’s problem-solving methodology. During tutorial lessons, students have to work through learning activities designed to raise their metacognitive awareness by following Polya’s problem-solving process. To assess the effectiveness of the redesign, students’ working for a challenging word problem in the mid-semester test were analyzed. Sixty-five percent of students attempted to understand the problem by making sketches. Twenty-eight percent of students went on to devise a plan and implement it. Only five percent of the students still left the question blank. These preliminary results suggest that with regular exposure to an explicit and systematic problem-solving approach, weak students’ problem-solving skills can potentially be improved.

Keywords: mathematics education, metacognition, problem solving, weak students

Procedia PDF Downloads 134
7119 An Optimization Model for Maximum Clique Problem Based on Semidefinite Programming

Authors: Derkaoui Orkia, Lehireche Ahmed

Abstract:

The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time.

Keywords: semidefinite programming, maximum clique problem, primal-dual interior point method, relaxation

Procedia PDF Downloads 192
7118 A New Graph Theoretic Problem with Ample Practical Applications

Authors: Mehmet Hakan Karaata

Abstract:

In this paper, we first coin a new graph theocratic problem with numerous applications. Second, we provide two algorithms for the problem. The first solution is using a brute-force techniques, whereas the second solution is based on an initial identification of the cycles in the given graph. We then provide a correctness proof of the algorithm. The applications of the problem include graph analysis, graph drawing and network structuring.

Keywords: algorithm, cycle, graph algorithm, graph theory, network structuring

Procedia PDF Downloads 357