http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Fuzzy Cube Granule Structure for Image Segmentation
Hongbing Liu,Chunhua Liu,Chang-an Wu,Jun Huang 보안공학연구지원센터 2015 International Journal of Multimedia and Ubiquitous Vol.10 No.6
Fuzzy Cube Granule Structure (FCGS) for image segmentation is proposed in the paper. Firstly, the atomic cube granule is represented as the vector including the YCbCr values of pixel of color image and radii 0. Secondly, the join operation between two cube granules is designed to obtain the larger cube granule. Thirdly, the FCGS is formed by the fuzzy inclusion measure defined by join operation and the user-defined granularity threshold . Global Consistency Error (GCE), Variation of Information (VI), Rand Index (RI) are used to evaluate the segmentations. Images selected from BSD300 are used to verify the feasibility of FCGS.
A Framework of Granular Computing Clustering Algorithms
Hongbing Liu,Chunhua Liu,Chang-an Wu 보안공학연구지원센터 2015 International Journal of Hybrid Information Techno Vol.8 No.12
A framework of granular computing clustering algorithms is proposed in the paper. Firstly, granules are represented as the normal forms, such the diamond granule in 2-domensional space and hyperdiamond granule in N-dimensional space, sphere granule in 2-dimensional space and hypersphere granule in N-dimensional space. Secondly, operations between two granules are designed to realize the transformation between two spaces with different granularities. Thirdly, the threshold of granularity is used to control the join process between two granules. The performance of granular computing algorithms is evaluated by the experimental results on the data sets selected from machine learning repository.
Hongbing Chen,Bo Song,Ning Guo,Tingting Liu,Tao Zhou,Jiejun He 대한금속·재료학회 2019 METALS AND MATERIALS International Vol.25 No.1
The dynamic recrystallization mechanism and microstructure evolution in an extruded AZ31 rod during hot torsion deformationat 150 °C were investigated. It indicated that several dynamic recrystallization mechanisms were initiated during hottorsion deformation, including discontinuous DRX (DDRX), continuous DRX (CDRX) and twinning induced DRX (TDRX). With increasing strain, CDRX became the dominant DRX mechanism and contributed to a remarkable refinement of grains. A gradient distribution of dynamic recrystallization grains on the cross section of samples generated due to the gradientshear strain in twisted samples. Hot torsion can also arouse the c-axis of grains to rotate towards the extrusion direction. From low strain to high strain, the recrystallized grains exhibited a similar texture development with the deformed grains. The relevant mechanisms were revealed.
Degrees of Freedom of Multi-Cell MIMO Interference Broadcast Channels With Distributed Base Stations
( Hongbing Huang ),( Junyi Liu ),( Yi Zhang ),( Qing Cai ),( Bowei Zhang ),( Fengwen Jiang ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.2
In this paper, we investigate the degrees of freedom (DoF) of a multi-cell multi-user multiple-input multiple-output (MIMO) interference broadcast channel (IBC) with non-cooperation distributed base stations (BS), where each BS serves users of its corresponding cell. When all BSs simultaneously transmit their own signals over the same frequency band in the MIMO IBC, the edge users in each cell will suffer the inter-cell interference (ICI) and inter-user interference (IUI) signals. In order to eliminate the ICI and IUI signals, a distributed space time interference alignment (DSTIA) approach is proposed where each BS has only limited access to distributed moderately-delay channel state information at the transmitter (CSIT). It is shown that the DSTIA scheme can obtain the appreciate DoF gains. In addition, the DoF upper bound is asymptotically achievable as the number of antenna at each BS increases. It is shown that the DSTIA method can get DoF gains over other interference alignment schemes with delayed CSIT in literature. Moreover, the DSTIA method can attain higher DoFs than the IA schemes with global CSIT for certain antenna configurations.
Efficient and Secure Certificateless Proxy Re-Encryption
( Ya Liu ),( Hongbing Wang ),( Chunlu Wang ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.4
In this paper, we present an IND-CCA2 secure certificateless proxy re-encryption scheme in the random oracle model. A certificateless public key cryptography simplifies the certificate management in a traditional public key infrastructure and the built-in key escrow feature in an identity-based public key cryptography. Our scheme shares the merits of certificateless public key encryption cryptosystems and proxy re-encryption cryptosystems. Our certificateless proxy re-encryption scheme has several practical and useful properties - namely, multi-use, unidirectionality, non-interactivity, non-transitivity and so on. The security of our scheme bases on the standard bilinear Diffie-Hellman and the decisional Bilinear Diffie-Hellman assumptions.
Joint wireless and computational resource allocation for ultra-dense mobile-edge computing networks
( Junyi Liu ),( Hongbing Huang ),( Yijun Zhong ),( Jiale He ),( Tiancong Huang ),( Qian Xiao ),( Weiheng Jiang ) 한국인터넷정보학회 2020 KSII Transactions on Internet and Information Syst Vol.14 No.7
In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.