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

Piecewise Sparse Recovery in Union of Bases

Journal of Mathematical Research with Applications 2023年第3期43卷 363-378页

作者： Chongjun LI Yijun ZHONG School of Mathematical Sciences Dalian University of Technology

Sparse recovery（or sparse representation） is a widely studied issue in the fields of signal processing, image processing, computer vision, machine learning and so on, since signals such as videos and images, can be sparsely represented under some frames. Most of fast algorithms at present are based on solving l0or l1minimization problems and they are efficient in sparse recovery. However, the theoretically sufficient conditions on the sparsity of the signal for l0or l1minimization problems and algorithms are too strict. In some applications, there are signals with structures, i.e., the nonzero entries have some certain distribution. In this paper,we consider the uniqueness and feasible conditions for piecewise sparse recovery. Piecewise sparsity means that the sparse signal x is a union of several sparse sub-signals xi（i=1, 2,..., N）,i.e., x=（x1T, x2T,..., xNT）T, corresponding to the measurement matrix A which is composed of union of bases A=[A1, A2,..., AN]. We introduce the mutual coherence for the sub-matrices Ai（i = 1, 2,..., N） by considering the block structure of A corresponding to piecewise sparse signal x, to study the new upper bounds of ‖x‖0（number of nonzero entries of signal） recovered by both l0and l1optimizations. The structured information of measurement matrix A is exploited to improve the sufficient conditions for successfully piecewise sparse recovery and also improve the reliability of l0and l1optimization models on recovering global sparse vectors.

关键词： piecewise sparse recovery union of bases mutual coherence greedy algorithm BP method

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Routing algorithm for Upgrading Network Efficiency 1

A Novel Hybrid Routing Algorithm for Upgrading Network Effic...

引用

1st International Conference on Advances in Electrical, Electronics and Computational Intelligence, ICAEECI 2023

作者： Sheenam Chadha, Raman Chandigarh University CSE Mohali India

ISBN: (纸本)9798350342796

In Wireless Mesh network each node is connected to other node through mesh topology using static and dynamic mesh routers. In mesh network data can be transferred to different nodes but if multiple radios use same channel for data transmission there may be congestion over the network and data cannot be mitigated on time. Sometime loss of data packets or retransmission occur. To reduce this issue or improve the network capacity multi-radio and multi-channel technique will be used, in this each node is holding multiple radio that is further connected with multiple channels for data transfer. Further to reduce the problem of overlapping channels a hybrid approach will be proposed that use greedy algorithm with Breath First Search (BFS) to select optimal path for data transmission from source to destination. © 2023 IEEE.

关键词： BFS congestion greedy algorithm Mesh network routing

来源：评论

学校读者我要写书评

暂无评论

Geometric Model and algorithm for Passive Location of Unmanned Aerial Vehicles 6

Geometric Model and Algorithm for Passive Location of Unmann...

引用

6th IEEE International Conference on Automation, Electronics and Electrical Engineering, AUTEEE 2023

作者： Li, Jinheng Cai, Shengbo Zhejiang Sci-Tech University College of Life Science and Medicine Hangzhou China Zhejiang Sci-Tech University School of Computer Science and Technology Hangzhou China

ISBN: (纸本)9798350305623

When drones are flying in formation, in order to minimize external interference, the bearings-only passive positioning method is generally used to adjust the position of the drones. This paper studies various situations of passive localization and establishes localization models for unmanned aerial vehicles in various situations. The solutions have been successfully given for different situations and various applications. An adjustment plan for the drone has been designed. We use greedy algorithm to adjust the two drones within this triangle multiple times, except for the vertices, until the received angle information converges to 60 degrees and determine the position of the remaining drones using triangulation positioning method. It can be concluded that the scheme has good stability and accuracy through analysis. © 2023 IEEE.

关键词： Geometric Positioning greedy algorithm Sine Theorem Triangulationt

来源：评论

学校读者我要写书评

暂无评论

Toward a certified greedy Loewner framework with minimal sampling

引用

ADVANCES IN COMPUTATIONAL MATHEMATICS 2023年第6期49卷 92-92页

作者： Pradovera, Davide Univ Vienna Dept Math Oskar-Morgenstern-Pl 1 A-1090 Vienna Austria

We propose a strategy for greedy sampling in the context of non-intrusive interpolation-based surrogate modeling for frequency-domain problems. We rely on a non-intrusive and cheap error indicator to drive the adaptive selection of the high-fidelity samples on which the surrogate is based. We develop a theoretical framework to support our proposed indicator. We also present several practical approaches for the termination criterion that is used to end the greedy sampling iterations. To showcase our greedy strategy, we numerically test it in combination with the well-known Loewner framework. To this effect, we consider several benchmarks, highlighting the effectiveness of our adaptive approach in approximating the transfer function of complex systems from a few samples.

关键词： Loewner framework Rational approximation Model order reduction greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Matching Market with Agent-Dependent Compatible Probabilities

Dynamic Matching Market with Agent-Dependent Compatible Prob...

引用

作者： Tao, Lan University of California Los Angeles

学位级别：M.S., Master of Science/Master of Surgery

Numerous dynamic matching market models pursuing different objectives have been developed for kidney exchange studies. These objectives range from minimizing waiting time and maximizing welfare to reducing the fraction of unmatched agents. Motivated by the medical observation that better matching outcomes are often achieved when donors and recipients share the same race, we extend the dynamic matching model by Akbarpour et al. (2020) to a matching market with two types of agents, in which the compatible probability depends on agent types. In this study, we examine the performance of two matching algorithms, namely greedy algorithm and Patient algorithm, from both theoretical and empirical perspectives. Our aim is to investigate whether delaying the matching process to thicken the market can effectively decrease the fraction of unmatched agents within the market.

关键词： Dynamic matching Compatible probabilities Market models greedy algorithm Patient algorithm

来源：评论

学校读者我要写书评

暂无评论

Feeder segment switch-based relay protection for a multilayer differential defense-oriented distribution network

引用

SOFT COMPUTING 2022年第10期26卷 4895-4904页

作者： Wang, Qingjie North China Elect Power Univ Sch Elect & Elect Engn Beijing Peoples R China

System operation features such as grid size, changes in regional distribution of power grid, power grid structure and diversity in networks bring more complexity due to the electrical connections and integrity of the distributed networks. Problems in relay safety and identification of faults in distribution network are the key issues that require immediate solutions due to flaws in the existing relay protection methods. The current paper proposes a relay protection method based on a feeder segment switches in multilevel differential defense-oriented distribution network. A greedy algorithm is devised to set the positions of feeder switches for optimal utilization of energy. After considering the multiple benefits of using feeder switches in the distribution networks, the main feeder is segmented and is linked to contact switches to enhance safety and to reduce the overhead cost of multiple feeder switches. The positioning of feeder switches is determined using greedy algorithm. Main feeder switches of the distribution network select the load switches to meet the requirements of relay protection. In case of occurrence of fault in the distribution network branches, the corresponding sectional feeder switch will trip immediately and the fault will be removed before the resumption of feeder switch. A relay protection method is integrated in the proposed method to keep the distributed network free from faults. The empirical results prove the efficacy of the proposed method with respect to the safety of the relay station, cost saving, determination of faults and consumption of energy. The comparative study with the existing methods reveals that the proposed method has the maximum safety factor of relay protection for the multistage differential distribution network, i.e., about 97%. The proposed method has the least fault location error, it saves operational cost, and it consumes minimal energy as compared to other techniques.

关键词： Feeder segment switch Multistage differential Relay protection Objective function greedy algorithm Protection of disoperation Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Improved Migrating Birds Optimization algorithm to Solve Hybrid Flowshop Scheduling Problem with Lot-Streaming of Random Breakdown 1

引用

7th International Conference on Machine Learning, Optimization, and Data Science (LOD) / 1st Symposium on Artificial Intelligence and Neuroscience (ACAIN)

作者： Wang, Ping De Leone, Renato Sang, Hongyan Univ Camerino I-62022 Camerino MC Italy Liaocheng Univ Liaocheng 252000 LC Peoples R China

ISBN: (数字)9783030954703

ISBN: (纸本)9783030954703;9783030954697

An improved migrating birds optimization (IMBO) algorithm is proposed to solve the hybrid flowshop scheduling problem with lot-streaming of random breakdown (RBHLFS) with the aim of minimizing the total flow time. To ensure the diversity of the initial population, a Nawaz-Enscore-Ham (NEH) heuristic algorithm is used. A greedy algorithm is used to construct a combined neighborhood search structure. An effective local search procedure is utilized to explore potential promising neighborhoods. In addition, a reset mechanism is added to avoid falling into local optimum. Extensive experiments and comparisons demonstrate the feasibility and effectiveness of the proposed algorithm.

关键词： Hybrid flowshop Lot-streaming MBO algorithm Random breakdown NEH algorithm greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Trajectory Planning for Data Collection in Multi-UAV Assisted WSNs 95

Trajectory Planning for Data Collection in Multi-UAV Assiste...

引用

IEEE 95th Vehicular Technology Conference: (VTC-Spring)

作者： Benmad, Ilham Driouch, Elmahdi Kardouchi, Mustapha Univ Moncton Moncton NB Canada Univ Quebec Montreal Montreal PQ Canada

ISBN: (数字)9781665482431

ISBN: (纸本)9781665482431

The deployment of unmanned aerial vehicles (UAVs) for data collection in wireless sensor networks (WSNs) is gaining recently more research interest, thanks to the numerous advantages of UAVs. In fact, UAVs can be deployed quickly almost anywhere and are able to access difficult terrains. However, both WSNs and UAV suffer from serious energy limitation challenges. Fortunately, when they are available, using multiple UAVs along with appropriate trajectory planning schemes can highly reduce the negative impact of this problem. In this paper, we deal with the problem of data collection in a WSN assisted by multiple UAVs. Our main goal is to minimize the mission total time by jointly optimizing the trajectories of all the UAVs while serving the sensor nodes (SNs). The mission total time is defined as the time required by the UAVs to transfer energy to all using wireless power transfer (WPT) and collect data from these SNs. In addition to the highly complex optimal solution, we propose two heuristics to solve the formulated problem, namely the nearest insertion algorithm (NIA) and the greedy algorithm (GA).

关键词： Data collection WPT WSN multiple UAVs nearest insertion algorithm greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

ON THE PERFORMANCE-COMPLEXITY TRADEOFF IN STOCHASTIC greedy WEAK SUBMODULAR OPTIMIZATION

ON THE PERFORMANCE-COMPLEXITY TRADEOFF IN STOCHASTIC GREEDY ...

引用

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

作者： Hashemi, Abolfazl Vikalo, Haris de Veciana, Gustavo UT Austin Dept Elect & Comp Engn Austin TX USA UT Austin Oden Inst Computat Engn & Sci Austin TX 78712 USA

ISBN: (纸本)9781728176055

Weak submodular optimization underpins many problems in signal processing and machine learning. For such problems, under a cardinality constraint, a simple greedy algorithm is guaranteed to find a solution with a value no worse than 1 - e(-gamma) of the optimal. Given the high cost of queries to large-scale signal processing models, the complexity of greedy becomes prohibitive in modern applications. In this work, we study the tradeoff between performance and complexity when one resorts to random sampling strategies to reduce the query complexity of greedy. Specifically, we quantify the effect of uniform sampling strategies on the performance through two criteria: (i) the probability of identifying an optimal subset, and (ii) the suboptimality of the solution's value with respect to the optimal. Building upon this insight, we propose a simple progressive stochastic greedy algorithm, study its approximation guarantees, and consider its applications to dimensionality reduction and feature selection tasks.

关键词： submodular optimization greedy algorithm subset selection feature selection

来源：评论

学校读者我要写书评

暂无评论

Energy Exchange Management in Smart Grids Using a Knapsack Problem Inspired Approach 21

Energy Exchange Management in Smart Grids Using a Knapsack P...

引用

21st IEEE Mediterranean Electrotechnical Conference (IEEE MELECON)

作者： Zerka, Ayoub Ouassaid, Mohammed Maaroufi, Mohamed Rabeh, Reda Mohammed V Univ Rabat Mohammadia Sch Engineers Engn Smart & Sustainable Syst Res Rabat Morocco

ISBN: (数字)9781665442800

ISBN: (纸本)9781665442800

In the context of energy management in distributed energy systems, different studies with various approaches have been carried out. This paper proposes a new and simple method to set rational energy trading preferences among microgrids inside an electrical network. To achieve this objective, a framework inspired from the famous optimization Knapsack problem is developed to model the multiobjective function of energy buyers, then a greedy algorithm is used in the solving process. The efficiency of the suggested method has been tested through simulations.

关键词： Knapsack problem Energy exchange Microgrids Optimal Energy Management greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：