期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
水下无线传感器网络能力分析与评估方法 被引量:2
1
作者 韦正现 宋敏 +1 位作者 印桂生 王红滨 《哈尔滨工程大学学报》 EI CAS CSCD 北大核心 2017年第10期1531-1538,共8页
水下无线传感器网络(underwater wireless sensor network,UWSN)综合能力受到传感器能量消耗、探测半径以及网络拓扑等复杂因素影响,为了应对UWSN综合能力评估的挑战性难题,分析了UWSN综合能力与影响参数之间的关系。将UWSN综合能力划... 水下无线传感器网络(underwater wireless sensor network,UWSN)综合能力受到传感器能量消耗、探测半径以及网络拓扑等复杂因素影响,为了应对UWSN综合能力评估的挑战性难题,分析了UWSN综合能力与影响参数之间的关系。将UWSN综合能力划分为覆盖能力、连通能力、耐久能力和快速反应能力4个方面,将影响参数划分为约束参数、设备参数和组网参数,提出了覆盖能力、连通能力、耐久能力和快速反应能力的度量模型及UWSN综合能力评估过程模型,实现通过优化调整组网参数,使网络在不同任务和环境下具有优越的整体性能通过仿真平台和仿真试验,结果表明提出模型能较客观计算UWSN的综合能力。 展开更多
关键词 水下无线传感器网络 覆盖 连通 耐久 快速反应 评估 约束参数 设备参数 组网
在线阅读 下载PDF
基于卷积神经网络的手绘草图识别 被引量:3
2
作者 印桂生 严雪 +1 位作者 王宇华 张震 《吉林大学学报(信息科学版)》 CAS 2019年第4期417-425,共9页
针对目前手绘草图识别难度大,识别准确率低且主要以手工提取特征为主,提出一种新的卷积神经网络结构DCSN(Deeper-CNN-Sketch-Net)进行手绘图像识别。DCSN模型是根据手绘草图的特点进行设计,如在首层采用了更大的卷积核获取草图的结构信... 针对目前手绘草图识别难度大,识别准确率低且主要以手工提取特征为主,提出一种新的卷积神经网络结构DCSN(Deeper-CNN-Sketch-Net)进行手绘图像识别。DCSN模型是根据手绘草图的特点进行设计,如在首层采用了更大的卷积核获取草图的结构信息和更小的步长尽可能多保留特征信息,通过增加网络层数加深网络深度等。为进一步提高识别准确率,针对手绘草图的特点提出了两种新的数据增强方法,小图形缩减策略和尾部移除策略增加数据集的多样性,并利用扩充的数据集训练DCSN网络。经实验验证,所提出的模型在目前最大的手绘图像数据集上可以取得70. 5%的识别准确率,超过了目前存在的几种主流的手绘草图识别方法。 展开更多
关键词 手绘草图识别 卷积神经网络 网络模型 数据增强
在线阅读 下载PDF
基于字节码关键路径的智能合约漏洞检测 被引量:5
3
作者 印桂生 高乐 +1 位作者 庄园 李俊 《哈尔滨工程大学学报》 EI CAS CSCD 北大核心 2022年第2期255-261,共7页
目前智能合约漏洞检测技术手段单一,多数方法只针对合约的源代码,鲜有面向智能合约其他类型的安全检测。本文在仅给定智能合约二进制代码的情况下,针对最高频的可重入漏洞、委托调用漏洞和时间戳依赖漏洞,设计并实现了一种基于关键路径... 目前智能合约漏洞检测技术手段单一,多数方法只针对合约的源代码,鲜有面向智能合约其他类型的安全检测。本文在仅给定智能合约二进制代码的情况下,针对最高频的可重入漏洞、委托调用漏洞和时间戳依赖漏洞,设计并实现了一种基于关键路径的智能合约漏洞检测方法。基于合约字节码构建智能合约执行控制流图;根据智能合约漏洞特点定义关键指令及规则,生成关键路径;最后采用规则匹配实现漏洞检测。通过对以太坊网络上8000个智能合约进行实验测试,结果表明:该方法可有效检测上述3类漏洞,准确度高达93.75%。 展开更多
关键词 区块链 智能合约 安全分析 漏洞检测 二进制代码 字节码 关键指令 关键路径
在线阅读 下载PDF
A Random Anonymity Framework for Location Privacy 被引量:2
4
作者 YANG Songtao yin guisheng MA Chunguang 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2015年第6期521-529,共9页
Location k-anonymity techniques typically use anony- mous spatial region to ensure privacy. But these solutions are vul- nerable to multiple queries attacks and inference attacks. Failing to account for the obstacle i... Location k-anonymity techniques typically use anony- mous spatial region to ensure privacy. But these solutions are vul- nerable to multiple queries attacks and inference attacks. Failing to account for the obstacle in geographic space is a severe problem since adversaries will surely regard these constraints. A novel framework is proposed to enhance location-dependent queries, based on the theoretical work of k-anonymity and Voronoi diagrams, allows a user to express service requirement and privacy require- ment by specifying a region and an appropriate value ofk. A trusted anonymity server form a restricted set (k, r, s), which is composed of a number of discrete points to meet the requirements for location k-anonymity and location /-diversity. The location-based services (LBS) server implements an efficient algorithm for continu- ous-region-query processing. Simulation results demonstrated that the framework is superior to previous works in terms of privacy. Moreover, discreteness and randomness of the anonymous set are conducive to resisting location tracking attacks. 展开更多
关键词 data privacy location-based services(LBS) trusted third party K-ANONYMITY
原文传递
Shadow regions detection algorithm by adaptive narrowband two-phase Chan-Vese model 被引量:2
5
作者 WANG Xingmei yin guisheng +2 位作者 LIU Guangyu LIU Zhipeng WANG Xiaowei 《Chinese Journal of Acoustics》 CSCD 2016年第3期292-308,共17页
An adaptive narrowband two-phase Chan-Vese (ANBCV) model is proposed for improving the shadow regions detection performance of sonar images. In the first noise smoothing step, the anisotropic second-order neighborho... An adaptive narrowband two-phase Chan-Vese (ANBCV) model is proposed for improving the shadow regions detection performance of sonar images. In the first noise smoothing step, the anisotropic second-order neighborhood MRF (Markov Random Field, MRF) is used to describe the image texture feature parameters. Then, initial two-class segmentation is processed with the block mode k-means clustering algorithm, to estimate the approximate position of the shadow regions. On this basis, the zero level set function is adaptively initialized by the approximate position of shadow regions. ANBCV model is provided to complete local optimization for eliminating the image global interference and obtaining more accurate results. Experimental results show that the new algorithm can efficiently remove partial noise, increase detection speed and accuracy, and with less human intervention. 展开更多
关键词 MRF Shadow regions detection algorithm by adaptive narrowband two-phase Chan-Vese model
原文传递
Research on formalization of efficient query application problems with compound condition in software development
6
作者 Yang Yuchen Wang Xiaofang yin guisheng 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2017年第2期18-30,共13页
This paper provides a formalized definition of the application problem of compound condition query (CCQ) and a formal method of applying requirements elicitation based on trace information space derived from trace a... This paper provides a formalized definition of the application problem of compound condition query (CCQ) and a formal method of applying requirements elicitation based on trace information space derived from trace algebra. With the formalized process of solving the application problem of CCQ, formal requirements specification of application of CCQ is given, a formalized and automatic mapping of the results of requirements elicitation to the formal requirements specification is performed, the software system model and the application code are developed. Through a sample application of comprehensive query on housing information, the feasibility of formalized and automatic software development for the application problem of CCQ is proved. The result has important implications for the other problems regarding formalization and automatic software development. 展开更多
关键词 automatic programming formal specification requirements-based programming compound condition query
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部