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

Optimizing mechanical strength and thermal stability of sisal fiber-plastic composites by high-temperature treatment

引用

Interactions 2025年第1期246卷 1-15页

作者： Mungle, Nischal P. Jadhav, Varsha D. Kulkarni, Sumant Khanderao D.S.Vijayan Saminathan, Rajasekaran Satishkumar, P. Department of Mechanical Engineering Yeshawantrao Chavan College of Engineering Maharashtra Wanadongari Nagpur India Department of Artificial Intelligence and Data Science Vishwakarma Institute of Technology Maharashtra Pune India School of Civil Engineering REVA University Rukmini Knowledge Park Karnataka Kattigenahalli Bengaluru India Tamilnadu Chennai India Department of Mechanical Engineering College of Engineering and Computer Science Jazan University Jazan Saudi Arabia Department of Mechanical Engineering Rathinam Technical Campus Tamilnadu Coimbatore India

In this experiment, high-temperature polyethylene terephthalate (PT) was mixed with epoxy resin (ER) that had been thinned with acetone. Sisal fibers were coated with the resulting product. Composites of Coated treated sisal fibre-reinforced PT (CTSF-PT) were made using a constant fiber loading of 10 wt% and processing temperatures of 230, 250, and 270ºC. The fibers were treated with NaOH. These composites were then characterized for thermal, mechanical and morphological performances. When comparing findings obtained at 250 and 270ºC, the optimal processing temperature was found to be 230ºC. This temperature resulted in the best thermal and mechanical properties, and excellent interfacial adhesion among the coated fibers and the PT. In comparison to the uncoated SF, the coated composites showed a 9.5% reduction in degradation onset temperature and a 13% improvement in decomposition temperature following resin coating, according to thermogravimetric analysis. The CSF-PT composites surpassed the uncoated composites by 2.18% and 2.8% in terms of glass transition (Tg) and melting temperature (Tm) measured by differential scanning calorimetry (DSC), with peak values at 122.2 °C and 265.1 °C, respectively. Coated Sisal-reinforced PT (CSF-PT) and coated-treated PT (CTSF-PT) composites outperformed raw Sisal (SF-PT) composites in terms of overall qualities and morphological properties, regardless of processing temperature. Applying resin to natural fibers enhances their heat resistance and the bond between the coated fibers and the plastic matrix, making them better suited for engineering plastic composites. Applications involving high temperatures, such as construction and automotive industries are well-suited to the resulting composites. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2024.

关键词： Automotive industry

来源：评论

学校读者我要写书评

暂无评论

Enhancing Human Pose Estimation in the Internet of Things via Diffusion Generative Models

引用

IEEE Internet of Things Journal 2025年第10期12卷 13556-13567页

作者： Wu, Sifan Zhang, Hongzhe Liu, Zhenguang Chen, Haipeng Jiao, Yingying Jilin University College of Computer Science and Technology the Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China School of discipline inspection and supervision China University of Political Science and Law Beijing100088 China Zhejiang University State Key Laboratory of Blockchain and Data Security Hangzhou310027 China Institute of Blockchain and Data Security Hangzhou310059 China Zhejiang University of Technology College of Computer Science and Technology Hangzhou310014 China

With the ongoing development of public video surveillance technology, accurate human pose estimation is becoming increasingly important in urban administration and law enforcement. However, existing methods rely on large-scale dense annotations, which are labor-intensive and time-consuming. To tackle this, we propose SparsePose which leverages training videos with sparse annotations (labeled every k frames) to learn to propagate temporal poses that help to estimate the poses in unlabeled frames. Technically, we engage in a novel dual-branch architecture that combines 1) pose forecasting of the consecutive neighboring frames with 2) visual clues of the current frame and the nearest labeled frames. We theoretically derive the intra-branch and inter-branch mutual information loss to supervise that maximized pose-relevant features are extracted from the current frame and different branches complement each other to approach precise pose estimation. Additionally, we propose a diffusion generative enhancement, which improves the robustness of the model to challenging scenes from the perspective of diversity. Empirical results show that our method significantly outperforms the state-of-the-art methods in sparsely labeled pose estimation on three benchmark datasets. © 2025 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Fair Personalized Learner Modeling Without Sensitive Attributes 25

Fair Personalized Learner Modeling Without Sensitive Attribu...

引用

Proceedings of the ACM on Web Conference 2025

作者： Hefei Xu Min Hou Le Wu Fei Liu Yonghui Yang Haoyue Bai Richang Hong Meng Wang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei Anhui China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei Anhui China and Institute of Dataspace Hefei Comprehensive National Science Center Hefei Hefei Anhui China

ISBN: (纸本)9798400712746

Personalized learner modeling uses learners' historical behavior data to diagnose their cognitive abilities, a process known as Cognitive Diagnosis (CD). This is essential for web-based learning services such as learning resource recommendation and adaptive testing. However, prior studies have shown that CD models may unfairly correlate learners' abilities with sensitive attributes (e.g., gender, region), leading to biased outcomes. While existing approaches mitigate this issue by decorrelating sensitive attributes from the modeling process, privacy concerns make collecting such attributes impractical. Furthermore, the presence of multiple sensitive attributes complicates fairness improvements. In this paper, we explore how to achieve fair personalized learner modeling without relying on any sensitive attribute input. We introduce a novel fairness objective tailored for personalized learner modeling and design a max-min strategy to facilitate both sensitive information inference and fair CD modeling. In the max step, we infer pseudo-labels by maximizing the fairness objective, while in the min step, we retrain the CD model by minimizing it. Additionally, we provide a theoretical guarantee that our framework reduces the upper bound of fairness generalization error. Extensive experiments demonstrate that the proposed framework significantly outperforms existing methods. Our code is available at: https://***/HeFei-X/FairWISA.

关键词： cognitive diagnosis

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Cyber Science Research Institute Sichuan University China Ministry of Education Key Laboratory of Data Protection and Intelligent Management Sichuan University Chengdu610065 China Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Hefei University of Technology School of Computer Science and Information Engineering China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China University of Padua Department of Mathematics HIT Center Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker, a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

HaWANet: Road Scene Understanding with Multi-modal Sensor data Using Height-Width-Driven Attention Network 23rd

HaWANet: Road Scene Understanding with Multi-modal Sensor D...

引用

23rd International Conference of the Italian Association for Artificial Intelligence, AIxIA 2024

作者： Chatterjee, Soumick Xu, Jiahua Kuzhipathalil, Adarsh Nürnberger, Andreas Faculty of Computer Science Otto von Guericke University Magdeburg Magdeburg Germany Data and Knowledge Engineering Group Otto von Guericke University Magdeburg Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Hertie Institute for Clinical Brain Research Tuebingen Germany XenomatiX NV Leuven Belgium

ISBN: (纸本)9783031806063

In recent years, the field of autonomous vehicles and driverless technology has seen remarkable advancements, driven by contributions from mainstream automotive manufacturers and open-source projects. This research aims to develop a pipeline for road scene understanding through semantic segmentation. The proposed pipeline utilises a multi-modal segmentation model, incorporating greyscale images and point cloud data from Xenolidar, specifically designed to capture the structural priors of highway road scenes. The fusion of input modalities and the design of an encoder-decoder architecture with a novel attention scheme called HaWANet is introduced, which focuses on the height and width contextual information to improve the accuracy of road segmentation, are the primary aspects explored for the proposed model. The output of the encoder is a two-dimensional point cloud, which effectively represents the road’s planar nature, and is crucial for improving the accuracy of road segmentation, particularly in edge cases, addressing current challenges in autonomous driving research. This research, aimed at addressing the segmentation problem for multimodal sensor data, has presented significant performance improvement over single-modal approaches. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Joint Double Auction-Based Channel Selection in Wireless Monitoring Networks

引用

IEEE Transactions on Network and Service Management 2025年

作者： Xia, Na Chen, Lei Li, Meng Yin, Yutao Zhang, Ke Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data China State Grid Electric Power Research Institute Co. Ltd Hefei230088 China

In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller's marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios. © 2004-2012 IEEE.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

AAV Virtual Antenna Array Deployment for Uplink Interference Mitigation in data Collection Networks

引用

IEEE Internet of Things Journal 2025年第8期12卷 10834-10850页

作者： Li, Hongjuan Kang, Hui Sun, Geng Li, Jiahui Wang, Jiacheng Wang, Xue Niyato, Dusit Leung, Victor C. M. Jilin University College of Computer Science and Technology Changchun 130012 China Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China Nanyang Technological University College of Computing and Data Science Jurong West Singapore Jilin University Department of Communication Engineering Changchun 130012 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen 518115 China Shenzhen University College of Computer Science and Software Engineering Shenzhen 518060 China The University of British Columbia Department of Electrical and Computer Engineering Vancouver V6T 1Z4 BC Canada

Autonomous aerial vehicles (AAVs) have gained considerable attention as a platform for establishing aerial wireless networks and communications. However, the Line of Sight (LoS) dominance in air-to-ground (A2G) communications often leads to significant interference with terrestrial networks, reducing communication efficiency among terrestrial terminals. This article explores a novel uplink interference mitigation approach based on the collaborative beamforming (CB) method in multi-AAV network systems. Specifically, the AAV swarm forms an AAV-enabled virtual antenna array (VAA) to achieve the transmissions of gathered data to multiple base stations (BSs) for data backup and distributed processing. However, there is a tradeoff tradeoff between the effectiveness of CB-based interference mitigation and the energy conservation of AAVs. Thus, by optimizing the excitation current weights and hover position of AAVs as well as the sequence of data transmission to various BSs, we formulate an uplink interference mitigation multiobjective optimization problem (MOOP) to decrease interference affection, enhance transmission efficiency, and improve energy efficiency, simultaneously. In response to the computational demands of the formulated problem, we introduce an evolutionary computation method, namely chaotic nondominated sorting genetic algorithm II (CNSGA-II) with multiple improved operators. The proposed CNSGA-II efficiently addresses the formulated MOOP, outperforming several other comparative algorithms, as evidenced by the outcomes of the simulations. Moreover, the proposed CB-based uplink interference mitigation approach can significantly reduce the interference caused by AAVs to nonreceiving BSs. © 2014 IEEE.

关键词： autonomous aerial vehicle (AAV) network Collaborative beamforming (CB) evolutionary computation interference mitigation multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Allocation in Edge Computing via Deep Deterministic Policy Gradient Reinforcement Learning

Dynamic Resource Allocation in Edge Computing via Deep Deter...

引用

Integrated Circuits and Communication Systems (ICICACS), IEEE International Conference on

作者： Vidhya Gopal U Surendar A Bajulunisha M Tamilselvi V Sathiyapriya N Saranya Department of Computer Science and Engineering Sona College of Technology Salem India Department of Electronics and Communication Engineering SRM institute of Science and Technology Chennai India Department of Computer Science and Engineering Chennai Institute of Technology Kundrathur India Department of Computer Science and Engineering Roever Engineering College Perambalur India Department of Computer Science and Engineering Knowledge Institute of Technology Salem India Department of Artificial Intelligence and Data Science Karpagam College of Engineering Coimbatore India

ISBN: (数字)9798331508456

ISBN: (纸本)9798331508463

The difficulty with dynamic and heterogeneous natured edge computing environments is resource provisioning. Reinforcement Learning (RL) can be promising to solve the problems of resource allocation under conditions of dynamics and complexity. This research work presents a novel DDPG-based (Deep Deterministic Policy Gradient) approach for optimizing the dynamics of resource allocation in edge computing environments by exploiting the CRAWDAD KAIST–WIBRO dataset for the proposed model. This approach implements a neural network that learns the optimal policies of allocations with dynamism towards new changes in workloads and resource availabilities. In order to test the performance of this method, conducted several simulations over real-world workload and resource data, mapping the parameters like rewards and variation in episodes. The simulation results indicate that proposed approach performs superior compared to traditional heuristic-based approaches as well as other RL algorithms for resource usage, response time, and energy efficiency. This proposed approach permits optimized resource utilization along with quality of service, of paramount importance in executing complex and demanding applications at the edge computing environment.

关键词： Computational modeling Simulation Markov decision processes Neural networks Reinforcement learning Quality of service Dynamic scheduling Resource management Time factors Edge computing

来源：评论

学校读者我要写书评

暂无评论

Offline Reinforcement Learning via Conservative Smoothing and Dynamics Controlling

Offline Reinforcement Learning via Conservative Smoothing an...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haihong Guo Fengxin Li Jiao Li Hongyan Liu School of Information Renmin University of China China Chinese Academy of Medical Sciences / Peking Union Medical College Institute of Medical Information / Medical Library China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Offline Reinforcement Learning (RL) optimizes policy using pre-collected data instead of direct environment interaction, offering a safe and cost-effective solution for sequential decision-making in the real world. However, it faces challenges such as distribution shift issues and vulnerability under perturbations. Researchers have developed various conservative methods to improve the robustness of offline RL. Nevertheless, model-based methods can result in transition distribution shift issues, while model-free value-based uncertainty penalty methods may not be sufficiently robust. To address these problems, we propose a new method called Robust Offline RL via Conservative Smoothing and Dynamics Controlling (RCSD). To achieve reliable value estimation of out-of-distribution (OOD) actions, RCSD uses both model-free uncertainty penalty and model-based simulation methods. It introduces a new one-step simulation method with conservative dynamics controlling to avoid value overestimation caused by transition distribution shifts. Moreover, RCSD considers both current and next states when generating OOD states to ensure cautious value estimation and efficient data utilization. RCSD uses conservative Q-smoothing and policy smoothing to strengthen the policy against sudden changes under perturbations. Experiments on D4RL benchmark demonstrate that RCSD can achieve state-of-the-art performance compared to baselines in either benchmark or adversarial attack tests.

关键词： Uncertainty Smoothing methods Perturbation methods Estimation Reinforcement learning Benchmark testing Signal processing Robustness Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

KAN v.s. MLP for Offline Reinforcement Learning

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (纸本)9798350368741

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative to the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP-based conservative Q-learning (CQL) on the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This allows us to choose the base networks according to the offline RL task requirements. © 2025 IEEE.

关键词： KAN Kolmogorov-Arnold networks MLP multilayer perceptrons offline reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：