302 research outputs found
Selling the way your customer buys : understand your prospect s unspoken needs and close every sale/ Sadovsky
No full textix, 166 hal. : ill. ; 24 c
Selling the way your customer buys : understand your prospect s unspoken needs and close every sale/ Sadovsky
No full textix, 166 hal. : ill. ; 24 c
The Reverse of the Curse: Paul, Wisdom, and the Law
No full textC. Marvin Pate examines the undisputed Pauline writings and demonstrates that wherever Paul employs the theme of wisdom, he does so to reverse the Deuteronomic curses and blessings. The covenantal blessings rest on those whose faith is in Christ, the wisdom of God, while the covenantal curses abide on those who attempt to obey the Torah. All of this results from Paul\u27s separation of Christ, God\u27s wisdom, from the law of Moses.
In addition, the author deals with two secondary themes. First of all, he calls the \u27new perspective\u27 on Paul into question. Secondly, a revised form of the \u27Tubingen theory\u27 is put forth. Both of these points call scholarship back to a more Lutheran reading of the subject of Pauline theology, emphasizing the importance of law and gospel therein. (From the publisher\u27s website.)https://scholarlycommons.obu.edu/mono/1026/thumbnail.jp
Letter to Supporters of Griffin's Campaign for Governor of Georgia
Get PDFTitle: Letter to Supporters of Griffin's Campaign for Governor of Georgia
Author: Marvin Griffin
Date: 1962-08-03
2 Pages, 1 Copy
#11412
Format: Book; U-CRPaperMarvin Griffin, a staunch segregationist, ran for Governor of Georgia in 1962 against Carl Sanders. Griffin used his segregationist credentials openly and the Confederate flag on his letterhead reflects the famous and controversial change. Griffin's letter mentions Martin Luther King, the C&S Bank and the NAACP. Sanders won, prompting Griffin to say, "A lot of people that ate my barbecue didn't vote for me.
Obtaining a grammar from a less formal language description
No full textIn this paper, we will try to show how CF-grammars can be constructed to describe sets of strings;* each string being of a type which is commonly found in programming languages. We will require that these grammars not only describe the syntax of such sets of strings, but also more importantly, reflect unambiguously in the derivation of these strings, the ordering or sequencing conventions commonly imposed on such strings. We will show how these grammars can be used to formally describe, at least in part, two aspects of programming language-operations operations. We will also be concerned with the case in which the grammars can be used to determine this ordering. The grammars we develop will be one of a number of possible grammars, each different in non-superficial ways, and each adequate to express the class of languages we will discuss.
A large part of the material presented here is tutorial. The material on constructing a grammar to satisfy a set of precedence relations constitutes the main contribution reported here.
We start by considering a non-CFG way of describing ordering conventions in an algebraic expression involving a number of appearances of a group of binary infix operations. This technique - precedence - has immediate appeal because of its familiarity as much, perhaps, because of its simplicity. After discussing precedence in some detail, we will show how some of the same effects can be-obtained with CFG's.
Precedence is a common device for describing the order in which operations are to be performed in expressions of the form: a + b * c ** b + c * e...Technical report DCS-TR-
Microstructure-properties relationships in yttrium- and bismuth-based high critical transition temperature superconductors
No full textRestriction data tranferred 2014-07-01T11:25:04-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I OnlyThe thermodynamic and kinetic behavior of superconducting phases during the crystallization annealing process have been observed and analyzed in crystallized Bi-Sr-Ca-Cu-O glass samples. The microstructural characteristics of the 85 K and 110 K phases, and impurities and defects in crystallized samples were studied using transmission electron microscopy. The density of precipitates and lattice defects is greatly increased as the calcium and copper content of the starting materials increase.The magnetization critical current density J\sb{\rm c} has been found to increase about 100 times in magnitude as the density of impurities and lattice defects is increased. Analysis indicates that the Ca- and Cu-rich precipitates could act as normal and volume pins via magnetic interaction.The superconducting transition temperature T\sb{\rm c} has been found to vary in YBa\sb2Cu\sb3O\sb{\rm x} samples with different oxygen stoichiometry. The magnetization J\sb{\rm c} are strongly affected by the variation of the superconducting properties and the microstructure. Twin boundaries could serve as a type of pinning center with normal and surface pins via core interaction.The microstructures of polycrystalline YBa\sb2Cu\sb3O\sb{\rm x} were varied through different sintering conditions to study transport-current characteristics in a magnetic field. Transport critical current density J\sb{\rm c} (H) is severely suppressed as the grain boundaries are contaminated with second phases. The critical-current behavior and closely related microstructural changes are explained by a Josephson weak-link model.YBa\sb2Cu\sb3O\sb{\rm x} compounds fabricated by a zone melting process showed a significantly enhanced magnetization J\sb{\rm c} and transport J\sb{\rm c} in magnetic field. Dominant low-angle grain boundaries, a high density of dislocations and dispersed fine Y\sb2BaCuO\sb5 particles have been found in the samples. The microstructural characteristics of these defects were studied using analytical TEM. The origin of the defects and impurities as well as their roles acting as effective flux pinning centers are also discussed.Made available in DSpace on 2011-05-07T13:23:02Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9210763.pdf: 6909095 bytes, checksum: 12049ebc550d82862cdb7b987e2d17bb (MD5)
Previous issue date: 1991Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:54:03Z
Item is restricted indefinitely
Sets of set-equations equivalent to context-free grammars and their solution in some cases
No full textTechnical report DCS-TR-
Equivalence of some classes of algorithms
No full textOur objective is to find large classes of equivalent programs which can be simply characterized so that it is possible to choose from amongst them the program which is optimum by some reasonable criterion. We would like to do this for as high a level of programming language as possible. In this paper, we will consider some easily characterized classes of equivalent programs and some techniques for optimizing over such classes of equivalent programs. In general when we speak of two descriptions of an algorithm being equivalent, we mean that they both produce the same output for the same inputs. The programs we will consider will consist, at first, of ordered sequences of assignment statements of the form: X = f(Xl, ... Xn) Such a language is not the same as any real programming language. It is more like a flow chart language. It is more chosen for simplicity. It will also be seen that for certain kinds of optimizing of more realistic programming languages, we can optimize in the above language and that optimization will carry over when we translate to a more realistic programming language. The classes of equivalent programs we will consider will each he characterized by an array of "black boxes". Each program in such a class will have the property that it has one assignment statement for each box in the characterizing array of a form which is directly related to that block and each program is equivalent to the characterizing array in that it will produce the same output as the array when presented with the same input. We will call such programs 1-equivalent to their characterizing array.Technical report dcs-tr-
On the number of maximal compatibles
No full textThe execution time of an algorithm to produce all maximal compatibles [1] given all pair wise compatible states of a finite state machine is strongly dependent on the number of such maximal compatibles possible in an N state machine. The problem of finding the maximum number of such maximal compatibles is equivalent to the problem of finding the maximum possible number of completely connected sub graphs, not included in any other such sub graphs, in an N node graph. The relation of these two problems has been disscussed by R. Das [2]. In this paper the problem is considered in its graph formulation. It is shown that if a graph has the maximum number of such sub graphs they must each contain the same number of nodes and that the maximum number of such subgraphs for N node graphs is =3 if N is divisible by 3, (2/3)2 . 3[N/3] if N mod 3 = 1, and (2/3).3[N/3] if N mod 3 = 2. A bound on the number of such sub graphs is also given in terms of the degree of the nodes of the graph.Technical report DCS-TR-2
- …
