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

Dynamics of Systems, Mechanisms and Machines (Dynamics)

作者： Gennady Zabudsky Alexey Samatov Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences Omsk Russia Dostoevsky Omsk State University Federal State Autonomous Educational Institution of Higher Education Omsk State Technical University Omsk Russia

ISBN: (数字)9798331509019

ISBN: (纸本)9798331509026

The problems of locating several obnoxious facilities on networks are studied. The facilities serve populated areas, but have a negative impact on the population. The negative impact decreases with increasing distance to the facilities. A mathematical model is given for an arbitrary number of the facilities. Approximate algorithms for solving of the problem for two facilities are developed. The original network is decomposed into two connected subnets. In each of the resulting subnet, the problem of locating one facility is solved using an exact algorithm. Calculations are performed on test examples for the shortest paths metric. For the case of network located on a plane, Euclidean metric and the shortest paths metric are used. Experiments to solve the problem on a road network of highways of France are conducted.

关键词： Measurement Heuristic algorithms Roads Euclidean distance approximation algorithms Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Radiation Pattern Synthesis of Radome-Enclosed Sparse Linear Arrays

Radiation Pattern Synthesis of Radome-Enclosed Sparse Linear...

引用

International Symposium on Antennas, Propagation and EM Theory (ISAPE)

作者： Yuxuan Wang Zheng Ma Haiwen Ke Jintong Liu Pengyuan Wang Mang He IEEE ISAPE 2024 School of Integrated Circuits and Electronics Beijing Institute of Technology Beijing China

ISBN: (数字)9798350353129

ISBN: (纸本)9798350353136

Radiation pattern synthesis of sparse antenna arrays has always been a hot topic in antenna analysis and design. In engineering, sparse arrays can help reduce costs and have significant positive impacts. When considering the mutual coupling between elements, synthesizing the radiation pattern for sparse arrays becomes more complex, especially when taking into account of a radome. Considering the mutual coupling, the active element pattern (AEP) of each element of the sparse array is different, which will consume a lot of time if the full-wave simulation is used. In order to solve this problem, a method combining sub array approximation and simulated annealing (SA) is proposed to optimize the sparse position and radiation pattern of sparse array, which can greatly reduce the optimization time. The example of radome-enclosed sparse linear arrays validates the good performance of the proposed algorithm.

关键词： Mutual coupling Costs Accuracy Antenna theory Simulated annealing approximation algorithms Radomes Optimization Antenna arrays Antenna radiation patterns

来源：评论

学校读者我要写书评

暂无评论

Binary Relaxation on Unlabeled Graph Matching: A Twin-VAMP Approach

Binary Relaxation on Unlabeled Graph Matching: A Twin-VAMP A...

引用

Asilomar Conference on Signals, Systems & Computers

作者： Mohamed Akrout Faouzi Bellili Amine Mezghani ECE Department University of Manitoba Winnipeg MB Canada

ISBN: (数字)9798350354058

ISBN: (纸本)9798350354065

We study a variant of the graph isomorphism problem called “unlabeled graph matching” (UGM) between two graphs where noisy and permuted versions of their adjacency matrices are observed. By relaxing the estimation of permutation matrices to binary ones, we recast UGM to a compressed sensing problem with two observation models. We then build upon the vector approximate message passing (VAMP) framework to devise a new algorithm, coined Twin-VAMP, to handle two observation matrices. Numerical results on permutation matrices of 3-digit size demonstrate the effectiveness of the proposed Twin-VAMP in solving the UGM problem.

关键词： Message passing Computer simulation Computational modeling Estimation approximation algorithms Vectors Numerical models Noise measurement Compressed sensing Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Influence Maximization with Link Addition

SSRN

引用

SSRN 2024年

作者： D’Angelo, Gianlorenzo Severini, Lorenzo Velaj, Yllka Gran Sasso Science Institute L’Aquila Italy UniCredit Rome Italy Faculty of Computer Science University of Vienna Vienna Austria

Understanding the dynamics that regulate the diffusion of information in networks is one of the most studied problems in network analysis. Starting from the work of Domingos and Richardson~\cite{DR01,RD02}, several studies have been conducted with the aim of shaping a given diffusion process so as to maximize the number of activated nodes at the end of the process. The main problem has been formalized by Kempe et al. and consists in finding a limited number of influential nodes, called seeds, in such a way that, if we use these nodes to trigger the diffusion process, the expected number of active nodes is maximum~\cite{KKT03}. In this paper, we study a generalization of the problem of Kempe et al. in which we are allowed to spend part of the budget to create new edges incident to the seeds. That is, the budget can be spent to buy seeds, with unit cost, or edges according to a cost function. The problem does not admit a PTAS, unless $P=NP$. The main result of the paper is a constant-factor approximation algorithm for the general case. To achieve this result we proceed in steps. We first focus on the case in which the budget is a constant and give an algorithm that guarantees a tight constant approximation ratio. We then focus on the case in which the budget is not constant and propose two algorithms: the former one gives us an approximation ratio that depends on the edge costs and increases when these costs are high;the latter algorithm guarantees a constant approximation ratio which is better than that of the first algorithm when the edge costs can be small. © 2024, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Complexity of Earth Mover’s Distance under Translation

arXiv

引用

arXiv 2024年

作者： Bringmann, Karl Staals, Frank Węgrzycki, Karol van Wordragen, Geert Saarland University Max-Planck-Institute for Informatics Saarland Informatics Campus Saarbrücken Germany Department of Information and Computing Sciences Utrecht University Netherlands Saarland University Max Planck Institute for Informatics Saarland Informatics Campus Saarbrücken Germany Department of Computer Science Aalto University Espoo Finland

The Earth Mover’s Distance is a popular similarity measure in several branches of computer science. It measures the minimum total edge length of a perfect matching between two point sets. The Earth Mover’s Distance under Translation (EMDuT) is a translation-invariant version thereof. It minimizes the Earth Mover’s Distance over all translations of one point set. For EMDuT in R1, we present an Oe(n2)-time algorithm. We also show that this algorithm is nearly optimal by presenting a matching conditional lower bound based on the Orthogonal Vectors Hypothesis. For EMDuT in Rd, we present an Oe(n2d+2)-time algorithm for the L1 and L∞ metric. We show that this dependence on dis asymptotically tight, as an no(d)-time algorithm for L1 or L∞ would contradict the Exponential Time Hypothesis (ETH). Prior to our work, only approximation algorithms were known for these problems. Copyright © 2024, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Trade-off between Radar Sensing and Energy Consumption in Integrated Sensing, Computing, and Communication UAV Network

Trade-off between Radar Sensing and Energy Consumption in In...

引用

International Conference on Communication Technology (ICCT)

作者： Yige Zhou Xin Liu Yuemin Liu School of Information and Communication Engineering Dalian University of Technology Dalian China

ISBN: (数字)9798350363760

ISBN: (纸本)9798350363777

In this paper, a multi-UAV enabled integrated sensing, computing, and communication (ISCAC) model is proposed, in which multi-UAV senses ground Users and offloads sensing data to a high altitude platform (HAP) for processing through mobile edge computing (MEC) technology. To maximize sensing data acquisition while minimizing energy consumption, we formulate our optimization problem as a trade-off between UAV radar sensing and energy consumption. We transform the established non-convex problem into three subproblems: sensing scheduling optimization, UAV transmit power optimization, and UAV-HAP trajectory optimization. We solved these subproblems using successive convex approximation (SCA) and relaxation methods, and proposed a three-layer iterative optimization algorithm to solve the original optimization problem. Simulation results demonstrate that, compared to the benchmark scheme, the algorithm proposed in this paper can significantly improve system performance.

关键词： Energy consumption Multi-access edge computing Processor scheduling Simulation Radar Benchmark testing Autonomous aerial vehicles approximation algorithms Sensors Trajectory optimization

来源：评论

学校读者我要写书评

暂无评论

Tools and environment for maximum efficiency in complex telecommunication system

Tools and environment for maximum efficiency in complex tele...

引用

Telecommunications Forum (TELFOR)

作者： Jovan Zlatanovic Zoran Trivic Ivana Milosevic Mirko Milosevic Network Operation Department PE ETV Belgrade Serbia Maintaining the Service Department PE ETV Belgrade Serbia Department of Electrical Engineering and Computer Science School of Technical and Art Applied Studies Academy of Electrical and Computer Engineering Belgrade Serbia

ISBN: (数字)9798350391060

ISBN: (纸本)9798350391077

The contribution of energy efficiency covers a wide range of interests. Energy efficiency affects climate change mitigation goals, energy saving, health benefits, and productivity. The quick expansion of data traffic and connection has caused the telecommunications industry's energy usage to increase significantly. It operated with equipment that is already energy efficient and it will be try to explain the additional energy saving. It will be shows a methodology that uses several parameters that can be varied in order to achieve the desired high-power transmitter efficiency. The result of the work is the saving of energy and resources through the use of tools that keep components of telecommunication systems in the optimal mode of operation using intelligent application. This application uses an intelligent algorithm that allows us to save approximately 20MW per year.

关键词： Productivity Transmitters Electricity Prevention and mitigation Energy conservation approximation algorithms Energy efficiency Telecommunications Voltage control Intelligent systems Climate change

来源：评论

学校读者我要写书评

暂无评论

Harmonic State and Power Flow Estimation in Distribution Systems Using Jaya Algorithm

Harmonic State and Power Flow Estimation in Distribution Sys...

引用

Compatibility in Power Electronics (CPE)

作者： Walace do Nascimento Sepulchro Lucas Frizera Encarnacao Department of Electrical Engineering Federal University of Espírito Santo Vitoria Brazil

ISBN: (数字)9798350318265

ISBN: (纸本)9798350318272

The massive use of nonlinear loads that directly impact the levels of harmonic distortion in the electrical systems and the high cost of power quality meters pose challenges in locating and mitigating harmonic pollution sources. In this context, a new methodology for harmonic state estimation and power flow based on the Jaya algorithm is proposed, and the results are compared with the already employed methodology based on Evolutionary Strategies. The simulation results using Jaya algorithm has a lower average error and computational effort using fewer input parameters when compared to the Evolutionary Strategies algorithm.

关键词： Meters Time-frequency analysis Power quality Voltage Power system harmonics Harmonic analysis approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Motion Planning at Intersections with Safe Differential Games based on Control Barrier Function

Motion Planning at Intersections with Safe Differential Game...

引用

IEEE Symposium on Intelligent Vehicle

作者： Peng Yi Wenyuan Wang Qingwen Liu Yiguang Hong Shanghai Research Institute for Intelligent Autonomous Systems Tongji University National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Department of Control Science and Engineering Tongji University

ISBN: (数字)9798350348811

ISBN: (纸本)9798350348828

Motion planning at intersections is a challenging problem in autonomous driving due to the complicated interactions. The existing pipeline of "planning after predicting" is too conservative, can reduce traffic efficiency. Using game theory to model the non-cooperative coupling relationships between multiple vehicles can resolve the above problems, but such methods cannot guarantee safety without collision. This paper presents motion planning for autonomous driving with safe differential games based on Control Barrier Function (CBF), and also provides a safety-critical generalized Nash equilibrium seeking algorithm. We handle the hard CBF constraints through augmented Lagrangian multiplier method. Motivated by iterative Linear-Quadratic Game (iLQG) algorithm, we use the Taylor expansion method to approximate the model into an Linear-Quadratic (LQ) structure, and then incrementally solve this problem with an iterative feedback LQ game algorithm. Through Carla simulation and hardware testing, our results indicate that the algorithm can find a balance between safety and efficiency while maintaining real-time implementation performance.

关键词： Differential games Games approximation algorithms Real-time systems Iterative algorithms Hardware Planning

来源：评论

学校读者我要写书评

暂无评论

Contactless In-Bed Detection Using a Low-Cost Low-Resolution Radar

Contactless In-Bed Detection Using a Low-Cost Low-Resolution...

引用

IEEE SENSORS

作者： Hajar Abedi Ahmad Ansariyan George Shaker University of Waterloo Waterloo Canada

ISBN: (数字)9798350363517

ISBN: (纸本)9798350363524

In this paper, we outline our proposed system for comprehensive resident monitoring in long-term care facilities, with a primary focus on achieving precise in-bed status detection, which is critical for ensuring the safety and well-being of vulnerable populations. This paper addresses the challenge of accurately detecting the in-bed status of elderly residents in long-term care facilities using lowresolution radar technology. We introduce a novel algorithm that leverages the static nature of bed locations to enhance detection capabilities. Trained on various datasets to overcome the radar's low angular resolution of approximately 56 degrees, our proposed model significantly improves in-bed detection accuracy, achieving a rate of 98% accuracy. This approach presents a scalable, non-invasive solution to enhance resident safety and care quality, making it suitable for widespread implementation in resource-limited environments.

关键词： Accuracy Radar detection Radar approximation algorithms Safety Sensors Older adults Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：