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

arXiv 2022年

作者： Feng, Xin-Ru Li, Heng-Chao Wang, Rui Du, Qian Jia, Xiuping Plaza, Antonio School of Information Science and Technology Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Department of Electrical and Computer Engineering Mississippi State University Mississippi State MS39762 United States School of Engineering and Information Technology University of New South Wales CanberraACT2612 Australia Hyperspectral Computing Laboratory Department of Technology of Computers and Communications Escuela Politécnica University of Extremadura Cáceres10071 Spain

Hyperspectral unmixing has been an important technique that estimates a set of endmembers and their corresponding abundances from a hyperspectral image (HSI). Nonnegative matrix factorization (NMF) plays an increasingly significant role in solving this problem. In this article, we present a comprehensive survey of the NMF-based methods proposed for hyperspectral unmixing. Taking the NMF model as a baseline, we show how to improve NMF by utilizing the main properties of HSIs (e.g., spectral, spatial, and structural information). We categorize three important development directions including constrained NMF, structured NMF, and generalized NMF. Furthermore, several experiments are conducted to illustrate the effectiveness of associated algorithms. Finally, we conclude the article with possible future directions with the purposes of providing guidelines and inspiration to promote the development of hyperspectral unmixing. Copyright © 2022, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

On-edge multi-task transfer learning: Model and practice with data-driven task allocation

arXiv

引用

arXiv 2021年

作者： Zheng, Zimu Chen, Qiong Hu, Chuang Wang, Dan Liu, Fangming The National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China The Edge Cloud Innovation Lab. Technical Innovation Department Cloud BU Huawei Technologies Co. Ltd. Shenzhen China The Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Hong Kong

On edge devices, data scarcity occurs as a common problem where transfer learning serves as a widely-suggested remedy. Nevertheless, transfer learning imposes heavy computation burden to the resource-constrained edge devices. Existing task allocation works usually assume all submitted tasks are equally important, leading to inefficient resource allocation at a task level when directly applied in Multi-task Transfer Learning (MTL). To address these issues, we first reveal that it is crucial to measure the impact of tasks on overall decision performance improvement and quantify task importance. We then show that task allocation with task importance for MTL (TATIM) is a variant of NP-complete Knapsack problem, where the complicated computation to solve this problem needs to be conducted repeatedly under varying contexts. To solve TATIM with high computational efficiency, we propose a data-driven Cooperative Task Allocation (DCTA) approach. Finally, we evaluate the performance of DCTA by not only a trace-driven simulation, but also a new comprehensive real-world AIOps case study which bridges model and practice via a new architecture and main components design within AIOps system. Extensive experiments show that our DCTA reduces 3.24 times of processing time, and saves 48.4% energy consumption compared with the state-of-the-art when solving TATIM. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

A Viewport Prediction Framework for Panoramic Videos

A Viewport Prediction Framework for Panoramic Videos

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jinting Tang Yongkai Huo Shaoshi Yang Jianmin Jiang National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

Panoramic video is considered to be an attractive video format, since it provides the viewers with an immersive experience, such as virtual reality (VR) gaming. However, the viewers only focus on part of panoramic video, which is referred to as viewport. Hence, the resources consumed for distributing the remaining part of the panoramic video are wasted. It is intuitive to only deliver the video data within this viewport for reducing the distribution cost. Empirically, viewports within a time interval are highly correlated, hence the historical trajectory may be used for predicting the future viewports. On the other hand, a viewer tends to sustain attention on a specific object in a panoramic video. Motivated by these findings, we propose a deep learning-based viewport Prediction scheme, namely HOP, where the Historical viewport trajectory of viewers and Object tracking are jointly exploited by the long short-term memory (LSTM) networks. Additionally, our solution is capable of predicting multiple future viewports, while a single viewport prediction was supported by the state-of-the-art contributions. Simulation results show that our proposed HOP scheme outperforms the benchmarkers by up to 33.5% in terms of the prediction error.

关键词： Trajectory Videos Bandwidth Object tracking Computer architecture Resists Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Multi-stage network embedding for exploring heterogeneous edges

arXiv

引用

arXiv 2021年

作者： Huang, Hong Song, Yu Ye, Fanghua Xie, Xing Shi, Xuanhua Jin, Hai The National Engineering Research Center for Big Data Technology Service Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China The Department of Computer Science University College London London United Kingdom Microsoft Research Asia Beijing China

The relationships between objects in a network are typically diverse and complex, leading to the heterogeneous edges with different semantic information. In this paper, we focus on exploring the heterogeneous edges for network representation learning. By considering each relationship as a view that depicts a specific type of proximity between nodes, we propose a multi-stage non-negative matrix factorization (MNMF) model, committed to utilizing abundant information in multiple views to learn robust network representations. In fact, most existing network embedding methods are closely related to implicitly factorizing the complex proximity matrix. However, the approximation error is usually quite large, since a single low-rank matrix is insufficient to capture the original information. Through a multi-stage matrix factorization process motivated by gradient boosting, our MNMF model achieves lower approximation error. Meanwhile, the multi-stage structure of MNMF gives the feasibility of designing two kinds of non-negative matrix factorization (NMF) manners to preserve network information better. The united NMF aims to preserve the consensus information between different views, and the independent NMF aims to preserve unique information of each view. Concrete experimental results on realistic datasets indicate that our model outperforms three types of baselines in practical applications. © 2021, CC BY.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Scheduling in FPGA-Based Convolutional Neural Networks

Fine-grained Scheduling in FPGA-Based Convolutional Neural N...

引用

IEEE International Conference on Cloud computing and big data Analysis (ICCCBDA)

作者： Wei Zhang Xiaofei Liao Hai Jin 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 Wuhan China

ISBN: (数字)9781728160245

ISBN: (纸本)9781728160252

FPGA has been considered as a promising solution to accelerate Convolutional Neural Networks (CNNs) for its excellent performance in energy efficiency and programmability. However, prior designs are usually designed for inference only as designers can map pre-trained models to the hardware in a very efficient way. However, those approaches may not be suitable for training CNN models. In this paper, we propose FConv, in which the CPU and FPGA work together in a fine-grained manner. The FPGA accelerator in FConv uses one Winograd-based convolver, which reduces the design complexity and improves performance. We apply double-buffer for output routine to effectively overlap computation and data transfer. We also integrate multiple PEs to improve data parallelism. We propose our analytical model for prediction and use it as a guide in task scheduling. We find the upper limit of performance under the current design based on the analytical model. We evaluate our design on VGG-16 and Densnet-40 on ImageNet and CIFAR-10. We achieve 262.43 GOP/s on the VGG-16 model, which is 2.13× of the performance compared to FFT-based implementation on the same platform. We also achieve at most 4×+ performance improvement compared MKL with 20 threads running on 10 core Intel processors.

关键词： Field programmable gate arrays Computational modeling Training Convolution Acceleration Bandwidth Task analysis

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology 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 Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Optimal Margin Distribution Machine with Sparsity Inducing Penalty

Optimal Margin Distribution Machine with Sparsity Inducing P...

引用

International Conference on big data and Smart computing (bigCOMP)

作者： Teng Zhang Hai Jin 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 Wuhan China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Recently a promising research direction of statistical learning has been advocated, i.e., the optimal margin distribution learning, with the central idea of optimizing the margin distribution. As the most representative approach of this new learning paradigm, the optimal margin distribution machine (ODM) considers maximizing the margin mean and minimizing the margin variance simultaneously. The standard ODM exploits the ℓ_2-norm penalty, which gives rise to a dense decision boundary. However, in some situations, the model with parsimonious representation is more preferred, due to the redundant noisy features or limited computing resources. In this paper, we propose the sparse optimal margin distribution machine (Sparse ODM), which aims to achieve better generalization performance with moderate model size. For optimization, we extends an efficient coordinate descent method to solve the final problem since the variables are decoupled. In each iteration, we propose a modified Newton method to solve the one-variable sub-problem. Experimental results on both synthetic and real data sets show the superiority of the proposed method.

关键词： Standards Newton method Noise measurement Optimization Support vector machines Computational modeling Training

来源：评论

学校读者我要写书评

暂无评论

Integrated Public Transport Timetable Coordination and Vehicle Scheduling with Even Headways

SSRN

引用

SSRN 2022年

作者： Liu, Tao Ji, Wen Gkiotsalitis, Konstantinos Cats, Oded National Engineering Laboratory of Integrated Transportation Big Data Application Technology School of Transportation and Logistics Southwest Jiaotong University Chengdu611756 China Institute of System Science and Engineering School of Transportation and Logistics Southwest Jiaotong University Chengdu611756 China Department of Civil Engineering Faculty of Engineering Technology University of Twente Horst Complex Z222 P.O. Box 217 Enschede 7500 AE Netherlands Department of Transport & Planning Delft University of Technology Netherlands

Timetabling and vehicle scheduling are two important activities in public transport (PT) operations planning. Traditionally, the timetabling problem is solved first before proceeding to the vehicle scheduling problem. The integration of these two problems can help further reduce the total operation cost and improve the level of service, especially when timetables of different bus lines are well-coordinated at transfer stations. This work addresses the integrated PT timetable coordination and vehicle scheduling problem while ensuring that each PT line is dispatched with an even headway. We first separately formulate two integer linear programming models for the timetable coordination and vehicle scheduling problems. Next, the two models are combined into a bi-objective integer linear programming model for the integrated timetable coordination and vehicle scheduling problem. For small size PT networks, the model can be solved by using an ɛ -constraint method, together with off-the-shelf optimization solvers. For large-size problems, two constraint reduction procedures are developed to reduce the number of redundant constraints so as to reduce the computation complexity and improve the solution process. Finally, the models and solution method are applied to a numerical example and a real-world bus rapid transit (BRT) network in Chengdu, China. Computation results show that the solution generated by the sequential optimization approach is usually dominated by the Pareto-optimal solutions generated by the integrated optimization approach. Our findings suggest that it is not a wise decision to use the solution generated by the sequential optimization approach or the solution with the minimum fleet size generated by the integrated optimization approach. For practical implementation, it is recommended to choose the solution that has a fleet size of one more vehicle than the minimum fleet size. © 2022, The Authors. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

FUSDREAMER: Label-efficient Remote Sensing World Model for Multimodal data Classification

arXiv

引用

arXiv 2025年

作者： Wang, Jinping Song, Weiwei Chen, Hao Ren, Jinchang Zhao, Huimin School of Computer Sciences Guangdong Polytechnic Normal University Guangzhou510665 China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangdong Polytechnic Normal University Guangzhou510665 China Peng Cheng Laboratory Shenzhen518000 China Department of Applied Mathematics and Theoretical Physics University of Cambridge CambridgeCB3 0WA United Kingdom School of Computer Sciences Guangdong Polytechnic Normal University Guangzhou510640 China National Subsea Centre School of Computing Engineering and Technology Robert Gordon University AberdeenAB10 7AQ United Kingdom

World models significantly enhance hierarchical understanding, improving data integration and learning efficiency. To explore the potential of the world model in the remote sensing (RS) field, this paper proposes a label-efficient remote sensing world model for multimodal data fusion (FusDreamer). The FusDreamer uses the world model as a unified representation container to abstract common and high-level knowledge, promoting interactions across different types of data, i.e., hyperspectral (HSI), light detection and ranging (LiDAR), and text data. Initially, a new latent diffusion fusion and multimodal generation paradigm (LaMG) is utilized for its exceptional information integration and detail retention capabilities. Subsequently, an open-world knowledge-guided consistency projection (OK-CP) module incorporates prompt representations for visually described objects and aligns language-visual features through contrastive learning. In this way, the domain gap can be bridged by fine-tuning the pre-trained world models with limited samples. Finally, an end-to-end multitask combinatorial optimization (MuCO) strategy can capture slight feature bias and constrain the diffusion process in a collaboratively learnable direction. Experiments conducted on four typical datasets indicate the effectiveness and advantages of the proposed FusDreamer. The corresponding code will be released at https://***/ Cimy-wang/FusDreamer. © 2025, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

High Performance DDoS Attack Detection system Based on Distribution Statistics 16th

High Performance DDoS Attack Detection System Based on Distr...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2019

作者： Xie, Xia Li, Jinpeng Hu, Xiaoyang Jin, Hai Chen, Hanhua Ma, Xiaojing Huang, Hong 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

ISBN: (纸本)9783030307080

Nowadays, web servers often face the threat of distributed denial of service attacks and their intrusion prevention systems cannot detect those attacks effectively. Many existing intrusion prevention systems detect attacks by the state of per-flow and current processing speed cannot fulfill the requirements of real-time detection due to the high speed traffic. In this paper, we propose a powerful system TreeSketchShield which can improve sketch data structure and detect attacks quickly. First, we discuss a novel structure TreeSketch to obtain statistics of network flow, which utilizes the stepped structure of binary tree to map the distribution and reduces the complexity of the statistic calculation. Second, we present a two-level detection scheme that could make a compromise between the detection speed and detection accuracy. Experimental results show that our method can process more than 100,000 records per second. The false alarm rate can achieve 2% to 25% performance improvement. © 2019, IFIP International Federation for Information Processing.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：