940 resultados para Newton, Benjamin Wills.
Resumo:
2005
Resumo:
2005
Resumo:
2005
Resumo:
2005
Resumo:
2005
Resumo:
Plakhov, A.Y.; Torres, D., (2005) 'Newton's aerodynamic problem in media of chaotically moving particles', Sbornik: Mathematics 196(6) pp.885-933 RAE2008
An Address delivered in the Mercer Street Church at the funeral of the Hon. Benjamin Franklin Butler
Resumo:
Address
Resumo:
Memoriam.
Resumo:
http://www.archive.org/details/universalmission00helluoft
Resumo:
http://www.archive.org/details/womenofachieveme00brawrich
Resumo:
Die Autorin zeigt anhand der Interpretation des Textstücks „Schmetterlingsjagd“ aus Walter Benjamins „Berliner Kindheit um neunzehnhundert“ welche pädagogischen Einsichten gewonnen werden können. Dabei zeigt sich, dass das Kind einen mimetischen Zugang zum Schmetterling einnimmt, um ihn fangen zu können und ihn für seine Sammlung zu sezieren. D.h. der kindliche Zugang des Sich-Ähnlich-Machens wird von Benjamin dialektisch erinnert: er ist nicht nur ein sanftes Sich-Nähern an die Gegenstände der Welt, sondern unterliegt bereits in der Kindheit einer instrumentellen Verwendung. Erst diese sichert, dass das Kind seinen Platz in der Gesellschaft wird finden können. (DIPF/Autorin)
Resumo:
Quasi-Newton methods are applied to solve interface problems which arise from domain decomposition methods. These interface problems are usually sparse systems of linear or nonlinear equations. We are interested in applying these methods to systems of linear equations where we are not able or willing to calculate the Jacobian matrices as well as to systems of nonlinear equations resulting from nonlinear elliptic problems in the context of domain decomposition. Suitability for parallel implementation of these algorithms on coarse-grained parallel computers is discussed.
Resumo:
Those temporal formalisms that are sporadically found nowadays in the literature of AI & Law are based on temporal logic. We claim a revived role for another major class of temporal representation: Petri nets. This formalism, popular in computing from the 1970s, had its potential recognized on occasion in the literature of legal computing as well, but apparently the discipline has lost sight of it, and its practitioners on average need be tutored into this kind of representation. Asynchronous, concurrent processes—for which the approach is well‐suited—are found in the legal domain, in disparate contexts. We develop an example for Mutual Wills.