The issue of penalized regression model has received considerable critical attention to variable selection. It plays an essential role in dealing with high dimensional data. Arctangent denoted by the Atan penalty has been used in both estimation and variable selection as an efficient method recently. However, the Atan penalty is very sensitive to outliers in response to variables or heavy-tailed error distribution. While the least absolute deviation is a good method to get robustness in regression estimation. The specific objective of this research is to propose a robust Atan estimator from combining these two ideas at once. Simulation experiments and real data applications show that the proposed LAD-Atan estimator

         The issue of penalized regression model has received considerable critical attention to variable selection. It plays an essential role in dealing with high dimensional data. Arctangent denoted by the Atan penalty has been used in both estimation and variable selection as an efficient method recently. However, the Atan penalty is very sensitive to outliers in response to variables or heavy-tailed error distribution. While the least absolute deviation is a good method to get robustness in regression estimation. The specific objective of this research is to propose a robust Atan estimator from combining these two ideas at once. Simulation experiments and real data applications show that the p

This paper proposes a new encryption method. It combines two cipher algorithms, i.e., DES and AES, to generate hybrid keys. This combination strengthens the proposed W-method by generating high randomized keys. Two points can represent the reliability of any encryption technique. Firstly, is the key generation; therefore, our approach merges 64 bits of DES with 64 bits of AES to produce 128 bits as a root key for all remaining keys that are 15. This complexity increases the level of the ciphering process. Moreover, it shifts the operation one bit only to the right. Secondly is the nature of the encryption process. It includes two keys and mixes one round of DES with one round of AES to reduce the performance time. The W-method deals with

  In   this  research  ,  the  structural   and  optical   properties   of  pure of cadmium  oxide, pure (CdO) were studided thin films in a thermal evaporation in a vacuum depositing metal cadmium pure rules of the glass at room temperature (300K) and thickness (300 ± 20nm) and the time of deposition (1.25sec) was oxidation of thin films cadmium (Cd) record temperature (673k) for a period of one hour to the presence of air optical energy gap for direct electronic transitions were calculated (permitted) as a function of absorption coefficient and permeability and reversibility by recording the spectrum absorbance and permeability of the membrane the record

This paper discusses reliability R of the (2+1) Cascade model of inverse Weibull distribution. Reliability is to be found when strength-stress distributed is inverse Weibull random variables with unknown scale parameter and known shape parameter. Six estimation methods (Maximum likelihood, Moment, Least Square, Weighted Least Square, Regression and Percentile) are used to estimate reliability. There is a comparison between six different estimation methods by the simulation study by MATLAB 2016, using two statistical criteria Mean square error and Mean Absolute Percentage Error, where it is found that best estimator between the six estimators is Maximum likelihood estimation method.

Wireless sensor applications are susceptible to energy constraints. Most of the energy is consumed in communication between wireless nodes. Clustering and data aggregation are the two widely used strategies for reducing energy usage and increasing the lifetime of wireless sensor networks. In target tracking applications, large amount of redundant data is produced regularly. Hence, deployment of effective data aggregation schemes is vital to eliminate data redundancy. This work aims to conduct a comparative study of various research approaches that employ clustering techniques for efficiently aggregating data in target tracking applications as selection of an appropriate clustering algorithm may reflect positive results in the data aggregati

In this paper the chain length of a space of fuzzy orderings is defined, and various properties of this invariant are proved. The structure theorem for spaces of finite chain length is proved. Spaces of Fuzzy Orderings Throughout X = (X,A) denoted a space of fuzzy orderings. That is, A is a fuzzy subgroup of abelian group G of exponent 2. (see [1] (i.e. x 2 = 1,  x  G), and X is a (non empty) fuzzy subset of the character group  (A) = Hom(A,{1,–1}) satisfying: 1. X is a fuzzy closed subset of  (A). 2.  an element e  A such that (e) = – 1    X. 3. X :={a  A\ (a) = 1    X} = 1. 4. If f and g are forms over A and if x  D(