336,028 research outputs found

    The Future of Institutional Repositories at Small Academic Institutions: Analysis and Insights

    Get PDF
    Institutional repositories (IRs) established at universities and academic libraries over a decade ago, large and small, have encountered challenges along the way in keeping faith with their original objective: to collect, preserve, and disseminate the intellectual output of an institution in digital form. While all institutional repositories have experienced the same obstacles relating to a lack of faculty participation, those at small universities face unique challenges. This article examines causes of low faculty contribution to IR content growth, particularly at small academic institutions. It also offers a first-hand account of building and developing an institutional repository at a small university. The article concludes by suggesting how institutional repositories at small academic institutions can thrive by focusing on classroom teaching and student experiential learning, strategic priorities of their parent institutions

    ON NEWTON-RAPHSON METHOD

    Get PDF
    Recent versions of the well-known Newton-Raphson method for solving algebraic equations are presented. First of these is the method given by J. H. He in 2003. He reduces the problem to solving a second degree polynomial equation. However He’s method is not applicable when this equation has complex roots. In 2008, D. Wei, J. Wu and M. Mei eliminated this deficiency, obtaining a third order polynomial equation, which has always a real root. First of the authors of present paper obtained higher order polynomial equations, which for orders 2 and 3 are reduced to equations given by He and respectively by Wei-Wu-Mei, with much improved form. In this paper, we present these methods. An example is given.newton-raphson

    Incompatibility of different customary kaon phase convention

    Get PDF
    The conventions that Wu and Yang assumed for the kaon phases in the context of CPCP symmetrical two-pion decay channels fix the relative kaon phase. This fact, apparently not emphasized sufficiently in the past, has recently been overlooked by Hayakawa and Sanda. In particular, Wu and Yang fix the relative phase to a different value than the one resulting from the convention CPK0=K0CP|K^{0}\rangle = |\overline{K^{0}}\rangle. The difference between the two values is made up of possible contributions from CPTCPT- and direct CPCP-violations during the decay of a kaon into a two-pion state of isospin zero.Comment: 5 pages, LaTe

    The McCoy-Wu Model in the Mean-field Approximation

    Full text link
    We consider a system with randomly layered ferromagnetic bonds (McCoy-Wu model) and study its critical properties in the frame of mean-field theory. In the low-temperature phase there is an average spontaneous magnetization in the system, which vanishes as a power law at the critical point with the critical exponents β3.6\beta \approx 3.6 and β14.1\beta_1 \approx 4.1 in the bulk and at the surface of the system, respectively. The singularity of the specific heat is characterized by an exponent α3.1\alpha \approx -3.1. The samples reduced critical temperature tc=TcavTct_c=T_c^{av}-T_c has a power law distribution P(tc)tcωP(t_c) \sim t_c^{\omega} and we show that the difference between the values of the critical exponents in the pure and in the random system is just ω3.1\omega \approx 3.1. Above the critical temperature the thermodynamic quantities behave analytically, thus the system does not exhibit Griffiths singularities.Comment: LaTeX file with iop macros, 13 pages, 7 eps figures, to appear in J. Phys.

    Relatively Congruence-free Regular Semigroups

    Get PDF
    Yu, Wang, Wu and Ye call a semigroup S τ -congruence-free, where τ is an equivalence relation on S, if any congruence ρ on S is either disjoint from τ or contains τ . A congruence-free semigroup is then just an ω-congruence-free semigroup, where ω is the universal relation. They determined the completely regular semigroups that are τ -congruence-free with respect to each of the Green’s relations. The goal of this paper is to extend their results to all regular semigroups. Such a semigroup is J –congruence-free if and only if it is either a semilattice or has a single nontrivial J -class, J, say, and either J is a subsemigroup, in which case it is congruence-free, or otherwise its principal factor is congruence-free. Given the current knowledge of congruence-free regular semigroups, this result is probably best possible. When specialized to completely semisimple semigroups, however, a complete answer is obtained, one that specializes to that of Yu et al. A similar outcome is obtained for L and R. In the case of H, only the completely semisimple case is fully resolved, again specializing to those of Yu et al

    NEW METHODS FOR SOLVING ALGEBRAIC EQUATIONS

    Get PDF
    Iteration methods are very useful in solving nonlinear algebraic equations. The most famous such method is Newton’s method deduced by first order Taylor expansion. In 2003, J. H. He gives a new faster convergent method, based on second order Taylor expansion, that gives a quadratic equation for the iterations difference xn+1-xn . However He’s method is not applicable when this equation has complex roots. In 2008, D. Wei, J. Wu and M. Mei eliminated this deficiency, obtaining from third order Taylor expansion a cubic equation, that always has a real root. In this paper, we present the three methods and their applications to some particular equations.equations

    Power Partial Isometry Index and Ascent of a Finite Matrix

    Full text link
    We give a complete characterization of nonnegative integers jj and kk and a positive integer nn for which there is an nn-by-nn matrix with its power partial isometry index equal to jj and its ascent equal to kk. Recall that the power partial isometry index p(A)p(A) of a matrix AA is the supremum, possibly infinity, of nonnegative integers jj such that I,A,A2,,AjI, A, A^2, \ldots, A^j are all partial isometries while the ascent a(A)a(A) of AA is the smallest integer k0k\ge 0 for which kerAk\ker A^k equals kerAk+1\ker A^{k+1}. It was known before that, for any matrix AA, either p(A)min{a(A),n1}p(A)\le\min\{a(A), n-1\} or p(A)=p(A)=\infty. In this paper, we prove more precisely that there is an nn-by-nn matrix AA such that p(A)=jp(A)=j and a(A)=ka(A)=k if and only if one of the following conditions holds: (a) j=kn1j=k\le n-1, (b) jk1j\le k-1 and j+kn1j+k\le n-1, and (c) jk2j\le k-2 and j+k=nj+k=n. This answers a question we asked in a previous paper.Comment: 11 page
    corecore