Synthesis of orthogonal end functionalized oligoethylene glycols of defined lengths

The synthesis of oligoethylene glycols of defined lengths possessing different end functionalities is described. The utility of these molecules towards the development of a generic membrane anchor is demonstrated.     

A path planning model based on nested regular hexagons using weighted centroid localization

In many wireless sensor network (WSN) applications, the location of a sensor node is crucial for determining where the event or situation of interest occurred. Therefore, localization is one of the critical challenges in WSNs. Mobile anchor node assisted localization (MANAL) is one of the promising solutions for the localization of statically deployed sensors. The main problem in MANAL localization is that the path planning of the mobile anchor (MA) node should be done so that the localization error in the network will be minimal and that all unknown nodes in the network are covered. This paper proposes a new path planning approach called nested hexagons curves (NHexCurves) for MANAL. NHexCurves guarantees that it will receive messages from at least three non-collinear anchors to locate all unknown nodes in the network. The proposed model has compared six different path planning schemes in the literature using weighted centroid localization (WCL). In these comparisons, first of all, localization errors of the models are compared using some statistical concepts. Second, the variation of the localization error according to parameters such as resolution (R) and the standard deviation of noise (σ) is observed. Then, with similar approaches, the standard deviation of errors, localization ratio, scalability performances, and finally, path lengths of the models are examined. The simulation results show that the NHexCurves static path planning model proposed in this study stands out compared to other models with high localization error and localization ratio performance, especially at low resolutions, due to its path design. At the same time, the lowest error values according to σ are obtained with the proposed model among all models considered.     

无线传感器网络中分阶段的无需测距定位算法

为了提高无线传感器网络中基于无需测距算法定位精度,改进质心算法和DV-Hop算法,定位过程分为两个阶段:第一阶段在最佳通信半径与最佳阈值下,用基于阈值的优先质心算法定位部分节点;第二阶段在最佳通信半径与最佳指数值下用DV-Hop算法定位剩余节点。将算法应用在一种锚节点人工部署环境下,并与其他算法对比。MTLAB仿真结果表明,改进的算法在不增加泛洪次数、计算量和网络硬件成本下能提高定位精度,同时实现100%定位。     

基于Voronoi图预划分的LBS位置隐私保护方法

为了解决服务器面临大量用户请求时匿名效率下降的问题,分别提出适用于静态用户和动态用户的协作匿名方法。首先基于Voronoi图划分全局区域,再由中心服务器组织本区域内用户实现协作匿名,由于服务器无需为每个用户单独构造匿名区,降低了服务端的负担;针对查询过程中用户提供真实位置信息带来位置隐私泄露的问题,提出了逆向增量近邻查询算法。用户以固定锚点代替真实位置,向位置服务器逐步获取兴趣点候选集并计算出想要的结果,避免位置隐私直接泄漏的同时获取精准查询结果。该算法同时解决了锚点与用户过近而带来的位置隐私被推断问题。实验表明本方法在有效保护用户位置隐私的同时,具有良好的工作效率。     

基于联合分步APIT定位算法的改进

本文研究了无线传感网络( Wireless Sensor Network,WSNs)的节点定位问题,并针对APIT由于锚节点在低密度环境下的节点误判和节点失效等问题给出了改进,在APICT定位算法的基础提出了联合分步定位算法UNION-APICT(Union Approximate Point-In-Circumcircle Test),该算法是结合连通性的测距技术,RSSI测距技术以及质心定位和APICT等技术,来联合解决对未知节点定位问题。通过仿真实验结果表明,改进后的UNION-APICT在APICT算法的基础之上平均定位误差减少了10%-25%,定位性能有了明显的提升;随着通信半径R和最大探测距离rmax的增加,定位误差也在逐渐减小,该算法较APIT和APICT定位算法在锚节点密度、节点覆盖率和定位精度上都有所提高。     

Semisynthesis of Functional Glycosylphosphatidylinositol‐Anchored Proteins

Glypiation is a common posttranslational modification of eukaryotic proteins involving the attachment of a glycosylphosphatidylinositol (GPI) glycolipid. GPIs contain a conserved phosphoglycan that is modified in a cell‐ and tissue‐specific manner. GPI complexity suggests roles in biological processes and effects on the attached protein, but the difficulties to get homogeneous material have hindered studies. We disclose a one‐pot intein‐mediated ligation (OPL) to obtain GPI‐anchored proteins. The strategy enables the glypiation of folded and denatured proteins with a natural linkage to the glycolipid. Using the strategy, glypiated eGFP, Thy1, and the Plasmodium berghei protein MSP1₁₉ were prepared. Glypiation did not alter the structure of eGFP and MSP1₁₉ proteins in solution, but it induced a strong pro‐inflammatory response in vitro. The strategy provides access to glypiated proteins to elucidate the activity of this modification and for use as vaccine candidates against parasitic infections.     

输电铁塔四地脚螺栓塔脚板抗拉承载力试验与计算方法研究

针对架空输电线路铁塔中常用的四地脚螺栓塔脚板进行了抗拉承载力试验和理论计算方法研究。首先,选取8个试件进行塔脚板抗拉承载力试验研究,分析塔脚底板板厚及有无加劲板对塔脚板抗拉承载力的影响;其次,通过有限元模拟塔脚板的应力分布情况,并结合“塑性分析,弹性设计”的思想,提出了一种基于屈服线理论的四地脚螺栓塔脚板抗拉承载力计算公式;最后,与试验结果、有限元仿真结果、已有技术规定中的计算结果进行了对比。结果表明:建议公式与试验结果和仿真结果较为吻合,相关技术规定中的计算结果偏于保守,验证了本文建议公式的精确性;底板厚度和加劲板的作用对塔脚板承载力影响较大。研究结果可为输电铁塔四地脚螺栓塔脚板结构设计提供参考。     

???????????????????????????о?

利用模拟装置实现了卡瓦与套管在地面上的实验，使用电测的方法测量胀卡时套管外表面的应变．由实验数据获得计算网格节点处的应变，同时利用单位咬合力作用套管的有限元结果进行数值法计算，获得卡瓦各咬合齿对套管咬合力的分布，为卡瓦的优化设计提供了可靠数据．     

DMAP: integrated mobility and service management in mobile IPv6 systems

Mobile IPv6 (MIPv6) is a work in progress IETF standard for enabling mobility in IPv6 networks and is expected to have wide deployment. We investigate an integrated mobility and service management scheme based on MIPv6 with the goal to minimize the overall network signaling cost in MIPv6 systems for serving mobility and service management related operations. Our design extends IETF work-in-progress Hierarchical Mobile IPv6 (HMIPv6) with the notion of dynamic mobility anchor points (DMAPs) for each mobile node (MN) instead of static ones for all MNs. These DMAPs are access routers chosen by individual MNs to act as a regional router to reduce the signaling overhead for intra-regional movements. The DMAP domain size, i.e., the number of subnets covered by a DMAP, is based on the MN’s mobility and service characteristics. Under our DMAP protocol, a MN interacts with its home agent and application servers as in the MIPv6 protocol, but optimally determines when and where to launch a DMAP to minimize the network cost in serving the user’s mobility and service management operations. We demonstrate that our DMAP protocol for integrated mobility and service management yields significantly improved performance over basic MIPv6 and HMIPv6.     

无线传感器网络定位技术研究

节点定位技术是传感器网络关键技术之一,具有十分重要的地位.传感器节点采集到的数据必须结合其位置信息才有意义,没有位置信息的数据几乎没有利用价值.叙述了一些典型定位算法,并将这些定位算法归纳为两大类:Range-based的和Range-free的定位算法.最后,将两类定位算法结合起来提出了值得进一步研究的问题.