The reaction of three types of carbon nanofibers (CNFs; platelet: CNF-P, tubular: CNF-T, herringbone: CNF-H) with [Ru3(CO)12] in toluene heated at reflux provided the corresponding CNF-supported ruthenium nanoparticles, Ru/CNFs (Ru content = 1.1-3.8 wt %). TEM studies of these Ru/CNFs revealed that size-controlled Ru nanoparticles (2-4 nm) exist on the CNFs, and that their location was dependen...

In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverab...

data type interface class (Figure 7.13). There is an explicit abstract base class for each data type, from which both the regular and the recoverable version are derived. derive recoverable from regular versions (Figure 7.14). We use the regular classes as base classes for the recoverable versions. 7.4. DETAILED DESIGN AND IMPLEMENTATION 147

Two high-performance Cu catalysts were successfully developed by immobilization of Cu ions in the nanospaces of poly(propylene imine) (PPI) dendrimer and magadiite for the selective C-C coupling of 2,6-dimethylphenol (DMP) to 3,3',5,5'-tetramethyldiphenoquinone (DPQ) with O2 as a green oxidant. The PPI dendrimer encapsulated Cu ions in the internal nanovoids to form adjacent Cu species, which e...

In this work, an efficient and facile method has been developed for the synthesis of 2,3-dihydroquinazolin-4(1H)-ones from a condensation reaction of 2-aminobenzamide with various alkyl,aryl and alicyclic aldehydes or ketones using Fe3O<span class="fontstyle0" styl...

This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A strongly polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem generalizes the incremental spanning tree problem, previously discussed in literature. The algorithm built is then applied to solve the recoverable robust sp...

A number of recent publications explain NBTI to be due to a recoverable and a more permanent component. While a lot of information has been gathered on the recoverable component, the permanent component has been somewhat elusive. We demonstrate that oxide defects commonly linked to the recoverable component also form an important contribution to the permanent component of NBTI. As such, they ca...

In this paper, we propose a recoverable DSM that uses a competitive update protocol. In this update protocol, multiple copies of each page may be maintainedat different nodes. However, it is also possible fora page to exist in only one node, as some copies of the page may be invalidated. We propose an implementation that makes the competitive update protocol recoverable from a single node failu...