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

24th International Conference on algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Mei, Ao Yu, Dunhui School of Computer Science and Information Engineering Hubei University Wuhan430062 China Engineering and Technical Research Center of Hubei Province in Educational Informatization Wuhan430062 China

ISBN: (纸本)9789819615278

Aiming at the problem of insufficient consideration of skill rarity and worker skill coverage in the task allocation decision of the current software crowdsourcing platform, this paper proposes a task priority-based software crowdsourcing allocation algorithm. First, the skill rarity is calculated based on the tasks to be assigned and the development skills of workers, and the task priority is determined accordingly. Then, the pre-allocation scheme based on the priority is used as the initial input of the allocation algorithm. Finally, the parameters of the algorithm are set based on the global optimization objectives of maximizing the number of tasks to be assigned and minimizing the number of workers to complete the crowdsourcing task allocation. The experimental results show that compared with allocation algorithms such as candidate task worker group algorithm based on allocation utility and preference matching satisfaction maximization, The algorithms in this paper improves the number of successful task allocations and average worker overhead by 15.23% and 12.76% on average. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

VBEA: Voting-Based Evolutionary algorithm for Multi-objective Planning 13th

VBEA: Voting-Based Evolutionary Algorithm for Multi-objecti...

引用

13th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2025

作者： Merino, Daniel Korpan, Raj Hunter College City University of New York New YorkNY10065 United States The Graduate Center City University of New York New YorkNY10016 United States

ISBN: (纸本)9789819635054

This paper presents VBEA, the Voting-Based Evolutionary algorithm, that efficiently solves multi-objective path planning problems with voting and iterative evolutionary improvement. VBEA uses problem decomposition to create an initial population of candidate solutions that are each optimal in a single objective or randomly generated. VBEA then applies social choice theory through voting as a fitness function for the evolutionary algorithm. Each objective is a voter that evaluates the candidate solutions and assigns each of them a score or ranking depending on the voting method used. Voting identifies the top candidates and they are used to create the next generation of solutions. VBEA’s novel hybrid approach combines the ability of voting mechanisms to balance multiple perspectives and priorities with the ability of evolutionary algorithms to iteratively improve solutions to form a dense and diverse Pareto-front approximation. Extensive evaluation in difficult and complex environments demonstrates VBEA’s efficiency and performance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Fine-Grained Complexity of Approximating Max k-Coverage 18th

On the Fine-Grained Complexity of Approximating Max k-Cove...

引用

18th International Joint Conference on Theoretical Computer Science-Frontier of algorithmic Wisdom, IJTCS-FAW 2024

作者： Wang, Haoqi Nanjing University Nanjing China

ISBN: (纸本)9789819777518

The max k-coverage problem asks us to select k subsets from a collection S of subsets of a universe U, such that the union of these k subsets covers as many elements of U as possible. We prove that for every λ∈(0,1) and k∈N, there exists an algorithm which, given a max k-coverage instance with input size N, finds k sets that cover at least (1-1/e+λ/e)·opt elements for max k-coverage in O(Nλk+O(1))-time, where opt is the number of elements covered by the optimal solution. On the other hand, we show that, assuming the Gap Exponential Time Hypothesis, while λ is a constant, the fastest (1-1/e+λ)-approximation algorithm for max k-coverage running in O(Nαk+o(1)) time satisfies α≥Ω(λ4). While non constant λ=λ(k) is a small function of k, the fastest (1-1/e+λ)-approximation for max k-coverage running in time O(Nαk+o(1)) satisfies α≥Ω(λ1λ). © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A High Utility Co-location Pattern Mining algorithm Using Multiple Utility Thresholds 25th

A High Utility Co-location Pattern Mining Algorithm Using Mu...

引用

25th International Conference on Web Information Systems Engineering, WISE 2024

作者： Tran, Vanha Bui, Thiloan Do, Thaigiang Le, Hoangan FPT University Hanoi155514 Viet Nam

ISBN: (纸本)9789819605781

High utility co-location pattern (HUCP) mining refers to discovering a group of spatial features from spatial data which the instances of the group are neighbors in space and have high utility values. Currently, existing algorithms use a unique minimum utility threshold to filter HUCPs, but instance utility values and instance numbers of features in datasets vary greatly, thus it is not fair to compare all features with a unique threshold, which can easily filter out some interesting patterns. This paper proposes an algorithm for mining HUCPs based on multiple utility thresholds to void this issue. Users set a utility threshold for each feature according to their application field. The threshold of a pattern is adaptively determined by the features involved in it, i.e., the minimum threshold of these features that participate in the pattern. Moreover, to avoid repeatedly verifying the neighboring relationships between instances when collecting participating instances of each pattern, this paper adopts a mining method that uses maximal cliques and a hash table structure. First, neighboring instances are enumerated only once by maximal cliques and put into a close-packed hash structure. Then, the instances of features that participate in any patterns are queried from this structure without repeatedly verifying neighbor relationships. The designed algorithm is experimentally assessed on both synthetic and real-world spatial data. The results prove that the designed algorithm is more effective and efficient than existing algorithms. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Output Feedback Predefined-Time Bipartite consensus Control for High-Order Nonlinear Multiagent Systems

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2021年第7期68卷 3069-3078页

作者： Li, Kuo Hua, Changchun You, Xiu Ahn, Choon Ki Yanshan Univ Sch Elect Engn Qinhuangdao 066004 Hebei Peoples R China Korea Univ Sch Elect Engn Seoul 136701 South Korea Shanxi Univ Sch Math Sci Taiyuan 030006 Peoples R China

This paper concerns the predefined-time bipartite consensus control for uncertain nonlinear multiagent systems under a signed directed topology. All agents have high-order uncertain nonlinear dynamic characteristics satisfying a time-varying Lipschitz growth condition, and their partial state information is not available for measurement. In this case, we put forward a novel output-feedback-based predefined-time leader-following bipartite consensus control strategy. A predefined-time compensator for each follower is firstly constructed with a time-varying gain by utilizing its relative output information. Then, a novel linear-like output feedback predefined-time distributed control protocol is developed for each follower by means of the compensator. By making two artful state transitions, the bipartite consensus problem is reduced to a stabilization one of nonlinear systems. By means of the Lyapunov stability theorem, we strictly prove that the designed controllers can ensure that all agents realize bipartite consensus in predefined time. Finally, two simulation examples are given to validate the viability of the developed theoretical algorithm.

关键词： Multi-agent systems consensus control Topology Output feedback consensus algorithm Nonlinear dynamical systems Heuristic algorithms Bipartite consensus output feedback controllers predefined-time control a time-varying gain uncertain nonlinear multiagent systems

来源：评论

学校读者我要写书评

暂无评论

An Improved Distributed Cooperative Control Strategy for Multiple Energy Storages Parallel in Islanded DC Microgrid

引用

IEEE JOURNAL OF EMERGING AND SELECTED TOPICS IN POWER ELECTRONICS 2022年第1期10卷 455-468页

作者： Zhang, Qinjin Zeng, Yuji Liu, Yancheng Zhuang, Xuzhou Zhang, Hanwen Hu, Wangbao Guo, Haohao Dalian Maritime Univ Coll Marine Engn Dalian 116026 Peoples R China

This article proposes an improved distributed cooperative control strategy for the energy storage system (ESS) in islanded dc microgrid. To meet the requirements of state of charge (SoC) balance, accurate current sharing, and voltage regulation, a hierarchical control structure is established. In the primary control layer, the droop coefficient is adaptively adjusted through the SoC dynamic changes in each energy storage unit (ESU) to achieve SoC balance, and two balance adjustment factors are introduced to improve SoC convergence speed and accuracy. In the secondary control layer, an information state factor is designed to eliminate the influence of the inconsistent line resistance on the SoC balance and realize the dc bus voltage recovery. In the communication layer, each ESU only exchanges information with neighboring nodes through a sparse communication network, in which a dynamic consensus algorithm is used to achieve stable convergence of global average information. Finally, a dc microgrid simulation model and StarSim HIL experimental platform are built. The results show that the proposed control strategy can achieve SoC balance and accurate load current sharing under a variety of complex operating conditions and have excellent plug-and-play performance.

关键词： Bus voltage recovery consensus algorithm current sharing dc microgrid state of charge (SoC) balance

来源：评论

学校读者我要写书评

暂无评论

Secure Device-to-Device Caching With Blockchain

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第20期9卷 20750-20762页

作者： Guzey, Sueda Karabulut-Kurt, Gunes Mhaish, Anas Ozdemir, Enver Tavakkoli, Nasim Istanbul Tech Univ Informat Inst TR-34467 Istanbul Turkey Polytech Montreal Dept Elect Engn Montreal PQ H3T 1J4 Canada Sabanci Univ Dept Cyber Secur TR-34956 Istanbul Turkey

Caching and distributing of network packets among devices has been accepted by the research community as a cost-effective method of transferring especially audio-video data among mobile users. Another newly established technology, blockchain, has been successfully applied to decentralized financial systems like Bitcoin. The research on caching and distributing methods has not focused on the security aspect so far. In this article, we present an effective scheme to provide security and integrity of network packets in caching and distribution systems by employing the blockchain technology. Unlike the existing blockchain applications, the proposed protocol requires a lightweight consensus algorithm. Our scheme also allows peers in the network to make correctly addressed inquiries as the packets' locations are kept in the blocks which are available to any peer in the network. Considering that cryptographic primitives alone are not adequate to prevent malicious network packets among the peers, the proposed blockchain application presents an invaluable tool to prevent malicious packets from leaking into the system and to address which peers own the desired packets. We demonstrate the efficiency of the proposed method by implementing it for Android OS devices and conduct real-time testing on different settings.

关键词： Blockchains Peer-to-peer computing Bitcoin Cryptography Streaming media consensus protocol consensus algorithm Blockchain caching cooperative video-streaming device-to-device (D2D) communication secure communication

来源：评论

学校读者我要写书评

暂无评论

Bilevel Heat-Electricity Energy Sharing for Integrated Energy Systems With Energy Hubs and Prosumers

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2022年第6期18卷 3754-3765页

作者： Liu, Nian Tan, Lu Sun, Haonan Zhou, Zhenyu Guo, Bin North China Elect Power Univ State Key Lab Alternate Elect Power Syst Renewabl Sch Elect & Elect Engn Beijing 102206 Peoples R China Dept State Grid Fuzhou Elect Power Supply Co Fuzhou 350004 Peoples R China

The heat-electricity integrated energy system (HE-IES) with energy hubs (EHs) and prosumers is the typical form of future energy systems. An EH can efficiently model the integration of different energy carriers and coordinate an integrated energy sharing system of multiple prosumers in HE-IES. In this article, a closed-loop framework is designed to integrate the contract theory and consensus algorithms for a bilevel heat-electricity energy sharing system. First, the energy sharing scheme between prosumers and an EH in the lower level energy system is formulated. Contract theory is utilized to maximize the profits of an EH under the information asymmetry scenario, and different contract items are designed for the electric and thermal networks. In particular, a set of new bidirectional contract items is proposed in the electrical network. Furthermore, a consensus-based energy sharing framework among various EHs and utility grid in the upper level system is developed and network constraints are considered. Two types of Lagrange multipliers are defined to decouple the electric and thermal network, and an interactive mechanism is designed to solve the problem. Finally, the simulation results verify the convergence of the bilevel closed-loop framework and the feasibility and performance of the scheme.

关键词： Contracts Heating systems Resistance heating consensus algorithm Cogeneration Costs Production consensus algorithm contract theory energy hub (EH) energy sharing integrated energy system (IES) prosumer

来源：评论

学校读者我要写书评

暂无评论

Public Participation Consortium Blockchain for Smart City Governance

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第3期9卷 2094-2108页

作者： Bai, Yuhao Hu, Qin Seo, Seung-Hyun Kang, Kyubyung Lee, John J. Hanyang Univ Dept Elect & Elect Engn Seoul 04763 South Korea Indiana Univ Purdue Univ Dept Comp & Informat Sci Indianapolis IN 46202 USA Hanyang Univ Div Elect Engn ERICA Campus Ansan 15588 South Korea Indiana Univ Purdue Univ Dept Engn Technol Indianapolis IN 46202 USA Indiana Univ Purdue Univ Dept Elect & Comp Engn Indianapolis IN 46202 USA

Smart cities have become a trend with improved efficiency, resilience, and sustainability, providing citizens with high quality of life. With the increasing demand for a more participatory and bottom-up governance approach, citizens play an active role in the process of policy making, revolutionizing the management of smart cities. In the example of urban infrastructure maintenance, the public participation demand is more remarkable as the infrastructure condition is closely related to their daily life. Although blockchain has been widely explored to benefit data collection and processing in smart city governance, public engagement remains a challenge. In this article, we propose a novel public participation consortium blockchain system for infrastructure maintenance that is expected to encourage citizens to actively participate in the decision-making process and enable them to witness all administrative procedures in a real-time manner. To that aim, we introduced a hybrid blockchain architecture to involve a verifier group, which is randomly and dynamically selected from the public citizens, to verify the transaction. In particular, we devised a private-prior peer-prediction-based truthful verification mechanism to tackle the collusion attacks from public verifiers. Then, we specified a Stackelberg-game-based incentive mechanism for encouraging public participation. Finally, we conducted extensive simulations to reveal the properties and performances of our proposed blockchain system, which indicates its superiority over other variations.

关键词： Maintenance engineering consensus protocol Internet of Things Smart cities Electronic voting Sustainable development Supply chain management Blockchain consensus algorithm smart city smart governance

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence Embedded New Media Content Intelligent Recommendation algorithm 14th

Artificial Intelligence Embedded New Media Content Intellige...

引用

14th International Conference on Frontier Computing, FC 2024

作者： He, Xiaotong Xi’an Eurasia University Shaanxi Xi’an710065 China

ISBN: (纸本)9789819627936

With the continuous improvement of algorithmic recommendation technology and the rapid development of online media, network users have shown characteristics such as "crowdsourcing", which has led to an increasing proportion of news and information dissemination methods based on content intelligent recommendation algorithms. This article explores the process of embedding artificial intelligence (AI) into intelligent recommendation algorithms for new media content, including collaborative filtering, rating matrix, matrix decomposition, feature embedding, recall, and policy ranking. According to the type of user behavior, positive feedback is categorized as playing, browsing, commenting, following, forwarding, etc. If there is no behavior, it is 0, and negative feedback is given to those who do not like it. In the process of matrix model decomposition, this article uses metadata for information hiding, reflecting the positive energy weight of mainstream media attributes on content. This article takes Today’s Headlines as an example to explore. After adopting the algorithm, the click through rate in the 6th month increased by 22%, and the content distribution increased by 48%. The algorithm in this article improved the recommendation effect. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：