http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : ( Zhongsheng Cao ) (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
G3M: A Generalized Multimedia Data Model Based on MPEG-7
Qiong Zuo,Zhongsheng Cao 보안공학연구지원센터 2008 International Journal of Software Engineering and Vol.2 No.4
In this paper, a generalized multimedia database data model based on MPEG-7 named G3M is proposed and formally defined. Different from those XML Database Management System (DBMS) solutions for MPEG-7 storage and retrieval, G3M analyses the MPEG-7 Multimedia Description Schemes (MDS) throughout to construct user-preferred database schemas, and the prototype system is built on extensible Object-Relational DBMSs. With the strong expressiveness of MPEG-7, G3M represents various aspects of multimedia data well. Domain knowledge for special application demand can be defined and used as references in G3M.
-
EFTG: Efficient and Flexible Top-K Geo-textual Publish/Subscribe
( Hong Zhu ),( Hongbo Li ),( Zongmin Cui ),( Zhongsheng Cao ),( Meiyi Xie ) 한국인터넷정보학회 2018 KSII Transactions on Internet and Information Syst Vol.12 No.12
With the popularity of mobile networks and smartphones, geo-textual publish/subscribe messaging has attracted wide attention. Different from the traditional publish/subscribe format, geo-textual data is published and subscribed in the form of dynamic data flow in the mobile network. The difference creates more requirements for efficiency and flexibility. However, most of the existing Top-k geo-textual publish/subscribe schemes have the following deficiencies: (1) All publications have to be scored for each subscription, which is not efficient enough. (2) A user should take time to set a threshold for each subscription, which is not flexible enough. Therefore, we propose an efficient and flexible Top-k geo-textual publish/subscribe scheme. First, our scheme groups publish and subscribe based on text classification. Thus, only a few parts of related publications should be scored for each subscription, which significantly enhances efficiency. Second, our scheme proposes an adaptive publish/subscribe matching algorithm. The algorithm does not require the user to set a threshold. It can adaptively return Top-k results to the user for each subscription, which significantly enhances flexibility. Finally, theoretical analysis and experimental evaluation verify the efficiency and effectiveness of our scheme.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
