Adaptive neuro-fuzzy inference system multi-objective optimization using the genetic algorithm/singular value decomposition method for modelling the discharge coefficient in rectangular sharp-crested side weirs

In the present article, the adaptive neuro-fuzzy inference system (ANFIS) is employed to model the discharge coefficient in rectangular sharp-crested side weirs. The genetic algorithm (GA) is used for the optimum selection of membership functions, while the singular value decomposition (SVD) method helps in computing the linear parameters of the ANFIS results section (GA/SVD-ANFIS). The effect of each dimensionless parameter on discharge coefficient prediction is examined in five different models to conduct sensitivity analysis by applying the above-mentioned dimensionless parameters. Two different sets of experimental data are utilized to examine the models and obtain the best model. The study results indicate that the model designed through GA/SVD-ANFIS predicts the discharge coefficient with a good level of accuracy (mean absolute percentage error?=?3.362 and root mean square error?=?0.027). Moreover, comparing this method with existing equations and the multi-layer perceptron–artificial neural network (MLP-ANN) indicates that the GA/SVD-ANFIS method has superior performance in simulating the discharge coefficient of side weirs.     

Indium selenide microrod films: chemical bath deposition from acidic bath

Films of indium selenide was deposited onto glass and indium tin oxide coated glass substrates in acidic medium using chemical bath deposition at room temperature. Indium sulphate and sodium selenosulphate were used as precursors of In³⁺ and Se^2?, respectively. The structural, surface morphological and optical properties of the deposited films were studied. Diffractograms in structural study revealed the deposited material is In₂Se₃ films. Controlled bath conditions resulted in the evolution of the In₂Se₃ microrod-like morphology. The optical band gap of the film was found to be 1.7 eV.     

Optimal Deep Learning Model Enabled Secure UAV Classification forIndustry 4.0

Emerging technologies such as edge computing, Internet of Things (IoT), 5G networks, big data, Artificial Intelligence (AI), and Unmanned Aerial Vehicles (UAVs) empower, Industry 4.0, with a progressive production methodology that shows attention to the interaction between machine and human beings. In the literature, various authors have focused on resolving security problems in UAV communication to provide safety for vital applications. The current research article presents a Circle Search Optimization with Deep Learning Enabled Secure UAV Classification (CSODL-SUAVC) model for Industry 4.0 environment. The suggested CSODL-SUAVC methodology is aimed at accomplishing two core objectives such as secure communication via image steganography and image classification. Primarily, the proposed CSODL-SUAVC method involves the following methods such as Multi-Level Discrete Wavelet Transformation (ML-DWT), CSO-related Optimal Pixel Selection (CSO-OPS), and signcryption-based encryption. The proposed model deploys the CSO-OPS technique to select the optimal pixel points in cover images. The secret images, encrypted by signcryption technique, are embedded into cover images. Besides, the image classification process includes three components namely, Super-Resolution using Convolution Neural Network (SRCNN), Adam optimizer, and softmax classifier. The integration of the CSO-OPS algorithm and Adam optimizer helps in achieving the maximum performance upon UAV communication. The proposed CSODL-SUAVC model was experimentally validated using benchmark datasets and the outcomes were evaluated under distinct aspects. The simulation outcomes established the supreme better performance of the CSODL-SUAVC model over recent approaches.     

Optoelectronic Recoded and Nonrecoded Trinary Signed-Digit Adder that uses Optical Correlation

A symbolic-substitution-based optical numeric processor that uses recoded and nonrecoded trinary signed-digit (TSD) number representations is proposed. Also, we propose new joint spatial encodings for the TSD numbers that reduce the symbolic-substitution computation rules involved in the processor. Optoelectronic implementation of the proposed recoded adder is feasible. Also, the nonrecoded TSD addition can be performed optically in two steps. Both the proposed recoded and nonrecoded adders are more compact than a recently reported modified signed-digit counterpart and use fewer correlators and spatial light modulators.     

A recursive state estimator in the presence of state inequality constraints

This paper proposes an optimal recursive estimator to estimate the states of a stochastic discrete time linear dynamic system when the states of the system are constrained with inequality constraints. The case when the constraints are strictly satisfied is treated independently from the case when some of the constraints are violated. For the first case, the well known Kalman filter estimator is used. In the second case, an algorithm which uses a series of successive orthogonalizations on the measurement subspaces is employed to obtain the optimal estimate. It is shown that the proposed estimator has several attractive properties such that it is an unbiased estimator. More importantly, compared to other estimator found in the literature, the proposed estimator needs less computational efforts, is numerically more stable and it leads to a smaller variance. To show the effectiveness of the proposed estimator, several simulation results are presented and discussed.     

A new scalable multicast routing algorithm for interactive real-time applications

Quality of service (QoS) provisioning generally assumes more than one QoS measure that implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay jitter, bandwidth, cost, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded delays and bounded delay variation among the source and all destinations while keeping overall cost of the multicast tree low. The main contribution of our work is a new strategy for constructing multiconstrained multicast trees. We first derive mathematically a new delay-variation estimation scheme and prove its efficiency. Thereafter, we propose a simple and competitive (in terms of running time) heuristic algorithm, for delay and delay variation constrained routing problem based on the proposed delay-variation estimation scheme and using the Extended Prim-Dijkstra tradeoffs’ algorithm. Our contribution also extends previous works in providing some properties and analyses of delay bounded paths satisfying delay variation constraints. Extensive simulation results show that our algorithm outperforms DVDMR in terms of multicast delay variation with the same time complexity as DVDMR.     

Absolute Stability of Nonlinear Systems with Two Additive Time-varying Delay Components

In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software.     

Absolute stability of nonlinear systems with two additive time-varying delay components

In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software.     

Integrating customer's preferences in the QFD planning process using a combined benchmarking and imprecise goal programming model

Quality function deployment (QFD) is a customer-oriented design tool for developing new or improved products to achieve higher customer satisfaction by integrating various functions of an organization. The engineering characteristics (ECs) affecting the product performances are designed to match the customer attributes (CAs). However, from the viewpoint of the QFD team, product design processes are performed in imprecise environments, and more than one factor must be taken into account in determining the target levels of ECs, especially the limited resources and increased market competition. This paper presents an imprecise goal programming (GP) approach to determine the optimum target levels of ECs in QFD for maximizing customer satisfaction under resource limitation and considerations of market competition. Based on benchmarking data of CAs, the concept of satisfaction functions is utilized to formulate explicitly the customer's preferences and to integrate the competitive analysis of target market into the modelling and solution process. In addition, the relationships linking CAs and ECs and the ECs to each other are integrated by functional relationships. The proposed approach will be illustrated through a car door design example.