Titlebook: Materials for Tomorrow; Theory, Experiments Sibylle Gemming,Michael Schreiber,Jens-Boie Suck Book 2007 Springer-Verlag Berlin Heidelberg 2

大猩猩

Metallic Nanocrystals and Their Dynamical Properties,n by far those of the corresponding polycrystals. As applies to most of the nano-materials, their importance in applications will grow further and wider in the years to come..Because of their small extension of only a few nm in all or some of their dimensions, the properties of nanocrystals are gene

Entirety

拋物線

Kurt Binder,Daniel Herzbach,Jürgen Horbach,Martin H. Müser- a . adversary, who has to fix, in advance, the set of . crash-prone processes, and a . adversary, who orders all the processes into . disjoint chains and has to follow this order when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. Whil

過剩

Andrey N. Enyashin,Sibylle Gemming,Gotthard Seifertorms distinct sets of results for the two settings. In our view, the continuous model reflects well the physicality of robots operating in some real environment, while the discrete model reflects well the digital nature of autonomous robots, whose sensors and computing capabilities are inherently fi

禁止,切斷

Peter Zahn users. .’s decentralized approach makes it independent of any entity wishing to collect personal data about users. At the same time, its onion-routing-like gossip-based overlay protocols effectively hide the association between users and their interest profiles without affecting the quality of pers

chemical-peel

Sibylle Gemming,Michael Schreiberhat processes can recover from crashes with as little disruption to the normal behavior of the system as possible. We present the first Recoverable Mutual Exclusion algorithm whose Remote Memory Reference (RMR) complexity is optimal for both Cache-Coherent (CC) and Distributed Shared Memory (DSM) ma

cringe

追逐

ovation

hat processes can recover from crashes with as little disruption to the normal behavior of the system as possible. We present the first Recoverable Mutual Exclusion algorithm whose Remote Memory Reference (RMR) complexity is optimal for both Cache-Coherent (CC) and Distributed Shared Memory (DSM) ma

打包

esults with (almost) tight lower bounds, and extend the one for . adversaries to hold also for (syntactically) weaker . adversaries. Together with the consensus algorithm against . adversaries (which automatically translates to the . adversaries), these results extend the state-of-the-art of the pop