期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到9篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Predicting Software Security Bugs Using Machine Learning and Quality Metrics: An Empirical Study 认领 引用
1
作者 Mohamed Diouf Elisée Toe +2 位作者 Manel Grichi Haïfa Nakouri Fehmi Jaafar 《Computers, Materials & Continua》 SCIE EI 2026年第6期436-477,共42页
Software security bugs present significant security risks to modern systems,leading to unauthorized access,data breaches,and severe operational and financial consequences.Early prediction of such vulnerabilities is th... Software security bugs present significant security risks to modern systems,leading to unauthorized access,data breaches,and severe operational and financial consequences.Early prediction of such vulnerabilities is therefore essential for strengthening software reliability and reducing remediation costs.This study investigates the extent to which static software quality metrics can identify vulnerable code and evaluates the effectiveness of machine learning models for large-scale security-bug prediction.We analyze a dataset of 338,442 source files,including 33,294 buggy files,collected from seven major open-source ecosystems.These ecosystems include GitHub Security Advisories(GHSA),Python Package Index(PyPI),OSS-Fuzz(Google’s open-source fuzzing service),Node Package Manager(npm),Packagist(the PHP package repository),Apache Maven,and NuGet(the.NET package manager).Using the Open Source Vulnerabilities(OSV)platform,we identify 7685 confirmed security bugs and extract 25 static software quality metrics per file with the Understand analysis tool.We apply five complementary feature-importance techniques and evaluate eleven machine-learning classifiers under a time-series cross-validation protocol.Our analysis reveals three key findings.First,six core metrics consistently show strong associations with the presence of security bugs across all feature-selection methods.Second,buggy files exhibit substantially higher metric values,with medians approximately three times those of non-buggy files,a pattern we term the“3×rule”;Mann-Whitney U tests confirm that these differences are statistically significant.Third,the machine-learning models achieve strong predictive performance,with XGBoost providing the best results(recall=0.82,precision=0.95,Receiver Operating Characteristic-Area Under the Curve(ROC-AUC)=0.91).Based on these findings,we propose data-driven warning and critical thresholds for the most influential metrics to support proactive security assessment.Overall,this work provides large-scale empirical evidence that software quality metrics,combined with machine learning,offer actionable signals for detecting security bugs and for integrating automated vulnerability prediction into software development workflows. 展开更多
关键词 Security bugs vulnerability prediction software metrics machine learning code complexity software quality
暂未订购 下载PDF
A Low Complexity VCS Method for PAPR Reduction in Multicarrier Code Division Multiple Access 认领 引用
2
作者 Si-Si Liu Yue Xiao Qing-Song Wen Shao-Qian Li 《Journal of Electronic Science and Technology of China》 2007年第2期102-106,共5页
This paper investigates a peak to average power ratio （PAPR） reduction method in multicarrier code division multiple access （MC-CDMA） system. Variable code sets （VCS）, a spreading codes selection scheme, can imp... This paper investigates a peak to average power ratio （PAPR） reduction method in multicarrier code division multiple access （MC-CDMA） system. Variable code sets （VCS）, a spreading codes selection scheme, can improve the PAPR property of the MC-CDMA signals, but this technique requires an exhaustive search over the combinations of spreading code sets. It is observed that when the number of active users increases, the search complexity will increase exponentially. Based on this fact, we propose a low complexity VCS （LC-VCS） method to reduce the computational complexity. The basic idea of LC-VCS is to derive new signals using the relationship between candidature signals. Simulation results show that the proposed approach can reduce PAPR with lower comtational pucomplexity. In addition, it can be blindly received without any side information. 展开更多
关键词 Low complexity variable code sets,multicarrier code division multiple access （MC-CDMA）,peak to average power ratio variable code sets.
暂未订购 下载PDF
Efficient fast mode decision using mode complexity for multi-view video coding 认领 引用 被引量：2
3
作者 王凤随 沈庆宏 都思丹 《Journal of Central South University》 SCIE EI CAS 2014年第11期4244-4253,共10页
The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduce... The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduced in coding system, which hinders practical application of MVC. An efficient fast mode decision method using mode complexity is proposed to reduce the computational complexity. In the proposed method, mode complexity is firstly computed by using the spatial, temporal and inter-view correlation between the current macroblock(MB) and its neighboring MBs. Based on the observation that direct mode is highly possible to be the optimal mode, mode complexity is always checked in advance whether it is below a predefined threshold for providing an efficient early termination opportunity. If this early termination condition is not met, three mode types for the MBs are classified according to the value of mode complexity, i.e., simple mode, medium mode and complex mode, to speed up the encoding process by reducing the number of the variable block modes required to be checked. Furthermore, for simple and medium mode region, the rate distortion(RD) cost of mode 16×16 in the temporal prediction direction is compared with that of the disparity prediction direction, to determine in advance whether the optimal prediction direction is in the temporal prediction direction or not, for skipping unnecessary disparity estimation. Experimental results show that the proposed method is able to significantly reduce the computational load by 78.79% and the total bit rate by 0.07% on average, while only incurring a negligible loss of PSNR(about 0.04 d B on average), compared with the full mode decision(FMD) in the reference software of MVC. 展开更多
关键词 multi-view video coding mode decision mode complexity computational complexity
暂未订购 下载PDF
Frame complexity optimized selection for H.264/AVC video coding 认领 引用
4
作者 Tian Ling Sun Yu +1 位作者 Zhou Yimin Sun Shixin 《High Technology Letters》 EI CAS 2011年第4期383-387,共5页
To improve the coding performance of H.264/AVC, this paper proposes a rate control scheme composed of a novel flame complexity optimized selection and a quantization parameter （QP） value computation approach. First,... To improve the coding performance of H.264/AVC, this paper proposes a rate control scheme composed of a novel flame complexity optimized selection and a quantization parameter （QP） value computation approach. First, it extracts the frame coding complexity from two rate distortion models, and then introduces five statistic modes to estimate the frame coding complexity. An optimal mode is selected according to the coding efficiency. Finally the paper presents a novel QP calculation method for the H.264/AVC rate control. Experimental results show that the proposed algorithra outperforms the algorithm integrated in the 3M model in obtaining precise frame coding complexity, achieving robust buffer control and improving coding quality. And the improving visual quality is high up to 0.90dB for CIF sequences. 展开更多
关键词 frame coding complexity rate control H.264/AVC RD model
暂未订购 下载PDF
Complex field network-coded cooperation based on multi-user detection in wireless networks 认领 引用 被引量：2
5
作者 Jing Wang Xiangyang Liu +1 位作者 Kaikai Chi Xiangmo Zhao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第2期215-221,共7页
Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC... Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values. 展开更多
关键词 network coding complex field wireless network cooperative communication multi-user detection
暂未订购 下载PDF
Efficient Broadcast Retransmission Based on Network Coding for InterPlaNetary Internet 认领 引用 被引量：3
6
作者 苟亮 边东明 +2 位作者 张更新 徐志平 申振 《China Communications》 SCIE CSCD 2013年第8期111-124,共14页
In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retra... In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs). 展开更多
关键词 wireless broadcast retransmission opportunistic network coding packet scheduling transmission efficiency computational complexity PN
暂未订购 下载PDF
Furfural residues from straw become complex fertilizer by addition method 认领 引用 被引量：2
7
作者 LIU Jun\gui,CHEN An\ 《Journal of Environmental Sciences》 SCIE EI CAS 2000年第2期74-77,共4页
The additives such as phosphoric acid, calcium phosphate, calcium super phosphate, calcium over super phosphate, calcium carbonate, sodium hydrosulphite, etc. were used to produce furfural from the straw by hydrolysis... The additives such as phosphoric acid, calcium phosphate, calcium super phosphate, calcium over super phosphate, calcium carbonate, sodium hydrosulphite, etc. were used to produce furfural from the straw by hydrolysis with sulfuric acid. The effect of amount of the additives, the content of the added substance and the conditions of distillation on the acidity of the residues were studied. The experiment results showed that the all residues became neutral complex fertilizer, and the productivity of furfural increases under the following conditions: sulfuric acid concentration is 20% (by weight), the ratio of liquid to solid is 3∶1—4∶1 (by weight), the ratio of the additives to straw is suitable. 展开更多
关键词 straw furfural residues complex fertilizer CLC number: X712 Document code: A
暂未订购 下载PDF
Optimal power allocation for complex field network coding scheme with the K-th best relay selection 认领 引用
8
作者 Xi CAI Pingzhi FAN Qingchun CHEN 《Journal of Modern Transportation》 2012年第4期255-260,共6页
Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme wit... Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme with the K-th best relay selection （KBS） is proposed and investigated, wherein the K-th best relay is selected to forward the multiplexed signal to the destination. First, the upper bound of the symbol error probability （SEP）, the diversity order, and the coding gain are derived for the CFNC scheme with KBS. Then, the coding gain is utilized as the optimized cri- terion to determine the optimal power allocation. It is validated through analysis and simulation that the CFNC scheme with KBS can achieve full diversity only when K=I, while the diversity order decreases with increasing parameter K, and the optimal power allocation can significantly improve the performance of the CFNC scheme with KBS. 展开更多
关键词 complex field network coding the K-th best relay selection power allocation
暂未订购 下载PDF
Prove the Minimal Delay of Complex Orthogonal Space-Time Block Code by Hadamard Matrix 认领 引用 被引量：2
9
作者 ZHOU Li-gang SUN Dan-dan +2 位作者 LI Xin MIAO Jian-song DING Wei 《The Journal of China Universities of Posts and Telecommunications》 EI 2006年第1期25-28,共4页
The complex orthogonal designs with maximal rates and minimal delays is an open problem for space-time block code. Maximal rate can effectively transmit symbols to the lonest distance in the space dimension ; and mini... The complex orthogonal designs with maximal rates and minimal delays is an open problem for space-time block code. Maximal rate can effectively transmit symbols to the lonest distance in the space dimension ; and minimal delay is the least decoding delay in the time dimension. Many authors have observed that regarding the complex orthogonal designs for space-time block codes with the antennas n = 4k （ k ∈ N ）, its minimal delay is the same as that for n - 4k -1. However none was able to prove it. In this paper, we use the characteristics of Hadamard matrix to prove this property to fulfill this vacancy. 展开更多
关键词 complex orthogonal space-time block code hadamard matrix minimal delay maximal rate
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈