多重网络中的创意扩散模型研究

基于线上线下多种渠道的创意扩散研究是企业管理的新兴研究热点之一.为此,引入多重网络理论与传播动力学理论,考虑工作中线下沟通、工作中通过企业社交媒体在线沟通及非工作时间电子沟通三种渠道,构建多种渠道构成的多重网络中的创意扩散模型.研究创意在多重网络中持续扩散的阈值条件,并对创意在多重网络中的扩散过程进行仿真实验.结果表明:1)当员工在单位时间内通过以上各渠道沟通的平均次数较接近时,在多重网络中创意扩散的速度较快,创意扩散的范围较广;2)与匀质网络相比,当非工作时间电子沟通子网络是无标度网络时,在多重网络中创意扩散的速度较快,扩散的范围较广;3)增大子网络层间创意扩散的相互促进作用对整个多重网络中创意的有效扩散有积极影响.     

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

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

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

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

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

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

利用SRTM数据修测高山区地貌的探讨

在高海拔区域测制地形图,如青藏高原地区,所获取的遥感影像局部存在着大范围的高山阴影或云雪覆盖,造成立体观测地貌困难的现象,探讨应用SRTM数据对这类特殊区域地貌进行修测补绘。介绍了数据处理的作业过程,并对实验区SRTM与SPOT5影像立体测图成果进行实验对比分析,成果符合要求。     

循环作用对马蹄寺石窟群岩体性能的影响

马蹄寺石窟群地处河西走廊中部,气候条件十分恶劣。由于常年受到温度、湿度、酸碱盐等作用的影响,石窟岩体性能出现了不同程度的劣化现象。通过开展室内模拟试验,研究以上多种恶劣环境的循环作用对于岩体抗压强度、波速、质量的影响规律,同时使用X射线衍射仪(X-ray diffraction,XRD)、X射线荧光光谱(X-ray fluorescence,XRF)和扫描电子显微镜(scanning electron microscope,SEM)对循环作用过程中样品的矿物组分、元素含量和微观形貌进行分析研究。研究结果表明,循环作用使样品中的长石类矿物和方解石含量降低,黏土类矿物含量增加,胶结程度下降,孔隙逐渐发展成为横向微裂隙,导致样品的性能出现不同程度的劣化现象。循环作用对岩体性能的影响程度从大到小依次为冻融循环、耐盐循环、耐碱循环、耐酸循环和温湿循环。     

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.     

基于修正斜压场的RC框架边节点剪切性能分析

为研究钢筋屈服强度和混凝土抗压强度对钢筋混凝土(RC)框架边节点剪切性能的影响规律,基于修正斜压场理论(MCFT),对某框架边节点的剪切应力-应变骨架曲线进行数值模拟,并与试验结果进行对比.在验证MCFT算法的精度后,研究钢筋屈服强度和混凝土抗压强度两个参数变化对RC框架边节点剪切应力-应变骨架曲线和峰值剪切应力的影响规律.结果表明:基于MCFT可以较好地模拟RC框架边节点的剪切应力-应变关系曲线; RC框架边节点的峰值剪切应力对混凝土抗压强度的变化更为敏感,但当试件的钢筋(HRB400)屈服应力下降幅度超过16.45%时,对钢筋屈服应力的变化更为敏感;当试件的钢筋(HRB400)屈服应力下降幅度超过10%时,节点发生钢筋滑移破坏,此时峰值剪切应力会大幅下降.     

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.