打造新时代创新策源地——以湖北科技特派员制度为例

湖北省多年来深入推行科技特派员制度,在全国科技特派员制度推行和科技服务的伟大实践中拼搏奋进,从启动科技特派员地市试点工作,到全面开展科技特派员基层创业行动,从出台深入推行科技特派员制度实施意见,到开展湖北省科技特派员"百县千镇万人"工程实施,围绕产业链布局人才链的科技生态日臻完善.科技特派员个人、团队和法人单位点面结合,工作室与工作站交相辉映,他们立足湖北服务华中片区和秦巴山区,辐射服务全国各地,湖北科技特派员的服务足迹遍布荆楚星辰大地,谱写着新时代湖北科技特派员服务体系的新篇章.     

基于知识图谱的核电设备健康管理知识建模与分析

随着信息技术发展,设备健康数据与知识图谱技术结合为设备健康发展带来新的发展机遇,知识图谱利用其多种特异性优势,使企业系统中积累的海量设备维修数据得到有效整合利用.本文提出基于知识图谱的核电设备健康管理知识建模与分析方法,并根据实体关系模型构建维修知识图谱本体框架,同时基于核电企业实际的维修工单数据,从统计分析和关联分析两方面取得良好的实践效果.研究结果表明,知识图谱能够在设备维修知识的集成上解决传统的数据孤岛问题,同时能基于故障的可视化分析为维修人员和管理人员提供决策和知识支持.     

钩形弯交叉口信号协同控制优化方法研究

针对车辆在钩形弯交叉口与相邻常规交叉口间的整体运行特性，建立了各条车道的车辆平均延误计算模型。以各交叉口的周期时长和相位绿灯时间为约束，钩形弯交叉口与相邻常规交叉口间的车辆平均延误最小为目标，建立了信号协同配时方案。以位于苏州市高新区内有轨电车沿线的两个相邻交叉口为例，采用实际数据验证所建立的方法，并设置钩形弯渠化方案。将设置的钩形弯交叉口与其相邻常规交叉口的信号协同作为改进方法，在VISSIM软件中对比分析改进方案与现状方案的车辆延误指标。实验结果表明，钩形弯交叉口与相邻常规交叉口的信号协同优化方法可有效提高交叉口的通行能力，尤其是干道直行机动车的通行能力，可降低车辆的平均延误。     

三种哲学视野下的政治观比较

本文比较分析了目的论、原子论、系统论三种哲学视野下的政治观。     

时标轴上二阶Dirichlet边值问题的弱解（英文）

采用变分方法和临界点理论研究一个时标轴上二阶Dirichlet边值问题弱解的存在性.     

关于二面体群的共轭类长素图

讨论二面体群的结构问题,利用GAP软件给出二面体群D2n的共轭类长素图,并完整给出当n以及n/2分别是奇数和偶数时的共轭类长素图情况.     

铸造工艺仿真设计前处理及过程处理应用技术

以应用ProCAST和MAGMAsoft 2款软件为例，针对铸造工艺仿真设计前处理和过程处理每个环节的主要内容与使用方法进行了较为详细地归纳、分析和总结。提出了处理过程的技术路线，并系统地介绍了每项应用内容的操作平台与使用步骤，从而为高效地应用铸造工艺仿真设计提供理论和技术支持。     

A Layer-Stripping Method for 3D Near-Surface Velocity Model Building Using Seismic First-Arrival Times

In order to improve the efficiency of 3D near-surface velocity model building, we develop a layer-stripping method using seismic first-arrival times. The velocity model within a Common Mid-Point (CMP) ...     

An Economic Model-Based Matching Approach Between Buyers and Sellers Through a Broker in an Open E-Marketplace

A broker in an open e-marketplace enables buyers and sellers to do business with each other. Although a broker plays an important role in e-marketplaces, theory and guidelines for matching between buyers and sellers in multi-attribute exchanges are limited. Therefore, a challenge for a broker’s responsibility is how to maximize a buyer’s total satisfaction degree as its goals under the consideration of trade-off between a buyer’s buying quantity and price paid to a seller, and other attributes. To solve this challenge, this paper proposes an economic model-based matching approach between a buyer’s requirements and a seller’s offers. The major contributions of this paper are that (i) a broker can model a seller’s price policy as per a buyer’s buying quantity through communication between a broker and a seller; (ii) due to each buyer’s different quantity demand, a broker models a buyer’s satisfaction degree as per a buyer’s buying quantity based on communication between a broker and a buyer; and (iii) to carry out a broker’s matching processes, an objective function and a set of constraints are generated to help a broker to maximize a buyer’s total satisfaction degree. Experimental results demonstrate the good performance of the proposed approach.     

Hierarchical Community Detection Based on Partial Matrix Convergence Using Random Walks

Random walks are a standard tool for modeling the spreading process in social and biological systems.But in the face of large-scale networks,to achieve convergence,iterative calculation of the transition matrix in random walk methods consumes a lot of time.In this paper,we propose a three-stage hierarchical community detection algorithm based on Partial Matrix Approximation Convergence(PMAC) using random walks.First,this algorithm identifies the initial core nodes in a network by classical measurement and then utilizes the error function of the partial transition matrix convergence of the core nodes to determine the number of random walks steps.As such,the PMAC of the core nodes replaces the final convergence of all the nodes in the whole matrix.Finally,based on the approximation convergence transition matrix,we cluster the communities around core nodes and use a closeness index to merge two communities.By recursively repeating the process,a dendrogram of the communities is eventually constructed.We validated the performance of the PMAC by comparing its results with those of two representative methods for three real-world networks with different scales.