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

2024 International Conference on Optics, Electronics, and Communication Engineering, OECE 2024

作者： Li, Meicheng Feng, Xiaoen Xu, Minqiang Li, Yuqing Institute of Deep Space Exploration Harbin Institute of Technology Harbin China

ISBN: (纸本)9781510685437

With the gradual increase in the breadth and depth of remote sensing satellite applications, the continuous observation of targets by multi-satellite coordinated relay has become an important means to improve information assurance capabilities. application. This paper proposes a multi-level guided satellite mission collaborative planning algorithm, and designs a modular process and a final plan verification algorithm for multi-level guidance. At the same time, this paper proposes and standardizes various constraints and inspection procedures in guided planning, and ensures the accuracy and robustness of the planning scheme by introducing effectiveness and delay constraints, uniqueness constraints and energy balance constraints. It can achieve continuous observation of various targets under the premise of meeting the timeliness requirements. The validity and accuracy of the algorithm are verified by the simulation calculation of reconnaissance satellites and point targets, regional targets, and moving targets, and the calculation planning for complex task requirements is realized. © 2024 SPIE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Block Method using Equidistant Grid Points for Numerical Integration

Block Method using Equidistant Grid Points for Numerical Int...

引用

2024 International Conference on Science, Engineering and Business for Driving Sustainable Development Goals, SEB4SDG 2024

作者： Akinola, Richard Olatokunbo Ololade Olamide, Oluwadamilola Omole, Ezekiel Olaoluwa Otonritse Okoro, Joshua University of Jos Faculty of Natural Science Department of Mathematics Plateau State Jos Nigeria University of Jos Department of Mathematics Plateau State Jos Nigeria Landmark University Department of Physical Sciences Mathematics Programme Kwara State Omu-Aran Nigeria

ISBN: (纸本)9798350358155

In this paper, we introduce a two-step linear multistep second derivative block hybrid method for approximating various types of ordinary differential equations. Our method is A- stable, possesses a broad region of absolute stability, and demonstrates convergence with a minimal error constant. Numerical experiments indicate that our approach matches the accuracy of exact solutions and outperforms a higher-order method from existing literature. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Online k-Median with Consistent Clusters 27

Online k-Median with Consistent Clusters

引用

27th International Conference on Approximation algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024

作者： Moseley, Benjamin Newman, Heather Pruhs, Kirk Tepper School of Business Carnegie Mellon University PittsburghPA United States Department of Mathematical Sciences Carnegie Mellon University PittsburghPA United States Department of Computer Science University of Pittsburgh PittsburghPA United States

ISBN: (纸本)9783959773485

We consider the problem in which n points arrive online over time, and upon arrival must be irrevocably assigned to one of k clusters where the objective is the standard k-median objective. Lower-bound instances show that for this problem no online algorithm can achieve a competitive ratio bounded by any function of n. Thus we turn to a beyond worst-case analysis approach, namely we assume that the online algorithm is a priori provided with a predicted budget B that is an upper bound to the optimal objective value (e.g., obtained from past instances). Our main result is an online algorithm whose competitive ratio (measured against B) is solely a function of k. We also give a lower bound showing that the competitive ratio of every algorithm must depend on k. © Benjamin Moseley, Heather Newman, and Kirk Pruhs.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Iterative algorithm for the Quadratic Programming Problem Based on the Modified Uzawa Method and ALPMHSS Iteration Method 4

A New Iterative Algorithm for the Quadratic Programming Prob...

引用

4th International Conference on Computer Science and Blockchain, CCSB 2024

作者： Xiong, Jinsong Guizhou University of Commerce Guiyang550014 China

ISBN: (纸本)9798350356502

We researches a new iterative algorithm for quadratic programming problem based on the modified Uzawa algorithm and the ALPMHSS iteration algorithm in this paper. And we obtains the convergence theorem and the eigenvalues distribution of the preconditioned matrix of the new algorithm. By selecting two different parameter matrices, we compared the clustering of the preconditioned matrix with the original coefficient matrix. Numerical example show that the proposed new algorithm has good convergence. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel locally statistical active contour model for SAR image segmentation and faster algorithm 4

A novel locally statistical active contour model for SAR ima...

引用

2024 4th International Conference on Computer, Remote Sensing and Aerospace, CRSA 2024

作者： Liu, Guangming Liu, Kai Liu, Qi Liang, Jing Yantai Association for Science and Technology Yantai264001 China Naval Aviation University Yantai264001 China Yantai Municipal Health Commission Yantai264003 China Business School of Ludong University Yantai264001 China

In this paper, a novel locally statistical active contour model (LACM) based on the Aubert-Aujol (AA) denoising model and variational level set method is proposed, which can be used for SAR image segmentation with intensity inhomogeneity. By simple transformation, a fast segmentation algorithm with a global optimization solver can be obtained. Experiments using some challenging synthetic images and Envisat SAR images demonstrate the superiority of our proposed models with respect to classic models. Further, we can find that the structure of the proposed algorithm is the same as that of the Transformer or RNN. We will study the nature of the above two types of algorithms to propose a more effective segmentation algorithm based on the energy model. © Published under licence by IOP Publishing Ltd.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of a Two Layered Blockchain-Based Reputation System in Vehicular Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2022年第2期71卷 1209-1223页

作者： Lee, Soojin Seo, Seung-Hyun Hanyang Univ Grad Sch Dept Elect Engn Seoul 04763 South Korea Hanyang Univ Div Elect Engn ERICA Campus Ansan 15588 Gyeonggi Do South Korea

Vehicles on the road, where an Intelligent Transportation System (ITS) is built, can share a lot of traffic information and drive more safely and efficiently through data sharing. Since incorrect information misleads vehicles and causes confusion in traffic, a vehicular trust model is needed to check the message's trustworthiness while considering the vehicle's properties and protecting its privacy. In this paper, we proposed a two layered blockchain-based reputation system, which consists of a local one-day message blockchain and a global vehicle reputation blockchain. It can administrate the reputation score securely and preserve the vehicle's partial privacy. The proposed model efficiently manages local traffic information through the local one-day blockchain, reducing the memory overhead of vehicles. As the vehicle's actual identity and activities in other areas are hidden by using one-time public keys, partial privacy of the vehicle is preserved. According to the activity of the vehicle, the vehicle's reputation score is updated and stored permanently in the global reputation blockchain. We also suggested the location-based practical byzantine fault tolerance (LPBFT), a new consensus algorithm for fast block generating. The LPBFT lowers message propagation time through location-based primary node selection and is about 1.4 times faster than existing PBFT. The simulation results show the efficiency and the feasibility of LPBFT and our proposed protocol.

关键词： Blockchains Privacy consensus algorithm Computational modeling Trust management Public key Accidents Blockchain security vehicular reputation management

来源：评论

学校读者我要写书评

暂无评论

consensus-Based Distributed Computation of Link-Based Network Metrics

引用

IEEE SIGNAL PROCESSING LETTERS 2021年 28卷 249-253页

作者： Chen, Zheng Larsson, Erik G. Linkoping Univ Dept Elect Engn ISY S-58183 Linkoping Sweden

Average consensus algorithms have wide applications in distributed computing systems where all the nodes agree on the average value of their initial states by only exchanging information with their local neighbors. In this letter, we look into link-based network metrics which are polynomial functions of pair-wise node attributes defined over the links in a network. Different from node-based average consensus, such link-based metrics depend on both the distribution of node attributes and the underlying network topology. We propose a general algorithm using the weighted average consensus protocol for the distributed computation of link-based network metrics and provide the convergence conditions and convergence rate analysis.

关键词： Measurement Convergence consensus algorithm Signal processing algorithms Eigenvalues and eigenfunctions Symmetric matrices Social networking (online) Average consensus distributed computing total variation

来源：评论

学校读者我要写书评

暂无评论

Evolving A* to Efficiently Solve the κ Shortest-Path Problem 27

Evolving A* to Efficiently Solve the κ Shortest-Path Proble...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： López, Carlos Linares Herman, Ian Computer Science and Engineering Department Universidad Carlos III de Madrid Spain

ISBN: (纸本)9781643685489

The problem of finding the shortest path in a graph G(V, E) has been widely ***, in many applications it is necessary to compute an arbitrary number of them, κ.Even though the problem has raised a lot of interest from different research communities and many applications of it are known, it has not been addressed to the same extent as the single shortest path *** best algorithm known for efficiently solving this task has a time complexity of O(|E| + |V | log |V | + κ|V |) when computing paths in explicit form, and is based on best-first *** paper introduces a new search algorithm with the same time complexity, which results from a natural evolution of A* thus, it preserves all its interesting properties, making it widely applicable to many different *** in various testbeds show a significant improvement in performance over the state of the art, often by one or two orders of magnitude. © 2024 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Comparative Evaluation of Different Distance Measures for Determining Initial Seeds in the K-means algorithm 8th

A Comparative Evaluation of Different Distance Measures for ...

引用

8th International Conference on Information and Communication Technology for Intelligent Systems, ICTIS 2024

作者： Jambudi, Trushali Gandhi, Savita Department of Computer Science Gujarat University Ahmedabad India

ISBN: (纸本)9789819766741

The selection of a particular distance metric can have a substantial impact on the efficiency of a clustering process and, consequently, the outcome. QuIK, a deterministic seeding method for the K-means algorithm that we previously proposed, uses a unique distance function. With quartiles as the first centers, our unique distance function measures closeness by calculating the minimum absolute difference between each data point and each quartile (Q1, Q2, and Q3), and places each data point in the cluster of the closest quartile. In this paper we show with the help of simulations on both real and artificial datasets, that the unique distance function proposed by us for the QuIK seeding approach beats some of the most popular distance functions in the literature including Euclidean, Manhattan, and Chebyshev, at identifying object similarity in numerical data. The results of our simulations show that our proposed distance measure performs noticeably better than the distance measures used widely in the K-means algorithm, and therefore, our proposed distance metric has the potential to be applied in the K-means algorithm to increase the algorithm’s efficacy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT 13

Using Island Model in Asynchronous Evolutionary Strategy to ...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Pavlenko, Artem Semenov, Alexander Itmo University Saint Petersburg Russia

ISBN: (纸本)9798350308365

In this paper we propose new evolutionary algorithms for finding the so-called backdoors - special structures that make it possible to simplify the solving of combinatorial problems expressed as systems of constraints. In particular, we consider the Boolean satisfiability problem (SAT) and search for ρ-backdoors for Boolean formulas. We analyze the problem of finding ρ-backdoors of small fixed size and adapt (1+1)-EA for its solving: in the proposed algorithm the mutation is performed in such a way that it transitions between Boolean vectors of fixed weight. The proposed algorithm was implemented in the context of a parallel asynchronous strategy based on the island paradigm. In the experimental part we demonstrate the applicability of this algorithm by using the found backdoors to solve extremely hard instances from the area of Logical Equivalence Checking for Boolean circuits: our approach on this class of benchmarks outperforms the best state-of-the-art SAT solvers. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：