This paper presents a vibration suppression control design of cantilever beam using two piezoelectric patches. One patch was used as an actuator element, while the other was used as a sensor. The controller design was designed via the balance realization reduction method to elect the reduced order model that is most controllable and observable. the sliding mode observer was designed to estimate six states from the reduced order model but three states are only used in the control law. Estimating a number of states larger than that used is in order to increase the estimation accuracy. Moreover, the state estimation error is proved bounded. An optimal LQR controller is designed then using the estimated states with the sliding mode observer, to suppress the vibration of a smart cantilever beam via the piezoelectric elements. The control spillover problem was avoided, by deriving an avoidance condition, to ensure the asymptotic stability for the proposed vibration control design. The numerical simulations were achieved to test the vibration attenuation ability of the proposed optimal control. For 15 mm initial tip displacement, the piezoelectric actuator found able to reduce the tip displacement to about 0.1 mm after 4s, while it was 1.5 mm in the open loop case. The current experimental results showed a good performance of the proposed LQR control law and the sliding mode observer, as well a good agreement with theoretical results.
In this paper, a discretization of a three-dimensional fractional-order prey-predator model has been investigated with Holling type III functional response. All its fixed points are determined; also, their local stability is investigated. We extend the discretized system to an optimal control problem to get the optimal harvesting amount. For this, the discrete-time Pontryagin’s maximum principle is used. Finally, numerical simulation results are given to confirm the theoretical outputs as well as to solve the optimality problem.
The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m
... Show MoreThe proliferation of many editing programs based on artificial intelligence techniques has contributed to the emergence of deepfake technology. Deepfakes are committed to fabricating and falsifying facts by making a person do actions or say words that he never did or said. So that developing an algorithm for deepfakes detection is very important to discriminate real from fake media. Convolutional neural networks (CNNs) are among the most complex classifiers, but choosing the nature of the data fed to these networks is extremely important. For this reason, we capture fine texture details of input data frames using 16 Gabor filters indifferent directions and then feed them to a binary CNN classifier instead of using the red-green-blue
... Show MoreIn this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.
Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called s- closed submodule denoted by D ≤sc W, if D has no proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In this paper, we study modules which satisfies the ascending chain conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.