Can porous polymeric scaffolds be functionalized by stem cells leading to osteogenic differentiation? A systematic review of in vitro studies

The aim of this study was to analyze the influence of nanoporous structure of polymeric biomaterials on the in vitro osteogenic induction of human stem cells. An electronic search in three databases (MEDLINE, SCOPUS, and Web of Science) was performed for articles that were published before May 2018. In vitro studies were included if they met the following criteria: (1) the use of polymeric scaffolds (natural or synthetic); (2) the co-culture of human stem cells with the scaffold; and (3) cell viability, proliferation, and osteogenic differentiation assays. The main characteristics of the published studies were summarized, and a quality assessment tool was used to analyze methodological features. Eighty-eight potential articles were firstly retrieved. Thirteen were eligible for qualitative analysis. Only three studies characterized cell stemness. Nanostructure of the scaffolds showed a significant influence on viability, proliferation, and osteogenic differentiation of human stem cells. Combination of porosity between 72 and 93% and a large range diameter between 50 and 224 μm resulted in more remarkable cellular proliferation and differentiation. Porous polymeric scaffolds can be functionalized by stem cells leading to osteogenic induction. High standards of laboratory practice and accurate methodological reporting are essential for the credibility of the results.     

Approximation Algorithms for <Emphasis Type="Italic">k</Emphasis>-hurdle Problems

The polynomial-time solvable k-hurdle problem is a natural generalization of the classical s-t minimum cut problem where we must select a minimum-cost subset S of the edges of a graph such that |p∩S|≥k for every s-t path p. In this paper, we describe a set of approximation algorithms for “k-hurdle” variants of the NP-hard multiway cut and multicut problems. For the k-hurdle multiway cut problem with r terminals, we give two results, the first being a pseudo-approximation algorithm that outputs a (k−1)-hurdle solution whose cost is at most that of an optimal solution for k hurdles. Secondly, we provide a 2(1-\frac1r)2(1-\frac{1}{r})-approximation algorithm based on rounding the solution of a linear program, for which we give a simple randomized half-integrality proof that works for both edge and vertex k-hurdle multiway cuts that generalizes the half-integrality results of Garg et al. for the vertex multiway cut problem. We also describe an approximation-preserving reduction from vertex cover as evidence that it may be difficult to achieve a better approximation ratio than 2(1-\frac1r)2(1-\frac{1}{r}). For the k-hurdle multicut problem in an n-vertex graph, we provide an algorithm that, for any constant ε>0, outputs a ⌈(1−ε)k⌉-hurdle solution of cost at most O(log n) times that of an optimal k-hurdle solution, and we obtain a 2-approximation algorithm for trees.     

Early bankruptcy prediction using ENPC

Bankruptcy prediction has long time been an active research field in finance. One of the main approaches to this issue is dealing with it as a classification problem. Among the range of instruments available, we focus our attention on the Evolutionary Nearest Neighbor Classifier (ENPC). In this work we assess the performance of the ENPC comparing it to six alternatives. The results suggest that this algorithm might be considered a good choice.     

On symbolic manipulation and code generation of a hybrid three-dimensional solid element

A symbolic procedure is utilized to derive the analytical expressions of the component matrices resulting to the closed-form integration of a stiffness matrix of a hybrid finite element. In order to alleviate the expression growth problem, we employ special techniques, including the use of symmetry conditions, pattern search, and introduction of intermediate variables, so that the final form of the derived stiffness matrix is suitable for coding implementation. Application of the symbolic procedure is made on a hybrid three-dimensional 8-node solid element. The same procedure is equally applicable to other types of hybrid elements.     

Selective Recovery of Cadmium,Cobalt, and Nickel from Spent Ni–Cd Batteries Using Adogen® 464 and Mesoporous Silica Derivatives

Spent Ni–Cd batteries are now considered an important source for many valuable metals. The recovery of cadmium, cobalt, and nickel from spent Ni–Cd Batteries has been performed in this study. The optimum leaching process was achieved using 20% H₂SO₄, solid/liquid (S/L) 1/5 at 80 °C for 6 h. The leaching efficiency of Fe, Cd, and Co was nearly 100%, whereas the leaching efficiency of Ni was 95%. The recovery of the concerned elements was attained using successive different separation techniques. Cd(II) ions were extracted by a solvent, namely, Adogen^® 464, and precipitated as CdS with 0.5% Na₂S solution at pH of 1.25 and room temperature. The extraction process corresponded to pseudo-2nd-order. The prepared PTU-MS silica was applied for adsorption of Co(II) ions from aqueous solution, while the desorption process was performed using 0.3 M H₂SO₄. Cobalt was precipitated at pH 9.0 as Co(OH)₂ using NH₄OH. The kinetic and thermodynamic parameters were also investigated. Nickel was directly precipitated at pH 8.25 using a 10% NaOH solution at ambient temperature. FTIR, SEM, and EDX confirm the structure of the products.     

改进AOD-Net的道路交通图像去雾算法

针对现有图像去雾算法在处理道路交通图像时无法同时兼顾去雾效果和实时性的问题,本文以快速一体化网络去雾算法(AOD-Net)为基础进行改进.首先,在AOD-Net中添加SE通道注意力,以自适应的方式分配通道权重,关注重要特征;其次,引入金字塔池化模块,扩大网络的感受野,并融合不同尺度特征,更好地捕捉图像信息;最后,使用复合损失函数同时关注图像像素信息和结构纹理信息.实验结果表明,改进后的AOD-Net算法对道路交通图像去雾后的峰值信噪比提升了2.52 dB,结构相似度达到了91.2%,算法复杂度和去雾耗时略微增加,但仍满足实时要求.     

Linear-Dispersion Division Multiple-Access for MIMO systems

Comprehensive study on novel Linear-Dispersion Division Multiple-Access（LDDMA） for multi-user uplink Multiple-Input Multiple-Output（MIMO）systems is proposed.In the new multiplexing scheme,each user’s information symbol is dispersed by a User-Specific Matrix（USM）both in space and time domain and linearly combined at base-station side.And a simple random search algorithm,based on capacity maximization criteria,is developed to generate a bank of USMs.Simulation results are presented to demonstrate the advantages of LDDMA.When the Bit Error Rate（BER） reaches 10^–3,the performance gains are 3dB and 5dB,compared with Time-Division Linear Dispersion Codes（TD-LDC）and BLAST,respectively.     

DCAF: An MPEG-21 Dynamic Content Adaptation Framework

Universal Multimedia Access aims at providing a gratifying end user-experience by either adapting the content, be it static or dynamic, to suit the usage environment or adapting the usage environment, be it client- or server-centric, to suit content. This paper presents our MPEG-21 Dynamic Content Adaptation Framework, acronym DCAF, which uses a fusion of Genetic Algorithms and Strength Pareto Optimality to adapt content in order to suit the usage environment.