Polymeric carbon nanocomposites from multiwalled carbon nanotubes functionalized with segmented polyurethane

Multiwalled carbon nanotubes (MWNT) were functionalized with segmented polyurethanes (PU) by the “grafting to” approach. Raman and X‐ray photoelectron spectroscopy (XPS) spectra show that the sidewalls of MWNTs have been functionalized with acid treatment, and the amount of COOH increases with increasing acid treatment time. FTIR and X‐ray diffraction (XRD) spectra confirm that PU is covalently attached to the sidewalls of MWNTs by esterification reaction. Similar to the parent PU, the functionalized carbon nanotube samples are soluble in highly polar solvents, such as dimethyl sulfoxide (DMSO) and N,N‐dimethylformamide (DMF). The functionalized acid amount and the grafted PU amount were determined by thermogravimetric analyses (TGA). Comparative studies, based on SEM images between the PU‐functionalized and chemically defunctionalized MWNT samples, also reveal the covalent coating character. Dynamic mechanical analysis (DMA) of nanocomposite films prepared from PU and PU‐functionalized MWNTs show enhanced mechanical properties and increased soft segment T_g. Tensile properties indicate that PU‐functionalized MWNTs are effective reinforcing fillers for the polyurethane matrix. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 2007     

Hybrid Subset Simulation method for reliability estimation of dynamical systems subject to stochastic excitation

A hybrid Subset Simulation approach is proposed for reliability estimation for general dynamical systems subject to stochastic excitation. This new stochastic simulation approach combines the advantages of the two previously proposed Subset Simulation methods, Subset Simulation with Markov Chain Monte Carlo (MCMC) algorithm and Subset Simulation with splitting. The new method employs the MCMC algorithm before reaching an intermediate failure level and splitting after reaching the level to exploit the causality of dynamical systems. The statistical properties of the failure probability estimators are derived. Two examples are presented to demonstrate the effectiveness of the new approach and to compare with the previous two Subset Simulation methods. The results show that the new method is robust to the choice of proposal distribution for the MCMC algorithm and to the intermediate failure events selected for Subset Simulation.     

Multi-Scale Spoken Document Retrieval for Cantonese Broadcast News

This paper presents the application of a multi-scale paradigm to Chinese spoken document retrieval (SDR) for improving retrieval performance. Multi-scale refers to the use of both words and subwords for retrieval. Words are basic units in a language that carry lexical meaning, and subword units (such as phonemes, syllables or characters) are building components for words. Retrieval using subword indexing units is better than retrieval using words because of the robustness of subword units to out-of-vocabulary (OOV) words during speech recognition and ambiguities in word segmentation. Experimental results have demonstrated that subword bigrams can bring improvement in retrieval performance over words (～9.56%). Application of multi-scale fusion to SDR aims at combining the lexical information of words and the robustness of subwords. This work presents the first detailed investigation for a Cantonese broadcast news retrieval task using two different multi-scale fusion approaches: pre-retrieval fusion and post-retrieval fusion. Multi-scale retrieval using both words and syllable bigrams achieves improvement in retrieval performance (～1.90%) over retrieval on the composite scales.     

Performance comparison between the training method and the numerical method of the orthogonal neural network in function approximation

The orthogonal neural network is a recently developed neural network based on the properties of orthogonal functions. It can avoid the drawbacks of traditional feedforward neural networks such as initial values of weights, number of processing elements, and slow convergence speed. Nevertheless, it needs many processing elements if a small training error is desired. Therefore, numerous data sets are required to train the orthogonal neural network. In the article, a least‐squares method is proposed to determine the exact weights by applying limited data sets. By using the Lagrange interpolation method, the desired data sets required to solve for the exact weights can be calculated. An experiment in approximating typical continuous and discrete functions is given. The Chebyshev polynomial is chosen to generate the processing elements of the orthogonal neural network. The experimental results show that the numerical method in determining the weights gives as good performance in approximation error as the known training method and the former has less convergence time. © 2004 Wiley Periodicals, Inc. Int J Int Syst 19: 1257–1275, 2004.     

Investigation of wall mass transfer characteristics downstream of an orifice

Numerical simulations were performed to determine the effect of Reynolds number and orifice to pipe diameter ratio (d_o/d) on the wall mass transfer rate downstream of an orifice. The simulations were performed for d_o/d of 0.475 for Reynolds number up to 70,000. The effect of d_o/d was determined by performing simulations at a Reynolds number of 70,000 for d_o/d of 0.375, 0.475 and 0.575. The momentum and mass transport equations were solved using the Low Reynolds Number (LRN) K-? turbulence model. The Sherwood number (Sh) profile downstream of the orifice was in relatively good agreement with existing experimental results. The Sh increases sharply downstream of the orifice, reaching a maximum within 1–2 diameters downstream of the orifice, before relaxing back to the fully developed pipe flow value. The Sh number well downstream of the orifice was in good agreement with results for fully developed pipe flow estimated from the correlation of Berger and Hau (1977). The peak Sh numbers from the simulations were higher than that predicted from Tagg et al. (1979) and Coney (1980).     

Approximation of graph edit distance based on Hausdorff matching

Graph edit distance is a powerful and flexible method for error-tolerant graph matching. Yet it can only be calculated for small graphs in practice due to its exponential time complexity when considering unconstrained graphs. In this paper we propose a quadratic time approximation of graph edit distance based on Hausdorff matching. In a series of experiments we analyze the performance of the proposed Hausdorff edit distance in the context of graph classification and compare it with a cubic time algorithm based on the assignment problem. Investigated applications include nearest neighbor classification of graphs representing letter drawings, fingerprints, and molecular compounds as well as hidden Markov model classification of vector space embedded graphs representing handwriting. In many cases, a substantial speedup is achieved with only a minor loss in accuracy or, in one case, even with a gain in accuracy. Overall, the proposed Hausdorff edit distance shows a promising potential in terms of flexibility, efficiency, and accuracy.     

Bioadhesive Polymersome for Localized and Sustained Drug Delivery at Pathological Sites with Harsh Enzymatic and Fluidic Environment via Supramolecular Host–Guest Complexation

Targeted and sustained delivery of drugs to diseased tissues/organs, where body fluid exchange and catabolic activity are substantial, is challenging due to the fast cleansing and degradation of the drugs by these harsh environmental factors. Herein, a multifunctional and bioadhesive polycaprolactone‐β‐cyclodextrin (PCL‐CD) polymersome is developed for localized and sustained co‐delivery of hydrophilic and hydrophobic drug molecules. This PCL‐CD polymersome affords multivalent crosslinking action via surface CD‐mediated host–guest interactions to generate a supramolecular hydrogel that exhibits evident shear thinning and efficient self‐healing behavior. The co‐delivery of small molecule and proteinaceous agents by the encapsulated PCL‐CD polymersomes enhances the differentiation of stem cells seeded in the hydrogel. Furthermore, the PCL‐CD polymersomes are capable of in situ grafting to biological tissues via host–guest complexation between surface CD and native guest groups in the tissue matrix both in vitro and in vivo, thereby effectively extending the retention of loaded cargo in the grafted tissue. It is further demonstrated that the co‐delivery of small molecule and proteinaceous drugs via PCL‐CD polymersomes averts cartilage degeneration in animal osteoarthritic (OA) knee joints, which are known for their biochemically harsh and fluidically dynamic environment.     

One‐Step Formation of a Single Atomic‐Layer Transistor by the Selective Fluorination of a Graphene Film

In this study, the scalable and one‐step fabrication of single atomic‐layer transistors is demonstrated by the selective fluorination of graphene using a low‐damage CF₄ plasma treatment, where the generated F‐radicals preferentially fluorinated the graphene at low temperature (<200 °C) while defect formation was suppressed by screening out the effect of ion damage. The chemical structure of the C–F bonds is well correlated with their optical and electrical properties in fluorinated graphene, as determined by X‐ray photoelectron spectroscopy, Raman spectroscopy, and optical and electrical characterizations. The electrical conductivity of the resultant fluorinated graphene (F‐graphene) was demonstrated to be in the range between 1.6 kΩ/sq and 1 MΩ/sq by adjusting the stoichiometric ratio of C/F in the range between 27.4 and 5.6, respectively. Moreover, a unique heterojunction structure of semi‐metal/semiconductor/insulator can be directly formed in a single layer of graphene using a one‐step fluorination process by introducing a Au thin‐film as a buffer layer. With this heterojunction structure, it would be possible to fabricate transistors in a single graphene film via a one‐step fluorination process, in which pristine graphene, partial F‐graphene, and highly F‐graphene serve as the source/drain contacts, the channel, and the channel isolation in a transistor, respectively. The demonstrated graphene transistor exhibits an on‐off ratio above 10, which is 3‐fold higher than that of devices made from pristine graphene. This efficient transistor fabrication method produces electrical heterojunctions of graphene over a large area and with selective patterning, providing the potential for the integration of electronics down to the single atomic‐layer scale.     

Dried Blood Spots as Matrix for Evaluation of Valproate Levels and the Immediate and Delayed Metabolomic Changes Induced by Single Valproate Dose Treatment

The immediate and delayed metabolic changes in rats treated with valproate (VPA), a drug used for the treatment of epilepsy, were profiled. An established approach using dried blood spots (DBS) as sample matrices for gas chromatography/mass spectrometry-based metabolomics profiling was modified using double solvents in the extraction of analytes. With the modified method, some of the previously undetectable metabolites were recovered and subtle differences in the metabolic changes upon exposure to a single dose of VPA between males and female rats were identified. In male rats, changes in 2-hydroxybutyric acid, pipecolic acid, tetratriacontane and stearic acid were found between the control and treatment groups at various time points from 2.5 h up to 24 h. In contrast, such differences were not observed in female rats, which could be caused by the vast inter-individual variations in metabolite levels within the female group. Based on the measured DBS drug concentrations, clearance and apparent volume of distribution of VPA were estimated and the values were found to be comparable to those estimated previously from full blood drug concentrations. The current study indicated that DBS is a powerful tool to monitor drug levels and metabolic changes in response to drug treatment.     

Core‐stateless fair rate estimation fair queuing

Core‐stateless mechanisms, such as core‐stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain states, manage buffers, and perform flow scheduling on a per‐flow basis. However, they require executing label rewriting and dropping decision on a per‐packet basis, thus preventing them from being widely deployed. In this paper, we propose a novel architecture based on CSFQ without per‐packet labelling. Similarly, we distinguish between edge routers and core routers. Edge routers maintain the per‐flow state by employing a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per‐flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism by estimating the arrival rate and the number of flows using a matching–mismatching algorithm. The novel scheme is called core‐stateless fair rate estimation fair queuing (CSFREFQ). CSFREFQ is proven to be capable of achieving max–min fairness. Furthermore, we present and discuss simulations and experiments on the performance under different traffic scenarios. Copyright © 2005 John Wiley & Sons, Ltd.