Multiplicative-modified-Rodrigues-parameters-based strong tracking unscented Kalman filter for satellite attitude estimation

In this paper, an improved strong tracking unscented Kalman filter (STUKF) based on multiplicative modified Rodrigues parameters (MRPs) is proposed for satellite attitude estimation. The multiplicative MRPs are superior to additive ones in terms of attitude representation, especially when attitude angles are large. By minimizing the loss function in Wahba’s problem, a novel method of weighted average for MRPs is derived to replace the simple procedure. The generation of Sigma points, update of state variables and calculation of covariance matrices are all different from the existing literature to maintain the multiplicative property of MRPs. Simulation results by raw telemetry data from the on-orbit CubeSat Enlai-1 demonstrate the excellent performance of the proposed filter under large attitude angles.

Identification of Composite Combinations: Key to Validate Goldbach Conjecture

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

Identification of Composite Combinations: Key to Validate Goldbach Conjecture

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

On a functional equation that has the quadratic-multiplicative property

In this article, we obtain the general solution and prove the Hyers-Ulam stability of the following quadratic-multiplicative functional equation: \phi (st-uv)+\phi (sv+tu)={[}\phi (s)+\phi (u)]{[}\phi (t)+\phi (v)] by using the direct method and the fixed point method.

A NOVEL AND FAST CORNER DETECTION METHOD FOR SAR IMAGERY

Corners play an important role on image processing, while it is difficult to detect reliable and repeatable corners in SAR images due to the complex property of SAR sensors. In this paper, we propose a fast and novel corner detection method for SAR imagery. First, a local processing window is constructed for each point. We use the local mean of a 3 x 3 mask to represent a single point, which is weighted by a Gaussian template. Then the candidate point is compared with 16 surrounding points in the processing window. Considering the multiplicative property of speckle noise, the similarity measure between the center point and the surrounding points is calculated by the ratio of their local means. If there exist more than M continuous points are different from the center point, then the candidate point is labelled as a corner point. Finally, a selection strategy is implemented by ranking the corner score and employing the non-maxima suppression method. Extreme situations such as isolated bright points are also removed. Experimental results on both simulated and real-world SAR images show that the proposed detector has a high repeatability and a low localization error, compared with other state-of-the-art detectors.

A generalization of a series for the density of abundant numbers

Recently, it was shown that the density of abundant numbers has a simple series expression, which relies on the multiplicative property of the arithmetic function [Formula: see text]. We generalize this result by determining a class of multiplicative functions for which the series result carries over.