Filters








91,290 Hits in 2.8 sec

Michael Schmidt, Cartographie de l'anarchisme révolutionnaire

Jacques Ghiloni
2012 Lectures  
Michael Schmidt , Cartographie de l'anarchisme révolutionnaire Texte intégral 1Michael Schmidt, journaliste sud-africain et militant anarchiste, remet en cause l’historiographie traditionnelle anarchiste  ...  Michael Schmidt propose un récit plus large de l’histoire du mouvement anarchiste. 1 Irène Pereira, L'anarchisme dans les textes.  ... 
doi:10.4000/lectures.9806 fatcat:ydeadr4jibgixcmb52xurzl2tq

Michael Kallesøe Schmidt: Forfatterpoetik. En genres historie

Per Erik Ljung
2019 Nordisk Poesi: Tidsskrift for Lyrikkforskning  
Men en författarpoetik, det är i Michael Kallesøe Schmidts stränga och användbara terminologi i Forfatterpoetik.  ...  Men självklart ser det, som Michael Kallesøe Schmidt skriver, olika ut på nationell nivå.  ...  Till stor hjälp när man kommer till de decentrerade publiceringsstrategierna hos t ex Michael Thykier är Michael Kallesøe Schmidts outröttliga textkritiska akribi.  ... 
doi:10.18261/issn.2464-4137-2019-01-05 fatcat:2quhp557efhcbfo2ctf2yeha7q

3-Pyrrolidinones: Michael Addition and Schmidt Rearrangement Reactions

F. A. Amer, M. Hammouda, A. A. S. El-Ahl, B. F. Abdel-Wahab
2009 Synthetic Communications  
Hexahydro-4oxo-1-aryl-pyrimidine-5-carboxylic acids 7a,b were synthesized from 1 by Schmidt rearrangement.  ...  Various spiro-pyrano[3,2-b]pyrrolo-2-oxoindolines 3a-d and dicyanopyrano [3,2b]pyrroles 5a-e have been synthesized in the present study by Michael addition of 3pyrrolidinones 1 to isatin-3-ylidenes 2 and  ...  Title: IMPROVED SCHMIDT SYNTHESIS OF 1,5-DISUBSTITUTED 1H-TETRAZOLES FROM KETONES Author(s): SUZUKI, H; HWANG, YS; NAKAYA, C; et al.  ... 
doi:10.1080/00397910802378373 fatcat:mjayxamopvh4lconaaeg6ekqe4

Jens Lohfert Jørgensen, Louise Mønster og Michael Kallesøe Schmidt (red.): En ny kritik

Andreas G. Lombnæs
2021 Edda  
Michael Kallesøe Schmidt følger opp med en oversikt over den litteraturpedagogiske debatt i Danmark på 1960-tallet.  ... 
doi:10.18261/issn.1500-1989-2021-02-08 fatcat:jz2eic5qv5fc3eebqpfxu4mz74

Tirpitz. Aufstieg-Macht-Scheitern, by Michael SalewskiTirpitz. Aufstieg-Macht-Scheitern, by Michael Salewski. Muster-Schmidt Verlag, Göttingen, Frankfurt, Zürich, 1979. 114 pp. DM 10,80 paperback

Holger H. Herwig
1981 Canadian Journal of History  
Aufstieg-Macht-Scheitern, by Michael Salewski. Muster- Schmidt Verlag, Gottingen, Frankfurt, Zurich, 1979. 114 pp. DM 10,80 paperback.  ...  Golovin’s Last Report, 1862 Handler, Blood Libel at Tiszaeszlar 332 Michael R. Marrus Bruchey, ed., Small Business in 334 John N.  ... 
doi:10.3138/cjh.16.2.340 fatcat:slhddsud55auvkw63bma7dol4m

A Review of :"Brain-Building Nutrition: How Dietary Fats and Oils Affect Mental, Physical, and Emotional Intelligence. Michael A. Schmidt, PhD."

Randall R. Lyle
2011 Journal of Neurotherapy  
Michael A. Schmidt, PhD. Frog Books, Berkeley, California, 2007, Third Edition, 336 pages, ISBN: 978-1-58394-181-2. The human brain is nearly 60 percent fat.  ...  Michael Schmidt was one of the presenters at 2010 ISNR Annual Conference in Denver, Colorado. He began his talk with several case studies that were both heartwarming and dramatic.  ... 
doi:10.1080/10874208.2011.570685 fatcat:nblyc65hafcyder4b4juwiflci

"Verteufelt human"? Zum Humanitatsideal der Weimarer Klassik. Herausgegeben von Volker C. Dorr und Michael Hofmann. Bielefeld: Erich Schmidt, 2008. 200 Seiten. 39,80

E. Bahr
2009 Monatshefte  
Dérr und Michael Hofmann. Bielefeld: Erich Schmidt, 2008. 200 Seiten. €39,80.  ...  Der Mitherausgeber Michael Hofmann hat sich in seinem Beitrag tiber Krise und Erneuerung des Humanitits-Paradigmas bescheidener ausge- driickt, wenn er von einem “reflektierten und selbstkritischen Humanismus  ... 
doi:10.1353/mon.0.0121 fatcat:ooh2ykm24fdcnfixbtp42kmpmu

Computing Nonsimple Polygons of Minimum Perimeter [article]

Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel
2016 arXiv   pre-print
We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techniques, we prove how the topological structure of
more » ... polygon leads to NP-hardness of the MPP. On the positive side, we show how to achieve a constant-factor approximation. When trying to solve MPP instances to provable optimality by means of integer programming, an additional difficulty compared to the TSP is the fact that only a subset of subtour constraints is valid, depending not on combinatorics, but on geometry. We overcome this difficulty by establishing and exploiting additional geometric properties. This allows us to reliably solve a wide range of benchmark instances with up to 600 vertices within reasonable time on a standard machine. We also show that using a natural geometry-based sparsification yields results that are on average within 0.5% of the optimum.
arXiv:1603.07077v1 fatcat:fejltaj42fc6tiqwh5pbfthfry

Relational Mathematics Continued [article]

Gunther Schmidt, Michael Winter
2014 arXiv   pre-print
This is in some sense an addendum to the book Relational Mathematics by the first-named author. It originated from work on diverse other topics during which a lot of purely relational results with broad applicability have been produced. These include results on domain construction with novel formulae for existential and inverse image, a relational calculus for binary mappings, and the development of a formally derived relational calculus of Kronecker-, strict fork-, and strict join-operators.
more » ... e many visualizations in this report make it also a scrap- and picture book for examples.
arXiv:1403.6957v1 fatcat:nzkvf4gtifcinlm4svpgguzrmy

Reply to Michael Behe

R. Durrett, D. Schmidt
2008 Genetics  
In Behe (2009) , the accompanying Letter to the Editors in this issue, Michael Behe writes (here and in what follows italicized quotes are from his letter), ''. . . their model is incomplete on its own  ...  ''For the rate of the first mutation Durrett and Schmidt use a value estimated for the alteration of a transcription-factorbinding site, where any of 10 nucleotides could be changed.  ... 
doi:10.1534/genetics.109.100800 fatcat:uwwvn2b2ojel7kehhvuphwcvcu

Stop the Chase [article]

Michael Meier and Michael Schmidt and Georg Lausen
2009 arXiv   pre-print
The chase procedure, an algorithm proposed 25+ years ago to fix constraint violations in database instances, has been successfully applied in a variety of contexts, such as query optimization, data exchange, and data integration. Its practicability, however, is limited by the fact that - for an arbitrary set of constraints - it might not terminate; even worse, chase termination is an undecidable problem in general. In response, the database community has proposed sufficient restrictions on top
more » ... f the constraints that guarantee chase termination on any database instance. In this paper, we propose a novel sufficient termination condition, called inductive restriction, which strictly generalizes previous conditions, but can be checked as efficiently. Furthermore, we motivate and study the problem of data-dependent chase termination and, as a key result, present sufficient termination conditions w.r.t. fixed instances. They are strictly more general than inductive restriction and might guarantee termination although the chase does not terminate in the general case.
arXiv:0901.3984v2 fatcat:wg327q5fzbajvlau6dzuiwbpoy

Resolvents of functions of operators with Hilbert-Schmidt hermitian components

Michael Gil'
2018 Filomat  
We derive a sharp norm estimate for the operator function (λI − f (A)) −1 (λ ∈ C), where A is a bounded linear operator in H whose Hermitian component (A − A * )/2i is a Hilbert-Schmidt operator and f  ...  R λ (A) = (A − λI) −1 (λ σ(A)) is the resolvent; co(A) is the convex hull of σ(A); SN 2 is the Hilbert-Schmidt ideal with the norm N 2 (A) = (Trace A * A) 1/2 .  ...  Then sv f (A) ( f (Ã)) ≤ sup z∈co(A,Ã) is a positive bounded measurable function and k(x, s) is a Hilbert-Schmidt kernel defined on [operators S,V and W by (Sh)(x) = φ(x)h(x), x, s)h(s)ds (h ∈ L 2 ,  ... 
doi:10.2298/fil1814937g fatcat:w7dyh3zoire6rlq3esex6nbyfa

Laser Alloying Advantages by Dry Coating Metallic Powder Mixtures with SiOx Nanoparticles

Michael C. H. Karg, Michael Rasch, Konstantin Schmidt, Sophia A. E. Spitzer, Till F. Karsten, Daniel Schlaug, Cosmin-Rudolf Biaciu, Andrey I. Gorunov, Michael Schmidt
2018 Nanomaterials  
Up to now, minimizing segregation of free-flowing, microscale metal powder mixtures driven by different mass density is an open challenge. In this work, effects of particle size variation on homogeneity of Al-Cu mixtures, with a density ratio of 3.3, are examined. Dry coating Al particles with 0.3 wt% fumed silica SiOx nanoparticles significantly decreases interparticle attraction. This enlarges the range of free-flowing Al particle sizes to < 20 µm. Powder mixture homogeneity is examined
more » ... lly in vibrated bulk powder and thinly spread layers. From various powder mixtures, solid samples are built layer by layer with the Additive Manufacturing (3D printing) technology Laser Beam Melting in metal powder bed (LBM). Chemical homogeneity of solids is evaluated via energy-dispersive X-ray spectroscopy, backscattered electron microscopy, metallographic analysis and tensile tests. Persistent homogeneity of Al-Cu powder mixtures and LBM solids is found only with particles < 20 µm dry coated with SiOx nanoparticles. Observed segregation phenomena are explained with a decrease in particle mobility at increasing local concentration and the decreasing effectiveness of mass in smaller particles. The main effects are based on geometry, so they are expected to be transferrable to other nanoparticles, alloying components and powder bed technologies, e.g., binder jetting.
doi:10.3390/nano8100862 pmid:30347881 pmcid:PMC6215105 fatcat:353ma2u2jrdp5mw2iclbe2njlu

On Chase Termination Beyond Stratification [article]

Michael Meier, Michael Schmidt, Georg Lausen
2009 arXiv   pre-print
We study the termination problem of the chase algorithm, a central tool in various database problems such as the constraint implication problem, Conjunctive Query optimization, rewriting queries using views, data exchange, and data integration. The basic idea of the chase is, given a database instance and a set of constraints as input, to fix constraint violations in the database instance. It is well-known that, for an arbitrary set of constraints, the chase does not necessarily terminate (in
more » ... neral, it is even undecidable if it does or not). Addressing this issue, we review the limitations of existing sufficient termination conditions for the chase and develop new techniques that allow us to establish weaker sufficient conditions. In particular, we introduce two novel termination conditions called safety and inductive restriction, and use them to define the so-called T-hierarchy of termination conditions. We then study the interrelations of our termination conditions with previous conditions and the complexity of checking our conditions. This analysis leads to an algorithm that checks membership in a level of the T-hierarchy and accounts for the complexity of termination conditions. As another contribution, we study the problem of data-dependent chase termination and present sufficient termination conditions w.r.t. fixed instances. They might guarantee termination although the chase does not terminate in the general case. As an application of our techniques beyond those already mentioned, we transfer our results into the field of query answering over knowledge bases where the chase on the underlying database may not terminate, making existing algorithms applicable to broader classes of constraints.
arXiv:0906.4228v2 fatcat:dmq3dhpikndipppcc5lzi4awzq

Foundations of SPARQL Query Optimization [article]

Michael Schmidt, Michael Meier, Georg Lausen
2009 arXiv   pre-print
The SPARQL query language is a recent W3C standard for processing RDF data, a format that has been developed to encode information in a machine-readable way. We investigate the foundations of SPARQL query optimization and (a) provide novel complexity results for the SPARQL evaluation problem, showing that the main source of complexity is operator OPTIONAL alone; (b) propose a comprehensive set of algebraic query rewriting rules; (c) present a framework for constraint-based SPARQL optimization
more » ... sed upon the well-known chase procedure for Conjunctive Query minimization. In this line, we develop two novel termination conditions for the chase. They subsume the strongest conditions known so far and do not increase the complexity of the recognition problem, thus making a larger class of both Conjunctive and SPARQL queries amenable to constraint-based optimization. Our results are of immediate practical interest and might empower any SPARQL query optimizer.
arXiv:0812.3788v2 fatcat:s6bjkwtlqjf5zmkxy46oof3y4m
« Previous Showing results 1 — 15 out of 91,290 results