Let/. It :0 ---0 G be any two self maps of a compact connected oriented Lie group G. In this paper, for each positive integer k , we associate an integer with fk,hi . We relate this number with Lefschetz coincidence number. We deduce that for any two differentiable maps f, there exists a positive integer k such that k 5.2+1 , and there is a point x C G such that ft (x) = (x) , where A is the rank of G . Introduction Let G be an n-dimensional com -pact connected Lie group with multip-lication p ( .e 44:0 xG--+G such that p ( x , y) = x.y ) and unit e . Let [G, G] be the set of homotopy classes of maps G G . Given two maps f , f G ---• Jollowing [3], we write f. f 'to denote the map G-.Gdefined by 01.11® =A/WO= fiat® ,sea Given a point g EC and a differ-entiable map F: G G , write GA to denote the tangent space of G at g [4,p.10] , and denote by d x F the linear map rig F :Tx0 T, (x)G induced by F , it is called the differential of Fat g [4,p.22]. Let LA, Rx :0 G be respec-tively the left translation Lx(i)=4..(g,e) , and the right translation Rx(1)./..(gcg). Then there is a natural homomorphism Ad ,the adjoin representation, from G to GL(G•), (the group of nonsingular linear transformations of Qdefined as follows:- Ad(g)= deRe, od,Lx. Note that d xRc, ad.; =d(4,( Lx(e)))0 de; =d.(4, 04)=4(40 Re) = d(4(4, (e)))0 (44, =d ar, o (44, . Since G is connected , the image of Ad belongs to the connected component of G(G)containing the identity,i.e. for each g E 0, detAd(g) > 0 . By Exercise Al • Dr.-Prof.-Department of Mathematics- College of Science- University of Baghdad. •• Dr.-Department of Mathematics- College of Science for Woman- University of Baghdad.
The necessary optimality conditions with Lagrange multipliers are studied and derived for a new class that includes the system of Caputo–Katugampola fractional derivatives to the optimal control problems with considering the end time free. The formula for the integral by parts has been proven for the left Caputo–Katugampola fractional derivative that contributes to the finding and deriving the necessary optimality conditions. Also, three special cases are obtained, including the study of the necessary optimality conditions when both the final time and the final state are fixed. According to convexity assumptions prove that necessary optimality conditions are sufficient optimality conditions.
... Show More
(6)
(1)
(115)
(110)
(60)
(63)
(35)
(34)
(13)
(11)
(54)
(50)
The consumption of fossil fuels has caused many challenges, including environmental and climate damage, global warming, and rising energy costs, which has prompted seeking to substitute other alternative sources. The current study explored the microwave pyrolysis of Albizia branches to assess its potential to produce all forms of fuel (solid, liquid, gas), time savings, and effective thermal heat transfer. The impact of the critical parameters on the quantity and quality of the biofuel generation, including time, power levels, biomass weight, and particle size, were investigated. The results revealed that the best bio-oil production was 76% at a power level of 450 W and 20 g of biomass. Additionally, low power levels led to enhanced
... Show More
(9)
(3)
(2)
Deep learning (DL) plays a significant role in several tasks, especially classification and prediction. Classification tasks can be efficiently achieved via convolutional neural networks (CNN) with a huge dataset, while recurrent neural networks (RNN) can perform prediction tasks due to their ability to remember time series data. In this paper, three models have been proposed to certify the evaluation track for classification and prediction tasks associated with four datasets (two for each task). These models are CNN and RNN, which include two models (Long Short Term Memory (LSTM)) and GRU (Gated Recurrent Unit). Each model is employed to work consequently over the two mentioned tasks to draw a road map of deep learning mod
... Show More
(5)
(2)
Evolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce
... Show More