In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...

background   objective:   materials and methods   results   conclusion   key words:   . vitrification, viability, in vitro maturation, gvbd, oocyte, mouse : these results suggest that step-wise vitrification of gvbd oocytes as compared to single step vitrification was better in the rate of survival and in vitro maturation of oocytes. : all non-vitrified oocytes were viable after 24 hr; however,...

Recently Chubanov proposed a method which solves homogeneous linear equality systems with positive variables in polynomial time. Chubanov’s method can be considered as a column-wise rescaling procedure. We adapt Chubanov’s method to the von Neumann problem, and so we design a polynomial time column-wise rescaling von Neumann algorithm. This algorithm is the first variant of the von Neumann algo...

For document categorization, numerous words appearing in similar documents are divided into stopwords and keywords and to precisely describe documentary characteristics, documents are expressed by keywords without stopwords. For enhanced clustering precision, this paper proposed SHODC algorithm, a seed cluster-based hierarchical document clustering method, and DHODC method through domain stopwr...

In this work, we propose a projection operator based on restricted element-wise projections, which can be applied to a large set of finite element spaces. In contrast to most other projectors, such as the standard interpolation operator or the well-known Clément’s operator, our projection operator does not utilise the node functionals defining the basis functions of the finite element space. Mo...

where U = V k−mV k−m+1 · · ·V k−1. For the L-BFGS, we need not explicitly store the approximated inverse Hessian matrix. Instead, we only require matrix-vector multiplications at each iteration, which can be implemented by a twoloop recursion with a time complexity of O(mn) (Jorge & Stephen, 1999). Thus, we only store 2m vectors of length n: sk−1, sk−2, · · · , sk−m and yk−1,yk−2, · · · ,yk−m w...