http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Shi Jinglin (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Haochen Shi,Huiqing Wen,Jinglin Li 전력전자학회 2019 ICPE(ISPE)논문집 Vol.2019 No.5
The open circuit fault on switches serious threat safe operation of DAB converter. In this paper, the fault phenomena of different switches during various operation condition under triple phase shift control is presented. Based on those analysis, the advanced fault diagnose which uses midpoint voltage as diagnosis criteria. It can ensure fast detect and accurate locate failure switch. After the failure switch is located, fault-tolerant is presented to maintain power transmission ability of DAB converter and ensure safe operation. Experimental result of proposed open circuit fault performance, fault diagnose method and fault-tolerant method is validated with experimental result.
-
A Multicast Search Scheme Based on Bipartite Graph Matching Model
Yuan Yao,Zhang Dalin,Wang Qing,Shi Jinglin 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.11
This paper proposes an efficient multicast search scheme based on bipartite graph matching model, aiming at one of the most important problems in the multicast service, how can the wireless network track and locate the mobile uses in the idle state, under the tight bandwidth and delay constraints,. By quantifying the location uncertainty of mobile users with Shannon's entropy, the scheme adopts the LZ78 compression algorithm to design location update scheme and predict the location probability, in order to reduce the cost of location update. The multicast search system need to guarantee the maximum total probability that each user resides at the assigned paging area, for the purpose of an optimal performance on both expected paging delay and paging cost. Therefore, the bigraph-based multicast paging scheme (BMPS) firstly builds the bipartite graph model of multicast search problem, through converting the location probability into weight of the edge. BMPS decides the optimal allocation between the mobile users and location areas, which is mainly achieved by the maximum weight perfect matching in bipartite graph, while modifying the weights dynamically. Simulation results show that BMPS yields a low search delay as well as a low search cost, and reduces the impact of user collision.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
