1-（2-呋喃基）-2-丙酮的合成

1-（2-呋喃基）-2-丙酮具有水果、辛香、焦糖样和小萝卜样的香气。以糠醛为原料,将其与硝基乙烷缩合得到2-（2-硝基-1-丙烯基）呋喃,然后用硼氢化钠还原得到2-（2-硝基-1-丙基）呋喃,最后采用Nef反应,得到1-（2-呋喃基）-2-丙酮。所有产物的结构通过IR和1H NMR进行了表征。该合成路线原料易得,操作简便,三步反应总收率可以达到54%。     

基于Nef的组网雷达包络三维可视化研究

提出了采用基于CGAL库定义的Nef多面体数据结构,并结合Nef多面体之间的三维布尔操作来解决组网雷达探测范围相互重叠的雷达包络可视化问题。试验测试结果表明,每组试验样本求交后的三角网格正常,可视化效果好,满足项目应用需求。     

Expression of HIV-1 nef in yeast: The 27 kDa nef protein is myristylated and fractionates with the nucleus

The nef gene of human immunodeficiency virus type 1 (HIV-1) has been expressed in the yeast Saccharomyces cerevisiae to produce native Nef proteins. The proteins of M_r 27 kDa and 25 kDa, produced by translation from the first and second start codons of the nef gene react with human HIV-1 antisera. Under low-level steady-state expression conditions, Nef27 undergoes myristylation and is targeted to the nuclear fraction while Nef25 is not myristylated and not nuclear localized. When produced rapidly and to high levels, Nef27 is initially present in the cytoplasm as a soluble myristylated protein that later fractionates with the nucleus.     

HIV-1C亚型调控蛋白Nef在大肠杆菌中的表达

目的表达人免疫缺陷病毒1型C亚型调控蛋白Nef,为研制HIV疫苗寻找新的途径。方法通过PCR扩增,获得HIV-1C亚型Nef基因片段,并将其克隆到原核表达载体pGEX-5X-1中,转化大肠杆菌BL21(DE3),IPTG诱导表达后,以SDS-PAGE和Westernblot分析表达产物。结果表达产物是相对分子质量为50000的GST融合蛋白,且能与p27单克隆抗体发生特异性反应。结论重组Nef蛋白在大肠杆菌中得到了有效表达。     

Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces

We present the first exact and robust implementation of the 3D Minkowski sum of two non-convex polyhedra. Our implementation decomposes the two polyhedra into convex pieces, performs pairwise Minkowski sums on the convex pieces, and constructs their union. We achieve exactness and the handling of all degeneracies by building upon 3D Nef polyhedra as provided by Cgal. The implementation also supports open and closed polyhedra. This allows the handling of degenerate scenarios like the tight passage problem in robot motion planning. The bottleneck of our approach is the union step. We address efficiency by optimizing this step by two means: we implement an efficient decomposition that yields a small number of convex pieces, and develop, test and optimize multiple strategies for uniting the partial sums by consecutive binary union operations. The decomposition that we implemented as part of the Minkowski sum is interesting in its own right. It is the first robust implementation of a decomposition of polyhedra into convex pieces that yields at most O(r ²) pieces, where r is the number of edges whose adjacent facets comprise an angle of more than 180 degrees with respect to the interior of the polyhedron. This work was partially supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.023.301.