Search results for: Genetic-Based Bees Algorithm

Authors: V. V. Belavadi, Syed Najeer E. Noor Khadri, Shivamurthy Naik

Abstract:

Members of aculeate Hymenoptera exhibit different levels of sociality. While Chrysidoidea are primarily parasitic and use their sting only for the purpose parasitizing the host and never for defense, all vespoid and apoid (sphecid) wasps use their sting for paralysing their prey as well as for defending themselves from predators and intruders. Though most apoid bees use their sting for defending themselves, a few bees (Apis spp.) use their sting exclusively for defending their colonies and the brood. A preliminary study conducted on the comparative morphology of stings of apoid bees and wasps and that of vespid wasps, indicated that the backward projected barbs are more pronounced only in the genus Apis, which is considered as the reason why a honey bee worker, loses its sting and dies when it stings a higher animal. This raises an important question: How barbs on lancets of Apis bees evolved? Supposing the barbs had not been strong, the worker bee would have been more efficient in defending the colony instead of only once in its lifetime! Some arguments in favour of worker altruistic behaviour, mention that in highly social insects, the colony size is large, workers are closely related among themselves and a worker sacrificing its life for the colony is beneficial for the colony. However, in colonies with a queen that has mated multiple times, the coefficient of relatedness among workers gets reduced and still the workers continue to exhibit the same behaviour. In this paper, we have tried to compare the morphology of stings of aculeate Hymenoptera and have attempted to relate sting morphology with social behaviour. Species examined for sting morphology are A. cerana, Apis dorsata, A. florea, Amegilla violacea, A. zonata, Megachile anthracina, M. Disjuncta, Liris aurulentus, Tachysphex bengalensis. Our studies indicate that occurrence of barbs on lancets correlates with the degree of sociality and sting autotomy is more pronounced in swarm-founding species than in haplometrotic species. The number of barbs on the lancets varied from 0 to 11. Additionally SEM images also revealed interesting characters of barbs.

Keywords: altruistic, barbs, sociality, sting autotomy

Procedia PDF Downloads 291

Authors: Damien P. Fevre, Peter K. Dearden

Abstract:

Honeybee population sustainability is a critical concern for environmental stability and human food security. The success of a colony relies heavily on the egg-laying capacity of the queen, as it determines the production of thousands of worker bees who, in turn, perform essential functions in foraging and transforming food to make it digestible for the colony. The main sources of nutrition for honeybees are nectar, providing carbohydrates, and pollen, providing protein. This study delves into the impact of the proportion of these macronutrients on the food consumption patterns of nurse bees responsible for feeding the queen and how it affects the characteristics of the eggs produced. Using nutritional geometry, qRT-PCR, and RNA-seq analysis, this study sheds light on the pivotal role of nutrition in influencing gene expression in nurse bees, honeybee queen egg-laying capacity and embryonic development. Interestingly, while nutrition is crucial, the queen's genotype plays an even more significant role in this complex relationship, highlighting the importance of genotype-by-environment interactions. Understanding the interplay between genotype and nutrition is key to optimizing beekeeping management and strategic queen breeding practices. The findings from this study have significant implications for beekeeping practices, emphasizing the need for an appropriate nutrition to support the social nutrition of Apis mellifera. Implementing these insights can lead to improved colony health, increased productivity, and sustainable honeybee conservation efforts.

Keywords: honeybee, egg-laying, nutrition, transcriptomics

Procedia PDF Downloads 51

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 131

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 514

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 446

Authors: Chahrazed Zouaoui

Abstract:

In recent years, the volume of geospatial information is increasing due to the evolution of communication technologies and information, this information is presented often by geographic information systems (GIS) and stored on of spatial databases (BDS). The classical data mining revealed a weakness in knowledge extraction at these enormous amounts of data due to the particularity of these spatial entities, which are characterized by the interdependence between them (1st law of geography). This gave rise to spatial data mining. Spatial data mining is a process of analyzing geographic data, which allows the extraction of knowledge and spatial relationships from geospatial data, including methods of this process we distinguish the monothematic and thematic, geo- Clustering is one of the main tasks of spatial data mining, which is registered in the part of the monothematic method. It includes geo-spatial entities similar in the same class and it affects more dissimilar to the different classes. In other words, maximize intra-class similarity and minimize inter similarity classes. Taking account of the particularity of geo-spatial data. Two approaches to geo-clustering exist, the dynamic processing of data involves applying algorithms designed for the direct treatment of spatial data, and the approach based on the spatial data pre-processing, which consists of applying clustering algorithms classic pre-processed data (by integration of spatial relationships). This approach (based on pre-treatment) is quite complex in different cases, so the search for approximate solutions involves the use of approximation algorithms, including the algorithms we are interested in dedicated approaches (clustering methods for partitioning and methods for density) and approaching bees (biomimetic approach), our study is proposed to design very significant to this problem, using different algorithms for automatically detecting geo-spatial neighborhood in order to implement the method of geo- clustering by pre-treatment, and the application of the bees algorithm to this problem for the first time in the field of geo-spatial.

Keywords: mining, GIS, geo-clustering, neighborhood

Procedia PDF Downloads 355

Authors: Chethana V. Casiker, Jagadishakumara B., Sunil G. M., Chaithra K., M. Soubadra Devy

Abstract:

A majority of the world’s food crops depends on insects for pollination, among which bees are the most dominant taxon. Bees pollinate vegetables, fruits and oilseeds which are rich in essential micronutrients. Besides being a prerequisite for a nutritionally secure diet, agrarian economies such as India depend heavily on pollination for good yield and quality of the product. As cities all over the world expand rapidly, large tracts of green spaces are being built up. This, along with high usage of agricultural chemicals has reduced floral diversity and shrunk bee habitats. Indeed, pollinator decline is being reported from various parts of the world. Further, the FAO has reported a huge increase in the area of land under cultivation of pollinator-dependent crops. In the light of increasing demand for pollination and disappearing natural habitats, it is critical to understand whether and how urban spaces can support pollinators. To this end, this study investigates the influence of landscape and local habitat quality on bee community dynamics. To capture the dynamics of expanding cityscapes, the study employs a space for time substitution, wherein a transect along the gradient of urbanization substitutes a timeframe of increasing urbanization. This will help understand how pollinators would respond to changes induced by increasing intensity of urbanization in the future. Bengaluru, one of the fastest growing cities of Southern India, is an excellent site to study impacts associated with urbanization. With sites moving away from the Bengaluru’s centre and towards its peripheries, this study captures the changes in bee species diversity and richness along a gradient of urbanization. Bees were sampled under different land use types as well as in different types of vegetation, including plantations, croplands, fallow land, parks, lake embankments, and private gardens. The relationship between bee community metrics and key drivers such as a percentage of built-up area, land use practices, and floral resources was examined. Additionally, data collected using questionnaire interviews were used to understand people’s perceptions towards and level of dependence on pollinators. Our results showed that urban areas are capable of supporting bees. In fact, a greater diversity of bees was recorded in urban sites compared to adjoining rural areas. This suggests that bees are able to seek out patchy resources and survive in small fragments of habitat. Bee abundance and species richness correlated positively with floral abundance and richness, indicating the role of vegetation in providing forage and nesting sites which are crucial to their survival. Bee numbers were seen to decrease with increase in built-up area demonstrating that impervious surfaces could act as deterrents. Findings from this study challenge the popular notion of cities being biodiversity-bare spaces. There is indeed scope for conserving bees in urban landscapes, provided that there are city-scale planning and local initiative. Bee conservation can go hand in hand with efforts such as urban gardening and terrace farming that could help cities urbanize sustainably.

Keywords: bee, landscape ecology, urbanization, urban pollination

Procedia PDF Downloads 135

Authors: Nassiri Khalid, El Hibaoui Abdelaaziz et Hajar Moha

Abstract:

In this paper, we introduce and analyse a probabilistic distributed algorithm for a construction of a minimum spanning tree on network. This algorithm is based on the handshake concept. Firstly, each network node is considered as a sub-spanning tree. And at each round of the execution of our algorithm, a sub-spanning trees are merged. The execution continues until all sub-spanning trees are merged into one. We analyze this algorithm by a stochastic process.

Keywords: Spanning tree, Distributed Algorithm, Handshake Algorithm, Matching, Probabilistic Analysis

Procedia PDF Downloads 628

Authors: Michael Eickermann, Juergen Junk

Abstract:

The Western honey (Apis mellifera) is threatened by a number of parasites, especially the devastating Varroa mite (Varroa destructor) is responsible for a high level of mortality over winter, e.g., in Europe and USA. While the use of synthetic pesticides or organic acids has been preferred so far to control this parasite, breeding strategies for less susceptible honey bees are in early stages. Hygienic behavior can be an important tool for controlling Varroa destructor. Worker bees with a high level of this behavior are able to detect infested brood in the cells under the wax lid during pupation and remove them out of the hive. The underlying processes of this behavior are only partly investigated, but it is for sure that hygienic behavior is heritable and therefore, can be integrated into commercial breeding lines. In a first step, breeding lines with a high level of phenotypic hygienic behavior have been identified by using a bioassay for accurate assessment of this trait in a long-term national breeding program in Luxembourg since 2015. Based on the artificial infestation of nucleus colonies with 150 phoretic Varroa destructor mites, the level of phenotypic hygienic behavior was detected by counting the number of mites in all stages, twelve days after infestation. A nucleus with a high level of hygienic behavior was overwintered and used for breeding activities in the following years. Artificial insemination was used to combine different breeding lines. Buckfast lines, as well as Carnica lines, were used. While Carnica lines offered only a low increase of hygienic behavior up to maximum 62.5%, Buckfast lines performed much better with mean levels of more than 87.5%. Some mating ends up with a level of 100%. But even with a level of 82.5% Varroa mites are not able to reproduce in the colony anymore. In a final step, a nucleus with a high level of hygienic behavior were build up to full colonies and located at two places in Luxembourg to build up a drone congregation area. Local beekeepers can bring their nucleus to this location for mating the queens with drones offering a high level of hygienic behavior.

Keywords: agiculture, artificial insemination, honey bee, varroa destructor

Procedia PDF Downloads 100

Authors: Vishnu Pratap Singh Kirar

Abstract:

Artificial Neural Network (ANN) can be trained using backpropagation (BP). It is the most widely used algorithm for supervised learning with multi-layered feed-forward networks. Efficient learning by the BP algorithm is required for many practical applications. The BP algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a two-term algorithm consisting of a learning rate (LR) and a momentum factor (MF). The major drawbacks of the two-term BP learning algorithm are the problems of local minima and slow convergence speeds, which limit the scope for real-time applications. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and criteria for evaluating convergence are required to facilitate the application of the three terms BP algorithm. Although these two seem to be closely related, as described later, we summarize various improvements to overcome the drawbacks. Here we compare the different methods of convergence of the new three-term BP algorithm.

Keywords: neural network, backpropagation, local minima, fast convergence rate

Procedia PDF Downloads 465

Authors: Kevin Worrall, Euan McGookin

Abstract:

The use of optimization algorithms is common across a large number of diverse fields. This work presents the use of a hybrid optimization algorithm applied to a mobile robot tasked with carrying out a search of an unknown environment. The algorithm is then applied to the multiple robots case, which results in a reduction in the time taken to carry out the search. The hybrid algorithm is a Random Search Algorithm fused with a Tabu mechanism. The work shows that the algorithm locates the desired points in a quicker time than a brute force search. The Tabu Random algorithm is shown to work within a simulated environment using a validated mathematical model. The simulation was run using three different environments with varying numbers of targets. As an algorithm, the Tabu Random is small, clear and can be implemented with minimal resources. The power of the algorithm is the speed at which it locates points of interest and the robustness to the number of robots involved. The number of robots can vary with no changes to the algorithm resulting in a flexible algorithm.

Keywords: algorithms, control, multi-agent, search and rescue

Procedia PDF Downloads 211

Authors: Sardar Ameer Akram Khan, Shahzad Amin Sheikh

Abstract:

Blind equalization is an important technique amongst equalization family. Multimodulus algorithms based on blind equalization removes the undesirable effects of ISI and cater ups the phase issues, saving the cost of rotator at the receiver end. In this paper a new algorithm combination of recursive least square and Multimodulus algorithm named as RLSMMA is proposed by providing few assumption, fast convergence and minimum Mean Square Error (MSE) is achieved. The excellence of this technique is shown in the simulations presenting MSE plots and the resulting filter results.

Keywords: blind equalizations, constant modulus algorithm, multi-modulus algorithm, recursive least square algorithm, quadrature amplitude modulation (QAM)

Procedia PDF Downloads 615

Authors: Safa Adi

Abstract:

This paper will consider the problem of sequential mining patterns embedded in a database by handling the time constraints as defined in the GSP algorithm (level wise algorithms). We will compare two previous approaches GTC and PSP, that resumes the general principles of GSP. Furthermore this paper will discuss PG-hybrid algorithm, that using PSP and GTC. The results show that PSP and GTC are more efficient than GSP. On the other hand, the GTC algorithm performs better than PSP. The PG-hybrid algorithm use PSP algorithm for the two first passes on the database, and GTC approach for the following scans. Experiments show that the hybrid approach is very efficient for short, frequent sequences.

Keywords: database, GTC algorithm, PSP algorithm, sequential patterns, time constraints

Procedia PDF Downloads 354

Authors: Ali Nourollah, Mohsen Movahedinejad

Abstract:

In this paper a new algorithm to generate random simple polygons from a given set of points in a two dimensional plane is designed. The proposed algorithm uses a genetic algorithm to generate polygons with few vertices. A new merge algorithm is presented which converts any two polygons into a simple polygon. This algorithm at first changes two polygons into a polygonal chain and then the polygonal chain is converted into a simple polygon. The process of converting a polygonal chain into a simple polygon is based on the removal of intersecting edges. The merge algorithm has the time complexity of O ((r+s) *l) where r and s are the size of merging polygons and l shows the number of intersecting edges removed from the polygonal chain. It will be shown that 1 < l < r+s. The experiments results show that the proposed algorithm has the ability to generate a great number of different simple polygons and has better performance in comparison to celebrated algorithms such as space partitioning and steady growth.

Keywords: Divide and conquer, genetic algorithm, merge polygons, Random simple polygon generation.

Procedia PDF Downloads 504

Authors: Ying Li, Yan Li

Abstract:

A new algorithm for single hidden layer feedforward neural networks (SLFN), Orthogonal Basis Extreme Learning (OBEL) algorithm, is proposed and the algorithm derivation is given in the paper. The algorithm can decide both the NNs parameters and the neuron number of hidden layer(s) during training while providing extreme fast learning speed. It will provide a practical way to develop NNs. The simulation results of function approximation showed that the algorithm is effective and feasible with good accuracy and adaptability.

Keywords: neural network, orthogonal basis extreme learning, function approximation

Procedia PDF Downloads 504

Authors: Wullapa Wongsinlatam

Abstract:

Back propagation algorithm (BP) is a widely used technique in artificial neural network and has been used as a tool for solving the time series problems, such as decreasing training time, maximizing the ability to fall into local minima, and optimizing sensitivity of the initial weights and bias. This paper proposes an improvement of a BP technique which is called IM-COH algorithm (IM-COH). By combining IM-COH algorithm with cuckoo search algorithm (CS), the result is cuckoo search improved control output hidden layer algorithm (CS-IM-COH). This new algorithm has a better ability in optimizing sensitivity of the initial weights and bias than the original BP algorithm. In this research, the algorithm of CS-IM-COH is compared with the original BP, the IM-COH, and the original BP with CS (CS-BP). Furthermore, the selected benchmarks, four time series samples, are shown in this research for illustration. The research shows that the CS-IM-COH algorithm give the best forecasting results compared with the selected samples.

Keywords: artificial neural networks, back propagation algorithm, time series, local minima problem, metaheuristic optimization

Procedia PDF Downloads 114

Authors: Jean-Pierre Lomaliza, Kwang-Seok Moon, Hanhoon Park

Abstract:

It is well-known that Ramer Douglas Peucker (RDP) algorithm greatly depends on the method of choosing starting points. Therefore, this paper focuses on finding such starting points that will optimize the results of RDP algorithm. Specifically, this paper proposes a curve approximation algorithm that finds flat points, called essential points, of an input curve, divides the curve into corner-like sub-curves using the essential points, and applies the RDP algorithm to the sub-curves. The number of essential points play a role on optimizing the approximation results by balancing the degree of shape information loss and the amount of data reduction. Through experiments with curves of various types and complexities of shape, we compared the performance of the proposed algorithm with three other methods, i.e., the RDP algorithm itself and its variants. As a result, the proposed algorithm outperformed the others in term of maintaining the original shapes of the input curve, which is important in various applications like pattern recognition.

Keywords: curve approximation, essential point, RDP algorithm

Procedia PDF Downloads 503

Authors: Djendi Mohmaed

Abstract:

In this paper, we propose a dual adaptive algorithm, which is based on the combination between the forward blind source separation (FBSS) structure and the affine projection algorithm (APA). This proposed algorithm combines the advantages of the source separation properties of the FBSS structure and the fast convergence characteristics of the APA algorithm. The proposed algorithm needs two noisy observations to provide an enhanced speech signal. This process is done in a blind manner without the need for ant priori information about the source signals. The proposed dual forward blind source separation affine projection algorithm is denoted (DFAPA) and used for the first time in an airplane cockpit context to enhance the communication from- and to- the airplane. Intensive experiments were carried out in this sense to evaluate the performance of the proposed DFAPA algorithm.

Keywords: adaptive algorithm, speech enhancement, system mismatch, SNR

Procedia PDF Downloads 107

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid distributed algorithm has been suggested for the multi-objective job shop scheduling problem. Many new approaches are used at design steps of the distributed algorithm. Co-evolutionary structure of the algorithm and competition between different communicated hybrid algorithms, which are executed simultaneously, causes to efficient search. Using several machines for distributing the algorithms, at the iteration and solution levels, increases computational speed. The proposed algorithm is able to find the Pareto solutions of the big problems in shorter time than other algorithm in the literature. Apache Spark and Hadoop platforms have been used for the distribution of the algorithm. The suggested algorithm and implementations have been compared with results of the successful algorithms in the literature. Results prove the efficiency and high speed of the algorithm.

Keywords: distributed algorithms, Apache Spark, Hadoop, job shop scheduling, multi-objective optimization

Procedia PDF Downloads 332

Authors: Vahid Zeighami, Mohsen Ghsemi, Reza Akbari

Abstract:

In this work, a Multi-Level Artificial Bee Colony (called MLABC) is presented. In MLABC two species are used. The first species employs n colonies in which each of the them optimizes the complete solution vector. The cooperation between these colonies is carried out by exchanging information through a leader colony, which contains a set of elite bees. The second species uses a cooperative approach in which the complete solution vector is divided to k sub-vectors, and each of these sub-vectors is optimized by a a colony. The cooperation between these colonies is carried out by compiling sub-vectors into the complete solution vector. Finally, the cooperation between two species is obtained by exchanging information between them. The proposed algorithm is tested on a set of well known test functions. The results show that MLABC algorithms provide efficiency and robustness to solve numerical functions.

Keywords: artificial bee colony, cooperative, multilevel cooperation, vector

Procedia PDF Downloads 412

Authors: Cemil Turan, Mohammad Shukri Salman

Abstract:

The convergence rate of the least-mean-square (LMS) algorithm deteriorates if the input signal to the filter is correlated. In a system identification problem, this convergence rate can be improved if the signal is white and/or if the system is sparse. We recently proposed a sparse transform domain LMS-type algorithm that uses a variable step-size for a sparse system identification. The proposed algorithm provided high performance even if the input signal is highly correlated. In this work, we investigate the performance of the proposed TD-LMS algorithm for a large number of filter tap which is also a critical issue for standard LMS algorithm. Additionally, the optimum value of the most important parameter is calculated for all experiments. Moreover, the convergence analysis of the proposed algorithm is provided. The performance of the proposed algorithm has been compared to different algorithms in a sparse system identification setting of different sparsity levels and different number of filter taps. Simulations have shown that the proposed algorithm has prominent performance compared to the other algorithms.

Keywords: adaptive filtering, sparse system identification, TD-LMS algorithm, VSSLMS algorithm

Procedia PDF Downloads 322

Authors: Omar Ramzi Jasim, Jalal Sultan Ashour

Abstract:

Production Planning or Master Production Schedule (MPS) is a key interface between marketing and manufacturing, since it links customer service directly to efficient use of production resources. Mismanagement of the MPS is considered as one of fundamental problems in operation and it can potentially lead to poor customer satisfaction. In this paper, a hybrid evolutionary algorithm (ICA-GA) is presented, which integrates the merits of both imperialist competitive algorithm (ICA) and genetic algorithm (GA) for solving multi-objective MPS problems. In the presented algorithm, the colonies in each empire has be represented a small population and communicate with each other using genetic operators. By testing on 5 production scenarios, the numerical results of ICA-GA algorithm show the efficiency and capabilities of the hybrid algorithm in finding the optimum solutions. The ICA-GA solutions yield the lower inventory level and keep customer satisfaction high and the required overtime is also lower, compared with results of GA and SA in all production scenarios.

Keywords: master production scheduling, genetic algorithm, imperialist competitive algorithm, hybrid algorithm

Procedia PDF Downloads 439

Authors: Jeryes Danial, Yosi Ben Asher

Abstract:

Algorithms for controlling a swarm of robots is an active research field, out of which cattle herding is one of the most complex problems to solve. In this paper, we derive an independent herding algorithm that is specifically designed for a swarm of quadcopters. The algorithm works by devising flight trajectories that cause the cows to run-away in the desired direction and hence herd cows that are distributed in a given field towards a common gathering point. Unlike previously proposed swarm herding algorithms, this algorithm does not use a flocking model but rather stars each cow separately. The effectiveness of this algorithm is verified experimentally using a simulator. We use a special set of experiments attempting to demonstrate that the herding times of this algorithm correspond to field diameter small constant regardless of the number of cows in the field. This is an optimal result indicating that the algorithm groups the cows into intermediate groups and herd them as one forming ever closing bigger groups.

Keywords: swarm, independent, distributed, algorithm

Procedia PDF Downloads 145

Authors: Sikander Singh Cheema, Jasmeen Kaur

Abstract:

In this paper, the concept of data mining is summarized and its one of the important process i.e KDD is summarized. The data mining based on Genetic Algorithm is researched in and ways to achieve the data mining Genetic Algorithm are surveyed. This paper also conducts a formal review on the area of data mining tasks and genetic algorithm in various fields.

Keywords: data mining, KDD, genetic algorithm, descriptive mining, predictive mining

Procedia PDF Downloads 564

Authors: F. Erdal, E. Dogan, F. E. Uz

Abstract:

In this study, firefly optimization based optimum design algorithm is presented for the grillage systems. Naming of the algorithm is derived from the fireflies, whose sense of movement is taken as a model in the development of the algorithm. Fireflies’ being unisex and attraction between each other constitute the basis of the algorithm. The design algorithm considers the displacement and strength constraints which are implemented from LRFD-AISC (Load and Resistance Factor Design-American Institute of Steel Construction). It selects the appropriate W (Wide Flange)-sections for the transverse and longitudinal beams of the grillage system among 272 discrete W-section designations given in LRFD-AISC so that the design limitations described in LRFD are satisfied and the weight of the system is confined to be minimal. Number of design examples is considered to demonstrate the efficiency of the algorithm presented.

Keywords: firefly algorithm, steel grillage systems, optimum design, stochastic search techniques

Procedia PDF Downloads 393

Authors: Zeina Nasr, Bashar Merheb

Abstract:

The honey bee is a social insect that had driven the human interest much more than any other organism. Beekeeping practices dated the appearance of Man on earth and now it provides a hobby or a secondary work that contributes to the family revenue and requires a little time engagement and money investment. Honey production is not the only contribution of honey bees to the economy, since honey bees play an important role in the pollination. Bee keeping in Lebanon is an important part of the agricultural economy. However, a growing concern about bees is spreading globally, due to an accelerated decline of bees colonies. This raises the alert to preserve and protect local bee strains against uncontrolled introduction of foreign strains and invasive parasitic species. Mitochondrial DNA (mtDNA) markers are commonly used in studying genetic variation in the Apis mellifera species. The DraI-COI-COII test is based on the analysis of the intergenic region between the two genes COI and COII. The different honey bee strains differ in the presence or absence of the p sequence and the number of Q sequences present. A. m. syriaca belonging to the lineage Z, is the native honey bee subspecies in Lebanon, Syria, Jordan, and Palestine. A. m. syriaca is known for its high defensiveness, even though it has many important advantages. However, commercial breeder strains, such as the Italian (A. m. ligustica), and Carniolan (A. m. carnica) strains, have been introduced by beekeepers and regularly used for honey production. This raises worries about the disappearance of the local subspecies. It is obvious that identifying A. m. syriaca colonies and protecting them against uncontrolled mating with other bee strains is a crucial step to protect and improve the original local strain. This study aims to reveal the existing sub-species of honey bee in Akkar – Lebanon and to assess the influence of introgression on the hybridization of the local strain. This will help to identify areas of pure A.m. syriaca population over this district to be considered in choosing syriaca reserves. We collected samples of bees from different regions of Akkar district in order to perform mtDNA analysis. We determined the restriction fragments length of the intergenic region COI-COII, using the restriction enzyme DraI. The results showed both the C and the Z lineages. Four restriction patterns were identified among the restriction maps of the studied samples. The most abundant mitochondrial lineage is the Z lineage constituting about 60% of the identified samples. Al-Dreib region reported the lowest introgression with foreign mtDNA of 21% making it the most suitable area for a genetic reserve of syriaca in Akkar based on its lowest introgression and suitable environment in addition to the attitude of local beekeepers to conserve the local strain. Finally, this study is the first step in constructing conservation programs for the preservation of the local strain and should be generalized to the whole Lebanese population, consistent with the effort done in neighboring countries.

Keywords: Akkar Lebanon, Apis millefera syriaca, DraI-COI-COII test, mitochondrial DNA

Procedia PDF Downloads 250

Authors: Benachour Karima

Abstract:

Pollination is a key factor in crop production and the presence of insect pollinators, mainly wild bees, is essential for improving yields. In this work, visiting apoids of two vegetable crops, the turnip (Brassica rapa L.) and the radish (Raphanus sativus L.) (Brassicaceae) were recorded during flowering times of 2003 and 2004 in Constantine area (36°22’N 06°37’E, 660 m). The observations were conducted in a plot of approximately 308 m2 of the Institute of Nutrition, Food and Food Technology (University of Mentouri Brothers). To estimate the density of bees (per 100 flowers or m2), 07 plots (01m2 for each one) are defined from the edge of the culture and in the first two rows. From flowering and every two days, foraging insects are recorded from 09 am until 17 pm (Gmt+1).The purpose of visit (collecting nectar, pollen or both) and pollinating efficiency (estimated by the number of flowers visited per minute and the number of positive visits) were noted for the most abundant bees on flowers. The action of pollinating insects is measured by comparing seed yields of 07 plots covered with tulle with 07 other accessible to pollinators. 04 families of Apoidea: Apidae, Halictidae, Andrenidae and Megachilidae were observed on the two plants. On turnip, the honeybee is the most common visitor (on average 214visites/ m2), it is followed by the Halictidae Lasioglossum mediterraneum whose visits are less intense (20 individuals/m2). Visits by Andrenidae, represented by several species such as Andrena lagopus, A.flavipes, A.agilissima and A.rhypara were episodic. The honeybee collected mainly nectar, its visits were all potentially fertilizing (contact with stigma) and more frequent (on average 14 flowers/min. L.mediterraneum visited only 05 flrs/min, it collected mostly the two products together and all its visits were also positive. On radish, the wild bee Ceratina cucurbitina recorded the highest number of visits (on average 06 individuals/100flo wers), the Halictidae represented mainly by L.mediterraneum, and L.malachurum, L.pauxillum were less abundant. C.cucurbitina visited on average 10 flowers /min and all its visits are positive. Visits of Halictidae were less frequent (05-06 flowers/min) and not all fertilizing. Seed yield of Brassica rapa (average number of pods /plant, seeds/ pods and average weight of 1000 seeds) was significantly higher in the presence of pollinators. Similarly, the pods of caged plants gave a percentage of aborted seeds (10.3%) significantly higher than that obtained on free plants (4.12%), the pods of caged plants also gave a percentage of malformed seeds (1.9%) significantly higher than that of the free plants (0.9%). For radish, the seed yield in the presence and absence of insects are almost similar. Only the percentage of malformed seeds (3.8%) obtained from the pods of caged plants was significantly higher in comparison with pods of free plants (1.9%). Following these results, it is clear that pollinators especially bees are essential for the production and improvement of crop yields and therefore it is necessary to protect this fauna increasingly threatened.

Keywords: foraging behavior, honey bee, radish, seed yield, turnip, wild bee

Procedia PDF Downloads 181

Authors: Jude A. Mbanasor, Chigozirim N. Onwusiribe

Abstract:

The enigma climate change is no longer an illusion but a reality. In the recent years, the Nigeria climate has changed and the changes are shown by the changing patterns of rainfall, the sunshine, increasing level carbon and nitrous emission as well as deforestation. This study analyzed the behavioural response of bee keepers to variations in the climate and the adaptation techniques developed in response to the climate variation. Beekeeping is a viable economic activity for the alleviation of poverty as the products include honey, wax, pollen, propolis, royal jelly, venom, queens, bees and their larvae and are all marketable. The study adopted the multistage sampling technique to select 120 beekeepers from the five states of Southeast Nigeria. Well-structured questionnaires and focus group discussions were adopted to collect the required data. Statistical tools like the Principal component analysis, data envelopment models, graphs, and charts were used for the data analysis. Changing patterns of rainfall and sunshine with the increasing rate of deforestation had a negative effect on the habitat of the bees. The bee keepers have adopted the Kenya Top bar and Langstroth hives and they establish the bee hives on fallow farmland close to the cultivated communal farms with more flowering crops.

Keywords: climate, farmer, response, smart

Procedia PDF Downloads 102

Authors: Chin-Yuan Hsu, Yu-Lung Chuang

Abstract:

The expression, concentration, and activity of mitochondrial energy-utilized molecules and cellular energy-regulated molecules decreased with age in the trophocytes and oenocytes of honeybees (Apis mellifera), but those of cellular energy-metabolized molecules is unknown. In this study, the expression, concentration, and activity of cellular energy-metabolized molecules were assayed in the trophocytes and fat cells of young and old worker bees by using the techniques of cell and biochemistry. The results showed that (i) the •-hydroxylacyl-coenzyme A dehydrogenase (HOAD) activity/citrate synthase (CS) activity ratio, non-esterified fatty acids concentrations, the expression of eukaryotic initiation factor 4E, and the expression of phosphorylated eIF4E binding protein 1 decreased with age; (ii) fat and glycogen accumulation increased with age; and (iii) the pyruvate dehydrogenase (PDH) activity/citrate synthase (CS) activity ratio was not correlated with age. These finding indicated that •-oxidation (HOAD/CS) and protein synthsis decreased with age. Glycolysis (PDH/CS) was unchanged with age. The most likely reason is that sugars are the vital food of worker bees. Taken together these data reveal that young workers have higher cellular energy metabolism than old workers and that aging results in a decline in the cellular energy metabolism in worker honeybees.

Keywords: aging, energy, honeybee, metabolism

Procedia PDF Downloads 436

Authors: Roshanak Khodabakhsh Jolfaei, Javad Akbari Torkestani

Abstract:

As a cooperative environment for problem-solving, it is necessary that grids develop efficient job scheduling patterns with regard to their goals, domains and structure. Since the Grid environments facilitate distributed calculations, job scheduling appears in the form of a critical problem for the management of Grid sources that influences severely on the efficiency for the whole Grid environment. Due to the existence of some specifications such as sources dynamicity and conditions of the network in Grid, some algorithm should be presented to be adjustable and scalable with increasing the network growth. For this purpose, in this paper a job scheduling algorithm has been presented on the basis of learning automata in computational Grid which the performance of its results were compared with FPSO algorithm (Fuzzy Particle Swarm Optimization algorithm) and GJS algorithm (Grid Job Scheduling algorithm). The obtained numerical results indicated the superiority of suggested algorithm in comparison with FPSO and GJS. In addition, the obtained results classified FPSO and GJS in the second and third position respectively after the mentioned algorithm.

Keywords: computational grid, job scheduling, learning automata, dynamic scheduling

Procedia PDF Downloads 311