Search results for: water cycle algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 13383

Search results for: water cycle algorithm

13203 Cdk1 Gates Cell Cycle-Dependent tRNA Synthesis by Regulating RNA Polymerase III Activity

Authors: Maricarmen Herrera, Pierre Chymkowitch, Joe Robertson, Jens Eriksson, Jorrit Enserink

Abstract:

tRNA genes are transcribed by RNA polymerase III. During recent years, it has become clear that tDNA transcription fluctuates during the cell cycle. However, the mechanism by which the cell cycle controls the amplitude of tDNA transcription remains unknown. We found that the cyclin Clb5 recruits the cyclin dependent kinase Cdk1 to tRNA genes to sharply increase tRNA synthesis during a brief interval in the cell cycle. We show that Cdk1 promotes the interaction of TFIIIB with TFIIIC, that it stimulates the recruitment of TFIIIC to tRNA genes, that it prevents the formation of an overly stable TFIIIB-tDNA complex and that it augments the dynamics of RNA polymerase III. Furthermore, we identify Bdp1 as a novel Cdk1 substrate, and phosphorylation of Bdp1 is required for the cell cycle-dependent increase in tDNA transcription. In addition, we show that phosphorylation of the Cdk1 substrate Nup60 mediates formation of a Nup60-Nup2 complex at tRNA genes, which is also required for cell cycle-dependent tDNA transcription. Together, our findings indicate that Cdk1 activity gates tRNA synthesis by regulating the dynamics of the TFIIIB-TFIIIC-RNAPIII complex, and that it may promote the formation of a nuclear pore microenvironment conducive to efficient tDNA transcription.

Keywords: Cdk1, cell cycle, RNAPIII machinery, tRNA

Procedia PDF Downloads 159
13202 Modeling Water Resources Carrying Capacity, Optimizing Water Treatment, Smart Water Management, and Conceptualizing a Watershed Management Approach

Authors: Pius Babuna

Abstract:

Sustainable water use is important for the existence of the human race. Water resources carrying capacity (WRCC) measures the sustainability of water use; however, the calculation and optimization of WRCC remain challenging. This study used a mathematical model (the Logistics Growth of Water Resources -LGWR) and a linear objective function to model water sustainability. We tested the validity of the models using data from Ghana. Total freshwater resources, water withdrawal, and population data were used in MATLAB. The results show that the WRCC remains sustainable until the year 2132 ±18, when half of the total annual water resources will be used. The optimized water treatment cost suggests that Ghana currently wastes GHȼ 1115.782± 50 cedis (~$182.21± 50) per water treatment plant per month or ~ 0.67 million gallons of water in an avoidable loss. Adopting an optimized water treatment scheme and a watershed management approach will help sustain the WRCC.

Keywords: water resources carrying capacity, smart water management, optimization, sustainable water use, water withdrawal

Procedia PDF Downloads 60
13201 Addressing the Water Shortage in Beijing: Increasing Water Use Efficiency in Domestic Sector

Authors: Chenhong Peng

Abstract:

Beijing, the capital city of China, is running out of water. The water resource per capita in Beijing is only 106 cubic meter, accounts for 5% of the country’s average level and less than 2% of the world average level. The tension between water supply and demand is extremely serious. For one hand, the surface and ground water have been over-exploited during the last decades; for the other hand, water demand keep increasing as the result of population and economic growth. There is a massive gap between water supply and demand. This paper will focus on addressing the water shortage in Beijing city by increasing water use efficiency in domestic sector. First, we will emphasize on the changing structure of water supply and demand in Beijing under the economic development and restructure during the last decade. Second, by analyzing the water use efficiency in agriculture, industry and domestic sectors in Beijing, we identify that the key determinant for addressing the water crisis is to increase the water use efficiency in domestic sector. Third, this article will explore the two primary causes for the water use inefficiency in Beijing: The ineffective water pricing policy and the poor water education and communication policy. Finally, policy recommendation will offered to improve the water use efficiency in domestic sector by making and implementing an effective water pricing policy and people-engaged water education and communication policy.

Keywords: Beijing, water use efficiency, domestic sector, water pricing policy, water education policy

Procedia PDF Downloads 516
13200 Detailed Quantum Circuit Design and Evaluation of Grover's Algorithm for the Bounded Degree Traveling Salesman Problem Using the Q# Language

Authors: Wenjun Hou, Marek Perkowski

Abstract:

The Traveling Salesman problem is famous in computing and graph theory. In short, it asks for the Hamiltonian cycle of the least total weight in a given graph with N nodes. All variations on this problem, such as those with K-bounded-degree nodes, are classified as NP-complete in classical computing. Although several papers propose theoretical high-level designs of quantum algorithms for the Traveling Salesman Problem, no quantum circuit implementation of these algorithms has been created up to our best knowledge. In contrast to previous papers, the goal of this paper is not to optimize some abstract complexity measures based on the number of oracle iterations, but to be able to evaluate the real circuit and time costs of the quantum computer. Using the emerging quantum programming language Q# developed by Microsoft, which runs quantum circuits in a quantum computer simulation, an implementation of the bounded-degree problem and its respective quantum circuit were created. To apply Grover’s algorithm to this problem, a quantum oracle was designed, evaluating the cost of a particular set of edges in the graph as well as its validity as a Hamiltonian cycle. Repeating the Grover algorithm with an oracle that finds successively lower cost each time allows to transform the decision problem to an optimization problem, finding the minimum cost of Hamiltonian cycles. N log₂ K qubits are put into an equiprobablistic superposition by applying the Hadamard gate on each qubit. Within these N log₂ K qubits, the method uses an encoding in which every node is mapped to a set of its encoded edges. The oracle consists of several blocks of circuits: a custom-written edge weight adder, node index calculator, uniqueness checker, and comparator, which were all created using only quantum Toffoli gates, including its special forms, which are Feynman and Pauli X. The oracle begins by using the edge encodings specified by the qubits to calculate each node that this path visits and adding up the edge weights along the way. Next, the oracle uses the calculated nodes from the previous step and check that all the nodes are unique. Finally, the oracle checks that the calculated cost is less than the previously-calculated cost. By performing the oracle an optimal number of times, a correct answer can be generated with very high probability. The oracle of the Grover Algorithm is modified using the recalculated minimum cost value, and this procedure is repeated until the cost cannot be further reduced. This algorithm and circuit design have been verified, using several datasets, to generate correct outputs.

Keywords: quantum computing, quantum circuit optimization, quantum algorithms, hybrid quantum algorithms, quantum programming, Grover’s algorithm, traveling salesman problem, bounded-degree TSP, minimal cost, Q# language

Procedia PDF Downloads 148
13199 A Fast Silhouette Detection Algorithm for Shadow Volumes in Augmented Reality

Authors: Hoshang Kolivand, Mahyar Kolivand, Mohd Shahrizal Sunar, Mohd Azhar M. Arsad

Abstract:

Real-time shadow generation in virtual environments and Augmented Reality (AR) was always a hot topic in the last three decades. Lots of calculation for shadow generation among AR needs a fast algorithm to overcome this issue and to be capable of implementing in any real-time rendering. In this paper, a silhouette detection algorithm is presented to generate shadows for AR systems. Δ+ algorithm is presented based on extending edges of occluders to recognize which edges are silhouettes in the case of real-time rendering. An accurate comparison between the proposed algorithm and current algorithms in silhouette detection is done to show the reduction calculation by presented algorithm. The algorithm is tested in both virtual environments and AR systems. We think that this algorithm has the potential to be a fundamental algorithm for shadow generation in all complex environments.

Keywords: silhouette detection, shadow volumes, real-time shadows, rendering, augmented reality

Procedia PDF Downloads 414
13198 Joint Replenishment and Heterogeneous Vehicle Routing Problem with Cyclical Schedule

Authors: Ming-Jong Yao, Chin-Sum Shui, Chih-Han Wang

Abstract:

This paper is developed based on a real-world decision scenario that an industrial gas company that applies the Vendor Managed Inventory model and supplies liquid oxygen with a self-operated heterogeneous vehicle fleet to hospitals in nearby cities. We name it as a Joint Replenishment and Heterogeneous Vehicle Routing Problem with Cyclical Schedule and formulate it as a non-linear mixed-integer linear programming problem which simultaneously determines the length of the planning cycle (PC), the length of the replenishment cycle and the dates of replenishment for each customer and the vehicle routes of each day within PC, such that the average daily operation cost within PC, including inventory holding cost, setup cost, transportation cost, and overtime labor cost, is minimized. A solution method based on genetic algorithm, embedded with an encoding and decoding mechanism and local search operators, is then proposed, and the hash function is adopted to avoid repetitive fitness evaluation for identical solutions. Numerical experiments demonstrate that the proposed solution method can effectively solve the problem under different lengths of PC and number of customers. The method is also shown to be effective in determining whether the company should expand the storage capacity of a customer whose demand increases. Sensitivity analysis of the vehicle fleet composition shows that deploying a mixed fleet can reduce the daily operating cost.

Keywords: cyclic inventory routing problem, joint replenishment, heterogeneous vehicle, genetic algorithm

Procedia PDF Downloads 54
13197 Numerical Simulation of the Dynamic Behavior of a LaNi5 Water Pumping System

Authors: Miled Amel, Ben Maad Hatem, Askri Faouzi, Ben Nasrallah Sassi

Abstract:

Metal hydride water pumping system uses hydrogen as working fluid to pump water for low head and high discharge. The principal operation of this pump is based on the desorption of hydrogen at high pressure and its absorption at low pressure by a metal hydride. This work is devoted to study a concept of the dynamic behavior of a metal hydride pump using unsteady model and LaNi5 as hydriding alloy. This study shows that with MHP, it is possible to pump 340l/kg-cycle of water in 15 000s using 1 Kg of LaNi5 at a desorption temperature of 360 K, a pumping head equal to 5 m and a desorption gear ratio equal to 33. This study reveals also that the error given by the steady model, using LaNi5 is about 2%.A dimensional mathematical model and the governing equations of the pump were presented to predict the coupled heat and mass transfer within the MHP. Then, a numerical simulation is carried out to present the time evolution of the specific water discharge and to test the effect of different parameters (desorption temperature, absorption temperature, desorption gear ratio) on the performance of the water pumping system (specific water discharge, pumping efficiency and pumping time). In addition, a comparison between results obtained with steady and unsteady model is performed with different hydride mass. Finally, a geometric configuration of the reactor is simulated to optimize the pumping time.

Keywords: dynamic behavior, LaNi5, performance of water pumping system, unsteady model

Procedia PDF Downloads 174
13196 An Enhanced Harmony Search (ENHS) Algorithm for Solving Optimization Problems

Authors: Talha A. Taj, Talha A. Khan, M. Imran Khalid

Abstract:

Optimization techniques attract researchers to formulate a problem and determine its optimum solution. This paper presents an Enhanced Harmony Search (ENHS) algorithm for solving optimization problems. The proposed algorithm increases the convergence and is more efficient than the standard Harmony Search (HS) algorithm. The paper discusses the novel techniques in detail and also provides the strategy for tuning the decisive parameters that affects the efficiency of the ENHS algorithm. The algorithm is tested on various benchmark functions, a real world optimization problem and a constrained objective function. Also, the results of ENHS are compared to standard HS, and various other optimization algorithms. The ENHS algorithms prove to be significantly better and more efficient than other algorithms. The simulation and testing of the algorithms is performed in MATLAB.

Keywords: optimization, harmony search algorithm, MATLAB, electronic

Procedia PDF Downloads 429
13195 Investigation of Heat Affected Zone of Steel P92 Using the Thermal Cycle Simulator

Authors: Petr Mohyla, Ivo Hlavatý, Jiří Hrubý, Lucie Krejčí

Abstract:

This work is focused on mechanical properties and microstructure of heat affected zone (HAZ) of steel P92. The thermal cycle simulator was used for modeling a fine grained zone of HAZ. Hardness and impact toughness were measured on simulated samples. Microstructural analysis using optical microscopy was performed on selected samples. Achieved results were compared with the values of a real welded joint. The thermal cycle simulator allows transferring the properties of very small HAZ to the sufficiently large sample where the tests of the mechanical properties can be performed. A satisfactory accordance was found when comparing the microstructure and mechanical properties of real welds and simulated samples.

Keywords: heat affected zone, impact test, thermal cycle simulator, time of tempering

Procedia PDF Downloads 274
13194 Variations of Total Electron Content over High Latitude Region during the 24th Solar Cycle

Authors: Arun Kumar Singh, Rupesh M. Das, Shailendra Saini

Abstract:

The effect of solar cycle and seasons on the total electron content has been investigated over high latitude region during 24th solar cycle (2010-2014). The total electron content data has been observed with the help of Global Ionospheric Scintillation and TEC monitoring (GISTM) system installed at Indian permanent scientific 'Maitri station' [70˚46’00”S 11˚43’56” E]. The dependence of TEC over a solar cycle has been examined by the performing linear regression analysis between the vertical total electron content (VTEC) and daily total sunspot numbers (SSN). It has been found that the season and level of geomagnetic activity has a considerable effect on the VTEC. It is observed that the VTEC and SSN follow better agreement during summer seasons as compared to winter and equinox seasons and extraordinary agreement during minimum phase (during the year 2010) of the solar cycle. There is a significant correlation between VTEC and SSN during quiet days of the years as compared to overall days of the years (2010-2014). Further, saturation effect has been observed during maximum phase (during the year 2014) of the 24th solar cycle. It is also found that Ap index and SSN has a linear correlation (R=0.37) and the most of the geomagnetic activity occurs during the declining phase of the solar cycle.

Keywords: high latitude ionosphere, sunspot number, correlation, vertical total electron content

Procedia PDF Downloads 164
13193 A Novel Algorithm for Production Scheduling

Authors: Ali Mohammadi Bolban Abad, Fariborz Ahmadi

Abstract:

Optimization in manufacture is a method to use limited resources to obtain the best performance and reduce waste. In this paper a new algorithm based on eurygaster life is introduced to obtain a plane in which task order and completion time of resources are defined. Evaluation results show our approach has less make span when the resources are allocated with some products in comparison to genetic algorithm.

Keywords: evolutionary computation, genetic algorithm, particle swarm optimization, NP-Hard problems, production scheduling

Procedia PDF Downloads 352
13192 Downscaling Daily Temperature with Neuroevolutionary Algorithm

Authors: Min Shi

Abstract:

State of the art research with Artificial Neural Networks for the downscaling of General Circulation Models (GCMs) mainly uses back-propagation algorithm as a training approach. This paper introduces another training approach of ANNs, Evolutionary Algorithm. The combined algorithm names neuroevolutionary (NE) algorithm. We investigate and evaluate the use of the NE algorithms in statistical downscaling by generating temperature estimates at interior points given information from a lattice of surrounding locations. The results of our experiments indicate that NE algorithms can be efficient alternative downscaling methods for daily temperatures.

Keywords: temperature, downscaling, artificial neural networks, evolutionary algorithms

Procedia PDF Downloads 323
13191 An Optimization Algorithm Based on Dynamic Schema with Dissimilarities and Similarities of Chromosomes

Authors: Radhwan Yousif Sedik Al-Jawadi

Abstract:

Optimization is necessary for finding appropriate solutions to a range of real-life problems. In particular, genetic (or more generally, evolutionary) algorithms have proved very useful in solving many problems for which analytical solutions are not available. In this paper, we present an optimization algorithm called Dynamic Schema with Dissimilarity and Similarity of Chromosomes (DSDSC) which is a variant of the classical genetic algorithm. This approach constructs new chromosomes from a schema and pairs of existing ones by exploring their dissimilarities and similarities. To show the effectiveness of the algorithm, it is tested and compared with the classical GA, on 15 two-dimensional optimization problems taken from literature. We have found that, in most cases, our method is better than the classical genetic algorithm.

Keywords: chromosome injection, dynamic schema, genetic algorithm, similarity and dissimilarity

Procedia PDF Downloads 318
13190 Simulation Approach for a Comparison of Linked Cluster Algorithm and Clusterhead Size Algorithm in Ad Hoc Networks

Authors: Ameen Jameel Alawneh

Abstract:

A Mobile ad-hoc network (MANET) is a collection of wireless mobile hosts that dynamically form a temporary network without the aid of a system administrator. It has neither fixed infrastructure nor wireless ad hoc sessions. It inherently reaches several nodes with a single transmission, and each node functions as both a host and a router. The network maybe represented as a set of clusters each managed by clusterhead. The cluster size is not fixed and it depends on the movement of nodes. We proposed a clusterhead size algorithm (CHSize). This clustering algorithm can be used by several routing algorithms for ad hoc networks. An elected clusterhead is assigned for communication with all other clusters. Analysis and simulation of the algorithm has been implemented using GloMoSim networks simulator, MATLAB and MAPL11 proved that the proposed algorithm achieves the goals.

Keywords: simulation, MANET, Ad-hoc, cluster head size, linked cluster algorithm, loss and dropped packets

Procedia PDF Downloads 368
13189 Hybrid Algorithm for Frequency Channel Selection in Wi-Fi Networks

Authors: Cesar Hernández, Diego Giral, Ingrid Páez

Abstract:

This article proposes a hybrid algorithm for spectrum allocation in cognitive radio networks based on the algorithms Analytical Hierarchical Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) to improve the performance of the spectrum mobility of secondary users in cognitive radio networks. To calculate the level of performance of the proposed algorithm a comparative analysis between the proposed AHP-TOPSIS, Grey Relational Analysis (GRA) and Multiplicative Exponent Weighting (MEW) algorithm is performed. Four evaluation metrics is used. These metrics are the accumulative average of failed handoffs, the accumulative average of handoffs performed, the accumulative average of transmission bandwidth, and the accumulative average of the transmission delay. The results of the comparison show that AHP-TOPSIS Algorithm provides 2.4 times better performance compared to a GRA Algorithm and, 1.5 times better than the MEW Algorithm.

Keywords: cognitive radio, decision making, hybrid algorithm, spectrum handoff, wireless networks

Procedia PDF Downloads 510
13188 Analysis of Six Sigma in the Aerospace Industry

Authors: Masimuddin Mohd Khaled

Abstract:

This paper subsidizes to the discussion of Six Sigma in the Aerospace Industry. The main aim of this report is to study the literature review of Six Sigma emphasizing on the aerospace industry. The implementation of Six Sigma stages are studied and how the improvement cycle ‘Define, Measure, Analyze, Improve, and Control cycle’ (DMAIC) and the design process is ‘Define, Measure, Analyze, Design, and Verify Cycle’ (DMADV) is used. The focus is also done by studying how the implementation of Six Sigma on an aerospace company has brought a positive effect to the company.

Keywords: six sigma, DMAIC, DMADV, aerospace

Procedia PDF Downloads 343
13187 Storm-water Management for Greenfield Area Using Low Impact Development Concept for Town Planning Scheme Mechanism

Authors: Sahil Patel

Abstract:

Increasing urbanization leads to a concrete forest. The effects of new development practices occur in the natural hydrologic cycle. Here the concerns have been raised about the groundwater recharge in sufficient quantity. With further development, porous surfaces reduce rapidly. A city like Ahmedabad, with a non-perennial river, is 100% dependent on groundwater. The Ahmedabad city receives its domestic use water from the Narmada river, located about 200 km away. The expenses to bring water is much higher. Ahmedabad city receives annually 800 mm rainfall, and mostly this water increases the local level waterlogging problems; after that, water goes to the Sabarmati river and merges into the sea. The existing developed area of Ahmedabad city is very dense, and does not offer many chances to change the built form and increase porous surfaces to absorb storm-water. Therefore, there is a need to plan upcoming areas with more effective solutions to manage storm-water. This paper is focusing on the management of stormwater for new development by retaining natural hydrology. The Low Impact Development (LID) concept is used to manage storm-water efficiently. Ahmedabad city has a tool called the “Town Planning Scheme,” which helps the local body drive new development by land pooling mechanism. This paper gives a detailed analysis of the selected area (proposed Town Planning Scheme area by the local authority) in Ahmedabad. Here the development control regulations for individual developers and some physical elements for public places are presented to manage storm-water. There is a different solution for the Town Planning scheme than that of the conventional way. A local authority can use it for any area, but it can be site-specific. In the end, there are benefits to locals with some financial analysis and comparisons.

Keywords: water management, green field development, low impact development, town planning scheme

Procedia PDF Downloads 100
13186 Modified Active (MA) Algorithm to Generate Semantic Web Related Clustered Hierarchy for Keyword Search

Authors: G. Leena Giri, Archana Mathur, S. H. Manjula, K. R. Venugopal, L. M. Patnaik

Abstract:

Keyword search in XML documents is based on the notion of lowest common ancestors in the labelled trees model of XML documents and has recently gained a lot of research interest in the database community. In this paper, we propose the Modified Active (MA) algorithm which is an improvement over the active clustering algorithm by taking into consideration the entity aspect of the nodes to find the level of the node pertaining to a particular keyword input by the user. A portion of the bibliography database is used to experimentally evaluate the modified active algorithm and results show that it performs better than the active algorithm. Our modification improves the response time of the system and thereby increases the efficiency of the system.

Keywords: keyword matching patterns, MA algorithm, semantic search, knowledge management

Procedia PDF Downloads 378
13185 Life Cycle Assessment of Biogas Energy Production from a Small-Scale Wastewater Treatment Plant in Central Mexico

Authors: Joel Bonales, Venecia Solorzano, Carlos Garcia

Abstract:

A great percentage of the wastewater generated in developing countries don’t receive any treatment, which leads to numerous environmental impacts. In response to this, a paradigm change in the current wastewater treatment model based on large scale plants towards a small and medium scale based model has been proposed. Nevertheless, small scale wastewater treatment (SS-WTTP) with novel technologies such as anaerobic digesters, as well as the utilization of derivative co-products such as biogas, still presents diverse environmental impacts which must be assessed. This study consisted in a Life Cycle Assessment (LCA) performed to a SS-WWTP which treats wastewater from a small commercial block in the city of Morelia, Mexico. The treatment performed in the SS-WWTP consists in anaerobic and aerobic digesters with a daily capacity of 5,040 L. Two different scenarios were analyzed: the current plant conditions and a hypothetical energy use of biogas obtained in situ. Furthermore, two different allocation criteria were applied: full impact allocation to the system’s main product (treated water) and substitution credits for replacing Mexican grid electricity (biogas) and clean water pumping (treated water). The results showed that the analyzed plant had bigger impacts than what has been reported in the bibliography in the basis of wastewater volume treated, which may imply that this plant is currently operating inefficiently. The evaluated impacts appeared to be focused in the aerobic digestion and electric generation phases due to the plant’s particular configuration. Additional findings prove that the allocation criteria applied is crucial for the interpretation of impacts and that that the energy use of the biogas obtained in this plant can help mitigate associated climate change impacts. It is concluded that SS-WTTP is a environmentally sound alternative for wastewater treatment from a systemic perspective. However, this type of studies must be careful in the selection of the allocation criteria and replaced products, since these factors have a great influence in the results of the assessment.

Keywords: biogas, life cycle assessment, small scale treatment, wastewater treatment

Procedia PDF Downloads 98
13184 An Investigation of the Operation and Performance of London Cycle Hire Scheme

Authors: Amer Ali, Jessica Cecchinelli, Antonis Charalambous

Abstract:

Cycling is one of the most environmentally friendly, economic and healthy modes of transport but it needs more efficient cycle infrastructure and more effective safety measures. This paper represents an investigation into the performance and operation of the London Cycle Hire Scheme which started to operate in July 2010 using 5,000 cycles and 315 docking stations and currently has more than 10,000 cycles and over 700 docking stations across London which are available 24/7, 365 days a year. The study, which was conducted during the second half of 2014, consists of two parts; namely, the longitudinal review of the hire scheme between its introduction in 2010 and November 2014, and a field survey in November 2014 in the form of face-face interviews of the users of the cycle scheme to ascertain the existing limitations and difficulties experienced by those users and how it could be improved in terms of capability and safety. The study also includes a correlation between the usage of the cycle scheme and the corresponding weather conditions. The main findings are that on average the number of users (hiring frequency) had increased from just over two millions hires in 2010 to just less than ten millions in 2014. The field survey showed that 80% of the users are satisfied with the performance of the scheme whilst 50% of the users raised concern about the safety level of using the available cycle routes and infrastructure. The study also revealed that a high percentage of the cycle trips were relatively short (less than 30 minutes). Although the weather condition had some effect on cycling, the cost of using the cycle scheme and the main events in London had more effect on the number of cycle hires. The key conclusions are that despite the safety concern and the lack of infrastructure for continuous routes there was an encouraging number of people who opted for cycling as a clean, affordable, and healthy mode of transport. There is a need to expand the scheme by providing more cycles and docking stations and to support that by more well-designed and maintained cycle routes. More details about the development of London Cycle Hire Scheme during the last five years, its performance and the key issues revealed by the surveyed users will be reported in the full version of the paper.

Keywords: cycling mode of transport, london cycle hire scheme, safety, environmental and health benefits, user satisfaction

Procedia PDF Downloads 365
13183 Cuckoo Search (CS) Optimization Algorithm for Solving Constrained Optimization

Authors: Sait Ali Uymaz, Gülay Tezel

Abstract:

This paper presents the comparison results on the performance of the Cuckoo Search (CS) algorithm for constrained optimization problems. For constraint handling, CS algorithm uses penalty method. CS algorithm is tested on thirteen well-known test problems and the results obtained are compared to Particle Swarm Optimization (PSO) algorithm. Mean, best, median and worst values were employed for the analyses of performance.

Keywords: cuckoo search, particle swarm optimization, constrained optimization problems, penalty method

Procedia PDF Downloads 526
13182 Left to Right-Right Most Parsing Algorithm with Lookahead

Authors: Jamil Ahmed

Abstract:

Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It is contingent on a parsing table, whereas the parsing tables are extracted from the grammar. The parsing table specifies the actions to be taken during parsing. It requires that the parsing table should have no action conflicts for the same input symbol. This requirement imposes a condition on the class of grammars over which the LR algorithms work. However, there are grammars for which the parsing tables hold action conflicts. In such cases, the algorithm needs a capability of scanning (looking-ahead) next input symbols ahead of the current input symbol. In this paper, a ‘Left to Right’-‘Right Most’ parsing algorithm with lookahead capability is introduced. The 'look-ahead' capability in the LR parsing algorithm is the major contribution of this paper. The practicality of the proposed algorithm is substantiated by the parser implementation of the Context Free Grammar (CFG) of an already proposed programming language 'State Controlled Object Oriented Programming' (SCOOP). SCOOP’s Context Free Grammar has 125 productions and 192 item sets. This algorithm parses SCOOP while the grammar requires to ‘look ahead’ the input symbols due to action conflicts in its parsing table. Proposed LR parsing algorithm with lookahead capability can be viewed as an optimization of ‘Simple Left to Right’-‘Right Most’ (SLR) parsing algorithm.

Keywords: left to right-right most parsing, syntax analysis, bottom-up parsing algorithm

Procedia PDF Downloads 94
13181 Improved Whale Algorithm Based on Information Entropy and Its Application in Truss Structure Optimization Design

Authors: Serges Mendomo Meye, Li Guowei, Shen Zhenzhong, Gan Lei, Xu Liqun

Abstract:

Given the limitations of the original whale optimization algorithm (WAO) in local optimum and low convergence accuracy in truss structure optimization problems, based on the fundamental whale algorithm, an improved whale optimization algorithm (SWAO) based on information entropy is proposed. The information entropy itself is an uncertain measure. It is used to control the range of whale searches in path selection. It can overcome the shortcomings of the basic whale optimization algorithm (WAO) and can improve the global convergence speed of the algorithm. Taking truss structure as the optimization research object, the mathematical model of truss structure optimization is established; the cross-sectional area of truss is taken as the design variable; the objective function is the weight of truss structure; and an improved whale optimization algorithm (SWAO) is used for optimization design, which provides a new idea and means for its application in large and complex engineering structure optimization design.

Keywords: information entropy, structural optimization, truss structure, whale algorithm

Procedia PDF Downloads 213
13180 Parallel Version of Reinhard’s Color Transfer Algorithm

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 584
13179 A Filtering Algorithm for a Nonlinear State-Space Model

Authors: Abdullah Eqal Al Mazrooei

Abstract:

Kalman filter is a famous algorithm that utilizes to estimate the state in the linear systems. It has numerous applications in technology and science. Since of the most of applications in real life can be described by nonlinear systems. So, Kalman filter does not work with the nonlinear systems because it is suitable to linear systems only. In this work, a nonlinear filtering algorithm is presented which is suitable to use with the special kinds of nonlinear systems. This filter generalizes the Kalman filter. This means that this filter also can be used for the linear systems. Our algorithm depends on a special linearization of the second degree. We introduced the nonlinear algorithm with a bilinear state-space model. A simulation example is presented to illustrate the efficiency of the algorithm.

Keywords: Kalman filter, filtering algorithm, nonlinear systems, state-space model

Procedia PDF Downloads 350
13178 Chemical Reaction Algorithm for Expectation Maximization Clustering

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems.

Keywords: chemical reaction optimization, expection maimization, initia, objective function clustering

Procedia PDF Downloads 684
13177 Integration of Multi Effect Desalination with Solid Oxide Fuel Cell/Gas Turbine Power Cycle

Authors: Mousa Meratizaman, Sina Monadizadeh, Majid Amidpour

Abstract:

One of the most favorable thermal desalination methods used widely today is Multi Effect Desalination. High energy consumption in this method causes coupling it with high temperature power cycle like gas turbine. This combination leads to higher energy efficiency. One of the high temperature power systems which have cogeneration opportunities is Solid Oxide Fuel Cell / Gas Turbine. Integration of Multi Effect Desalination with Solid Oxide Fuel Cell /Gas Turbine power cycle in a range of 300-1000 kW is considered in this article. The exhausted heat of Solid Oxide Fuel Cell /Gas Turbine power cycle is used in Heat Recovery Steam Generator to produce needed motive steam for Desalination unit. Thermodynamic simulation and parametric studies of proposed system are carried out to investigate the system performance.

Keywords: solid oxide fuel cell, thermodynamic simulation, multi effect desalination, gas turbine hybrid cycle

Procedia PDF Downloads 341
13176 Research on the Strategy of Whole-Life-Cycle Campus Design from the Perspective of Sustainable Concept: A Case Study on Hangzhou Senior High School in Zhejiang

Authors: Fan Yang

Abstract:

With the development of social economy and the popularization of quality education, the Chinese government invests more and more funding in education. Campus constructions are experiencing a great development phase. Under the trend of sustainable development, modern green campus design needs to meet new requirements of contemporary, informational and diversified education means and adapt to future education development. Educators, designers and other participants of campus design are facing new challenges. By studying and analyzing the universal unsatisfied current situations and sustainable development requirements of Chinese campuses, this paper summarizes the strategies and intentions of the whole-life-cycle campus design. In addition, a Chinese high school in Zhejiang province is added to illustrate the design cycle in an actual case. It is aimed to make all participants of campus design, especially the designers, to realize the importance of whole-life-cycle campus design and cooperate better. Sustainable campus design is expected to come true in deed instead of becoming a slogan in this way.

Keywords: campus design, green school, sustainable development, whole-life-cycle design

Procedia PDF Downloads 344
13175 An Improved Genetic Algorithm for Traveling Salesman Problem with Precedence Constraint

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 536
13174 An Approach to Spatial Planning for Water Conservation: The Case of Kovada Sub-Watershed (Turkey)

Authors: Aybike Ayfer Karadağ

Abstract:

Today, the amount of water available is decreasing day by day due to global warming, environmental problems and population increase. To protect water resources, it is necessary to take a lot of measures from the global scale to the local scale. Some of these measures are related to spatial planning studies. In this study, the impact of water process analysis was assessed in the development of spatial planning for water conservation. The study was conducted in the Kovada sub-watershed (Isparta, Turkey). By means of water process analysis, the way to reach underground water of surface water in the study area is mapped. In this context, plant cover, soil and rock permeability were evaluated holistically with geographic information systems technologies. Then, on the map, water permeability is classified and this is spatially expressed. The findings show that the permeability of the water is different in the study case. As a result, the water permeability map needs to be included in the planning for water conservation planning.

Keywords: water, conservation, spatial planning, water process analysis

Procedia PDF Downloads 187