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

arXiv 2023年

作者： Dang, Zhuohang Luo, Minnan Jia, Chengyou Dai, Guang Wang, Jihong Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi’an710049 China The SGIT AI Laboratory Xi’an710048 China The State Grid Shaanxi Electric Power Company Ltd. State Grid Corporation of China Xi’an710048 China The School of Information Science and Technology University of Science and Technology of China Hefei230026 China Abu Dhabi United Arab Emirates Baidu Inc Beijing100085 China

Encoding only the task-related information from the raw data, i.e., disentangled representation learning, can greatly contribute to the robustness and generalizability of models. Although significant advances have been made by regularizing the information in representations with information theory, two major challenges remain: 1) the representation compression inevitably leads to performance drop;2) the disentanglement constraints on representations are in complicated optimization. To these issues, we introduce Bayesian networks with transmitted information to formulate the interaction among input and representations during disentanglement. Building upon this framework, we propose DisTIB (Transmitted Information Bottleneck for Disentangled representation learning), a novel objective that navigates the balance between information compression and preservation. We employ variational inference to derive a tractable estimation for DisTIB. This estimation can be simply optimized via standard gradient descent with a reparameterization trick. Moreover, we theoretically prove that DisTIB can achieve optimal disentanglement, underscoring its superior efficacy. To solidify our claims, we conduct extensive experiments on various downstream tasks to demonstrate the appealing efficacy of DisTIB and validate our theoretical analyses. Copyright © 2023, The Authors. All rights reserved.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Fog-assisted multi-user swipt networks: Local computing or offloading

arXiv

引用

arXiv 2019年

作者： Zheng, Haina Xiong, Ke Fan, Pingyi Zhong, Zhangdui Letaief, Khaled Ben School of Computer and Information Technology Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing100044 China National Laboratory for Information Science and Technology Department of Electronic Engineering Tsinghua University Beijing100084 China State Key Lab of Rail Traffic Control and Safety Beijing Engineering Research Center of High-speed Railway Broadband Mobile Communications Beijing Jiaotong University Beijing100044 China Clear Water Bay Hong Kong

This paper investigates a fog computing-assisted multi-user simultaneous wireless information and power transfer (SWIPT) network, where multiple sensors with power splitting (PS) receiver architectures receive information and harvest energy from a hybrid access point (HAP), and then process the received data by using local computing mode or fog offloading mode. For such a system, an optimization problem is formulated to minimize the sensors' required energy while guaranteeing their required information transmissions and processing rates by jointly optimizing the multi-user scheduling, the time assignment, the sensors' transmit powers and the PS ratios. Since the problem is a mixed integer programming (MIP) problem and cannot be solved with existing solution methods, we solve it by applying problem decomposition, variable substitutions and theoretical analysis. For a scheduled sensor, the closed-form and semi-closedform solutions to achieve its minimal required energy are derived, and then an efficient multi-user scheduling scheme is presented, which can achieve the suboptimal user scheduling with low computational complexity. Numerical results demonstrate our obtained theoretical results, which show that for each sensor, when it is located close to the HAP or the fog server (FS), the fog offloading mode is the better choice;otherwise, the local computing mode should be selected. The system performances in a frame-by-frame manner are also simulated, which show that using the energy stored in the batteries and that harvested from the signals transmitted by previous scheduled sensors can further decrease the total required energy of the sensors. Copyright © 2019, The Authors. All rights reserved.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

ITrace: An implicit trust inference method for trust-aware collaborative filtering

引用

AIP Conference Proceedings 2018年第1期1955卷

作者： Xu He Bin Liu Kejia Chen School of Computer Science Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210023 China

The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. A CF algorithm recommends items of interest to the target user by leveraging the votes given by other similar users. In a standard CF framework, it is assumed that the credibility of every voting user is exactly the same with respect to the target user. This assumption is not satisfied and thus may lead to misleading recommendations in many practical applications. A natural countermeasure is to design a trust-aware CF (TaCF) algorithm, which can take account of the difference in the credibilities of the voting users when performing CF. To this end, this paper presents a trust inference approach, which can predict the implicit trust of the target user on every voting user from a sparse explicit trust matrix. Then an improved CF algorithm termed iTrace is proposed, which takes advantage of both the explicit and the predicted implicit trust to provide recommendations with the CF framework. An empirical evaluation on a public dataset demonstrates that the proposed algorithm provides a significant improvement in recommendation quality in terms of mean absolute error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

来源：评论

学校读者我要写书评

暂无评论

Unbalanced incomplete multi-view clustering via the scheme of view evolution: Weak views are meat;strong views do eat

arXiv

引用

arXiv 2020年

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Oliver The School of Computer Science and Technology Key Laboratory of Information Storage System Ministry of Education of China Huazhong University of Science and Technology Wuhan430074 China The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China The Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Incomplete multi-view clustering is an important technique to deal with real-world incomplete multi-view data. Previous methods assume that all views have the same incompleteness, i.e., balanced incompleteness. However, different views often have distinct incompleteness, i.e., unbalanced incompleteness, which results in strong views (low-incompleteness views) and weak views (high-incompleteness views). The unbalanced incompleteness prevents us from directly using previous methods. In this paper, inspired by the effective biological evolution theory, we design the novel scheme of view evolution to cluster strong and weak views. Moreover, we propose an Unbalanced Incomplete Multi-view Clustering method (UIMC), which is the first effective method based on view evolution for unbalanced incomplete multi-view clustering. Compared with previous methods, UIMC has two unique advantages: 1) it proposes weighted multi-view subspace clustering to integrate unbalanced incomplete views, which effectively solves the unbalanced incomplete multi-view clustering problem;2) it designs the low-rank representation to recover the data, which diminishes the impact of the incompleteness and noises. Extensive experimental results demonstrate that UIMC improves the clustering performance by up to 40% on three evaluation metrics over other state-of-the-art methods. We provide codes for all of our experiments in https://***/ZeusDavide/TETCI_UIMC. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Siamese Delta Network with Multimodality Fusion for systemic Treatment Response Prediction in Pancreatic Cancer*

Siamese Delta Network with Multimodality Fusion for Systemic...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Peijun Hu Xiang Li Na Lu Xueli Bai Tingbo Liang Jingsong Li Research Center for Healthcare Data Science Zhejiang Laboratory Hangzhou China Department of Hepatobiliary and Pancreatic Surgery First Affiliated Hospital Zhejiang University School of Medicine Hangzhou China Zhejiang Provincial Key Laboratory of Pancreatic Disease Hangzhou China Zhejiang University Cancer Center Hangzhou China Engineering Research Center of EMR and Intelligent Expert System Ministry of Education College of Biomedical Engineering and Instrument Science Zhejiang University Hangzhou China

systemic treatment is a main way for pancreas cancer patients that are ineligible for surgery. A subgroup of patients showed good response to systemic treatment and the rest received limited benefits. CT images provide a non-invasive way to assess the treatment response. Alternative non-image methods include radiology analysis, tumor marker analysis and combination analysis. To combine the image and non-image data, we propose the Siamese Delta Network with Multimodality Fusion (SDN-MF) to predict systemic treatment response in an end-to-end way. First, a Siamese Delta Network (SDN) is designed to process pre-treatment and pre-surgery CT images and get the image feature changes to predict response. Then, patients’ characteristics from EMR and alternative analysis results forms non-image data, which is incorporated into SDN with a multimodality fusion (MF) module. The proposed SDN-MF is evaluated on a private dataset and achieves average AUC value of 0.883 with five cross-validation. Comparison among image-only, non-image-only, and fusion models verifies the superior of multimodality model in predicting systemic treatment response of pancreas cancer patients.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Novel Color Orthogonal Moments-Based Image Representation and Recognition

Research Square

引用

Research Square 2020年

作者： He, Bing Liu, Jun Yang, Tengfei Xiao, Bin Peng, Yanguo School of Physics and Electrical Engineering Weinan Normal University Weinan714000 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts & Telecommunications Xi’an710121 China School of Computer Science and Technology Weinan Normal University Weinan714000 China School of Cyberspace Security Xi’an University of Posts & Telecommunications Xi’an710121 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China School of Computer Science and Technology Xidian University Xi’an710071 China

Inspired by quaternion algebra and the idea of fractional-order transformation, we propose a new set of quaternion fractional-order generalized Laguerre orthogonal moments (QFr-GLMs) based on fractional-order generalized Laguerre polynomials. Firstly, the proposed QFr-GLMs are directly constructed in Cartesian coordinate space, avoiding the need for conversion between Cartesian and polar coordinates;therefore, they are better image descriptors than circularly orthogonal moments constructed in polar coordinates. Moreover, unlike the latest Zernike moments based on quaternion and fractional-order transformations, which extract only the global features from color images, our proposed QFr-GLMs can extract both the global and local color features. This paper also derives a new set of invariant color-image descriptors by QFr-GLMs, enabling geometric-invariant pattern recognition in color images. Finally, the performances of our proposed QFr-GLMs and moment invariants were evaluated in simulation experiments of correlated color images. Both theoretical analysis and experimental results demonstrate the value of the proposed QFr-GLMs and their geometric invariants in the representation and recognition of color images. © 2020, CC BY.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Cell-Free Massive MIMO with Multi-Antenna Users over Weichselberger Rician Channels

arXiv

引用

arXiv 2022年

作者： Li, Xin Zhang, Jiayi Wang, Zhe Ai, Bo Ng, Derrick Wing Kwan The School of Electronic and Information Engineering The Frontiers Science Center for Smart High-Speed Railway System Beijing Jiaotong University Beijing100044 China The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Frontiers Science Center for Smart High-Speed Railway System Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China School of Electrical Engineering and Telecommunications University of New South Wales NSW2052 Australia

We consider a cell-free massive multiple-input multiple-output (MIMO) system with multi-antenna access points and user equipments (UEs) over Weichselberger Rician fading channels with random phase-shifts. More specifically, we investigate the uplink spectral efficiency (SE) for two pragmatic processing schemes: 1) the fully centralized processing scheme with global minimum mean square error (MMSE) or maximum ratio (MR) combining;2) the large-scale fading decoding (LSFD) scheme with local MMSE or MR combining. To improve the system SE performance, we propose a practical uplink precoding scheme based on only the eigenbasis of the UE-side correlation matrices. Moreover, we derive novel closed-form SE expressions for characterizing the LSFD scheme with the MR combining. Numerical results validate the accuracy of our derived expressions and show that the proposed precoding scheme can significantly improve the SE performance compared with the scenario without any precoding scheme. Copyright © 2022, The Authors. All rights reserved.

关键词： Spectrum efficiency

来源：评论

学校读者我要写书评

暂无评论

OpenHI2 - Open source histopathological image platform

OpenHI2 - Open source histopathological image platform

引用

IEEE International Conference on Bioinformatics and Biomedicine

作者： Pargorn Puttapirat Haichuan Zhang Jingyi Deng Yuxin Dong Jiangbo Shi Hongyu He Zeyu Gao Chunbao Wang Xiangrong Zhang Chen Li National Engineering Lab for Big Data Analytics Xi'an Jiao tong University Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi'an Jiaotong University Department of Power System and Automation School of Electrical Engineering Xi'an Jiaotong University Department of Pathology the First Affiliated Hospital of Xi'an Jiaotong University Institute of Intelligent Information Processing Xidian University

ISBN: (纸本)9781728118680

Transition from conventional to digital pathology requires a new category of biomedical informatic infrastructure which could facilitate delicate pathological routine. Pathological diagnoses are sensitive to many external factors and is known to be subjective. Only systems that can meet strict requirements in pathology would be able to run along pathological routines and eventually digitized the area, and the developed platform should comply with existing pathological routines and international standards. Currently, there are a number of available software tools which can perform histopathological tasks including virtual slide viewing, annotating, and basic image analysis, however, none of them can serve as a digital platform for pathology. Here we describe OpenHI2, an enhanced version Open Histopathological Image platform which is capable of supporting all basic pathological tasks and file formats;ready to be deployed in medical institutions on a standard server environment or cloud computing infrastructure. In this paper, we also describe the development decisions for the platform and propose solutions to overcome technical challenges including responsive region retrieval and viewing, virtual slide magnification, recording of diagnostic areas. These factors would promote OpenHI2 be used as a platform for histopathological images in real-world clinical settings. Furthermore, in research, OpenHI2 inherited the annotation functionality from the previous version, thus acquired annotations can be directly utilized by the newly added machine learning module which include popular machine learning models to perform tasks such as histology image classification and segmentation in the same environment. Addition can be made to the platform since each component is modularized and fully documented. OpenHI2 is free, open-source, and available at .

关键词： OpenHI digital pathology histopathological image analysis open source software open source software pathology Platform Software Tools open source Religious Missions External factors images

来源：评论

学校读者我要写书评

暂无评论

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：