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

Solid state recycling of used aluminum alloy beverage cans by thermomechanical consolidation

Heat Treatment and Surface engineering 2022年第1期4卷 90-98页

作者： Wang, Ziyi Yu, Yuanping Jin, Yu Li, Zhuolun Sun, Song Xu, Haoran Wu, Chengxun Zhang, Deliang School of Material Science and Engineering Northeastern University Shenyang China Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University) Ministry of Education Shenyang China

Solid-state recycling of used aluminum alloy beverage cans was accomplished by thermomechanical consolidation of the sheet fragments produced by shredding the cans. Different samples were obtained using two thermomechanical consolidation routes, one involving direct hot extrusion of a sheet fragment compact and the other involving upset hot-forging of a sheet fragment compact followed by hot extrusion of the forged ingot. The microstructures and mechanical properties of the samples were investigated. It was found that the samples contained less pores and exhibited better mechanical properties with a higher extrusion temperature and involving upset forging than with only hot extrusion, the highest tensile strength is 209.5 MPa and the largest elongation to fracture is 29.1%. The surface layers of the samples exhibited a clearly higher strength and tensile ductility than the interior. They also showed significantly different fracture behaviors, with the former being like fully ductile fracture and the latter involving delamination of the sheet fragments, suggesting that the bonding between the fragments is significantly stronger in the surface layer, possibly due to a higher amount of plastic deformation in it. Overall, the best quality solid state recycled material has tensile properties comparable with those of wrought aluminum alloy with the same composition. © 2022 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： mechanical properties microstructure solid state recycling thermomechanical consolidation of sheet fragments Used aluminum beverage cans

来源：评论

学校读者我要写书评

暂无评论

PathReasoner: Modeling Reasoning Path with Equivalent Extension for Logical Question Answering

arXiv

引用

arXiv 2024年

作者： Xu, Fangzhi Lin, Qika Zhao, Tianzhe Han, Jiawei Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China

Logical reasoning task has attracted great interest since it was proposed. Faced with such a task, current competitive models, even large language models (e.g., ChatGPT and PaLM 2), still perform badly. Previous promising LMs struggle in logical consistency modeling and logical structure perception. To this end, we model the logical reasoning task by transforming each logical sample into reasoning paths and propose an architecture PathReasoner. It addresses the task from the views of both data and model. To expand the diversity of the logical samples, we propose an atom extension strategy supported by equivalent logical formulas, to form new reasoning paths. From the model perspective, we design a stack of transformer-style blocks. In particular, we propose a path-attention module to joint model in-atom and cross-atom relations with the high-order diffusion strategy. Experiments show that PathReasoner achieves competitive performances on two logical reasoning benchmarks and great generalization abilities. © 2024, CC BY.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms with Heuristic Gradient-based Repair for Constrained Optimization

Evolutionary Algorithms with Heuristic Gradient-based Repair...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Du, Jiacheng Bu, Chenyang Liu, Yuxin Liu, Fei Luo, Wenjian Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Anhui Hefei230027 China Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518000 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Gradient-based repair aims to repair infeasible solutions to feasible ones using the gradient information of the constraints. As an effective constraint handling method, gradientbased repair has received extensive attention and has been applied in various evolutionary algorithms (EAs). Nevertheless, due to the complexity of constraints in practical problems, a single infeasible solution often needs to be repaired multiple times until it becomes a feasible solution or reaches the maximum number of repairs. As far as we know, existing related research on gradient-based repair mainly applies this method directly to EAs, while there is little work in the evolutionary computing community on how to improve gradient-based repair. Currently, the multiple repairs for a single individual are independent. That is, the current repair does not consider the previous repair experience. However, only using gradient information to repair infeasible individuals may result in oscillations in the search process. Therefore, in this paper, we propose a heuristic gradient-based repair method (HGR) which exploits the previous repair information of an individual to alleviate this issue. Experimental results on several benchmarks demonstrate the effectiveness of the proposed method. The source code is available at https://***/DMiC-Lab-HFUT/HGR-SMC2022. © 2022 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Updating Large Language Models' Memories with Time Constraints

Updating Large Language Models' Memories with Time Constrain...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Wu, Xin Bu, Yuqi Cai, Yi Wang, Tao School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China Department of Biostatistics and Health Informatics King's College London United Kingdom

ISBN: (纸本)9798891761681

By incorporating the latest external knowledge, large language models (LLMs) can modify their internal memory. However, in practical applications, LLMs may encounter outdated information, necessitating the filtering of such data and updating of knowledge beyond internal memory. This paper explores whether LLMs can selectively update their memories based on the time constraints between internal memory and external knowledge. We evaluate existing LLMs using three types of data that exhibit different time constraints. Our experimental results reveal the challenges most LLMs face with time-constrained knowledge and highlight the differences in how various LLMs handle such information. Additionally, to address the difficulties LLMs encounter in understanding time constraints, we propose a two-stage decoupling framework that separates the identification and computation of time constraint into a symbolic system. Experimental results demonstrate that the proposed framework yields an improvement of over 60% in ChatGPT's performance, and achieves a 12-24% enhancement in state-of-the-art LLM GPT-4. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional data Anomaly Detection Method Based on Extended Isolation Forest 26

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Liu, Hanlin Zhou, Jiantao Li, Hua Inner Mongolia University College of Computer Science Hohhot China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Measuring drug similarity using drug–drug interactions

引用

Quantitative Biology 2024年第2期12卷 164-172页

作者： Ji Lv Guixia Liu Yuan Ju Houhou Huang Ying Sun College of Computer Science and Technology Jilin UniversityChangchunChina Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunChina Sichuan University Library Sichuan UniversityChengduChina College of Chemistry Jilin UniversityChangchunChina Department of Respiratory Medicine The First Hospital of Jilin UniversityChangchunChina

Combination therapy is a promising approach to address the challenge of antimicrobial resistance,and computational models have been proposed for predicting drug–drug *** existing models rely on drug similarity measures based on characteristics such as chemical structure and the mechanism of *** this study,we focus on the network structure itself and propose a drug similarity measure based on drug–drug interaction *** explore the potential applications of this measure by combining it with unsupervised learning and semi-supervised learning *** unsupervised learning,drugs can be grouped based on their interactions,leading to almost monochromatic group–group *** addition,drugs within the same group tend to have similar mechanisms of action(MoA).In semi-supervised learning,the similarity measure can be utilized to construct affinity matrices,enabling the prediction of unknown drug–drug *** method exceeds existing approaches in terms of ***,our experiments demonstrate the effectiveness and practicability of the proposed similarity *** the one hand,when combined with clustering algorithms,it can be used for functional annotation of compounds with unknown *** the other hand,when combined with semi-supervised graph learning,it enables the prediction of unknown drug–drug interactions.

关键词： drug similarity drug–drug interactions drug combinations synergy effect clustering semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Injecting Revenue-awareness into Cold-start Recommendation: The Case of Online Insurance 29

Injecting Revenue-awareness into Cold-start Recommendation: ...

引用

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

作者： Li, Yu Zhang, Yi Chang, Helen He Li, Qiang Jilin University College of Computer Science and Technology China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China WeSure Inc. Ping An Technology Shenzhen Co. Ltd China

ISBN: (纸本)9798350330717

In online insurance, one of the central challenges is the cold-starting of new insurance products, which means there are no previous samples to refer to. Previous studies have mainly focused on improving the prediction accuracy of new items, but they have failed to consider the revenue generated by existing items. As a result, the total revenue may suffer a loss even if new items get conversions. To address this issue, in this paper we propose RACRec, a Revenue-Aware Cold-start Recommendation framework for online insurance. Unlike previous works, RACRec uses a revenue-based objective function to ensure profitability when cold-starting new items. With this dedicated objective, RACRec orchestrates the cold-start and warm-start model by predicting their expected revenue from each user, thereby preserving the total profit. In order to accurately predict revenue, a double-ranking scheme is designed for the warm-start model to mitigate position bias, while an item embedding alignment algorithm is proposed for the cold-start model to learn the revenue of new items from similar old items. Furthermore, a reinforced orchestrate update scheme is designed to eliminate the impact of sparse conversions and continuously update revenue estimation. Extensive offline and online experiments have been conducted to validate the effectiveness of RACRec. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Target Track Initiation in Heavy Clutter

引用

Computers, Materials & Continua 2022年第9期72卷 4489-4507页

作者： Li Xu Ruzhen Lou Chuanbin Zhang Bo Lang Weiyue Ding College of Computer Science and Technology Harbin Engineering UniversityHarbin150001China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China Norinco Group Air Ammunition Research Institute Co.Ltd. Harbin150036China Harvard Medical School Boston02115USA

In the heavy clutter environment, the information capacity is large,the relationships among information are complicated, and track initiationoften has a high false alarm rate or missing alarm rate. Obviously, it is adifficult task to get a high-quality track initiation in the limited measurementcycles. This paper studies the multi-target track initiation in heavy *** first, a relaxed logic-based clutter filter algorithm is presented. In thealgorithm, the raw measurement is filtered by using the relaxed logic *** not only design a kind of incremental and adaptive filtering gate, but alsoadd the angle extrapolation based on polynomial extrapolation. The algorithm eliminates most of the clutter and obtains the environment with highdetection rate and less clutter. Then, we propose a fuzzy sequential Houghtransform-based track initiation algorithm. The algorithm establishes a newmeshing rule according to system noise to balance the relationship between thegrid granularity and the track initiation quality. And a flexible superpositionmatrix based on fuzzy clustering is constructed, which avoids the transformation error caused by 0–1 voting method in traditional Hough *** addition, the algorithm allows the superposition matrixes of nonadjacentcycles to be associated to overcome the shortcoming that the track can’t beinitiated in time when the measurements appear in an intermittent way. Anda slope verification method is introduced to detect formation-intensive serialtracks. Last, the sliding window method is employed to feedback the trackinitiation results timely and confirm the track. Simulation results verify thatthe proposed algorithms can initiate the tracks accurately in heavy clutter.

关键词： Track initiation heavy clutter multi-target Hough transform

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Average Consensus for Directed Graphs via State Decomposition and External Input

Privacy-Preserving Average Consensus for Directed Graphs via...

引用

第43届中国控制会议

作者： Jimin Wang Mengjie Xu School of Automation and Electrical Engineering University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

This paper investigates the privacy-preserving average consensus problem for directed graphs.A privacy-preserving method is designed based on the state decomposition and external *** node arbitrarily decomposes its initial state into two substates,one of the substates is exchanged with neighbors and the other substate is retained to prevent leakage of initial state *** reduce the communication burdens,a new method instead of the push-sum algorithm is provided by introducing the external *** on this,the average consensus is achieved for the strongly connected graph.A privacy parameter during the decomposition process is designed to meet the different privacy needs of different ***,we show that this algorithm can effectively protect the privacy of the node's initial state,and meet the different privacy needs of different ***,the validity of the results is verified through a numerical example.

关键词： Average consensus privacy-preserving sate decomposition external input

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：