By use the notions pre-g-closedness and pre-g-openness we have generalized a class of separation axioms in topological spaces. In particular, we presented in this paper new types of regulαrities, which we named ρg­regulαrity and Sρg­regulαrity. Many results and properties of both types have been investigated and have illustrated by examples.

Ruthenium-Ruthenium and Ruthenium–ligand interactions in the triruthenium "[Ru₃(μ-H)(μ₃-κ²-Hamphox-N,N)(CO)₉]" cluster are studied at DFT level of theory. The topological indices are evaluated in term of QTAIM (quantum theory of atoms in molecule). The computed topological parameters are in agreement with related transition metal complexes documented in the research papers. The QTAIM analysis of the bridged core part, i.e., Ru₃H, analysis shows that there is no bond path and bond critical point (chemical bonding) between Ru(2) and Ru(3). Nevertheless, a non-negligible delocalization index for this non-bonding interaction is calculated

The significance fore supra topological spaces as a subject of study cannot be overstated, as they represent a broader framework than traditional topological spaces. Numerous scholars have proposed extension to supra open sets, including supra semi open sets, supra per open and others. In this research, a notion for ⱨ-supra open created within the generalizations of the supra topology of sets. Our investigation involves harnessing this style of sets to introduce modern notions in these spaces, specifically supra ⱨ - interior, supra ⱨ - closure, supra ⱨ - limit points, supra ⱨ - boundary points and supra ⱨ - exterior of sets. It has been examining the relationship with supra open. The research was also enriched with many

 The current paper studied the concept of right n-derivation satisfying certified conditions on semigroup ideals of near-rings and some related properties. Interesting results have been reached, the most prominent of which are the following: Let M be a 3-prime left near-ring and A_1,A_2,…,A_n are nonzero semigroup ideals of M, if d is a right n-derivation of M satisfies on of the following conditions,
d(u_1,u_2,…,(u_j,v_j ),…,u_n )=0 ∀ 〖 u〗_1 〖ϵA〗_1 ,u_2 〖ϵA〗_2,…,u_j,v_j ϵ A_j,…,〖u_n ϵA〗_u;
d((u_1,v_1 ),(u_2,v_2 ),…,(u_j,v_j ),…,(u_n,v_n ))=0 ∀u_1,v_1 〖ϵA〗_1,u_2,v_2 〖ϵA〗_2,…,u_j,v_j ϵ A_j,…,〖u_n,v_n ϵA〗_u ;
d((u_1,v_1 ),(u_2,v_2 ),…,(u_j,v_j ),…,(u_n,v_n ))=(u_

This paper performance for preparation and identification of six new complexes of a number of transition metals Cr (lII), Mn (I1), Fe (l), Co (II), Ni (I1), Cu (Il) with: N - (3,4,5-Trimethoxy phenyl-N - benzoyl Thiourea (TMPBT) as a bidentet ligand. The prepared complexes have been characterized, identified on the basis of elemental analysis (C.H.N), atomic absorption, molar conductivity, molar-ratio ,pH effect study, I. Rand UV spectra studies. The complexes have the structural formula ML₂X₃ for Cr (III), Fe (III), and ML₂X₂ for Mn (II), Ni (II), and MLX₂ for Co (Il) , Cu (Il).

The topic of the research tagged (narrative structure and its impact on building open and closed endings in the fictional film) is summarized by studying the mechanism of employing closed and open endings in the fictional film. novelist, then the need for it, as well as the objectives of the research and clarifying its limits as well as its importance. Then moving to the theoretical framework, which included three topics, where the first topic was entitled (the cinematic construction of the film narrative), either the second topic (the structure of complexity and narrative solutions), or the third topic dealt with the subject (the structure of the end and its relationship to the construction of the narrative). After completing the theore

The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

This research involves design and simulation of GaussianFSK transmitter in UHF band using direct modulation of ΣΔ  fractional-N synthesizer with the following specifications:

Frequency range (869.9– 900.4) MHz, data rate 150kbps, channel spacing (500 kHz), Switching time 1 µs, & phase noise @10 kHz = -85dBc.

New circuit techniques have been sought to allow increased integration of radio transmitters and receivers, along with new radio architectures that take advantage of such techniques. Characteristics such as low power operation, small size, and low cost have become the dominant design criteria by which these systems are judged.

A direct modulation by ΣΔ  fractional-N synthesizer is proposed

One wide-ranging category of open source data is that referring to geospatial information web sites. Despite the advantages of such open source data, including ease of access and cost free data, there is a potential issue of its quality. This article tests the horizontal positional accuracy and possible integration of four web-derived geospatial datasets: OpenStreetMap (OSM), Google Map, Google Earth and Wikimapia. The evaluation was achieved by combining the tested information with reference field survey data for fifty road intersections in Baghdad, Iraq. The results indicate that the free geospatial data can be used to enhance authoritative maps especially small scale maps.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i