Search results for: range migration algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 10667

Search results for: range migration algorithm

10067 Effects of Particle Size Distribution of Binders on the Performance of Slag-Limestone Ternary Cement

Authors: Zhuomin Zou, Thijs Van Landeghem, Elke Gruyaert

Abstract:

Using supplementary cementitious materials, such as blast-furnace slag and limestone, to replace cement clinker is a promising method to reduce the carbon emissions from cement production. To efficiently use slag and limestone, it is necessary to carefully select the particle size distribution (PSD) of the binders. This study investigated the effects of the PSD of binders on the performance of slag-limestone ternary cement. The Portland cement (PC) was prepared by grinding 95% clinker + 5% gypsum. Based on the PSD parameters of the binders, three types of ternary cements with a similar overall PSD were designed, i.e., NO.1 fine slag, medium PC, and coarse limestone; NO.2 fine limestone, medium PC, and coarse slag; NO.3. fine PC, medium slag, and coarse limestone. The binder contents in the ternary cements were (a) 50 % PC, 40 % slag, and 10 % limestone (called high cement group) or (b) 35 % PC, 55 % slag, and 10 % limestone (called low cement group). The pure PC and binary cement with 50% slag and 50% PC prepared with the same binders as the ternary cement were considered as reference cements. All these cements were used to investigate the mortar performance in terms of workability, strength at 2, 7, 28, and 90 days, carbonation resistance, and non-steady state chloride migration resistance at 28 and 56 days. Results show that blending medium PC with fine slag could exhibit comparable performance to blending fine PC with medium/coarse slag in binary cement. For the three ternary cements in the high cement group, ternary cement with fine limestone (NO.2) shows the lowest strength, carbonation, and chloride migration performance. Ternary cements with fine slag (NO.1) and with fine PC (NO.3) show the highest flexural strength at early and late ages, respectively. In addition, compared with ternary cement with fine PC (NO.3), ternary cement with fine slag (NO.1) has a similar carbonation resistance and a better chloride migration resistance. For the low cement group, three ternary cements have a similar flexural and compressive strength before 7 days. After 28 days, ternary cement with fine limestone (NO.2) shows the highest flexural strength while fine PC (NO.3) has the highest compressive strength. In addition, ternary cement with fine slag (NO.1) shows a better chloride migration resistance but a lower carbonation resistance compared with the other two ternary cements. Moreover, the durability performance of ternary cement with fine PC (NO.3) is better than that of fine limestone (NO.2).

Keywords: limestone, particle size distribution, slag, ternary cement

Procedia PDF Downloads 122
10066 Fast and Scale-Adaptive Target Tracking via PCA-SIFT

Authors: Yawen Wang, Hongchang Chen, Shaomei Li, Chao Gao, Jiangpeng Zhang

Abstract:

As the main challenge for target tracking is accounting for target scale change and real-time, we combine Mean-Shift and PCA-SIFT algorithm together to solve the problem. We introduce similarity comparison method to determine how the target scale changes, and taking different strategies according to different situation. For target scale getting larger will cause location error, we employ backward tracking to reduce the error. Mean-Shift algorithm has poor performance when tracking scale-changing target due to the fixed bandwidth of its kernel function. In order to overcome this problem, we introduce PCA-SIFT matching. Through key point matching between target and template, that adjusting the scale of tracking window adaptively can be achieved. Because this algorithm is sensitive to wrong match, we introduce RANSAC to reduce mismatch as far as possible. Furthermore target relocating will trigger when number of match is too small. In addition we take comprehensive consideration about target deformation and error accumulation to put forward a new template update method. Experiments on five image sequences and comparison with 6 kinds of other algorithm demonstrate favorable performance of the proposed tracking algorithm.

Keywords: target tracking, PCA-SIFT, mean-shift, scale-adaptive

Procedia PDF Downloads 425
10065 Status of Reintroduced Houbara Bustard Chlamydotis macqueeni in Saudi Arabia

Authors: Mohammad Zafar-ul Islam

Abstract:

The breeding programme of Houbara bustard was started in Saudi Arabia in 1986 to undertake the restoration of native species such as Houbara through a programme of re-introduction, involving the release of captive-bred birds in the wild. Two sites were selected for houbara re-introduction, i.e., Mahazat as-Sayd and Saja Umm Ar-Rimth protected areas in 1988 and 1998 respectively. Both the areas are fenced fairly level, sandy plain with a few rock outcrops. Captive bred houbara have been released in Mahazat since 1992 by NWRC and those birds have been successfully breeding since then. The nesting season of the houbara at Mahazat recorded from February to May and on an average 20-25 nests are located each year but no nesting recorded in Saja. Houbara are monitored using radio transmitters through aerial tracking technique and also a vehicle for terrestrial tracking. Total population of houbara in Mahazat is roughly estimated around 300-400 birds, using the following: N = n1+n2+n3+n4+n5 (n1 = released or wild-born, radio, regularly monitored/checked; n2 = radio tagged missing; n3 = wild born chicks not recorded; n4 = wild born chicks, recorded but not tagged; n5 = immigrants). However, in Saja only 4-7 individuals of houbara have been survived since 2001 because most of the birds are predated immediately after the release. The mean annual home was also calculated using Kernel and Convex polygons methods with Range VII software. The minimum density of houbara was also calculated. In order to know the houbara movement or their migration to other regions, two captive-reared male houbara that were released into the wild and one wild born female were fitted with Platform Transmitter Terminals (PTT). The home range shows that wild-born female has larger movement than two males. More areas need to be selected for reintroduction programme to establish the network of sites to provide easy access to move these birds and mingle with the wild houbara. Some potential sites have been proposed which require more surveys to check the habitat suitability.

Keywords: re-introduction, survival rate, home range, Saudi Arabia

Procedia PDF Downloads 406
10064 Comparative Analysis of Two Different Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem

Authors: Sourabh Joshi, Tarun Sharma, Anurag Sharma

Abstract:

Ant Colony Optimization is heuristic Algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Two variants of Ant Colony Optimization algorithm named Ant System and Max-Min Ant System are implemented in MATLAB to solve travelling Salesman Problem and the results are compared. In, this paper both systems are analyzed by solving the some Travelling Salesman Problem and depict which system solve the problem better in term of cost and time.

Keywords: Ant Colony Optimization, Travelling Salesman Problem, Ant System, Max-Min Ant System

Procedia PDF Downloads 472
10063 An Efficient Algorithm for Global Alignment of Protein-Protein Interaction Networks

Authors: Duc Dong Do, Ngoc Ha Tran, Thanh Hai Dang, Cao Cuong Dang, Xuan Huan Hoang

Abstract:

Global aligning two protein-protein interaction networks is an essentially important task in bioinformatics/computational biology field of study. It is a challenging and widely studied research topic in recent years. Accurately aligned networks allow us to identify functional modules of proteins and/ororthologous proteins from which unknown functions of a protein can be inferred. We here introduce a novel efficient heuristic global network alignment algorithm called FASTAn, including two phases: the first to construct an initial alignment and the second to improve such alignment by exerting a local optimization repeated procedure. The experimental results demonstrated that FASTAn outperformed the state-of-the-art global network alignment algorithm namely SPINAL in terms of both commonly used objective scores and the run-time.

Keywords: FASTAn, Heuristic algorithm, biological network alignment, protein-protein interaction networks

Procedia PDF Downloads 597
10062 On the convergence of the Mixed Integer Randomized Pattern Search Algorithm

Authors: Ebert Brea

Abstract:

We propose a novel direct search algorithm for identifying at least a local minimum of mixed integer nonlinear unconstrained optimization problems. The Mixed Integer Randomized Pattern Search Algorithm (MIRPSA), so-called by the author, is based on a randomized pattern search, which is modified by the MIRPSA for finding at least a local minimum of our problem. The MIRPSA has two main operations over the randomized pattern search: moving operation and shrinking operation. Each operation is carried out by the algorithm when a set of conditions is held. The convergence properties of the MIRPSA is analyzed using a Markov chain approach, which is represented by an infinite countable set of state space λ, where each state d(q) is defined by a measure of the qth randomized pattern search Hq, for all q in N. According to the algorithm, when a moving operation is carried out on the qth randomized pattern search Hq, the MIRPSA holds its state. Meanwhile, if the MIRPSA carries out a shrinking operation over the qth randomized pattern search Hq, the algorithm will visit the next state, this is, a shrinking operation at the qth state causes a changing of the qth state into (q+1)th state. It is worthwhile pointing out that the MIRPSA never goes back to any visited states because the MIRPSA only visits any qth by shrinking operations. In this article, we describe the MIRPSA for mixed integer nonlinear unconstrained optimization problems for doing a deep study of its convergence properties using Markov chain viewpoint. We herein include a low dimension case for showing more details of the MIRPSA, when the algorithm is used for identifying the minimum of a mixed integer quadratic function. Besides, numerical examples are also shown in order to measure the performance of the MIRPSA.

Keywords: direct search, mixed integer optimization, random search, convergence, Markov chain

Procedia PDF Downloads 464
10061 Water Problems, Social Mobilization and Migration: A Case Study of Lake Urmia

Authors: Fatemeh Dehghan Khangahi, Hakan Gunes

Abstract:

Transforming a public necessity into a commercial commodity becomes more and more evident as time goes on, and it is one of the issues of water shortage. Development projects of countries, consume the water and waterbeds in various forms, ignoring the concepts such as sustainability and the negative effects they place on the environment, pollute and change the ways of waterways. Throughout these processes, the water basins and all the vital environments sometimes can suffer damage to the irreparable level. In this context, the issue of Lake Urmia that is located in the North West of Iran left alone by drought, has been researched. The lake, which is on the list of UNESCO's biosphere reserves, is now exposed to the danger of desiccation. If the desiccation is fully realized, more than 5.000.000 people that they are living around the lake, will have to migrate as a result of negative living conditions. As a matter of fact, along with the recent years of increasing drought level, regional migrations have begun. In addition to migration issues, it is also necessary to specify the negative effects on human and all-round’s life that depend on the formation of salt storms, mixing of salt into the air and soil, which threaten human health seriously because the lake is salty. The main aim of this work is to raise national and international awareness of this problem, which is an environment and a human tragedy at the same time. This research has two basic questions: 1) In the case of Lake Urmia, what are environmental problems and how they have emerged and what is the role of governments? 2) What is the social consequence of this problem in relation to the first question? In response, after the literature search, having a comparative view of the situation of the Aral Sea and the Great Salt Lake (Utah, USA), which involved the two major international examples. The first, one is related to the terms of population and migration, the second is about biological properties. Then, data and status information that provided after 3 years area research has been evaluated. Towards the end, with the support of qualitative and quantitative methods, the study of social mobilization in the region has been carried out. An example of it is using the public space of TRAXTOR matches like a protests area.

Keywords: environment problems, water, social mobilization, Lake Urmia, migration

Procedia PDF Downloads 126
10060 Arithmetic Operations Based on Double Base Number Systems

Authors: K. Sanjayani, C. Saraswathy, S. Sreenivasan, S. Sudhahar, D. Suganya, K. S. Neelukumari, N. Vijayarangan

Abstract:

Double Base Number System (DBNS) is an imminent system of representing a number using two bases namely 2 and 3, which has its application in Elliptic Curve Cryptography (ECC) and Digital Signature Algorithm (DSA).The previous binary method representation included only base 2. DBNS uses an approximation algorithm namely, Greedy Algorithm. By using this algorithm, the number of digits required to represent a larger number is less when compared to the standard binary method that uses base 2 algorithms. Hence, the computational speed is increased and time being reduced. The standard binary method uses binary digits 0 and 1 to represent a number whereas the DBNS method uses binary digit 1 alone to represent any number (canonical form). The greedy algorithm uses two ways to represent the number, one is by using only the positive summands and the other is by using both positive and negative summands. In this paper, arithmetic operations are used for elliptic curve cryptography. Elliptic curve discrete logarithm problem is the foundation for most of the day to day elliptic curve cryptography. This appears to be a momentous hard slog compared to digital logarithm problem. In elliptic curve digital signature algorithm, the key generation requires 160 bit of data by usage of standard binary representation. Whereas, the number of bits required generating the key can be reduced with the help of double base number representation. In this paper, a new technique is proposed to generate key during encryption and extraction of key in decryption.

Keywords: cryptography, double base number system, elliptic curve cryptography, elliptic curve digital signature algorithm

Procedia PDF Downloads 392
10059 Improved Artificial Bee Colony Algorithm for Non-Convex Economic Power Dispatch Problem

Authors: Badr M. Alshammari, T. Guesmi

Abstract:

This study presents a modified version of the artificial bee colony (ABC) algorithm by including a local search technique for solving the non-convex economic power dispatch problem. The local search step is incorporated at the end of each iteration. Total system losses, valve-point loading effects and prohibited operating zones have been incorporated in the problem formulation. Thus, the problem becomes highly nonlinear and with discontinuous objective function. The proposed technique is validated using an IEEE benchmark system with ten thermal units. Simulation results demonstrate that the proposed optimization algorithm has better convergence characteristics in comparison with the original ABC algorithm.

Keywords: economic power dispatch, artificial bee colony, valve-point loading effects, prohibited operating zones

Procedia PDF Downloads 250
10058 An Application of Integrated Multi-Objective Particles Swarm Optimization and Genetic Algorithm Metaheuristic through Fuzzy Logic for Optimization of Vehicle Routing Problems in Sugar Industry

Authors: Mukhtiar Singh, Sumeet Nagar

Abstract:

Vehicle routing problem (VRP) is a combinatorial optimization and nonlinear programming problem aiming to optimize decisions regarding given set of routes for a fleet of vehicles in order to provide cost-effective and efficient delivery of both services and goods to the intended customers. This paper proposes the application of integrated particle swarm optimization (PSO) and genetic optimization algorithm (GA) to address the Vehicle routing problem in sugarcane industry in India. Suger industry is very prominent agro-based industry in India due to its impacts on rural livelihood and estimated to be employing around 5 lakhs workers directly in sugar mills. Due to various inadequacies, inefficiencies and inappropriateness associated with the current vehicle routing model it costs huge money loss to the industry which needs to be addressed in proper context. The proposed algorithm utilizes the crossover operation that originally appears in genetic algorithm (GA) to improve its flexibility and manipulation more readily and avoid being trapped in local optimum, and simultaneously for improving the convergence speed of the algorithm, level set theory is also added to it. We employ the hybrid approach to an example of VRP and compare its result with those generated by PSO, GA, and parallel PSO algorithms. The experimental comparison results indicate that the performance of hybrid algorithm is superior to others, and it will become an effective approach for solving discrete combinatory problems.

Keywords: fuzzy logic, genetic algorithm, particle swarm optimization, vehicle routing problem

Procedia PDF Downloads 390
10057 Predictive Analysis for Big Data: Extension of Classification and Regression Trees Algorithm

Authors: Ameur Abdelkader, Abed Bouarfa Hafida

Abstract:

Since its inception, predictive analysis has revolutionized the IT industry through its robustness and decision-making facilities. It involves the application of a set of data processing techniques and algorithms in order to create predictive models. Its principle is based on finding relationships between explanatory variables and the predicted variables. Past occurrences are exploited to predict and to derive the unknown outcome. With the advent of big data, many studies have suggested the use of predictive analytics in order to process and analyze big data. Nevertheless, they have been curbed by the limits of classical methods of predictive analysis in case of a large amount of data. In fact, because of their volumes, their nature (semi or unstructured) and their variety, it is impossible to analyze efficiently big data via classical methods of predictive analysis. The authors attribute this weakness to the fact that predictive analysis algorithms do not allow the parallelization and distribution of calculation. In this paper, we propose to extend the predictive analysis algorithm, Classification And Regression Trees (CART), in order to adapt it for big data analysis. The major changes of this algorithm are presented and then a version of the extended algorithm is defined in order to make it applicable for a huge quantity of data.

Keywords: predictive analysis, big data, predictive analysis algorithms, CART algorithm

Procedia PDF Downloads 135
10056 Sinusoidal Roughness Elements in a Square Cavity

Authors: Muhammad Yousaf, Shoaib Usman

Abstract:

Numerical studies were conducted using Lattice Boltzmann Method (LBM) to study the natural convection in a square cavity in the presence of roughness. An algorithm basedon a single relaxation time Bhatnagar-Gross-Krook (BGK) model of Lattice Boltzmann Method (LBM) was developed. Roughness was introduced on both the hot and cold walls in the form of sinusoidal roughness elements. The study was conducted for a Newtonian fluid of Prandtl number (Pr) 1.0. The range of Ra number was explored from 103 to 106 in a laminar region. Thermal and hydrodynamic behavior of fluid was analyzed using a differentially heated square cavity with roughness elements present on both the hot and cold wall. Neumann boundary conditions were introduced on horizontal walls with vertical walls as isothermal. The roughness elements were at the same boundary condition as corresponding walls. Computational algorithm was validated against previous benchmark studies performed with different numerical methods, and a good agreement was found to exist. Results indicate that the maximum reduction in the average heat transfer was16.66 percent at Ra number 105.

Keywords: Lattice Boltzmann method, natural convection, nusselt number, rayleigh number, roughness

Procedia PDF Downloads 523
10055 Modeling of Erosion and Sedimentation Impacts from off-Road Vehicles in Arid Regions

Authors: Abigail Rosenberg, Jennifer Duan, Michael Poteuck, Chunshui Yu

Abstract:

The Barry M. Goldwater Range, West in southwestern Arizona encompasses 2,808 square kilometers of Sonoran Desert. The hyper-arid range has an annual rainfall of less than 10 cm with an average high temperature of 41 degrees Celsius in July to an average low of 4 degrees Celsius in January. The range shares approximately 60 kilometers of the international border with Mexico. A majority of the range is open for recreational use, primarily off-highway vehicles. Because of its proximity to Mexico, the range is also heavily patrolled by U.S. Customs and Border Protection seeking to intercept and apprehend inadmissible people and illicit goods. Decades of off-roading and Border Patrol activities have negatively impacted this sensitive desert ecosystem. To assist the range program managers, this study is developing a model to identify erosion prone areas and calibrate the model’s parameters using the Automated Geospatial Watershed Assessment modeling tool.

Keywords: arid lands, automated geospatial watershed assessment, erosion modeling, sedimentation modeling, watershed modeling

Procedia PDF Downloads 364
10054 Optimal Design of Multi-Machine Power System Stabilizers Using Interactive Honey Bee Mating Optimization

Authors: Hossein Ghadimi, Alireza Alizadeh, Oveis Abedinia, Noradin Ghadimi

Abstract:

This paper presents an enhanced Honey Bee Mating Optimization (HBMO) to solve the optimal design of multi machine power system stabilizer (PSSs) parameters, which is called the Interactive Honey Bee Mating Optimization (IHBMO). Power System Stabilizers (PSSs) are now routinely used in the industry to damp out power system oscillations. The design problem of the proposed controller is formulated as an optimization problem and IHBMO algorithm is employed to search for optimal controller parameters. The proposed method is applied to multi-machine power system (MPS). The method suggested in this paper can be used for designing robust power system stabilizers for guaranteeing the required closed loop performance over a prespecified range of operating and system conditions. The simplicity in design and implementation of the proposed stabilizers makes them better suited for practical applications in real plants. The non-linear simulation results are presented under wide range of operating conditions in comparison with the PSO and CPSS base tuned stabilizer one through FD and ITAE performance indices. The results evaluation shows that the proposed control strategy achieves good robust performance for a wide range of system parameters and load changes in the presence of system nonlinearities and is superior to the other controllers.

Keywords: power system stabilizer, IHBMO, multimachine, nonlinearities

Procedia PDF Downloads 500
10053 Influence of Parameters of Modeling and Data Distribution for Optimal Condition on Locally Weighted Projection Regression Method

Authors: Farhad Asadi, Mohammad Javad Mollakazemi, Aref Ghafouri

Abstract:

Recent research in neural networks science and neuroscience for modeling complex time series data and statistical learning has focused mostly on learning from high input space and signals. Local linear models are a strong choice for modeling local nonlinearity in data series. Locally weighted projection regression is a flexible and powerful algorithm for nonlinear approximation in high dimensional signal spaces. In this paper, different learning scenario of one and two dimensional data series with different distributions are investigated for simulation and further noise is inputted to data distribution for making different disordered distribution in time series data and for evaluation of algorithm in locality prediction of nonlinearity. Then, the performance of this algorithm is simulated and also when the distribution of data is high or when the number of data is less the sensitivity of this approach to data distribution and influence of important parameter of local validity in this algorithm with different data distribution is explained.

Keywords: local nonlinear estimation, LWPR algorithm, online training method, locally weighted projection regression method

Procedia PDF Downloads 495
10052 Agrarian Distress and out Migration of Youths: Study of a Wet Land Village in Hirakud Command Area, Odisha

Authors: Kishor K. Podh

Abstract:

Agriculture in India treated as the backbone of its economy. It has been accommodated to more than 60 percent of its population as their economic base, directly or indirectly for their livelihood. Besides its significant role, the sharp declines in public investment and development in agriculture have witnessed. After independence Hirakud Command Area (HCA) popularly known as the Rice Bowl of State, due to its fabulous production and provides food to a larger part of the state. After the great green revolution and then liberalization agrarian families become overburden with the loan. They started working as wage laborer in other’s field and non-farm sectors to overcome from the uninvited indebtedness. Although production increases at present, still the youths of this area migrating outsides for job Tamil Nadu, Andhra Pradesh, Maharashtra, Gujarat, etc. Because agriculture no longer remains a profitable occupation; increasing input costs, the uncertainty of crops, improper pricing, poor marketing, etc. compels the youths to choose the alternative occupations. They work in industries (under contractors), construction workers and other menial jobs due to lack of skills and degrees. Kharmunda a village within HCA selected as per the convenience and 100 youth migrants were interviewed purposively selected who were present during data collection. The study analyses the types of migration; its similarity/differentiations, its determining factors, in tow geographical areas of Western Odisha, i.e., single crop and double crops in relation to agricultural situations.

Keywords: agrarian distress, double crops, Hirakud Command Area, indebtedness, out migration, Western Odisha

Procedia PDF Downloads 324
10051 Combined Effect of High Curing Temperature and Crack Width on Chloride Migration in Reinforced Concrete Beams

Authors: Elkedrouci Lotfi, Diao Bo, Pang Sen, Li Yi

Abstract:

Deterioration of reinforced concrete structures is a serious concern in the construction engineering, largely due to chloride induced corrosion of reinforcement. Chloride penetration is markedly influenced by one or several major factors at the same time such as cuing in combination with different crack widths which have spectacular effect on reinforced concrete structures. This research presents the results of an experimental investigation involving reinforced concrete beams with three different crack widths ranging from 0 to 0.2mm, curing temperatures of 20°C or 40°C and water-to-cement of 0.5. Chloride content profiles were determined under non-steady state diffusion at 20°C. Based on the obtained results, higher chloride content was obtained under condition of high curing temperature in combination with large crack more than 0.1mm and there are no significant differences between narrow crack width (less than 0.1 mm) and beams without crack (0mm).

Keywords: crack width, high curing temperature, rapid chloride migration, reinforced concrete beam

Procedia PDF Downloads 199
10050 A Hybrid Distributed Algorithm for Solving Job Shop Scheduling Problem

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a distributed hybrid algorithm is proposed for solving the job shop scheduling problem. The suggested method executes different artificial neural networks, heuristics and meta-heuristics simultaneously on more than one machine. The neural networks are used to control the constraints of the problem while the meta-heuristics search the global space and the heuristics are used to prevent the premature convergence. To attain an efficient distributed intelligent method for solving big and distributed job shop scheduling problems, Apache Spark and Hadoop frameworks are used. In the algorithm implementation and design steps, new approaches are applied. Comparison between the proposed algorithm and other efficient algorithms from the literature shows its efficiency, which is able to solve large size problems in short time.

Keywords: distributed algorithms, Apache Spark, Hadoop, job shop scheduling, neural network

Procedia PDF Downloads 382
10049 Robust Data Image Watermarking for Data Security

Authors: Harsh Vikram Singh, Ankur Rai, Anand Mohan

Abstract:

In this paper, we propose secure and robust data hiding algorithm based on DCT by Arnold transform and chaotic sequence. The watermark image is scrambled by Arnold cat map to increases its security and then the chaotic map is used for watermark signal spread in middle band of DCT coefficients of the cover image The chaotic map can be used as pseudo-random generator for digital data hiding, to increase security and robustness .Performance evaluation for robustness and imperceptibility of proposed algorithm has been made using bit error rate (BER), normalized correlation (NC), and peak signal to noise ratio (PSNR) value for different watermark and cover images such as Lena, Girl, Tank images and gain factor .We use a binary logo image and text image as watermark. The experimental results demonstrate that the proposed algorithm achieves higher security and robustness against JPEG compression as well as other attacks such as addition of noise, low pass filtering and cropping attacks compared to other existing algorithm using DCT coefficients. Moreover, to recover watermarks in proposed algorithm, there is no need to original cover image.

Keywords: data hiding, watermarking, DCT, chaotic sequence, arnold transforms

Procedia PDF Downloads 506
10048 Wait-Optimized Scheduler Algorithm for Efficient Process Scheduling in Computer Systems

Authors: Md Habibur Rahman, Jaeho Kim

Abstract:

Efficient process scheduling is a crucial factor in ensuring optimal system performance and resource utilization in computer systems. While various algorithms have been proposed over the years, there are still limitations to their effectiveness. This paper introduces a new Wait-Optimized Scheduler (WOS) algorithm that aims to minimize process waiting time by dividing them into two layers and considering both process time and waiting time. The WOS algorithm is non-preemptive and prioritizes processes with the shortest WOS. In the first layer, each process runs for a predetermined duration, and any unfinished process is subsequently moved to the second layer, resulting in a decrease in response time. Whenever the first layer is free or the number of processes in the second layer is twice that of the first layer, the algorithm sorts all the processes in the second layer based on their remaining time minus waiting time and sends one process to the first layer to run. This ensures that all processes eventually run, optimizing waiting time. To evaluate the performance of the WOS algorithm, we conducted experiments comparing its performance with traditional scheduling algorithms such as First-Come-First-Serve (FCFS) and Shortest-Job-First (SJF). The results showed that the WOS algorithm outperformed the traditional algorithms in reducing the waiting time of processes, particularly in scenarios with a large number of short tasks with long wait times. Our study highlights the effectiveness of the WOS algorithm in improving process scheduling efficiency in computer systems. By reducing process waiting time, the WOS algorithm can improve system performance and resource utilization. The findings of this study provide valuable insights for researchers and practitioners in developing and implementing efficient process scheduling algorithms.

Keywords: process scheduling, wait-optimized scheduler, response time, non-preemptive, waiting time, traditional scheduling algorithms, first-come-first-serve, shortest-job-first, system performance, resource utilization

Procedia PDF Downloads 82
10047 Comparison of ANFIS Update Methods Using Genetic Algorithm, Particle Swarm Optimization, and Artificial Bee Colony

Authors: Michael R. Phangtriastu, Herriyandi Herriyandi, Diaz D. Santika

Abstract:

This paper presents a comparison of the implementation of metaheuristic algorithms to train the antecedent parameters and consequence parameters in the adaptive network-based fuzzy inference system (ANFIS). The algorithms compared are genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC). The objective of this paper is to benchmark well-known metaheuristic algorithms. The algorithms are applied to several data set with different nature. The combinations of the algorithms' parameters are tested. In all algorithms, a different number of populations are tested. In PSO, combinations of velocity are tested. In ABC, a different number of limit abandonment are tested. Experiments find out that ABC is more reliable than other algorithms, ABC manages to get better mean square error (MSE) than other algorithms in all data set.

Keywords: ANFIS, artificial bee colony, genetic algorithm, metaheuristic algorithm, particle swarm optimization

Procedia PDF Downloads 346
10046 Beyond Juridical Approaches: The Role of Sociological Approach in Promoting Human Rights of Migrants

Authors: Ali Aghahosseini Dehaghani

Abstract:

Every year in this globalized world, thousands of migrants leave their countries hoping to find a better situation of life in other parts of the world. In this regard, many questions, from a human rights point of view, have been raised about how this phenomenon should be managed in the host countries. Although legal approaches such as legislation and litigation are inevitable in the way to respect the human rights of migrants, there is an increasing consensus about the fact that a strict juridical approach is inadequate to protect as well as to prevent violations of migrants’ rights. Indeed, given the multiplicity of factors that affect and shape the application of these rights and considering the fact that law is a social phenomenon, what is needed is an interdisciplinary approach, which combines both juridical approaches and perspectives from other disciplines. In this respect, a sociological approach is important because it shows the social processes through which human rights of migrants have been constructed or violated in particular social situations. Sociologists who study international migration ask the questions such as how many people migrate, who migrates, why people migrate, what happens to them once they arrive in the host country, how migration affects sending and receiving communities, the extent to which migrants help the economy, the effects of migration on crimes, and how migrants change the local communities. This paper is an attempt to show how sociology can promote human rights of migrants. To this end, the article first explores the usefulness and value of an interdisciplinary approach to realize how and to what extent sociology may improve and promote the human rights of migrants in the destination country. It then examines mechanisms which help to reach to a systematic integration of law and sociological discipline to advance migrants’ rights as well as to encourage legal scholars to consider the implications of societal structures in their works.

Keywords: human rights, migrants, sociological approach, interdisciplinary study

Procedia PDF Downloads 449
10045 An Efficient Strategy for Relay Selection in Multi-Hop Communication

Authors: Jung-In Baik, Seung-Jun Yu, Young-Min Ko, Hyoung-Kyu Song

Abstract:

This paper proposes an efficient relaying algorithm to obtain diversity for improving the reliability of a signal. The algorithm achieves time or space diversity gain by multiple versions of the same signal through two routes. Relays are separated between a source and destination. The routes between the source and destination are set adaptive in order to deal with different channels and noises. The routes consist of one or more relays and the source transmits its signal to the destination through the routes. The signals from the relays are combined and detected at the destination. The proposed algorithm provides a better performance than the conventional algorithms in bit error rate (BER).

Keywords: multi-hop, OFDM, relay, relaying selection

Procedia PDF Downloads 440
10044 Remittances and Water Access: A Cross-Sectional Study of Sub Saharan Africa Countries

Authors: Narges Ebadi, Davod Ahmadi, Hiliary Monteith, Hugo Melgar-Quinonez

Abstract:

Migration cannot necessarily relieve pressure on water resources in origin communities, and male out-migration can increase the water management burden of women. However, inflows of financial remittances seem to offer possibilities of investing in improving drinking-water access. Therefore, remittances may be an important pathway for migrants to support water security. This paper explores the association between water access and the receipt of remittances in households in sub-Saharan Africa. Data from round 6 of the 'Afrobarometer' surveys in 2016 were used (n= 49,137). Descriptive, bivariate and multivariate statistical analyses were carried out in this study. Regardless of country, findings from descriptive analyses showed that approximately 80% of the respondents never received remittance, and 52% had enough clean water. Only one-fifth of the respondents had piped water supply inside the house (19.9%), and approximately 25% had access to a toilet inside the house. Bivariate analyses revealed that even though receiving remittances was significantly associated with water supply, the strength of association was very weak. However, other factors such as the area of residence (rural vs. urban), cash income frequencies, electricity access, and asset ownership were strongly associated with water access. Results from unadjusted multinomial logistic regression revealed that the probability of having no access to piped water increased among remittance recipients who received financial support at least once a month (OR=1.324) (p < 0.001). In contrast, those not receiving remittances were more likely to regularly have a water access concern (OR=1.294) (p < 0.001), and not have access to a latrine (OR=1.665) (p < 0.001). In conclusion, receiving remittances is significantly related to water access as the strength of odds ratios for socio-demographic factors was stronger.

Keywords: remittances, water access, SSA, migration

Procedia PDF Downloads 163
10043 Migrant Labour in Kerala: A Study on Inter-State Migrant Workers

Authors: Arun Perumbilavil Anand

Abstract:

In the recent years, Kerala is witnessing a large inflow of migrants from different parts of the country. Though initially, the migrants were largely from the districts of Tamil Nadu and mostly of seasonal nature, but at a later period, the state started getting migrants from the far-off states like UP, Assam, Bengal, etc. Higher wages for unskilled labour, large opportunities for employment, the reluctance on the part of Kerala workers to do menial and hard physical work, and the shortage of local labour, paradoxically despite the high unemployment rate in the state, led to the massive influx of migrant labourers. This study takes a multi-dimensional overview of migrant labour in Kerala by encompassing factors such as channels of migration, nature of employment contracts entered into and the corresponding wages and benefits obtained by them. The study also analysed the circumstances that led to the large influx of migrants from different states of India. It further makes an attempt to examine the varying dimensions of living and working environment, and also the health conditions of migrants. The study is based on the empirical findings obtained as a result of the primary interviews conducted with migrants in the districts of Palakkad, Malappuram, and Ernakulam. The study concludes by noting that Kerala will inevitably have to depend on migrant labour and is likely to experience heavy in-migration of labour in future, provided that if the existing socioeconomic and demographic situations persist. Since, this is inevitable, the best way before the state is to prepare well in advance to receive and accommodate such migrant labour to lead a comfortable life in a hassle free environment, so that it would definitely play a vital role in further strengthening and sustaining the growth trajectory of not only Kerala’s economy but also the states of origin.

Keywords: Kerala, labour, migration, migrant workers

Procedia PDF Downloads 242
10042 An Automated Optimal Robotic Assembly Sequence Planning Using Artificial Bee Colony Algorithm

Authors: Balamurali Gunji, B. B. V. L. Deepak, B. B. Biswal, Amrutha Rout, Golak Bihari Mohanta

Abstract:

Robots play an important role in the operations like pick and place, assembly, spot welding and much more in manufacturing industries. Out of those, assembly is a very important process in manufacturing, where 20% of manufacturing cost is wholly occupied by the assembly process. To do the assembly task effectively, Assembly Sequences Planning (ASP) is required. ASP is one of the multi-objective non-deterministic optimization problems, achieving the optimal assembly sequence involves huge search space and highly complex in nature. Many researchers have followed different algorithms to solve ASP problem, which they have several limitations like the local optimal solution, huge search space, and execution time is more, complexity in applying the algorithm, etc. By keeping the above limitations in mind, in this paper, a new automated optimal robotic assembly sequence planning using Artificial Bee Colony (ABC) Algorithm is proposed. In this algorithm, automatic extraction of assembly predicates is done using Computer Aided Design (CAD) interface instead of extracting the assembly predicates manually. Due to this, the time of extraction of assembly predicates to obtain the feasible assembly sequence is reduced. The fitness evaluation of the obtained feasible sequence is carried out using ABC algorithm to generate the optimal assembly sequence. The proposed methodology is applied to different industrial products and compared the results with past literature.

Keywords: assembly sequence planning, CAD, artificial Bee colony algorithm, assembly predicates

Procedia PDF Downloads 233
10041 Prandtl Number Influence Analysis on Droplet Migration in Natural Convection Flow Using the Level Set Method

Authors: Isadora Bugarin, Taygoara F. de Oliveira

Abstract:

Multiphase flows have currently been placed as a key solution for technological advances in energy and thermal sciences. The comprehension of droplet motion and behavior on non-isothermal flows is, however, rather limited. The present work consists of an investigation of a 2D droplet migration on natural convection inside a square enclosure with differentially heated walls. The investigation in question concerns the effects on drop motion of imposing different combinations of Prandtl and Rayleigh numbers while defining the drop on distinct initial positions. The finite differences method was used to compute the Navier-Stokes and energy equations for a laminar flow, considering the Boussinesq approximation. Also, a high order level set method was applied to simulate the two-phase flow. A previous analysis developed by the authors had shown that for fixed values of Rayleigh and Prandtl, the variation of the droplet initial position at the beginning of the simulation delivered different patterns of motion, in which for Ra≥10⁴ the droplet presents two very specific behaviors: it can travel through a helical path towards the center or define cyclic circular paths resulting in closed paths when reaching the stationary regime. Now, when varying the Prandtl number for different Rayleigh regimes, it was observed that this particular parameter also affects the migration of the droplet, altering the motion patterns as its value is increased. On higher Prandtl values, the drop performs wider paths with larger amplitudes, traveling closer to the walls and taking longer time periods to finally reach the stationary regime. It is important to highlight that drastic drop behavior changes on the stationary regime were not yet observed, but the path traveled from the begging of the simulation until the stationary regime was significantly altered, resulting in distinct turning over frequencies. The flow’s unsteady Nusselt number is also registered for each case studied, enabling a discussion on the overall effects on heat transfer variations.

Keywords: droplet migration, level set method, multiphase flow, natural convection in enclosure, Prandtl number

Procedia PDF Downloads 116
10040 Solvent extraction of molybdenum (VI) with two organophosphorus reagents TBP and D2EHPA under microwave irradiations

Authors: Ahmed Boucherit, Hussein Khalaf, Eduardo Paredes, José Luis Todolí

Abstract:

Solvent extraction studies of molybdenum (VI) with two organophosphorus reagents namely TBP and D2EHPA have been carried out from aqueous acidic solutions of HCl, H2SO4 and H3PO4 under microwave irradiations. The extraction efficiencies of the investigated extractants in the extraction of molybdenum (Vl) were compared. Extraction yield was found unchanged when microwave power varied in the range 20-100 Watts from H2SO4 or H3PO4 but it decreases in the range 20-60 Watts and increases in the range 60-100 Watts when TBP is used for extraction of molybdenum (VI) from 1 M HCl solutions. Extraction yield of molybdenum (VI) was found higher with TBP for HCl molarities greater than 1 M than with D2EHPA for H3PO4 molarities lower than 1 M. Extraction yield increases with HCl molarities in the range 0.50 - 1.80 M but it decreases with the increase in H2SO4 and H3PO4 molarities in the range of 0.05 - 1 M and 0.50 - 1 M, respectively.

Keywords: extraction, molybdenum, microwave, solvent

Procedia PDF Downloads 631
10039 Construction of a Dynamic Migration Model of Extracellular Fluid in Brain for Future Integrated Control of Brain State

Authors: Tomohiko Utsuki, Kyoka Sato

Abstract:

In emergency medicine, it is recognized that brain resuscitation is very important for the reduction of mortality rate and neurological sequelae. Especially, the control of brain temperature (BT), intracranial pressure (ICP), and cerebral blood flow (CBF) are most required for stabilizing brain’s physiological state in the treatment for such as brain injury, stroke, and encephalopathy. However, the manual control of BT, ICP, and CBF frequently requires the decision and operation of medical staff, relevant to medication and the setting of therapeutic apparatus. Thus, the integration and the automation of the control of those is very effective for not only improving therapeutic effect but also reducing staff burden and medical cost. For realizing such integration and automation, a mathematical model of brain physiological state is necessary as the controlled object in simulations, because the performance test of a prototype of the control system using patients is not ethically allowed. A model of cerebral blood circulation has already been constructed, which is the most basic part of brain physiological state. Also, a migration model of extracellular fluid in brain has been constructed, however the condition that the total volume of intracranial cavity is almost changeless due to the hardness of cranial bone has not been considered in that model. Therefore, in this research, the dynamic migration model of extracellular fluid in brain was constructed on the consideration of the changelessness of intracranial cavity’s total volume. This model is connectable to the cerebral blood circulation model. The constructed model consists of fourteen compartments, twelve of which corresponds to perfused area of bilateral anterior, middle and posterior cerebral arteries, the others corresponds to cerebral ventricles and subarachnoid space. This model enable to calculate the migration of tissue fluid from capillaries to gray matter and white matter, the flow of tissue fluid between compartments, the production and absorption of cerebrospinal fluid at choroid plexus and arachnoid granulation, and the production of metabolic water. Further, the volume, the colloid concentration, and the tissue pressure of/in each compartment are also calculable by solving 40-dimensional non-linear simultaneous differential equations. In this research, the obtained model was analyzed for its validation under the four condition of a normal adult, an adult with higher cerebral capillary pressure, an adult with lower cerebral capillary pressure, and an adult with lower colloid concentration in cerebral capillary. In the result, calculated fluid flow, tissue volume, colloid concentration, and tissue pressure were all converged to suitable value for the set condition within 60 minutes at a maximum. Also, because these results were not conflict with prior knowledge, it is certain that the model can enough represent physiological state of brain under such limited conditions at least. One of next challenges is to integrate this model and the already constructed cerebral blood circulation model. This modification enable to simulate CBF and ICP more precisely due to calculating the effect of blood pressure change to extracellular fluid migration and that of ICP change to CBF.

Keywords: dynamic model, cerebral extracellular migration, brain resuscitation, automatic control

Procedia PDF Downloads 147
10038 A New Optimization Algorithm for Operation of a Microgrid

Authors: Sirus Mohammadi, Rohala Moghimi

Abstract:

The main advantages of microgrids are high energy efficiency through the application of Combined Heat and Power (CHP), high quality and reliability of the delivered electric energy and environmental and economic advantages. This study presents an energy management system (EMS) to optimize the operation of the microgrid (MG). In this paper an Adaptive Modified Firefly Algorithm (AMFA) is presented for optimal operation of a typical MG with renewable energy sources (RESs) accompanied by a back-up Micro-Turbine/Fuel Cell/Battery hybrid power source to level the power mismatch or to store the energy surplus when it’s needed. The problem is formulated as a nonlinear constraint problem to minimize the total operating cost. The management of Energy storage system (ESS), economic load dispatch and operation optimization of distributed generation (DG) are simplified into a single-object optimization problem in the EMS. The proposed algorithm is tested on a typical grid-connected MG including WT/PV/Micro Turbine/Fuel Cell and Energy Storage Devices (ESDs) then its superior performance is compared with those from other evolutionary algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Fuzzy Self Adaptive PSO (FSAPSO), Chaotic Particle PSO (CPSO), Adaptive Modified PSO (AMPSO), and Firefly Algorithm (FA).

Keywords: microgrid, operation management, optimization, firefly algorithm (AMFA)

Procedia PDF Downloads 335