检索结果-内蒙古大学图书馆

PSO with reverse edge for multi-objective software module clustering

学校读者我要写书评

暂无评论

International Journal of Performability Engineering 2018年第10期14卷 2423-2431页

作者： Sun, Jiaze Xu, Yang Wang, Shuyan School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an710121 China

The multi-objective software module clustering problem (MOSMCP) divides the complex software system into subsystems to obtain a perfect structure, which is based on the relations between modules to meet the conflicting software refactor objectives as much as possible. The modularization quality (MQ) and reverse edges number between clusters are considered as evaluation objectives, and a novel particle swarm optimization (PSO) with reverse edge, called REPSO, is proposed. First, the module dependency graph (MDG) in software system under clustering is constructed, and then the multi-objective particle swarm optimization (MOPSO) is improved to cluster the MDG. The exploring approach is used to update the particle locations. Four typical open source projects for module clustering are selected to verify the effectiveness of the REPSO. The laboratorial results prove that the REPSO algorithm is very effective and stable, and the diversity of the optimal solution is good. The REPSO algorithm provides an efficient engineering method for MOSMCP, which enhances the software structure and maintainability. © 2018 Totem Publisher, Inc. All rights reserved.

关键词： Modular construction

GL-RF： a reconciliation framework for label-free entity resolution

学校读者我要写书评

暂无评论

Frontiers of computer science 2018年第5期12卷 1035-1037页

作者： Yaoli XU Zhanhuai LI Qun CHEN Fengfeng FAN School of Computer Science and Engineering Northwestern Polytechnical University Xi'an 710072 China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical UniversityMinistry of Industry and Information Technology Xi'an 710129 China

1 Introduction Entity resolution （ER）, also referred to as record linkage and entity matching [1], is a long-standing challenge, existing in various data management systems, particularly data integration and cleaning systems. As so often happens, there exist multiple data sources which store duplicate real-world en- tity information in different descriptions, incurred by mis- spellings, typos, diverse name conventions, random usage of the abbreviation or full name, ongoing changes such as in DBpedia, and so forth. The purpose of ER is to determine whether two data records describe the same real-world entity.

关键词：

On the Connectivity of Highly Dynamic Wireless Sensor Networks in Smart Factory

学校读者我要写书评

暂无评论

On the Connectivity of Highly Dynamic Wireless Sensor Networ...

International Conference on Networking and Network Applications (NaNA)

作者： Cong Gao Zhongmin Wang Yanping Chen School of Computer Science and Technology Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Xi'an China

ISBN: (数字)9781728126296

ISBN: (纸本)9781728126302

With the development of smart manufacturing in Industry 4.0, large amount of heterogeneous data are generated from multiple sources. Various data processing techniques can be applied to these data for the purpose of extracting potential information about the status of the manufacturing network. Thus, data are valuable to the analysis and adjustment of the manufacturing processes. Due to the diversity of products, assembly lines and manufacturing processes are highly dynamic. In view of the flexible deployment of wireless sensor networks, they have been widely deployed to conduct data collection. However, due to the limited radio range of a wireless sensor node, the connectivity of a highly dynamic wireless sensor network is a key issue. In this paper, we analyzed the connectivity in a wireless sensor network and accorded three types of connectivity. Then, we developed two network connectivity models from the perspective of one dimension and two dimensions. The degrees of connectivity for both two nodes and the network are elaborated. Finally, the relation between the number of sink nodes and the average degree of connectivity of the network is analyzed based on experimental results.

关键词： Wireless networks Wireless sensor networks Euclidean distance Smart manufacturing Analytical models

On efficient and robust metrics for RANSAC hypotheses and 3D rigid registration

学校读者我要写书评

暂无评论

arxiv 2020年

作者： Yang, Jiaqi Huang, Zhiqiang Quan, Siwen Zhang, Qian Zhang, Yanning Cao, Zhiguo National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Northwestern Polytechnical University China School of Software Northwestern Polytechnical University Xi’an710129 China School of Electronic and Control Engineering Chang’an University Xi’an710064 China School of Resources and Environment Hubei University Wuhan430062 China National Key Laboratory of Science and Technology on Multi-spectral Information Processing School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

This paper focuses on developing efficient and robust evaluation metrics for RANSAC hypotheses to achieve accurate 3D rigid registration. Estimating six-degree-of-freedom (6-DoF) pose from feature correspondences remains a popular approach to 3D rigid registration, where random sample consensus (RANSAC) is a de-facto choice to this problem. However, existing metrics for RANSAC hypotheses are either time-consuming or sensitive to common nuisances, parameter variations, and different application scenarios, resulting in performance deterioration in overall registration accuracy and speed. We alleviate this problem by first analyzing the contributions of inliers and outliers, and then proposing several efficient and robust metrics with different designing motivations for RANSAC hypotheses. Comparative experiments on four standard datasets with different nuisances and application scenarios verify that the proposed metrics can significantly improve the registration performance and are more robust than several state-of-the-art competitors, making them good gifts to practical applications. This work also draws an interesting conclusion, i.e., not all inliers are equal while all outliers should be equal, which may shed new light on this research problem. Copyright © 2020, The Authors. All rights reserved.

关键词： Deterioration

SG-PBFT: A secure and highly efficient blockchain PBFT Consensus Algorithm for internet of vehicles

学校读者我要写书评

暂无评论

arxiv 2021年

作者： Xu, Guangquan Liu, Yihua xing, Jun Luo, Tao Gu, Yonghao Liu, Shaoying Zheng, xi Vasilakos, Athanasios V. The Big Data School Qingdao Huanghai University Qingdao266427 China College of Intelligence and Computing Tianjin University Tianjin300350 China The International Engineering Institute Tianjin University Tianjin300350 China The College of Intelligence and Computing Tianjin University Tianjin Tianjin300350 China The school of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China The Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China School of Informatics and Data Science Hiroshima University Japan The Department of Computing Macquarie University SydneyNSW2109 Australia The University of Technology Sydney Australia The Fuzhou University Fuzhou China Lulea University of Technology Lulea Sweden

The Internet of Vehicles (IoV) is an application of the Internet of things (IoT). It faces two main security problems: (1) the central server of the IoV may not be powerful enough to support the centralized authentication of the rapidly increasing connected vehicles, (2) the IoV itself may not be robust enough to single-node attacks. To solve these problems, this paper proposes SG-PBFT: a secure and highly efficient PBFT consensus algorithm for Internet of Vehicles, which is based on a distributed blockchain structure. The distributed structure can reduce the pressure on the central server and decrease the risk of single-node attacks. The SG-PBFT consensus algorithm improves the traditional PBFT consensus algorithm by using a score grouping mechanism to achieve a higher consensus efficiency. The experimental result shows that our method can greatly improve the consensus efficiency and prevent single-node attacks. Specifically, when the number of consensus nodes reaches 1000, the consensus time of our algorithm is only about 27% of what is required for the state-of-the-art consensus algorithm (PBFT). Our proposed SG-PBFT is versatile and can be used in other application scenarios which require high consensus efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

学校读者我要写书评

暂无评论

Ball k-means

arxiv 2020年

作者： xia, Shuyin Peng, Daowan Meng, Deyu Zhang, Changqing Wang, Guoyin Chen, Zizhong Wei, Wei Department of Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China National Engineering Laboratory for Algorithm and Analysis Technologiy on Big Data Xian Jiaotong University Xi'an710049 China College of Intelligence and Computing Tianjin University 300072 China Department of Computer Science and Engineering University of California Riverside 900 University Avenue RiversideCA92521 United States School of Computer Science and Engineering Xi'an University of Technology Xi'an710048 China

This paper presents a novel accelerated exact k-means algorithm called the Ball k-means algorithm, which uses a ball to describe a cluster, focusing on reducing the point-centroid distance computation. The Ball k-means can accurately find the neighbor clusters for each cluster resulting distance computations only between a point and its neighbor clusters centroids instead of all centroids. Moreover, each cluster can be divided into a stable area and an active area, and the later one can be further divided into annulus areas. The assigned cluster of the points in the stable area is not changed in the current iteration while the points in the annulus area will be adjusted within a few neighbor clusters in the current iteration. Also, there are no upper or lower bounds in the proposed Ball k-means. Furthermore, reducing centroid-centroid distance computation between iterations makes it efficient for large k clustering. The fast speed, no extra parameters and simple design of the Ball k-means make it an all-around replacement of the naive k-means algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： K-means clustering

Collaborative Three-Tier Architecture Non-contact Respiratory Rate Monitoring using Target Tracking and False Peaks Eliminating Algorithms

学校读者我要写书评

暂无评论

arxiv 2020年

作者： Mo, Haimiao Ding, Shuai Yang, Shanlin Vasilakos, Athanasios V. Zheng, xi The School of Management Hefei University of Technology Anhui Hefei23009 China The Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education China The National Engineering Laboratory of Big Data Distribution and Exchange Technologies China Grimstad Norway The College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China The School of Computing Macquarie University Sydney Australia

Monitoring the respiratory rate is crucial for helping us identify respiratory disorders. Devices for conventional respiratory monitoring are inconvenient and scarcely available. Recent research has demonstrated the ability of non-contact technologies, such as photoplethysmography and infrared thermography, to gather respiratory signals from the face and monitor breathing. However, the current non-contact respiratory monitoring techniques have poor accuracy because they are sensitive to environmental influences like lighting and motion artifacts. Furthermore, frequent contact between users and the cloud in real-world medical application settings might cause service request delays and potentially the loss of personal data. We proposed a non-contact respiratory rate monitoring system with a cooperative three-layer design to increase the precision of respiratory monitoring and decrease data transmission latency. To reduce data transmission and network latency, our three-tier architecture layer-by-layer decomposes the computing tasks of respiration monitoring. Moreover, we improved the accuracy of respiratory monitoring by designing a target tracking algorithm and an algorithm for eliminating false peaks to extract high-quality respiratory signals. By gathering the data and choosing several regions of interest on the face, we were able to extract the respiration signal and investigate how different regions affected the monitoring of respiration. The results of the experiment indicate that when the nasal region is used to extract the respiratory signal, it performs experimentally best. Our approach performs better than rival approaches while transferring fewer data. © 2020, CC BY.

关键词： Edge computing

On privacy protection of latent dirichlet allocation model training

学校读者我要写书评

暂无评论

arxiv 2019年

作者： Zhao, Fangyuan Ren, Xuebin Yang, Shusen Yang, xinyu School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Laboratory for Big Data Analytics Xi'an Jiaotong University China Ministry of Education Key Lab For Intelligent Networks and Network Security Xi'an Jiaotong University China

Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for discovery of hidden semantic architecture of text datasets, and plays a fundamental role in many machine learning applications. However, like many other machine learning algorithms, the process of training a LDA model may leak the sensitive information of the training datasets and bring significant privacy risks. To mitigate the privacy issues in LDA, we focus on studying privacy-preserving algorithms of LDA model training in this paper. In particular, we first develop a privacy monitoring algorithm to investigate the privacy guarantee obtained from the inherent randomness of the collapsed gibbs sampling (CGS) process in a typical LDA training algorithm on centralized curated datasets. Then, we further propose a locally private LDA training algorithm on crowdsourced data to provide local differential privacy for individual data contributors. The experimental results on real-world datasets demonstrate the effectiveness of our proposed algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Statistics

Improved Siamese Network for Video-Based Person Re-identification

学校读者我要写书评

暂无评论

Improved Siamese Network for Video-Based Person Re-identific...

International Conference on Networking and Network Applications (NaNA)

作者： Zhongmin Wang Lanlan Cai Na Duan Lin Fan Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Xi'an China School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an China

ISBN: (数字)9781728126296

ISBN: (纸本)9781728126302

In the field of human-computer interaction and visual surveillance, person re-identification is undoubtedly a key task. In this paper, we propose improved Siamese network for video-based person re-identification, which combines the verification model and the classification model, in a way that all the supervision information of the samples is fully utilized. The key frame extraction is able to select informative frames over the sequence, which removes occluded frames according to optical flow vector and measures the similarity of two adjacent frames' contents in terms of the block mutual information entropy. A convolutional network and long short-term memory joint training is used as a feature extractor to re-identify using the improved Siamese network framework. Experimental data on the iLIDS-VID and PRID-2011 datasets show that this approach is superior to existing video-based re-identification methods.

关键词： Feature extraction Optical flow Mutual information data mining Entropy Logic gates Cameras