Search results for: convex feasibility problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 8107

Search results for: convex feasibility problem

8017 Roof Integrated Photo Voltaic with Air Collection on Glasgow School of Art Campus Building: A Feasibility Study

Authors: Rosalie Menon, Angela Reid

Abstract:

Building integrated photovoltaic systems with air collectors (hybrid PV-T) have proved successful however there are few examples of their application in the UK. The opportunity to pull heat from behind the PV system to contribute to a building’s heating system is an efficient use of waste energy and its potential to improve the performance of the PV array is well documented. As part of Glasgow School of Art’s estate expansion, the purchase and redevelopment of an existing 1950’s college building was used as a testing vehicle for the hybrid PV-T system as an integrated element of the upper floor and roof. The primary objective of the feasibility study was to determine if hybrid PV-T was technically and financially suitable for the refurbished building. The key consideration was whether the heat recovered from the PV panels (to increase the electrical efficiency) can be usefully deployed as a heat source within the building. Dynamic thermal modelling (IES) and RetScreen Software were used to carry out the feasibility study not only to simulate overshadowing and optimise the PV-T locations but also to predict the atrium temperature profile; predict the air load for the proposed new 4 No. roof mounted air handling units and to predict the dynamic electrical efficiency of the PV element. The feasibility study demonstrates that there is an energy reduction and carbon saving to be achieved with each hybrid PV-T option however the systems are subject to lengthy payback periods and highlights the need for enhanced government subsidy schemes to reward innovation with this technology in the UK.

Keywords: building integrated, photovoltatic thermal, pre-heat air, ventilation

Procedia PDF Downloads 142
8016 Optimal Production Planning in Aromatic Coconuts Supply Chain Based on Mixed-Integer Linear Programming

Authors: Chaimongkol Limpianchob

Abstract:

This work addresses the problem of production planning that arises in the production of aromatic coconuts from Samudsakhorn province in Thailand. The planning involves the forwarding of aromatic coconuts from the harvest areas to the factory, which is classified into two groups; self-owned areas and contracted areas, the decisions of aromatic coconuts flow in the plant, and addressing a question of which warehouse will be in use. The problem is formulated as a mixed-integer linear programming model within supply chain management framework. The objective function seeks to minimize the total cost including the harvesting, labor and inventory costs. Constraints on the system include the production activities in the company and demand requirements. Numerical results are presented to demonstrate the feasibility of coconuts supply chain model compared with base case.

Keywords: aromatic coconut, supply chain management, production planning, mixed-integer linear programming

Procedia PDF Downloads 436
8015 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 603
8014 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 494
8013 Finite-Sum Optimization: Adaptivity to Smoothness and Loopless Variance Reduction

Authors: Bastien Batardière, Joon Kwon

Abstract:

For finite-sum optimization, variance-reduced gradient methods (VR) compute at each iteration the gradient of a single function (or of a mini-batch), and yet achieve faster convergence than SGD thanks to a carefully crafted lower-variance stochastic gradient estimator that reuses past gradients. Another important line of research of the past decade in continuous optimization is the adaptive algorithms such as AdaGrad, that dynamically adjust the (possibly coordinate-wise) learning rate to past gradients and thereby adapt to the geometry of the objective function. Variants such as RMSprop and Adam demonstrate outstanding practical performance that have contributed to the success of deep learning. In this work, we present AdaLVR, which combines the AdaGrad algorithm with loopless variance-reduced gradient estimators such as SAGA or L-SVRG that benefits from a straightforward construction and a streamlined analysis. We assess that AdaLVR inherits both good convergence properties from VR methods and the adaptive nature of AdaGrad: in the case of L-smooth convex functions we establish a gradient complexity of O(n + (L + √ nL)/ε) without prior knowledge of L. Numerical experiments demonstrate the superiority of AdaLVR over state-of-the-art methods. Moreover, we empirically show that the RMSprop and Adam algorithm combined with variance-reduced gradients estimators achieve even faster convergence.

Keywords: convex optimization, variance reduction, adaptive algorithms, loopless

Procedia PDF Downloads 36
8012 Feasibility of Using Bike Lanes in Conjunctions with Sidewalks for Ground Drone Applications in Last Mile Delivery for Dense Urban Areas

Authors: N. Bazyar Shourabi, K. Nyarko, C. Scott, M. Jeihnai

Abstract:

Ground drones have the potential to reduce the cost and time of making last-mile deliveries. They also have the potential to make a huge impact on human life. Despite this potential, little work has gone into developing a suitable feasibility model for ground drone delivery in dense urban areas. Today, most of the experimental ground delivery drones utilize sidewalks only, with just a few of them starting to use bike lanes, which a significant portion of some urban areas have. This study works on the feasibility of using bike lanes in conjunction with sidewalks for ground drone applications in last-mile delivery for dense urban areas. This work begins with surveying bike lanes and sidewalks within the city of Boston using Geographic Information System (GIS) software to determine the percentage of coverage currently available within the city. Then six scenarios are examined. Based on this research, a mathematical model is developed. The daily cost of delivering packages using each scenario is calculated by the mathematical model. Comparing the drone delivery scenarios with the traditional method of package delivery using trucks will provide essential information concerning the feasibility of implementing routing protocols that combine the use of sidewalks and bike lanes. The preliminary results of the model show that ground drones that can travel via sidewalks or bike lanes have the potential to significantly reduce delivery cost.

Keywords: ground drone, intelligent transportation system, last-mile delivery, sidewalk robot

Procedia PDF Downloads 112
8011 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 306
8010 6-Degree-Of-Freedom Spacecraft Motion Planning via Model Predictive Control and Dual Quaternions

Authors: Omer Burak Iskender, Keck Voon Ling, Vincent Dubanchet, Luca Simonini

Abstract:

This paper presents Guidance and Control (G&C) strategy to approach and synchronize with potentially rotating targets. The proposed strategy generates and tracks a safe trajectory for space servicing missions, including tasks like approaching, inspecting, and capturing. The main objective of this paper is to validate the G&C laws using a Hardware-In-the-Loop (HIL) setup with realistic rendezvous and docking equipment. Throughout this work, the assumption of full relative state feedback is relaxed by onboard sensors that bring realistic errors and delays and, while the proposed closed loop approach demonstrates the robustness to the above mentioned challenge. Moreover, G&C blocks are unified via the Model Predictive Control (MPC) paradigm, and the coupling between translational motion and rotational motion is addressed via dual quaternion based kinematic description. In this work, G&C is formulated as a convex optimization problem where constraints such as thruster limits and the output constraints are explicitly handled. Furthermore, the Monte-Carlo method is used to evaluate the robustness of the proposed method to the initial condition errors, the uncertainty of the target's motion and attitude, and actuator errors. A capture scenario is tested with the robotic test bench that has onboard sensors which estimate the position and orientation of a drifting satellite through camera imagery. Finally, the approach is compared with currently used robust H-infinity controllers and guidance profile provided by the industrial partner. The HIL experiments demonstrate that the proposed strategy is a potential candidate for future space servicing missions because 1) the algorithm is real-time implementable as convex programming offers deterministic convergence properties and guarantee finite time solution, 2) critical physical and output constraints are respected, 3) robustness to sensor errors and uncertainties in the system is proven, 4) couples translational motion with rotational motion.

Keywords: dual quaternion, model predictive control, real-time experimental test, rendezvous and docking, spacecraft autonomy, space servicing

Procedia PDF Downloads 122
8009 Analysis of Autonomous Orbit Determination for Lagrangian Navigation Constellation with Different Dynamical Models

Authors: Gao Youtao, Zhao Tanran, Jin Bingyu, Xu Bo

Abstract:

Global navigation satellite system(GNSS) can deliver navigation information for spacecraft orbiting on low-Earth orbits and medium Earth orbits. However, the GNSS cannot navigate the spacecraft on high-Earth orbit or deep space probes effectively. With the deep space exploration becoming a hot spot of aerospace, the demand for a deep space satellite navigation system is becoming increasingly prominent. Many researchers discussed the feasibility and performance of a satellite navigation system on periodic orbits around the Earth-Moon libration points which can be called Lagrangian point satellite navigation system. Autonomous orbit determination (AOD) is an important performance for the Lagrangian point satellite navigation system. With this ability, the Lagrangian point satellite navigation system can reduce the dependency on ground stations. AOD also can greatly reduce total system cost and assure mission continuity. As the elliptical restricted three-body problem can describe the Earth-Moon system more accurately than the circular restricted three-body problem, we study the autonomous orbit determination of Lagrangian navigation constellation using only crosslink range based on elliptical restricted three body problem. Extended Kalman filter is used in the autonomous orbit determination. In order to compare the autonomous orbit determination results based on elliptical restricted three-body problem to the results of autonomous orbit determination based on circular restricted three-body problem, we give the autonomous orbit determination position errors of a navigation constellation include four satellites based on the circular restricted three-body problem. The simulation result shows that the Lagrangian navigation constellation can achieve long-term precise autonomous orbit determination using only crosslink range. In addition, the type of the libration point orbit will influence the autonomous orbit determination accuracy.

Keywords: extended Kalman filter, autonomous orbit determination, quasi-periodic orbit, navigation constellation

Procedia PDF Downloads 261
8008 A Feasibility Study of Producing Biofuels from Textile Sludge by Torrefaction Technology

Authors: Hua-Shan Tai, Yu-Ting Zeng

Abstract:

In modern and industrial society, enormous amounts of sludge from various of industries are constantly produced; currently, most of the sludge are treated by landfill and incineration. However, both treatments are not ideal because of the limited land for landfill and the secondary pollution caused by incineration. Consequently, treating industrial sludge appropriately has become an urgent issue of environmental protection. In order to solve the problem of the massive sludge, this study uses textile sludge which is the major source of waste sludge in Taiwan as raw material for torrefaction treatments. To investigate the feasibility of producing biofuels from textile sludge by torrefaction, the experiments were conducted with temperatures at 150, 200, 250, 300, and 350°C, with heating rates of 15, 20, 25 and 30°C/min, and with residence time of 30 and 60 minutes. The results revealed that the mass yields after torrefaction were approximately in the range of 54.9 to 93.4%. The energy densification ratios were approximately in the range of 0.84 to 1.10, and the energy yields were approximately in the range of 45.9 to 98.3%. The volumetric densities were approximately in the range of 0.78 to 1.14, and the volumetric energy densities were approximately in the range of 0.65 to 1.18. To sum up, the optimum energy yield (98.3%) can be reached with terminal temperature at 150 °C, heating rate of 20°C/min, and residence time of 30 minutes, and the mass yield, energy densification ratio as well as volumetric energy density were 92.2%, 1.07, and 1.15, respectively. These results indicated that the solid products after torrefaction are easy to preserve, which not only enhance the quality of the product, but also achieve the purpose of developing the material into fuel.

Keywords: biofuel, biomass energy, textile sludge, torrefaction

Procedia PDF Downloads 300
8007 A New Multi-Target, Multi-Agent Search and Rescue Path Planning Approach

Authors: Jean Berger, Nassirou Lo, Martin Noel

Abstract:

Perfectly suited for natural or man-made emergency and disaster management situations such as flood, earthquakes, tornadoes, or tsunami, multi-target search path planning for a team of rescue agents is known to be computationally hard, and most techniques developed so far come short to successfully estimate optimality gap. A novel mixed-integer linear programming (MIP) formulation is proposed to optimally solve the multi-target multi-agent discrete search and rescue (SAR) path planning problem. Aimed at maximizing cumulative probability of successful target detection, it captures anticipated feedback information associated with possible observation outcomes resulting from projected path execution, while modeling agent discrete actions over all possible moving directions. Problem modeling further takes advantage of network representation to encompass decision variables, expedite compact constraint specification, and lead to substantial problem-solving speed-up. The proposed MIP approach uses CPLEX optimization machinery, efficiently computing near-optimal solutions for practical size problems, while giving a robust upper bound obtained from Lagrangean integrality constraint relaxation. Should eventually a target be positively detected during plan execution, a new problem instance would simply be reformulated from the current state, and then solved over the next decision cycle. A computational experiment shows the feasibility and the value of the proposed approach.

Keywords: search path planning, search and rescue, multi-agent, mixed-integer linear programming, optimization

Procedia PDF Downloads 347
8006 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 492
8005 Security Features for Remote Healthcare System: A Feasibility Study

Authors: Tamil Chelvi Vadivelu, Nurazean Maarop, Rasimah Che Yusoff, Farhana Aini Saludin

Abstract:

Implementing a remote healthcare system needs to consider many security features. Therefore, before any deployment of the remote healthcare system, a feasibility study from the security perspective is crucial. Remote healthcare system using WBAN technology has been used in other countries for medical purposes but in Malaysia, such projects are still not yet implemented. This study was conducted qualitatively. The interview results involving five healthcare practitioners are further elaborated. The study has addressed four important security features in order to incorporate remote healthcare system using WBAN in Malaysian government hospitals.

Keywords: remote healthcare, IT security, security features, wireless sensor application

Procedia PDF Downloads 276
8004 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 342
8003 The Carers-ID Online Intervention For Family Carers Of People With Intellectual Disabilities: A Feasibility Trial Protocol

Authors: Mark Linden, Rachel Leonard, Trisha Forbes, Michael Brown, Lynne Marsh, Stuart Todd, Nathan Hughes, Maria Truesdale

Abstract:

Background: Current interventions which aim to improve the mental health of family carers are often face to face, which can create barriers to full participation. Online interventions can offer flexibility in delivery compared to face to face approaches. The primary objective of this study is to determine the feasibility of delivering the Carers-ID online intervention, while the secondary outcome is to improve the mental health of family carers of people with intellectual disabilities. Methods: Family carers (n = 120) will be randomised to receive the intervention (n=60) or assigned to a wait-list control (n=60) group. The intervention (www.Carers-ID.com) consists of fourteen modules which cover topics including promoting resilience, providing peer support, reducing anxiety, managing stress, accessing local supports, managing family conflict and information for siblings who are carers. Primary outcomes for this study include acceptability and feasibility of the outcome measures, recruitment, participation and retention rates and effect sizes. Secondary outcomes will be completed at three time points (baseline, following intervention completion and three months after completion). Secondary outcomes include, depression, anxiety, stress, well-being , resilience and social connectedness. Participants (n=12) who have taken part in the intervention arm of the research will be invited to participate in semi-structured interviews as part of the process evaluation. Discussion: To determine whether a full-scale randomised controlled effectiveness trial is warranted, feasibility testing of the intervention and trial procedures is a necessary first step. The Carers-ID intervention provides an accessible resource for family carers to support their mental health and well-being.

Keywords: intellectual disability, family carer, feasibility trial, online intervention

Procedia PDF Downloads 47
8002 Technical and Economical Feasibility Analysis of Solar Water Pumping System - Case Study in Iran

Authors: A. Gharib, M. Moradi

Abstract:

The technical analysis of using solar energy and electricity for water pumping in the Khuzestan province in Iran is investigated. For this purpose, the ecological conditions such as the weather data, air clearness and sunshine hours are analyzed. The nature of groundwater in the region was examined in terms of depth, static and dynamic head, water pumping rate. Three configurations for solar water pumping system were studied in this thesis; AC solar water pumping with a storage battery, AC solar water pumping with a storage tank, and DC direct solar water pumping.

Keywords: technical and economic feasibility, solar energy, photovoltaic systems, solar water pumping system

Procedia PDF Downloads 538
8001 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 450
8000 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 427
7999 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 539
7998 Feasibility of Agro Waste-Derived Adsorbent for Colour Removal

Authors: U. P. L. Wijayarathne, P. W. Vidanage, H. K. D. Jayampath, K. W. P. M. Kothalawala

Abstract:

Feasibility of utilizing Empty Bunch (EB) fibre, a solid waste of palm oil extraction process, as an adsorbent is analysed in this study. Empty bunch fibre is generated after the extraction of retained oil in the sterilized and threshed empty fruit bunches. Besides the numerous characteristics of EB fibre, which enable its utilization as a fuel, a bio-composite material, or mulch, EB fibre also shows exceptional characteristics of a good adsorbent. Fixed bed adsorption method is used to study the adsorptivity of EB fibre using a continuous adsorption column with Methyl-blue (1.13ppm) as the feed. Adsorptivity is assumed to be solely dependent on the bed porosity keeping other parameters (feed flow rate, bed height, bed diameter, and operating temperature) constant. Bed porosity is changed by means of compact ratio and the variation of the feed concentration is analysed using a photometric method. Break through curves are plotted at different porosity levels and optimum bed porosity is identified for a given feed stream. Feasibility of using the EB fibre as an inexpensive and an abundant adsorbent in wastewater treatment facilities, where the effluent colour reduction is adamant, is also discussed.

Keywords: adsorption, fixed bed, break through time, methylene blue, oil palm fibre

Procedia PDF Downloads 262
7997 Gas Network Noncooperative Game

Authors: Teresa Azevedo PerdicoúLis, Paulo Lopes Dos Santos

Abstract:

The conceptualisation of the problem of network optimisation as a noncooperative game sets up a holistic interactive approach that brings together different network features (e.g., com-pressor stations, sources, and pipelines, in the gas context) where the optimisation objectives are different, and a single optimisation procedure becomes possible without having to feed results from diverse software packages into each other. A mathematical model of this type, where independent entities take action, offers the ideal modularity and subsequent problem decomposition in view to design a decentralised algorithm to optimise the operation and management of the network. In a game framework, compressor stations and sources are under-stood as players which communicate through network connectivity constraints–the pipeline model. That is, in a scheme similar to tatonnementˆ, the players appoint their best settings and then interact to check for network feasibility. The devolved degree of network unfeasibility informs the players about the ’quality’ of their settings, and this two-phase iterative scheme is repeated until a global optimum is obtained. Due to network transients, its optimisation needs to be assessed at different points of the control interval. For this reason, the proposed approach to optimisation has two stages: (i) the first stage computes along the period of optimisation in order to fulfil the requirement just mentioned; (ii) the second stage is initialised with the solution found by the problem computed at the first stage, and computes in the end of the period of optimisation to rectify the solution found at the first stage. The liability of the proposed scheme is proven correct on an abstract prototype and three example networks.

Keywords: connectivity matrix, gas network optimisation, large-scale, noncooperative game, system decomposition

Procedia PDF Downloads 128
7996 Technical Feasibility Analysis of PV Water Pumping System in Khuzestan Province-Iran

Authors: M.Goodarzi, M.Mohammadi, M. Rezaee

Abstract:

The technical analysis of using solar energy and electricity for water pumping in the Khuzestan province in Iran is investigated. For this purpose, the ecological conditions such as the weather data, air clearness and sunshine hours are analyzed. The nature of groundwater in the region was examined in terms of depth, static and dynamic head, water pumping rate.Three configurations for solar water pumping system were studied in this thesis; AC solar water pumping with storage battery, AC solar water pumping with storage tank and DC direct solar water pumping.

Keywords: technical feasibility, solar energy, photovoltaic systems, photovoltaic water pumping system

Procedia PDF Downloads 603
7995 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 480
7994 Feasibility of Deployable Encasing for a CVDR (Cockpit Voice and Data Recorder) in Commercial Aircraft

Authors: Vishnu Nair, Rohan Kapoor

Abstract:

Recent commercial aircraft crashes demand a paradigm shift in how the CVDRs are located and recovered, particularly if the aircraft crashes in the sea. CVDR (Cockpit Voice and Data Recorder) is most vital component out of the entire wreckage that can be obtained in order to investigate the sequence of events leading to the crash. It has been a taxing and exorbitantly expensive process locating and retrieving the same in the massive water bodies as it was seen in the air crashes in the recent past, taking the unfortunate Malaysia airlines MH-370 crash into account. The study aims to provide an aid to the persisting problem by improving the buoyant as-well-as the aerodynamic properties of the proposed CVDR encasing. Alongside this the placement of the deployable CVDR on the surface of the aircraft and floatability in case of water submersion are key factors which are taken into consideration for a better resolution to the problem. All of which results into the Deployable-CVDR emerging to the surface of the water-body. Also the whole system is designed such that it can be seamlessly integrated with the current crop of commercial aircraft. The work is supported by carrying out a computational study with the help Ansys-Fluent combination.

Keywords: encasing, buoyancy, deployable CVDR, floatability, water submersion

Procedia PDF Downloads 277
7993 Exploring the Feasibility of Introducing Particular Polyphenols into Cow Milk Naturally through Animal Feeding

Authors: Steve H. Y. Lee, Jeremy P. E. Spencer

Abstract:

The aim of the present study was to explore the feasibility of enriching polyphenols in cow milk via addition of flavanone-rich citrus pulp to existing animal feed. 8 Holstein lactating cows were enrolled onto the 4 week feeding study. 4 cows were fed the standard farm diet (control group), with another 4 (treatment group) which are fed a standard farm diet mixed with citrus pulp diet. Milk was collected twice a day, 3 times a week. The resulting milk yield and its macronutrient composition as well as lactose content were measured. The milk phenolic compounds were analysed using electrochemical detection (ECD).

Keywords: milk, polyphenol, animal feeding, lactating cows

Procedia PDF Downloads 283
7992 Feasibility of Small Hydropower Plants Odisha

Authors: Sanoj Sahu, Ramakar Jha

Abstract:

Odisha (India) is in need of reliable, cost-effective power generation. A prolonged electricity crisis and increasing power demand have left over thousands of citizens without access to electricity, and much of the population suffers from sporadic outages. The purpose of this project is to build a methodology to evaluate small hydropower potential, which can be used to alleviate the Odisha’s energy problem among rural communities. This project has three major tasks: the design of a simple SHEP for a single location along a river in the Odisha; the development of water flow prediction equations through a linear regression analysis; and the design of an ArcGIS toolset to estimate the flow duration curves (FDCs) at locations where data do not exist. An explanation of the inputs to the tool, as well has how it produces a suitable output for SHEP evaluation will be presented. The paper also gives an explanation of hydroelectric power generation in the Odisha, SHEPs, and the technical and practical aspects of hydroelectric power. Till now, based on topographical and rainfall analysis we have located hundreds of sites. Further work on more number of site location and accuracy of location is to be done.

Keywords: small hydropower, ArcGIS, rainfall analysis, Odisha’s energy problem

Procedia PDF Downloads 416
7991 Numerical Simulation and Optimal Control in Gas Dynamic Laser GDLs

Authors: Laggoun Chouki

Abstract:

In this paper we present the design and mechanisms of the physics process and discuss the performances of continuous gas laser dynamics, based on molecules N2(v=1)→C02(001)(v=3). The main objectives of work in this area are, obtaining the high laser energies in short time durations needed for the feasibility studies the physical principles that can be used to make laser sources capable of delivering high average powers. We note that, in order to reach both objectives, one has to convert electrical or chemical energy into laser energy, using gaseous media. The process generating the wave excited, on the basis of the excited level vibration, Theoretical predictions are compared with experimental results. The feasibility and effectiveness of the proposed method is demonstrated by computer simulation.

Keywords: modelling, lasers, gas, numerical, nozzle

Procedia PDF Downloads 55
7990 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 434
7989 A Research on Tourism Market Forecast and Its Evaluation

Authors: Min Wei

Abstract:

The traditional prediction methods of the forecast for tourism market are paid more attention to the accuracy of the forecasts, ignoring the results of the feasibility of forecasting and predicting operability, which had made it difficult to predict the results of scientific testing. With the application of Linear Regression Model, this paper attempts to construct a scientific evaluation system for predictive value, both to ensure the accuracy, stability of the predicted value, and to ensure the feasibility of forecasting and predicting the results of operation. The findings show is that a scientific evaluation system can implement the scientific concept of development, the harmonious development of man and nature co-ordinate.

Keywords: linear regression model, tourism market, forecast, tourism economics

Procedia PDF Downloads 307
7988 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 146