In this paper, we introduce the notation of the soft bornological group to solve the problem of boundedness for the soft group. We combine soft set theory with bornology space to produce a new structure which is called soft bornological group. So that both the product and inverse maps are soft bounded. As well as, we study the actions of the soft bornological group on the soft bornological sets. The aim soft bornological set is to partition into orbital classes by acting soft bornological group on the soft bornological set. In addition, we explain the centralizer, normalizer, and stabilizer in details. The main important results are to prove that the product of soft bornological groups is soft bornological group and the action for different elements are the same actions.
We present the concept of maps Γ- periodi2 on Γ -near-ring S. Our main goal is to research and explore the presence and mapping traits such as h Γ –hom anti-Γ –hom, Γ –α-derivations of Γ -periodi2 on Γ- near-rings.
Anew mathematical formula was proposed to describe the behavior of the extinction coefficient as a function of ambient temperature and wavelengths for some of infrared materials. This formula was derived depending on some experimental data of transmittance spectrum versus wavelengths for many ambient temperatures. The extensive study of the spectrum characteristics and depending on Bose-Einstein distribution led to derive an equation connecting the extinction coefficient or the absorption coefficient with the ambient temperature and wavelengths of the incident rays. The basic assumption in deriving process is the decreasing in transmittance value with the increasing temperature which is only due to the changing in extinction coeffi
... Show MoreFace detection is one of the important applications of biometric technology and image processing. Convolutional neural networks (CNN) have been successfully used with great results in the areas of image processing as well as pattern recognition. In the recent years, deep learning techniques specifically CNN techniques have achieved marvellous accuracy rates on face detection field. Therefore, this study provides a comprehensive analysis of face detection research and applications that use various CNN methods and algorithms. This paper presents ten of the most recent studies and illustrate the achieved performance of each method.
In modern era, which requires the use of networks in the transmission of data across distances, the transport or storage of such data is required to be safe. The protection methods are developed to ensure data security. New schemes are proposed that merge crypto graphical principles with other systems to enhance information security. Chaos maps are one of interesting systems which are merged with cryptography for better encryption performance. Biometrics is considered an effective element in many access security systems. In this paper, two systems which are fingerprint biometrics and chaos logistic map are combined in the encryption of a text message to produce strong cipher that can withstand many types of attacks. The histogram analysis o
... Show MoreIn this article, Convolution Neural Network (CNN) is used to detect damage and no damage images form satellite imagery using different classifiers. These classifiers are well-known models that are used with CNN to detect and classify images using a specific dataset. The dataset used belongs to the Huston hurricane that caused several damages in the nearby areas. In addition, a transfer learning property is used to store the knowledge (weights) and reuse it in the next task. Moreover, each applied classifier is used to detect the images from the dataset after it is split into training, testing and validation. Keras library is used to apply the CNN algorithm with each selected classifier to detect the images. Furthermore, the performa
... Show MoreAs an important resource, entanglement light source has been used in developing quantum information technologies, such as quantum key distribution(QKD). There are few experiments implementing entanglement-based deterministic QKD protocols since the security of existing protocols may be compromised in lossy channels. In this work, we report on a loss-tolerant deterministic QKD experiment which follows a modified “Ping-Pong”(PP) protocol. The experiment results demonstrate for the first time that a secure deterministic QKD session can be fulfilled in a channel with an optical loss of 9 dB, based on a telecom-band entangled photon source. This exhibits a conceivable prospect of ultilizing entanglement light source in real-life fiber-based
... Show MoreThe topic of the research revolves around constructivist theory, which is one of the most important theories that added weight to the theoretical and epistemological field of international relations. The constructivist theory studies international relations from a completely different side of theories by focusing on the social aspects of international relations, and by looking at international relations as social constructs. Ideas, cultures, norms, standards and language play a major role in their formation. The study also examines the state of the war on terrorism as it represents one of the most international cases in which its composition and composition coincide with constructive ideas and a
... Show MoreThis Research deals with estimation the reliability function for two-parameters Exponential distribution, using different estimation methods ; Maximum likelihood, Median-First Order Statistics, Ridge Regression, Modified Thompson-Type Shrinkage and Single Stage Shrinkage methods. Comparisons among the estimators were made using Monte Carlo Simulation based on statistical indicter mean squared error (MSE) conclude that the shrinkage method perform better than the other methods
An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin
... Show More