Search results for: weight comparison algorithm

Authors: Abdullah Eqal Al Mazrooei

Abstract:

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

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

Procedia PDF Downloads 347

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

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

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

Procedia PDF Downloads 680

Authors: Alireza Lavaei, Alireza Lohrasbi, Mohammadali M. Shahlaei

Abstract:

To reduce the overall time of structural optimization for earthquake loads two strategies are adopted. In the first strategy, a neural system consisting self-organizing map and radial basis function neural networks, is utilized to predict the time history responses. In this case, the input space is classified by employing a self-organizing map neural network. Then a distinct RBF neural network is trained in each class. In the second strategy, an improved genetic algorithm is employed to find the optimum design. A 72-bar space truss is designed for optimal weight using exact and approximate analysis for the El Centro (S-E 1940) earthquake loading. The numerical results demonstrate the computational advantages and effectiveness of the proposed method.

Keywords: optimization, genetic algorithm, neural networks, self-organizing map

Procedia PDF Downloads 272

Authors: Lamiche Chaabane

Abstract:

In this study, a new method for solving sequence alignment problem is proposed, which is named ITS (Improved Tabu Search). This algorithm is based on the classical Tabu Search (TS). ITS is implemented in order to obtain results of multiple sequence alignment. Several ideas concerning neighbourhood generation, move selection mechanisms and intensification/diversification strategies for our proposed ITS is investigated. ITS have generated high-quality results in terms of measure of scores in comparison with the classical TS and simple iterative search algorithm.

Keywords: multiple sequence alignment, tabu search, improved tabu search, neighbourhood generation, selection mechanisms

Procedia PDF Downloads 269

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

Abstract:

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

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

Procedia PDF Downloads 534

Authors: Muhammad Naeem, Amina Zubari, Abdus Salam, Syed Ali Ayub Bukhari, Naveed Ahmad Khan

Abstract:

Seventy three wild Labeo bata of different body sizes, ranging from 8.20-16.00 cm total length and 7.4-86.19 g body weight, were studied for the analysis of body composition parameters (Water content, ash content, fat content, protein content) in relation to body size and condition factor. Mean percentage is found as for water 77.71 %, ash 3.42 %, fat 2.20 % and protein content 16.65 % in whole wet body weight. Highly significant positive correlations were observed between condition factor and body weight (r = 0.243). Protein contents, organic content and ash (% wet body weight) increase with increasing percent water contents for Labeo bata while these constituents (% dry body weight) and fat contents (% wet and dry body weight) have no influence on percent water. It was observed that variations in the body constituents have no association to body weight or length.

Keywords: Labeo bata, body size, body composition, condition factor

Procedia PDF Downloads 461

Authors: Malika Yaici, Assia Arab, Betitra Yakouben, Samia Zermani

Abstract:

Ubiquitous computing is nowadays a reality through the networking of a growing number of computing devices. It allows providing users with context aware information and services in a heterogeneous environment, anywhere and anytime. Selection of the best context-aware service, between many available services and providers, is a tedious problem. In this paper, a service selection method based on Constraint Satisfaction Problem (CSP) formalism is proposed. The services are considered as variables and domains; and the user context, preferences and providers characteristics are considered as constraints. The Backtrack algorithm is used to solve the problem to find the best service and provider which matches the user requirements. Even though this algorithm has an exponential complexity, but its use guarantees that the service, that best matches the user requirements, will be found. A comparison of the proposed method with the existing solutions finishes the paper.

Keywords: ubiquitous computing, services selection, constraint satisfaction problem, backtrack algorithm

Procedia PDF Downloads 207

Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam

Abstract:

Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FP-growth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.

Keywords: association rules, FP-growth, multiple minimum supports, Weka tool

Procedia PDF Downloads 449

Authors: Li Dan, Zhao Junsuo, Zhang Wenjun

Abstract:

Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm.

Keywords: quantum genetic algorithm, many worlds, quantum training operator, combinatorial optimization operator

Procedia PDF Downloads 707

Authors: M. I. Oshimagye, V. O. Ayuba, P. A. Annune

Abstract:

The effect of Sublethal Concentrations of Parkia biglobosa pod extract on the growth and survival of Clarias gariepinus juveniles (mean weight 32.73g ± 0.0) were investigated under laboratory conditions for 8 weeks using the static renewal and continuous aeration system. Statistical analysis showed that fish exposed to various concentrations had significantly lower (P<0.05) growth rate than the control groups. The reduction in growth was observed to be directly proportional to increase in concentration. However, at 50 mg/L no significant depression in weight was observed.

Keywords: Clarias gariepinus, Parkia biglobosa, pod, weight

Procedia PDF Downloads 458

Authors: Deepak Kumar, Debasish Deb, Reena Mamgain

Abstract:

Radar signal processing requires high number crunching capability. Most often this is achieved using multiprocessor platform. Though multiprocessor platform provides the capability of meeting the real time computational challenges, the architecture of the same along with mapping of the algorithm on the architecture plays a vital role in efficiently using the platform. Towards this, along with standard performance metrics, few additional metrics are defined which helps in evaluating the multiprocessor platform along with the algorithm mapping. A generic multiprocessor architecture can not suit all the processing requirements. Depending on the system requirement and type of algorithms used, the most suitable architecture for the given problem is decided. In the paper, we study different architectures and quantify the different performance metrics which enables comparison of different architectures for their merit. We also carried out case study of different architectures and their efficiency depending on parallelism exploited on algorithm or data or both.

Keywords: radar signal processing, multiprocessor architecture, efficiency, load imbalance, buffer requirement, pipeline, parallel, hybrid, cluster of processors (COPs)

Procedia PDF Downloads 379

Authors: Isabella Lobo Sasaoka, Felipe Q. da Luz, Zubeyir Salis, Phillipa Hay, Tamiris Gaeta, Paula Costa Teixeira, Táki Cordás, Amanda Sainsbury

Abstract:

Background: A significant number of people with obesity that seek weight loss treatments experience binge eating episodes. Nonetheless, it is unknown whether binge eating episodes can hinder weight loss outcomes. Objective: To compare weight change in people with or without binge eating submitted to bariatric surgery, pharmacotherapy, nutritional orientation, and/or psychological therapies. Method: We conducted a systematic review with meta-analyses by searching studies in PubMed, American Psychological Association (APA), and Embase. Results: Thirty-four studies were included in our systematic review, and 17 studies were included in the meta-analyses. Overall, we found no significant difference in weight loss between people with or without binge eating submitted to any type of weight loss treatment. Additionally, we found no statistically significant differences in body weight between people with or without binge eating at short and long follow-up assessments following any type of weight loss treatment. We also examined changes in body weight in people with or without binge eating in three additional meta-analyses categorized by the type of weight loss treatment (i.e., behavioural and/or nutritional interventions; bariatric surgery; pharmacotherapy isolated or combined with behavior interventions) and found no difference in weight loss. Eleven out of the 17 studies that were assessed qualitatively (i.e., not included in meta-analyses) did not show differences in weight loss in people with or without binge eating submitted to any type of weight loss treatment. Conclusion: This systematic review with meta-analyses showed no difference in weight loss in people with or without binge eating submitted to a variety of weight loss treatments. Nonetheless, specialized therapies can be required to address eating disorder psychopathology and recurrent binge eating in people with obesity that seek weight loss.

Keywords: obesity, binge eating, weight loss, systematic review, meta-analysis

Procedia PDF Downloads 121

Authors: Mehmet Celik, Celal Erbas, Mehtap Baykal, Aygül Kucukgulmez, Mahmut Ali Gokce, Bilge Kaan Tekelioglu

Abstract:

In this study, determination of differences in fresh meat yield and proximate compositions of different weight groups of sea bream and sea bass grown in cages in Izmir region of the Aegean Sea were aimed. For this purpose, the length and weight of five different weight groups of sea bass (I: 175.8±5.2, II: 227.3±10.2, III: 293.3±21.3, IV: 404±9.9, V: 508.7±46 g) and sea bream (I: 146.6±13.6, II: 239.8±21.7, III: 279.2±20.8, IV: 400.9±10.5, V: 546.8±0.8 g) were measured and the amount of edible and non-edible parts were determined. Besides this, protein, lipid, dry matter, ash, condition factor, HSI and VSI values were compared according to different weight groups for each species. According to the results of analysis, while the absolute meat yields of sea bream was between 69-294 g, it was between 71-252 g for the sea bass and the highest meat yields were found in fifth (V) weight groups of fish for both species. The relative meat yield (%) was determined in weight group II for sea bass and in the IV. group in sea bream with 51.9%. However, the amount of muscle tissue lipids in I. and V. weight groups of sea bream ranged between 3.6 to 11.9 % and ranged between 6.2 to 9.0 % for sea bass respectively. Protein, fillet and ash content increased in direct proportion to the weight. As a result, it can be speculated that when the meat yield and lipid rates were considered, IV. group in sea bream and II. group in sea bass are the most advantageous groups for the consumers. Acknowledgement: This work was supported by the Scientific Research Project Unit of the University of Cukurova, Turkey under grant no FBA-2015-3830.

Keywords: sea bream, sea bass, meat yield, proximate composition, different weight

Procedia PDF Downloads 314

Authors: Nhat-To Huynh, Chen-Fu Chien

Abstract:

Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.

Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing

Procedia PDF Downloads 273

Authors: KumarShashvat, ArshpreetKaur, RajeshKumar, Raman Chadha

Abstract:

Wireless sensor networks have principal characteristic of having restricted energy and with limitation that energy of the nodes cannot be replenished. To increase the lifetime in this scenario WSN route for data transmission is opted such that utilization of energy along the selected route is negligible. For this energy efficient network, dandy infrastructure is needed because it impinges the network lifespan. Clustering is a technique in which nodes are grouped into disjoints and non–overlapping sets. In this technique data is collected at the cluster head. In this paper, Adaptive-PSO algorithm is proposed which forms energy aware clusters by minimizing the cost of locating the cluster head. The main concern is of the suitability of the swarms by adjusting the learning parameters of PSO. Particle Swarm Optimization converges quickly at the beginning stage of the search but during the course of time, it becomes stable and may be trapped in local optima. In suggested network model swarms are given the intelligence of the spiders which makes them capable enough to avoid earlier convergence and also help them to escape from the local optima. Comparison analysis with traditional PSO shows that new algorithm considerably enhances the performance where multi-dimensional functions are taken into consideration.

Keywords: Particle Swarm Optimization, adaptive – PSO, comparison between PSO and A-PSO, energy efficient clustering

Procedia PDF Downloads 220

Authors: Younghyun Jeon, Seungjoo Maeng

Abstract:

In the Ad-hoc network, the great interests regarding MIMO scheme leads to their combination, which is also utilized into its applicable network. We manage the field of the problem into Reverse-link MIMO Ad-hoc Network (RMAN) and propose the methodology to maximize the data rate with its power consumption using Node-Cooperative beamforming technique. Based on the result of mathematical optimization formulation, we design the algorithm to construct optimal orthogonal weight vector according to channel feedback and control its transmission power according to QoS-pricing value level. In simulation results, we show the validity of the proposed mathematical optimization result and algorithm which mean that the sum-rate of each link is converged into some point.

Keywords: ad-hoc network, MIMO, cooperative beamforming, transmit power

Procedia PDF Downloads 361

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 502

Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran

Abstract:

GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.

Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm

Procedia PDF Downloads 91

Authors: Muhammad Naeem, Abdus Salam, Sumera Yasmin, Abir Ishtiaq

Abstract:

In the present study, eighty-three wild Oreochromis aureus of different body size ranging 5.3-14.6 cm in total length were collected from the River Chenab, District Muzzafer Garh, Pakistan to investigate the parameters of length –weight, length-length relationships and condition factor in relation to size. Each fish was measured and weighed on arrival at laboratory. Log transformed regressions were used to test the allometric growth. Length-weight relationship was found highly significant (r = 0.964; P < 0.01). The values of exponent “ b” in Length–weight regression (W=aL^b), deviated from 3, showing isometric growth (b = 2.75). Results for LLRs indicated that these are highly correlated (P < 0.001). Condition factor (K) found constant with increasing body weight, however, showed negative influence with increasing total length.

Keywords: lenght-weight, Oreochromis aureus, morphometric study

Procedia PDF Downloads 401

Authors: M. Fernanda Salgado, Alfonso Tierra, Wilbert Aguilar

Abstract:

The present project consists in applying the informed search algorithm A star (A*) to solve traveler problems, applying it by urban public transportation routes. The digitization of the information allowed to identify 26% of the total of routes that are registered within the Metropolitan District of Quito. For the validation of this information, data were taken in field on the travel times and the difference with respect to the times estimated by the program, resulting in that the difference between them was not greater than 2:20 minutes. We validate A* algorithm with the Dijkstra algorithm, comparing nodes vectors based on the public transport stops, the validation was established through the student t-test hypothesis. Then we verified that the times estimated by the program using the A* algorithm are similar to those registered on field. Furthermore, we review the performance of the algorithm generating iterations in both algorithms. Finally, with these iterations, a hypothesis test was carried out again with student t-test where it was concluded that the iterations of the base algorithm Dijsktra are greater than those generated by the algorithm A*.

Keywords: algorithm A*, graph, mobility, public transport, travel planning, routes

Procedia PDF Downloads 209

Authors: Mahdi Fakoor, Seyed Mohammad Navid Ghoreishi

Abstract:

Composite patching is a common way for reinforcing the cracked pipes and cylinders. The effects of composite patch reinforcement on fracture parameters of a cracked pipe depend on a variety of parameters such as number of layers, angle, thickness, and material of each layer. Therefore, stacking sequence optimization of composite patch becomes crucial for the applications of cracked pipes. In this study, in order to obtain the optimal stacking sequence for a composite patch that has minimum weight and maximum resistance in propagation of cracks, a coupled Multi-Objective Genetic Algorithm (MOGA) and Finite Element Method (FEM) process is proposed. This optimization process has done for longitudinal and transverse semi-elliptical cracks and optimal stacking sequences and Pareto’s front for each kind of cracks are presented. The proposed algorithm is validated against collected results from the existing literature.

Keywords: multi objective optimization, pareto front, composite patch, cracked pipe

Procedia PDF Downloads 287

Authors: A. A. Ahmadi, A. R. Pishevar, M. Nili

Abstract:

As the test gas in a gun tunnel is non-isentropically compressed and heated by a light weight piston. Here, first consideration is the optimum piston weight. Although various aspects of the influence of piston weight on gun tunnel performance have been studied, it is not possible to decide from the existing literature what piston weight is required for optimum performance in various conditions. The technique whereby the piston is rapidly brought to rest at the end of the gun tunnel barrel, and the resulted peak pressure is equal in magnitude to the final equilibrium pressure, is called the equilibrium piston technique. The equilibrium piston technique was developed to estimate the equilibrium piston mass; but this technique cannot give an appropriate estimate for the optimum piston weight. In the present work, a gun tunnel with diameter of 3 in. is described and its performance is investigated numerically to obtain the effect of piston and its weight. Numerical results in the present work are in very good agreement with experimental results. Significant influence of the existence of a piston is shown by comparing the gun tunnel results with results of a conventional shock tunnel in the same dimension and same initial condition. In gun tunnel, an increase of around 250% in running time is gained relative to shock tunnel. Also, Numerical results show that equilibrium piston technique is not a good way to estimate suitable piston weight and there will be a lighter piston which can increase running time of the gun tunnel around 60%.

Keywords: gun tunnel, hypersonic flow, piston, shock tunnel

Procedia PDF Downloads 347

Authors: Oveis Abedinia, Noradin Ghadimi, Nasser Mikaeilvand, Roza Poursoleiman, Asghar Poorfaraj

Abstract:

In this paper a robust Fuzzy Proportional Integral Differential (PID) controller is applied to multi-machine power system based on Modified Shuffled Frog Leaping (MSFL) algorithm. This newly proposed controller is more efficient because it copes with oscillations and different operating points. In this strategy the gains of the PID controller is optimized using the proposed technique. The nonlinear problem is formulated as an optimization problem for wide ranges of operating conditions using the MSFL algorithm. The simulation results demonstrate the effectiveness, good robustness and validity of the proposed method through some performance indices such as ITAE and FD under wide ranges operating conditions in comparison with TS and GSA techniques. The single-machine infinite bus system and New England 10-unit 39-bus standard power system are employed to illustrate the performance of the proposed method.

Keywords: fuzzy PID, MSFL, multi-machine, low frequency oscillation

Procedia PDF Downloads 398

Authors: Daliyah S. Aljutaili, Redna A. Almutlaq, Suha A. Alharbi, Dina M. Ibrahim

Abstract:

All currencies around the world look very different from each other. For instance, the size, color, and pattern of the paper are different. With the development of modern banking services, automatic methods for paper currency recognition become important in many applications like vending machines. One of the currency recognition architecture’s phases is Feature detection and description. There are many algorithms that are used for this phase, but they still have some disadvantages. This paper proposes a feature detection algorithm, which merges the advantages given in the current SIFT and SURF algorithms, which we call, Speeded up Robust Scale-Invariant Feature Transform (SR-SIFT) algorithm. Our proposed SR-SIFT algorithm overcomes the problems of both the SIFT and SURF algorithms. The proposed algorithm aims to speed up the SIFT feature detection algorithm and keep it robust. Simulation results demonstrate that the proposed SR-SIFT algorithm decreases the average response time, especially in small and minimum number of best key points, increases the distribution of the number of best key points on the surface of the currency. Furthermore, the proposed algorithm increases the accuracy of the true best point distribution inside the currency edge than the other two algorithms.

Keywords: currency recognition, feature detection and description, SIFT algorithm, SURF algorithm, speeded up and robust features

Procedia PDF Downloads 208

Authors: P. Shrivastava, A. Shukla, K. Verma, S. Rungta

Abstract:

Parkinson's disease is a chronic neurological disorder that directly affects human gait. It leads to slowness of movement, causes muscle rigidity and tremors. Gait serve as a primary outcome measure for studies aiming at early recognition of disease. Using gait techniques, this paper implements efficient binary bat algorithm for an early detection of Parkinson's disease by selecting optimal features required for classification of affected patients from others. The data of 166 people, both fit and affected is collected and optimal feature selection is done using PSO and Bat algorithm. The reduced dataset is then classified using neural network. The experiments indicate that binary bat algorithm outperforms traditional PSO and genetic algorithm and gives a fairly good recognition rate even with the reduced dataset.

Keywords: parkinson, gait, feature selection, bat algorithm

Procedia PDF Downloads 512

Authors: Boumesbah Asma, Chergui Mohamed El-amine

Abstract:

Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient.

Keywords: minimum spanning tree, multiple objective linear optimization, combinatorial optimization, non-sorting genetic algorithm, variable neighborhood search

Procedia PDF Downloads 64

Authors: El Hassan Abba, Touria Hachi, Mhamed Khaffou, Nezha El Adel, Abdelkhalek Zraouti, Hassan ElIdrissi

Abstract:

The present study has the overall objective of studying the effect of garlic and Argan oil on the growth of Rainbow trout (Oncorhynchus mykiss) fingerlings at the Ras El Ma (Azrou) salmon farming station during the 2023 production period. The fingerlings were distributed in seven tanks at a rate of 1000 per lot. The first control tank (B0) received only the feed without additives. Tanks B1, B2, B3, and B4 received garlic as a feed additive at a rate of 1%, 1.5%, 2% and 2.5% respectively. The fingerlings in tanks B5 and B6, in addition to 2.5% garlic, received 5 and 10ml argon oil, respectively. During this two-month experiment, the weight growth of the fingerlings and the physico-chemical parameters of the water that are favorable for fry rearing (hydrogen potential, temperature, dissolved oxygen, and electrical conductivity) were monitored. The weight growth of fingerlings receiving garlic was positive (mean weight: 4.95g, 5.43g, 5.13g, and 5.06g) compared with control fingerlings (mean weight: 3.88g). The maximum average weight was obtained with 1.5% garlic (average weight: 5.43g). The addition of 5 and 10ml of argon oil to B5 and B6 resulted in a slight increase in weight for the B5 fingerlings (5.37g) compared with the B4 control fingerlings (mean weight: 5.06g) but a minor decrease for the B6 batch (4.73g). The experimental results showed that the use of these feed additives had a positive effect on growth and yield, regardless of the quantities used.

Keywords: Oncorhychus mykiss, fry, feed additive, garlic, argon oil, weight growth

Procedia PDF Downloads 47

Authors: Farzad Shidfar, Najmeh Rostami, Ziaodin Mazhari, Fatemeh Hosseini Baharanchi

Abstract:

Background and Aim: The rate of failure to maintain a reduced weight has been increased. By definition, people who regain about one-third to two-thirds of their lost weight after one year from the end of the dietary treatment and return all the lost weight after 5 years it is called weight regain. This study was performed to find the causes of weight regain and its relationship with biochemical and psychological factors. Materials and Methods: This cross-sectional study was performed by reviewing the files of people who followed the dietary treatment in 1397-1398.seventy-three persons was in the weight regain group, and seventy-three people were in the weight maintenance group. Psychological factors such as depression, anxiety, quality of life, physical activity, and dietary frequency were assessed through a questionnaire, and biochemical factors such as serum insulin and fasting blood sugar were measured. The mean basal energy in the weight regain group was significantly higher than the weight maintenance group (p = 0.004). There was no significant difference between the two groups in terms of food intake and inflammatory index of food. There was no significant difference between the two groups in terms of food intake and inflammatory index of food. Mean serum insulin concentration (p = 0.023), mean fasting blood sugar (p = 0.04) and insulin resistance (p = 0.013) in the weight regain group were higher than the weight maintenance group. The weight maintenance group showed higher insulin sensitivity than the weight regain group (p = 0.005). There was no significant difference between the two groups in terms of psychological indicators. Conclusion: The only body mass index after one year from the end of the treatment period, insulin sensitivity, serum insulin concentration, fasting blood sugar, insulin resistance, selenium intake, and basal energy expenditure Specific and significant with weight regain. However, the significance of insulin resistance, basal energy expenditure, and body mass index after one year from the end of the treatment period was higher than other variables in the weight regain group.

Keywords: body weight maintenance, weight regain, insulin resistance, insulin sensitivity

Procedia PDF Downloads 75

Authors: Najmeh Mohsenifar, Narjes Mohsenifar, Abbas Kargar

Abstract:

In this paper, has been presented a stable method for predicting the ECG signals through the RBF neural networks, by the PSO algorithm. In spite of quasi-periodic ECG signal from a healthy person, there are distortions in electro cardiographic data for a patient. Therefore, there is no precise mathematical model for prediction. Here, we have exploited neural networks that are capable of complicated nonlinear mapping. Although the architecture and spread of RBF networks are usually selected through trial and error, the PSO algorithm has been used for choosing the best neural network. In this way, 2 second of a recorded ECG signal is employed to predict duration of 20 second in advance. Our simulations show that PSO algorithm can find the RBF neural network with minimum MSE and the accuracy of the predicted ECG signal is 97 %.

Keywords: electrocardiogram, RBF artificial neural network, PSO algorithm, predict, accuracy

Procedia PDF Downloads 591

Authors: Ismail El Gayar, Ossama Ismail, Yousri El Gamal

Abstract:

This paper presented a technique to solve one of the transportation problems that faces us in real life which is the Bus Scheduling Problem. Most of the countries using buses in schools, companies and traveling offices as an example to transfer multiple passengers from many places to specific place and vice versa. This transferring process can cost time and money, so we build a decision support system that can solve this problem. In this paper, a genetic algorithm with the shortest path technique is used to generate a competitive solution to other well-known techniques. It also presents a comparison between our solution and other solutions for this problem.

Keywords: bus scheduling problem, decision support system, genetic algorithm, shortest path

Procedia PDF Downloads 372