An investigation of the synergistic effect between magnetite nanoparticles and polypyrrole in nanostructured layer-by-layer films

In this paper, we report the controlled fabrication of layer-by-layer (LbL) films deposited on gold substrates with three different supramolecular architectures using polypyrrole (Ppy) and magnetite nanoparticles (Fe₃O₄-np), besides conventional poly(allylamine hydrochloride) (PAH) e poly(vinyl sulfonic acid) (PVS) polyelectrolytes, demonstrating the synergistic effect between Ppy and Fe₃O₄-np such as a result of their interaction. Modified gold electrodes were analyzed by contact angle (wettability), surface plasmon resonance (SPR), raman spectroscopy, cyclic voltammetry, and electrochemical impedance spectroscopy. The (Fe₃O₄-np/Ppy)₃ architecture was also evaluated by scanning electron microscopy. The modified gold electrodes present more homogeneous covering, higher electron transfer and a decrease of resistance with the incorporation of the nanostructured materials such as Ppy and Fe₃O₄-np forming (Fe₃O₄-np/Ppy)₃ LbL film. The results carried out in this study suggest that the (Fe₃O₄-np/Ppy)₃ LbL film can be applied as a possible electrochemical or optical non-enzymatic sensor for analytical detection.     

Aramid pulp treated with imidazolium ionic liquids as a filler in rigid polyurethane bio-foams

This article reports an aramid pulp (AP) treated with two ionic liquids (IL), namely 1-n-butyl-3-methylimidazolium chloride (C₄.Cl) and 1-carboxymethyl-3-methylimidazolium chloride (HO₂C), and its use as a filler in reinforced rigid polyurethane foams (RPUF). The RPUF were incorporated with the treated AP at three weight fractions (c.a. 0.1, 0.5, and 1.0 wt%) and were produced by the free rising method. The results showed that the studied IL promoted a better interaction between the AP and the RPUF system, which increased the overall reactivity, imparting a higher cell anisotropy. This also yielded a positive effect in mechanical properties and thermal stability of the RPUF. Compared to the neat RPUF, outstanding increases of approximately 50 and 20% were achieved in compressive modulus and strength, respectively. In all, the use of IL promoted increased compatibility between matrix and reinforcement, especially that HO₂C IL.     

Effect of rinsing and drying on silicon surface cleaning for epitaxial growth

We investigated the effect of the rinsing and drying technique on the oxygen and carbon concentration on a silicon surface. Rinsing in deionized water increased the interfacial oxygen concentration and helped generate defects. Blow-drying was more efficient than spin-drying in reducing interfacial oxygen concentration. Exposure to the atmosphere was detrimental to obtaining high crystallinity in the epitaxial layer. We evaluated the effectiveness of the cleaning process by observing the grown epilayer and the epilayer/substrate interface.     

Factors of low individual degree polynomials

Kaltofen (Randomness in computation, vol 5, pp 375–412, 1989) proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas also have small arithmetic formulas, asked in Kopparty et al. (2014), and the question of bounding the depth of the circuits computing the factors of a polynomial. We are able to answer these questions in the affirmative for the interesting class of polynomials of bounded individual degrees, which contains polynomials such as the determinant and the permanent. We show that if \({P(x_{1},\ldots,x_{n})}\) is a polynomial with individual degrees bounded by r that can be computed by a formula of size s and depth d, then any factor \({f(x_{1},\ldots, x_{n})}\) of \({P(x_{1},\ldots,x_{n})}\) can be computed by a formula of size \({\textsf{poly}((rn)^{r},s)}\) and depth d + 5. This partially answers the question above posed in Kopparty et al. (2014), who asked if this result holds without the dependence on r. Our work generalizes the main factorization theorem from Dvir et al. (SIAM J Comput 39(4):1279–1293, 2009), who proved it for the special case when the factors are of the form \({f(x_{1}, \ldots, x_{n}) \equiv x_{n} - g(x_{1}, \ldots, x_{n-1})}\). Along the way, we introduce several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas).     

Assessing the impact of real-time machine translation on multilingual meetings in global software projects

Communication in global software development is hindered by language differences in countries with a lack of English speaking professionals. Machine translation is a technology that uses software to translate from one natural language to another. The progress of machine translation systems has been steady in the last decade. As for now, machine translation technology is particularly appealing because it might be used, in the form of cross-language chat services, in countries that are entering into global software projects. However, despite the recent progress of the technology, we still lack a thorough understanding of how real-time machine translation affects communication. In this paper, we present a set of empirical studies with the goal of assessing to what extent real-time machine translation can be used in distributed, multilingual requirements meetings instead of English. Results suggest that, despite far from 100 % accurate, real-time machine translation is not disruptive of the conversation flow and, therefore, is accepted with favor by participants. However, stronger effects can be expected to emerge when language barriers are more critical. Our findings add to the evidence about the recent advances of machine translation technology and provide some guidance to global software engineering practitioners in regarding the losses and gains of using English as a lingua franca in multilingual group communication, as in the case of computer-mediated requirements meetings.     

Design complexity control in truss optimization

Truss optimization based on the ground structure approach often leads to designs that are too complex for practical purposes. In this paper we present an approach for design complexity control in truss optimization. The approach is based on design complexity measures related to the number of bars (similar to Asadpoure et al. Struct Multidisc Optim 51(2):385–396 2015) and a novel complexity measure related to the number of nodes of the structure. Both complexity measures are continuously differentiable and thus can be used together with gradient based optimization algorithms. The numerical examples show that the proposed approach is able to reduce design complexity, leading to solutions that are more fit for engineering practice. Besides, the examples also indicate that in some cases it is possible to significantly reduce design complexity with little impact on structural performance. Since the complexity measures are non convex, a global gradient based optimization algorithm is employed. Finally, a detailed comparison to a classical approach is presented.     

Input‐output triggered control using ‐stability over finite horizons

This paper investigates stability of nonlinear control systems under intermittent information. Following recent results in the literature, we replace the traditional periodic paradigm, where the up‐to‐date information is transmitted and control laws are executed in a periodic fashion, with the event‐triggered paradigm. Building on the small gain theorem, we develop input–output triggered control algorithms yielding stable closed‐loop systems. In other words, based on the currently available (but outdated) measurements of the outputs and external inputs of a plant, a mechanism triggering when to obtain new measurements and update the control inputs is provided. Depending on the noise in the environment, the developed algorithm yields stable, asymptotically stable, and ‐stable (with bias) closed‐loop systems. Control loops are modeled as interconnections of hybrid systems for which novel results on ‐stability are presented. The prediction of a triggering event is achieved by employing ‐gains over a finite horizon. By resorting to convex programming, a method to compute ‐gains over a finite horizon is devised. Finally, our approach is successfully applied to a trajectory tracking problem for unicycles. Copyright © 2014 John Wiley & Sons, Ltd.     

A kernel-based framework for image collection exploration

While search engines have been a successful tool to search text information, image search systems still face challenges. The keyword-based query paradigm used to search in image collection systems, which has been successful in text retrieval, may not be useful in scenarios where the user does not have the precise way to express a visual query. Image collection exploration is a new paradigm where users interact with the image collection to discover useful and relevant pictures. This paper proposes a framework for the construction of an image collection exploration system based on kernel methods, which offers a mathematically strong basis to address each stage of an image collection exploration system: image representation, summarization, visualization and interaction. In particular, our approach emphasizes a semantic representation of images using kernel functions, which can be seamlessly harnessed across all system components. Experiments were conducted with real users to verify the effectiveness and efficiency of the proposed strategy.