System Identification Modeling of Ship Manoeuvring Motion in 4 Degrees of Freedom Based on Support Vector Machines

Based on support vector machines, three modeling methods, i.e., white-box modeling, grey-box modeling and black-box modeling of ship manoeuvring motion in 4 degrees of freedom are investigated. With the whole-ship mathematical model for ship manoeuvring motion, in which the hydrodynamic coefficients are obtained from roll planar motion mechanism test, some zigzag tests and turning circle manoeuvres are simulated. In the white-box modeling and grey-box modeling, the training data taken every 5 s from the simulated 20°/20° zigzag test are used, while in the black-box modeling, the training data taken every 5 s from the simulated 15°/15°, 20°/20° zigzag tests and 15°, 25° turning manoeuvres are used; and the trained support vector machines are used to predict the whole 20°/20° zigzag test. Comparisons between the simulated and predicted 20°/20° zigzag tests show good predictive ability of the proposed methods. Besides, all mathematical models obtained by the proposed modeling methods are used to predict the 10°/10° zigzag test and 35° turning circle manoeuvre, and the predicted results are compared with those of simulation tests to demonstrate the good generalization performance of the mathematical models. Finally, the proposed modeling methods are analyzed and compared with each other in aspects of application conditions, prediction accuracy and computation speed. The appropriate modeling method can be chosen according to the intended use of the mathematical models and the available data needed for system identification.

A New Proof for Congruent Number’s Problem via Pythagorician Divisors

Considering Pythagorician divisors theory which leads to a new parameterization, for Pythagorician triplets ( a,b,c )∈ ℕ 3∗ , we give a new proof of the well-known problem of these particular squareless numbers n∈ ℕ ∗ , called congruent numbers, characterized by the fact that there exists a right-angled triangle with rational sides: ( A α ) 2 + ( B β ) 2 = ( C γ ) 2 , such that its area Δ= 1 2 A α B β =n;or in an equivalent way, to that of the existence of numbers U 2 , V 2 , W 2 ∈ ℚ 2∗ that are in an arithmetic progression of reason n;Problem equivalent to the existence of: ( a,b,c )∈ ℕ 3∗ prime in pairs, and f∈ ℕ ∗ , such that: ( a−b 2f ) 2 , ( c 2f ) 2 , ( a+b 2f ) 2 are in an arithmetic progression of reason n;And this problem is also equivalent to that of the existence of a non-trivial primitive integer right-angled triangle: a 2 + b 2 = c 2 , such that its area Δ= 1 2 ab=n f 2 , where f∈ ℕ ∗ , and this last equation can be written as follows, when using Pythagorician divisors: (1) Δ= 1 2 ab= 2 S−1 d e ¯ ( d+ 2 S−1 e ¯ )( d+ 2 S e ¯ )=n f 2;Where ( d, e ¯ )∈ ( 2ℕ+1 ) 2 such that gcd( d, e ¯ )=1 and S∈ ℕ ∗ , where 2 S−1 , d, e ¯ , d+ 2 S−1 e ¯ , d+ 2 S e ¯ , are pairwise prime quantities (these parameters are coming from Pythagorician divisors). When n=1 , it is the case of the famous impossible problem of the integer right-angled triangle area to be a square, solved by Fermat at his time, by his famous method of infinite descent. We propose in this article a new direct proof for the numbers n=1 (resp. n=2 ) to be non-congruent numbers, based on an particular induction method of resolution of Equation (1) (note that this method is efficient too for general case of prime numbers n=p≡a ( ( mod8 ) , gcd( a,8 )=1 ). To prove it, we use a classical proof by induction on k , that shows the non-solvability property of any of the following systems ( t=0 , corresponding to case n=1 (resp. t=1 , corresponding to case n=2 )): ( Ξ t,k ){ X 2 + 2 t ( 2 k Y ) 2 = Z 2 X 2 + 2 t+1 ( 2 k Y ) 2 = T 2 , where k∈ℕ;and solutions ( X,Y,Z,T )=( D k , E k , f k , f ′ k )∈ ( 2ℕ+1 ) 4 , are given in pairwise prime numbers.2020-Mathematics Subject Classification 11A05-11A07-11A41-11A51-11D09-11D25-11D41-11D72-11D79-11E25 .

Effect of Curing Regime on Degree of Al^(3+) Substituting for Si^(4+) in C-S-H Gels of Hardened Portland Cement Pastes

The effect of curing regime on degree ofAl3＋ substituting for Si^4＋ （Al/Si ratio） in C-S-H gels of hardened Portland cement pastes was investigated by 29Si magic angel spinning （MAS） nuclear magnetic resonance （NMR） with deconvolution technique. The curing regimes included the constant temperature （20, 40, 60 and 80 ℃） and variable temperature （simulated internal temperature of mass concrete with 60 ℃ peak）. The results indicate that constant temperature of 20 ℃ is beneficial to substitution ofAl3＋ for Si4＋, and AI/Si ratio changes to be steady after 180 d. The increase of Al/Si ratio at 40 ℃is less than that at 20℃ for 28 d. The other three regimes of high temperature increase Al/Si ratio only before 3 d, on the contrary to that from 3 to 28 d. However, the 20 ℃ curing stage from 28 to 180 d at variable temperature regime, is beneficial to the increase of AI/Si ratio which is still lower than that at constant temperature regime of 20 ℃ for the same age. A nonlinear relation exists between the Al/Si ratio and temperature variation or mean chain length （MCL） of C-S-H gels, furthermore, the amount ofAl3＋ which can occupy the bridging tetrahedra sites in C-S-H structure is insufficient in hardened Portland cement pastes.

An Infinite Family of Number Fields with No Inert Primes

The goal of this paper is to show that there are infinitely many number fields K/Q, for which there is no inert prime p ∈ N*, i.e. ∀p ∈ N* a prime number, prime ideal of K such that where: Zk is the Dedekind domain of the integer elements of K. To prove such a result, consider for any prime p, the decomposition into a product of prime ideals of Zk, of the ideal . From this point, we use on the one hand: 1) The well- known property that says: If , then the ideal pZk decomposes into a product of prime ideals of Zk as following: . (where:;is the irreducible polynomial of θ, and, is its reduction modulo p, which leads to a product of irreducible polynomials in Fp[X]). It is clear that because if is reducible in Fp[X], then consequently p is not inert. Now, we prove the existence of such p, by proving explicit such p as follows. So we use on the other hand: 2) this property that we prove, and which is: If , is an irreducible normalized integer polynomial, whose splitting field is , then for any prime number p ∈ N: is always a reducible polynomial. 3) Consequently, and this closes our proof: let’s consider the set (whose cardinality is infinite) of monogenic biquadratic number fields: . Then each fθ(X) checks the above properties, this means that for family M, all its fields, do not admit any inert prime numbers p ∈ N. 2020-Mathematics Subject Classification (MSC2020) 11A41 - 11A51 - 11D25 - 11R04 - 11R09 - 11R11 - 11R16 - 11R32 - 11T06 - 12E05 - 12F05 -12F10 -13A05-13A15 - 13B02 - 13B05 - 13B10 - 13B25 -13F05