Overlapped Tray Seedling Raising Model for Mechanical Transplanting of Rice

With the development of China's social economy,transfer of rural labors,and rise of labor costs,the rice production technologies are changing from manual operation to mechanical operation.The core of mechanical rice production is mechanical planting,while the key to mechanical planting is the seedling raising.On the basis of analyzing and studying the problems and experience of traditional mechanical transplanting of rice,a new overlapped tray seedling raising model was introduced.Main features of this model: substrate seedling raising and overlapped seedling tray.The seedling trays for seeding line are overlapped,and the overlapped trays are moved into the seedling room with controlled temperature and humidity.The temperature of the seedling room is controlled at 30-32℃,and the humidity of the seedling room is controlled at above 90%.After about 48 h,when the seedling height reaches 0.5 cm,move the seedling trays to the nursery.This model consists of one seeding center( seedling raising center) and N nurseries,to realize 1 + N seedling raising for mechanical transplanting of rice.One seeding center can provide seedlings for several hundred to several thousand hectares of mechanical transplanting of rice,and provide a new model for social services.This model could improve the quality of seedlings,increase the seedling survival rate by about 20%,reduce the seedling raising costs by 15%-20%,reduce the seedling raising risks,and greatly increase the utilization rate of the site and equipment of seedling raising center.

Streaming Algorithms for Non-Submodular Maximizationon the Integer Lattice

Many practical problems emphasize the importance of not only knowing whether an element is selectedbut also deciding to what extent it is selected,which imposes a challenge on submodule optimization.In this study,we consider the monotone,nondecreasing,and non-submodular maximization on the integer lattice with a cardinalityconstraint.We first design a two-pass streaming algorithm by refining the estimation interval of the optimal value.Foreach element,the algorithm not only decides whether to save the element but also gives the number of reservations.Then,we introduce the binary search as a subroutine to reduce the time complexity.Next,we obtain a one-passstreaming algorithm by dynamically updating the estimation interval of optimal value.Finally,we improve the memorycomplexity of this algorithm.

组合代谢调控提高大肠杆菌对氨基苯甲酸产量

对氨基苯甲酸是一种重要的有机合成中间体,广泛应用于医药、染料等行业。近年来对氨基苯甲酸作为一种潜在的高强度共聚物单体越来越受到重视。对氨基苯甲酸作为叶酸合成的前体之一,其合成在大肠杆菌体内由叶酸合成途径的pabA、pabB和pabC三个基因负责,催化分支酸合成对氨基苯甲酸。本研究以实验室构建的酪氨酸高产工程菌TYR002作为出发菌株,首先弱化双功能分支酸突变酶/预苯酸脱氢酶TyrA的表达,以减少酪氨酸积累,然后利用3种不同强度的组成型启动子分别调控pabA、pabB和pabC的表达。摇瓶发酵表明不同的组合调控模式下大肠杆菌发酵培养基中的对氨基苯甲酸积累量存在显著差异,最高可获得0.67 g/L的摇瓶发酵产量。进一步通过发酵条件优化和分批补料发酵,在5L发酵罐中获得了6.4g/L的对氨基苯甲酸产量。本研究为改善对氨基苯甲酸生物合成效率提供了重要理论参考。

Distributed Consensus for Blockchains in Internet-of-Things Networks

In recent years,due to the wide implementation of mobile agents,the Internet-of-Things(IoT) networks have been applied in several real-life scenarios,servicing applications in the areas of public safety,proximity-based services,and fog computing.Meanwhile,when more complex tasks are processed in IoT networks,demands on identity authentication,certifiable traceability,and privacy protection for services in IoT networks increase.Building a blockchain system in IoT networks can greatly satisfy such demands.However,the blockchain building in IoT brings about new challenges compared with that in the traditional full-blown Internet with reliable transmissions,especially in terms of achieving consensus on each block in complex wireless environments,which directly motivates our work.In this study,we fully considered the challenges of achieving a consensus in a blockchain system in IoT networks,including the negative impacts caused by contention and interference in wireless channel,and the lack of reliable transmissions and prior network organizations.By proposing a distributed consensus algorithm for blockchains on multi-hop IoT networks,we showed that it is possible to directly reach a consensus for blockchains in IoT networks,without relying on any additional network layers or protocols to provide reliable and ordered communications.In our theoretical analysis,we showed that our consensus algorithm is asymptotically optimal on time complexity and is energy saving.The extensive simulation results also validate our conclusions in the theoretical analysis.