Document clustering is the process of organizing a particular electronic corpus of documents into subgroups of similar text features. Formerly, a number of conventional algorithms had been applied to perform document clustering. There are current endeavors to enhance clustering performance by employing evolutionary algorithms. Thus, such endeavors became an emerging topic gaining more attention in recent years. The aim of this paper is to present an up-to-date and self-contained review fully devoted to document clustering via evolutionary algorithms. It firstly provides a comprehensive inspection to the document clustering model revealing its various components with its related concepts. Then it shows and analyzes the principle research work in this topic. Finally, it compiles and classifies various objective functions, the core of the evolutionary algorithms, from the related collection of research papers. The paper ends up by addressing some important issues and challenges that can be subject of future work.
One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera
... Show MoreThe aim of this essay is to use a single-index model in developing and adjusting Fama-MacBeth. Penalized smoothing spline regression technique (SIMPLS) foresaw this adjustment. Two generalized cross-validation techniques, Generalized Cross Validation Grid (GGCV) and Generalized Cross Validation Fast (FGCV), anticipated the regular value of smoothing covered under this technique. Due to the two-steps nature of the Fama-MacBeth model, this estimation generated four estimates: SIMPLS(FGCV) - SIMPLS(FGCV), SIMPLS(FGCV) - SIM PLS(GGCV), SIMPLS(GGCV) - SIMPLS(FGCV), SIM PLS(GGCV) - SIM PLS(GGCV). Three-factor Fama-French model—market risk premium, size factor, value factor, and their implication for excess stock returns and portfolio return
... Show MoreTransient mixed convection heat transfer in a confined porous medium heated at periodic sinusoidal heat flux is investigated numerically in the present paper. The Poisson-type pressure equation, resulted from the substituting of the momentum Darcy equation in the continuity equation, was discretized by using finite volume technique. The energy equation was solved by a fully implicit control volume-based finite difference formulation for the diffusion terms with the use of the quadratic upstream interpolation for convective kinetics scheme to discretize the convective terms and the temperature values at the control volume faces. The numerical study covers a range of the hydrostatic pressure head , , , , and ), sinusoidal amplitude range of
... Show MoreTransient mixed convection heat transfer in a confined porous medium heated at periodic sinusoidal heat flux is investigated numerically in the present paper. The Poisson-type pressure equation, resulted from the substituting of the momentum Darcy equation in the continuity equation, was discretized by using finite volume technique. The energy equation was solved by a fully implicit control volume-based finite difference formulation for the diffusion terms with the use of the quadratic upstream interpolation for convective kinetics scheme to discretize the convective terms and the temperature values at the control volume faces. The numerical study covers a range of the hydrostatic pressure sinusoidal amplitude range and
... Show MoreIn this paper we generalize some of the results due to Bell and Mason on a near-ring N admitting a derivation D , and we will show that the body of evidence on prime near-rings with derivations have the behavior of the ring. Our purpose in this work is to explore further this ring like behavior. Also, we show that under appropriate additional hypothesis a near-ring must be a commutative ring.