Efficient Design of Bi-circular Patch Antenna for 5G Communication with Mathematical Calculations for Resonant Frequencies

Wireless Personal Communications - In this paper the conventional circular patch has been reshaped by two circular arcs with the FR4 Epoxy material for substrate. This is supported by the...     

A bat-neural network multi-agent system (BNNMAS) for stock price prediction: Case study of DAX stock price

Creating an intelligent system that can accurately predict stock price in a robust way has always been a subject of great interest for many investors and financial analysts. Predicting future trends of financial markets is more remarkable these days especially after the recent global financial crisis. So traders who access to a powerful engine for extracting helpful information throw raw data can meet the success. In this paper we propose a new intelligent model in a multi-agent framework called bat-neural network multi-agent system (BNNMAS) to predict stock price. The model performs in a four layer multi-agent framework to predict eight years of DAX stock price in quarterly periods. The capability of BNNMAS is evaluated by applying both on fundamental and technical DAX stock price data and comparing the outcomes with the results of other methods such as genetic algorithm neural network (GANN) and some standard models like generalized regression neural network (GRNN), etc. The model tested for predicting DAX stock price a period of time that global financial crisis was faced to economics. The results show that BNNMAS significantly performs accurate and reliable, so it can be considered as a suitable tool for predicting stock price specially in a long term periods.     

Light gradient boosting machine with optimized hyperparameters for identification of malicious access in IoT network

In this paper, an advanced and optimized Light Gradient Boosting Machine (LGBM) technique is proposed to identify the intrusive activities in the Internet of Things (IoT) network. The followings are the major contributions: i) An optimized LGBM model has been developed for the identification of malicious IoT activities in the IoT network; ii) An efficient evolutionary optimization approach has been adopted for finding the optimal set of hyper-parameters of LGBM for the projected problem. Here, a Genetic Algorithm (GA) with k-way tournament selection and uniform crossover operation is used for efficient exploration of hyper-parameter search space; iii) Finally, the performance of the proposed model is evaluated using state-of-the-art ensemble learning and machine learning-based model to achieve overall generalized performance and efficiency. Simulation outcomes reveal that the proposed approach is superior to other considered methods and proves to be a robust approach to intrusion detection in an IoT environment.     

Extreme learning machine and bayesian optimization-driven intelligent framework for IoMT cyber-attack detection

The Journal of Supercomputing - The Internet of Medical Things (IoMT) is a bionetwork of allied medical devices, sensors, wearable biosensor devices, etc. It is gradually reforming the healthcare...     

Optimization of process variables in drilling of carbon fiber reinforced plastics using various multi criteria decision making approaches

Carbon fiber-reinforced polymers are one of the lightweight materials used in structural design due to their exceptional mechanical performances. The drilling operation is indispensable as it facilitates the assembling of various manufactured components. However, drilling of fibrous laminates is deemed difficult in comparison to the traditional metals because of the anisotropic and non-homogeneous nature. The present work addresses the parametric effect on the drilled hole delamination and further reduces it with an optimal combination of parameters for multi-objectives using different multi-criterion decision-making techniques. Initially, the response surface-based regression model of delamination as a function of three static inputs has been developed, further revised with induced thrust as well as mean torque for the improvisation of the prediction capability. Finally, for the overall improvement, a decision-making model has been used that includes grey relation analysis, technique for order performance by similarity to ideal solution, and VIšekriterijumsko Kompromisno Rangiranje method. The delamination was found to be minimum at a low drill point angle (100°), high spindle rotation (2150 min⁻¹ ), and low feed rate (0.025 mm/rev) due to reduced thrust force. The mean absolute prediction error was significantly improved considering root mean square torque rather than axial thrust with process variables.     

Design and analysis of SSSC-based supplementary damping controller

Power-system stability improvement by a static synchronous series compensator (SSSC)-based damping controller is thoroughly investigated in this paper. The design problem of the proposed controller is formulated as an optimization problem, and real coded genetic algorithm (RCGA) is employed to search for the optimal controller parameters. Both local and remote signals with associated time delays are considered in the present study and a comparison has been made between the two signals. The performances of the proposed controllers are evaluated under different disturbances for both single-machine infinite-bus power system and multi-machine power system. Simulation results are presented and compared with a recently published modern heuristic optimization technique under various disturbances to show the effectiveness and robustness of the proposed approach.     

An improved load-balancing mechanism based on deadline failure recovery on GridSim

Grid computing has emerged a new field, distinguished from conventional distributed computing. It focuses on large-scale resource sharing, innovative applications and in some cases, high performance orientation. The Grid serves as a comprehensive and complete system for organizations by which the maximum utilization of resources is achieved. The load balancing is a process which involves the resource management and an effective load distribution among the resources. Therefore, it is considered to be very important in Grid systems. For a Grid, a dynamic, distributed load balancing scheme provides deadline control for tasks. Due to the condition of deadline failure, developing, deploying, and executing long running applications over the grid remains a challenge. So, deadline failure recovery is an essential factor for Grid computing. In this paper, we propose a dynamic distributed load-balancing technique called “Enhanced GridSim with Load balancing based on Deadline Failure Recovery” (EGDFR) for computational Grids with heterogeneous resources. The proposed algorithm EGDFR is an improved version of the existing EGDC in which we perform load balancing by providing a scheduling system which includes the mechanism of recovery from deadline failure of the Gridlets. Extensive simulation experiments are conducted to quantify the performance of the proposed load-balancing strategy on the GridSim platform. Experiments have shown that the proposed system can considerably improve Grid performance in terms of total execution time, percentage gain in execution time, average response time, resubmitted time and throughput. The proposed load-balancing technique gives 7 % better performance than EGDC in case of constant number of resources, whereas in case of constant number of Gridlets, it gives 11 % better performance than EGDC.     

Chaotic gravitational constants for the gravitational search algorithm

In a population-based meta-heuristic, the search process is divided into two main phases: exploration versus exploitation. In the exploration phase, a random behavior is fruitful to explore the search space as extensive as possible. In contrast, a fast exploitation toward the promising regions is the main objective of the latter phase. It is really challenging to find a proper balance between these two phases because of the stochastic nature of population-based meta-heuristic algorithms. The literature shows that chaotic maps are able to improve both phases. This work embeds ten chaotic maps into the gravitational constant (G) of the recently proposed population-based meta-heuristic algorithm called Gravitational Search Algorithm (GSA). Also, an adaptive normalization method is proposed to transit from the exploration phase to the exploitation phase smoothly. As case studies, twelve shifted and biased benchmark functions evaluate the performance of the proposed chaos-based GSA algorithms in terms of exploration and exploitation. A statistical test called Wilcoxon rank-sum is done to judge about the significance of the results as well. The results demonstrate that sinusoidal map is the best map for improving the performance of GSA significantly.     

Transducer invariant multi-class fault classification in a rotor-bearing system using support vector machines

Faults in a rotor-bearing system due to bearings and unbalance have been classified using support vector machines (SVMs). Vibration signals on a rotor-bearing system were measured simultaneously at five different rotating speeds using seven transducers. The most sensitive feature of the vibration signals has been determined using compensation distance evaluation technique. Multi-class SVMs classification algorithm was then implemented for classification of the faults by considering SVMs created by the possible combinations of the most two sensitive features for each type of fault. By using optimal SVM parameters, the effective location of transducer among seven transducers for best classification of the faults has been investigated and found that any transducer provides a classification of 75% or better and this classification rate increases when more transducers are considered. This paper provides a robust SVM based technique using only time domain data without any additional preprocessing for classifying bearing and unbalance faults.