期刊文献+
共找到22篇文章
< 1 2 >
每页显示 20 50 100
Buffer Overflow Detection on Binary Code 被引量:2
1
作者 郑燕飞 李晖 陈克非 《Journal of Shanghai Jiaotong university(Science)》 EI 2006年第2期224-229,共6页
Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically th... Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically the potential buffer overflow vulnerabilities in the binary code of software. The binary code was translated into assembly code without the lose of the information of string operation functions. The feature code abstract graph was constructed to generate more accurate constraint statements, and analyze the assembly code using the method of integer range constraint. After getting the elementary report on suspicious code where buffer overflows possibly happen, the control flow sensitive analysis using program dependence graph was done to decrease the rate of false positive. A prototype was implemented which demonstrates the feasibility and efficiency of the new approach. 展开更多
关键词 binary code buffer overflow integer range constraint feature abstract graph
下载PDF
Unleashing the power of pseudo-code for binary code similarity analysis
2
作者 Weiwei Zhang Zhengzi Xu +1 位作者 Yang Xiao Yinxing Xue 《Cybersecurity》 EI CSCD 2023年第2期44-61,共18页
Code similarity analysis has become more popular due to its significant applicantions,including vulnerability detection,malware detection,and patch analysis.Since the source code of the software is difficult to obtain... Code similarity analysis has become more popular due to its significant applicantions,including vulnerability detection,malware detection,and patch analysis.Since the source code of the software is difficult to obtain under most circumstances,binary-level code similarity analysis(BCSA)has been paid much attention to.In recent years,many BCSA studies incorporating Al techniques focus on deriving semantic information from binary functions with code representations such as assembly code,intermediate representations,and control flow graphs to measure the similarity.However,due to the impacts of different compilers,architectures,and obfuscations,binaries compiled from the same source code may vary considerably,which becomes the major obstacle for these works to obtain robust features.In this paper,we propose a solution,named UPPC(Unleashing the Power of Pseudo-code),which leverages the pseudo-code of binary function as input,to address the binary code similarity analysis challenge,since pseudocode has higher abstraction and is platform-independent compared to binary instructions.UPPC selectively inlines the functions to capture the full function semantics across different compiler optimization levels and uses a deep pyramidal convolutional neural network to obtain the semantic embedding of the function.We evaluated UPPC on a data set containing vulnerabilities and a data set including different architectures(X86,ARM),different optimization options(O0-O3),different compilers(GCC,Clang),and four obfuscation strategies.The experimental results show that the accuracy of UPPC in function search is 33.2%higher than that of existing methods. 展开更多
关键词 binary code similarity Machine learning Software security PSEUDO-code
原文传递
Fast approximate matching of binary codes with distinctive bits 被引量:3
3
作者 Chenggang Clarence YAN Hongtao XIE +3 位作者 Bing ZHANG Yanping MA Qiong DAI Yizhi LIU 《Frontiers of Computer Science》 SCIE EI CSCD 2015年第5期741-750,共10页
Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate ... Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which hierarchical clustering trees (HCT) are widely used. However, HCT select cluster centers randomly and build indexes with the entire binary code, this degrades search performance. In this paper, we first propose a new clustering algorithm, which chooses cluster centers on the basis of relative distances and uses a more homogeneous partition of the dataset than HCT has to build the hierarchical clustering trees. Then, we present an algorithm to compress binary codes by extracting distinctive bits according to the standard deviation of each bit. Consequently, a new index is proposed using compressed binary codes based on hierarchical decomposition of binary spaces. Experiments conducted on reference datasets and a dataset of one billion binary codes demonstrate the effectiveness and efficiency of our method. 展开更多
关键词 binary codes approximate nearest neighbor search hierarchical clustering index
原文传递
Study on Binary Code Evolution with Concrete Semantic Analysis
4
作者 Bing Xia Jianmin Pang +2 位作者 Jun Wang Fudong Liu Feng Yue 《国际计算机前沿大会会议论文集》 2021年第2期30-43,共14页
The study on binary code evolution is very crucial for understanding vulnerability repair and malicious code variants.Researchers on code evolution focus on the source code level,whereas very few works have been done ... The study on binary code evolution is very crucial for understanding vulnerability repair and malicious code variants.Researchers on code evolution focus on the source code level,whereas very few works have been done to tackle this problem at the binary code level.In this paper,a binary code evolution analysis framework is proposed to automatically locate evolution area and identify evolution semantic with concrete semantic difference.Difference of binary function domain was applied based on function similarity.Trace alignment was used to find evolution blocks,instruction classification semantic was utilized to identify evolution operation,and evolution semantic was extracted combined with function domain elements.The experimental results show that binary code evolution analysis framework can correctly locate binary code evolution area and identify all concrete semantic evolution. 展开更多
关键词 binary code code evolution Evolution area Semantic analysis
原文传递
Implementation of a kind of FPGA-based binary phase coded radar signal processor architecture 被引量:1
5
作者 田黎育 孙密 万阳良 《Journal of Beijing Institute of Technology》 EI CAS 2012年第4期526-531,共6页
A flexible field programmable gate array based radar signal processor is presented. The radar signal processor mainly consists of five functional modules: radar system timer, binary phase coded pulse compression(PC... A flexible field programmable gate array based radar signal processor is presented. The radar signal processor mainly consists of five functional modules: radar system timer, binary phase coded pulse compression(PC), moving target detection (MTD), constant false alarm rate (CFAR) and target dots processing. Preliminary target dots information is obtained in PC, MTD, and CFAR modules and Nios I! CPU is used for target dots combination and false sidelobe target removing. Sys- tem on programmable chip (SOPC) technique is adopted in the system in which SDRAM is used to cache data. Finally, a FPGA-based binary phase coded radar signal processor is realized and simula- tion result is given. 展开更多
关键词 field programmable gate array(FPGA) radar signal processor system on programma-ble chip (SOPC) binary phase coded
下载PDF
Research of Methods for Lost Data Reconstruction in Erasure Codes over Binary Fields 被引量:2
6
作者 Dan Tang 《Journal of Electronic Science and Technology》 CAS CSCD 2016年第1期43-48,共6页
In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of inform... In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of information technology.A matrix decoding method is proposed in this paper.The method is a universal data reconstruction scheme for erasure codes over binary fields.Besides a pre-judgment that whether errors can be recovered,the method can rebuild sectors of loss data on a fault-tolerant storage system constructed by erasure codes for disk errors.Data reconstruction process of the new method has simple and clear steps,so it is beneficial for implementation of computer codes.And more,it can be applied to other non-binary fields easily,so it is expected that the method has an extensive application in the future. 展开更多
关键词 binary fields data reconstruction decoding erasure codes
下载PDF
Optimal binary codes and binary construction of quantum codes
7
作者 Weiliang WANG Yangyu FAN Ruihu LI 《Frontiers of Computer Science》 SCIE EI CSCD 2014年第6期1024-1030,1031,共8页
This paper discusses optimal binary codes and pure binary quantum codes created using Steane construction. First, a local search algorithm for a special subclass of quasi-cyclic codes is proposed, then five binary qua... This paper discusses optimal binary codes and pure binary quantum codes created using Steane construction. First, a local search algorithm for a special subclass of quasi-cyclic codes is proposed, then five binary quasi-cyclic codes are built. Second, three classical construction methods are generalized for new codes from old such that they are suitable for constructing binary self-orthogonal codes, and 62 binary codes and six subcode chains of obtained self-orthogonal codes are designed. Third, six pure binary quantum codes are constructed from the code pairs obtained through Steane construction. There are 66 good binary codes that include 12 optimal linear codes, 45 known optimal linear codes, and nine known optimal self-orthogonal codes. The six pure binary quantum codes all achieve the performance of their additive counterparts constructed by quaternary construction and thus are known optimal codes. 展开更多
关键词 binary linear code binary self-orthogonal code quasi-cyclic code Steane construction quantum code.
原文传递
Binary Cyclic Codes and Minimal Codewords
8
作者 Selda Calkavur 《Computer Technology and Application》 2013年第9期486-489,共4页
Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal... Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes. 展开更多
关键词 Linear code cyclic code binary cyclic code generator polynomial minimal codeword secret sharing.
下载PDF
[[2n ,n]] ADDITIVE QUANTUM ERROR CORRECTING CODES
9
作者 Du Yongjun Ma Yuefei 《Journal of Electronics(China)》 2008年第4期519-522,共4页
The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3],where Bi are the binary n ×n matrices,I is an identity matrix.By the use of th... The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3],where Bi are the binary n ×n matrices,I is an identity matrix.By the use of the binary codes that generated by [B1 I B2 B2B1^T],asymptotic good[[2n ,n ]]additive quantum codes are obtained. 展开更多
关键词 Additive quantum codes binary codes Symplectic inner product Asymptotic good codes
下载PDF
Optimization of Mapping Rule of Bit-Interleaved Turbo Coded Modulation with 16QAM 被引量:1
10
作者 费泽松 杨宇 +1 位作者 刘林南 匡镜明 《Journal of Beijing Institute of Technology》 EI CAS 2005年第1期18-21,共4页
Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding perfor... Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding performance. Furthermore, bit-interleaved in-phase and quadrature phase (I-Q) Turbo coded modulation scheme are designed similarly with I-Q trellis coded modulation (TCM). Through performance evaluation and analysis, it can be seen that the novel mapping rule outperforms traditional one and the I-Q Turbo coded modulation can not achieve good performance as expected. Therefore, there is not obvious advantage in using I-Q method in bit-interleaved Turbo coded modulation. 展开更多
关键词 binary Turbo coded modulation quadrature amplitude modulation (QAM) mapping rule in-phase and quadrature (I-Q) coded modulation
下载PDF
An adaptive pipelining scheme for H.264/AVC CABAC decoder 被引量:1
11
作者 陈杰 Ding Dandan Yu Lu 《High Technology Letters》 EI CAS 2013年第4期391-397,共7页
An adaptive pipelining scheme for H.264/AVC context-based adaptive binary arithmetic coding(CABAC) decoder for high definition(HD) applications is proposed to solve data hazard problems coming from the data dependenci... An adaptive pipelining scheme for H.264/AVC context-based adaptive binary arithmetic coding(CABAC) decoder for high definition(HD) applications is proposed to solve data hazard problems coming from the data dependencies in CABAC decoding process.An efficiency model of CABAC decoding pipeline is derived according to the analysis of a common pipeline.Based on that,several adaptive strategies are provided.The pipelining scheme with these strategies can be adaptive to different types of syntax elements(SEs) and the pipeline will not stall during decoding process when these strategies are adopted.In addition,the decoder proposed can fully support H.264/AVC high4:2:2 profile and the experimental results show that the efficiency of decoder is much higher than other architectures with one engine.Taking both performance and cost into consideration,our design makes a good tradeoff compared with other work and it is sufficient for HD real-time decoding. 展开更多
关键词 H.264/AVC context-based adaptive binary arithmetic coding (CABAC) ADAPTIVE PIPELINE data dependency data hazard
下载PDF
A New Description of the Additive Quantum Codes
12
作者 唐黎明 刘焕平 吕学琴 《Northeastern Mathematical Journal》 CSCD 2006年第3期285-290,共6页
A new description of the additive quantum codes is presented and a new way to construct good quantum codes [[n, k, d]] is given by using classical binary codes with specific properties in F2^3n. We show several conseq... A new description of the additive quantum codes is presented and a new way to construct good quantum codes [[n, k, d]] is given by using classical binary codes with specific properties in F2^3n. We show several consequences and examples of good quantum codes by using our new description of the additive quantum codes. 展开更多
关键词 quantum code binary linear code dual code
下载PDF
Face Recognition Algorithm Fusing Monogenic Binary Coding and Collaborative Representation
13
作者 FU Yu-xian PENG Liang-yu 《Computer Aided Drafting,Design and Manufacturing》 2015年第2期14-18,共5页
Monogenic binary coding (MBC) have been known to be effective for local feature extraction, while sparse or collaborative representation based classification (CRC) has shown interesting results in robust face reco... Monogenic binary coding (MBC) have been known to be effective for local feature extraction, while sparse or collaborative representation based classification (CRC) has shown interesting results in robust face recognition. In this paper, a novel face recognition algorithm of fusing MBC and CRC named M-CRC is proposed; in which the dimensionality problem is resolved by projection matrix. The proposed algorithm is evaluated on benchmark face databases, including AR, PolyU-NIR and CAS-PEAL. The results indicate a significant increase in the performance when compared with state-of-the-art face recognition methods. 展开更多
关键词 face recognition monogenic binary coding collaborative representation
下载PDF
Repeater jamming suppression method for pulse Doppler fuze based on identity recognition and chaotic encryption 被引量:6
14
作者 Jian Dai Xin-hong Hao +2 位作者 Qiang Liu Xiao-peng Yan Ping Li 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2021年第3期1002-1012,共11页
Pulse Doppler(PD) fuze is widely used in current battlefield. However, with the threat of repeater jamming, especially digital radio frequency memory technology, the deficiency in the anti-repeater jamming of a tradit... Pulse Doppler(PD) fuze is widely used in current battlefield. However, with the threat of repeater jamming, especially digital radio frequency memory technology, the deficiency in the anti-repeater jamming of a traditional PD fuze increasingly emerges. Therefore, a repeater jamming suppression method for a PD fuze based on identity(ID) recognition and chaotic encryption is proposed. Every fuze has its own ID which is encrypted with different chaotic binary sequences in every pulse period of the transmitted signal. The thumbtack-shaped ambiguity function shows a good resolution and distance cutoff characteristic. The ability of anti-repeater jamming is emphatically analyzed, and the results at different signal-to-noise ratio(SNR) show a strong anti-repeater jamming ability and range resolution that the proposed method possesses. Furthermore, the anti-repeater jamming ability is influenced by processing gain, bit error rate(BER) and correlation function. The simulation result validates the theoretical analysis, it shows the proposed method can significantly improve the anti-repeater jamming ability of a PD fuze. 展开更多
关键词 Pulse Doppler fuze ID Chaotic binary code ENCRYPTION Repeater jamming
下载PDF
Multi-Threat Real-Time Separating System 被引量:2
15
作者 詹磊 赵建民 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2001年第4期23-27,共5页
This paper describes a multi-threat real-time separating system for broadband anti-radiation missile seeker. It presents a method, with a dual-port memory as comparer, to perform PF and PW hardware real-time separatio... This paper describes a multi-threat real-time separating system for broadband anti-radiation missile seeker. It presents a method, with a dual-port memory as comparer, to perform PF and PW hardware real-time separation and to determine the time-of-arrival (TOA) by use of sequential difference histogram (SDIF). The method has been applied to practice, which has achieved good results. 展开更多
关键词 binary codes Frequencies Poisson distribution Pulse width modulation Random access storage Real time systems
下载PDF
Key Frames Extraction Based on the Improved Genetic Algorithm
16
作者 ZHOU Dong-sheng JIANG Wei +1 位作者 YI Peng-fei LIU Rui 《Computer Aided Drafting,Design and Manufacturing》 2014年第4期74-78,共5页
In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary... In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary codingatthebeginning of the coding;we use multi-point crossoverto replace the originalsingle-point crossoveroperation.Finally, theexperimentshows that the improved genetic algorithmnot only has a strong search capability, but also thestability has been effectively improved. 展开更多
关键词 key frames extraction grey code binary code genetic algorithm
下载PDF
Evolutionary Computation for Realizing Distillation Separation Sequence Optimization Synthesis 被引量:2
17
作者 Dong Hongguang Qin Limin Wang Kefeng Yao Pingjing 《China Petroleum Processing & Petrochemical Technology》 SCIE CAS 2005年第4期52-59,共8页
Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequenc... Evolutionary algorithm is applied for distillation separation sequence optimization synthesis problems with combination explosion. The binary tree data structure is used to describe the distillation separation sequence, and it is directly applied as the coding method. Genetic operators, which ensure to prohibit illegal filial generations completely, are designed by using the method of graph theory. The crossover operator based on a single parent or two parents is designed successfully. The example shows that the average ratio of search space from evolutionary algorithm with two-parent genetic operation is lower, whereas the rate of successful minimizations from evolutionary algorithm with single parent genetic operation is higher. 展开更多
关键词 evolutionary algorithm coding method based on the binary tree crossover operator mutation operator distillation separation sequence optimization synthesis
下载PDF
Design and implementation of digital content metadata system
18
作者 Jinho Seo Taewon Seo +3 位作者 Junghoon Shin Sanggeun Song Cheng Dong Sangjun Lee 《Journal of Measurement Science and Instrumentation》 CAS 2013年第4期361-364,共4页
Today's multimedia services are far beyond just the voice and data services:they have been diversified tremendously after fueled by the advancement of network infrastructures as well as the sudden surge of multime... Today's multimedia services are far beyond just the voice and data services:they have been diversified tremendously after fueled by the advancement of network infrastructures as well as the sudden surge of multimedia data itself.Currently,researches on metadata insertion,management and transfer keep going very well in order to provide a variety of services to users.In this paper,we propose the design and implementation methods of digital contents metadata system for insertion,storage and retrieval of metadata.The performance evaluation shows that the proposed method performs better than the existing method. 展开更多
关键词 Internet protocol television (IPTV) video metadata binary extensible markup language (XML)Document code:AArticle ID:1674-8042(2013)04-0361-04
下载PDF
Finite Projective Geometries and Classification of the Weight Hierarchies of Codes(Ⅰ) 被引量:1
19
作者 WenDeCHEN TorleivKLφVE 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2004年第2期333-348,共16页
The weight hierarchy of a binary linear [n, k] code C is the sequence (d 1, d 2, . . . , d k ), where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and... The weight hierarchy of a binary linear [n, k] code C is the sequence (d 1, d 2, . . . , d k ), where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and the possible weight hierarchies in each class is determined by finite projective geometries. The possible weight hierarchies in class A, B, C, D are determined in Part (I). The possible weight hierarchies in class E, F, G, H, I are determined in Part (II). 展开更多
关键词 Weight hierarchy Support weight Finite projective geometries binary linear code Chain condition Difference sequence
原文传递
High throughput VLSI architecture for H.264/AVC context-based adaptive binary arithmetic coding(CABAC) decoding 被引量:1
20
作者 Kai HUANG De MA +2 位作者 Rong-jie YAN Hai-tong GE Xiao-lang YAN 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2013年第6期449-463,共15页
Context-based adaptive binary arithmetic coding(CABAC) is the major entropy-coding algorithm employed in H.264/AVC.In this paper,we present a new VLSI architecture design for an H.264/AVC CABAC decoder,which optimizes... Context-based adaptive binary arithmetic coding(CABAC) is the major entropy-coding algorithm employed in H.264/AVC.In this paper,we present a new VLSI architecture design for an H.264/AVC CABAC decoder,which optimizes both decode decision and decode bypass engines for high throughput,and improves context model allocation for efficient external memory access.Based on the fact that the most possible symbol(MPS) branch is much simpler than the least possible symbol(LPS) branch,a newly organized decode decision engine consisting of two serially concatenated MPS branches and one LPS branch is proposed to achieve better parallelism at lower timing path cost.A look-ahead context index(ctxIdx) calculation mechanism is designed to provide the context model for the second MPS branch.A head-zero detector is proposed to improve the performance of the decode bypass engine according to UEGk encoding features.In addition,to lower the frequency of memory access,we reorganize the context models in external memory and use three circular buffers to cache the context models,neighboring information,and bit stream,respectively.A pre-fetching mechanism with a prediction scheme is adopted to load the corresponding content to a circular buffer to hide external memory latency.Experimental results show that our design can operate at 250 MHz with a 20.71k gate count in SMIC18 silicon technology,and that it achieves an average data decoding rate of 1.5 bins/cycle. 展开更多
关键词 H.264/AVC Context-based adaptive binary arithmetic coding(CABAC) Decoder VLSI
原文传递
上一页 1 2 下一页 到第
使用帮助 返回顶部