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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Simple Control algorithm to Reduce the DC Current Level in a CSI-UPQC

A Simple Control Algorithm to Reduce the DC Current Level in...

引用

International Conference of the TC Electrimacs Committee, ELECTRIMACS 2024

作者： Melín C., P.E. Baier F., C.R. Espinosa N., E.E. Reyes M., M.E. Hernandez C., F.A. Espinoza C., J.R. Universidad del Bío-Bío Concepción Chile Universidad de Talca Curicó Chile Universidad Catolica de la Santisima Concepción Concepción Chile Universidad de Concepción Concepción Chile

ISBN: (纸本)9783031739200

This work deals with a simple algorithm to define the dc current reference of a CSI-UPQC aimed to reduce its losses. The proposal uses the mathematical model of the CSI-UPQC to demonstrate the relationship between the dc current level and the modulation amplitude of the series stage. With this concept, a straightforward algorithm is proposed to set the dc current level to keep the modulation index of the series stage in a preset range, allowing to reduce of the dc current level compared with the use of a fixed dc current level and, therefore, reducing the losses in the power valves and dc inductor. The mathematical analysis illustrates the proposal, and simulated results corroborate it. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast, Fair and Truthful Distributed Stable Matching for Common Preferences 28

Fast, Fair and Truthful Distributed Stable Matching for Comm...

引用

28th International Conference on Principles of Distributed Systems, OPODIS 2024

作者： Hirvonen, Juho Ranjbaran, Sara Helsinki Institute for Information Technology HIIT Finland Department of Computer Science Aalto University Espoo Finland

ISBN: (纸本)9783959773607

Stable matching is a fundamental problem studied both in economics and computer science. The task is to find a matching between two sides of agents that have preferences over who they want to be matched with. A matching is stable if no pair of agents prefer each other over their current matches. The deferred acceptance algorithm of Gale and Shapley solves this problem in polynomial time. Further, it is a mechanism: the proposing side in the algorithm is always incentivised to report their preferences truthfully. The deferred acceptance algorithm has a natural interpretation as a distributed algorithm (and thus a distributed mechanism). However, the algorithm is slow in the worst case and it is known that the stable matching problem cannot be solved efficiently in the distributed setting. In this work we study a natural special case of the stable matching problem where all agents on one of the two sides share common preferences. We show that in this case the deferred acceptance algorithm does yield a fast and truthful distributed mechanism for finding a stable matching. We show how algorithms for sampling random colorings can be used to break ties fairly and extend the results to fractional stable matching. © Juho Hirvonen and Sara Ranjbaran.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Reactive Power Control Strategy for Islanded VSG System under Sliding Mode Control 9

Optimal Reactive Power Control Strategy for Islanded VSG Sys...

引用

9th International Conference on Power and Renewable Energy

作者： Li, Shuhao Luo, Wensheng Zhang, Ruifang Harbin Inst Technol Sch Elect Engn & Automat Harbin Peoples R China Harbin Inst Technol Sch Astronaut Harbin Peoples R China

ISBN: (纸本)9798350377477;9798350377460

In microgrid systems, virtual synchronous generator (VSG) serves as an interface to various distributed power sources, which can effectively improve the inertia and damping of the system. The VSG system under conventional linear control has low control accuracy and poor perturbation resistance, to which this paper introduces adaptive perturbation compensation on the basis of conventional sliding mode control, which improves the robustness of the system on the basis of ensuring the stability of the system. Meanwhile, for the problem that reactive power cannot be proportionally distributed and circulating current is generated due to the inconsistency of line impedance when multiple VSGs are connected in parallel, a consensus-based adaptive virtual impedance control strategy is proposed, which realizes the precise distribution of reactive power and effectively suppresses the circulating current at the same time. Finally, the reliability and superiority of the above control strategy are verified by simulation.

关键词： microgrid virtual synchronous generator (VSG) adaptive sliding mode control (ASMC) consensus algorithm adaptive virtual impedance

来源：评论

学校读者我要写书评

暂无评论

Research on Multi-level Trustworthy Multimedia Data Broadcasting Network Based on Blockchain Oracles 19

Research on Multi-level Trustworthy Multimedia Data Broadcas...

引用

19th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Wang, Jinghan Zheng, Qiuhong Shen, Yun China Telecom Corp Res Inst Inst Big Data & Artificial Intelligence Beijing Peoples R China

ISBN: (纸本)9798350364279;9798350364262

Amidst the explosive growth of multimedia data, the security and reliability of multimedia broadcasting networks are perennially challenged. Traditional broadcasting networks dependent on centralized server clusters face severe usability damage when confronted with security threats such as network attacks, data tampering, and privacy breaches. To address these issues currently confronting multimedia data broadcasting networks, this paper proposes a construction method for a multi-layered multimedia data broadcasting network based on blockchain oracles. Experimental results indicate that this method can ensure the authenticity, traceability, and immutability of broadcast content during the multimedia data broadcast process. While ensuring data consistency and system robustness in the multimedia data broadcast process, it also offers excellent scalability.

关键词： multimedia data broadcasting blockchain oracle consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Universal Spectrum Symmetry-Free algorithm for Routing and Spectrum Assignment (RSA) 59

A Universal Spectrum Symmetry-Free Algorithm for Routing and...

引用

59th Annual IEEE International Conference on Communications (IEEE ICC)

作者： Rouskas, George N. Ghinaiya, Mithil North Carolina State Univ Raleigh NC 27695 USA

ISBN: (纸本)9781728190549

We present the first spectrum symmetry-free model for the routing and spectrum assignment (RSA) problem. This model allows for the design of more efficient algorithms as it eliminates from consideration an exponential number of equivalent symmetric solutions. By sidestepping symmetry, the RSA solution space is naturally and optimally decomposed into a routing space and a connection permutation space. Building upon this property, we introduce a two-parameter, symmetry-free algorithm that is universal in that it can be used to tackle any RSA variant in a uniform manner. The algorithm is amenable to multi-threaded execution to speed up the search process and the value of the parameters can be adjusted to strike a balance between running time and solution quality. Our evaluation provides insight into the relative benefits of path diversity (which determines the size of the routing space) and connection diversity (which determines the size of the permutation space).

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Least-Squares Optimization Solvers with Differential Privacy

Distributed Least-Squares Optimization Solvers with Differen...

引用

American Control Conference (ACC)

作者： Liu, Weijia Wang, Lei Guo, Fanghong Wu, Zhengguang Su, Hongye Zhejiang Univ Inst Cyber Syst & Control Coll Control Sci & Engn Hangzhou 310027 Peoples R China Zhejiang Univ Technol Dept Automat Hangzhou Peoples R China

ISBN: (纸本)9798350382662;9798350382655

This paper studies the distributed least-squares optimization problem with differential privacy requirement of local cost functions, for which two differentially private distributed solvers are proposed. The first is established on the distributed gradient tracking algorithm, by appropriately perturbing the initial values and parameters that contain the privacy-sensitive data with Gaussian and truncated Laplacian noises, respectively. Rigorous proofs are established to show the achievable trade-off between the (epsilon, delta)-differential privacy and the computation accuracy. The second solver is established on the combination of the distributed shuffling mechanism and the average consensus algorithm, which enables each agent to obtain a noisy version of parameters characterizing the global gradient. As a result, the least-squares optimization problem can be eventually solved by each agent locally in such a way that any given (epsilon, delta)-differential privacy requirement can be preserved while the solution may be computed with the accuracy independent of the network size, which makes the latter more suitable for large-scale distributed least-squares problems. Numerical simulations are presented to show the effectiveness of both solvers.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel Complexity of Geometric Bipartite Matching 44

Parallel Complexity of Geometric Bipartite Matching

引用

44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024

作者： Bhore, Sujoy Equbal, Sarfaraz Gurjar, Rohit Department of Computer Science & Engineering Indian Institute of Technology Bombay India

ISBN: (纸本)9783959773553

In this work, we study the parallel complexity of the geometric minimum-weight bipartite perfect matching (GWBPM) problem in 2. Here our graph is the complete bipartite graph G on two sets of points A and B in 2 (|A| = |B| = n) and the weight of each edge (a, b) ∈ A × B is the p distance (for some integer p ≥ 2) between the corresponding points, i.e., ||a - b||p. The objective is to find a minimum weight perfect matching of A ∪ B. In their seminal work, Mulmuley, Vazirani, and Vazirani (STOC 1987) showed that the weighted perfect matching problem on general bipartite graphs is in RNC. Almost three decades later, Fenner, Gurjar, and Thierauf (STOC 2016) showed that the problem is in Quasi-NC. Both of these results work only when the weights are of O(log n) bits. It is a long-standing open question to show the problem to be in NC. First, we show that in a geometric bipartite graph under the p metric for any p ≥ 2, unless we take Ω(n) bits of approximation for weights, we cannot distinguish the minimum-weight perfect matching from other perfect matchings. This means that we cannot hope for an MVV-like NC/RNC algorithm for solving GWBPM exactly (even when vertex coordinates are small integers). Next, we give an NC algorithm (assuming vertex coordinates are small integers) that solves GWBPM up to 1/poly(n) additive error, under the lp metric for any p ≥ 2. © 2024 Sujoy Bhore, Sarfaraz Equbal, and Rohit Gurjar.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Pseudo-polynomial algorithms for Some Problems of Searching for the Largest Subsets 23rd

Pseudo-polynomial Algorithms for Some Problems of Searchin...

引用

23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024

作者： Khandeev, Vladimir Neshchadim, Sergey Sobolev Institute of Mathematics 4 Koptyug Ave. Novosibirsk630090 Russia Novosibirsk State University 2 Pirogova St. Novosibirsk630090 Russia

ISBN: (纸本)9783031733642

We consider several problems of finding the subsets with the largest minimal cardinality and limited scatter in a finite set of points in Euclidean space. For each cluster, the scatter is the sum of the distances (raised to a power) between the elements and the center of the cluster. Depending on the problem, the center can be defined in different ways—as a fixed point, as the centroid of the cluster, etc. We propose a general scheme for a pseudo-polynomial algorithm to solve such problems, and we also show how and in what time this scheme can be implemented for several types of centers. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Combination of Gale-Shapley and PESA-II algorithm in Student-University Match 13th

Combination of Gale-Shapley and PESA-II Algorithm in Student...

引用

13th International Conference on Information Technology and its Applications, CITA 2024

作者： Ngoc, Trinh Bao Quang, Dang Nhat Dat, Dang Tien Phan, Le Anh Khanh, Nguyen Ngoc Phuong Thao, Ha Thi Thanh Thang, Nguyen Xuan Ha Noi University Ha Noi Viet Nam

ISBN: (纸本)9783031741265

This paper solved the problem of student-university mismatch by applying Stable matching theory which is a mathematical framework for mutually beneficial relationships over time. Our approach, named Stable matching for student selection and admission to university, combines the Gale-Shapley algorithm, which systematically checks every university in the students list, aiming to create a stable and satisfactory match, and the PESA-II algorithm, a multi-objective evolutionary optimization method. This ensures an equitable outcome aligned with the preferences of both students and universities. The outcome is twofold: students gain access to the most suitable universities, meeting the universities requirements and enabling them to contribute effectively to society. Simultaneously, a balanced student distribution among universities is maintained, preventing disparities and providing a steady funding source for less selective schools. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering 41

New Bounds on the Cohesion of Complete-link and Other Linkag...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Dasgupta, Sanjoy Laber, Eduardo University of California San Diego United States Departamento de Informática PUC-RIO Brazil

Linkage methods are among the most popular algorithms for hierarchical clustering. Despite their relevance the current knowledge regarding the quality of the clustering produced by these methods is limited. Here, we improve the currently available bounds on the maximum diameter of the clustering obtained by complete-linkage for metric spaces. One of our new bounds, in contrast to the existing ones, allows us to separate complete-linkage from single-linkage in terms of approximation for the diameter, which corroborates the common perception that the former is more suitable than the latter when the goal is producing compact clusters. We also show that our techniques can be employed to derive upper bounds on the cohesion of a class of linkage methods that includes the quite popular average-linkage. Copyright 2024 by the author(s)

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共261页 << < 77 78 79 80 81 82 83 84 85 86 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：