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.     

Identification of metabolic markers in patients with type 2 Diabetes by Ultrafast gas chromatography coupled to electronic nose. A pilot study

Metabolomics is a potential tool for the discovery of new biomarkers in the early diagnosis of diseases. An ultra-fast gas chromatography system equipped to an electronic nose detector (FGC eNose) was used to identify the metabolomic profile of Volatile Organic Compounds (VOCs) in type 2 diabetes (T2D) urine from Mexican population. A cross-sectional, comparative, and clinical study with translational approach was performed. We recruited twenty T2D patients and twenty-one healthy subjects. Urine samples were taken and analyzed by FGC eNose. Eighty-eight compounds were identified through Kovats's indexes. A natural variation of 30% between the metabolites, expressed by study groups, was observed in Principal Component 1 and 2 with a significant difference (p < 0.001). The model, performed through a Canonical Analysis of Principal coordinated (CAP), allowed a correct classification of 84.6% between healthy and T2D patients, with a 15.4% error. The metabolites 2-propenal, 2-propanol, butane- 2,3-dione and 2-methylpropanal, were increased in patients with T2D, and they were strongly correlated with discrimination between clinically healthy people and T2D patients. This study identified metabolites in urine through FGC eNose that can be used as biomarkers in the identification of T2D patients. However, more studies are needed for its implementation in clinical practice.     

Highly Selective Copper‐Catalyzed Asymmetric [3+2] Cycloaddition of Azomethine Ylides with Acyclic 1,3‐Dienes

The first examples of the catalytic asymmetric 1,3‐dipolar cycloaddition of azomethine ylides with acyclic activated 1,3‐dienes (and 1,3‐enynes) are described. Under copper catalysis, a selective cycloaddition at the terminal γ,δ‐C?C bond is observed. In addition, depending on the ligand used, either the exo or the endo adduct can be obtained with high selectivity. Under appropriate reaction conditions, the acyclic 1,6‐addition product is detected, suggesting a stepwise mechanism. The resulting C4‐alkenyl‐substituted pyrrolidines are suitable substrates for further access to polycyclic systems, as highlighted by the preparation of hexahydrochromeno[4,3‐b]pyrrole and the tetracyclic core of the alkaloid gracilamine.     

A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

The Problem of the Pointwise Fourier Inversion for Piecewise Smooth Functions of Several Variables

We study the pointwise convergence problem for the inverse Fourier transform of piecewise smooth functions, i.e., whether S_rD f (\bx) ? f (\bx)S_{\rho D} f (\bx) \to f (\bx) as r? ￥\rho \to \infty . r? ￥\rho \to \infty . Here for \bx,\bxi ? \Rn\bx,\bxi \in \Rn S_rDf(\bmx)=\dsf1(2p)^n/2\intli_rD [^(f)](\bxi) e^{\dst iá\bmx,\bxi?} d\bxi . S_{\rho D}f(\bm{x})=\dsf1{(2\pi)^{n/2}}\intli_{\rho D} \widehat{f}(\bxi) e^{\dst i\langle\bm{x},\bxi\rangle} d\bxi~. is the partial sum operator using a convex and open set DD containing the origin, and rD={ r\bxi:\bxi ? D }\rho D=\left\{ \rho \bxi:\bxi\in D \right\}.     

Towards the Evaluation of the Relevant Degrees of Freedom in Nonlinear Partial Differential Equations

We investigate an operator renormalization group method to extract and describe the relevant degrees of freedom in the evolution of partial differential equations. The proposed renormalization group approach is formulated as an analytical method providing the fundamental concepts of a numerical algorithm applicable to various dynamical systems. We examine dynamical scaling characteristics in the short-time and the long-time evolution regime providing only a reduced number of degrees of freedom to the evolution process.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.