A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.

The study aims at  evaluating  the penalty of  semi- intentional killing felony in the Egyptian and Algerian criminal law following the Islamic Law (Shari'a). The  study used the descriptive, evalutive and analytical  methodology  to  reach the topic in question. To meet the theoretical significance of the study, much data has been collected to give a comprehensive picture about the topic under examination. As for the practical significance of the study, it helps the juridical power to reconsider and phrase the legal materials of the semi-intentional killing penalty based on the Islamic law. The study has come to the conclusions that the Islamic Law (Shari'a) imposes a compensation (blood-money) to be g

In this paper, the fuzzy logic and the trapezoidal fuzzy intuitionistic number were presented, as well as some properties of the trapezoidal fuzzy intuitionistic number and semi- parametric logistic regression model when using the trapezoidal fuzzy intuitionistic number. The output variable represents the dependent variable sometimes cannot be determined in only two cases (response, non-response)or (success, failure) and more than two responses, especially in medical studies; therefore so, use a semi parametric logistic regression model with the output variable (dependent variable) representing a trapezoidal fuzzy intuitionistic number.

the model was estimated on simulati

In this study, we made a comparison between LASSO & SCAD methods, which are two special methods for dealing with models in partial quantile regression. (Nadaraya & Watson Kernel) was used to estimate the non-parametric part ;in addition, the rule of thumb method was used to estimate the smoothing bandwidth (h). Penalty methods proved to be efficient in estimating the regression coefficients, but the SCAD method according to the mean squared error criterion (MSE) was the best after estimating the missing data using the mean imputation method

As the process of  estimate for model and variable selection significant is a crucial process in the semi-parametric modeling At the beginning of the modeling process often At there are many explanatory variables to Avoid the loss of any explanatory elements may be important as a result , the selection of significant variables become necessary , so the process of variable selection is not intended to simplifying  model complexity explanation , and also predicting. In this research was to use some of the semi-parametric methods (LASSO-MAVE , MAVE and The proposal method (Adaptive LASSO-MAVE) for variable selection and estimate semi-parametric single index model (SSIM) at the same time .

Optical burst switching (OBS) network is a new generation optical communication technology. In an OBS network, an edge node first sends a control packet, called burst header packet (BHP) which reserves the necessary resources for the upcoming data burst (DB). Once the reservation is complete, the DB starts travelling to its destination through the reserved path. A notable attack on OBS network is BHP flooding attack where an edge node sends BHPs to reserve resources, but never actually sends the associated DB. As a result the reserved resources are wasted and when this happen in sufficiently large scale, a denial of service (DoS) may take place. In this study, we propose a semi-supervised machine learning approach using k-means algorithm

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 paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11),  n = 2,3,…,10,11  by geometric method, with the related blocking sets and projective codes.