事件驱动传感器网络中基于数据聚合的自适应路由算法

为优化事件驱动传感器网络总能耗,提出一个基于数据聚合的自适应路由算法,它能够实现低控制开销的事件域节点分布式成簇,计算并借助于路由汇聚中心,建立一棵基于事件的近似Steiner树,有效减少网内数据分组与控制分组的传输量.理论分析与实验表明,该算法的路由结构建立与维护开销较少,能优化数据聚合效率,实现高能效的数据收集,提升网络性能.     

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route-cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end-to-end performance improved significantly.     

Solving the multi-compartment capacitated location routing problem with pickup–delivery routes and stochastic demands

This paper considers an advanced capacitated location routing problem in a distribution network with multiple pickup and delivery routes, and each customer placing random multi-item demands on it. The pickup and delivery services need two fleets of vehicles and will form two different sets of routes. However, the unpredictability of variation in the multi-item demands makes the routing of multi-compartment vehicles to accommodate such demands complex. To solve this multifaceted problem, a new process employing the TABU search is proposed in this research study. This proposed approach includes three stages: location selection, customer assignment, and vehicle routing. The innovative concept is to divide all customers into assignment-determined and assignment-undetermined groups in order to narrow down the search area of a solution domain so the TABU search can be more efficient and effective. Two sets of benchmarks are then generated to verify the quality of the proposed method. According to the experiment results, the proposed solution process can both resolve the problems and yield good results in a reasonable amount of computing time. The analysis of the solution process parameters is also provided. In addition, the comparisons between stochastic demand and deterministic demand cases are calculated and discussed as well.     

精喹禾灵合成新方法

[目的]介绍一种合成高质量精喹禾灵的新方法。[方法]采用固体光气作为卤化剂和在混合溶剂中的直接缩合法,合成精喹禾灵。[结果]产品总酯含量大于98%,光学含量大于99%,总收率达85%。[结论]该工艺为对环境比较友好的绿色化学工艺。     

调血脂药物阿伐他汀的合成路线

阿伐他汀是一个高效、安全的调血脂药物,具有广阔的市场前景.作者综述了其经典的合成方法有Paal-Knorr法、不对称还原羰基法、消旋体苯乙胺拆分法、选择性醇醛缩合法等方法.为阿伐他汀的工业化发展和创新打下基础.     

The synchronized arc and node routing problem: Application to road marking

This paper introduces the synchronized arc and node routing problem, inspired from a real application arising in road marking operations. In this setting, several capacitated vehicles are used to paint lines on the roads and a tank vehicle is used to replenish the painting vehicles. The aim of the problem is to determine the routes and schedules for the painting and replenishment vehicles so that the pavement marking is completed within the least possible time. This must be done in such a way that the routes of the painting and replenishment vehicles are synchronized. An adaptive large neighborhood heuristic is described and evaluated over a large set of artificial instances.     

ϵ-Caprolactam: new by-product free synthesis routes

The production of the nylon precursor ?-caprolactam via the Beckmann rearrangement is one of the large industrial processes worldwide. In this work, the state-of-the-art processes are summarized and the two main pathways for new production capacities (the butadiene-based and especially the heterogeneously catalyzed routes starting from benzene/cyclohexanone oxime) are described. Additionally, the new recycling processes to recover caprolactam from waste carpets and some new approaches are described.     

Molecular Mechanisms,Characterization Methods,and Utilities of Nanoparticle Biotransformation in Nanosafety Assessments

It is a big challenge to reveal the intrinsic cause of a nanotoxic effect due to diverse branches of signaling pathways induced by engineered nanomaterials (ENMs). Biotransformation of toxic ENMs involving biochemical reactions between nanoparticles (NPs) and biological systems has recently attracted substantial attention as it is regarded as the upstream signal in nanotoxicology pathways, the molecular initiating event (MIE). Considering that different exposure routes of ENMs may lead to different interfaces for the arising of biotransformation, this work summarizes the nano–bio interfaces and dose calculation in inhalation, dermal, ingestion, and injection exposures to humans. Then, five types of biotransformation are shown, including aggregation and agglomeration, corona formation, decomposition, recrystallization, and redox reactions. Besides, the characterization methods for investigation of biotransformation as well as the safe design of ENMs to improve the sustainable development of nanotechnology are also discussed. Finally, future perspectives on the implications of biotransformation in clinical translation of nanomedicine and commercialization of nanoproducts are provided.     

若干典型的猪服装革工艺路线

列举了若干猪服装革工艺路线 ,并进行了简要评述 ,提出了工艺板块的概念。     

基于PBIL进化算法的ATM虚通道路由规划

合理规划ATM(异步传输模式)网络的虚通道路由能有效提高网络业务服务质量和网络资源利用率，针对其NP完全特性，提出了一种基于PBIL(Population-Based Incremental Learning)进化算法的ATM虚通道路由规划算法，有效结合了遗传算法和竞争学习算法的特点，仿真表明，相对于文中提到的其它三种算法，该算法解的质量最高，能有效地收敛到问题的次优解，甚至最优解．