نتایج جستجو برای: روش pwscfکد محاسباتی espresso

تعداد نتایج: 372045  

Journal: :Serials: The Journal for the Serials Community 2010

2005
Nadia Ansini Andrea Braides Valeria Chiadò Piat

Riassunto. Si studia il comportamento asintotico di una classe di funzionali integrali che possono dipendere da misure concentrate su strutture periodiche multidimensionali, quando tale periodo tende a 0. Il problema viene ambientato in spazi di Sobolev rispetto a misure periodiche. Si dimostra, sotto ipotesi generali, che un appropriato limite può venire definito su uno spazio di Sobolev usual...

2007
Alex Loscos

............................................................................................................................. v Resumen........................................................................................................................... vii Resum................................................................................................................................ ...

Journal: :Organic & biomolecular chemistry 2015
Jeremy Just Timothy B Jordan Brett Paull Alex C Bissember Jason A Smith

Polygodial, a valuable sesquiterpene dialdehyde featuring an epimerizable stereocenter was efficiently extracted and isolated in gram-scale quantities (3.3% w/w) from Tasmannia lanceolata (Tasmanian native pepper) via a recently developed rapid pressurised hot water extraction (PHWE) technique that utilises an unmodified household espresso machine. This method was compared to the maceration of ...

2002
Andrei B. Khlopotine Marek Perkowski Pawel Kerntopf

A reversible circuit maps each output vector into a unique input vector, and vice versa. CMOS reversible / adiabatic circuits are currently the most important approaches to power optimization. This paper introduces an approach to synthesize generalized multi-rail reversible cascades for singleoutput Boolean functions. Minimizing the “garbage bits” is the main challenge of reversible logic synth...

1993
Robert K. Brayton Patrick C. McGeer Jagesh V. Sanghavi

We present a new algorithm for exact two-level logic optimization. It diiers from the classical approach; rather than generating the set of all prime implicants of a function, and then deriving a covering problem, we derive the covering problem directly and implicitly, and then generate only those primes involved in the covering problem. We represent a set of primes by the cube of their interse...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید