共享自动驾驶汽车使用意愿模型及其影响因素

为了构建共享自动驾驶汽车(shared autonomous vehicles，SAV) 的使用意愿模型并分析其影响因素，通过使用时机和使用频率来体现公众对SAV的使用意愿；采用验证性因子分析将态度潜变量转化为潜变量得分，以此将态度潜变量引入传统的有序Logit模型；提出SAV使用意愿的有序Logit模型构建方法，并建立基于个人属性、通勤特征、态度潜变量的SAV使用意愿模型.研究发现:是否使用过滴滴拼车、工作单位停车费、自动驾驶态度对使用时机和3种价格(1，2，3元/km) 下的使用频率有显著影响；使用过滴滴拼车、工作单位收取停车费、支持自动驾驶的群体倾向于频繁地、更早地使用SAV出行；公众期望以1元/km或 2元/km即不超过目前滴滴拼车的价格使用SAV.     

Meet-Cloud for Secure and Accurate Distribution of Negative Messages in Vehicular Ad hoc Network

Keeping Vehicular Ad hoc Network(VANET) from attacks requires secure and efficient distribution of information about bad entities. Negative messages are pieces of information that define the negative attributes of vehicles. By formally defining the negative message, we observe that accuracy is essential for its efficient distribution. We formally define the coverage percentage and accurate coverage percentage to describe the availability and distribution efficiency of negative message. These two metrics can jointly evaluate the performance of a distribution method. To obtain both high coverage percentage and high accurate coverage percentage, we propose meet-cloud, a scheme based on meet-table and cloud computing to securely and accurately distribute negative messages in VANET. A meet-table in a Road Side Unit(RSU) records the vehicles it encounters. All meettables are sent to cloud service to aggregate a global meet-table. The algorithm for distributing and redistributing negative messages are designed. Security analysis shows that meet-cloud is secure against fake and holding on to negative message attacks. Simulations and analysis demonstrate that meet-cloud is secure under denial of service and fake meet-table attacks. The simulation results also justify that meet-cloud outperforms the RSU broadcast and epidemic model.     

四螺旋创新集群:研究型大学人工智能发展生态重构与路向探究——以加拿大多伦多大学为例

以人工智能为代表的知识迭代发展,促使知识生产模式发生重大转变,催生了“大学—产业—政府—公众”四螺旋动力结构的建立和研究型大学知识生产新生态重构。以多伦多大学人工智能发展为例,考察其四螺旋利益相关主体及实践。从内在机理看,4个主体在互动运作中不仅重新确定了各自角色,而且还建立了大学(知识)—产业(产品)—政府(治理)—公众(公益)的新型逻辑链条,平衡公私利益格局,把公益指向作为人工智能四螺旋运作的中心目标;从外在特征看,4个主体形成了以大学为中心的区域创新网络,并牵引其他主体形成环高校创新集群。当前,我国在人工智能发展中不断发力,已进入世界第一方阵,但仍需要在国际比较学习中不断提升自身竞争力。基于案例分析,我国研究型大学发展人工智能有必要把握4个方面:一是走进中心,塑造大学在人工智能发展中的领导地位;二是以专促通,创新研究型大学人工智能专业培养模式;三是引企入研,提升校企合作人工智能创新的转化升级;四是人本导向,突出大学在人工智能发展中的公共价值。总体来看,我国研究型大学发展人工智能不仅要面临技术上的挑战,更要面临来自治理的挑战。     

基于主成分分析的管理学核心期刊评价研究

针对我国目前科技期刊评价中存在的学科划分不够严谨、指标权重人为选取等问题,以管理学核心期刊为研究对象,提出了基于主成分分析的期刊评价方法,对CNKI文献数据库中19种管理学核心期刊进行了分析和评价,给出期刊排名,并与影响因子及总被引频次的评价结果进行对比,表明了主成分分析方法的可靠性和客观性。     

Geochemistry of Clayey Aquitard Pore Water as Archive of Paleo-Environment,Western Bohai Bay

The record of paleo-environment in clayey aquitard pore water is much more effective relative to aquifer groundwater owing to the low permeability of clayey aquitard. Oxygen-18 (18O), deuterium (D), an...     

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

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

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) ...     

迹为整数的3×3阶正交矩阵的谱

讨论了3×3阶正交矩阵的特征值和迹的关系,证明了迹为整数的3×3阶正交矩阵的谱可由迹确定,为应用广泛的3×3阶正交矩阵的谱的计算提供了简单实用的方法.     

基于高斯字典原子稀疏表示的高精度宽角SAR成像方法

为了提高从宽角合成孔径雷达(synthetic aperture radar, SAR)图像中提取目标后向散射各向异性特性的性能,在宽角SAR字典稀疏表示模型的基础上,提出一种基于高斯字典原子的高精度宽角SAR成像方法。在字典构造上,采用不同中心位置、相同方差的高斯函数。在求解稀疏表示系数上,采用广义最小最大凹惩罚稀疏重构算法求解。最后，根据稀疏表示系数的重构结果以及构造的字典得到目标的后向散射各向异性特性。通过仿真实验和Backhoe数据对算法进行验证,结果表明,该方法能够高精度地提取目标的后向散射各向异性特性。     

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.