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

Web service location-allocation using discrete NSGA-II with matrix based genetic operations and a repair mechanism

Journal of Ambient Intelligence and Humanized Computing 2023年第10期14卷 14163-14187页

作者： Verma, Shanu Pant, Millie Snasel, Vaclav Department of Applied Mathematics and Scientific Computing Indian Institute of Technology Roorkee Roorkee247667 India Centre for Artificial Intelligence and Data Science Indian Institute of Technology Roorkee Roorkee247667 India Department of Computer Science VSB-Technical University of Ostrava Ostrava70800 Czech Republic

Web Service Location-Allocation Problem (WSLAP) is an important and challenging NP-hard combinatorial optimization problem where multiple objectives affecting the quality of service (QoS) are to be optimized simultaneously. Most of the existing research articles mainly focus on selecting web service locations that minimize two QoS: total cost and total response time. However, another QoS factor throughput also needs attention when selecting sites for allocating web services. Therefore, we have constructed a new WSLAP model that minimizes the total cost and the total negative quality factor. This negative quality factor considers throughput along with latency to strengthen the QoS of the located web services. Further, three NSGA-II variants, NSGA-II.V1, NSGA-II.V2, and NSGA-II.V3, with a novel matrix-based chromosome representation, are developed to deal with the proposed bi-objective WSLAP model. These algorithms involve matrix-based genetic operations for better exploration and a repair mechanism for tackling infeasibility. The proposed model and algorithms are validated on 24 test instances, out of which 14 are existing, and 10 are newly created with increased web services, user centres and service locations. The experimental results claim that the proposed WSLAP model succeeded in improving the throughput with a comparatively lower total cost. Further, the proposed algorithms outperformed the compared algorithms in terms of hypervolume, inverted generational distance and computational time on 89% of instances. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Explainable-AI-based two-stage solution for WSN object localization using zero-touch mobile transceivers

引用

Science China(Information Sciences) 2024年第7期67卷 27-45页

作者： Kai FANG Junxin CHEN Han ZHU Thippa Reddy GADEKALLU Xiaoping WU Wei WANG School of Mathematics and Computer Science Zhejiang A&F University School of Software Dalian University of Technology Faculty of Applied Sciences Macao Polytechnic University Department of Electrical and Computer Engineering Lebanese American University School of Information Engineering Huzhou University Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen MSU-BIT University

Artificial intelligence technology is widely used in the field of wireless sensor networks(WSN).Due to its inexplicability, the interference factors in the process of WSN object localization cannot be effectively eliminated. In this paper, an explainable-AI-based two-stage solution is proposed for WSN object localization. In this solution, mobile transceivers are used to enlarge the positioning range and eliminate the blind area for object localization. The motion parameters of transceivers are considered to be unavailable,and the localization problem is highly nonlinear with respect to the unknown parameters. To address this,an explainable AI model is proposed to solve the localization problem. Since the relationship among the variables is difficult to fully include in the first-stage traditional model, we develop a two-stage explainable AI solution for this localization problem. The two-stage solution is actually a comprehensive consideration of the relationship between variables. The solution can continue to use the constraints unused in the firststage during the second-stage, thereby improving the performance of the solution. Therefore, the two-stage solution has stronger robustness compared to the closed-form solution. Experimental results show that the performance of both the two-stage solution and the traditional solution will be affected by numerical changes in unknown parameters. However, the two-stage solution performs better than the traditional solution, especially with a small number of mobile transceivers and sensors or in the presence of high noise. Furthermore,we have also verified the feasibility of the proposed explainable-AI-based two-stage solution.

关键词： explainable AI object localization semidefinite relaxation mobile transceiver two-stage solution closed-form solution

来源：评论

学校读者我要写书评

暂无评论

Digital-Twin Enabled Time Ahead Resource Allocation for Integrated Fiber-Wireless Connected Vehicular Network

引用

Journal of Communications and Information Networks 2024年第3期9卷 296-308页

作者： Akshita Gupta Saurabh Jaiswal Martin Maier Vivek Ashok Bohara Anand Srivastava Wirocomm Research Group Department of Electronics&Communication EngineeringIndraprastha Institute of Information Technology Delhi(IIITD)New Delhi 110020India Department of Computer Science&Applied Mathematics Indraprastha Institute of Information Technology Delhi(IIITD)New Delhi 110020India Optical Zeitgeist Laboratory Institute National de la Recherche ScientifiqueMontreal H5A 1K6Canada

The digital twin(DT)is envisaged as a catalyst for pioneering ecosystems of service provision within an immersive environment born from the convergence of virtual and physical ***,DT could enhance the performance of edge-intelligent connected vehicular networks by allocating network resources efficiently based on the key performance indicators(KPIs)of vehicular data ***,this work addresses the key challenge of computation and spectrum resource allocation for vehicular *** allocate the optimal resource allocation,we subdivided the problem into:traffic classification,collective learning,and resource allocation *** order to do so,this paper concentrates on two crucial vehicular applications:brake application and lane-change *** utilize a random forest model to collectively learn vehicular data traffic in the upcoming time ***,a time-ahead resource allocation algorithm is proposed to improve the quality of service(QoS)by intelligently offloading vehicular data traffic to a DT-based integrated fiber-wireless(Fi-Wi)connected vehicular *** evaluate the performance of the resource allocation strategy in terms of resources required by the network alongside the packet loss *** was observed that there was a 44.74%increase in cost as the total computation resources increased from F=50 to 100 GHz,whereas the PLR of the network decreased by 71.43%.

关键词： connected vehicles digital twin edgeintelligence fiber-wireless machine learning resource allocation

来源：评论

学校读者我要写书评

暂无评论

ILP-Based Heuristics for the Multi-Modal Stable Matching Problem

引用

Tsinghua Science and technology 2025年第2期30卷 479-487页

作者： Yang Yang Rolf H.Möhring Junteng Song Yicheng Xu Yong Zhang Shenzhen Institute of Advanced Technology Chinese Academy of SciencesShenzhen 518055China University of Chinese Academy of Sciences Beijing 101408China School of Applied Mathematics and Computer Science Technische Universität BerlinBerlin 10623Germany School of Mathematics and Information Science Hebei UniversityBaoding 071002China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic TechnologyGuilin 541004China

In this paper,we investigate the stable matching problem with multiple preferences in bipartite graphs,where each agent has various preference lists for all available partners with respect to different *** problem requires that each matched agent must have exactly one partner and the obtained matching should be stable for all *** our main contribution,we present an integer linear programming(ILP)model for determining whether there exists a globally stable matching in bipartite graphs,which has been proved to be *** the time consumed for solving ILPs might dramatically increase as the size of instances grows,we develop a preprocessing technique that helps to eliminate pairs that will never be a member of any globally stable matching and thus accelerates the computing *** perform experiments on randomly generated preference lists and observe a significant speedup when we preprocess the instance before solving the *** there does not need to exist a perfect matching that is stable for all given criteria,we extend our ILP to the optimized version of the aforementioned problem,which asks to find a matching with maximum cardinality that is stable among all matched agents.

关键词： stable matching multi-modal integer linear programming(ILP)

来源：评论

学校读者我要写书评

暂无评论

Lie algebra and conservation laws for the time-fractional heat equation

引用

Transactions of the Royal Society of South Africa 2023年第3期78卷 227-240页

作者： Halder, Amlan K. Duba, C.T. Leach, P.G.L. Department of Mathematics Pondicherry University Puducherry India School of Computer Science and Applied Mathematics University of the Witwatersrand Johannesburg South Africa Institute for Systems Science Durban University of Technology Durban South Africa School of Mathematics Statistics and Computer Science University of KwaZulu-Natal Durban South Africa

The Lie symmetry method is applied to derive the point symmetries for the N-dimensional fractional heat equation. We find that the numbers of symmetries and Lie brackets are reduced significantly as compared to the integer order for all dimensions. In fact for integer order linear heat equation the number of solution symmetries is equal to the product of the order and space dimension, whereas for the fractional case, it is half of the product on the order and space dimension. The Lie algebras for the integer and fractional order equations are mentioned using the subsequent computations of Lie brackets and by inspection. Interestingly, it is observed that for the one-dimensional fractional heat equation, the Lie algebra obtained by inspection of symmetries is similar to the result obtained by computation of Lie brackets, which is (Formula presented.). The Lie algebra using the symmetries of the two-dimensional heat equation is observed to be (Formula presented.), whereas using the Lie brackets the algebra is deduced to be (Formula presented.). Hence, it can be concluded that the Lie algebra obtained from the nonzero Lie brackets can be conflated to the algebra which is obtained by inspection. Further, the subsequent Lie algebras are mentioned for the three and four-dimensional integer and fractional equations and the conservation laws are explicitly stated. © 2023 Royal Society of South Africa.

关键词： conservation laws fractional partial differential equations lie symmetries solutions

来源：评论

学校读者我要写书评

暂无评论

Compound AI System for Personalized Learning: Integrating LLM Agents with Knowledge Graphs

Compound AI System for Personalized Learning: Integrating LL...

引用

Robotics, Intelligent Control and Artificial Intelligence (RICAI), International Conference on

作者： Eduard Antonov Applied Mathematics and Computer Science Moscow Institute of Physics and Technology Russia

ISBN: (数字)9798331541699

ISBN: (纸本)9798331541705

Personalized learning plays a critical role in enhancing educational outcomes by customizing experiences to meet individual learners' unique needs, preferences, and abilities. Although Large Language Models (LLMs) offer promising opportunities for personalization through natural language interactions, they face challenges related to maintaining long-term context and ensuring traceability of a learner's evolving knowledge. This paper introduces a composite AI framework that merges an LLM-powered conversational agent with Knowledge Graphs (KGs) structured according to Knowledge Space Theory (KST), enhanced by advanced retrieval tools and a robust long-term memory mechanism. This system autonomously orchestrates meaningful, context-aware dialogues while utilizing function calling to access various tools, effectively bridging the gap between dynamic interactions and structured knowledge representation. Our empirical evaluations indicate that the proposed system excels in maintaining coherent dialogues, accurately tracking learner progress, and providing reliable, personalized educational support. By addressing the limitations of standalone LLMs and traditional adaptive learning systems, this integrated approach signifies a notable advancement in intelligent educational technology.

关键词： Large language models Retrieval augmented generation Natural languages Knowledge graphs Educational technology Memory modules Learning (artificial intelligence) Reliability theory Robots Intelligent control

来源：评论

学校读者我要写书评

暂无评论

Incremental Learning Strategy with Multi-dimensional Knowledge Distillation for One-stage Object Detection 22

Incremental Learning Strategy with Multi-dimensional Knowled...

引用

22nd IEEE International Conference on Industrial Informatics, INDIN 2024

作者： Li, Yimeng Liu, Xuejiao Xiang, Xueshuang Tan, Yu-An Meng, Weizhi School of Cyberspace Science and Technology Beijing Institute of Technology Beijing China Qian Xuesen Laboratory of Space Technology China Academy of Space Technology Beijing China Department of Applied Mathematics and Computer Science Technical University of Denmark Kongens Lyngby Denmark

ISBN: (纸本)9798331527471

In practical applications, object detectors often encounter unknown classes samples. As object detection datasets undergo continuous development, the need arises for object detectors to adeptly recognize an escalating array of new classes while retaining the original detection capability. This paper introduces a new class incremental object detection learning framework with multi-dimensional knowledge distillation, using Yolov5 as the foundational detection model. Specifically, we utilize local feature distillation, attention distillation and global feature distillation to preserve information in the original model’s feature maps. Additionally, we employ response distillation to ensure the model remains responsive to previous classes. In comparison to the state-of-the-art methods, our approach achieves higher overall accuracy on PASCAL VOC 2007. Especially in the "19+1" incremental task, our approach gets the highest mAP@0.5 of 0.697 with a minimum mean AP decline rate of 4.45%. For the "4+3" and "6+1" tasks on KITTI, our approach preserves the model’s responsiveness to the original task more effectively while achieving the highest overall accuracy. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

PLOD: Point cloud level of detail for polygon mesh 32

PLOD: Point cloud level of detail for polygon mesh

引用

32nd International Conference in Central Europe on computer Graphics, Visualization and computer Vision, WSCG 2024

作者： Konks, Eric Shcherbakov, Alexandr Phystech School of Applied Mathematics and Computer Science Moscow Institute of Physics and Technology Institutskiy Pereulok 9 Dolgoprudny Oblast Moscow141701 Russia Faculty of Computational Mathematics and Cybernetics Lomonosov Moscow State University Moscow119991 Russia

Rendering high-polygonal models from distant perspectives has certain performance issues related to high density of subpixel triangles, which can be solved by levels of detail, a classical optimization method. Since a mesh occupies a small area on the screen, an alternative representation of the geometry in the form of a point cloud can replace the original geometry with little or no change to the image, and allowing for significant performance improvements due to the smaller number of primitives rendered. This paper presents a method for automatically generating a point cloud from a polygonal mesh with nested levels of detail. It also considers a method for rendering cloud with dynamically varying cloud density in real time based on view frustum and distance. © 2024 University of West Bohemia. All rights reserved.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Physics-Constrained Adversarial Training for Neural Networks in Stochastic Power Grids

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1121-1131页

作者： Li, Wenting Deka, Deepjyoti Wang, Ren Paternina, Mario R. Arrieta LANL Applied Mathematics and Plasmas Physics Division Los AlamosNM87544 United States Illinois Institute of Technology Department of Electrical and Computer Engineering ChicagoIL60616 United States National Autonomous University of Mexico Department of Electrical Engineering Mexico City04510 Mexico

The growth in distributed energy resources (DERs) is an important step toward solving the global climate crisis. However, many DERs, such as wind and solar power, are random and intermittent, causing the data in power grids to be perturbed with high uncertainty. Such perturbations degrade the performance of data-driven algorithms introduced in power grids for sensing and control. Existing approaches can strengthen machine learning models against well-designed malicious attacks. However, such physics-agnostic efforts fail to ensure the robustness of natural perturbations in power grids, that occur due to varying loads and changes in control inputs. This article proposes a novel physics-constrained adversarial training method for robustifying neural networks for the crucial problem of locating edge-faults in power grids. Our approach relies on first deriving analytical physical laws that are satisfied by state perturbations in realistic grids and then using the descriptive sets during adversarial training. Compared to state-of-the-art methods, our perturbation-robust neural networks have higher robust accuracy as well as training efficiency. Also, we demonstrate that the proposed approach achieves a tighter upper bound of robust risks than traditional efforts. The numerical experimental results in the IEEE 68-bus benchmark system validate our adversarial training in two scenarios when loads and control inputs vary randomly. The proposed method shows superior performance in accuracy and efficiency for different perturbed datasets. In addition, we testify the influence of different inputs on the robustness. © 2023 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Estimating the Probability of Falling Share Price Below the Minimum Level 9

Estimating the Probability of Falling Share Price Below the ...

引用

9th International Conference on Control, Decision and Information Technologies, CoDIT 2023

作者： Semakov, Sergei L. Moscow Institute of Physics and Technology Faculty of Control and Applied Mathematics Russia Moscow Automobile and Road Construction Institute Department of Mathematics Russia Federal Research Center 'Computer Science and Control' of the Russian Academy of Sciences Russia

ISBN: (纸本)9798350311402

A technology is proposed for estimating the probability that a share price will fall below the minimum level. The exact expression is obtained for the required probability under the assumption that the behavior of the share price is described by the well-known model of Samuelson, according to which the relative change in price is the sum of the non-random trend and the Wiener process. The obtained result is qualitatively analyzed for various relations of the problem parameters. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：