Curvature investigation in tapered fibers and its application to sensing and mode conversion

Non-adiabatic tapered fibers are basic photonic components used in a wide range of applications. Here we investigate a way to increase their utility through the controllable bending of one of their tapered sections. The experiments carried out explain, for the first time, the mechanics of this approach showing how these tapers can be used to build more sensitive sensors. Their use as highly efficient mode converters is also discussed.     

Recent advances and challenges in the recovery and purification of cellular exosomes

Exosomes are nanovesicles secreted by most cellular types that carry important biochemical compounds throughout the body with different purposes, playing a preponderant role in cellular communication. Because of their structure, physicochemical properties and stability, recent studies are focusing in their use as nanocarriers for different therapeutic compounds for the treatment of different diseases ranging from cancer to Parkinson's disease. However, current bioseparation protocols and methodologies are selected based on the final exosome application or intended use and present both advantages and disadvantages when compared among them. In this context, this review aims to present the most important technologies available for exosome isolation while discussing their advantages and disadvantages and the possibilities of being combined with other strategies. This is critical since the development of novel exosome‐based therapeutic strategies will be constrained to the effectiveness and yield of the selected downstream purification methodologies for which a thorough understanding of the available technological resources is needed.     

紫色球杆菌视紫红质光谱特性的机器学习研究

近年来，机器学习等人工智能技术被应用于蛋白质工程，其在蛋白质结构、功能预测、催化活性等研究中具有独特优势。在未知蛋白质结构的情况下，将蛋白质序列和功能特性与机器学习相结合，基于序列-活性关系（innovative sequence-activity relationship，ISAR）算法，将蛋白质氨基酸序列数字化，用快速傅里叶变换（fast four transform，FFT）进行预处理，再进行偏最小二乘回归建模，可在数据集较少情况下拟合得到最佳模型。通过机器学习对紫色球杆菌视紫红质（gloeobacter violaceus rhodopsin，GR）的突变体蛋白质氨基酸序列与光谱最大吸收波长进行建模，获得了最佳模型。用最佳索引LEVM760106建模得到的确定系数R² 为0.944，均方误差E为11.64。用小波变换进行的预处理，其R² 虽也约为0.944，但E大于11.64，不及FFT进行的预处理。方法较好地解决了蛋白质序列与功能特性之间的数学建模问题，在蛋白质工程中可为预测更优的突变体提供支持。     

Azobenzene‐Functionalized Cage Silsesquioxanes as Inorganic–Organic Hybrid,Photoresponsive, Nanoscale,Building Blocks

Mono‐ and octa‐azobenzene‐functionalized cage silsesquioxanes were easily synthesized by the reaction of 4‐bromoazobenzene with monovinyl‐substituted octasilsesquioxane and cubic octavinylsilsesquioxane through the Heck coupling reaction. Excited‐state energies obtained from time‐dependent density functional theory (TDDFT) and the CAM‐B3LYP functional correlate very well with experimental trans–cis photoisomerization results from UV/Vis spectroscopy. These azobenzene‐functionalized cages exhibit good thermal stability and are fluorescent with maximum emission at approximately 400 nm, making them potential materials for blue‐light emission.     

两个DEA的逆问题的解法的探讨

文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.