This research deals with a shrinking method concernes with the principal components similar to that one which used in the multiple regression “Least Absolute Shrinkage and Selection: LASS”. The goal here is to make an uncorrelated linear combinations from only a subset of explanatory variables that may have a multicollinearity problem instead taking the whole number say, (K) of them. This shrinkage will force some coefficients to equal zero, after making some restriction on them by some "tuning parameter" say, (t) which balances the bias and variance amount from side, and doesn't exceed the acceptable percent explained variance of these components. This had been shown by MSE criterion in the regression case and the percent explained v

The Islamic Issue did not rise the “widespread arguments” in contemporary times, just as the issue of applying Islamic Law.  Just as the Islamic forces used this purpose, or employed it during their march to reach to power by adopting the sacred as motivation towered the power, or control the governance. However, the reality show that this goal remained within the boundaries of slogans in the sense of a teleological slogan, and did not go beyond the limits of advocacy or arrangement as the primary source of legislation with differences of teleological reasoning, in a manner that reflected an intellectual problem about the validity of the use of this concept or the ability to apply and enforce the law in today's world, to impose

Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.

Background The Transportation Problem (TP) is a detailed model in operations study with applications in logistics, supply chain management, and resource allocation. The classical IBFS methods including North-West Corner, Least Cost and Vogel’s Approximation have competitive computational efficiency, but they are very sensitive to the structure of the problem and usually lead to a solution that is far from the global optimum. Classic enhancement strategies like the Generalized Distribution (MODI) and Stepping-Stone (SS) approaches have low computational complexity but may fall into a local optimum quickly, which makes them ineffective in large-scale or unbalanced problems. Methods We propose the first generic hybrid algorithm, calle