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

10th IEEE International Conference on Cyber Security and Cloud Computing and 9th IEEE International Conference on Edge Computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Huang, Tao Chen, Xiang Peng, Li Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan Hunan411201 China Hunan Key Laboratory for Service computing and Novel Software Technology China

ISBN: (纸本)9798350312461

The rapid development of single-cell RNA sequencing (scRNA-seq) technology has enabled researchers to explore gene expression differences at the level of individual cells, revealing more refined cell types and states. However, due to the low expression and high noise of scRNA-seq data, feature selection has become particularly important in the analysis of single-cell data. Here, we introduce the Entropy Stepwise Regression (ESR) method for feature selection. This method utilizes the correlation between genes and the entropy values of each feature to filter out genes that are conducive to downstream analysis. In mouse kidney samples, we compared the performance of three methods in terms of Adjusted Rand Index and achieved good results. This indicates that the method can improve the accuracy of downstream analysis. © 2023 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

ScIAMC:Single-Cell Imputation via adaptive matrix completion 10

ScIAMC:Single-Cell Imputation via adaptive matrix completion

引用

10th IEEE International Conference on Cyber Security and Cloud Computing and 9th IEEE International Conference on Edge Computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Zhang, Shuai Chen, Xiang Peng, Li Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan Hunan411201 China Hunan Key Laboratory for Service computing and Novel Software Technology China

ISBN: (纸本)9798350312461

Single-cell sequencing techniques are often impacted by technical noise, leading to the generation of very sparse expression matrices. This technical noise is referred to as dropouts and poses as a major challenge for downstream analysis. In this study, we introduce scIAMC (single-cell imputation via adaptive parameter matrix completion), which is based on matrix completion theory to recover missing values in expression matrices. To expedite the algorithm's running time and avoid any parameter tuning on data, we formulated an optimization problem. Our approach led to an enhanced cell population identification and minimal errors, while also restoring biological landscapes that were damaged by these dropouts. © 2023 IEEE.

关键词： Cell proliferation

来源：评论

学校读者我要写书评

暂无评论

ASTSDL:predicting the functionality of incomplete programming code via an AST-sequence-based deep learning model

引用

science China(Information sciences) 2024年第1期67卷 86-104页

作者： Yaoshen YU Zhiqiu HUANG Guohua SHEN Weiwei LI Yichao SHAO College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Collaborative Innovation Center of Novel Software Technology and Industrialization Key Laboratory of Safety-Critical Software Ministry of Industry and Information Technology

Code recommendation systems have been widely used in helping developers implement unfamiliar programming *** existing code recommenders or code search engines can retrieve relevant code rapidly with high accuracy,however,they cannot recommend any code outside similar *** propose an approach to predict the functionality of incomplete programming code by using syntactical information,and providing a list of potential functionalities to guess what the developers want,in order to increase the diversity of *** this paper,we propose a deep learning model called ASTSDL,which uses a sequencebased representation of source code to predict *** extract syntactical information from the abstract syntax tree(AST) of the source code,apply a deep learning model to capture the syntactic and sequential information,and predict the functionality of the source code *** experimental results demonstrate that ASTSDL can effectively predict the functionality of incomplete code with an accuracy above 84% in the top-10 list,even if there is only half of the complete code.

关键词： functionality prediction incomplete programming code syntactical information code representation model deep learning algorithm

来源：评论

学校读者我要写书评

暂无评论

Indexing dynamic encrypted database in cloud for efficient secure k-nearest neighbor query

引用

Frontiers of computer science 2024年第1期18卷 187-198页

作者： Xingxin LI Youwen ZHU Rui XU Jian WANG Yushu ZHANG College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing 210016China Department of Mathematical Informatics University of TokyoTokyo 113-8654Japan Guangxi Key Laboratory of Trusted Software Guilin University of Electronic TechnologyGuilin 541004China School of Computer Science China University of GeosciencesWuhan 430074China

Secure k-Nearest Neighbor(k-NN)query aims to find k nearest data of a given query from an encrypted database in a cloud server without revealing privacy to the untrusted cloud and has wide applications in many areas,such as privacy-preservingmachine elearning gand secure biometric *** solutions have been put forward to solve this challenging ***,the existing schemes still suffer from various limitations in terms of efficiency and *** this paper,we propose a new encrypt-then-index strategy for the secure k-NN query,which can simultaneously achieve sub-linear search complexity(efficiency)and support dynamical update over the encrypted database(flexibility).Specifically,we propose a novel algorithm to transform the encrypted database and encrypted query points in the *** indexing the transformed database using spatial data structures such as the R-tree index,our strategy enables sub-linear complexity for secure k-NN queries and allows users to dynamically update the encrypted *** the best of our knowledge,the proposed strategy is the first to simultaneously provide these two *** theoretical analysis and extensive experiments,we formally prove the security and demonstrate the efficiency of our scheme.

关键词： cloud computing secure k-NN query sub-linear complexity dynamicupdate

来源：评论

学校读者我要写书评

暂无评论

Expanding the Scope: Inductive Knowledge Graph Reasoning with Multi-starting Progressive Propagation 23rd

Expanding the Scope: Inductive Knowledge Graph Reasoning wi...

引用

23rd International Semantic Web Conference, ISWC 2024

作者： Shao, Zhoutian Cui, Yuanning Hu, Wei State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China National Institute of Healthcare Data Science Nanjing University Nanjing210093 China

ISBN: (纸本)9783031778490

Knowledge graphs (KGs) are widely acknowledged as incomplete, and new entities are constantly emerging in the real world. Inductive KG reasoning aims to predict missing facts for these new entities. Among existing models, graph neural networks (GNNs) based ones have shown promising performance for this task. However, they are still challenged by inefficient message propagation due to the distance and scalability issues. In this paper, we propose a new inductive KG reasoning model, MStar, by leveraging conditional message passing neural networks (C-MPNNs). Our key insight is to select multiple query-specific starting entities to expand the scope of progressive propagation. To propagate query-related messages to a farther area within limited steps, we subsequently design a highway layer to propagate information toward these selected starting entities. Moreover, we introduce a training strategy called LinkVerify to mitigate the impact of noisy training samples. Experimental results validate that MStar achieves superior performance compared with state-of-the-art models, especially for distant entities. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Efficient Large Scale Reverse-time Migration Imaging Computation based on Distributed Spark Cluster with GPUs 21

Efficient Large Scale Reverse-time Migration Imaging Computa...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Wangzhang, Suhui Yang, Ruizhang Gu, Rong Li, Bo Liu, Dingjin Wang, Zhaokang Nanjing University State Key Laboratory for Novel Software Technology China Sinopec Geophysical Research Institute China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China

ISBN: (纸本)9798350329223

The reverse-time migration (RTM) imaging algorithm, which is used for complex underground structure analysis, is known as one of the current mainstream method of high-precision seismic imaging. Nowadays, as the fast development of seismic data acquisition technology, there exists large amount of seismic data. Thus, the requirement for the efficient computation of the reverse-time migration (RTM) imaging algorithms over large-scale data have been increased greatly. To address this problem, in this paper, we propose a distributed reverse-time migration imaging algorithm based on the widely-used Spark platform first. Based on that, we design and implement a RTM computation solution based on Spark and GPU with several optimizations, including pre-shuffle&caching and load balancing. We also analyze the fault tolerance capability of the proposed distributed algorithm. We evaluate the proposed methods on the typical three-dimensional wavefild benchmark dataset. Experimental results show that the performance of the Spark based reverse-time migration imaging algorithm can scale up near linearly with computing nodes. In addition, the GPU+Spark based version has significant performance improvement on execution efficiency over the Spark-based algorithm. Moreover, the proposed optimization strategies also take effect. In addition, the method proposed in this paper has been applied in the real-world environment of one of the top oil exploration companies world wide, and has achieved significant improvement under the premise of the algorithm correctness guarantee. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Towards Gradient Equalization and Feature Diversification for Long-Tailed Multi-Label Image Recognition

引用

IEEE Transactions on Multimedia 2025年 27卷 3489-3500页

作者： Chen, Zhao-Min Cui, Quan Zhang, Xiaoqin Deng, Ruoxi Xia, Chaoqun Lu, Shijian Nanjing University National Key Laboratory for Novel Software Technology Nanjing210093 China Waseda University Graduate School of Information Production and Systems Fukuoka169-8050 Japan Wenzhou University College of Computer Science and Artificial Intelligence Wenzhou325060 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore

Multi-label image recognition with convolutional neural networks has achieved remarkable progress in the past few years. However, most existing multi-label image recognition methods suffer from the long-tailed data distribution problem, i.e., head categories occupy most training samples, while tailed classes have few samples. This work firstly studies the influence of long-tailed data distribution on existing multi-label image recognition methods. Based on this, two crucial issues of the existing methods are identified: 1) severe gradient imbalance between head and tailed categories, even though re-balancing strategies are adopted;2) the lack of diversity of tail category training samples. To tackle the first issue, this paper proposes a group sampling strategy to create group- wise balanced data distribution. Meanwhile, a dynamic gradient balancing loss is proposed to equalize the gradient for all categories. To tackle the second issue, this paper proposes a diversity enhancement module to fuse the information across all categories, preventing the network from overfitting tail classes. Furthermore, it also balances the gradient, promoting the discriminability of learned classifiers. Our method significantly outperforms the baseline method and achieves competitive performance with state-of-the-art methods on VOC-LT and COCO-LT datasets. Extensive ablation studies are conducted to verify the effectiveness of the essential proposals. © 1999-2012 IEEE.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

On interleaving space exploration of multi-threaded programs

引用

Frontiers of computer science 2021年第4期15卷 17-28页

作者： Dongjie CHEN Yanyan JIANG Chang XU Xiaoxing MA State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China

Exploring the interleaving space of a multithreaded program to efficiently detect concurrency bugs is important but also difficult because of the astronomically many thread *** paper presents a novel framework to decompose a thread schedule generator that explores the interleaving space into the composition of a basic generator and its extension under the“small interleaving hypothesis”.Under this framework,we in-depth analyzed research work on interleaving space exploration,illustrated how to design an effective schedule generator,and shed light on future research opportunities.

关键词： survey testing concurrency bugs interleaving space

来源：评论

学校读者我要写书评

暂无评论

Fast target-aware learning for few-shot video object segmentation

引用

science China(Information sciences) 2022年第8期65卷 71-86页

作者： Yadang CHEN Chuanyan HAO Zhi-Xin YANG Enhua WU Engineering Research Center of Digital Forensics Ministry of EducationSchool of Computer and SoftwareNanjing University of Information Science and Technology School of Education Science and Technology Nanjing University of Posts and Telecommunications State Key Laboratory of Internet of Things for Smart City Department of Electromechanical EngineeringUniversity of Macau State Key Laboratory of Computer Science Institute of SoftwareUniversity of Chinese Academy of Sciences Faculty of Science and Technology University of Macau

Few-shot video object segmentation(FSVOS) aims to segment a specific object throughout a video sequence when only the first-frame annotation is given. In this study, we develop a fast target-aware learning approach for FSVOS, where the proposed approach adapts to new video sequences from its firstframe annotation through a lightweight procedure. The proposed network comprises two models. First, the meta knowledge model learns the general semantic features for the input video image and up-samples the coarse predicted mask to the original image size. Second, the target model adapts quickly from the limited support set. Concretely, during the online inference for testing the video, we first employ fast optimization techniques to train a powerful target model by minimizing the segmentation error in the first frame and then use it to predict the subsequent frames. During the offline training, we use a bilevel-optimization strategy to mimic the full testing procedure to train the meta knowledge model across multiple video *** proposed method is trained only on an individual public video object segmentation(VOS) benchmark without additional training sets and compared favorably with state-of-the-art methods on DAVIS-2017, with a J &F overall score of 71.6%, and on YouT ubeVOS-2018, with a J &F overall score of 75.4%. Meanwhile,a high inference speed of approximately 0.13 s per frame is maintained.

关键词： video object segmentation few-shot target-aware meta knowledge bilevel-optimization

来源：评论

学校读者我要写书评

暂无评论

SeeMe: An intelligent edge server selection method for location-aware business task computing over IIoT

SeeMe: An intelligent edge server selection method for locat...

引用

作者： Dou, Wanchun Liu, Bowen Duan, Jirun Dai, Fei Qi, Lianyong Xu, Xiaolong State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China School of Computer Science Qufu Normal University Qufu China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China

In the past few years, latency-sensitive task computing over the industrial internet of things (IIoT) has played a key role in an increasing number of intelligent applications, such as intelligent self-driving vehicles and unmanned aircraft systems. The edge computing paradigm provides a basic functional infrastructure for across-domain business task computing on distributed edge servers. With this observation, a trade-off between the mobile devices and the fixed edge servers is needed to run moving task computing in a low-latency way. Given this challenge, an intelligent server selection method, named SeeMe, is proposed in this paper. Technically speaking, this method aims at minimizing the communication capacity and the transferring capacity in a multiobjective optimization way to find a low-latency edge server. The experiments and comparison analysis verify the availability of our method. © 2022 John Wiley & Sons Ltd.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：