Search results for: dynamic algorithm

Authors: H. I. Beloufa, M. Tarfaoui

Abstract:

For many applications, adhesively bonded assemblies have gained an increasing interest in the industry due to several advantages over welding, riveting and bolting, such as reduction of stress concentrations, lightness, low cost and easy manufacturing. This work is largely concerned to show the effects of the loading rate of the adhesively bonded joints under different speed rates. The tensile tests were conducted at four different rates; static (5mm/min, 50mm/min) and dynamic tests (1m/s, and 10m/s). An attempt was made to determine the damage kinetic and a comparison between the use of aluminium and composite laminate substrates is introduced. Aluminum T6082 and glass/vinylester laminated composite Substrates were used to construct aluminum/aluminum and laminate/laminate specimens. The adhesive used in this study was Araldite 2015. The results showed the effects of the loading rate évolution on the double joint strength. The comparison of the results of static and dynamic tests showed a raise of the strength of the specimens while the load velocity is elevated. In the case of composite substrates double joint lap, the stiffness increased by more than 60% between static and dynamic tests. However, in the case of aluminum substrates, the rigidity improved about 28% from static to moderately high velocity loading. For both aluminum and composite double joint lap, the strength increased by approximately 25% when the tensile velocity is increased from 5 mm/min to 50 mm/min (static tests). Nevertheless, the tensile velocity is extended to 1m/s the strength increased by 13% and 25% respectively for composite and aluminum substrates.

Keywords: adhesive, double lap joints, static and dynamic behavior, tensile tests

Procedia PDF Downloads 185

Authors: Venkataramana Sovenahalli Badigar, B. M. Suryakanth, Akshar Prasanna, Karthik Veeramalai, Vishwak Ram Vishwak Ram

Abstract:

Technological advances have led to widespread autonomy in vehicles. Empowering these autonomous with the intelligence to cooperate amongst themselves leads to a more efficient use of the resources available to them. This paper proposes a demonstration of a swarm algorithm implemented on a group of autonomous vehicles. The demonstration involves two ground bots and an aerial drone which cooperate amongst them to locate an object of interest. The object of interest is modelled using a high-intensity light source which acts as a beacon. The ground bots are light sensitive and move towards the beacon. The ground bots and the drone traverse in random paths and jointly locate the beacon. This finds application in various scenarios in where human interference is difficult such as search and rescue during natural disasters, delivering crucial packages in perilous situations, etc. Experimental results show that the modified swarm algorithm implemented in this system has better performance compared to fully random based moving algorithm for object localization and tracking.

Keywords: swarm algorithm, object localization, ground bots, drone, beacon

Procedia PDF Downloads 240

Authors: Gałka Aleksandra, Jelińska Justyna, Masiak Albert, Walentukiewicz Krzysztof

Abstract:

An offline signature is well-known however not the safest way to verify identity. Nowadays, to ensure proper authentication, i.e. in banking systems, multimodal verification is more widely used. In this paper the online signature analysis based on dynamic time warping (DTW) coupled with machine learning approaches has been presented. In our research signatures made with biometric pens were gathered. Signature features as well as their forgeries have been described. For verification of authenticity various methods were used including convolutional neural networks using DTW matrix and multilayer perceptron using sums of DTW matrix paths. System efficiency has been evaluated on signatures and signature forgeries collected on the same day. Results are presented and discussed in this paper.

Keywords: dynamic time warping, handwritten signature verification, feature-based recognition, online signature

Procedia PDF Downloads 150

Authors: M. Akhondizadeh, Mohsen Khajoei, Mojtaba Khajoei

Abstract:

The purpose of the present work was the design of a towing machine which was decided to be manufactured by Arman Gohar-e-Sirjan company in the Gol-e-Gohar iron ore complex in Iran. The load analysis has been conducted to determine the static and dynamic loads at the critical conditions. The inertial forces due to the velocity increment and road bump have been considered in load evaluation. The form of loading of the present machine is hauling and/or conveying the mineral machines on the mini ramp. Several stages of these forms of loading, from the initial touch of the tow and carried machine to the final position, have been assessed to determine the critical state. The stress analysis has been performed by the ANSYS software. Several geometries for the main load-carrying elements have been analyzed to have the optimum design by the minimum weight of the structure. Finally, a structure with a total weight of 38 tons has been designed with a static load-carrying capacity of 80 tons by considering the 40 tons additional capacity for dynamic effects. The stress analysis for 120 tons load gives the minimum safety factor of 1.18.

Keywords: mechanical design, stress analysis, tow structure, dynamic load, static load

Procedia PDF Downloads 91

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

In this paper, a new neural network based variable neighborhood search is proposed for the multi-objective dynamic, flexible job shop scheduling problems. The neural network controls the problems' constraints to prevent infeasible solutions, while the Variable Neighborhood Search (VNS) applies moves, based on the critical block concept to improve the solutions. Two approaches are used for managing the constraints, in the first approach, infeasible solutions are modified according to the constraints, after the moves application, while in the second one, infeasible moves are prevented. Several neighborhood structures from the literature with some modifications, also new structures are used in the VNS. The suggested neighborhoods are more systematically defined and easy to implement. Comparison is done based on a multi-objective flexible job shop scheduling problem that is dynamic because of the jobs different release time and machines breakdowns. The results show that the presented method has better performance than the compared VNSs selected from the literature.

Keywords: constrained optimization, neural network, variable neighborhood search, flexible job shop scheduling, dynamic multi-objective optimization

Procedia PDF Downloads 332

Authors: Pablo Kubo, Cassio Paiva, Adelino Ferreira

Abstract:

The main objective of this research study is to present the results of the influence of shock absorber condition, from a truck front suspension, on the vertical dynamic load applied on the pavement. For the measurements, it has been used a durability test track located in Brazil. The shock absorber conditions were new, used and failed with a constant load of 6 tons on the front suspension, the maximum allowed load for front axle according to Brazilian legislation. By applying relative damage concept, it is possible to conclude that the variation on the shock absorber conditions will significantly affect the load applied on the pavement. Although, it is recommended to repeat the same methodology in order to analyze the influence on the variation of the quarter car model variants.

Keywords: damage, shock absorber, vertical dynamic load, absorber

Procedia PDF Downloads 470

Authors: Hong Lu, Xiong Xiao

Abstract:

Shaft parts are widely used in machinery industry, however, bending deformation often occurred when this kind of parts is being heat treated. This parts needs to be straightened to meet the requirement of straightness. As for the pressure straightening process, a good straightening stroke algorithm is related to the precision and efficiency of straightening process. In this paper, the relationship between straightening load and deflection during the straightening process is analyzed, and the mathematical model of the straightening process has been established. By the mathematical model, the iterative method is used to solve the straightening stroke. Compared to the traditional straightening stroke algorithm, straightening stroke calculated by this method is much more precise; because it can adapt to the change of material performance parameters. Considering that the straightening method is widely used in the mass production of the shaft parts, knowledge base is used to store the data of the straightening process, and a straightening stroke algorithm based on empirical data is set up. In this paper, the straightening process control model which combine the straightening stroke method based on iteration and straightening stroke algorithm based on empirical data has been set up. Finally, an experiment has been designed to verify the straightening process control model.

Keywords: straightness, straightening stroke, deflection, shaft parts

Procedia PDF Downloads 313

Authors: Derya Güler Aydin, Bahar Araz Takay

Abstract:

Two different forms of competition theories can be distinguished: Those theories that emphasize the equilibrating forces created by competition, and those emphasizing the disequilibrating forces. This difference can be attributed, among other things, to the differences regarding the functioning of the market economy; that is to say, the basic problem here is whether competition should be understood as a static state or a dynamic process. This study aims to analyze the dynamic competition theories by K. Marx and J. A. Schumpeter and neo- Schumperians all of which focus on the dynamic role played by competition through creating disequilibria, endogenous structural change and social transformation as a distinguishing characteristic of the market system. With this aim, in the first section, after examining the static, neoclassical competition theory, both Marx‟s theory, which is based on profit rate differentials, and Schumpeter‟s theory, which is based on the notion of “creative destruction”, will be discussed. In the second section, the long-term fluctuations, based on creative gales of destruction, the concept will be examined under the framework of techno-economic paradigm. It is argued that the dynamic, even disequilibrium tendencies created by the competition process should be regarded in both understanding the working of capitalism and social transformation of the system.

Keywords: competition, techno-enomic paradigm, Schumpeter, social evolution

Procedia PDF Downloads 224

Authors: Donatella Giuliani

Abstract:

In this research, we propose an unsupervised grayscale image segmentation method based on a combination of the Firefly Algorithm and the Gaussian Mixture Model. Firstly, the Firefly Algorithm has been applied in a histogram-based research of cluster means. The Firefly Algorithm is a stochastic global optimization technique, centered on the flashing characteristics of fireflies. In this context it has been performed to determine the number of clusters and the related cluster means in a histogram-based segmentation approach. Successively these means are used in the initialization step for the parameter estimation of a Gaussian Mixture Model. The parametric probability density function of a Gaussian Mixture Model is represented as a weighted sum of Gaussian component densities, whose parameters are evaluated applying the iterative Expectation-Maximization technique. The coefficients of the linear super-position of Gaussians can be thought as prior probabilities of each component. Applying the Bayes rule, the posterior probabilities of the grayscale intensities have been evaluated, therefore their maxima are used to assign each pixel to the clusters, according to their gray-level values. The proposed approach appears fairly solid and reliable when applied even to complex grayscale images. The validation has been performed by using different standard measures, more precisely: the Root Mean Square Error (RMSE), the Structural Content (SC), the Normalized Correlation Coefficient (NK) and the Davies-Bouldin (DB) index. The achieved results have strongly confirmed the robustness of this gray scale segmentation method based on a metaheuristic algorithm. Another noteworthy advantage of this methodology is due to the use of maxima of responsibilities for the pixel assignment that implies a consistent reduction of the computational costs.

Keywords: clustering images, firefly algorithm, Gaussian mixture model, meta heuristic algorithm, image segmentation

Procedia PDF Downloads 202

Authors: Radwa El Shorbagy, Alaa El Din Balbaa, Khaled Ayad, Waleed Reda

Abstract:

Ankle sprain is a common lower limb injury that is complicated by high recurrence rate. The cause of recurrence is not clear; however, changes in motor control have been postulated.Objective: to determine the contribution of proximal hip strategy to dynamic posture control in patients with recurrent ankle sprain. Methods:Fifteen subjects with recurrent ankle sprain (Group A) and fifteen healthy control subjects (Group B) participated in this study. Abductor-adductor as well as flexor-extensor hip musculature control was abolished by fatigue using the Biodex Isokinatic System. Dynamic posture control was measured before and after fatigue by the Biodex Balance System. Results: Repeated measures MANOVA was used to compare within group differences. In group A fatiguing of hip muscles (flexors-extensors and abductors-adductors) lowered overall stability index (OASI), anteroposterior stability index (APSI) and mediolateral stability index (MLSI) significantly (p=0.00) whereas; in group B fatiguing of hip flexors-extensors lowered significantly OASI and APSI only (p= 0.017, 0.010; respectively) while fatiguing of hip abductors-adductors has no significant effect on these variables. Conclusion: fatiguing of hip muscles has a significant deleterious effect on dynamic posture control in patient with recurrent ankle sprain indicating their increased dependence on hip strategy.

Keywords: ankle sprain, fatigue hip muscles, dynamic balance, ankle sprain

Procedia PDF Downloads 340

Authors: Morteza Raminnia

Abstract:

In this study, dynamic analysis of functionally graded nano-composite pipe reinforced by single-walled carbon nano-tubes (SWCNTs) with simply supported boundary condition subjected to moving mechanical loads is investigated. The material properties of functionally graded carbon nano tube-reinforced composites (FG-CNTRCs) are assumed to be graded in the thickness direction and are estimated through a micro-mechanical model. In this paper polymeric matrix considered as isotropic material and for the CNTRC, uniform distribution (UD) and three types of FG distribution patterns of SWCNT reinforcements are considered. The system equation of motion is derived by using Hamilton's principle under the assumptions of first order shear deformation theory (FSDT).The thin piezoelectric layers embedded on inner and outer surfaces of FG-CNTRC layer are acted as distributed sensor and actuator to control dynamic characteristics of the FG-CNTRC laminated pipe. The modal analysis technique and Newmark's integration method are used to calculate the displacement and dynamic stress of the pipe subjected to moving loads. The effects of various material distribution and velocity of moving loads on dynamic behavior of the pipe is presented. This present approach is validated by comparing the numerical results with the published numerical results in literature. The results show that the above-mentioned effects play very important role on dynamic behavior of the pipe .This present work shows that some meaningful results that which are interest to scientific and engineering community in the field of FGM nano-structures.

Keywords: nano-composite, functionally garded material, moving load, active control, PZT layers

Procedia PDF Downloads 401

Authors: Zoran Šverko, Saša Vlahinić, Nino Stojković, Ivan Markovinović

Abstract:

In this article, the classification of target letters is performed using data from the EEG P300 Speller paradigm. Neural networks trained with the results of dynamic connectivity analysis between different brain regions are used for classification. Dynamic connectivity analysis is based on the adaptive window size and the imaginary part of the complex Pearson correlation coefficient. Brain dynamics are analysed using the relative intersection of confidence intervals for the imaginary component of the complex Pearson correlation coefficient method (RICI-imCPCC). The RICI-imCPCC method overcomes the shortcomings of currently used dynamical connectivity analysis methods, such as the low reliability and low temporal precision for short connectivity intervals encountered in constant sliding window analysis with wide window size and the high susceptibility to noise encountered in constant sliding window analysis with narrow window size. This method overcomes these shortcomings by dynamically adjusting the window size using the RICI rule. This method extracts information about brain connections for each time sample. Seventy percent of the extracted brain connectivity information is used for training and thirty percent for validation. Classification of the target word is also done and based on the same analysis method. As far as we know, through this research, we have shown for the first time that dynamic connectivity can be used as a parameter for classifying EEG signals.

Keywords: dynamic connectivity analysis, EEG, neural networks, Pearson correlation coefficients

Procedia PDF Downloads 190

Authors: Amin H. Almasria, Rajai Z. Alrousanb, Al-Harith Manasrah

Abstract:

The collapse of a light weight pedestrian bridges due to vehicle collision is investigated and studied in detail using a dynamic nonlinear finite element analysis. Typical bridge widely used in Jordan is studied and modeled under truck collision using one dimensional beam finite element in order to minimize analysis time due to the dynamic nature of the problem. Truck collision with the bridge is simulated at different speeds and locations of collisions using dynamic explicit finite element scheme with material nonlinearity taken into account. Energy absorption of bridge is investigated through principle of energy conservation, where truck kinetic energy is assumed to be stored in the bridge as strain energy. Weak failure points in the bridges were identified, and modifications are proposed in order to strengthen the bridge structure and prevent total collapse. The proposed design modifications on bridge structure were successful in allowing the bridge to fail locally rather than globally and expected to help in saving lives.

Keywords: finite element method, dynamic impact, pedestrian bridges, strain energy, collapse failure

Procedia PDF Downloads 605

Authors: Tabrej Khan

Abstract:

Examination Scheduling System (ESS) is a scheduling system that targets as an exam committee in any academic institute to help them in managing the exams automatically. We present an algorithm for Examination Scheduling System. Nowadays, many universities have challenges with creating examination schedule fast with less confliction compared to hand works. Our aims are to develop a computerized system that can be used in examination scheduling in an academic institute versus available resources (Time, Hall, Invigilator and instructor) with no contradiction and achieve fairness among students. ESS was developed using HTML, C# language, Crystal Report and ASP.NET through Microsoft Visual Studio 2010 as developing tools with integrated SQL server database. This application can produce some benefits such as reducing the time spent in creating an exam schedule and achieving fairness among students

Keywords: examination scheduling system (ESS), algorithm, ASP.NET, crystal report

Procedia PDF Downloads 385

Authors: Safia Rabaaoui, Héla Hachicha, Ezzeddine Zagrouba

Abstract:

Nowadays, cloud computing is becoming the more popular technology to various companies and consumers, which benefit from its increased efficiency, cost optimization, data security, unlimited storage capacity, etc. One of the biggest challenges of cloud computing is resource allocation. Its efficiency directly influences the performance of the whole cloud environment. Finding an effective method to address these critical issues and increase cloud performance was necessary. This paper proposes a mobile agents-based framework for dynamic resource allocation in cloud computing to minimize both the cost of using virtual machines and the makespan. Furthermore, its impact on the best response time and power consumption has been studied. The simulation showed that our method gave better results than here.

Keywords: cloud computing, multi-agent system, mobile agent, dynamic resource allocation, cost, makespan

Procedia PDF Downloads 79

Authors: A. Baviskar, C. Sandeep, K. Shankar

Abstract:

Solving Multi-objective Optimization Problems requires faster convergence and better spread. Though existing Evolutionary Algorithms (EA's) are able to achieve this, the computation effort can further be reduced by hybridizing them with innovative strategies. This study is focuses on converging to the pareto front faster while adapting the advantages of Strength Pareto Evolutionary Algorithm-II (SPEA-II) for a better spread. Two different approaches based on optimizing the objective functions independently are implemented. In the first method, the decision variables corresponding to the optima of individual objective functions are strategically used to guide the search towards the pareto front. In the second method, boundary points of the pareto front are calculated and their decision variables are seeded to the initial population. Both the methods are applied to different constrained and unconstrained multi-objective test functions. It is observed that proposed guided search based algorithm gives better convergence and diversity than several well-known existing algorithms (such as NSGA-II and SPEA-II) in considerably less number of iterations.

Keywords: boundary points, evolutionary algorithms (EA's), guided search, strength pareto evolutionary algorithm-II (SPEA-II)

Procedia PDF Downloads 256

Authors: Mabrouka Algherinai, Fatma Karkouri

Abstract:

Today, Short Message Service (SMS) is an important means of communication. SMS is not only used in informal environment for communication and transaction, but it is also used in formal environments such as institutions, organizations, companies, and business world as a tool for communication and transactions. Therefore, there is a need to secure the information that is being transmitted through this medium to ensure security of information both in transit and at rest. But, encryption has been identified as a means to provide security to SMS messages in transit and at rest. Several past researches have proposed and developed several encryption algorithms for SMS and Information Security. This research aims at comparing the performance of common Asymmetric encryption algorithms on SMS security. The research employs the use of three algorithms, namely RSA, McEliece, and RABIN. Several experiments were performed on SMS of various sizes on android mobile device. The experimental results show that each of the three techniques has different key generation, encryption, and decryption times. The efficiency of an algorithm is determined by the time that it takes for encryption, decryption, and key generation. The best algorithm can be chosen based on the least time required for encryption. The obtained results show the least time when McEliece size 4096 is used. RABIN size 4096 gives most time for encryption and so it is the least effective algorithm when considering encryption. Also, the research shows that McEliece size 2048 has the least time for key generation, and hence, it is the best algorithm as relating to key generation. The result of the algorithms also shows that RSA size 1024 is the most preferable algorithm in terms of decryption as it gives the least time for decryption.

Keywords: SMS, RSA, McEliece, RABIN

Procedia PDF Downloads 147

Authors: Delowar Hossain, Genci Capi

Abstract:

This paper concerns with the problem of deep learning parameters tuning using a genetic algorithm (GA) in order to improve the performance of deep learning (DL) method. We present a GA based DL method for robot object recognition and grasping. GA is used to optimize the DL parameters in learning procedure in term of the fitness function that is good enough. After finishing the evolution process, we receive the optimal number of DL parameters. To evaluate the performance of our method, we consider the object recognition and robot grasping tasks. Experimental results show that our method is efficient for robot object recognition and grasping.

Keywords: deep learning, genetic algorithm, object recognition, robot grasping

Procedia PDF Downloads 332

Authors: Md Monir Hossain, Anne Staples, Kuya Takami, Tomonari Furukawa

Abstract:

Tire noise has a significant impact on ride quality and vehicle interior comfort, even at low frequency. Reduction of tire noise is especially important due to strict state and federal environmental regulations. The primary sources of tire noise are the low frequency structure-borne noise and the noise that originates from the release of trapped air between the tire tread and road surface during each revolution of the tire. The frequency response of the tire changes at low and high frequency. At low frequency, the tension and bending moment become dominant, while the internal structure and local deformation become dominant at higher frequencies. Here, we analyze tire response in terms of deformation and rolling velocity at low revolution frequency. An Abaqus FEA finite element model is used to calculate the static and dynamic response of a rolling tire under different rolling conditions. The natural frequencies and mode shapes of a deformed tire are calculated with the FEA package where the subspace-based steady state dynamic analysis calculates dynamic response of tire subjected to harmonic excitation. The analysis was conducted on the dynamic response at the road (contact point of tire and road surface) and side nodes of a static and rolling tire when the tire was excited with 200 N vertical load for a frequency ranging from 20 to 200 Hz. The results show that frequency has little effect on tire deformation up to 80 Hz. But between 80 and 200 Hz, the radial and lateral components of displacement of the road and side nodes exhibited significant oscillation. For the static analysis, the fluctuation was sharp and frequent and decreased with frequency. In contrast, the fluctuation was periodic in nature for the dynamic response of the rolling tire. In addition to the dynamic analysis, a steady state rolling analysis was also performed on the tire traveling at ground velocity with a constant angular motion. The purpose of the computation was to demonstrate the effect of rotating motion on deformation and rolling velocity with respect to a fixed Newtonian reference point. The analysis showed a significant variation in deformation and rolling velocity due to centrifugal and Coriolis acceleration with respect to a fixed Newtonian point on ground.

Keywords: natural frequency, rotational motion, steady state rolling, subspace-based steady state dynamic analysis

Procedia PDF Downloads 353

Authors: Farhad Asadi, Mohammad Javad Mollakazemi

Abstract:

In this paper, Bayesian online inference in models of data series are constructed by change-points algorithm, which separated the observed time series into independent series and study the change and variation of the regime of the data with related statistical characteristics. variation of statistical characteristics of time series data often represent separated phenomena in the some dynamical system, like a change in state of brain dynamical reflected in EEG signal data measurement or a change in important regime of data in many dynamical system. In this paper, prediction algorithm for studying change point location in some time series data is simulated. It is verified that pattern of proposed distribution of data has important factor on simpler and smother fluctuation of hazard rate parameter and also for better identification of change point locations. Finally, the conditions of how the time series distribution effect on factors in this approach are explained and validated with different time series databases for some dynamical system.

Keywords: time series, fluctuation in statistical characteristics, optimal learning, change-point algorithm

Procedia PDF Downloads 411

Authors: Masoud Abedi, Abbas Malekpour, Peter Luksch, Mohammad Reza Mojtabaei

Abstract:

The use of short texts in communication has been greatly increasing in recent years. Applying different languages in short texts has led to compulsory use of Unicode strings. These strings need twice the space of common strings, hence, applying algorithms of compression for the purpose of accelerating transmission and reducing cost is worthwhile. Nevertheless, other compression methods like gzip, bzip2 or PAQ due to high overhead data size are not appropriate. The Huffman algorithm is one of the rare algorithms effective in reducing the size of short Unicode strings. In this paper, an algorithm is proposed for compression of very short Unicode strings. At first, every new character to be sent to a destination is inserted in the proposed mapping table. At the beginning, every character is new. In case the character is repeated for the same destination, it is not considered as a new character. Next, the new characters together with the mapping value of repeated characters are arranged through a specific technique and specially formatted to be transmitted. The results obtained from an assessment made on a set of short Persian and Arabic strings indicate that this proposed algorithm outperforms the Huffman algorithm in size reduction.

Keywords: Algorithms, Data Compression, Decoding, Encoding, Huffman Codes, Text Communication

Procedia PDF Downloads 334

Authors: Antonin Ponsich, Eric Alfredo Rincon Garcia, Roman Anselmo Mora Gutierrez, Miguel Angel Gutierrez Andrade, Sergio Gerardo De Los Cobos Silva, Pedro Lara Velzquez

Abstract:

The electoral zone design problem consists in redrawing the boundaries of legislative districts for electoral purposes in such a way that federal or state requirements are fulfilled. In Mexico, this process has been historically carried out by the National Electoral Institute (INE), by optimizing an integer nonlinear programming model, in which population equality and compactness of the designed districts are considered as two conflicting objective functions, while contiguity is included as a hard constraint. The solution technique used by the INE is a Simulated Annealing (SA) based algorithm, which handles the multi-objective nature of the problem through an aggregation function. The present work represents the first intent to apply a classical Multi-Objective Evolutionary Algorithm (MOEA), the second version of the Non-dominated Sorting Genetic Algorithm (NSGA-II), to this hard combinatorial problem. First results show that, when compared with the SA algorithm, the NSGA-II obtains promising results. The MOEA manages to produce well-distributed solutions over a wide-spread front, even though some convergence troubles for some instances constitute an issue, which should be corrected in future adaptations of MOEAs to the redistricting problem.

Keywords: multi-objective optimization, NSGA-II, redistricting, zone design problem

Procedia PDF Downloads 353

Authors: N. Larbi, F. Debbat

Abstract:

Wireless communication systems have changed dramatically and shown spectacular evolution over the past two decades. These radio technologies are engaged in a quest endless high-speed transmission coupled to a constant need to improve transmission quality. Various radio communication systems being developed use code division multiple access (CDMA) technique. This work analyses a hybrid honey bees mating optimization algorithm (HBMO) applied to multiuser detection (MuD) in CDMA communication systems. The HBMO is a swarm-based optimization algorithm, which simulates the mating process of real honey bees. We apply a hybridization of HBMO with simulated annealing (SA) in order to improve the solution generated by the HBMO. Simulation results show that the detection based on Hybrid HBMO, in term of bit error rate (BER), is viable option when compared with the classic detectors from literature under Rayleigh flat fading channel.

Keywords: BER, DS-CDMA multiuser detection, genetic algorithm, hybrid HBMO, simulated annealing

Procedia PDF Downloads 415

Authors: Marziyeh Bahrami, Hamed Pahlevan Hsseini, Behnam Ghamami, Arman Alvanpour, Hamed Ezzati, Amir Salar Sadeghi

Abstract:

One of the ways to increase the efficiency of services in the system of agents and, of course, in the world of cloud computing, is to use virtualization techniques. The aim of this research is to create changes in cloud computing services that will reduce as much as possible the energy consumption related to the migration of virtual machines and, in some way, the energy related to the allocation of resources and reduce the amount of pollution. So far, several methods have been proposed to increase the efficiency of cloud computing services in order to save energy in the cloud environment. The method presented in this article tries to prevent energy consumption by data centers and the subsequent production of carbon and biological pollutants as much as possible by increasing the efficiency of cloud computing services. The results show that the proposed algorithm, using the improvement in virtualization techniques and with the help of a genetic algorithm, improves the efficiency of cloud services in the matter of migrating virtual machines and finally saves consumption. becomes energy.

Keywords: consumption reduction, cloud computing, genetic algorithm, live migration, virtual Machine

Procedia PDF Downloads 38

Authors: El Asnaoui Khalid, Aksasse Brahim, Ouanan Mohammed

Abstract:

In this paper, we are interested in the problem of finding similar images in a large database. For this purpose we propose a new algorithm based on a combination of the 2-D histogram intersection in the HSV space and statistical moments. The proposed histogram is based on a 3x3 window and not only on the intensity of the pixel. This approach can overcome the drawback of the conventional 1-D histogram which is ignoring the spatial distribution of pixels in the image, while the statistical moments are used to escape the effects of the discretisation of the color space which is intrinsic to the use of histograms. We compare the performance of our new algorithm to various methods of the state of the art and we show that it has several advantages. It is fast, consumes little memory and requires no learning. To validate our results, we apply this algorithm to search for similar images in different image databases.

Keywords: 2-D histogram, statistical moments, indexing, similarity distance, histograms intersection

Procedia PDF Downloads 434

Authors: Niharika Verma, Sandeep Santosh

Abstract:

DOA technique is a localization technique used in the communication field. Various algorithms have been developed for direction of arrival estimation like MUSIC, ROOT MUSIC, etc. These algorithms depend on various parameters like antenna array elements, number of snapshots and various others. Basically the MUSIC spectrum is evaluated and peaks obtained are considered as the angle of arrivals. The angles evaluated using this process depends on the scanning interval chosen. The accuracy of the results obtained depends on the coarseness of the interval chosen. In this paper, golden section search is applied to the MUSIC algorithm and therefore, more accurate results are achieved. Initially the coarse DOA estimations is done using the MUSIC algorithm in the range -90 to 90 degree at the interval of 10 degree. After the peaks obtained then fine DOA estimation is done using golden section search. Also, the partitioning method is applied to estimate the number of signals incident on the antenna array. Dependency of the algorithm on the number of snapshots is also being explained. Hence, the accurate results are being determined using this algorithm.

Keywords: Direction of Arrival (DOA), golden section search, MUSIC, number of snapshots

Procedia PDF Downloads 433

Authors: Ingrid Argote, John Archila, Marcelo Becker

Abstract:

In agriculture, intelligent systems applications have generated great advances in automating some of the processes in the production chain. In order to improve the efficiency of those systems is proposed a vision system to estimate the amount of fruits in sweet orange trees. This work presents a system proposal using capture of thermal images and fuzzy logic. A bibliographical review has been done to analyze the state-of-the-art of the different systems used in fruit recognition, and also the different applications of thermography in agricultural systems. The algorithm developed for this project uses the metrics of the fuzzines parameter to the contrast improvement and segmentation of the image, for the counting algorith m was used the Hough transform. In order to validate the proposed algorithm was created a bank of images of sweet orange Citrus (L.) Osbeck acquired in the Maringá Farm. The tests with the algorithm Indicated that the variation of the tree branch temperature and the fruit is not very high, Which makes the process of image segmentation using this differentiates, This Increases the amount of false positives in the fruit counting algorithm. Recognition of fruits isolated with the proposed algorithm present an overall accuracy of 90.5 % and grouped fruits. The accuracy was 81.3 %. The experiments show the need for a more suitable hardware to have a better recognition of small temperature changes in the image.

Keywords: Agricultural systems, Citrus, Fuzzy logic, Thermal images.

Procedia PDF Downloads 217

Authors: Mehmet Yildiz, Mehmet Kale

Abstract:

The primary aim of the present study was to identify the bilateral balance asymmetries when comparing the dominant (DL) vs. the non-dominant leg (NDL) in the collegian soccer players. The secondary aim was to compare the inter-limb asymmetry index (ASI) when differentiating by kicking preference (right-dominant vs. left-dominant). 34 right-dominant leg (RightDL) (age:21.12±1.85, height:174.50±5.18, weight:69.42±6.86) and 23 left-dominant leg (LeftDL), (age:21.70±2.03, height:176.2±6.27, weight:68.73±5.96) collegian football players were tested for bilateral static and dynamic balance. Balance ability was assessed by measuring centre of pressure deviation on a single leg. Single leg static and dynamic balance scores and inter-limb asymmetry index (ASI) were determined. Student t tests were used for the comparison of dominant and nondominant leg balance scores and RightDL and LeftDL football players’ inter-limb asymmetry index of the balance scores. The results showed that there were significant differences in the dynamic balance scores in favour of the nondominant leg, (DL:738±211 vs. NDL:606±226, p < 0.01). Also, it has been seen that LeftDL players have significantly higher inter-limb asymmetry index when compared with rightDL players for both static (rightDL:-7.07±94.91 vs. leftDL:-183.19±354.05, p < 0.01) and dynamic (rightDL: 1.73±49.65 vs. leftDL:27.08±23.34, p < 0.05) balance scores. In conclusion, bilateral dynamic balance asymmetries may be affected using single leg predominantly in the mobilization workouts. Because of having higher inter-limb asymmetry index, left-dominant leg players may be screened and trained to minimize balance asymmetry.

Keywords: bilateral balance, asymmetries, dominant leg, leg preference

Procedia PDF Downloads 406

Authors: Sanjay Kumar Parjapati, Ajai Jain

Abstract:

This paper presents optimization of makespan for ‘n’ jobs and ‘m’ machines flexible job shop scheduling problem with sequence dependent setup time using genetic algorithm (GA) approach. A restart scheme has also been applied to prevent the premature convergence. Two case studies are taken into consideration. Results are obtained by considering crossover probability (pc = 0.85) and mutation probability (pm = 0.15). Five simulation runs for each case study are taken and minimum value among them is taken as optimal makespan. Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order.

Keywords: flexible job shop, genetic algorithm, makespan, sequence dependent setup times

Procedia PDF Downloads 315

Authors: Vani Singhal, Jitendra Parmar, Satyendra Singh Chouhan

Abstract:

Unseen class discovery has now become an important part of a machine-learning algorithm to judge new classes. Unseen classes are the classes on which the machine learning model is not trained on. With the advancement in technology and AI replacing humans, the amount of data has increased to the next level. So while implementing a model on real-world examples, we come across unseen new classes. Our aim is to find the number of unseen classes by using a hierarchical-based active learning algorithm. The algorithm is based on hierarchical clustering as well as active sampling. The number of clusters that we will get in the end will give the number of unseen classes. The total clusters will also contain some clusters that have unseen classes. Instead of first discovering unseen classes and then finding their number, we directly calculated the number by applying the algorithm. The dataset used is for intent classification. The target data is the intent of the corresponding query. We conclude that when the machine learning model will encounter real-world data, it will automatically find the number of unseen classes. In the future, our next work would be to label these unseen classes correctly.

Keywords: active sampling, hierarchical clustering, open world learning, unseen class discovery

Procedia PDF Downloads 156