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

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

来源：评论

学校读者我要写书评

暂无评论

Dual AAV Cluster-Assisted Maritime Physical-Layer Secure Communications via Collaborative Beamforming

引用

IEEE Internet of Things Journal 2025年第9期12卷 12589-12607页

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

Autonomous aerial vehicles (AAVs) can be utilized as relay platforms to assist maritime wireless communications. However, complex channels and multipath effects at sea can adversely affect the quality of AAV transmitted signals. Collaborative beamforming (CB) can enhance the signal strength and range to assist the AAV relay for remote maritime communications. However, due to the open nature of AAV channels, security issue requires special consideration. This article proposes a dual AAV cluster-assisted system via CB to achieve physical-layer security in maritime wireless communications. Specifically, one AAV cluster forms a maritime AAV-enabled virtual antenna array (MUVAA) relay to forward data signals to the remote legitimate vessel, and the other AAV cluster forms an MUVAA jammer to send jamming signals to the remote eavesdropper. In this system, we formulate a secure and energy-efficient maritime communication multiobjective optimization problem (SEMCMOP) to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate vessel, minimize the SINR of the eavesdropping vessel and minimize the total flight energy consumption of AAVs. Since the SEMCMOP is an NP-hard and large-scale optimization problem, we propose an improved swarm intelligence optimization algorithm with chaotic solution initialization and hybrid solution update strategies to solve the problem. Simulation results indicate that the proposed algorithm outperforms other comparison algorithms, and it can achieve more efficient signal transmission by using the CB-based method. © 2014 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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 Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 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

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

3rd International Conference on Integrated Circuits and Communication Systems, ICICACS 2025

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

ISBN: (纸本)9798331508456

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. © 2025 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Accurate, Secure, and Efficient Semi-Constrained Navigation Over Encrypted City Maps

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2642-2658页

作者： Li, Meng Chen, Yifei Gao, Jianbo Wu, Jingyu Zhang, Zijian He, Jialing Zhu, Liehuang Conti, Mauro Lin, Xiaodong Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei230002 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230002 China Hefei University of Technology Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei230002 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100811 China University of Science and Technology of China School of Computer Science and Technology Hefei230026 China Beijing Institute of Technology Southeast Institute of Information Technology Fujian Putian351100 China Chongqing University College of Computer Science Chongqing400044 China University of Padua Department of Mathematics HIT Center Padua35131 Italy Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Delft2628 CD Netherlands University of Guelph School of Computer Science GuelphONN1G 2W1 Canada

Navigation services enable users to find the shortest path from a starting point S to a destination D, reducing time, gas, and traffic congestion. Still, navigation users risk the exposure of their sensitive location data. Our motivation arises from how users can accurately, securely, and efficiently navigate from S to Dwhile passing through k unordered stops, i.e., midway locations with a non-fixed visiting order. In this work, we formally define Semi-Constrained Navigation (SCN) and present a novel scheme Hermestoachieveaccurate,secure, andefficient SCN. Specifically, weproposeadivide-and-conquerapproachtostrikeagoodbalance betweenaccuracyandefficiency. It recursively depth-first-searches the whole area (a navigation tree) and invokes five carefully-crafted strategies stop-by-stop to compute three subpaths in three se quential subareas. We construct a path-distance oracle to encrypt the road graph and securely implement the strategies by using homomorphic encryption and garble circuits. We formally prove the security in the random oracle model and analyze the search complexity to be less than O(k2). We experiment over a real-world city map and compare with six baselines. Results show that path search with k = 4 among N = 1000 intersections requires 5.58 seconds with a 3.2% distance deviation rate and an 82.5% path similarity. © 2004-2012 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Enhancing Kidney Stone Detection in CT scans with Image Processing and the DCNN-RELM Model

Enhancing Kidney Stone Detection in CT scans with Image Proc...

引用

Electronics and Renewable Systems (ICEARS), International Conference on

作者： Manjula Prabakaran Jesmin Zakaria S Kannan Santhiya P Rajasekar P M V Rathnamma Department of CSE- (Data Science) Madanapalle Institute of Technology & Science Andhra Pradesh India Department of Electronics & Communication Engineering (ECE) NSHM Knowledge Campus Durgapur West Bengal India Department of Computer Science and Engineering School of Engineering and Technology Dhanalakshmi Srinivasan University Trichy Tamilnadu India Department of Computer Science and Engineering Sathyabama Institute of Science and Technology Chennai Tamilnadu India Department of CSE KLM College of Engineering for Women Kadapa Andhra Pradesh India

ISBN: (数字)9798331509675

ISBN: (纸本)9798331509682

CT of the urinary system, abdomen, and kidneys appears to improve kidney stone screening and identification. Segmentation and categorization are essential for kidney stone identification and management. This work developed a semi-automatic kidney stone detection system using geometric concepts and image processing. The main steps include model training, feature extraction, segmentation, embossing, and preprocessing. Preprocessing involves trimming the input image to remove unnecessary kidney regions to focus on critical CT scan locations. Relief embossing enhanced image details. Segmentation accurately classified veins and blood arteries to define kidney stone boundaries. CNN-RELM was our training model. Compared to CNN and ELM models, the recommended system performed better. Its 93.87% kidney stone detection and localization accuracy prove its reliability. The semi-automatic system's reliable kidney stone detection and segmentation method may improve clinical decision-making. Combining CNN-RELM modeling and enhanced image processing could lead to medical imaging applications.

关键词： Training Image segmentation Accuracy Three-dimensional displays Computed tomography Embossing data preprocessing Reliability Kidney Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

A novel framework for efficient dominance-based rough set approximations using K-dimensional (K-D) tree partitioning and adaptive recalculations techniques

引用

engineering Applications of Artificial Intelligence 2025年 154卷

作者： Nawaz, Uzma Saeed, Zubair Atif, Kamran Knowledge and Data Science Research Centre Department of Computer and Software Engineering College of Electrical and Mechanical Engineering National University of Science and Technology Islamabad Pakistan Department of Electrical & Computer Engineering Texas A&M University College StationTX United States Department of Civil Engineering Deakin University Victoria Australia

In dynamic datasets, both entries and their possible values frequently change. This makes it difficult to update the necessary calculations for analysis. The Dominance-based Rough Set Approach (DRSA) effectively analyzes preference-based data. Still, it can be slow because it requires recalculating important values each time the data are updated. This study proposes an optimized K-dimensional (K-D) tree algorithm that integrates dynamic weighting and lazy recalculations to reduce computational cost. The K-D tree effectively organizes data, dynamic weighting prioritizes recalculations for essential nodes, and lazy recalculation postpones unnecessary computation. The proposed approach significantly reduces the execution time and memory consumption while maintaining accuracy. An ablation study was conducted to separately evaluate the impact of each component. This demonstrates the efficiency improvement achieved using the proposed approach. Compared to conventional DRSA, our optimized method reduced computational time and memory usage by 99 % across ten publicly available University of California, Irvine (UCI) datasets, which provided an efficient and scalable solution for real-time data processing in dynamic environments. © 2025 The Authors

关键词： data reduction

来源：评论

学校读者我要写书评

暂无评论

Glioblastoma tumor segmentation using an ensemble of vision transformers

Glioblastoma tumor segmentation using an ensemble of vision ...

引用

Medical Imaging 2025: Computer-Aided Diagnosis

作者： Liu, Huafeng Dowdell, Benjamin Engelder, Todd Pulmano, Zarah Osa, Nicolas Barman, Arko Department of Computer Science Rice University Houston United States Data to Knowledge Lab Rice University Houston United States Department of Electrical and Computer Engineering Rice University Houston United States Department of Statistics Rice University Houston United States

ISBN: (纸本)9781510685925

Glioblastoma is one of the most aggressive and deadliest types of brain cancer, with low survival rates compared to other types of cancer. Analysis of Magnetic Resonance Imaging (MRI) scans is one of the most effective methods for the diagnosis and treatment of brain cancers such as glioblastoma. Accurate tumor segmentation in MRI images is often required for treatment planning and risk assessment of treatment methods. Here, we propose a novel pipeline, Brain Radiology Aided by Intelligent Neural NETworks (BRAINNET), which leverages MaskFormer, a vision transformer model, and generates robust tumor segmentation masks. We use an ensemble of nine predicted segmentation masks generated from three different models separately trained on each of the three orthogonal 2D slice directions (axial, sagittal, and coronal) of a 3D brain MRI volume. Each of the models in the ensemble consists of three modules - a pixel-level module that extracts per-pixel embeddings, a transformer module that generates per-segment embeddings, and a segmentation module that combines these embeddings to generate the segmentation mask. Two different data augmentation strategies were also implemented to improve the performance of the individual models. We trained, tuned hyperparameters, and tested our models on the publicly available UPenn-GBM dataset, consisting of 3D multi-parametric MRI (mpMRI) scans from 611 subjects. We use Dice coefficient (DC) and 95% Hausdorff distance (HD) for evaluating the performance of our models. Our models achieved state-of-the-art results in segmenting all three different tumor regions – tumor core (DC = 0.894, HD = 2.308), whole tumor (DC = 0.891, HD = 3.552), and enhancing tumor (DC = 0.812, HD = 1.608). © 2025 SPIE.

关键词： Magnetoencephalography

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Preference Completion with Ranked and Unranked Preferences

引用

Cognitive Computation 2025年第3期17卷 1-21页

作者： Li, Lei Liu, Pan Zhang, Renjie Tao, Zhenchao Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Radiation Oncology The First Affiliated Hospital of USTC Division of Life Sciences and Medicine University of Science and Technology of China Hefei China Department of Radiation Oncology Anhui Provincial Cancer Hospital Hefei China

As for social choice, all alternatives are ranked by agents to form preferences as linear orders. However, in applications, sometimes some alternatives cannot be ranked, or it is unnecessary to rank them, which leads to unranked alternatives. Hence, without loss of generality, by dividing the set of alternatives into three ranked and unranked subsets, including top-k alternatives, intermediate-r alternatives, and last-l alternatives, the Mallows model on ranked and unranked preferences can be analyzed systematically. Technically, a repeated insertion model is adopted during sampling, and probability distributions are derived for ranked and unranked preferences of alternatives. Experimental results verify the accuracy of the probability distributions for different ranked and unranked preferences of alternatives. Furthermore, in order to solve the preference completion problem where agents have multiple partial rankings, a fuzzy preference completion algorithm, Fuzzy-Multi-Rankings, is proposed, which introduces a fuzzy ranking to complete the target agent’s preference in addition to the traditional nearest-neighbor-based methods. Based on the three ranked and unranked preferences, seven cases can be classified and analyzed for fuzzy preference completion. Experiments on the synthetic datasets and MovieLens dataset confirm the effectiveness and efficiency of our proposed Fuzzy-Multi-Rankings algorithm and also verify the accuracy of the evaluated probability distributions for the proposed seven cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：