http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Xiaobin Cao (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
ER-Fuzz:Conditional Code Removed Fuzzing
( Xiaobin Song ),( Zehui Wu ),( Yan Cao ),( Qiang Wei ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.7
Coverage-guided fuzzing is an efficient solution that has been widely used in software testing. By guiding fuzzers through the coverage information, seeds that generate new paths will be retained to continually increase the coverage. However, we observed that most samples follow the same few high-frequency paths. The seeds that exercise a high-frequency path are saved for the subsequent mutation process until the user terminates the test process, which directly affects the efficiency with which the low-frequency paths are tested. In this paper, we propose a fuzzing solution, ER-Fuzz, that truncates the recording of a high-frequency path to influence coverage. It utilizes a deep learning-based classifier to locate the high and low-frequency path transfer points; then, it instruments at the transfer position to promote the probability low-frequency transfer paths while eliminating subsequent variations of the high-frequency path seeds. We implemented a prototype of ER-Fuzz based on the popular fuzzer AFL and evaluated it on several applications. The experimental results show that ER-Fuzz improves the coverage of the original AFL method to different degrees. In terms of the number of crash discoveries, in the best case, ER-Fuzz found 115% more unique crashes than did AFL. In total, seven new bugs were found and new CVEs were assigned.
-
Xuan Xie,Xijun Hua,Jianhua Li,Xiaobin Cao,Zhixiang Tian,Rui Peng,Bifeng Yin,Peiyun Zhang 대한기계학회 2021 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.35 No.5
To enhance the friction and wear resistance of GCr15/PTFE sliding contact surfaces, the synergistic lubrication effect of micro-textures and solid lubricants were studied in this paper. Micro-textures were processed on GCr15 samples by Nd:YAG laser, which were filled with MoS 2 . Tribological performance tests were carried out on a Rtec-MFT 5000 tester. Tribological properties were optimal with the textures density of 20 % and depth of 9 μm. A continuous composite solid lubricating film was formed by PTFE and MoS 2 . As load increases, friction coefficient of the sample shows a rapid decline and then stabilizes. With the increase of reciprocating frequency, friction curve of the sample shows a trend of slight fluctuation. When frequency is 2.7 Hz, friction coefficient is the lowest. Tribological properties of PTFE/GCr15 contact surfaces could be significantly optimized by micro-textures and MoS 2 , which performs favorable prospect of engineering application such as guide rails, bearings, machinery seal, etc.
-
An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing
Xiao, Bin,Cao, Jiannong,Shao, Zili,Sha, Edwin H.M. The Korea Institute of Information and Commucation 2007 Journal of communications and networks Vol.9 No.4
Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
