Current advances in molecularly imprinted polymers and their release mechanisms in drug delivery systems

Molecularly imprinted polymer (MIP) has gained wide interest among researchers due to its unique molecular recognition of the template that is suitable as a drug carrier. Therefore, the preparation and formulation of the MIP are significant to suit the needs of the intended use. Due to its significance in drug delivery, this review aims to highlight various methods in the preparation of MIP, the composition for both controlled and stimuli-responsive drug delivery systems, and the release mechanism of the drugs. In drug delivery systems, MIP should have a sustained release performance as well as flexibility in surface modification for targeted delivery via a range of stimuli-responses, including  external stimuli (magnetic, light) and internal stimuli (pH, temperature, redox, biological). The properties of sustained release and targeted delivery of the MIP can improve the drug's therapeutic efficacy as well as the breakthrough for the tumor targeting application.     

The Story Behind the Link between Molecular Chirality and Crystal Shape

Here we describe the story behind the link between molecular chirality and macroscopic phenomena, the latter being a probe for the direct assignment of absolute configuration of chiral molecules. First, a brief tour of the history of molecular stereochemistry, starting with the classic experiment reported by Pasteur in 1848 on the separation of enantiomorphous crystals of a salt of tartaric acid, and his conclusion that the molecules of life are chiral of single-handedness. With time, this study raised, inter alia, two fundamental questions: the absolute configuration of chiral molecules and how a molecule of given configuration shapes the enantiomorphous morphology of its crystal. As for the first question, following the beginning of crystal structure determination by X-ray diffraction in 1912, it took almost 40 years before Bijvoet assigned molecular chirality through the esoteric method involving anomalous X-ray scattering. We have been able to address and link both questions through ‘everyday concepts of left and right’ (in the words of Jack Dunitz) by the use of ‘tailor-made’ auxiliaries. By such means, it proved possible to reveal, through morphology, etch patterns, epitaxy and symmetry reduction of both chiral and, paradoxically, centrosymmetric crystals, the basic chiral symmetry of the molecules of life, the α-amino acids and sugars.     

框架核酸高通量检测芯片

构建了一种基于框架核酸的高通量生物检测芯片.利用超微量移液自动化平台,将包含框架核酸探针的液滴按照预设命令固定至生物芯片微阵列上,在探针捕获核酸靶标后利用集成的基因芯片扫描仪对芯片进行成像,通过分析荧光强度定量化分析靶标浓度.结果表明,此框架核酸芯片能够实现框架核酸探针的高通量制备, 24 h即可制备具有15万个点的微阵列,且点间距离的相对偏差W≤10%、荧光强度的变异系数CV=3.30%,具有较高的稳定性,远高于国家标准.此外,该芯片具备高灵敏度、可寻址的高通量生物分析能力,对核酸靶标的检测限可达100 pmol/L.随着多种探针技术的发展,生物检测微阵列技术在高通量生物分析领域展示出巨大的潜力.     

活性导向的化学探针在氨基酸反应活性表征中的应用进展

原创药物的研制得益于蛋白质新靶标的发现,而新靶标的发现依赖于高可信度、高通量的药物-蛋白质相互作用分析方法。蛋白质作为生命功能的执行者,其表达量、空间定位与结构差异直接影响药效的发挥。目前,超过85%的蛋白质尚被认为是无法成药的,主要原因是缺少药物分子靶向的空腔以及相应的反应活性位点。因此,基于蛋白质组学层次实现对氨基酸反应活性位点的表征成为原创共价靶向药物设计的关键,也是克服难以成药靶标蛋白问题的关键。近年来,质谱技术的飞速发展极大地推动了基于蛋白质组学技术的药物-靶蛋白相互作用研究。其中基于活性的蛋白质组分析(ABPP)策略是利用活性位点导向的化学探针分子在复杂样品中实现功能状态酶和药物靶标等蛋白质的检测。基于化学探针的开发和质谱定量技术的发展,ABPP技术在氨基酸反应活性表征研究中展现出重要的应用潜力,将助力于药物新靶标的发现和药物先导化合物的开发。ABPP策略主要基于蛋白质的活性特征进行富集,活性探针作为ABPP策略的核心,近年来取得了飞速进展。该文回顾了ABPP策略的发展历程,重点介绍基于广谱活性探针的ABPP技术在多种氨基酸反应活性筛选领域的研究进展,并对其在药物靶点发现中的应用前景进行展望。     

一种变权综合评价方法及其在膨胀土分类中的应用

针对膨胀土胀缩等级分类问题,构造了一种新的区间关联函数,提出了"分类特征体现度越大,权重越大"的权重计算原理,给出了一种新的变权计算方法,将单指标关联函数的最大值作为其评价类的靶心坐标,根据样本与靶心的贴近度,对样本进行分类.将该方法应用于膨胀土的胀缩等级分类,其合理性和有效性得到了验证.     

A new mathematical model towards the integration of cell formation with operator assignment and inter-cell layout problems in a dynamic environment

This paper proposes a new mathematical model to solve the cell formation, operator assignment and inter-cell layout problems, simultaneously. The objectives of proposed model are minimization of inter–intra cell part trips, machine relocation cost and operator related issues. Since the objective function of the proposed model consists of none commensurable statements, the preferred solution is obtained by the LP-metric approach. In order to validate the proposed model, some numerical examples are generated randomly and solved by branch and bound technique. Moreover; a real case study is illustrated in order to verify its applicability in an automobile producer company. Moreover the sensitivity analysis of proposed model shows that considering the operator assignment problem has significant impact on the overall system efficiency.     

人力资源多维分配问题的混合算法

针对已有多维分配问题求解算法复杂、耗时长及精度低等问题,本文将二部图中寻求最优匹配的方法进行推广,运用试分配、饱和路调整和增广路调整对多维分配问题的最优解进行搜索,提出了求解人力资源多维分配问题的最小零面优先分配混合算法和随机试分配混合算法,对算法的有效性进行了理论证明,并分析了算法的时间和空间复杂度;同时通过这两种混合算法对初始零元素数不同的代价矩阵求解时间的计算,以及与Lagrangian松弛算法和剪枝法的耗时、精度的对比,分别得到了两种混合算法的适用性和高效性,最后通过算例验证了算法的有效性。     

Dual Representation of the Cost of Designing a Portfolio Satisfying Multiple Risk Constraints

ABSTRACT

We consider, within a Markovian complete financial market, the problem of finding the least expensive portfolio process meeting, at each payment date, three different types of risk criterion. Two of them encompass an expected utility-based measure and a quantile hedging constraint imposed at inception on all the future payment dates, while the other one is a quantile hedging constraint set at each payment date over the next one. The quantile risk measures are defined with respect to a stochastic benchmark and the expected utility-based constraint is applied to random payment dates. We explicit the Legendre-Fenchel transform of the pricing function. We also provide, for each quantile hedging problem, a backward dual algorithm allowing to compute their associated value function by backward recursion. The algorithms are illustrated with a numerical example.     

Enumerating typical abelian prime-fold coverings of a circulant graph

Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265-272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85; R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum); M. Hofmeister, Graph covering projections arising from finite vector spaces over finite fields, Discrete Math. 143 (1995) 87-97; M. Hofmeister, Enumeration of concrete regular covering projections, SIAM J. Discrete Math. 8 (1995) 51-61; M. Hofmeister, A note on counting connected graph covering projections, SIAM J. Discrete Math. 11 (1998) 286-292; J.H. Kwak, J. Chun, J. Lee, Enumeration of regular graph coverings having finite abelian covering transformation groups, SIAM J. Discrete Math. 11 (1998) 273-285; J.H. Kwak, J. Lee, Isomorphism classes of graph bundles, Canad. J. Math. XLII (1990) 747-761]). A covering is called abelian (or circulant, respectively) if its covering graph is a Cayley graph on an abelian (or a cyclic, respectively) group. A covering p from a Cayley graph onto another Cay (Q,Y) is called typical if the map p:A→Q on the vertex sets is a group epimorphism. Recently, the isomorphism classes of connected typical circulant r-fold coverings of a circulant graph are enumerated in [R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85] for r=2 and in [R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum)] for any r. As a continuation of these works, we enumerate in this paper the isomorphism classes of typical abelian prime-fold coverings of a circulant graph.