In this research, we study the classical continuous Mixed optimal control vector problem dominated by couple nonlinear elliptic PDEs. The existence theorem for the unique state vector solution of the considered couple nonlinear elliptic PDEs for a given continuous classical mixed control vector is stated and proved by applying the Minty-Browder theorem under suitable conditions. Under suitable conditions, the existence theorem of a classical continuous mixed optimal control vector associated with the considered couple nonlinear elliptic PDEs is stated and proved.
In "historical" fiction, characters that never really existed, give expression to the impact of historical events on the people who really did live through them. The result is not history, as an accurate record of actual events, but fiction in which an earlier age is rendered through the personal joys and sufferings of characters. This paper
aims at investigating the historical realities presented in Dickens’s A Tale of Two Cities.
Face recognition is a type of biometric software application that can identify a specific
individual in a digital image by analyzing and comparing patterns. It is the process of
identifying an individual using their facial features and expressions.
In this paper we proposed a face recognition system using Stationary Wavelet Transform
(SWT) with Neural Network, the SWT are applied into five levels for feature facial
extraction with probabilistic Neural Network (PNN) , the system produced good results
and then we improved the system by using two manner in Neural Network (PNN) and
Support Vector Machine(SVM) so we find that the system performance is more better
after using SVM where the result shows the performance o
Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
A key agreement protocol (KAP) is a fundamental block in any cryptosystem since it ensures secure communication between two parties. Furthermore, KAP should include advanced features in limited-resource environments such as IoT, in which this protocol must be lightweight and efficient in consuming resources. Despite the Elliptic Curve Diffie-Hellman (ECDH) algorithm having often been considered efficient in providing an acceptable security degree with less resource consumption, it has suffered from weakness against Man-In-The-Middle Attacks (MITMA). This paper presents two versions of the Variant Elliptic Curve Diffie-Hellman (VECDH) algorithms as a key agreement protocol. The security analysis indicates that the proposed algori
... Show MoreDiverting river flow during construction of a main dam involves the construction of cofferdams, and tunnels, channels or other temporary passages. Diversion channels are commonly used in wide valleys where the high flow makes tunnels or culverts uneconomic. The diversion works must form part of the overall project design since it will have a major impact on its cost, as well as on the design, construction program and overall cost of the permanent works. Construction costs contain of excavation, lining of the channel, and construction of upstream and downstream cofferdams. The optimization model was applied to obtain optimalchannel cross section, height of upstream cofferdam, and height of downstream cofferdamwith minimum construction cost
... Show MoreThe financial markets are one of the sectors whose data is characterized by continuous movement in most of the times and it is constantly changing, so it is difficult to predict its trends , and this leads to the need of methods , means and techniques for making decisions, and that pushes investors and analysts in the financial markets to use various and different methods in order to reach at predicting the movement of the direction of the financial markets. In order to reach the goal of making decisions in different investments, where the algorithm of the support vector machine and the CART regression tree algorithm are used to classify the stock data in order to determine
... Show MoreThe virtual decomposition control (VDC) is an efficient tool suitable to deal with the full-dynamics-based control problem of complex robots. However, the regressor-based adaptive control used by VDC to control every subsystem and to estimate the unknown parameters demands specific knowledge about the system physics. Therefore, in this paper, we focus on reorganizing the equation of the VDC for a serial chain manipulator using the adaptive function approximation technique (FAT) without needing specific system physics. The dynamic matrices of the dynamic equation of every subsystem (e.g. link and joint) are approximated by orthogonal functions due to the minimum approximation errors produced. The contr
Nowadays, Wheeled Mobile Robots (WMRs) have found many applications as industry, transportation, inspection, and other fields. Therefore, the trajectory tracking control of the nonholonomic wheeled mobile robots have an important problem. This work focus on the application of model-based on Fractional Order PIaDb (FOPID) controller for trajectory tracking problem. The control algorithm based on the errors in postures of mobile robot which feed to FOPID controller to generate correction signals that transport to torque for each driven wheel, and by means of dynamics model of mobile robot these torques used to compute the linear and angular speed to reach the desired pose. In this work a dynamics model of
... Show MoreGiven a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.