Search results for: weight comparison algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 11634

Search results for: weight comparison algorithm

11604 Co-Evolutionary Fruit Fly Optimization Algorithm and Firefly Algorithm for Solving Unconstrained Optimization Problems

Authors: R. M. Rizk-Allah

Abstract:

This paper presents co-evolutionary fruit fly optimization algorithm based on firefly algorithm (CFOA-FA) for solving unconstrained optimization problems. The proposed algorithm integrates the merits of fruit fly optimization algorithm (FOA), firefly algorithm (FA) and elite strategy to refine the performance of classical FOA. Moreover, co-evolutionary mechanism is performed by applying FA procedures to ensure the diversity of the swarm. Finally, the proposed algorithm CFOA- FA is tested on several benchmark problems from the usual literature and the numerical results have demonstrated the superiority of the proposed algorithm for finding the global optimal solution.

Keywords: firefly algorithm, fruit fly optimization algorithm, unconstrained optimization problems

Procedia PDF Downloads 504
11603 A Gene Selection Algorithm for Microarray Cancer Classification Using an Improved Particle Swarm Optimization

Authors: Arfan Ali Nagra, Tariq Shahzad, Meshal Alharbi, Khalid Masood Khan, Muhammad Mugees Asif, Taher M. Ghazal, Khmaies Ouahada

Abstract:

Gene selection is an essential step for the classification of microarray cancer data. Gene expression cancer data (DNA microarray) facilitates computing the robust and concurrent expression of various genes. Particle swarm optimization (PSO) requires simple operators and less number of parameters for tuning the model in gene selection. The selection of a prognostic gene with small redundancy is a great challenge for the researcher as there are a few complications in PSO based selection method. In this research, a new variant of PSO (Self-inertia weight adaptive PSO) has been proposed. In the proposed algorithm, SIW-APSO-ELM is explored to achieve gene selection prediction accuracies. This new algorithm balances the exploration capabilities of the improved inertia weight adaptive particle swarm optimization and the exploitation. The self-inertia weight adaptive particle swarm optimization (SIW-APSO) is used to search the solution. The SIW-APSO is updated with an evolutionary process in such a way that each particle iteratively improves its velocities and positions. The extreme learning machine (ELM) has been designed for the selection procedure. The proposed method has been to identify a number of genes in the cancer dataset. The classification algorithm contains ELM, K- centroid nearest neighbor (KCNN), and support vector machine (SVM) to attain high forecast accuracy as compared to the start-of-the-art methods on microarray cancer datasets that show the effectiveness of the proposed method.

Keywords: microarray cancer, improved PSO, ELM, SVM, evolutionary algorithms

Procedia PDF Downloads 52
11602 Changes in Some Biochemical Parameters and Body Weight of Chicken Exposed to Cadmium

Authors: Khaled Saeed Ali

Abstract:

This study was conducted with 3 week old domestic chicken to determine the effect of supplementation of cadmium to dietary. 10 mg/kg Cadmium chloride added to maize- sesame cake meal diet for 4 weeks. The additional cadmium to the diet induced a decreasing body weight and changes in biochemical parameters of chicken. Chicken were divided into two groups. The first group was given a diet containing the concentration of 10 mg cadmium /kg daily for a period of 30 days and the second group was given diet without cadmium and used as a control group. The result revealed decrease in the body weight of treated chicken by 12.7 % compared to control group, whose body weight increased. The plasma glucose concentration, creatinine, aspartate aminotranseferase (AST), and alanine aminotransferase (ALT) were increased significantly (P<0.05) in Cd treated chicken in comparison to the control group. Cadmium accumulation was observed in the intestine, kidney, liver and bone. The accumulation of cadmium was markedly higher (3-4 times) in cadmium-treated animals compared to the control.

Keywords: cadmium, biochemical parameters, body weight, chicken

Procedia PDF Downloads 436
11601 Secure Hashing Algorithm and Advance Encryption Algorithm in Cloud Computing

Authors: Jaimin Patel

Abstract:

Cloud computing is one of the most sharp and important movement in various computing technologies. It provides flexibility to users, cost effectiveness, location independence, easy maintenance, enables multitenancy, drastic performance improvements, and increased productivity. On the other hand, there are also major issues like security. Being a common server, security for a cloud is a major issue; it is important to provide security to protect user’s private data, and it is especially important in e-commerce and social networks. In this paper, encryption algorithms such as Advanced Encryption Standard algorithms, their vulnerabilities, risk of attacks, optimal time and complexity management and comparison with other algorithms based on software implementation is proposed. Encryption techniques to improve the performance of AES algorithms and to reduce risk management are given. Secure Hash Algorithms, their vulnerabilities, software implementations, risk of attacks and comparison with other hashing algorithms as well as the advantages and disadvantages between hashing techniques and encryption are given.

Keywords: Cloud computing, encryption algorithm, secure hashing algorithm, brute force attack, birthday attack, plaintext attack, man in middle attack

Procedia PDF Downloads 250
11600 Comparison of Chest Weight of Pure and Mixed Races Kabood 30-Day Squab

Authors: Sepehr Moradi, Mehdi Asadi Rad

Abstract:

The aim of this study is to evaluate and compare chest weight of pure and mixed races Kabood 30-day Pigeons to investigate about their sex, race, and some auxiliary variables. In this paper, 62 pieces of pigeons as 31 male and female pairs with equal age are studied randomly. A natural incubation was done from each pair. All produced chickens were slaughtered at 30 days age after 12 hours hunger. Then their chests were weighted by a scale with one gram precision. A covariance analysis was used since there were many auxiliary variables and unequal observations. SAS software was used for statistical analysis. Mean weight of chests in pure race (Kabood-Kabood) with 8 records, 123.8±32.3g and mixed races of Kabood-Namebar, Kabood-Parvazy, Kabood-Tizpar, Namebar-Kabood, Tizpar-Kabood, and Parvazi-Kabood with 8, 8, 6, 12, 10, and 10 records were 139.4±23.5, 7/122±23.8, 124.7±30.1, 50.3±29.3, 51.4±26.4, and 137±28.6 gr, respectively. Mean weight of 30-day chests in male and female sex were 87.3±2.5 and 82.7±2.6g, respectively. Difference chest weight of 30-day chests of Kabood-Kabood race with Kabood-Namebar, Kabood-Parvazi, Tizpar-Kabood, Kabood-Tizpar, Namebar-Kabood and Parvazi-Kabood mixed races was not significant. Effect of sex was also significant in 5% level (P<0.05), but mutual effect of sex and race was not significant. Auxiliary variable of father weight was significant in 1% level (p < 0.01), but auxiliary variable of mother weight was not significant. The results showed that most and least weights belonged to Kabood-Namebar and Namebar-Kabood.

Keywords: squab, Kabood race, 30-day chest weight, pigeons

Procedia PDF Downloads 128
11599 An Authentic Algorithm for Ciphering and Deciphering Called Latin Djokovic

Authors: Diogen Babuc

Abstract:

The question that is a motivation of writing is how many devote themselves to discovering something in the world of science where much is discerned and revealed, but at the same time, much is unknown. Methods: The insightful elements of this algorithm are the ciphering and deciphering algorithms of Playfair, Caesar, and Vigenère. Only a few of their main properties are taken and modified, with the aim of forming a specific functionality of the algorithm called Latin Djokovic. Specifically, a string is entered as input data. A key k is given, with a random value between the values a and b = a+3. The obtained value is stored in a variable with the aim of being constant during the run of the algorithm. In correlation to the given key, the string is divided into several groups of substrings, and each substring has a length of k characters. The next step involves encoding each substring from the list of existing substrings. Encoding is performed using the basis of Caesar algorithm, i.e., shifting with k characters. However, that k is incremented by 1 when moving to the next substring in that list. When the value of k becomes greater than b+1, it’ll return to its initial value. The algorithm is executed, following the same procedure, until the last substring in the list is traversed. Results: Using this polyalphabetic method, ciphering and deciphering of strings are achieved. The algorithm also works for a 100-character string. The x character isn’t used when the number of characters in a substring is incompatible with the expected length. The algorithm is simple to implement, but it’s questionable if it works better than the other methods from the point of view of execution time and storage space.

Keywords: ciphering, deciphering, authentic, algorithm, polyalphabetic cipher, random key, methods comparison

Procedia PDF Downloads 77
11598 Body Weight Variation in Indian Heterogeneous Group-An Analytical Study

Authors: A. K. Srivastva

Abstract:

Body weight is considered as an important factor in health and fitness. It is an index of one's health. Considering significance of body weight and its wider application in various fields in general and sports in particular, it is made a point of enquiry in the present study. The purpose of the study to observe over all weight pattern of Indian youths in the age group of 15 through 20 years. Total 7500 samples pooled from ten Indian states ranging in their age 15 to 20 years were examined in six age categories. Conclusion: 1. The period between 15 to 20 year of age is a growing period and that body weight is gained during this period. 2. Statewise difference is observed in body-weight during the period, which is significant. 3. PRG indicated by higher rate of weight gain varies from state to state. 4. Sportsman possess comparatively higer level of body-weight than other student of same age group. 5. Tribal youths show comparatively better status in their weight gain than the untrained uraban dwellers.

Keywords: PRG (period of rapid growth), HG (heterogeneous group), WP (weight pattern), MBW (mean body weight)

Procedia PDF Downloads 305
11597 A Hybrid Multi-Objective Firefly-Sine Cosine Algorithm for Multi-Objective Optimization Problem

Authors: Gaohuizi Guo, Ning Zhang

Abstract:

Firefly algorithm (FA) and Sine Cosine algorithm (SCA) are two very popular and advanced metaheuristic algorithms. However, these algorithms applied to multi-objective optimization problems have some shortcomings, respectively, such as premature convergence and limited exploration capability. Combining the privileges of FA and SCA while avoiding their deficiencies may improve the accuracy and efficiency of the algorithm. This paper proposes a hybridization of FA and SCA algorithms, named multi-objective firefly-sine cosine algorithm (MFA-SCA), to develop a more efficient meta-heuristic algorithm than FA and SCA.

Keywords: firefly algorithm, hybrid algorithm, multi-objective optimization, sine cosine algorithm

Procedia PDF Downloads 133
11596 Approximating Fixed Points by a Two-Step Iterative Algorithm

Authors: Safeer Hussain Khan

Abstract:

In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms.

Keywords: contractive-like operator, iterative algorithm, fixed point, strong convergence

Procedia PDF Downloads 515
11595 A Hybrid Pareto-Based Swarm Optimization Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problems

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a new hybrid particle swarm optimization algorithm is proposed for the multi-objective flexible job shop scheduling problem that is very important and hard combinatorial problem. The Pareto approach is used for solving the multi-objective problem. Several new local search heuristics are integrated into an algorithm based on the critical block concept to enhance the performance of the algorithm. The algorithm is compared with the recently published multi-objective algorithms based on benchmarks selected from the literature. Several metrics are used for quantifying performance and comparison of the achieved solutions. The algorithms are also compared based on the Weighting summation of objectives approach. The proposed algorithm can find the Pareto solutions more efficiently than the compared algorithms in less computational time.

Keywords: swarm-based optimization, local search, Pareto optimality, flexible job shop scheduling, multi-objective optimization

Procedia PDF Downloads 346
11594 Study of Adaptive Filtering Algorithms and the Equalization of Radio Mobile Channel

Authors: Said Elkassimi, Said Safi, B. Manaut

Abstract:

This paper presented a study of three algorithms, the equalization algorithm to equalize the transmission channel with ZF and MMSE criteria, application of channel Bran A, and adaptive filtering algorithms LMS and RLS to estimate the parameters of the equalizer filter, i.e. move to the channel estimation and therefore reflect the temporal variations of the channel, and reduce the error in the transmitted signal. So far the performance of the algorithm equalizer with ZF and MMSE criteria both in the case without noise, a comparison of performance of the LMS and RLS algorithm.

Keywords: adaptive filtering second equalizer, LMS, RLS Bran A, Proakis (B) MMSE, ZF

Procedia PDF Downloads 288
11593 Proposing an Algorithm to Cluster Ad Hoc Networks, Modulating Two Levels of Learning Automaton and Nodes Additive Weighting

Authors: Mohammad Rostami, Mohammad Reza Forghani, Elahe Neshat, Fatemeh Yaghoobi

Abstract:

An Ad Hoc network consists of wireless mobile equipment which connects to each other without any infrastructure, using connection equipment. The best way to form a hierarchical structure is clustering. Various methods of clustering can form more stable clusters according to nodes' mobility. In this research we propose an algorithm, which allocates some weight to nodes based on factors, i.e. link stability and power reduction rate. According to the allocated weight in the previous phase, the cellular learning automaton picks out in the second phase nodes which are candidates for being cluster head. In the third phase, learning automaton selects cluster head nodes, member nodes and forms the cluster. Thus, this automaton does the learning from the setting and can form optimized clusters in terms of power consumption and link stability. To simulate the proposed algorithm we have used omnet++4.2.2. Simulation results indicate that newly formed clusters have a longer lifetime than previous algorithms and decrease strongly network overload by reducing update rate.

Keywords: mobile Ad Hoc networks, clustering, learning automaton, cellular automaton, battery power

Procedia PDF Downloads 376
11592 Comparison of Parallel CUDA and OpenMP Implementations of Memetic Algorithms for Solving Optimization Problems

Authors: Jason Digalakis, John Cotronis

Abstract:

Memetic algorithms (MAs) are useful for solving optimization problems. It is quite difficult to search the search space of the optimization problem with large dimensions. There is a challenge to use all the cores of the system. In this study, a sequential implementation of the memetic algorithm is converted into a concurrent version, which is executed on the cores of both CPU and GPU. For this reason, CUDA and OpenMP libraries are operated on the parallel algorithm to make a concurrent execution on CPU and GPU, respectively. The aim of this study is to compare CPU and GPU implementation of the memetic algorithm. For this purpose, fourteen benchmark functions are selected as test problems. The obtained results indicate that our approach leads to speedups up to five thousand times higher compared to one CPU thread while maintaining a reasonable results quality. This clearly shows that GPUs have the potential to acceleration of MAs and allow them to solve much more complex tasks.

Keywords: memetic algorithm, CUDA, GPU-based memetic algorithm, open multi processing, multimodal functions, unimodal functions, non-linear optimization problems

Procedia PDF Downloads 52
11591 Nonuniformity Correction Technique in Infrared Video Using Feedback Recursive Least Square Algorithm

Authors: Flavio O. Torres, Maria J. Castilla, Rodrigo A. Augsburger, Pedro I. Cachana, Katherine S. Reyes

Abstract:

In this paper, we present a scene-based nonuniformity correction method using a modified recursive least square algorithm with a feedback system on the updates. The feedback is designed to remove impulsive noise contamination images produced by a recursive least square algorithm by measuring the output of the proposed algorithm. The key advantage of the method is based on its capacity to estimate detectors parameters and then compensate for impulsive noise contamination image in a frame by frame basics. We define the algorithm and present several experimental results to demonstrate the efficacy of the proposed method in comparison to several previously published recursive least square-based methods. We show that the proposed method removes impulsive noise contamination image.

Keywords: infrared focal plane arrays, infrared imaging, least mean square, nonuniformity correction

Procedia PDF Downloads 116
11590 Reduction of Impulsive Noise in OFDM System using Adaptive Algorithm

Authors: Alina Mirza, Sumrin M. Kabir, Shahzad A. Sheikh

Abstract:

The Orthogonal Frequency Division Multiplexing (OFDM) with high data rate, high spectral efficiency and its ability to mitigate the effects of multipath makes them most suitable in wireless application. Impulsive noise distorts the OFDM transmission and therefore methods must be investigated to suppress this noise. In this paper, a State Space Recursive Least Square (SSRLS) algorithm based adaptive impulsive noise suppressor for OFDM communication system is proposed. And a comparison with another adaptive algorithm is conducted. The state space model-dependent recursive parameters of proposed scheme enables to achieve steady state mean squared error (MSE), low bit error rate (BER), and faster convergence than that of some of existing algorithm.

Keywords: OFDM, impulsive noise, SSRLS, BER

Procedia PDF Downloads 429
11589 A New Approach to the Digital Implementation of Analog Controllers for a Power System Control

Authors: G. Shabib, Esam H. Abd-Elhameed, G. Magdy

Abstract:

In this paper, a comparison of discrete time PID, PSS controllers is presented through small signal stability of power system comprising of one machine connected to infinite bus system. This comparison achieved by using a new approach of discretization which converts the S-domain model of analog controllers to a Z-domain model to enhance the damping of a single machine power system. The new method utilizes the Plant Input Mapping (PIM) algorithm. The proposed algorithm is stable for any sampling rate, as well as it takes the closed loop characteristic into consideration. On the other hand, the traditional discretization methods such as Tustin’s method is produce satisfactory results only; when the sampling period is sufficiently low.

Keywords: PSS, power system stabilizer PID, proportional-integral-derivative PIM, plant input mapping

Procedia PDF Downloads 483
11588 An Algorithm to Compute the State Estimation of a Bilinear Dynamical Systems

Authors: Abdullah Eqal Al Mazrooei

Abstract:

In this paper, we introduce a mathematical algorithm which is used for estimating the states in the bilinear systems. This algorithm uses a special linearization of the second-order term by using the best available information about the state of the system. This technique makes our algorithm generalizes the well-known Kalman estimators. The system which is used here is of the bilinear class, the evolution of this model is linear-bilinear in the state of the system. Our algorithm can be used with linear and bilinear systems. We also here introduced a real application for the new algorithm to prove the feasibility and the efficiency for it.

Keywords: estimation algorithm, bilinear systems, Kakman filter, second order linearization

Procedia PDF Downloads 449
11587 A Modified NSGA-II Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

NSGA-II is one of the most well-known and most widely used evolutionary algorithms. In addition to its new versions, such as NSGA-III, there are several modified types of this algorithm in the literature. In this paper, a hybrid NSGA-II algorithm has been suggested for solving the multi-objective flexible job shop scheduling problem. For a better search, new neighborhood-based crossover and mutation operators are defined. To create new generations, the neighbors of the selected individuals by the tournament selection are constructed. Also, at the end of each iteration, before sorting, neighbors of a certain number of good solutions are derived, except for solutions protected by elitism. The neighbors are generated using a constraint-based neural network that uses various constructs. The non-dominated sorting and crowding distance operators are same as the classic NSGA-II. A comparison based on some multi-objective benchmarks from the literature shows the efficiency of the algorithm.

Keywords: flexible job shop scheduling problem, multi-objective optimization, NSGA-II algorithm, neighborhood structures

Procedia PDF Downloads 192
11586 Genetic Algorithm Optimization of the Economical, Ecological and Self-Consumption Impact of the Energy Production of a Single Building

Authors: Ludovic Favre, Thibaut M. Schafer, Jean-Luc Robyr, Elena-Lavinia Niederhäuser

Abstract:

This paper presents an optimization method based on genetic algorithm for the energy management inside buildings developed in the frame of the project Smart Living Lab (SLL) in Fribourg (Switzerland). This algorithm optimizes the interaction between renewable energy production, storage systems and energy consumers. In comparison with standard algorithms, the innovative aspect of this project is the extension of the smart regulation over three simultaneous criteria: the energy self-consumption, the decrease of greenhouse gas emissions and operating costs. The genetic algorithm approach was chosen due to the large quantity of optimization variables and the non-linearity of the optimization function. The optimization process includes also real time data of the building as well as weather forecast and users habits. This information is used by a physical model of the building energy resources to predict the future energy production and needs, to select the best energetic strategy, to combine production or storage of energy in order to guarantee the demand of electrical and thermal energy. The principle of operation of the algorithm as well as typical output example of the algorithm is presented.

Keywords: building's energy, control system, energy management, energy storage, genetic optimization algorithm, greenhouse gases, modelling, renewable energy

Procedia PDF Downloads 227
11585 The Effect of Nitrogen Fertilizer Use Efficiency in Corn Yield and Yield Components in Cultivars KSC 704

Authors: Elham Bagherzadeh, Mohammad Fadaee, Rouhollah Keykhosravi

Abstract:

In order to survey the nitrogen use efficiency in corn, the experimental plot in a randomized complete block design 2014 agricultural farm was Islamic Azad University of Karaj. The main factor was four levels of nitrogen fertilizer (respectively control, 150, 200 and 250 kg nitrogen fertilizer) and subplots consisted two levels of superabsorbent polymer Stockosorb (use, do not use). Analysis of variance is showed that different nitrogen levels and different superabsorbent of levels statistically significant. Comparisons average also showed there is a significant difference between use and non-use of superabsorbent. The results showed the interactions nitrogen and SAP by one percent level has a significant and effect on Fresh weight per plant, plant dry weight, biological yield, harvest index, cob diameter, cob dry weight, leaf width, leaf area were at the level of five percent statistical significant effect on Ear weight and grain yield.

Keywords: corn, nitrogen, comparison, biological yield

Procedia PDF Downloads 325
11584 Parameter Estimation of Induction Motors by PSO Algorithm

Authors: A. Mohammadi, S. Asghari, M. Aien, M. Rashidinejad

Abstract:

After emergent of alternative current networks and their popularity, asynchronous motors became more widespread than other kinds of industrial motors. In order to control and run these motors efficiently, an accurate estimation of motor parameters is needed. There are different methods to obtain these parameters such as rotor locked test, no load test, DC test, analytical methods, and so on. The most common drawback of these methods is their inaccuracy in estimation of some motor parameters. In order to remove this concern, a novel method for parameter estimation of induction motors using particle swarm optimization (PSO) algorithm is proposed. In the proposed method, transient state of motor is used for parameter estimation. Comparison of the simulation results purtuined to the PSO algorithm with other available methods justifies the effectiveness of the proposed method.

Keywords: induction motor, motor parameter estimation, PSO algorithm, analytical method

Procedia PDF Downloads 603
11583 Comparison of Carcass Weight of Pure and Mixed Races Namebar 30-Day Squabs

Authors: Sepehr Moradi, Mehdi Asadi Rad

Abstract:

The aim of this study is to evaluate and compare carcass weight of pure and mixed races Namebar 30-day pigeons to investigate about their sex, race, and some auxiliary variables. In this paper, 68 pieces of pigeons as 34 male and female pairs with equal age are studied randomly. A natural incubation was done from each pair. All produced chickens were slaughtered at 30 days age after 12 hours hunger. Then their carcasses were weighted by a scale with one gram precision. A covariance analysis was used since there were many auxiliary variables and unequal observations. SAS software was used for statistical analysis. Mean weight of carcass in pure race (Namebar-Namebar) with 8 records, 219.5±61.3 gr and mixed races of Kabood-Namebar, Parvazy-Namebar, Tizpar-Namebar, Namebar-Kabood, Namebar-Tizpar, and Namebar-Parvazy with 8, 10, 8, 12, 12, and 10 records were 369.9±54.6, 338.3±52.7, 224.5±73.6, 142.3±67.8, 155.6±56.2, and 170.2±55 gr, respectively.. Difference carcass weight of 30-day of Namebar-Namebar race with Namebar-Kabood, Namebar-Parvazy, Namebar-Tizpar, Parvazy-Namebar and Tizpar-Namebar mixed races was not significant, and was significant in level 5% with Kabood- Namebar (P < 0.05). Effect of sex and age were also significant in 1% level (P < 0.01), but mutual effect of sex and race was not significant. The results showed that most and least weights of carcass belonged to Kabood-Namebar and Namebar-Kabood.

Keywords: squab, Namebar race, 30-day carcass weight, pigeons

Procedia PDF Downloads 157
11582 Weight Gain After Total Thyroidectomy

Authors: Yong Seong Kim, Seongbin Hong, So Hun Kim, Moonsuk Nam

Abstract:

Background: Patients who undergo thyroidectomy due to thyroid cancer often complain weight gain, although they are on suppressive thyroid hormone treatment. The aim of this study is to know whether thyroid cancer patients gain the weight after thyroidectomy and weight change is dependent on estrogen state or use of rhTSH. Material and Method: We performed a retrospective chart review of subjects receiving medical care at an academic medical center. Two hundred two patients who underwent total thyroidectomy were included. As a control group, patients with thyroid nodule and euthyroidism were matched for age, gender, menopausal status. The weight changes occurring over first one year and thyroid function were assessed. Results: Mean age was 51±12 years and patients was composed with 38% of premenopausal, 15 % perimenopausal women, 37% of postmenopausal women and 20% of men. Patients with thyroid cancer gained 2.2 kg during the first year. It’ was not significantly different with control. However, weigh change in perimenopausal and post menopausal women gained more weight than control (P <0.05). Age, baseline body weight and weight gain were not correlated. Discussion: Patient who had undergone thyroidectomy gained more weight than their control, especially in peri- and postmenopausal women. Patients in this age should be monitored for their weight carefully.

Keywords: weight gain, thyroidectomy, thyroid cancer, weight chance

Procedia PDF Downloads 386
11581 The Effect of Rowing Exercise on Elderly Health

Authors: Rachnavy Pornthep, Khaothin Thawichai

Abstract:

The purpose of this paper was to investigate the effects of rowing ergometer exercise on older persons health. The subjects were divided into two groups. Group 1 was control group (10 male and 10 female) Group 2 was experimental group (10 male and 10 female). The time for study was 12 week. Group 1 engage in normal daily activities Group 2 Training with rowing machine for 20 minutes three days a week. The average age of the experimental group was 73.7 years old, mean weight 55.4 kg, height 154.8 cm in the control group, mean age was 74.95 years, mean weight 48.6 kg, mean height 153.85 cm. Physical fitness test composted of body size, flexibility, Strength, muscle endurance and cardiovascular endurance. The comparison between the experimental and control groups before training showed that body weight, body mass index and waist to hip ratio were significantly different. The flexibility, strength, cardiovascular endurance was not significantly different. The comparison between the control group and the experimental group after training showed that body weight, body mass index and cardiovascular endurance were significantly different. The ratio of waist to hips, flexibility and muscular strength were not significantly different. Comparison of physical fitness before training and after training of the control group showed that body weight, flexibility (Sit and reach) and muscular strength (30 – Second chair stand) were significantly different. Body mass index, waist to hip ratio, muscles flexible (Shoulder girdle flexibility), muscle strength (30 – Second arm curl) and the cardiovascular endurance were not significantly difference. Comparison of physical fitness before training and after training the experimental group showed that waist to hip ratio, flexibility (sit and reach) muscle strength (30 – Second chair stand), cardiovascular endurance (Standing leg raises - up to 2 minutes) were significantly different. The Body mass index and the flexibility (Shoulder girdle flexibility) no significantly difference. The study found that exercising with rowing machine can improve the physical fitness of the elderly, especially the cardiovascular endurance, corresponding with the past research on the effects of exercise in the elderly with different exercise such as cycling, treadmill, walking on the elliptical machine. Therefore, we can conclude that exercise by using rowing machine can improve cardiovascular system and flexibility in the elderly.

Keywords: effect, rowing, exercise, elderly

Procedia PDF Downloads 466
11580 Genetics of Birth and Weaning Weight of Holstein, Friesians in Sudan

Authors: Safa A. Mohammed Ali, Ammar S. Ahamed, Mohammed Khair Abdalla

Abstract:

The objectives of this study were to estimate the means and genetic parameters of birth and weaning weight of calves of pure Holstein-Friesian cows raised in Sudan. The traits studied were:*Weight at birth *Weight at weaning. The study also included some of the important factors that affected these traits. The data were analyzed using Harvey’s Least Squares and Maximum Likelihood programme. The results obtained showed that the overall mean weight at birth of the calves under study was 34.36±0.94kg. Male calves were found to be heavier than females; the difference between the sexes was highly significant (P<0.001). The mean weight at birth of male calves was 34.27±1.17 kg while that of females was 32.51±1.14kg. The effect of sex of calves, sire and parity of dam were highly significant (P<0.001). The overall mean of weight at weaning was 67.10 ± 5.05 kg, weight at weaning was significantly (p<0.001) effected by sex of calves, sire, year and season of birth have highly significant (P<0.001) effect on either trait. Also estimates heritabilities of birth weight was (0.033±0.015) lower than heritabilities of weaning weight (0.224±0.039), and genetic correlation was 0.563, the phenotypic correlation 0.281, and the environmental correlation 0.268.

Keywords: birth, weaning, weight, friesian

Procedia PDF Downloads 627
11579 A Hybrid Algorithm for Collaborative Transportation Planning among Carriers

Authors: Elham Jelodari Mamaghani, Christian Prins, Haoxun Chen

Abstract:

In this paper, there is concentration on collaborative transportation planning (CTP) among multiple carriers with pickup and delivery requests and time windows. This problem is a vehicle routing problem with constraints from standard vehicle routing problems and new constraints from a real-world application. In the problem, each carrier has a finite number of vehicles, and each request is a pickup and delivery request with time window. Moreover, each carrier has reserved requests, which must be served by itself, whereas its exchangeable requests can be outsourced to and served by other carriers. This collaboration among carriers can help them to reduce total transportation costs. A mixed integer programming model is proposed to the problem. To solve the model, a hybrid algorithm that combines Genetic Algorithm and Simulated Annealing (GASA) is proposed. This algorithm takes advantages of GASA at the same time. After tuning the parameters of the algorithm with the Taguchi method, the experiments are conducted and experimental results are provided for the hybrid algorithm. The results are compared with those obtained by a commercial solver. The comparison indicates that the GASA significantly outperforms the commercial solver.

Keywords: centralized collaborative transportation, collaborative transportation with pickup and delivery, collaborative transportation with time windows, hybrid algorithm of GA and SA

Procedia PDF Downloads 362
11578 Design an Algorithm for Software Development in CBSE Envrionment Using Feed Forward Neural Network

Authors: Amit Verma, Pardeep Kaur

Abstract:

In software development organizations, Component based Software engineering (CBSE) is emerging paradigm for software development and gained wide acceptance as it often results in increase quality of software product within development time and budget. In component reusability, main challenges are the right component identification from large repositories at right time. The major objective of this work is to provide efficient algorithm for storage and effective retrieval of components using neural network and parameters based on user choice through clustering. This research paper aims to propose an algorithm that provides error free and automatic process (for retrieval of the components) while reuse of the component. In this algorithm, keywords (or components) are extracted from software document, after by applying k mean clustering algorithm. Then weights assigned to those keywords based on their frequency and after assigning weights, ANN predicts whether correct weight is assigned to keywords (or components) or not, otherwise it back propagates in to initial step (re-assign the weights). In last, store those all keywords into repositories for effective retrieval. Proposed algorithm is very effective in the error correction and detection with user base choice while choice of component for reusability for efficient retrieval is there.

Keywords: component based development, clustering, back propagation algorithm, keyword based retrieval

Procedia PDF Downloads 357
11577 Performance Comparison of Prim’s and Ant Colony Optimization Algorithm to Select Shortest Path in Case of Link Failure

Authors: Rimmy Yadav, Avtar Singh

Abstract:

—Ant Colony Optimization (ACO) is a promising modern approach to the unused combinatorial optimization. Here ACO is applied to finding the shortest during communication link failure. In this paper, the performances of the prim’s and ACO algorithm are made. By comparing the time complexity and program execution time as set of parameters, we demonstrate the pleasant performance of ACO in finding excellent solution to finding shortest path during communication link failure.

Keywords: ant colony optimization, link failure, prim’s algorithm, shortest path

Procedia PDF Downloads 365
11576 Comparison of Live Weight of Pure and Mixed Races Tizpar 30-Day Squabs

Authors: Sepehr Moradi, Mehdi Asadi Rad

Abstract:

The aim of this study is to evaluate and compare live weight of pure and mixed races Tizpar 30-day pigeons to investigate about their sex, race, and some auxiliary variables. In this paper, 70 pieces of pigeons as 35 male and female pairs with equal age are studied randomly. A natural incubation was done from each pair. All produced chickens were weighted at 30 days age before and after hunger by a scale with one gram precision. A covariance analysis was used since there were many auxiliary variables and unequal observations. SAS software was used for statistical analysis. Mean weight of live in pure race (Tizpar-Tizpar) with 12 records, 182.3±60.9 gr and mixed races of Tizpar-Kabood, Tizpar-Parvazy, Tizpar-Namebar, Kabood-Tizpar, Namebar-Tizpar, and Parvazy-Tizpar with 10, 10, 8, 6, 12, and 12 records were 114.3±71.6, 210.6±71.7, 353.2±86, 520.8±81.5, 288.3±65.6, and 382.6±70.4 gr, respectively. Effects of sex, race and some auxiliary variables were also significant in 1% level (P < 0.01). Difference live weight of 30-day of Tizpar-Tizpar race with Tizpar-Namebar and Parvazi-Tizpar mixed races was significant in 5% level (P < 0.05) and with Kabood-Tizpar mixed races was significant in 1% level (P < 0.01) but with Tizpar-Kabood, Nmaebar-Tizpar and Tizpar-Parvazy mixed races was not significant. The results showed that most and least weights of live belonged to Kabood-Tizpar and Tizpar-Kabood.

Keywords: squabs, Tizpar race, 30-day live weight, pigeons

Procedia PDF Downloads 149
11575 A Weighted K-Medoids Clustering Algorithm for Effective Stability in Vehicular Ad Hoc Networks

Authors: Rejab Hajlaoui, Tarek Moulahi, Hervé Guyennet

Abstract:

In a highway scenario, the vehicle speed can exceed 120 kmph. Therefore, any vehicle can enter or leave the network within a very short time. This mobility adversely affects the network connectivity and decreases the life time of all established links. To ensure an effective stability in vehicular ad hoc networks with minimum broadcasting storm, we have developed a weighted algorithm based on the k-medoids clustering algorithm (WKCA). Indeed, the number of clusters and the initial cluster heads will not be selected randomly as usual, but considering the available transmission range and the environment size. Then, to ensure optimal assignment of nodes to clusters in both k-medoids phases, the combined weight of any node will be computed according to additional metrics including direction, relative speed and proximity. Empirical results prove that in addition to the convergence speed that characterizes the k-medoids algorithm, our proposed model performs well both AODV-Clustering and OLSR-Clustering protocols under different densities and velocities in term of end-to-end delay, packet delivery ratio, and throughput.

Keywords: communication, clustering algorithm, k-medoids, sensor, vehicular ad hoc network

Procedia PDF Downloads 202