In this research, several estimators concerning the estimation are introduced. These estimators are closely related to the hazard function by using one of the nonparametric methods namely the kernel function for censored data type with varying bandwidth and kernel boundary. Two types of bandwidth are used:  local bandwidth and global bandwidth. Moreover, four types of boundary kernel are used namely: Rectangle, Epanechnikov, Biquadratic and Triquadratic and the proposed function was employed with all kernel functions. Two different simulation techniques are also used for two experiments to compare these estimators. In most of the cases, the results have proved that the local bandwidth is the best for all the

Amplitude variation with offset (AVO) analysis is an 1 efficient tool for hydrocarbon detection and identification of elastic rock properties and fluid types. It has been applied in the present study using reprocessed pre-stack 2D seismic data (1992, Caulerpa) from north-west of the Bonaparte Basin, Australia. The AVO response along the 2D pre-stack seismic data in the Laminaria High NW shelf of Australia was also investigated. Three hypotheses were suggested to investigate the AVO behaviour of the amplitude anomalies in which three different factors; fluid substitution, porosity and thickness (Wedge model) were tested. The AVO models with the synthetic gathers were analysed using log information to find which of these is the

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic

Early diagnosis and clinical decision-making depend on accurate brain tumor classification using magnetic resonance imaging (MRI). However, traditional deep learning methods usually rely on centralized medical data, which raises privacy concerns and limits the use of distributed clinical data. This research proposes a privacy-preserving federated learning framework for MRI image-based binary brain tumor classification using a decentralized ResNet-18 architecture that enables collaborative training without sharing raw patient data. To reflect realistic clinical conditions, the framework integrates heterogeneous multi-source datasets in different image formats (PNG and JPG) and evaluates performance under both IID and non-IID settings

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.

In this work the concept of multiplicatively closed set of S-act have been introduced. The relation between multiplicatively closed subset of S-act and compactly packed of S-act have been studied and proved some properties of this concepts. Let U be a M. C. set of a monoid S and let U* be a U-closed subset of M. Ϣ is a subact of M which is maximal in M-U*. If [Ϣ:M] is maximal in S, then Ϣ is a prime subact of M.

The topic of supra.topological.spaces considered one of the important topics because it is a generalization to topological.spaces. Many researchers have presented generalizations to supra open sets such as supra semi.open and supra pre.open sets and others. In this paper, the concept of δ∼open sets was employed and introduced in to the concept of supra topology and a new type of open set was extracted, which was named S∼δ∼open. Our research entails the utilization of this category of sets to form a new concepts in these spaces, namely S∼δ∼limit points and S∼δ∼derive points, and examining its relationship with S∼open and S∼reg∼open. Based on this class of sets, we have introduced other new concepts such as S∼isolate