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

2021 IEEE Global Communications Conference (GLOBECOM)

作者： Xiaotong Zhao Xin Guan Mian Li Qingjiang Shi School of Software Engineering Tongji University Shanghai China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China

ISBN: (纸本)9781728181059

Conventional uplink equalization in massive MIMO systems relies on a centralized baseband processing architecture. However, as the number of base station antenna increases, centralized baseband processing architectures encounter two bot-tlenecks, i.e., the tremendous data interconnection and the high-dimensional computation. To tackle these obstacles, decentralized baseband processing was proposed for uplink equalization, but only applicable to the scenarios with unpractical white Gaussian noise assumption. This paper presents an uplink linear mini-mum mean-square error (L-MMSE) equalization method in the daisy chain decentralized baseband processing architecture under colored noise assumption. The optimized L-MMSE equalizer is derived by exploiting the block coordinate descent method, which shows near-optimal performance both in theoretical and simulation while significantly mitigating the bottlenecks.

关键词： Baseband Equalizers Computer architecture Massive MIMO Mean square error methods Interference Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Policy-Driven Configuration Management for NoSQL

Policy-Driven Configuration Management for NoSQL

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Xianqiang Bao Ling Liu Nong Xiao Yang Zhou Qi Zhang State Key Laboratory of High Performance Computing National University of Defense Technology Hunan China Distributed Data Intensive Systems Lab Georgia Institute of Technology Atlanta Georgia USA

NoSQL systems have become the vital components to deliver big data services in the Cloud. However, existing NoSQL systems rely on experienced administrators to configure and tune the wide range of configurable parameters in order to achieve high performance. In this paper, we present a policy-driven configuration management system for NoSQL systems, called PCM. PCM can identify workload sensitive configuration parameters and capture the tuned parameters for different workloads as configuration policies. PCM also can be used to analyze the range of configuration parameters that may impact on the runtime performance of NoSQL systems in terms of read and write workloads. The configuration optimization recommended by PCM can enable NoSQL systems such as HBase to run much more efficiently than the default settings for both individual worker node and entire cluster in the Cloud. Our experimental results show that HBase under the PCM configuration outperforms the default configuration and some simple configurations on a range of workloads with offering significantly higher throughput.

关键词： Phase change materials Tuning Throughput Loading Compaction Optimization Monitoring

来源：评论

学校读者我要写书评

暂无评论

Learning Common and Label-Specific Features for Label Distribution Learning with Correlation Information

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Lin, Yaojin Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Zhangzhou363000 China

Label distribution learning quantifies the label space for each instance and has wide applicability in different fields. However, most existing work primarily focuses on common features, ignores the significance of label-specific features. Meanwhile, label correlation is well used in these work, but they still have limitations in capturing instance correlation. Therefore, in this paper, we propose a novel approach for label distribution learning to learn common and label-specific features with correlation information i.e. instance correlation and label correlation. First, we conduct $\ell_{2,1}-$norm regularization to select common and label-specific features, simultaneously. Then, we implement an optimization function to identify instance correlation in feature space. In addition, label correlation is collected with Pearson correlation coefficient. Finally, we design an objective function that enables the joint learning of common and label-specific features while leveraging correlation information. Comprehensive experiments manifest the superiority of our proposed approach against other well-established label distribution learning algorithms. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Medical Entity Disambiguation with Medical Mention Relation and Fine-grained Entity Knowledge 30

Medical Entity Disambiguation with Medical Mention Relation ...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Lu, Wenpeng Zhang, Guobiao Peng, Xueping Guan, Hongjiao Wang, Shoujin Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia Data Science Institute University of Technology Sydney Sydney Australia Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9782493814104

Medical entity disambiguation (MED) plays a crucial role in natural language processing and biomedical domains, which is the task of mapping ambiguous medical mentions to structured candidate medical entities from knowledge bases (KBs). However, existing methods for MED often fail to fully utilize the knowledge within medical KBs and overlook essential interactions between medical mentions and candidate entities, resulting in knowledge- and interaction-inefficient modeling and suboptimal disambiguation performance. To address these limitations, this paper proposes a novel approach, MED with Medical Mention Relation and Fine-grained Entity Knowledge (MMR-FEK). Specifically, MMR-FEK incorporates a mention relation fusion module and an entity knowledge fusion module, followed by an interaction module. The former employs a relation graph convolutional network to fuse mention relation information between medical mentions to enhance mention representations, while the latter leverages an attention mechanism to fuse synonym and type information of candidate entities to enhance entity representations. Afterwards, an interaction module is designed to employ a bidirectional attention mechanism to capture interactions between medical mentions and entities to generate the matching representation. Extensive experiments on two publicly available real-world datasets demonstrate MMR-FEK's superiority over state-of-the-art(SOTA) MED baselines across all metrics. Our source code is publicly available. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

An Early Detection Model of Prostate Cancer Based on MRI 9

An Early Detection Model of Prostate Cancer Based on MRI

引用

9th IEEE International Conference on data Science in Cyberspace, DSC 2024

作者： Liu, Yuankun Xing, Lumin Wang, Di Nie, Xin Zhang, Xueyan Wu, Di Liu, Wenjian The First Affiliated Hospital of Shandong First Medical University Shandong Provincial Qianfoshan Hospital Jinan China City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Chongqing Jianzhu College Chongqing China Shandong Youth University of Political Science School of Information Work Office Jinan China University of Southern Queensland School of Mathematics Physics and Computing QLD Australia

ISBN: (纸本)9798350391367

Prostate cancer is a prevalent form of cancer among men, with a high rate of occurrence but relatively lower mortality compared to other types of cancer. Early detection is crucial because it allows for earlier intervention, potentially preventing progression to more severe stages, and improving patient outcomes. However, human diagnosis is time-consuming and inefficient, an autonomous early detection system is essential for saving lives. To address this challenge, we propose a novel MoE-MRIViT framework that uses advanced machine learning and computer vision techniques to analyze MRI images and identify features indicative of prostate cancer. The system processes the data using a vision transformer to extract precise prostate cancer features from MRI scans, and uses attention mechanisms to focus on significant areas. Through the MoE-MRIViT intervention in two stages, we have achieved superior results compared to the state-of-the-art (SOTA) methods. Experimental results demonstrate that our model achieves an impressive accuracy of 94.84%, outperforming the ResNet-101 and the basic ViT models, which achieve accuracies of 89.4% and 92.31%, respectively. © 2024 IEEE.

关键词： Urology

来源：评论

学校读者我要写书评

暂无评论

Delay-wise Superimposed Pilot based Compressed Sensing Channel Estimation for OTFS Systems

Delay-wise Superimposed Pilot based Compressed Sensing Chann...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Zhihao Chen Xinhua Zheng Xiang Chen School of Electronics and Information Technology Sun Yat-sen University Guangzhou China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China

In the OTFS channel estimation scheme, the spectral efficiency loss can be mitigated by a superimposed pilot (SP) scheme, yet it compromises the peak-to-average power ratio (PAPR) performance. This paper introduces a delay-wise superimposed pilot placement scheme, termed the SP-DW scheme, based on Zadoff-Chu (ZC) sequences. This scheme is designed to enhance the PAPR performance of the system. Specifically, the ZC sequences can maintain good mutual incoherence between the column vectors of the dictionary matrix in compressed sensing-based channel estimation, thereby averting estimation failure. Additionally, a two-step channel estimator and iterative scheme based on the multipath matching pursuit (MMP) algorithm are developed to search for fractional delays and Doppler shifts. The MMP algorithm optimally combines multiple paths in the fractional dictionary matrix to identify sparse candidates, subsequently improving the accuracy of channel estimation. Simulation results indicate that the proposed scheme outperforms the existing SP scheme in terms of PAPR, channel estimation, and bit error rate (BER) performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cascading Hierarchical Networks with Multi-task Balanced Loss for Fine-grained hashing

arXiv

引用

arXiv 2023年

作者： Zeng, Xianxian Zheng, Yanjun The Department of Computer Science Guangdong Polytechnic Normal University Guangzhou510000 China The Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China

With the explosive growth in the number of fine-grained images in the Internet era, it has become a challenging problem to perform fast and efficient retrieval from large-scale fine-grained images. Among the many retrieval methods, hashing methods are widely used due to their high efficiency and small storage space occupation. Fine-grained hashing is more challenging than traditional hashing problems due to the difficulties such as low inter-class variances and high intra-class variances caused by the characteristics of fine-grained images. To improve the retrieval accuracy of fine-grained hashing, we propose a cascaded network to learn compact and highly semantic hash codes, and introduce an attention-guided data augmentation method. We refer to this network as a cascaded hierarchical data augmentation network. We also propose a novel approach to coordinately balance the loss of multi-task learning. We do extensive experiments on some common fine-grained visual classification datasets. The experimental results demonstrate that our proposed method outperforms several state-of-art hashing methods and can effectively improve the accuracy of fine-grained retrieval. The source code is publicly available: https://***/kaiba007/FG-CNET. © 2023, CC BY-NC-SA.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

UJN-Land: A Large-Scale High-Resolution Parcel of Land of Multi-temporal dataset with CNN Based Semantic Segmentation Analysis 7th

UJN-Land: A Large-Scale High-Resolution Parcel of Land of Mu...

引用

7th International Conference on Life System Modeling and Simulation, LSMS 2021, and the 7th International Conference on Intelligent computing for Sustainable Energy and Environment, ICSEE 2021

作者： Shen, Yuan Wang, Yulin Yang, Shiyong Li, Yan Han, Shiyuan Liu, Zhen Xu, Tao School of Information Science and Engineering University of Jinan Jinan250022 China Highresolution Earth Observation System Shandong Center of Data and Application University of Jinan Jinan250022 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan250022 China Shandong Institutes of Industrial Technonlogy Jinan250102 China Land Spatial Data and Remote Sensing Technology Institute of Shandong Province Jinan250002 China

ISBN: (纸本)9789811672125

Semantic segmentation of land in remote sensing images plays an important role in urban management and rural planning, and can provide intelligent analysis for urban development. Convolutional neural network (CNN) based methods have achieved good performance in object detection in computer vision, which benefits from the popularity of large-scale datasets. However, most of segmentation of land dataset were constructed based on various satellite images and samples that lack the number and diversity of existing datasets. These problems have brought challenges to the improvement and application of CNN based land parcel segmentation methods. This paper presented a large-scale high-resolution land dataset based on CNN analysis. More than 200,000 images of 256*256 pixels were obtained from Gaofen satellite images with a spatial resolution of 0.8 m, in which four category samples were manually annotated. In the experiment, three CNN based semantic segmentation methods were used as experimental baseline methods. The experimental results showed that the availability of the UJN-Land dataset is beneficial to the planning and management of cultivated land. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Clustering by orthogonal NMF model and non-convex penalty optimization

Clustering by orthogonal NMF model and non-convex penalty op...

引用

作者： Wang, Shuai Chang, Tsung-Hui Cui, Ying Pang, Jong-Shi Shenzhen Research Institute of Big Data and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Department of Industrial and Systems Engineering University of Southern California Los AngelesCA90089 United States

The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means. However, solving the ONMF model is a challenging optimization problem because the coupling of the orthogonality and non-negativity constraints introduces a mixed combinatorial aspect into the problem due to the determination of the correct status of the variables (positive or zero). Most of the existing methods directly deal with the orthogonality constraint in its original form via various optimization techniques, but are not scalable for large-scale problems. In this paper, we propose a new ONMF based clustering formulation that equivalently transforms the orthogonality constraint into a set of norm-based non-convex equality constraints. We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable. One smooth penalty formulation and one non-smooth penalty formulation are respectively studied. We build theoretical conditions for the penalized problems to provide feasible stationary solutions to the ONMF based clustering problem, as well as proposing efficient algorithms for solving the penalized problems of the two NCP methods. Experimental results based on both synthetic and real datasets are presented to show that the proposed NCP methods are computationally time efficient, and either match or outperform the existing K-means and ONMF based methods in terms of the clustering performance. © 1991-2012 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

INTERACTIVE MODEL WITH STRUCTURAL LOSS FOR LANGUAGE-BASED ABDUCTIVE REASONING

arXiv

引用

arXiv 2021年

作者： Li, Linhao Xu, Ming Dong, Yongfeng Li, Xin Wang, Ao The School of Artificial Intellgence The Hebei Provincial Key Laboratory of Big Data Computing Hebei University of Technology China The Lane Department of Computer Science and Electrical Engineering West Virginia University United States

The abductive natural language inference task (αNLI) is proposed to infer the most plausible explanation between the cause and the event. In the αNLI task, two observations are given, and the most plausible hypothesis is asked to pick out from the candidates. Existing methods model the relation between each candidate hypothesis separately and penalize the inference network uniformly. In this paper, we argue that it is unnecessary to distinguish the reasoning abilities among correct hypotheses;and similarly, all wrong hypotheses contribute the same when explaining the reasons of the observations. Therefore, we propose to group instead of ranking the hypotheses and design a structural loss called "joint softmax focal loss" in this paper. Based on the observation that the hypotheses are generally semantically related, we have designed a novel interactive language model aiming at exploiting the rich interaction among competing hypotheses. We name this new model for αNLI: Interactive Model with Structural Loss (IMSL). The experimental results show that our IMSL has achieved the highest performance on the RoBERTa-large pretrained model, with ACC and AUC results increased by about 1% and 5% respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：