C. J. F. Solano, A. Costales, E. Francisco, A. Martín Pendás, Miguel A. Blanco¹, K.-C. Lau, H. He, Ravindra Pandey²

CMES-Computer Modeling in Engineering & Sciences, Vol.24, No.2&3, pp. 143-156, 2008, DOI:10.3970/cmes.2008.024.143

Abstract The buckling of hexagonal layers in bulk and nanostructures of AlN is analyzed in the framework of atomistic and first principles techniques. At ambient conditions, the wurtzite structure (B4) of AlN consists of buckled hexagons. On the other hand, a non-buckled B_k structure is found to be metastable at zero pressure, being favored at higher pressures. It is suggested that the energy ordering of B4 and B_k may change in finite systems; an assertion tested in this study by considering finite slabs, nanobelts, and nanorings, and comparing the results with the previous studies on small clusters, and periodic nanostructures. We… More >

A. Aimi¹, M. Diligenti¹, F. Lunardini¹, A. Salvadori²

CMES-Computer Modeling in Engineering & Sciences, Vol.4, No.1, pp. 31-50, 2003, DOI:10.3970/cmes.2003.004.031

Abstract This paper is devoted to the study of a new application of the Panel Clustering Method [Hackbusch and Sauter (1993); Hackbusch and Nowak (1989)]. By considering a classical 3D Neumann screen problem in its boundary integral formulation discretized with the Galerkin BEM, which requires the evaluation of double integrals with hypersingular kernel, we recall and use some recent results of analytical evaluation of the inner hypersingular integrals. Then we apply the Panel Clustering Method (PCM) for the evaluation of the outer integral. For this approach error estimate is shown. Numerical examples and comparisons with classical PCM technique are presented. More >

E. Kuramoto, K. Ohsawa, T. Tsutsumi¹

CMES-Computer Modeling in Engineering & Sciences, Vol.3, No.2, pp. 193-200, 2002, DOI:10.3970/cmes.2002.003.193

Abstract In order to investigate the interaction of point defects with a dislocation, an interstitial cluster or a SFT (stacking fault tetrahedron), computer simulation has been carried out in model Fe and Ni crystals. The capture zone (the region where the interaction energy is larger than kT) was determined for various interactions. Calculated capture zone for T =500°C for SIAs (crowdion and dumbbell) around a straight edge dislocation is larger than that for a vacancy in both Fe and Ni. Capture zones for Ni are larger than those for Fe, suggesting that Ni (fcc) has a larger dislocation bias factor than… More >

Kai Wang¹, Guojian Li¹, Qiang Wang^1,2, Huimin Wang¹, Jiaojiao Du¹, Jicheng He¹

CMC-Computers, Materials & Continua, Vol.38, No.2, pp. 79-89, 2013, DOI:10.3970/cmc.2013.038.079

Abstract Study on the behaviors of the melting and coalescence of clusters in atomic scale may create new structure at nanoscale, which is a very important research field. The structural evolutions of clusters Cu₃₂₁, Co₃₂₁, and Ni₃₂₁ during their melting and coalescence processes were studied using molecular dynamics simulation with a general embedded atom method in this paper. It was found that the geometries of Cu₃₂₁ and Co₃₂₁ transformed to icosahedron from fcc near their melting points, which leads to the increase of their melting points. Concerning the coalescence, it was found that Cu atoms easily formed a coating layer on… More >

Chuanli Wang^1,2, En Zhu¹, Xinwang Liu¹, Jiaohua Qin², Jianping Yin^3,*, Kaikai Zhao⁴

CMC-Computers, Materials & Continua, Vol.61, No.1, pp. 409-421, 2019, DOI:10.32604/cmc.2019.06206

Abstract Multiple kernel clustering based on local kernel alignment has achieved outstanding clustering performance by applying local kernel alignment on each sample. However, we observe that most of existing works usually assume that each local kernel alignment has the equal contribution to clustering performance, while local kernel alignment on different sample actually has different contribution to clustering performance. Therefore this assumption could have a negative effective on clustering performance. To solve this issue, we design a multiple kernel clustering algorithm based on self-weighted local kernel alignment, which can learn a proper weight to clustering performance for each local kernel alignment. Specifically,… More >

Zhong Huang¹, Jian Su², Guangjun Wen¹, Wenxian Zheng³, Chu Chu¹, Yijun Zhang^4,*, Yibo Zhang⁵

CMC-Computers, Materials & Continua, Vol.61, No.1, pp. 399-408, 2019, DOI:10.32604/cmc.2019.05876

Abstract A priori knowledge of the number of tags is crucial for anti-collision protocols in slotted UHF RFID systems. The number of tags is used to decide optimal frame length in dynamic frame slotted ALOHA (DFSA) and to adjust access probability in random access protocols. Conventional researches estimate the number of tags in MAC layer based on statistics of empty slots, collided slots and successful slots. Usually, a collision detection algorithm is employed to determine types of time slots. Only three types are distinguished because of lack of ability to detect the number of tags in single time slot. In this… More >

Ling Tan^1,*, Chong Li², Jingming Xia², Jun Cao³

CMC-Computers, Materials & Continua, Vol.61, No.1, pp. 275-288, 2019, DOI:10.32604/cmc.2019.03735

Abstract Due to the widespread use of the Internet, customer information is vulnerable to computer systems attack, which brings urgent need for the intrusion detection technology. Recently, network intrusion detection has been one of the most important technologies in network security detection. The accuracy of network intrusion detection has reached higher accuracy so far. However, these methods have very low efficiency in network intrusion detection, even the most popular SOM neural network method. In this paper, an efficient and fast network intrusion detection method was proposed. Firstly, the fundamental of the two different methods are introduced respectively. Then, the self-organizing feature… More >

Zhenqiu Xiao^1,*, Bin Yang², Desy Tjahjadi³

CMC-Computers, Materials & Continua, Vol.60, No.3, pp. 1141-1154, 2019, DOI:10.32604/cmc.2019.05638

Abstract Crowd counting is a challenging task in crowded scenes due to heavy occlusions, appearance variations and perspective distortions. Current crowd counting methods typically operate on an image patch level with overlaps, then sum over the patches to get the final count. In this paper we describe a real-time pedestrian counting framework based on a two-stage human detection algorithm. Existing works with overhead cameras is mainly based on visual tracking, and their robustness is rather limited. On the other hand, some works, which focus on improving the performances, are too complicated to be realistic. By adopting a line sampling process, a… More >

Ruikang Xing^1,*, Chenghai Li¹

CMC-Computers, Materials & Continua, Vol.60, No.2, pp. 767-780, 2019, DOI:10.32604/cmc.2019.04500

Abstract In clustering analysis, the key to deciding clustering quality is to determine the optimal number of clusters. At present, most clustering algorithms need to give the number of clusters in advance for clustering analysis of the samples. How to gain the correct optimal number of clusters has been an important topic of clustering validation study. By studying and analyzing the FCM algorithm in this study, an accurate and efficient algorithm used to confirm the optimal number of clusters is proposed for the defects of traditional FCM algorithm. For time and clustering accuracy problems of FCM algorithm and relevant algorithms automatically… More >

Gang Xu^1,2,*, Ke Xiao^1,*, Zongpeng Li³, Xin-Xin Niu^2,4, Michael Ryan⁵

CMC-Computers, Materials & Continua, Vol.58, No.3, pp. 809-827, 2019, DOI:10.32604/cmc.2019.04400

Abstract In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one bit secret information. Given our… More >