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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是961-970 订阅

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

详细简洁

排序：

The Construction of Probabilistic Boolean Networks: New algorithms and Lower Bound 10

The Construction of Probabilistic Boolean Networks: New Algo...

引用

10th International Conference on Fuzzy Systems and Data Mining, FSDM 2024

作者： Fok, Christopher H. Ching, Wai-Ki Wong, Chi-Wing Department of Mathematics University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781643685694

Boolean Networks (BN) and Probabilistic Boolean Networks (PBNs) are useful models for genetic regulatory networks, healthcare service systems, manufacturing systems and financial risk. This paper focuses on the construction problem of PBNs. We propose the Division Pre-processing algorithm (DPre), which breaks a non-negative integer matrix P with constant positive column sum into two non-negative integer matrices Q˜ and R˜, each with constant column sum, such that P = dQ˜ + R˜ for some positive integer d. We combine DPre with two existing PBN construction algorithms to form a novel PBN construction algorithm called the Single Division Pre-processed SER2-GER algorithm (SDS2G). Our computational experiments reveal that SDS2G gives significantly better performance compared with other existing PBN construction algorithms, and that SDS2G is fast. Lastly, we derive a new lower bound related to PBN construction, and this new theorem generalizes a lower bound theorem in a previous paper. © 2024 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Ranking Schools with Multiple Features: An Integrated Approach using Data Analytics and algorithm

Ranking Schools with Multiple Features: An Integrated Approa...

引用

2024 International Conference on Electrical, Electronics and Computing Technologies, ICEECT 2024

作者： Singh, Kunal Srivastava, Divyanshu Mishra, Nidhi Amity University Uttar Pradesh Department of Computer Science and Engineering Noida India

ISBN: (纸本)9798350378092

This paper develops a method to rate schools by using an algorithm which measures their impact and attention devoted to them in their respective field. We use the school network we built for a particular area for linking schools with similar features as a metric for our calculation because the number of schools involved with a particular requirement helps us to effectively count and predict the importance of the school. We modify the simple iterative PageRank algorithm to count the number of importance related to the school effectively to approximate the relative probability of a user selecting a particular school for admission. We introduced a multiplication factor which takes care of the time factor involved with the foundation year of school. We introduced the concept of importance and link vector to effectively connect the nodes in a school network in the form of one-to-one relation. We implemented our algorithm on a processed dataset and calculated the normalized scores involved with each node of the school network which is representing a school and using these scores we ranked the schools in a particular area concerned. For quantitative values of various theoretical features, we processed the data to obtain further relation involved with the school and various factors in the school network. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty 27

Competitive Query Minimization for Stable Matching with One-...

引用

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

作者： Bampis, Evripidis Dogeas, Konstantinos Erlebach, Thomas Megow, Nicole Schlöter, Jens Trehan, Amitabh Sorbonne Université CNRS LIP6 Paris France Department of Computer Science Durham University Durham United Kingdom Faculty of Mathematics and Computer Science University of Bremen Bremen Germany

ISBN: (纸本)9783959773485

We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are unknown. An algorithm can make queries to reveal information about the preferences of the agents in B. We examine three query models: comparison queries, interviews, and set queries. Using competitive analysis, our aim is to design algorithms that minimize the number of queries required to solve the problem of finding a stable matching or verifying that a given matching is stable (or stable and optimal for the agents of one side). We present various upper and lower bounds on the best possible competitive ratio as well as results regarding the complexity of the offline problem of determining the optimal query set given full information. © Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, and Amitabh Trehan.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Kernel Affine Projection algorithms Based on the Robust Mixed-norm Method 7

Kernel Affine Projection Algorithms Based on the Robust Mixe...

引用

7th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2024

作者： Li, Guoliang Zhao, Ji Zhang, Hongbin University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Southwest University of Science and Technology School of Information Engineering Sichuan621010 China

ISBN: (纸本)9798350384437

The kernel affine projection algorithm (KAPA) has been successfully applied in the context of time-series prediction. However, the KAPA's filtering performance can be greatly affected by non-Gaussian noise. The mixed-norm algorithm (MNA) and generalized correntropy (GC) can still achieve fast convergence speed under non-Gaussian noise. In this paper, the combination of the KAPA, MNA and GC yields the kernel affine projection robust MNA (KAPRMNA). In order to further modify the convergence rate of the KAPRMNA, applying a variable-step-size (VSS) way to the KAPRMNA yields a new VSS-KAPRMNA. In the context of time-series prediction, simulations verify that both the KAPRMNA and VSS-KAPRMNA outperform some other known kernel AP-type algorithms with respect to the convergence rate in a-stable distribution environment. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Massively Parallel Ruling Set Made Deterministic 38

Massively Parallel Ruling Set Made Deterministic

引用

38th International Symposium on Distributed Computing, DISC 2024

作者： Giliberti, Jeff Parsaeian, Zahra University of Maryland College ParkMD United States University of Freiburg Germany

ISBN: (纸本)9783959773522

We study the deterministic complexity of the 2-Ruling Set problem in the model of Massively Parallel Computation (MPC) with linear and strongly sublinear local memory. Linear MPC: We present a constant-round deterministic algorithm for the 2-Ruling Set problem that matches the randomized round complexity recently settled by Cambus, Kuhn, Pai, and Uitto [DISC’23], and improves upon the deterministic O(log log n)-round algorithm by Pai and Pemmaraju [PODC’22]. Our main ingredient is a simpler analysis of CKPU’s algorithm based solely on bounded independence, which makes its efficient derandomization possible. Sublinear MPC: We present a deterministic algorithm that computes a 2-Ruling Set in Õ(√log n) rounds deterministically. Notably, this is the first deterministic ruling set algorithm with sublogarithmic round complexity, improving on the O(log ∆ + log log∗ n)-round complexity that stems from the deterministic MIS algorithm of Czumaj, Davies, and Parter [TALG’21]. Our result is based on a simple and fast randomness-efficient construction that achieves the same sparsification as that of the randomized Õ(√log n)-round LOCAL algorithm by Kothapalli and Pemmaraju [FSTTCS’12]. © Jeff Giliberti and Zahra Parsaeian.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Control- Theoretic Distributed algorithm for Solving Linear Equations: An Observer Perspective

Control- Theoretic Distributed Algorithm for Solving Linear ...

引用

2024 International Annual Conference on Complex Systems and Intelligent Science, CSIS-IAC 2024

作者： Ding, Shufen Meng, Deyuan Beijing100191 China

ISBN: (纸本)9798331504755

This paper addresses the distributed computation of the linear algebraic equations (LAEs) from a control perspective. The fundamental methodology involves interpreting the unknown variables of the LAE as the states of a related dynamic system and harnessing the full potential of distributed state observers, within the context of multi-agent systems. The proposed distributed algorithm leverages the combination of observer-based design and consensus-based design principles. It is shown that regardless of whether the LAE of interest has a unique solution or multiple solutions, the presented distributed algorithm can converge exponentially fast to the solution, independent of the choice of initial values. This control-oriented approach demonstrates the idea of control design by effectively leveraging control tools, specifically the distributed state observer, to address the mathematical problem of equation-solving. Finally, simulation examples are presented to demonstrate the efficacy of the proposed methods. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model

A self-stabilizing distributed algorithm for the 1-MIS probl...

引用

作者： Kakugawa, Hirotsugu Kamei, Sayaka Shibata, Masahiro Ooshita, Fukuhito Faculty of Advanced Science and Technology Ryukoku University Shiga Otsu Japan Graduate School of Advanced Science and Engineering Hiroshima University Hiroshima Higashihiroshima Japan Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Fukuoka Iizuka Japan Faculty of Engineering Fukui University of Technology Fukui Fukui Japan

Fault-tolerance and self-organization are critical properties in modern distributed systems. Self-stabilization is a class of fault-tolerant distributed algorithms which has the ability to recover from any kind and any finite number of transient faults and topology changes. In this article, we propose a self-stabilizing distributed algorithm for the 1-MIS problem under the unfair central daemon assuming the distance-3 model. Here, in the distance-3 model, each process can refer to the values of local variables of processes within three hops. Intuitively speaking, the 1-MIS problem is a variant of the maximal independent set (MIS) problem with improved local optimizations. The time complexity (convergence time) of our algorithm is (Formula presented.) steps and the space complexity is (Formula presented.) bits, where (Formula presented.) is the number of processes. Finally, we extend the notion of 1-MIS to (Formula presented.) -MIS for each nonnegative integer (Formula presented.), and compare the set sizes of (Formula presented.) -MIS ((Formula presented.)) and the maximum independent set. © 2024 John Wiley & Sons Ltd.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Matching (Multi)Cut: algorithms, Complexity, and Enumeration 19

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration

引用

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

作者： Gomes, Guilherme C.M. Juliano, Emanuel Martins, Gabriel dos Santos, Vinicius F. Departamento de Ciência da Computação Universidade Federal de Minas Gerais Belo Horizonte Brazil CNRS LIRMM Montpellier France

ISBN: (纸本)9783959773539

A matching cut of a graph is a partition of its vertex set in two such that no vertex has more than one neighbor across the cut. The Matching Cut problem asks if a graph has a matching cut. This problem, and its generalization d-cut, has drawn considerable attention of the algorithms and complexity community in the last decade, becoming a canonical example for parameterized enumeration algorithms and kernelization. In this paper, we introduce and study a generalization of Matching Cut, which we have named Matching Multicut: can we partition the vertex set of a graph in at least parts such that no vertex has more than one neighbor outside its part? We investigate this question in several settings. We start by showing that, contrary to Matching Cut, it is NP-hard on cubic graphs but that, when is a parameter, it admits a quasi-linear kernel. We also show an O(n2) time exact exponential algorithm for general graphs and a 2O(t log t)nO(1) time algorithm for graphs of treewidth at most t. We then turn our attention to parameterized enumeration aspects of matching multicuts. First, we generalize the quadratic kernel of Golovach et. al for Enum Matching Cut parameterized by vertex cover, then use it to design a quadratic kernel for Enum Matching (Multi)cut parameterized by vertex-deletion distance to co-cluster. Our final contributions are on the vertex-deletion distance to cluster parameterization, where we show an FPT-delay algorithm for Enum Matching Multicut but that no polynomial kernel exists unless NP ⊆ coNP/poly;we highlight that we have no such lower bound for Enum Matching Cut and consider it our main open question. © Guilherme C. M. Gomes, Emanuel Juliano, Gabriel Martins, and Vinicius F. dos Santos.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Sound and Complete Substitution algorithm for Multimode Type Theory 29

A Sound and Complete Substitution Algorithm for Multimode Ty...

引用

29th International Conference on Types for Proofs and Programs, TYPES 2023

作者： Ceulemans, Joris Nuyts, Andreas Devriese, Dominique DistriNet KU Leuven Belgium

ISBN: (纸本)9783959773324

Multimode Type Theory (MTT) is a generic type theory that can be instantiated with an arbitrary mode theory to model features like parametricity, cohesion and guarded recursion. However, the presence of modalities in MTT significantly complicates the substitution calculus of this system. Moreover, MTT’s syntax has explicit substitutions with an axiomatic system - not an algorithm - governing the connection between an explicitly substituted term and the resulting term in which variables have actually been replaced. So far, the only results on eliminating explicit substitutions in MTT rely on normalisation by evaluation and hence also immediately normalise a term. In this paper, we present a substitution algorithm for MTT that is completely separated from normalisation. To this end, we introduce Substitution-Free Multimode Type Theory (SFMTT): a formulation of MTT without explicit substitutions, but for which we are able to give a structurally recursive substitution algorithm, suitable for implementation in a total programming language or proof assistant. On the usual formulation of MTT, we consider σ-equality, the congruence generated solely by equality rules for explicit substitutions. There is a trivial embedding from SFMTT to MTT, and a converse translation that eliminates the explicit substitutions. We prove soundness and completeness of our algorithm with respect to σ-equivalence and thus establish that MTT with σ-equality has computable σ-normal forms, given by the terms of SFMTT. © Joris Ceulemans, Andreas Nuyts, and Dominique Devriese.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved hyperbolic sine and cosine optimizer that fuses Golden sine algorithm and Tent chaos mapping

Improved hyperbolic sine and cosine optimizer that fuses Gol...

引用

2024 China Automation Congress, CAC 2024

作者： Zhao, Yuntao Fang, Lixin School of Information Science and Engineering Wuhan University of Science and Technology Hubei China

ISBN: (纸本)9798350368604

In view of the problems of the Sinh Cosh Optimizer (SCHO), such as uneven initial position, slow convergence and poor search accuracy, This paper presents an improved SCHO that combines the Golden Sine algorithm(Gold-SA) and the Tent chaotic mapping (GTSCHO). First, the Tent chaotic mapping was used to replace the traditional random number initialization of the population, which improved the diversity of the ***, the Golden sine algorithm is added to the position updating process, which makes the algorithm's search and development have a better balance, and the optimization accuracy is improved. Through 13 benchmark test functions, the simulation and comparison test results show that: Compared with SCHO, the improved GTSCHO has better convergence speed, searching ability and stability. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共261页 << < 93 94 95 96 97 98 99 100 101 102 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：