http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Induced Hesitant Linguistic Aggregation Operator and Its Application for Creating Fuzzy Ontology
( Mingming Kong ),( Fangling Ren ),( Doo-soon Park ),( Fei Hao ),( Zheng Pei ) 한국인터넷정보학회 2018 KSII Transactions on Internet and Information Syst Vol.12 No.10
An induced hesitant linguistic aggregation operator is investigated in the paper, in which, hesitant fuzzy linguistic evaluation values are associated with probabilistic information. To deal with these hesitant fuzzy linguistic information, an induced hesitant fuzzy linguistic probabilistic ordered weighted averaging (IHFLPOWA) operator is proposed, monotonicity, boundary and idempotency of IHFLPOWA are proved. Then andness, orness and the entropy of dispersion of IHFLPOWA are analyzed, which are used to characterize the weighting vector of the operator, these properties show that IHFLPOWA is extensions of the induced linguistic ordered weighted averaging operator and linguistic probabilistic aggregation operator. In this paper, IHFLPOWA is utilized to gather linguistic information and create fuzzy ontologies, and a movie fuzzy ontology as an illustrative case study is used to show the elaboration of the proposed method and comparison with the existing linguistic aggregation operators, it seems that the IHFLPOWA operator is an useful and alternative operator for dealing with hesitant fuzzy linguistic information with probabilistic information.
A Clustered Dwarf Structure to Speed up Queries on Data Cubes
Yubin Bao,Fangling Leng,Daling Wang,Ge Yu 한국정보과학회 2007 Journal of Computing Science and Engineering Vol.1 No.2
Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. We all know that the original intention of data cube is to speed up the query performance, so we propose two novel clustering methods for query optimization: the recursion clustering method which clusters the nodes in a recursive manner to speed up point queries and the hierarchical clustering method which clusters the nodes of the same dimension to speed up range queries. To facilitate the implementation, we design a partition strategy and a logical clustering mechanism. Experimental results show our methods can effectively improve the query performance on data cubes, and the recursion clustering method is suitable for both point queries and range queries.
Development of Cemented Carbide Industry of China
Shao Peng,Fangling Zou,Yonggui Zhou,Huan Wang 한국분말야금학회 2006 한국분말야금학회 학술대회논문집 Vol.2006 No.1
Through the review of developing course of China cemented carbide industry, the writer of this paper at the first time generalizes it into five stages. The writer analyses China cemented carbide industry present status in aspects of produce technology, product structure, operation and management etc. Mean while by analysis of existed shortages in cemented carbide industry, the write considers that it also has three advantages in resource and scale, industry foundation and categories, market and price, and brought out some suggestion and imagination for the future develpment of China cemented carbide industry.
A Clustered Dwarf Structure to Speed up Queries on Data Cubes
Bao, Yubin,Leng, Fangling,Wang, Daling,Yu, Ge Korean Institute of Information Scientists and Eng 2007 Journal of Computing Science and Engineering Vol.1 No.2
Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. We all know that the original intention of data cube is to speed up the query performance, so we propose two novel clustering methods for query optimization: the recursion clustering method which clusters the nodes in a recursive manner to speed up point queries and the hierarchical clustering method which clusters the nodes of the same dimension to speed up range queries. To facilitate the implementation, we design a partition strategy and a logical clustering mechanism. Experimental results show our methods can effectively improve the query performance on data cubes, and the recursion clustering method is suitable for both point queries and range queries.
Numerical investigation of heat transfer characteristics for Subsea Xmas tree assembly
Biao Hu,Hongwu Zhu,Kuang Ding,Fangling Xu,Youjiang Zhang 대한기계학회 2015 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.29 No.11
This study focuses on the heat transfer characteristic of a horizontal subsea Xmas tree assembly at a high spatial resolution. Computationalfluid dynamics (steady Reynolds-averaged Navier-Stokes) in combination with Low Reynolds number modelling (LRNM) isadopted for heat transfer analysis, which has been validated against a full scale underwater gate valve heat transfer experiment with goodagreements. The characteristics of cold sea water flowing through the subsea tree, and of convection heat transfer between the subsea treeand ambient cold water are obtained. The typical “hot spots,” which have high Convection heat transfer coefficient (CHTC) and creategreat large amounts of heat loss, are numerically determined. Under the designed water depth, the effects of installation orientation, seawater velocity, and inner oil temperature on convection heat transfer are investigated as well. Such work is significant for thermal designof the subsea tree to increase structural reliability and flow assurance level.