In this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise pairwise completely regular spaces, fibrewise pairwise normal spaces, and fibrewise pairwise functionally normal spaces. In addition, we offer some results concerning these extended axioms. Finally, we introduce some concepts in fibrewise bitopological spaces which are fibrewise ij-bitopological spaces, fibrewise ij-closed bitopological spaces, fibrewise ij-compact bitopological spaces, fibrewise ij-perfect bitopological spaces, fibrewise weakly ij-closed bitopological space, fibrewise almost ij-perfect bitopological space, fibrewise ij^*-bitopological spaces. We study several theorems and characterizations concerning these concepts.
(1)
(2)
Despite the principle of separation of powers brought by the French Revolution, which entrusted the task of drafting legislation and its amendment to the legislative authority and the task of settling disputes and settling them in the judiciary. However, since that date, the French judiciary has played a major role in the development of French civil law (In spite of all the economic and social developments that have taken place in French society throughout these years) since its promulgation until February of 2016, the date of the Legislative Decree No. 131 of the year 2016 A modification is the largest in the history of the French Civil Code (which was the judicial precedents in which a significant impact), was assisted by the French judic
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
(1)
The power generation of solar photovoltaic (PV) technology is being implemented in every nation worldwide due to its environmentally clean characteristics. Therefore, PV technology is significantly growing in the present applications and usage of PV power systems. Despite the strength of the PV arrays in power systems, the arrays remain susceptible to certain faults. An effective supply requires economic returns, the security of the equipment and humans, precise fault identification, diagnosis, and interruption tools. Meanwhile, the faults in unidentified arc lead to serious fire hazards to commercial, residential, and utility-scale PV systems. To ensure secure and dependable distribution of electricity, the detection of such ha
... Show More
(10)
(6)
(21)
(12)
(65)
(48)
Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a
... Show More
(37)
(36)
(12)
(7)
(25)
(24)
(2)
(1)