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

Continuous-Time Prediction of Industrial Paste Thickener System With Differential ODE-Net

IEEE/CAA Journal of Automatica Sinica 2022年第4期9卷 686-698页

作者： Zhaolin Yuan Xiaorui Li Di Wu Xiaojuan Ban Nai-Qi Wu Hong-Ning Dai Hao Wang the Beijing Advanced Innovation Center for Materials Genome Engineering Institute of Artificial IntelligenceBeijing Key Laboratory of Knowledge Engineering for Materials ScienceSchool of Computer and Communication EngineeringUniversity of Science and Technology Beijing the Department of ICT and Natural Science Norwegian University of Science and Technology IEEE the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and SystemsMacao University of Science and Technology the Department of Computing and Decision Sciences Lingnan University the Department of Computer Science Norwegian University of Science and Technology

It is crucial to predict the outputs of a thickening system,including the underflow concentration(UC)and mud pressure,for optimal control of the *** proliferation of industrial sensors and the availability of thickening-system data make this ***,the unique properties of thickening systems,such as the non-linearities,long-time delays,partially observed data,and continuous time evolution pose challenges on building data-driven predictive *** address the above challenges,we establish an integrated,deep-learning,continuous time network structure that consists of a sequential encoder,a state decoder,and a derivative module to learn the deterministic state space model from thickening *** a case study,we examine our methods with a tailing thickener manufactured by the FLSmidth installed with massive sensors and obtain extensive experimental *** results demonstrate that the proposed continuous-time model with the sequential encoder achieves better prediction performances than the existing discrete-time models and reduces the negative effects from long time delays by extracting features from historical system *** proposed method also demonstrates outstanding performances for both short and long term prediction tasks with the two proposed derivative types.

关键词： Industrial 24 paste thickener ordinary differential equation(ODE)-net recurrent neural network time series prediction

来源：评论

学校读者我要写书评

暂无评论

A Review on Binary Code Analysis Datasets 18th

A Review on Binary Code Analysis Datasets

引用

18th International Conference on Wireless Artificial Intelligent Computing systems and Applications, WASA 2024

作者： Huang, Zhijian Song, Shuguang Liu, Han Kuang, Hongyu Zhang, Jingjing Hu, Pengfei National Key Laboratory of Science and Technology on Information System Security Systems Engineering Institute Academy of Military Sciences Beijing China School of Computer Science and Technology Shandong University Qingdao China

ISBN: (纸本)9783031714696

Binary code analysis serves as the foundation for research in vulnerability discovery, software protection, and malicious code analysis. However, analyzing binary files is challenging due to the lack of high-level semantic information, leading to heavy dependence on analysts’ expertise and significantly impacting the efficiency of binary code analysis. Recent years has witnessed the blossom of machine learning models for binary analysis, but few researches address the problem of binary code datasets. In this paper, we review all the existing and available datasets, and make classification according to their application. We set up experiments to illustrate how dataset quality could affect the performance of machine learning models in binary function recognition. Based on the experimental evaluation, we present a discussion on the ground truth as well as quality evaluation problems for binary code datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

A Connectivity-Enhanced Multi-Task Learning based on Anatomical Priors for 3D Class-Balanced Pulmonary Airway Segmentation

A Connectivity-Enhanced Multi-Task Learning based on Anatomi...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Jia, Yan Dou, Yong Qiao, Peng Cheng, Yuqing Xu, Kele He, Zhouyu National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology Changsha China National University of Defense Technology College of Systems Engineering Changsha China

ISBN: (纸本)9798350386226

Accurate and efficient airway segmentation is essential for evaluating pulmonary diseases, aiding diagnosis, reducing the preoperative burden of airway identification, and minimizing patient discomfort during prolonged surgeries. However, current pulmonary airway reconstruction techniques are hindered by two major challenges: difficulty in accurately reconstructing fine airway branches due to the tendency to overlook small targets, and insufficient structural connectivity leading to frequent branch discontinuities within the airway tree. These limitations directly affect the clinical applicability of reconstructed airways. To overcome these challenges, a novel 3D pulmonary airway segmentation multi-task framework is proposed, designed to enhance the performance of existing backbone models. This approach integrates Anatomical Prior-Based Multi-Task Learning (AP-MTL) through the use of Gaussian-constructed connectivity-enhanced isosurfaces, significantly improving the network's ability to maintain airway continuity. Additionally, a Class-Balanced CT Density Distribution Reconstruction mechanism (DDR-CB) is introduced, further refining the model's capability to detect and segment fine airway branches. As a result of these enhancements, the model demonstrates a 11.5% average improvement in segmentation accuracy and connectivity compared to the baseline. The source code is publicly accessible at https://***/inexhaustible419/APMTLAirwaySegment. © 2024 IEEE.

关键词： Pulmonary diseases

来源：评论

学校读者我要写书评

暂无评论

SUCP Analysis for Region-Centric UAV-Assisted MEC Networks 20th

SUCP Analysis for Region-Centric UAV-Assisted MEC Networks

引用

20th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2024

作者： Li, Yan Yi, Zhaozhi Long, Qingmin Luo, Lailong Guo, Deke School of Computer and Communication Engineering Changsha University of Science and Technology Changsha410004 China National Key Laboratory of Information Systems Engineering National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789819628636

With the increase of computing-intensive and delay-sensitive applications, mobile edge computing (MEC) technology has sprung up. It effectively satisfies the needs of user equipment (UE) for real-time computing resources by placing servers at the edge of the network. However, traditional MEC infrastructures are constrained by their fixed locations and emergency mobility needs. Unmanned aerial vehicles (UAVs) offer an effective solution with low cost, high mobility, and flexible deployment capabilities. In this paper, we propose a region-centric UAV-assisted MEC model, where the whole network space is divided into a set of hexagonal cells of equal area, and all UAVs in the same cell jointly process UE offloading data. Assume all UAVs are assumed to be equipped with independent MEC servers, and both UAVs and terrestrial UE follow independent homogeneous Poisson point process (PPP) distributions. Using the stochastic geometry analysis framework, we derive the successful uplink communication probability (SUCP) of uplink transmission for users. Finally, we compare the simulation results with the theoretical values to verify the model’s accuracy and evaluate the influence of key performance parameters on the network performance. © IFIP International Federation for Information Processing 2025.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Distinguishing Sensitive and Insensitive Options for the Winograd Schema Challenge 28th

Distinguishing Sensitive and Insensitive Options for the ...

引用

28th International Conference on Database systems for Advanced Applications, DASFAA 2023

作者： Li, Dong Wang, Pancheng He, Liangliang Pang, Kunyuan Li, Shasha Tang, Jintao Wang, Ting College of Computer Science and Technology National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems Changsha China

ISBN: (纸本)9783031306747

The Winograd Schema Challenge (WSC) is a popular benchmark for commonsense reasoning. Each WSC instance has a component that corresponds to the mention of the correct answer option of the two options in the context. We observe that the answers of many instances are insensitive to the options. In this paper, based on this observation, we propose an approach based on fine-tuning the pre-trained language model for WSC by distinguishing sensitive and insensitive options. First, we split WSC instances into option-sensitive and insensitive categories, and use option expanding and option masking strategies to weaken the options so that the model does not pay attention to options when they are insensitive during fine-tuning. Second, we treat the two categories as intermediate-task of each other, and use transfer learning to improve the performance. We fine-tune BERT-Large and T5-XXL with our approach on WINOGRANDE, a new dataset of WSC, and the experiment shows our method outperforms baselines by a large margin, achieving state-of-the-art, which indicates the effectiveness of our instance-distinguishing strategy. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Parallelism or Fairness? How to Be Friendly for SSDs in Cloud Environments

Parallelism or Fairness? How to Be Friendly for SSDs in Clou...

引用

2024 IEEE International Conference on Cluster Computing, CLUSTER 2024

作者： Zhou, Yang Wang, Fang Shi, Zhan Feng, Dan Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798350358711

Modern SSDs achieve low latency and high throughput by utilizing multiple levels of SSD parallelism. Fairness is also a critical design consideration in cloud environments and has inspired great interest in recent years to study it. However, we find that excessive striving for SSD parallelism can inadvertently harm the SSD fairness due to the striped data layout. We observe from our experimental analysis that some common access patterns in cloud loads (e.g., high-intensity I/O) are not addressed by SSD parallelism, which can affect both SSD parallelism and fairness. In this paper, we analyze two address mapping policies with orthogonal characteristics from SSD parallelism and fairness perspectives. Based on extensive experiments and observations, we schedule a hybrid address mapping policy to achieve fairness of SSDs in cloud environments by distinguishing different I/O access modes and cold/hot data, while ensuring SSD performance. Experimental results on the latest block-level I/O traces show that our approach significantly improves performance and fairness by up to 77.3% and 62.8%, respectively, over the previous schemes with negligible cost. Meanwhile, it can also reduce the write amplification by 23.5% to 33.5%. © 2024 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Fast Approximate LUT-based Vector Multiplication in DRAM 29

Fast Approximate LUT-based Vector Multiplication in DRAM

引用

29th IEEE International Conference on Parallel and Distributed systems, ICPADS 2023

作者： Chen, Ziming Deng, Quan Wang, Yongwen National University of Defense Technology College of Computer Changsha China Key Laboratory of Advanced Microprocessor Chips and Systems China

ISBN: (纸本)9798350330717

Vector multiplication is widely used in real-world applications. To accelerate vector multiplication, processing-in-memory-based domain-specific architectures leverage lookup tables (LUTs) to decrease the computational complexity of multi-plication. However, the overhead of LUTs increases exponentially with the result space, which throttles the system *** decouple the LUT size and the performance improvement, we make a trade-off between accuracy and performance. We propose fast approximate LUT-based vector multiplication in DRAM, which builds the partial LUT of higher-bit locations and reuses the LUT to calculate the lower-bit data. We propose an operand reorganizing optimization to group more zero, which does not affect the results. To reduce the LUT and pre-calculation cost further, we propose a value encoding. Our experiment shows that the performance of the proposed design can be improved by 4x and 1.25x compared with LAcc in AlexNet and MobileNetV2 without any accuracy loss, respectively. Besides, the performance of the proposed design improves by up to 3.74x compared with pLUTo in multi-vector multiplication. The area and power of the proposed design are 54.8mm2 and 5.35W, respectively. © 2023 IEEE.

关键词： approximate calculation In-DRAM computing lookup table value-based optimization vector multiplication

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Classification Using Content-Based Transformer via Clustering in Feature Space

引用

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 231-239页

作者： Yahui Liu Bin Tian Yisheng Lv Lingxi Li Fei-Yue Wang the State Key Laboratory for Management and Control of Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190 the School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100190 IEEE the Transportation and Autonomous Systems Institute(TASI)and the Department of Electrical and Computer Engineering Purdue School of Engineering and TechnologyIndiana University-Purdue University Indianapolis(IUPUI)Indianapolis 46202 USA

Recently, there have been some attempts of Transformer in 3D point cloud classification. In order to reduce computations, most existing methods focus on local spatial attention,but ignore their content and fail to establish relationships between distant but relevant points. To overcome the limitation of local spatial attention, we propose a point content-based Transformer architecture, called PointConT for short. It exploits the locality of points in the feature space(content-based), which clusters the sampled points with similar features into the same class and computes the self-attention within each class, thus enabling an effective trade-off between capturing long-range dependencies and computational complexity. We further introduce an inception feature aggregator for point cloud classification, which uses parallel structures to aggregate high-frequency and low-frequency information in each branch separately. Extensive experiments show that our PointConT model achieves a remarkable performance on point cloud shape classification. Especially, our method exhibits 90.3% Top-1 accuracy on the hardest setting of ScanObjectN N. Source code of this paper is available at https://***/yahuiliu99/PointC onT.

关键词： Content-based Transformer deep learning feature aggregator local attention point cloud classification

来源：评论

学校读者我要写书评

暂无评论

Dual Adaptive Representation Alignment for Cross-Domain Few-Shot Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2023年第10期45卷 11720-11732页

作者： Zhao, Yifan Zhang, Tong Li, Jia Tian, Yonghong Peking University The School of Computer Science Beijing100871 China Beihang University The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China The Pengcheng Laboratory Guangdong Shenzhen518055 China Peking University Shenzhen Granduate School The School of Electronic and Computer Engineering Guangdong Shenzhen518055 China

Few-shot learning aims to recognize novel queries with limited support samples by learning from base knowledge. Recent progress in this setting assumes that the base knowledge and novel query samples are distributed in the same domains, which are usually infeasible for realistic applications. Toward this issue, we propose to address the cross-domain few-shot learning problem where only extremely few samples are available in target domains. Under this realistic setting, we focus on the fast adaptation capability of meta-learners by proposing an effective dual adaptive representation alignment approach. In our approach, a prototypical feature alignment is first proposed to recalibrate support instances as prototypes and reproject these prototypes with a differentiable closed-form solution. Therefore feature spaces of learned knowledge can be adaptively transformed to query spaces by the cross-instance and cross-prototype relations. Besides the feature alignment, we further present a normalized distribution alignment module, which exploits prior statistics of query samples for solving the covariant shifts among the support and query samples. With these two modules, a progressive meta-learning framework is constructed to perform the fast adaptation with extremely few-shot samples while maintaining its generalization capabilities. Experimental evidence demonstrates our approach achieves new state-of-the-art results on 4 CDFSL benchmarks and 4 fine-grained cross-domain benchmarks. © 1979-2012 IEEE.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Decoupling General and Personalized Knowledge in Federated Learning via Additive and Low-rank Decomposition 24

Decoupling General and Personalized Knowledge in Federated L...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wu, Xinghao Liu, Xuefeng Niu, Jianwei Wang, Haolin Tang, Shaojie Zhu, Guogang Su, Hao State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Zhongguancun Laboratory Beijing China Department of Management Science and Systems University at Buffalo BuffaloNY United States School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9798400706868

To address data heterogeneity, the key strategy of Personalized Federated Learning (PFL) is to decouple general knowledge (shared among clients) and client-specific knowledge, as the latter can have a negative impact on collaboration if not removed. Existing PFL methods primarily adopt a parameter partitioning approach, where the parameters of a model are designated as one of two types: parameters shared with other clients to extract general knowledge and parameters retained locally to learn client-specific knowledge. However, as these two types of parameters are put together like a jigsaw puzzle into a single model during the training process, each parameter may simultaneously absorb both general and client-specific knowledge, thus struggling to separate the two types of knowledge effectively. In this paper, we introduce FedDecomp, a simple but effective PFL paradigm that employs parameter additive decomposition to address this issue. Instead of assigning each parameter of a model as either a shared or personalized one, FedDecomp decomposes each parameter into the sum of two parameters: a shared one and a personalized one, thus achieving a more thorough decoupling of shared and personalized knowledge compared to the parameter partitioning method. In addition, as we find that retaining local knowledge of specific clients requires much lower model capacity compared with general knowledge across all clients, we let the matrix containing personalized parameters be low rank during the training process. Moreover, a new alternating training strategy is proposed to further improve the performance. Experimental results across multiple datasets and varying degrees of data heterogeneity demonstrate that FedDecomp outperforms state-of-the-art methods up to 4.9%. The code is available at https://***/XinghaoWu/FedDecomp © 2024 ACM.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：