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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,023 篇 会议
92 篇 期刊文献
52 册 图书

馆藏范围

7,167 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,956 篇 工学
- 3,404 篇 计算机科学与技术...
- 1,565 篇 信息与通信工程
- 1,421 篇 软件工程
- 1,053 篇 电气工程
- 243 篇 控制科学与工程
- 123 篇 电子科学与技术（可...
- 93 篇 网络空间安全
- 76 篇 动力工程及工程热...
- 74 篇 仪器科学与技术
- 64 篇 生物工程
- 52 篇 机械工程
- 35 篇 安全科学与工程
- 34 篇 建筑学
- 34 篇 土木工程
- 33 篇 测绘科学与技术
- 31 篇 生物医学工程（可授...
- 30 篇 交通运输工程
561 篇 管理学
- 411 篇 管理科学与工程(可...
- 187 篇 图书情报与档案管...
- 140 篇 工商管理
519 篇 理学
- 316 篇 数学
- 94 篇 物理学
- 73 篇 生物学
- 71 篇 系统科学
- 66 篇 统计学（可授理学、...
100 篇 法学
- 52 篇 社会学
- 49 篇 法学
65 篇 医学
- 37 篇 基础医学(可授医学...
- 33 篇 公共卫生与预防医...
42 篇 经济学
- 41 篇 应用经济学
26 篇 文学
22 篇 教育学
12 篇 农学
6 篇 军事学
2 篇 艺术学

主题

1,159 篇 distributed comp...
419 篇 software enginee...
363 篇 cloud computing
361 篇 artificial intel...
312 篇 computer archite...
306 篇 computer network...
274 篇 social networkin...
270 篇 protocols
247 篇 computer science
231 篇 computational mo...
221 篇 wireless sensor ...
210 篇 scalability
205 篇 peer to peer com...
204 篇 resource managem...
195 篇 routing
190 篇 bandwidth
189 篇 servers
188 篇 application soft...
180 篇 distributed data...
166 篇 grid computing

机构

110 篇 beijing univ pos...
88 篇 state key labora...
12 篇 department of co...
11 篇 college of compu...
10 篇 tsinghua univers...
10 篇 poznan supercomp...
10 篇 school of comput...
10 篇 department of co...
10 篇 beijing universi...
9 篇 inria
9 篇 beijing universi...
9 篇 research institu...
9 篇 rissho universit...
9 篇 tsinghua univ pe...
9 篇 institute of net...
9 篇 school of cyber ...
9 篇 institute of com...
8 篇 georgia inst tec...
8 篇 department of co...
8 篇 institute of net...

作者

25 篇 yang yang
16 篇 huang lican
16 篇 lican huang
14 篇 wehrle klaus
13 篇 gao zhipeng
12 篇 dustdar schahram
12 篇 buyya rajkumar
12 篇 rothermel kurt
11 篇 duerr frank
11 篇 wu jan-jan
11 篇 rajkumar buyya
11 篇 wang wei
11 篇 liu pangfeng
11 篇 teruhisa hochin
11 篇 qi qi
10 篇 ming chen
10 篇 hoefler torsten
10 篇 m. takizawa
10 篇 cheng shiduan
10 篇 schahram dustdar

语言

7,085 篇 英文
46 篇 中文
38 篇 其他

检索条件"任意字段=International Conference on Networking and Distributed Computing"

共 7167 条记录，以下是71-80 订阅

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

详细简洁

排序：

Quantitative characterization of consistency violating faults at individual distributed computing processes 25

Quantitative characterization of consistency violating fault...

引用

26th international conference on distributed computing and networking, ICDCN 2025

作者： Garu, Amit Gupta, Arya Tanmay Nguyen, Duong Ngoc Kulkarni, Sandeep EECS University of Wyoming LaramieWY United States Michigan State University East LansingMI United States University of Wyoming LaramieWY United States

ISBN: (纸本)9798400710629

Consistency Violation Fault (cvf) is a type of fault where stale information causes a distributed computation to execute incorrect transitions. Since cvf s are common in practice, understanding cvf s is important in designing resilient distributed programs. Some properties of cvf s in a few case-study self-stabilizing distributed programs have been investigated in previous studies. However, more analyses are still needed to obtain a more comprehensive quantitative characterization of this class of faults. In this study, we focus on factors that could influence the impact of cvf s, such as the location and timing of cvf s. We also extend our analysis to more case-study problems, such as distributed machine learning. Our preliminary results show that location has an important role in determining the impact of cvf. © 2025 Copyright held by the owner/author(s).

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Skyline Probability over Uncertain Preferences 25

Distributed Computation of Skyline Probability over Uncertai...

引用

26th international conference on distributed computing and networking, ICDCN 2025

作者： Kilari, Easwar Kailasam, Sriram NIT Warangal Telengana Warangal India Microsoft Corporation India Pvt Ltd Hyderabad India

ISBN: (纸本)9798400710629

computing skyline probabilities in the presence of uncertain preferences is a #-P complete problem. The current state-of-the-art, the Usky-base algorithm, operates sequentially and, despite its ability to prune significant portions of joint probabilities, suffers from an exponentially increasing lattice size relative to the database size. Consequently, even small datasets result in prohibitively long computation times. The Usky-base algorithm employs a prefix-based level wise absorption algorithm that is not amenable to parallelization. We reformulated the Usky-base algorithm as an enumeration problem within a combinatorial tree search paradigm. Then, we used the DiGTreeS API, an open-source framework for combinatorial tree search to express the skyline computation. We performed comprehensive experiments on a distributed environment with a fixed number of workers and with elastic scaling. We observed that the proposed system scales well on both real and synthetic datasets. © 2025 Copyright held by the owner/author(s).

关键词： skyline probability

来源：评论

学校读者我要写书评

暂无评论

distributed Small Cuts using Semigroups 25

Distributed Small Cuts using Semigroups

引用

26th international conference on distributed computing and networking, ICDCN 2025

作者： Augustine, John Daga, Mohit Department of Computer Science and Engineering IIT Madras Tamil Nadu Chennai India KTH - Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)9798400710629

In the distributed edge-connectivity problem, every node in the distributed graph (the CONGEST model) needs to find what is the minimum number of edges required to be removed to disconnect the graph. This work addresses edge connectivity of constant size. Here, the first significant result was by [Pritchard and Thurimella, ACM TALG'2011], who gave a randomized algorithm that finds all the small sized cuts in O(D) time. Their algorithm is restrictive and finds cuts of size only one and two. The technique used here is binary random circulation. In this work, we resolve an open problem mentioned in Pritchard and Thurimella giving a deterministic algorithm for finding all cuts of size two in O(D) time. Our algorithm also improves results by Parter [DISC'19], who provided a fault-tolerant based approach to finding min-cuts poly(D, log n) (polynomial in the size of min-cut). © 2025 Copyright held by the owner/author(s).

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On Constructing a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers 25

On Constructing a Byzantine Linearizable SWMR Atomic Registe...

引用

26th international conference on distributed computing and networking, ICDCN 2025

作者： Kshemkalyani, Ajay D. Piduguralla, Manaswini Peri, Sathya Misra, Anshuman University of Illinois Chicago ChicagoIL United States Indian Institute of Technology Hyderabad Hyderabad India Purdue University Fort Wayne Fort WayneIN United States

ISBN: (纸本)9798400710629

The SWMR atomic register is a fundamental building block in shared memory distributed systems and implementing it from SWSR atomic registers is an important problem. While this problem has been solved in crash-prone systems, it has received less attention in Byzantine systems. Recently, Hu and Toueg gave such an implementation of the SWMR register from SWSR registers. While their definition of register linearizability is consistent with the definition of Byzantine linearizability of a concurrent history of Cohen and Keidar, it has several drawbacks. In this paper, we give a stronger definition of a Byzantine linearizable register that overcomes these drawbacks. The construction of a Byzantine linearizable SWMR atomic register from SWSR registers that meets our stronger definition is given in the full arxiv report. The construction is correct when n > 3f, where n is the number of readers, f is the maximum number of Byzantine readers, and the writer can also be Byzantine. The construction relies on a public-key infrastructure. © 2025 Copyright held by the owner/author(s).

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Confidentiality-Preserving distributed Linear Programming Model for Solving Large-Scale Economic Dispatch Problems 24

A Confidentiality-Preserving Distributed Linear Programming ...

引用

11th international conference on networking, Systems and Security, NSysS 2024

作者： Hossain, Md Turab Hossain, Md. Alamin Adnan, Muhammad Abdullah Dhaka Bangladesh

ISBN: (纸本)9798400711589

The primary goal of the economic dispatch (ED) is to organize the generation schedule to fulfill system energy demand at the lowest possible operational cost while meeting all other requirements, including system security and reliability. The inclusion of smart grid technologies requires advanced computational techniques and increased problem-solving capabilities to manage effectively. The in-house computing infrastructure has drawbacks, such as high costs, operational complexity, limited flexibility, and security risks. Even though cloud computing is a substitute, it faces the major challenge of storing sensitive data, such as power system data, in the cloud, which could put organizations at risk of cyberattacks. We propose an outsourcing model of distributed linear programming (LP) that solves large-scale economic dispatch problems. Moreover, for the preservation of data confidentiality, we transform our LP into a confidentiality-preserving LP. We have shown the efficacy of our model by implementing on the real-life Bangladesh power grid system. © 2024 Copyright held by the owner/author(s).

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Architectural Elements of Decentralized Process Management Systems 22nd

Architectural Elements of Decentralized Process Management S...

引用

22nd international conference on Service Oriented computing

作者： Grunert, Kai Shoferi, Janis Joderi Gold, Lucas Rieder, Wolf Kuepper, Axel Tech Univ Berlin Serv Ctr Networking Berlin Germany

ISBN: (纸本)9789819608041;9789819608058

In a decentralized Process Management System, several process engines cooperate to execute a single process instance by using direct Machine-to-Machine communication and local coordination of the process flow. In this paper, we analyze the software architecture elements of a decentralized Process Management System. We explain the involved components, connectors, data, and the relationships between them. We also describe the state transitions of decentralized processes during execution.

关键词： decentralized Process Management System distributed Process Engines distributed and Heterogeneous Workflow Enactment Service Business Process Management System Process Automation Process Execution System Process Engine

来源：评论

学校读者我要写书评

暂无评论

Optimal Allocation of Tasks to Networked computing Facilities 28th

Optimal Allocation of Tasks to Networked Computing Facilitie...

引用

28th international conference on Analytical & Stochastic Modeling Techniques & Applications

作者： Mancuso, Vincenzo Castagno, Paolo Badia, Leonardo Sereno, Matteo Ajmone Marsan, Marco IMDEA Networks Inst Madrid Spain Univ Turin Dept Informat Turin Italy Univ Padua Padua Italy

ISBN: (纸本)9783031707520;9783031707537

distributed allocation of computing tasks over network resources is meant to decrease the cost of centralized allocation. However, existing analytical models consider practically indistinguishable resources, e.g., located in the data center. With the rise of edge computing, it becomes important to account for the impact of diverse latency values imposed by edge/cloud data center locations. In this paper, we study the optimization of computing task allocation considering both the delays to reach edge/cloud data centers and the response times of servers. We explicitly evaluate the resulting performance under different scenarios. We show, through numerical analysis and real experiments, that differences in delays to reach data center locations cannot be neglected. We also study the price of anarchy of a distributed implementation of the computing task allocation and unveil important properties such as the price of anarchy being generally small, except when the system is overloaded, and its maximum can be computed with low complexity.

关键词： Network servers Optimization with network latency constraints Next generation networking Game Theory Price of Anarchy

来源：评论

学校读者我要写书评

暂无评论

A Multi-Level Parallel Algorithm for Detection of Single Scatterers in SAR Tomography 33

A Multi-Level Parallel Algorithm for Detection of Single Sca...

引用

33rd Euromicro international conference on Parallel, distributed, and Network-Based Processing, PDP 2025

作者： Russo, Massimiliano Nisar, Mehwish Pauciullo, Antonio Imperatore, Pasquale Lapegna, Marco Romano, Diego University of Naples Federico II Dept. of Mathematics and Applications Naples Italy National Research Council Naples Italy Inst. for High Performance Computing and Networking National Research Council Naples Italy

ISBN: (纸本)9798331524937

Synthetic Aperture Radar (SAR) tomography is an advanced technique for monitoring deformations of the Earth's surface. However, the computational complexity of SAR tomography algorithms often restricts their application to large-scale datasets. To address this issue, we introduce a multi-level parallel implementation of a single scatterer detection algorithm specifically designed to exploit the capabilities of modern heterogeneous High-Performance computing (HPC) systems. By efficiently distributing the computational workload at different levels across multiple processing units, our parallel approach significantly reduces processing time, facilitating the analysis of extensive SAR datasets. We assess the performance of our parallel implementation using real-world SAR data, showcasing its effectiveness in enhancing both the efficiency and scalability of SAR tomography. Our work contributes to advancing remote sensing techniques and offers valuable insights into the application of HPC for large-scale environmental monitoring. © 2025 IEEE.

关键词： Light scattering

来源：评论

学校读者我要写书评

暂无评论

A Review on Detection and Mitigation Strategies of DDoS Attack in SDN Environment using Machine Learning and Deep Learning 3

A Review on Detection and Mitigation Strategies of DDoS Atta...

引用

3rd international conference on Intelligent Systems, Advanced computing, and Communication, ISACC 2025

作者： Boruah, Maram Smriti Sarmah, Satyajit Gauhati University Department of Information Technology Assam India

ISBN: (纸本)9798331523893

Software-Defined networking (SDN) has a unique architecture, however it is highly susceptible to distributed Denial-Of-Service (DDoS) attacks targeting its control and data planes. This paper reviews the use of Machine Learning (ML) and Deep Learning (DL) techniques for the detection and mitigation of DDoS attacks in Software-Defined networking (SDN). The review examines research published between 2019 and 2024, highlighting various approaches, such as Kernel Principal Component Analysis (KPCA), Random Forest (RF), Long Short-Term Memory (LSTM), and Convolutional Neural Networks (CNN), among others. These techniques are evaluated based on their effectiveness in detecting high-rate, low-rate, and zero-day attacks, with the focus on accuracy, false positive rates, and real-time adaptability. While several methods show promising results in experimental environments, challenges remain in terms of scalability, generalization, and dynamic adaptation to evolving attack patterns in large-scale deployments. © 2025 IEEE.

关键词： DDoS Detection Mitigation Review Software Defined networking

来源：评论

学校读者我要写书评

暂无评论

distributed Quantum computing in Dynamic Environments: Concept and Challenges

Distributed Quantum Computing in Dynamic Environments: Conce...

引用

Quantum Communications, networking, and computing (QCNC), international conference on

作者： Seng W. Loke School of Information Technology Deakin University Burwood VIC Australia

This paper discusses distributed quantum computing in dynamic environments where conditions on quantum nodes might change causing original qubit allocations on distributed quantum workers to be further from optimal, a... 详细信息

ISBN: (数字)9798331531591

ISBN: (纸本)9798331531607

关键词： Degradation Sensitivity Computational modeling Qubit Logic gates Dynamic scheduling Resource management Integrated circuit modeling Quantum communication Periodic structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：