http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Fast CU Size Decision Optimal Algorithm Based on Neighborhood Prediction for HEVC
Jianhua Wang,Haozhan Wang,Fujian Xu,Jun Liu,Lianglun Cheng 한국정보처리학회 2020 Journal of information processing systems Vol.16 No.4
High efficiency video coding (HEVC) employs quadtree coding tree unit (CTU) structure to improve its coding efficiency, but at the same time, it also requires a very high computational complexity due to its exhaustive search processes for an optimal coding unit (CU) partition. With the aim of solving the problem, a fast CU sizedecision optimal algorithm based on neighborhood prediction is presented for HEVC in this paper. The contribution of this paper lies in the fact that we successfully use the partition information of neighborhood CUs in different depth to quickly determine the optimal partition mode for the current CU by neighborhood prediction technology, which can save much computational complexity for HEVC with negligible RDrate(ratedistortion rate) performance loss. Specifically, in our scheme, we use the partition information of left, up, and leftup CUs to quickly predict the optimal partition mode for the current CU by neighborhood prediction technology, as a result, our proposed algorithm can effectively solve the problem above by reducing manyunnecessary prediction and partition operations for HEVC. The simulation results show that our proposed fast CU size decision algorithm based on neighborhood prediction in this paper can reduce about 19.0% coding time, and only increase 0.102% BDrate (Bjontegaard delta rate) compared with the standard reference softwareof HM16.1, thus improving the coding performance of HEVC.
An Efficient Complex Event Detection Algorithm based on NFA_HTS for Massive RFID Event Stream
Wang, Jianhua,Liu, Jun,Lan, Yubin,Cheng, Lianglun The Korean Institute of Electrical Engineers 2018 Journal of Electrical Engineering & Technology Vol.13 No.2
Massive event stream brings us great challenges in its volume, velocity, variety, value and veracity. Picking up some valuable information from it often faces with long detection time, high memory consumption and low detection efficiency. Aiming to solve the problems above, an efficient complex event detection method based on NFA_HTS (Nondeterministic Finite Automaton_Hash Table Structure) is proposed in this paper. The achievement of this paper lies that we successfully use NFA_HTS to realize the detection of complex event from massive RFID event stream. Specially, in our scheme, after using NFA to capture the related RFID primitive events, we use HTS to store and process the large matched results, as a result, our scheme can effectively solve the problems above existed in current methods by reducing lots of search, storage and computation operations on the basis of taking advantage of the quick classification and storage technologies of hash table structure. The simulation results show that our proposed NFA_HTS scheme in this paper outperforms some general processing methods in reducing detection time, lowering memory consumption and improving event throughput.
A Regular Expression Matching Algorithm Based on High-Efficient Finite Automaton
Wang, Jianhua,Cheng, Lianglun,Liu, Jun Korean Institute of Information Scientists and Eng 2014 Journal of Computing Science and Engineering Vol.8 No.2
Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.
Jianhua Wang,Baojian Ji,Hongbo Wang,Naifu Chen,Jun You 전력전자학회 2015 JOURNAL OF POWER ELECTRONICS Vol.15 No.3
An inherent zero-voltage and zero-current-switching phase-shifted full-bridge converter with reverse-blocking insulated-gate bipolar transistor (IGBT) or non-punch-through IGBT is proposed in this paper. This converter not only ensures that the switches in the lagging leg works at zero-current switching, but also minimizes circulating conduction loss without any additional auxiliary circuits. A 1.2 kW hardware prototype is designed, fabricated, and tested to verify the proposed topology. The control loop design procedures with small-signal models are also presented. A simple, low-cost, and robust democratic current-sharing circuit is also introduced and verified in this study. The proposed converter is a suitable alternative for compact, cost-effective applications with high-voltage input.
Secure and Efficient Conjunctive Keyword Search Scheme without Secure Channel
( Jianhua Wang ),( Zhiyuan Zhao ),( Lei Sun ),( Zhiqiang Zhu ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.5
Conjunctive keyword search encryption is an important technique for protecting sensitive data that is outsourced to cloud servers. However, the process of searching outsourced data may facilitate the leakage of sensitive data. Thus, an efficient data search approach with high security is critical. To solve this problem, an efficient conjunctive keyword search scheme based on ciphertext-policy attribute-based encryption is proposed for cloud storage environment. This paper proposes an efficient mechanism for removing the secure channel and resisting off-line keyword-guessing attacks. The storage overhead and the computational complexity are regardless of the number of keywords. This scheme is proved adaptively secure based on the decisional bilinear Diffie-Hellman assumption in the standard model. Finally, the results of theoretical analysis and experimental simulation show that the proposed scheme has advantages in security, storage overhead and efficiency, and it is more suitable for practical applications.
Modeling and Analysis of a Buck/Boost Bidirectional Converter with Developed PWM Switch Model
Wang Jianhua,Zhang Fanghua,Gong Chunying,Chen Ran 전력전자학회 2011 ICPE(ISPE)논문집 Vol.2011 No.5
The aim of this paper is to provide a general method for bidirectional converter simulation and evaluation. A developed PWM switch model is proposed for bidirectional power flow application. A typical buck/boost bidirectional converter is chosen as a test bench for evaluation. Small signal analysis results show mode transition between battery charging and discharging modes. It provides a fast simulation tool to investigate steady and transient response of converters. The accuracy of the modeling technique is verified by a detailed comparison of simulated results with the developed PWM switch model and component circuit.
An Efficient Complex Event Processing Algorithm based on NFA_HTS for Massive RFID Event Stream
Jianhua Wang,Jun Liu,Jun Liu,Lianglun Cheng 대한전기학회 2018 Journal of Electrical Engineering & Technology Vol.13 No.2
Massive event stream brings us great challenges in its volume, velocity, variety, value and veracity. Picking up some valuable information from it often faces with long detection time, high memory consumption and low detection efficiency. Aiming to solve the problems above, an efficient complex event detection method based on NFA_HTS (Nondeterministic Finite Automaton_Hash Table Structure) is proposed in this paper. The achievement of this paper lies that we successfully use NFA_HTS to realize the detection of complex event from massive RFID event stream. Specially, in our scheme, after using NFA to capture the related RFID primitive events, we use HTS to store and process the large matched results, as a result, our scheme can effectively solve the problems above existed in current methods by reducing lots of search, storage and computation operations on the basis of taking advantage of the quick classification and storage technologies of hash table structure. The simulation results show that our proposed NFA_HTS scheme in this paper outperforms some general processing methods in reducing detection time, lowering memory consumption and improving event throughput.