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

Reverse-Nearest-Neighbor-Based Clustering by Fast Search and Find of Density Peaks

Chinese Journal of Electronics 2023年第6期32卷 1341-1354页

作者： ZHANG Chunhao XIE Bin ZHANG Yiran College of Computer and Cyber Security Hebei Normal University Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics and Data Security Hebei Normal University Hebei Provincial Key Laboratory of Network and Information Security Hebei Normal University

Clustering by fast search and find of density peaks(CFSFDP) has the advantages of a novel idea, easy implementation, and efficient clustering. It has been widely recognized in various fields since it was proposed in Science in 2014. The CFSFDP algorithm also has certain limitations, such as non-unified sample density metrics defined by cutoff distance, the domino effect for the assignment of remaining samples triggered by unstable assignment strategy, and the phenomenon of picking wrong density peaks as cluster centers. We propose reverse-nearest-neighbor-based clustering by fast search and find of density peaks(RNN-CFSFDP) to avoid these shortcomings. We redesign and unify the sample density metric by introducing reverse nearest neighbor. The newly defined local density metric and the K-nearest neighbors of each sample are combined to make the assignment process more robust and alleviate the domino effect. A cluster fusion algorithm is proposed, which further alleviates the domino effect and effectively avoids the phenomenon of picking wrong density peaks as cluster centers. Experimental results on publicly available synthetic data sets and real-world data sets show that in most cases, the proposed algorithm is superior to or at least equivalent to the comparative methods in clustering performance. The proposed algorithm works better on manifold data sets and uneven density data sets.

关键词： Measurement Manifolds Shape Clustering algorithms Synthetic data

来源：评论

学校读者我要写书评

暂无评论

Single Cell Clustering Based on Multi-view Generation 2nd

Single Cell Clustering Based on Multi-view Generation

引用

2nd International Conference on Applied Intelligence, ICAI 2024

作者： Wang, Yueyue Wu, Zheyu Zhang, Qinhu Ningbo Institute of Digital Twin Eastern Institute of Technology No. 568 Tongxin Road Zhuangshi Street Zhejiang Ningbo315201 China Big Data and Intelligent Computing Research Center Guangxi Academy of Science Nanning530007 China Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology School of Medicine Shanghai East Hospital Tongji University Shanghai200123 China Shanghai Jiao Tong University Shanghai200240 China

ISBN: (纸本)9789819619061

The rapid development of single-cell RNA sequencing technology has opened new horizons for biomedical research. As the initial step in single-cell data analysis, clustering forms the foundation for downstream analyses. However, due to the inherent high dimensionality, noise, and sparsity of single-cell data, most current clustering methods exhibit poor stability. To address these limitations, we propose a novel clustering method based on multi-view generation (scCMVG) coupled with noise perturbation. Specifically, scCMVG introduces disturbances at both gene level and cellular level to disrupt the original associations between genes and cells. It then employs autoencoder and graph convolutional network to reconstruct the disturbed data and generate new feature representations from it. Through this strategy, the model's noise resistance can be enhanced, increasing the ability to capture diverse cellular states and gene expression patterns. Experimental results demonstrate scCMVG superior clustering performance across multiple single-cell RNA sequencing datasets, outperforming existing methods. Consequently, scCMVG emerges as a valuable tool for clustering applications. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Empirical topological investigation of practical supply chains based on complex networks

引用

Chinese Physics B 2017年第11期26卷 144-150页

作者：廖好沈婧吴兴桐陈博奎周明洋 National Engineering Laboratory for Big Data Computing Systems Guangdong Province Key Laboratory of Popular High Performance ComputersCollege of Computer Science and Software Engineering Shenzhen University Department of Computer Science School of Computing National University of Singapore

The industrial supply chain networks basically capture the circulation of social resource, dominating the stability and efficiency of the industrial system. In this paper, we provide an empirical study of the topology of smartphone supply chain network. The supply chain network is constructed using open online data. Our experimental results show that the smartphone supply chain network has small-world feature with scale-free degree distribution, in which a few high degree nodes play a key role in the function and can effectively reduce the communication cost. We also detect the community structure to find the basic functional unit. It shows that information communication between nodes is crucial to improve the resource utilization. We should pay attention to the global resource configuration for such electronic production management.

关键词： China supply chain networks complex networks data science network science

来源：评论

学校读者我要写书评

暂无评论

SED-MVS: Segmentation-Driven and Edge-Aligned Deformation Multi-View Stereo with Depth Restoration and Occlusion Constraint

arXiv

引用

arXiv 2025年

作者： Yuan, Zhenlong Yang, Zhidong Cai, Yujun Wu, Kuangxin Liu, Mufan Zhang, Dapeng Jiang, Hao Li, Zhaoxin Wang, Zhaoqi The Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Australia The Information Technology Department Hunan Police Academy Changsha410100 China Cooperative MediaNet Innovation Center Shanghai Jiao Tong University Shanghai200240 China DSLAB School of Information Science & Engineering Lanzhou University 730000 China Agricultural Information Institute Chinese Academy of Agricultural Sciences Key Laboratory of Agricultural Big Data Ministry of Agriculture and Rural Affairs 100081 China

Recently, patch-deformation methods have exhibited significant effectiveness in multi-view stereo owing to the deformable and expandable patches in reconstructing textureless areas. However, such methods primarily emphasize broadening the receptive field in textureless areas, while neglecting deformation instability caused by easily overlooked edge-skipping, potentially leading to matching distortions. To address this, we propose SED-MVS, which adopts panoptic segmentation and multi-trajectory diffusion strategy for segmentation-driven and edge-aligned patch deformation. Specifically, to prevent unanticipated edge-skipping, we first employ SAM2 for panoptic segmentation as depth-edge guidance to guide patch deformation, followed by multi-trajectory diffusion strategy to ensure patches are comprehensively aligned with depth edges. Moreover, to avoid potential inaccuracy of random initialization, we combine both sparse points from LoFTR and monocular depth map from DepthAnything V2 to restore reliable and realistic depth map for initialization and supervised guidance. Finally, we integrate segmentation image with monocular depth map to exploit inter-instance occlusion relationship, then further regard them as occlusion map to implement two distinct edge constraint, thereby facilitating occlusion-aware patch deformation. Extensive results on ETH3D, Tanks & Temples, BlendedMVS and Strecha datasets validate the state-of-the-art performance and robust generalization capability of our proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Research on Video Recommendation Algorithm Based on Knowledge Reasoning of Knowledge Graph

Research on Video Recommendation Algorithm Based on Knowledg...

引用

Asia Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint Conference on Web and big data, APWeb-WAIM 2018

作者： Xu, Zhihong Zhao, Xing Dong, Yongfeng Yan, Wenjie Yu, Ziqi School of Artificial Intelligence Hebei University of Technology Tianjin300401 China Hebei Province Key Laboratory of Big Data Computing Tianjin300401 China

ISBN: (纸本)9783030012977

Since collaborative filtering algorithm cannot make full use of video attribute information, mining implicit information of video, this paper proposes a video recommendation algorithm based on knowledge reasoning of knowledge graph. The algorithm uses a knowledge graph with powerful semantic processing capabilities and open interconnection capabilities. The ontology model is used to formalize the implicit semantics in the data. By using the knowledge inference method of the knowledge graph, the existing triplet information is used to establish new relationships between entities and assign corresponding weights to the paths. All the semantic information is embedded in the low-dimensional vector space, and the potential semantic similarity of the video is calculated by combining the path weights. And then, integrate semantic similarity into collaborative filtering for recommendation. Experiments show that this algorithm can make up for the deficiency that collaborative filtering algorithms cannot fully utilize the hidden information of video, and enhance the effectiveness of recommendation at the semantic level, what is more, the recommendation results are interpretable. To a certain extent, it can solve the problem of data sparseness. © 2018, Springer Nature Switzerland AG.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Computer-Automated design of self-aligned multi-ball pitch artifact with high precision

引用

Measurement: Journal of the International Measurement Confederation 2025年 253卷

作者： Zhu, Hongjun Zhou, Sen Xu, Jian Liu, Binghong Zhang, Xiaoyan Liu, Xin Chen, Kuo Zhang, Xuewang Qian, Ying School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Academy of Metrology and Quality Inspection Chongqing401121 China College of Mechanical and Vehicle Engineering Chongqing University Chongqing400044 China School of Engineering Computer and Mathematical Sciences Auckland University of Technology Auckland1010 New Zealand Chongqing Engineering Research Center of Software Quality Assurance Testing and Assessment Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

This study presents a computational methodology for developing a multi-ball system that automatically aligns during assembly processes. The contributions of this work are threefold: Firstly, a comprehensive error analysis of the multi-ball system is conducted. It is found that temperature- and pressure-induced deformations cannot be ignored when micrometer-level precision is required. Secondly, a novel process flow for designing the multi-ball pitch artifact is introduced, which enables optimization-based decision-making. Lastly, an error compensation method, including thermal compensation and elastic deformation compensation, is presented to ensure that the accuracy of pitch artifacts mainly depends on the manufacturing accuracy. © 2025 Elsevier Ltd

关键词： Error compensation

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning-Based URLLC-Aware Task Offloading in Collaborative Vehicular Networks

引用

China Communications 2021年第7期18卷 134-146页

作者： Chao Pan Zhao Wang Zhenyu Zhou Xincheng Ren Hebei Key Laboratory of Power Internet of Things Technology North China Electric Power UniversityBeijing102206Baoding071003HebeiChina Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data Yanan UniversityYanan 716000China

Collaborative vehicular networks is a key enabler to meet the stringent ultra-reliable and lowlatency communications(URLLC)requirements.A user vehicle(UV)dynamically optimizes task offloading by exploiting its collaborations with edge servers and vehicular fog servers(VFSs).However,the optimization of task offloading in highly dynamic collaborative vehicular networks faces several challenges such as URLLC guaranteeing,incomplete information,and dimensionality *** this paper,we first characterize URLLC in terms of queuing delay bound violation and high-order statistics of excess ***,a Deep Reinforcement lEarning-based URLLCAware task offloading algorithM named DREAM is proposed to maximize the throughput of the UVs while satisfying the URLLC constraints in a besteffort *** with existing task offloading algorithms,DREAM achieves superior performance in throughput,queuing delay,and URLLC.

关键词： collaborative vehicular networks task of-floading URLLC awareness deep Q-learning

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

Parallel implementation of w-projection wide-field imaging

引用

Science Bulletin 2019年第9期64卷 586-594页

作者： Baoqiang Lao Tao An Ang Yu Wenhui Zhang Junyi Wang Quan Guo Shaoguang Guo Xiaocong Wu Shanghai Astronomical Observatory Key Laboratory of Radio AstronomyChinese Academy of Sciences Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology

w-Projection is a wide-field imaging technique that is widely used in radio synthesis arrays. Processing the wide-field big data generated by the future Square Kilometre Array(SKA) will require significant updates to current methods to significantly reduce the time consumed on data processing. data loading and gridding are found to be two major time-consuming tasks in w-projection. In this paper, we investigate two parallel methods of accelerating w-projection processing on multiple nodes: the hybrid Message Passing Interface(MPI) and Open Multi-Processing(OpenMP) method based on multicore Central Processing Units(CPUs) and the hybrid MPI and Compute Unified Device Architecture(CUDA)method based on Graphics Processing Units(GPUs). Both methods are successfully employed and operated in various computational environments, confirming their robustness. The experimental results show that the total runtime of both MPI + OpenMP and MPI + CUDA methods is significantly shorter than that of single-thread processing. MPI + CUDA generally shows faster performance when running on multiple nodes than MPI + OpenMP, especially on large numbers of nodes. The single-precision GPU-based processing yields faster computation than the double-precision processing; while the single-and doubleprecision CPU-based processing shows consistent computational performance. The gridding time remarkably increases when the support size of the convolution kernel is larger than 8 and the image size is larger than 2,048 pixels. The present research offers useful guidance for developing SKA imaging pipelines.

关键词： Radio synthesis arrays Square kilometre array Wide field imaging Parallelization w-Projection

来源：评论

学校读者我要写书评

暂无评论

A unified multi-granulation hierarchy structure: Construction, Selection, Fusion and Reduction

引用

Information Fusion 2025年 123卷

作者： Zhang, Xiaoxia Zhang, Jiangtao Wang, Guoyin Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China

Granular computing is a new method that can simulate human brain thinking to solve complex problems, and it has gradually become an important theory for addressing uncertainty issues. The core of granular computing lies in its use of hierarchical, classification, or clustering methods to process uncertain information. However, the broad applicability of this approach has led to its blurred theoretical boundaries, with varying definitions of "granules" and computational paradigms across studies based on differing requirements. Currently, the absence of a unified granular computing model prevents the consistent handling of uncertain information under a standardized scale and paradigm. This paper attempts to fill this gap from a unified perspective by providing a multi-granulation hierarchical structure within a unified framework. Based on this, different studies can adaptively select appropriate granular layers according to their specific time constraints or precision requirements. Here, we adopt quantum genetic algorithms (QG) for optimal granular layer selection. After the granular layers are selected, a fusion algorithm is developed to combine them into a super layer, preserving essential information for subsequent attribute reduction. The attribute reduction process is guided by conditional entropy, which further refines the feature set, enhancing the model's efficiency and accuracy. Experimental results on twelve public datasets and four real datasets both demonstrate the effectiveness of the proposed method, showing superior performance in terms of classification accuracy and feature reduction compared to seven existing approaches. This study establishes a unified framework for various granular computing models, offering new insights into the integration of granular computing models and adaptive optimization techniques for real-world data analysis applications. © 2025 Elsevier B.V.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：