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

arXiv 2024年

作者： Wang, Zi Xiao, Min Zhou, Yirong Wang, Chengyan Wu, Naiming Li, Yi Gong, Yiwen Chang, Shufu Chen, Yinyin Zhu, Liuhong Zhou, Jianjun Cai, Congbo Wang, He Guo, Di Yang, Guang Qu, Xiaobo Department of Electronic Science Intelligent Medical Imaging R&D Center Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Xiamen University China Institute of Artificial Intelligence Xiamen University China Human Phenome Institute Fudan University China Department of Imaging Xiamen Cardiovascular Hospital of Xiamen University School of Medicine Xiamen University China Department of Cardiovascular Medicine Heart Failure Center Ruijin Hospital Lu Wan Branch Shanghai Jiaotong University School of Medicine China Shanghai Institute of Cardiovascular Diseases Zhongshan Hospital Fudan University China Department of Radiology Zhongshan Hospital Fudan University Department of Medical Imaging Shanghai Medical School Shanghai Institute of Medical Imaging China Fujian Province Key Clinical Specialty Construction Project Medical Imaging Department Xiamen Key Laboratory of Clinical Transformation of Imaging Big Data and Artificial Intelligence China School of Computer and Information Engineering Xiamen University of Technology China Department of Bioengineering and Imperial-X Imperial College London United Kingdom Department of Bioengineering Imperial College London United Kingdom

Dynamic magnetic resonance imaging (MRI) plays an indispensable role in cardiac diagnosis. To enable fast imaging, the k-space data can be undersampled but the image reconstruction poses a great challenge of high-dimensional processing. This challenge necessitates extensive training data in deep learning reconstruction methods. In this work, we propose a novel and efficient approach, leveraging a dimension-reduced separable learning scheme that can perform exceptionally well even with highly limited training data. We design this new approach by incorporating spatiotemporal priors into the development of a Deep Separable Spatiotemporal Learning network (DeepSSL), which unrolls an iteration process of a 2D spatiotemporal reconstruction model with both temporal low-rankness and spatial sparsity. Intermediate outputs can also be visualized to provide insights into the network behavior and enhance interpretability. Extensive results on cardiac cine datasets demonstrate that the proposed DeepSSL surpasses state-of-the-art methods both visually and quantitatively, while reducing the demand for training cases by up to 75%. Additionally, its preliminary adaptability to unseen cardiac patients has been verified through a blind reader study conducted by experienced radiologists and cardiologists. Furthermore, DeepSSL enhances the accuracy of the downstream task of cardiac segmentation and exhibits robustness in prospectively undersampled real-time cardiac MRI. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Online Tensor Decomposition for Hyperspectral data Representation

Online Tensor Decomposition for Hyperspectral Data Represent...

引用

Chinese Automation Congress (CAC)

作者： Jinrong He Yanxin Shi Chengwang Xie Zeyu Bao Zongwen Bai College of Mathematics and Computer Science Yan’an University Shaanxi China School of Computer and Information Engineering South China Normal University Shanwei China School of the Gifted Young University of Science and Technology of China Hefei China Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data Yan’an University Shaanxi China

ISBN: (纸本)9781665426480

Tensor is a natural representation of visual data, such as hyperspectral image data. Other than vector representation based feature extraction methods, tensor-based representation methods are more informative. Most existing data representation methods only work on vector spaces which are implemented by stacking the original tensor elements into a long vector. However, the vectorization will inevitably lost the underlying structural information and lead to high computational complexity. In order to reduce the memory requirements, we proposed an online tensor decomposition (OTD) method for hyperspectral image feature extraction. It does not require to load the whole tensor data set into main memory, and with the insertion of new tensor samples, it can update projection matrices incrementally, which is desirable for large data sets. In the experiments, the proposed method was applied into the task of apple hyperspectral data classification. The classification results confirm the effectiveness of online tensor decom-position method.

关键词： Visualization Tensors Memory management Stacking Feature extraction Matrix decomposition Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

arXiv

引用

arXiv 2021年

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China University of Texas at Dallas Dallas United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. © 2021, CC0.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

APDPk-means: A new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation 21

APDPk-means: A new differential privacy clustering algorithm...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Fan, Zexuan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security AND Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

How to protect users' private data during network data mining has become a hot issue in the fields of big data and network information security. Most current researches on differential privacy k-means clustering algorithms focus on optimizing the selection of initial centroids. However, the traditional privacy budget allocation has the problem that the random noise becomes too large as the number of iterations increases, which will reduce the performance of data clustering. To solve the problem, we improved the way of privacy budget allocation in differentially private clustering algorithm DPk-means, and proposed APDPk-means, a new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation. APDPk-means decomposes the total privacy budget into a decreasing arithmetic progression, allocating the privacy budgets from large to small in the iterative process, so as to ensure the rapid convergence in early iteration. The experiment results show that compared with the other differentially private k-means algorithms, APDPk-means has better performance in availability and quality of the clustering result under the same level of privacy protection. © 2019 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A Causal Adversarial Graph Neural Network for Multi-Center Autism Spectrum Disorder Identification

SSRN

引用

SSRN 2025年

作者： Zhang, Zhuan Wang, Lihui Chen, Qijian Wang, Li Jian, Caiqing Zhu, Yue-Min Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 Lyon69621 France

Due to the heterogeneous distributions of multi-center rs-fMRI data, currently it is still challenging to identify accurately autism spectrum disorder (ASD) patients from these heterogenous data. To deal with the influence of heterogeneous distributions on multi-center ASD diagnosis, a novel causal adversarial graph neural network (CAG) for multi-center ASD prediction is proposed in this work. CAG mainly consists of a graph filtering (GF) module and a learnable causal graph predictor (CGP). Specifically, the brain connection graph is first constructed from rs-fMRI data, after passing a GF module, the filtered graph is further divided by a causal subgraph and causally irrelevant subgraph. The ground-truth environmental labels and ASD labels are predicted from causal subgraph by a clustering method and a classification block, respectively. In addition, from the filtered graph and causally irrelevant subgraph, the environmental labels are predicted, while from the causally irrelevant subgraph the ASD labels are predicted. Assuming that the predicted environmental labels are independent to causal subgraph, while the predicted ASD labels are independent to causally irrelevant subgraph, accordingly, several adversarial losses are implemented by reversing the gradient. Through this adversarial learning strategy, the derived causal graph can predict multi-center ASD. The comparison experiments on both ABIDE-I and ABIDE-II datasets demonstrate that, the ACC and AUC of CAG has been improved by 3.78\% and 7.38\% at least comparing against the existing methods. Moreover, some abnormal functional connectivities in ASD group are identified from the causal subgraph which may provide useful imaging biomarkers for the early diagnosis of ASD. © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

An adaptive flow table adjustment algorithm for SDN 21

An adaptive flow table adjustment algorithm for SDN

引用

作者： Xu, Xiaolong Hu, Liuyun Lin, Haowei Fan, Zexuan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

SDN (Software-defined networking) are important for current network systems, such as cloud systems. The characteristics of flow in SDN and the impact of flow table entries and controllers on data packet transmission are analyzed. We propose an adaptive flow table adjustment algorithm for SDN called CFC (Combine flow table and controller). It is important for CFC to monitor the network traffic in real time. According to the proportion of active flow entries in the OpenFlow switch, the value of idle-timeout will be set dynamically based on the characteristics of different data flows. When the switch forwards packets, it will minimize the calculation load of controller, and allocate a reasonable value of idle-timeout to the idle flow table entries. So it can delete discarded flow table entries in time and improve the hit rate of data packets. The experiments show that the utilization rate of the flow table resource is enhanced. With the improvement of data packets' forwarding rate, the average throughput of the network has also increased. At the same time, it can also cope with the burst traffic in SDN and ensure them to be forwarded normally and effectively. © 2019 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Flight Path Optimization for UAVs to Provide Location Service to Ground Targets

Flight Path Optimization for UAVs to Provide Location Servic...

引用

IEEE Conference on Wireless Communications and Networking

作者： Youpeng Wang Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

We consider using UAVs to provide location service to ground targets. UAVs fly over the target area and broadcast their locations periodically via wireless signals. When a UAV flies along a straight line, a target will observe the strongest signal when the UAV is at the closest location, based on which it can infer its location. The problem is to minimize the flight length subject to the constraint that the transmission range of a UAV is limited and all targets in the area should be located. We formulate the problem and give an optimal flight path to cover a square with side length no greater than a certain value. In the general case when the given area cannot be covered by the square, we propose to divide UAVs into two groups, whose flight paths are either parallel or orthogonal. We conduct simulations to compare our approach with existing approaches. Results verify the superiority of our approach in terms of flight length and localization error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Holographic capture and projection system of real object based on tunable zoom lens

引用

PhotoniX 2020年第1期1卷 271-285页

作者： Di Wang Chao Liu Chuan Shen Yan Xing Qiong-Hua Wang School of Instrumentation and Optoelectronic Engineering Beihang UniversityBeijing 100191China Beijing Advanced Innovation Center for Big Data-based Precision Medicine Beihang UniversityBeijing 100191China Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei 230039China.

In this paper, we propose a holographic capture and projection system of real objectsbased on tunable zoom lenses. Different from the traditional holographic system, aliquid lens-based zoom camera and a digital conical lens are used as key parts to reachthe functions of holographic capture and projection, respectively. The zoom camera isproduced by combing liquid lenses and solid lenses, which has the advantages of fastresponse and light weight. By electrically controlling the curvature of the liquid-liquidsurface, the focal length of the zoom camera can be changed easily. As anothertunable zoom lens, the digital conical lens has a large focal depth and the opticalproperty is perfectly used in the holographic system for adaptive projection, especiallyfor multilayer imaging. By loading the phase of the conical lens on the spatial lightmodulator, the reconstructed image can be projected with large depths. With theproposed system, holographic zoom capture and color reproduction of real objects canbe achieved based on a simple structure. Experimental results verify the feasibility ofthe proposed system. The proposed system is expected to be applied to microprojectionand three-dimensional display technology.

关键词： Spatial light modulator Holographic system Zoom lenses Display technology

来源：评论

学校读者我要写书评

暂无评论

Spatial fuzzy C-means clustering and deep belief network for change detection in synthetic aperture radar images 5

Spatial fuzzy C-means clustering and deep belief network for...

引用

IET International Radar Conference 2020, IET IRC 2020

作者： Qi, Wenwen Wu, Lin Guo, Zhengwei Huang, Dan College of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng475004 China College of Environment and Planning Henan University Kaifeng475004 China Department of Laboratory and Equipment Management Henan University Kaifeng475004 China

ISBN: (纸本)9781839535635

In this study, spatial fuzzy c-means (SFCM) clustering and deep belief network (DBN) method is presented for change detection in SAR images. There are three primary steps of this approach, they are given as follows: 1) Difference Image (DI) is firstly obtained by calculating the similarity of gray levels between multitemporal SAR images. 2) SFCM clustering is used to analyze DI, which combines the spatial information factor and the fuzzy cluster membership function, thus can effectively eliminate the interference of speckle noise. 3) DBN, a powerful data processing methodology that integrates deep learning techniques to extract underlying features and structures of complicated data, is trained to classify pixels to be changed or unchanged. The effectiveness and robustness of the proposed method are verified by experimental results with the Ottawa dataset. © 2020 Institution of Engineering and Technology. All rights reserved.

关键词： Membership functions

来源：评论

学校读者我要写书评

暂无评论

More with Less – Deriving More Translation Rules with Less Training data for DBTs Using Parameterization

More with Less – Deriving More Translation Rules with Less ...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Jinhu Jiang Rongchao Dong Zhongjun Zhou Changheng Song Wenwen Wang Pen-Chung Yew Weihua Zhang Shanghai Key Laboratory of Data Science Fudan University University of Georgia University of Minnesota Twin Cities Big Data Institute Fudan University Human Phenome Institute Fudan University Shanghai Institute of Intelligent Electronics & Systems

ISBN: (数字)9781728173832

ISBN: (纸本)9781728173849

Dynamic binary translation (DBT) is widely used in system virtualization and many other important applications. To achieve a higher translation quality, a learning-based approach has been recently proposed to automatically learn semantically-equivalent translation rules. Because translation rules directly impact the quality and performance of the translated host codes, one of the key issues is to collect as many translation rules as possible through minimal training data set. The collected translation rules should also cover (i.e. apply to) as many guest binary instructions or code sequences as possible at the runtime. For those guest binary instructions that are not covered by the learned rules, emulation has to be used, which will incur additional runtime overhead. Prior learning-based DBT systems only achieve an average of about 69% dynamic code coverage for SPEC CINT *** this paper, we propose a novel parameterization approach to take advantage of the regularity and the well-structured format in most modern ISAs. It allows us to extend the learned translation rules to include instructions or instruction sequences of similar structures or characteristics that are not covered in the training set. More translation rules can thus be harvested from the same training set. Experimental results on QEMU 4.1 show that using such a parameterization approach we can expand the learned 2,724 rules to 86,423 applicable rules for SPEC CINT 2006. Its code coverage can also be expanded from about 69.7% to about 95.5% with a 24% performance improvement compared to enhanced learning-based approach.

关键词： Training Runtime Microarchitecture Emulation Training data Prototypes Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：