Modified MMS: Minimization Approach for Model Subset Selection

Considering the recent developments in the digital environment,ensuring a higher level of security for networking systems is imperative.Many security approaches are being constantly developed to protect against evolving threats.An ensemble model for the intrusion classification system yielded promising results based on the knowledge of many prior studies.This research work aimed to create a more diverse and effective ensemble model.To this end,selected six classification models,Logistic Regression(LR),Naive Bayes(NB),K-Nearest Neighbor(KNN),Decision Tree(DT),Support Vector Machine(SVM),and Random Forest(RF)from existing study to run as independent models.Once the individual models were trained,a Correlation-Based Diversity Matrix(CDM)was created by determining their closeness.The models for the ensemble were chosen by the proposed Modified Minimization Approach for Model Subset Selection(Modified-MMS)from Lower triangular-CDM(L-CDM)as input.The proposed algorithm performance was assessed using the Network Security Laboratory—Knowledge Discovery in Databases(NSL-KDD)dataset,and several performance metrics,including accuracy,precision,recall,and F1-score.By selecting a diverse set of models,the proposed system enhances the performance of an ensemble by reducing overfitting and increasing prediction accuracy.The proposed work achieved an impressive accuracy of 99.26%,using only two classification models in an ensemble,which surpasses the performance of a larger ensemble that employs six classification models.

An Optimized Test Case Minimization Technique Using Genetic Algorithm for Regression Testing

Regression testing is a widely used approach to confirm the correct functionality of the software in incremental development.The use of test cases makes it easier to test the ripple effect of changed requirements.Rigorous testingmay help in meeting the quality criteria that is based on the conformance to the requirements as given by the intended stakeholders.However,a minimized and prioritized set of test cases may reduce the efforts and time required for testingwhile focusing on the timely delivery of the software application.In this research,a technique named Test Reduce has been presented to get a minimal set of test cases based on high priority to ensure that the web applicationmeets the required quality criteria.A new technique TestReduce is proposed with a blend of genetic algorithm to find an optimized and minimal set of test cases.The ultimate objective associated with this study is to provide a technique that may solve the minimization problem of regression test cases in the case of linked requirements.In this research,the 100-Dollar prioritization approach is used to define the priority of the new requirements.

Low-complexity iterative equalization for OTFS based on alternating minimization

To achieve robust communication in high mobility scenarios,an iterative equalization algorithm based on alternating minimization(AM)is proposed for the orthogonal time frequency space(OTFS)system.The algorithm approximates the equalization problem to a convex function optimization problem in the real-valued domain and solves the problem iteratively using the AM algorithm.In the iterative process,the complexity of the proposed algorithm is reduced further based on the study of the cyclic structure and sparse property of the OTFS channel matrix in the delay-Doppler(DD)domain.The new method for OTFS is simulated and verified in a high-speed mobile scenario and the results show that the proposed equalization algorithm has excellent bit error rate performance with low complexity.

Minimization of Electric Power Losses on 132 kV and 220 kV Uganda Electricity Transmission Lines

The classical minimization of power losses in transmission lines is dominated by artificial intelligence techniques, which do not guarantee global optimum amidst local minima. Revolutionary and evolutionary techniques are encumbered with sophisticated transformations, which weaken the techniques. Power loss minimization is crucial to the efficient design and operation of power transmission lines. Minimization of losses is one way to meet steady grid supply, especially at peak demand. Thus, this paper has presented a gradient technique to obtain optimal variables and values from the power loss model, which efficiently minimizes power losses by modifying the traditional power loss model that combines Ohm and Corona losses. Optimality tests showed that the unmodified model does not support the minimization of power losses on transmission lines as the Hessian matrix portrayed the maximization of power losses. However, the modified model is consistent with the gradient method of optimization, which yielded optimum variables and values from the power loss model developed in this study. The unmodified (modified) models for Bujagali-Kawanda 220 kV and Masaka West-Mbarara North 132 kV transmission lines in Uganda showed maximum power losses of 0.406 (0.391) and 0.452 (0.446) kW/km/phase respectively. These results indicate that the modified model is superior to the unmodified model in minimizing power losses in the transmission lines and should be implemented for the efficient design and operation of power transmission lines within and outside Uganda for the same transmission voltages.

A Note on Sharp Affine Poincaré-Sobolev Inequalities and Exact in Minimization of Zhang’s Energy on Bounded Variation and Exactness

As for the affine energy, Edir Junior and Ferreira Leite establish the existence of minimizers for particular restricted subcritical and critical variational issues on BV(Ω). Similar functionals exhibit deeper weak* topological traits including lower semicontinuity and affine compactness, and their geometry is non-coercive. Our work also proves the result that extremal functions exist for certain affine Poincaré-Sobolev inequalities.

Optimal Placement and Sizing of Distributed Generations for Power Losses Minimization Using PSO-Based Deep Learning Techniques

The integration of distributed generations (DGs) into distribution systems (DSs) is increasingly becoming a solution for compensating for isolated local energy systems (ILESs). Additionally, distributed generations are used for self-consumption with excess energy injected into centralized grids (CGs). However, the improper sizing of renewable energy systems (RESs) exposes the entire system to power losses. This work presents an optimization of a system consisting of distributed generations. Firstly, PSO algorithms evaluate the size of the entire system on the IEEE bus 14 test standard. Secondly, the size of the system is allocated using improved Particles Swarm Optimization (IPSO). The convergence speed of the objective function enables a conjecture to be made about the robustness of the proposed system. The power and voltage profile on the IEEE 14-bus standard displays a decrease in power losses and an appropriate response to energy demands (EDs), validating the proposed method.

Integral Global Minimization of Constrained Problems with Discontinuous Penalty Functions

A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained and penalized minimization problem were investigated. A nonsequential algorithm was proposed. Numerical examples were given to illustrate the effectiveness of the algorithm.

A multiplicative Gauss-Newton minimization algorithm:Theory and application to exponential functions

Multiplicative calculus(MUC)measures the rate of change of function in terms of ratios,which makes the exponential functions significantly linear in the framework of MUC.Therefore,a generally non-linear optimization problem containing exponential functions becomes a linear problem in MUC.Taking this as motivation,this paper lays mathematical foundation of well-known classical Gauss-Newton minimization(CGNM)algorithm in the framework of MUC.This paper formulates the mathematical derivation of proposed method named as multiplicative Gauss-Newton minimization(MGNM)method along with its convergence properties.The proposed method is generalized for n number of variables,and all its theoretical concepts are authenticated by simulation results.Two case studies have been conducted incorporating multiplicatively-linear and non-linear exponential functions.From simulation results,it has been observed that proposed MGNM method converges for 12972 points,out of 19600 points considered while optimizing multiplicatively-linear exponential function,whereas CGNM and multiplicative Newton minimization methods converge for only 2111 and 9922 points,respectively.Furthermore,for a given set of initial value,the proposed MGNM converges only after 2 iterations as compared to 5 iterations taken by other methods.A similar pattern is observed for multiplicatively-non-linear exponential function.Therefore,it can be said that proposed method converges faster and for large range of initial values as compared to conventional methods.

Nonmonotone Adaptive Trust Region Algorithms with Indefinite Dogleg Path for Unconstrained Minimization

In this paper, we combine the nonmonotone and adaptive techniques with trust region method for unconstrained minimization problems. We set a new ratio of the actual descent and predicted descent. Then, instead of the monotone sequence, the nonmonotone sequence of function values are employed. With the adaptive technique, the radius of trust region △k can be adjusted automatically to improve the efficiency of trust region methods. By means of the Bunch-Parlett factorization, we construct a method with indefinite dogleg path for solving the trust region subproblem which can handle the indefinite approximate Hessian Bk. The convergence properties of the algorithm are established. Finally, detailed numerical results are reported to show that our algorithm is efficient.

Thermodynamic analysis of combined reforming process using Gibbs energy minimization method: In view of solid carbon formation

Thermodynamic analysis was applied to study combined partial oxidation and carbon dioxide reforming of methane in view of carbon formation. The equilibrium calculations employing the Gibbs energy minimization were performed upon wide ranges of pressure （1-25 atm）, temperature （600-1300 K）, carbon dioxide to methane ratio （0-2） and oxygen to methane ratio （0-1）. The thermodynamic results were compared with the results obtained over a Ru supported catalyst. The results revealed that by increasing the reaction pressure methane conversion decreased. Also it was found that the atmospheric pressure is the preferable pressure for both dry reforming and partial oxidation of methane and increasing the temperature caused increases in both activity of carbon and conversion of methane. The results clearly showed that the addition of O2 to the feed mixture could lead to a reduction of carbon deposition.

Color Correction for Multi-view Video Using Energy Minimization of View Networks

Systems using numerous cameras are emerging in many fields due to their ease of production and reduced cost, and one of the fields where they are expected to be used more actively in the near future is in image-based rendering （IBR）. Color correction between views is necessary to use multi-view systems in IBR to make audiences feel comfortable when views are switched or when a free viewpoint video is displayed. Color correction usually involves two steps： the first is to adjust camera parameters such as gain, brightness, and aperture before capture, and the second is to modify captured videos through image processing. This paper deals with the latter, which does not need a color pattern board. The proposed method uses scale invariant feature transform （SIFT） to detect correspondences, treats RGB channels independently, calculates lookup tables with an energy-minimization approach, and corrects captured video with these tables. The experimental results reveal that this approach works well.

Continuous-time System Identification with Nuclear Norm Minimization and GPMF-based Subspace Method

To improve the accuracy and effectiveness of continuous-time(CT) system identification, this paper introduces a novel method that incorporates the nuclear norm minimization(NNM) with the generalized Poisson moment functional(GPMF)based subspace method. The GPMF algorithm provides a simple linear mapping for subspace identification without the timederivatives of the input and output measurements to avoid amplification of measurement noise, and the NNM is a heuristic convex relaxation of the rank minimization. The Hankel matrix with minimized nuclear norm is used to determine the model order and to avoid the over-parameterization in subspace identification method(SIM). Furthermore, the algorithm to solve the NNM problem in CT case is also deduced with alternating direction methods of multipliers(ADMM). Lastly, two numerical examples are presented to evaluate the performance of the proposed method and to show the advantages of the proposed method over the existing methods.

MARVEL:Multi-Agent Reinforcement Learning for VANET Delay Minimization

In urban Vehicular Ad hoc Networks(VANETs),high mobility of vehicular environment and frequently changed network topology call for a low delay end-to-end routing algorithm.In this paper,we propose a Multi-Agent Reinforcement Learning(MARL)based decentralized routing scheme,where the inherent similarity between the routing problem in VANET and the MARL problem is exploited.The proposed routing scheme models the interaction between vehicles and the environment as a multi-agent problem in which each vehicle autonomously establishes the communication channel with a neighbor device regardless of the global information.Simulation performed in the 3GPP Manhattan mobility model demonstrates that our proposed decentralized routing algorithm achieves less than 45.8 ms average latency and high stability of 0.05%averaging failure rate with varying vehicle capacities.

Variance minimization for continuous-time Markov decision processes: two approaches

This paper studies the limit average variance criterion for continuous-time Markov decision processes in Polish spaces. Based on two approaches, this paper proves not only the existence of solutions to the variance minimization optimality equation and the existence of a variance minimal policy that is canonical, but also the existence of solutions to the two variance minimization optimality inequalities and the existence of a variance minimal policy which may not be canonical. An example is given to illustrate all of our conditions.

Delay Minimization for Intelligent Reflecting Surface Assisted Federated Learning

Federated learning(FL), which allows multiple mobile devices to cooperatively train a machine learning model without sharing their data with the central server, has received widespread attention.However, the process of FL involves frequent communications between the server and mobile devices,which incurs a long latency. Intelligent reflecting surface(IRS) provides a promising technology to address this issue, thanks to its capacity to reconfigure the wireless propagation environment. In this paper, we exploit the advantage of IRS to reduce the latency of FL. Specifically, we formulate a latency minimization problem for the IRS assisted FL system, by optimizing the communication resource allocations including the devices’ transmit-powers, the uploading time, the downloading time, the multi-user decomposition matrix and the phase shift matrix of IRS. To solve this non-convex problem, we propose an efficient algorithm which is based on the Block Coordinate Descent(BCD) and the penalty difference of convex(DC) algorithm to compute the solution. Numerical results are provided to validate the efficiency of our proposed algorithm and demonstrate the benefit of deploying IRS for reducing the latency of FL. In particular, the results show that our algorithm can outperform the baseline of Majorization-Minimization(MM) algorithm with the fixed transmit-power by up to 30%.

STAP method based on atomic norm minimization with array amplitude-phase error calibration

In this paper,a space-time adaptive processing(STAP)method is proposed for the airborne radar with the array amplitude-phase error considered,which is based on atomic norm minimization(ANM).In the conventional ANM-based STAP method,the influence of the array amplitude-phase error is not considered and restrained,which inevitably causes performance deterioration.To solve this problem,the array amplitude-phase error is firstly estimated.Then,by pre-estimating the array amplitude-phase error information,a modified ANM model is built,in which the array amplitude-phase error factor is separated from the clutter response and the clutter covariance matrix(CCM)to improve the estimation accuracy of the CCM.To prove that the atomic norm theory is applicable in the presence of the array amplitude-phase error,the clutter sparsity is analyzed in this paper.Meanwhile,simulation results demonstrate that the proposed method is superior to the state-of-the-art STAP method.Moreover,the measured data is used to verify the effectiveness of the proposed method.

Implementation of Radial Basis Function Artificial Neural Network into an Adaptive Equivalent Consumption Minimization Strategy for Optimized Control of a Hybrid Electric Vehicle

Continued increases in the emission of greenhouse gases by passenger vehicles have accelerated the production of hybrid electric vehicles. With this increase in production, there has been a parallel demand for continuously improving strategies of hybrid electric vehicle control. The goal of an ideal control strategy is to maximize fuel economy while minimizing emissions. Methods exist by which the globally optimal control strategy may be found. However, these methods are not applicable in real-world driving applications since these methods require a priori knowledge of the upcoming drive cycle. Real-time control strategies use the global optimal as a benchmark against which performance can be evaluated. The goal of this work is to use a previously defined strategy that has been shown to closely approximate the global optimal and implement a radial basis function (RBF) artificial neural network (ANN) that dynamically adapts the strategy based on past driving conditions. The strategy used is the Equivalent Consumption Minimization Strategy (ECMS), which uses an equivalence factor to define the control strategy and the power train component torque split. An equivalence factor that is optimal for a single drive cycle can be found offline with a priori knowledge of the drive cycle. The RBF-ANN is used to dynamically update the equivalence factor by examining a past time window of driving characteristics. A total of 30 sets of training data (drive cycles) are used to train the RBF-ANN. For the majority of drive cycles examined, the RBF-ANN implementation is shown to produce fuel economy values that are within ±2.5% of the fuel economy obtained with the optimal equivalence factor. The advantage of the RBF-ANN is that it does not require a priori drive cycle knowledge and is able to be implemented in real-time while meeting or exceeding the performance of the optimal ECMS. Recommendations are made on how the RBF-ANN could be improved to produce better results across a greater array of driving conditions.

Comparative Study of Conventional, Fuzzy Logic and Neural PID Speed Controllers with Torque Ripple Minimization for an Axial Magnetic Flux Switched Reluctance Motor

Three speed controllers for an axial magnetic flux switched reluctance motor with only one stator, are described and experimentally tested. As it is known, when current pulses are imposed in their windings, high ripple torque is obtained. In order to reduce this ripple, a control strategy with modified current shapes is proposed. A workbench consisting of a machine prototype and the control system based on a microcontroller was built. These controllers were: a conventional PID, a fuzzy logic PID and a neural PID type. From experimental results, the effective reduction of the torque ripple was confirmed and the performance of the controllers was compared.

SAR image de-noising based on texture strength and weighted nuclear norm minimization

As synthetic aperture radar（SAR） has been widely used nearly in every field, SAR image de-noising became a very important research field. A new SAR image de-noising method based on texture strength and weighted nuclear norm minimization（WNNM） is proposed. To implement blind de-noising, the accurate estimation of noise variance is very important. So far, it is still a challenge to estimate SAR image noise level accurately because of the rich texture. Principal component analysis（PCA） and the low rank patches selected by image texture strength are used to estimate the noise level. With the help of noise level, WNNM can be expected to SAR image de-noising. Experimental results show that the proposed method outperforms many excellent de-noising algorithms such as Bayes least squares-Gaussian scale mixtures（BLS-GSM） method, non-local means（NLM） filtering in terms of both quantitative measure and visual perception quality.

A FUNCTION MINIMIZATION CALCULATION OF CYCLONE 10 MAGNETIC FIELDS

By app(?)ing function minimization calculation method, two function expressions are used to simulate the magnetic field measured for cyclotron Cyclone 10 in azimuth and radius The numerical fitting curves are consistent with magnetic field measured. In most pl(?)es, the accuracies are several thousandth, except those errors to be pointed out in paper.