نتایج جستجو برای: completely 0
تعداد نتایج: 705368 فیلتر نتایج به سال:
Eg̃eciog̃lu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define a sign-reversing involution on rooted special rim-hook tableaux which can be used to prove that the last column o...
In this work, the structural and magnetic properties of LaMn1-xCoxO3 (x = 0.00, 0.25, 0.50, 0.75, 1.00) are investigated. The structural characterization of compounds by X-ray powder diffraction is evidence for a rhombohedral structure (R -3c space group). Much less increase of the unit cell volume suggests that Co enters in lattice as Co+2 for x ≤ 0.5 while much more decrease of the unit cell ...
I take the first part of the title of my essay from a character in Mary Wroth’s Urania , dubbed the Lady of the Oddest Passion, who makes a fleeting appearance in book 3. 1 This lady, described as “most loving, most discreet” (452), is loved by, and in return loves equally, two men. All three were content with this situation for a time, but ultimately the Lady is pressed to choose between the s...
This article examines explanations for both Internet use and non-use by older individuals. Older adults are often considered a homogeneous group with uniform reasons for Internet non-use, or when they are online, practising a uniform range of activities. The study gathered data concerning senior non-users through a national telephone survey. Data concerning senior Internet users were obtained t...
Telling stories is different from reading out text: a speaker reponds to the listener’s feedback and incorporates this into the ongoing talk. However, current computer systems are unable to do this and instead just non-attentively read out a text, disregarding all feedback (or the absence thereof). I propose and discuss an idea for a small research project and a plan for how an attentive listen...
Completely iterative theories of Calvin Elgot formalize (potentially infinite) computations as solutions of recursive equations. One of the main results of Elgot and his coauthors is that infinite trees form a free completely iterative theory. Their algebraic proof of this result is extremely complicated. We present completely iterative algebras as a new approach to the description of free comp...
0
0
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید