关于广义非线性隐似变分包含问题

文章在Hilbert空间中引入了一类新的涉及（A，η）单调映射的非线性集值隐似变分包含问题，基于与（A，η）单调性相关的广义预解算子技巧，用一种迭代算法研究了解的近似可解性，所得结果改进了许多近期结果．     

起重机用打磨机器人结构设计

根据起重机无损探伤检测要求,对起重机用打磨机器人进行总体布局和结构设计,并结合其使用环境和工作要求选择了双履带、永磁吸附式的总体结构.打磨机器人传动机构选用链传动,其驱动方式按实际控制的需要选择步进电机驱动;打磨机构采用电机驱动,工作时打磨压力由压缩弹簧提供,并由电磁铁来控制工作状态.打磨机器人在起重机构件上的固定采用磁吸附式吊挂结构.     

Strategic Robust Mixed Model Assembly Line Balancing Based on Scenario Planning

Assembly line balancing involves assigning a series of task elements to uniform sequential stations with certain restrictions. Decision makers often discover that a task assignment which is optimal with respect to a deterministic or stochastic/fuzzy model yields quite poor performance in reality. In real environments, assembly line balancing robustness is a more appropriate decision selection guide. A robust model based on the α worst case scenario is developed to compensate for the drawbacks of traditional robust criteria. A robust genetic algorithm is used to solve the problem. Comprehensive computational experiments to study the effect of the solution procedure show that the model generates more flexible robust solutions. Careful tuning the value of α allows the decision maker to balance robustness and conservativeness of as- sembly line task element assignments.     

New Voronoi Diagram Algorithm of Multiply-Connected Planar Areas in the Selective Laser Melting

This paper studies the practical generation of Voronoi diagrams for multiply-connected planar areas bounded by line segments. The core of the algorithm was calculating Voronoi polygon of every Voronoi object in planar areas independently. The main approach had two steps. The first step was calculating all relevant bisectors of every Voronoi object. The second was combining obtained bisectors into completed Voronoi polygons individually. All code was implemented in Visual C++ platform. The resulting code was extensively tested in real-world data and its practical running time grew only linearly. Three statistical CPU-consumption charts had been drawn with the Voronoi diagrams computation data, and compared with other published codes for computing Voronoi diagrams. The algorithm was applied to compute offsetting of slice area consisting of large-scale line segments for the selective laser melting (SLM) trajectory scanning technology which is a kind of rapid prototyping (RP). The experimental results of offsetting for slice area based on Voronoi diagrams show that the approach is effective and simple for polygon offsetting problems. The method is helpful to those offsetting work and can provide more effective offsetting solution.     

基于信任服务IBE体系的权限管理

针对现有的基于身份加密（identity based encryption, IBE）体系中缺乏权限管理问题, 提出一种基于信任服务IBE体系下的权限管理方案. 该方案采用门限的思想和算法对服务进行集中管理, 并结合基于角色的访问控制管理权限, 实现了细粒度的权限管理. 采用信任继承的思想为用户分配角色, 并采用集中审计的思想维护系统, 提高了系统的可靠性.     

双抛物面均匀反射聚焦式光伏发电供热装置

为进一步提高光伏发电系统的整机效率,研制了一套基于双抛物面均匀反射聚焦方式的新型光伏发电供热装置.分析了装置的整体构件组成、双抛物面聚光原理及其结构参数关系,并给出两轴伺服跟踪实现原理框图.基于滤红外线和水冷法相结合的光伏电板冷却技术,及两轴伺服结构和混合追日跟踪策略等技术原理进行设计.通过对原理实物样机的现场实测,验证了装置设计的正确有效性.     

Prediction of sites under adaptive evolution in flavin-containing monooxygenases: Selection pattern revisited

Flavin-containing monooxygenase (FMO), like cytochrome P450 (CYP), is a monooxygenase that uses the reducing equivalents of NADPH to reduce one atom of molecular oxygen to water, while the other atom is used to oxidize the substrate. Recently, it was shown that some CYP isoforms have been subject to positive selection. However, it is unknown whether the highly conserved phase I detoxification enzyme, FMO, has undergone similar positive Darwinian selection. We used maximum-likelihood models of codon substitution, evolutionary fingerprinting, and cross species comparison to investigate the occurrence of adaptive evolution in FMO sequences. We used recent genomic data from a range of species, including vertebrates and invertebrates. We present the evidence for the occurrence of adaptive evolution in mammalian FMO 3, 4, 5, and fugu FMOs but not in mammalian FMO 1, FMO 2, frog FMOs, other fish FMOs and invertebrate FMOs. The sites under adaptive evolution were significantly associated with the insertion domain in mammalian FMO 5. We identified specific amino acid sites in FMOs 3–5 that are likely targets for selection based on the patterns of parallel amino acid change. The most likely role of adaptive evolution is the repair of mutations that permitted optimal NADP+ binding and improved catalytic efficiency. The occurrence of positive selection during the evolution of phase I detoxification enzymes such as FMOs 3–5 and fugu FMO suggests the occurrence of both high selection pressure acting on species within their unique habitats and significant changes in intensity and direction (forms of xenobiotics and drugs) resulting from changes in microhabitat and food.     

自适应模糊控制和PLC在中央空调控制系统中的应用

为克服中央空调控制系统舒适度调节能力差,能源浪费严重,可靠性低,通信实时性控制不高的不足,提出了一套基于自适应模糊控制方法,从系统的硬件构成、软件设计两个方面探讨了Simatic S7-300在中央空调控制系统中的应用.实际运行表明,该系统运行稳定、可靠、同时降低了能耗.     

基于层次性的交通网络资源优化配置方法

利用交通网络层次性这一基本特征,研究随机交通配流算法与交通网络资源优化配置方法。在分析算法的设计基础上,定义层次因子,并提出利用复杂网络拓扑特征或交通关联度来确定交通网络的层次数目和层次因子,在Dial算法的基础上利用层次性设计层次随机交通分配算法(HSTAA);通过算例验证与分析HSTAA算法,提出基于层次性的交通网络资源的优化配置方法。研究结果表明:由HSTAA算法得到的交通网络总阻抗在层次因子的某一合理取值范围内小于Dial算法所得的总阻抗,且交通网络的总阻抗随较高层次路段层次的提高而减小,但交通网络的尾气排放总量却随较高层次路段层次的提高而增大,但它始终小于由Dial算法所得到的结果;将网络层次状况控制在合理范围内就能有效地调节和优化交通网络资源配置。     

Construction of protograph LDPC codes with circular generator matrices

The application of protograph low density parity check(LDPC) codes involves the encoding complexity problem.Since the generator matrices are dense,and if the positions of "1" s are irregularity,the encoder needs to store every "1" of the generator matrices by using huge chip area.In order to solve this problem,we need to design the protograph LDPC codes with circular generator matrices.A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed.The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix.This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices,and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem.Simulation results in additive white Gaussian noise(AWGN) channels show that the bit error rate(BER) performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.