Influence of deposited amine-functionalized Si-MCM-41 in polyacrylonitrile electrospun membranes applied for separation of water in oil emulsions

Among several oil/water emulsion separation technologies, the utilization of nanoparticle-decorated membranes with diverse functionalities has received considerable attention in recent years, particularly if the antifouling capacity can be improved. In this article, we propose a new membrane based on surface-hydrolyzed polyacrylonitrile electrospun membranes and/or decorated with amine-functionalized Si-MCM-41 nanoparticles to be used as oil/water emulsion separation treatment and to determine their antifouling ability. X-Ray photoelectron spectrometry, attenuated total reflectance Fourier transform infrared spectroscopy, and toluidine blue O assay, scanning electron microscopy, contact angle measurements for oil under water and thermogravimetry were used for characterizing the membranes and an assay of permeability was developed to quantify the diffusion of oil molecules across the electrospun membrane. The electrospun and/or decorated membranes showed an underwater oleophobic wettability, which can separate oil-in-water emulsions with 87% separation efficiency, results of fouling experiments, evaluated in terms of rejection and flux recovery ratio, exhibited good antifouling ability, but the membrane decoration process did not lead to superior outcomes compared with undecorated membranes.     

Sex Pheromone of the Alfalfa Plant Bug,Adelphocoris lineolatus: Pheromone Composition and Antagonistic Effect of 1-Hexanol (Hemiptera: Miridae)

Journal of Chemical Ecology - The sex pheromone composition of alfalfa plant bugs, Adelphocoris lineolatus (Goeze), from Central Europe was investigated to test the hypothesis that insect species...     

纵向旋转切削加工对环形零件畸变的影响

通过旋转试验和有限元分析介绍了工件在切削加工过程中产生的畸变情况，分析了工件的装夹方式、切削速度、切削深度和进刀量对100Cr6钢环圆度的影响。通过去应力退火释放冷加工诱发的残余应力后工件的圆度与切削参数有关。另外测试了被试验环的表面残余应力，其表面残余应力与装夹方式有关。将测量的装夹力作为计算参数输入，通过有限元分析方法测试了装夹方式对工件变形的影响。协同测量结果示出了装夹方式影响工件变形的一个主要因素，表面残余应力与工件的径向变形有关，最大的拉伸应力位于夹口位置。旋转切削试验结果表明，提高切削速度圆度会稍有增加；随着切削深度的加大，圆度呈下降趋势，尽管切削力增加了；进给量的增加会导致更高的切削力，因此圆度值也增加；常规的去应力退火可使被加工环的圆度值增加。     

A finite volume–finite difference method with a stiff ordinary differential equation solver for advection–diffusion–reaction equation

A model for atmospheric pollutant transport is proposed considering an advection–diffusion–reaction equation. A splitting method is used to decouple the advection, diffusion and reaction parts. A scheme based on finite volume, finite difference and backward differentiation formula is used for solving an atmospheric transport-chemistry problem.     

Probabilistic consensus clustering using evidence accumulation

Machine Learning - Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence...     

Quantum commitments from complexity assumptions

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time.     

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.     

Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform

Traditionally, computer programs have been developed using the sequential programming paradigm. With the advent of parallel computing systems, such as multicore processors and distributed environments, the sequential paradigm became a barrier to the utilisation of the available resources, since the program is restricted to a single processing unit. To address this issue, we propose a transparent automatic parallelisation tool with a binary rewriter. The steps of our approach are: the disassembly of the Intel x86 application, its transformation into an intermediary language; the analysis of this intermediary representation to obtain the flow and dependency graphs; the partitioning of the application into parallel units, using the obtained graphs; and, finally, the reassembly of the application back into the original Intel x86 architecture. By transforming the compiled application software, we aim at obtaining a program which can better explore the parallel resources, with no extra effort required from users or developers.     

Air‐ground Matching: Appearance‐based GPS‐denied Urban Localization of Micro Aerial Vehicles

In this paper, we address the problem of globally localizing and tracking the pose of a camera‐equipped micro aerial vehicle (MAV) flying in urban streets at low altitudes without GPS. An image‐based global positioning system is introduced to localize the MAV with respect to the surrounding buildings. We propose a novel air‐ground image‐matching algorithm to search the airborne image of the MAV within a ground‐level, geotagged image database. Based on the detected matching image features, we infer the global position of the MAV by back‐projecting the corresponding image points onto a cadastral three‐dimensional city model. Furthermore, we describe an algorithm to track the position of the flying vehicle over several frames and to correct the accumulated drift of the visual odometry whenever a good match is detected between the airborne and the ground‐level images. The proposed approach is tested on a 2 km trajectory with a small quadrocopter flying in the streets of Zurich. Our vision‐based global localization can robustly handle extreme changes in viewpoint, illumination, perceptual aliasing, and over‐season variations, thus outperforming conventional visual place‐recognition approaches. The dataset is made publicly available to the research community. To the best of our knowledge, this is the first work that studies and demonstrates global localization and position tracking of a drone in urban streets with a single onboard camera.