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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,451 篇 期刊文献
1,156 篇 会议
3 篇 学位论文

馆藏范围

2,610 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,094 篇 工学
- 1,529 篇 计算机科学与技术...
- 692 篇 电气工程
- 577 篇 软件工程
- 306 篇 信息与通信工程
- 291 篇 控制科学与工程
- 102 篇 石油与天然气工程
- 56 篇 仪器科学与技术
- 47 篇 动力工程及工程热...
- 43 篇 机械工程
- 40 篇 航空宇航科学与技...
- 39 篇 电子科学与技术（可...
- 34 篇 土木工程
- 34 篇 交通运输工程
- 28 篇 建筑学
- 22 篇 网络空间安全
- 19 篇 力学（可授工学、理...
- 19 篇 测绘科学与技术
- 10 篇 材料科学与工程（可...
- 10 篇 环境科学与工程（可...
703 篇 理学
- 617 篇 数学
- 106 篇 统计学（可授理学、...
- 81 篇 系统科学
- 32 篇 物理学
- 21 篇 化学
- 20 篇 生物学
208 篇 管理学
- 130 篇 管理科学与工程(可...
- 82 篇 图书情报与档案管...
- 30 篇 工商管理
20 篇 经济学
- 19 篇 应用经济学
11 篇 法学
- 9 篇 社会学
10 篇 医学
2 篇 文学
2 篇 艺术学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

2,610 篇 consensus algori...
417 篇 blockchain
187 篇 blockchains
142 篇 security
128 篇 scalability
102 篇 heuristic algori...
99 篇 convergence
87 篇 fault tolerant s...
86 篇 throughput
85 篇 fault tolerance
85 篇 multi-agent syst...
79 篇 privacy
76 篇 microgrids
75 篇 consensus protoc...
74 篇 distributed cont...
73 篇 internet of thin...
73 篇 peer-to-peer com...
71 篇 protocols
66 篇 topology
62 篇 delays

机构

9 篇 xidian univ sch ...
8 篇 southeast univ s...
8 篇 google research ...
7 篇 columbia univers...
7 篇 aalborg univ dep...
7 篇 mit united state...
7 篇 shanghai jiao to...
6 篇 beihang univ sch...
6 篇 carnegie mellon ...
6 篇 southeast univ s...
6 篇 university of to...
5 篇 shanghai univ sc...
5 篇 beijing inst tec...
5 篇 shandong univ sc...
5 篇 school of mathem...
5 篇 nanyang technol ...
5 篇 north china elec...
5 篇 dalian maritime ...
5 篇 qufu normal univ...
4 篇 massachusetts in...

作者

13 篇 guerrero josep m...
12 篇 li junmin
8 篇 chen jiaxi
7 篇 dragicevic tomis...
7 篇 du yuhua
7 篇 chow mo-yuen
7 篇 kim hak-man
7 篇 schulz christian
6 篇 ding zhengtao
6 篇 li jinsha
6 篇 meng lexuan
6 篇 wen guanghui
6 篇 wang jianan
6 篇 burgos-mellado c...
6 篇 hadjicostis chri...
5 篇 fischer nick
5 篇 chae kijoon
5 篇 wang jing
5 篇 fu xiang
5 篇 zhang qinjin

语言

2,204 篇 英文
397 篇 其他
9 篇 中文
2 篇 斯洛文尼亚文

检索条件"主题词=Consensus Algorithm"

共 2610 条记录，以下是871-880 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A binary logical operation algorithm for solving the 0-1 programming problem 24

A binary logical operation algorithm for solving the 0-1 pro...

引用

4th Asia-Pacific Artificial Intelligence and Big Data Forum, AIBDF 2024

作者： Zhou, Zhehao Yang, Huogen Zhong, Yuanming Hu, Yiwen College of Science Jiangxi University of Science and Technology Jiangxi Ganzhou China Jiangxi Provincial Key Laboratory of Multidimensional Intelligent Perception and Control Jiangxi Ganzhou China

ISBN: (纸本)9798400710865

Based on population and logical operation, a binary logical operation algorithm is proposed to solve the 0-1 programming problem. Introduce the uniform initialization operator to improve the survival rate and diversity of the population and avoid premature death;Introduce logical operations and construct the model of retention probability and decay coefficient, and intro-duce dynamic update operators to adaptively balance the ability of exploration and exploitation. In order to verify the effectiveness of the algorithm, the convergence of the algorithm is analyzed based on the martingale method, and the classical 0-1 knapsack problem public data set is selected and divided into two groups of experimental data sets of different sizes. The BLOA algorithm is compared with genetic algorithm, particle swarm optimization algorithm, binary flying eagle algorithm and other algorithms. The experimental results show that the time cost of the BLOA algorithm is reduced by 90.36%, and the average accuracy of the solution is improved by 15.59%. Finally, through the ablation experiment, the effectiveness of the uniform initialization operator generation algorithm and the dynamic adjustment update operator strategy designed by BLOA is verified. © 2024 Copyright held by the owner/author(s).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Study of a Distributed Networking Method Based on an Improved Raft Protocol 24

The Study of a Distributed Networking Method Based on an Imp...

引用

2nd International Conference on Communication Networks and Machine Learning, CNML 2024

作者： Wu, Rui Wuhan marine electric propulsion research institute Hubei wuhan China

ISBN: (纸本)9798400711688

To address issues such as central server dependency, harsh environments, and network instability during the networked upgrade of industrial control devices, this paper proposes a distributed self-organizing network system based on the Raft consensus algorithm. By comparing and analyzing the feasibility, advantages, and disadvantages of the Paxos and Raft protocols, the Raft protocol was selected for constructing the distributed system. To overcome the limitations of the Raft algorithm in the leader election process, a leader election algorithm based on node priority was proposed and implemented to enhance the performance of the distributed system under high load and unstable network conditions. Simulation experiments were conducted, and the results demonstrate that the optimized algorithm proposed in this paper reduces the average write latency by 18.3%, increases the number of logs processed per unit of time by 27.2%, and improves the system throughput per unit of time by 39.9%, compared to the original Raft algorithm. © 2024 Copyright held by the owner/author(s).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Network Recommendation algorithm Integrating Multi-Head Attention Mechanism

Graph Neural Network Recommendation Algorithm Integrating Mu...

引用

2025 Asia-Europe Conference on Cybersecurity, Internet of Things and Soft Computing, CITSC 2025

作者： Liu, Yanchun Zhao, Lishuang College of Information Science and Technology Bohai University Jinzhou China

ISBN: (纸本)9798331504205

Recommendation system has become an important way to obtain information from massive data. Compared with active retrieval, the recommendation system based on deep learning has stronger predictability and can provide users with recommendation results with higher reference value. GNN is specifically designed for graph-structured data to extract features from graph-structured data effectively and efficiently. Incorporating attention mechanisms into CNNS improves the model's ability to understand and capture complex dependencies, thereby solving the problem of information overload. Based on the previous research results, a mathematical model is constructed and a simulation experiment is carried out. The mathematical model includes neural cooperative over-worry algorithm, multi-head attention mechanism algorithm and CUD accelerated computation. In the simulation experiment, a baseline model was selected and run on Movielens 10 data set respectively with the model constructed in this paper, which proves the superiority of the model constructed in this paper. The research results of this paper have improved the scientific method of building recommendation systems, and are of great significance for the construction of business models in the era of big data. © 2025 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Faster algorithm for Constrained Correlation Clustering 42

A Faster Algorithm for Constrained Correlation Clustering

引用

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025

作者： Fischer, Nick Kipouridis, Evangelos Klausen, Jonas Thorup, Mikkel INSAIT Sofia University "St. Kliment Ohridski" Bulgaria Max Planck Institute for Informatics Saarland Informatics Campus Saarbrücken Germany BARC University of Copenhagen Denmark

ISBN: (纸本)9783959773652

In the Correlation Clustering problem we are given n nodes, and a preference for each pair of nodes indicating whether we prefer the two endpoints to be in the same cluster or not. The output is a clustering inducing the minimum number of violated preferences. In certain cases, however, the preference between some pairs may be too important to be violated. The constrained version of this problem specifies pairs of nodes that must be in the same cluster as well as pairs that must not be in the same cluster (hard constraints). The output clustering has to satisfy all hard constraints while minimizing the number of violated preferences. Constrained Correlation Clustering is APX-Hard and has been approximated within a factor 3 by van Zuylen et al. [SODA’07]. Their algorithm is based on rounding an LP with Θ(n3) constraints, resulting in an Ω(n3ω) running time. In this work, using a more combinatorial approach, we show how to approximate this problem significantly faster at the cost of a slightly weaker approximation factor. In particular, our algorithm runs in Oe(n3) time (notice that the input size is Θ(n2)) and approximates Constrained Correlation Clustering within a factor 16. To achieve our result we need properties guaranteed by a particular influential algorithm for (unconstrained) Correlation Clustering, the CC-PIVOT algorithm. This algorithm chooses a pivot node u, creates a cluster containing u and all its preferred nodes, and recursively solves the rest of the problem. It is known that selecting pivots at random gives a 3-approximation. As a byproduct of our work, we provide a derandomization of the CC-PIVOT algorithm that still achieves the 3-approximation;furthermore, we show that there exist instances where no ordering of the pivots can give a (3 − Ε)-approximation, for any constant Ε. Finally, we introduce a node-weighted version of Correlation Clustering, which can be approximated within factor 3 using our insights on Constrained Correlation Clustering. A

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithm for U(N) to U(3) Representation Reduction in Isospin-Adapted Nuclear Structure Calculations 15th

Efficient Algorithm for U(N) to U(3) Representation Reduct...

引用

15th International Conference on Parallel Processing and Applied Mathematics, PPAM 2024

作者： Langr, Daniel Dytrych, Tomáš Faculty of Information Technology Czech Technical University in Prague Thákurova 9 Praha16000 Czech Republic Nuclear Physics Institute Czech Academy of Sciences Řež 130 Řež25068 Czech Republic

ISBN: (纸本)9783031857027

An efficient algorithm for enumerating representations of the unitary group U(3) that occur in a representation of the unitary group U(N) is introduced. The algorithm is applicable to U(N) representations associated with a system of nucleons distributed among the degenerate eigenstates of the selected three-dimensional harmonic oscillator level, where each eigenstate can be occupied by up to 4 particles with different combinations of spin and isospin quantum numbers. A C++ implementation of the proposed algorithm is provided, and its performance evaluation is reported. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Simple algorithm for Dynamic Carpooling with Recourse 8

A Simple Algorithm for Dynamic Carpooling with Recourse

引用

8th SIAM Symposium on Simplicity of algorithms, SOSA 2025

作者： Efron, Yuval Patel, Shyamal Stein, Cliff Columbia University United States

ISBN: (纸本)9781611978315

We give an algorithm for the fully-dynamic carpooling problem with recourse: Edges arrive and depart online from a graph G with n nodes according to an adaptive adversary. Our goal is to maintain an orientation H of G that keeps the discrepancy, defined as maxv∈V |deg+H(v) − deg−H(v)|, small at all times. We present a simple algorithm and analysis for this problem with recourse based on cycles that simplifies and improves on a result of Gupta et al. [SODA'22]. Copyright © 2025 by SIAM.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Weighting Attributes Based on the Greedy algorithm Properties 28th

Weighting Attributes Based on the Greedy Algorithm Propertie...

引用

28th International Conference on Knowledge Based and Intelligent information and Engineering Systems, KES 2024

作者： Zielosko, Beata Stanczyk, Urszula Jablonski, Kamil University of Silesia in Katowice Institute of Computer Science Bedzinska 39 Sosnowiec41-200 Poland Department of Computer Graphics Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 2A Gliwice44-100 Poland

Estimation of importance for considered features is an important issue for any knowledge exploration process and it can be executed by a variety of approaches. In the research reported in this study, the primary aim was the development of a methodology for creating attribute rankings. Based on the properties of the greedy algorithm for inducing decision rules, a new application of this algorithm has been proposed. Instead of constructing a single ordering of features, attributes were weighted multiple times. The input datasets were discretised with several algorithms representing supervised and unsupervised discretisation approaches. Each resulting discrete data variant was exploited to construct a ranking of attributes. The effectiveness of the obtained rankings was confirmed through a rule filtering process governed by weighted attributes. The methodology was applied to the stylometric task of authorship attribution. The experimental outcomes demonstrate the value of the proposed research method, as it generally led to improved predictions while taking into account a noticeably decreased sets of attributes and decision rules. © 2024 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Additive Noise Mechanisms for Making Randomized Approximation algorithms Differentially Private 27

Additive Noise Mechanisms for Making Randomized Approximatio...

引用

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

作者： Tětek, Jakub INSAIT Sofia Bulgaria

ISBN: (纸本)9783959773485

The exponential increase in the amount of available data makes taking advantage of them without violating users’ privacy one of the fundamental problems of computer science. This question has been investigated thoroughly under the framework of differential privacy. However, most of the literature has not focused on settings where the amount of data is so large that we are not even able to compute the exact answer in the non-private setting (such as in the streaming setting, sublinear-time setting, etc.). This can often make the use of differential privacy unfeasible in practice. In this paper, we show a general approach for making Monte-Carlo randomized approximation algorithms differentially private. We only need to assume the error R of the approximation algorithm is sufficiently concentrated around 0 (e.g. E[|R|] is bounded) and that the function being approximated has a small global sensitivity ∆. Specifically, if we have a randomized approximation algorithm with sufficiently concentrated error which has time/space/query complexity T(n, ρ) with ρ being an accuracy parameter, we can generally speaking get an algorithm with the same accuracy and complexity T(n, Θ(ϵρ)) that is ϵ-differentially private. Our technical results are as follows. First, we show that if the error is subexponential, then the Laplace mechanism with error magnitude proportional to the sum of the global sensitivity ∆ and the subexponential diameter of the error of the algorithm makes the algorithm differentially private. This is true even if the worst-case global sensitivity of the algorithm is large or infinite. We then introduce a new additive noise mechanism, which we call the zero-symmetric Pareto mechanism. We show that using this mechanism, we can make an algorithm differentially private even if we only assume a bound on the first absolute moment of the error E[|R|]. Finally, we use our results to give either the first known or improved sublinear-complexity differentially private algorit

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Evaluation of algorithms for Strong Admissibility 5

An Evaluation of Algorithms for Strong Admissibility

引用

5th International Workshop on Systems and algorithms for Formal Argumentation, SAFA 2024

作者： Caminada, Martin Harikrishnan, Sri Cardiff University Cardiff United Kingdom Wirtschaftsuniversität Wien Vienna Austria

In the current paper, we evaluate the performance of different computational approaches for constructing a strongly admissible labelling for a particular argument. Unlike previous work, which examined different approaches for constructing a small strongly admissible labelling for a particular argument, in the current paper we are interested in constructing an arbitrary strongly admissible labelling for a particular argument, without any constraints regarding the size of such a labelling. A strongly admissible labelling relies on its associated min-max numbering to show that it is actually strongly admissible. As such, we also examine the additional computational costs of constructing such a min-max numbering. Overall, our analysis leads to a clear recommendation regarding which of the current computational approaches is best fit for purpose. © 2024 Copyright for this paper by its authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On Controlling Knockout Tournaments Without Perfect Information 19

On Controlling Knockout Tournaments Without Perfect Informat...

引用

19th International Symposium on Parameterized and Exact Computation, IPEC 2024

作者： Blažej, Václav Gupta, Sushmita Ramanujan, M.S. Strulo, Peter University of Warwick Coventry United Kingdom The Institute of Mathematical Sciences HBNI Chennai India

ISBN: (纸本)9783959773539

Over the last decade, extensive research has been conducted on the algorithmic aspects of designing single-elimination (SE) tournaments. Addressing natural questions of algorithmic tractability, we identify key properties of input instances that enable the tournament designer to efficiently schedule the tournament in a way that maximizes the chances of a preferred player winning. Much of the prior algorithmic work on this topic focuses on the perfect (complete and deterministic) information scenario, especially in the context of fixed-parameter algorithm design. Our contributions constitute the first fixed-parameter tractability results applicable to more general settings of SE tournament design with potential imperfect information. © Václav Blažej, Sushmita Gupta, M. S. Ramanujan, and Peter Strulo.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共261页 << < 84 85 86 87 88 89 90 91 92 93 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：