Generalized commutative quaternions of the Fibonacci type

Quaternions are a four-dimensional hypercomplex number system discovered by Hamilton in 1843 and next intensively applied in mathematics, modern physics, computer graphics and other fields. After the discovery of quaternions, modified quaternions were also defined in such a way that commutative property in multiplication is possible. That number system called as commutative quaternions is intensively studied and used for example in signal processing. In this paper we define generalized commutative quaternions and next based on them we define and explore Fibonacci type generalized commutative quaternions.

Building matrixes of higher order to achieve the special commutative multiplication and its applications in cryptography: بناء مصفوفات تبديلية من مراتب عليا وتطبيقاتها في التشفير

In this paper, we introduce a method for building matrices that verify the commutative property of multiplication on the basis of circular matrices, as each of these matrices can be divided into four circular matrices, and we can also build matrices that verify the commutative property of multiplication from higher order and are not necessarily divided into circular matrices. Using these matrixes, we provide a way to securely exchange a secret encryption key, which is a square matrix, over open communication channels, and then use this key to exchange encrypted messages between two sides or two parties. Moreover, using these matrixes we also offer a public-key encryption method, whereby the two parties exchange encrypted messages without previously agreeing on a common secret key between them.

The Effects of a CRA-I Intervention on Students’ Number Sense and Understanding of Addition

As students develop understanding and fluency in single-digit operations such as addition, they develop sophisticated strategies and number sense (magnitude, number order, and composition). Deficits in number sense and reliance on inefficient approaches can lead to struggle in mathematics. Intervention research in this area reported effects on students’ automaticity. Research reported observational data regarding strategy-use, but not growth in number sense and understanding of operations. This study investigated the effects of an intervention using the concrete-representational-abstract-integrated (CRA-I) sequence. The purpose of this study was to assess the effects of CRA-I on students’ number knowledge (magnitude, place value, and flexibility in strategy-use) and understanding of addition (commutative property and relation to subtraction). The researchers used a multiple probe across participants design. In addition, the researchers collected descriptive data on students’ automaticity. There was a functional relation between CRA-I and students’ number sense and understanding of addition, and students’ automaticity increased.

Corrections and Extensions in Left and Right Almost Semigroups

In this paper we elaborated the concept that on what conditions left almost semigroup (LA-Semigroup), right almost semigroup (RA-Semigroup) and a groupoid become commutative and further extended these results on medial, LA-Group and RA-Group. We proved that the relation of LA-Semigroup with left double displacement semigroup (LDD-semigroup), RA-Semigroup with left double displacement semigroup (RDD-semigroup) is only commutative property. We highlighted the errors in the recently developed results on LA-Semigroup and semigroup [17, 1, 18] and proved that example discussed in [18] is semigroup with left identity but not paramedial. We extended results on locally associative LA-Semigroup explained in [20, 21] towards LA-Semigroup and RA-Semigroup with left zero and right zero respectively. We also discussed results on n-dimensional LA-Semigroup, n-dimensional RASemigroup, non commutative finite medials with three or more than three left or right identities and finite as well as infinite commutative idempotent medials not studied in literature.

Towards Green Computing Oriented Security: A Lightweight Postquantum Signature for IoE

Postquantum cryptography for elevating security against attacks by quantum computers in the Internet of Everything (IoE) is still in its infancy. Most postquantum based cryptosystems have longer keys and signature sizes and require more computations that span several orders of magnitude in energy consumption and computation time, hence the sizes of the keys and signature are considered as another aspect of security by green design. To address these issues, the security solutions should migrate to the advanced and potent methods for protection against quantum attacks and offer energy efficient and faster cryptocomputations. In this context, a novel security framework Lightweight Postquantum ID-based Signature (LPQS) for secure communication in the IoE environment is presented. The proposed LPQS framework incorporates a supersingular isogeny curve to present a digital signature with small key sizes which is quantum-resistant. To reduce the size of the keys, compressed curves are used and the validation of the signature depends on the commutative property of the curves. The unforgeability of LPQS under an adaptively chosen message attack is proved. Security analysis and the experimental validation of LPQS are performed under a realistic software simulation environment to assess its lightweight performance considering embedded nodes. It is evident that the size of keys and the signature of LPQS is smaller than that of existing signature-based postquantum security techniques for IoE. It is robust in the postquantum environment and efficient in terms of energy and computations.

Some novel fixed-point theorems in Hausdorff spaces

In this paper existence and uniqueness of fixed points are proved for self maps, satisfying a new contraction without assuming the compatibility and commutative property of maps. Some remarks and applications to integral type contraction are given to illustrate the importance of our results. An open problem for future research is also given.

NORMAL ELEMENT ON IDENTIFY PROPERTIES

One type of element in the ring with involution is normal element. Their main properties is commutative with their image by involution in ring. Group invers of element in ring is always commutative with element which is commutative with itself. In this paper, properties of normal element in ring with involution which also have generalized Moore Penrose invers are constructed by using commutative property of group invers in ring. Keywords: Normal, Moore Penrose, group, involution

A MODIFIED D NUMBERS METHODOLOGY FOR ENVIRONMENTAL IMPACT ASSESSMENT

Environmental impact assessment (EIA) is usually evaluated by many factors influenced by various kinds of uncertainty or fuzziness. As a result, the key issues of EIA problem are to rep­resent and deal with the uncertain or fuzzy information. D numbers theory, as the extension of Dempster-Shafer theory of evidence, is a desirable tool that can express uncertainty and fuzziness, both complete and incomplete, quantitative or qualitative. However, some shortcomings do exist in D numbers combination process, the commutative property is not well considered when multiple D numbers are combined. Though some attempts have made to solve this problem, the previous method is not appropriate and convenience as more information about the given evaluations rep­resented by D numbers are needed. In this paper, a data-driven D numbers combination rule is proposed, commutative property is well considered in the proposed method. In the combination process, there does not require any new information except the original D numbers. An illustrative example is provided to demonstrate the effectiveness of the method.

IBUPROFEN

Organizations are increasingly choosing process-oriented organizational designs as a source to achieve competitive advantages. Business process models represent the sequence of tasks that an organization carries out. However, organizations must cope with quality problems of business process models (e.g., lack of understandability, maintainability, reusability, etc.). These problems are compounded when business process models are mined by reverse engineering (e.g., from information systems that support them), owing to the semantics loss that it involves. Refactoring techniques are commonly used to reduce these problems through changing their internal structure without altering their external behavior. Although several refactoring operators exist in the literature, there are no refactoring techniques especially developed for models obtained by reverse engineering and their special features. For this reason, this chapter presents IBUPROFEN, a refactoring technique (and supporting tool) for business process models obtained by reverse engineering. Moreover, a case study is conducted to determine how the refactoring operator's order influences the understanding and modification of business process models. The case study reveals there is a clear influence in these quality features in terms of the size and separability of the models under study, and therefore, refactoring operators do not satisfy the commutative property among them.