A Comparative Study of Meta-Heuristic and Conventional Search in Optimization of Multi-Dimensional Feature Selection

Algorithmic – based search approach is ineffective at addressing the problem of multi-dimensional feature selection for document categorization. This study proposes the use of meta heuristic based search approach for optimal feature selection. Elephant optimization (EO) and Ant Colony optimization (ACO) algorithms coupled with Naïve Bayes (NB), Support Vector Machin (SVM), and J48 classifiers were used to highlight the optimization capability of meta-heuristic search for multi-dimensional feature selection problem in document categorization. In addition, the performance results for feature selection using the two meta-heuristic based approaches (EO and ACO) were compared with conventional Best First Search (BFS) and Greedy Stepwise (GS) algorithms on news document categorization. The comparative results showed that global optimal feature subsets were attained using adaptive parameters tuning in meta-heuristic based feature selection optimization scheme. In addition, the selected number of feature subsets were minimized dramatically for document classification.

Devising a method for measuring the motion parameters of industrial equipment in the quarry using adaptive parameters of a video sequence

The method and structural scheme of an information-measuring system for determining the parameters of objects' movements (technological equipment in the quarry for extracting block natural stone) have been proposed. A distinctive feature of time video sequences containing images of measured objects is their adaptation and adjustment in accordance with the intensity of movement and accuracy requirements for measurement results. Structural and software-algorithmic methods were also applied for improving the accuracy of measurements of motion parameters, namely: complexation of two measuring channels and exponential smoothing of digital references. One of the measuring channels is based on a digital video camera, the second is based on an accelerometer mounted on an object and two integrators. Exponential smoothing makes it possible to take into consideration the previous countdowns of movement parameters with weight coefficients. That ensures accounting for the existing patterns of movement of the object and reducing the errors when measuring the parameters of movement by (1.4...1.6) times. The resulting solutions have been implemented in the form of an information and measurement system. The technological process of extracting blocks of natural stone in the quarry was experimentally investigated using a diamond-rope installation. Based on the contactless measurement of motion parameters, it is possible to ensure control over this process and improve the quality of blocks made of natural stone. Based on the experimental study of measurement errors, recommendations were given for the selection of adaptive parameters of a video sequence, namely the size of images and the value of the inter-frame interval. In addition, methods for the software-algorithmic processing of measuring information were selected, specifically exponential smoothing and averaging the coordinates of the contour of an object, measured in 30 adjacent lines of the image

A Novel Energy Management Control technique for PV-Battery System in DC Microgrids

This paper presents a new energy management control technique for PV-Battery system used in DC microgrids. The proposed control technique is performed based on a droop control algorithm that maintains DC-bus voltage in a desirable and required range adaptively. Tightly Regulating the bus voltage In the islanded mode of operation is very challenging. However, the proposed control method by introducing a nonlinear droop profile with four adaptive parameters shows its superiority. Adaptive parameters determined by the non-linear optimal algorithms. Tightly regulating the DC bus voltage during extensive changes in demand loads/sources within a DC Micro Grid is the responsibility of the adaptive parameters. Stability of the proposed method in the whole system for a very broad range of operating conditions are proved. Simulation results along with the experimental results verify the feasibility of the proposed approach while demonstrate its superior performance compared to the conventional control method.

Dynamic Routing and Spectrum Assignment based on the Availability of Consecutive Sub-channels in Flexible-grid Optical Networks

Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient use of spectrum by allocating integral multiple of basic bandwidth slot to the lightpath requests. In these networks, the constraint of keeping all the allocated slots together is added when deciding the routes for the requests. This constraint is called the contiguity constraint, which makes the routing and spectrum arrangement algorithms more challenging. In any network, the lightpath requests will arrive and depart dynamically and invariably lead to spectrum fragmentation. Hence network will have to reduce the maximum possible utilization as well as increased blocking probability. In this paper, we have presented an improvised Routing and Spectrum Assignment (RSA) algorithm using consecutive spectrum slots that leads to lesser fragmentation. It is evident from the results that the presented RSA algorithm uses adaptive parameters to reduce the blocking probability and fragmentation compared to the other algorithms reported in the recent past.

Dynamic Routing and Spectrum Assignment based on the Availability of Consecutive Sub-channels in Flexible-grid Optical Networks

Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient use of spectrum by allocating integral multiple of basic bandwidth slot to the lightpath requests. In these networks, the constraint of keeping all the allocated slots together is added when deciding the routes for the requests. This constraint is called the contiguity constraint, which makes the routing and spectrum arrangement algorithms more challenging. In any network, the lightpath requests will arrive and depart dynamically and invariably lead to spectrum fragmentation. Hence network will have to reduce the maximum possible utilization as well as increased blocking probability. In this paper, we have presented an improvised Routing and Spectrum Assignment (RSA) algorithm using consecutive spectrum slots that leads to lesser fragmentation. It is evident from the results that the presented RSA algorithm uses adaptive parameters to reduce the blocking probability and fragmentation compared to the other algorithms reported in the recent past.