Sliding mode control (SMC) of induction motor is a new concept in the current scenario, as it seeks to improve torque control accuracy and power steering efficiency through the use of pulse width modulation schemes. Furthermore, artificial neural network‐based sliding mode control is applied to a squirrel cage induction motor, which is used in the steering control of automobiles. The artificial neural network (ANN)‐based SMC is more popular due to its robustness and good stability in external parameter variation. Additionally, an SMC and an ANN‐based SMC are employed to compute the torque and flux, improving performance for power steering applications. The performance of the designed model is validated through MATLAB/Simulink and experimental models with different controllers under various operating conditions. The controller has been embedded into a TMS320F28335 controller, and performances have been evaluated. The performance analyses of induction motor using different controllers are performed. The transient performances of induction motor such as delay time, rise time, settling time, and steady‐state error are investigated. The proposed work is analysed by using a mathematical model and implemented in a test‐bench model for validation.

Massive deployment of Graph Neural Networks (GNNs) in high-stake applications generates a strong demand for explanations that are robust to noise and align well with human intuition. Most existing methods generate explanations by identifying a subgraph of an input graph that has a strong correlation with the prediction. These explanations are not robust to noise because independently optimizing the correlation for a single input can easily overfit noise. Moreover, they are not counterfactual because removing an identified subgraph from an input graph does not necessarily change the prediction result. In this paper, we propose a novel method to generate robust counterfactual explanations on GNNs by explicitly modelling the common decision logic of GNNs on similar input graphs. Our explanations are naturally robust to noise because they are produced from the common decision boundaries of a GNN that govern the predictions of many similar input graphs. The explanations are also counterfactual because removing the set of edges identified by an explanation from the input graph changes the prediction significantly. Exhaustive experiments on many public datasets demonstrate the superior performance of our method.

In this paper we present an end-to-end framework for grounding of phrases in images. In contrast to previous works, our model, which we call G3raphGround, uses graphs to formulate more complex, non-sequential dependencies among proposal image regions and phrases. We capture intra-modal dependencies using a separate graph neural network for each modality (visual and lingual), and then use conditional message-passing in another graph neural network to fuse their outputs and capture cross-modal relationships. This final representation results in grounding decisions. The framework supports many-to-many matching and is able to ground single phrase to multiple image regions and vice versa. We validate our design choices through a series of ablation studies and illustrate state-of-the-art performance on Flickr30k and ReferIt Game benchmark datasets.