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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

147,501 篇 会议
1,638 篇 期刊文献
439 册 图书
3 篇 学位论文

馆藏范围

149,580 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

87,609 篇 工学
- 67,187 篇 计算机科学与技术...
- 33,879 篇 软件工程
- 24,613 篇 电气工程
- 19,174 篇 信息与通信工程
- 13,372 篇 控制科学与工程
- 4,451 篇 电子科学与技术（可...
- 4,393 篇 机械工程
- 3,296 篇 仪器科学与技术
- 3,253 篇 动力工程及工程热...
- 2,865 篇 生物工程
- 2,188 篇 石油与天然气工程
- 2,080 篇 生物医学工程（可授...
- 2,049 篇 交通运输工程
- 2,026 篇 网络空间安全
- 1,738 篇 安全科学与工程
- 1,323 篇 环境科学与工程（可...
- 1,152 篇 光学工程
18,563 篇 理学
- 10,388 篇 数学
- 3,324 篇 物理学
- 3,322 篇 系统科学
- 3,145 篇 生物学
- 2,588 篇 统计学（可授理学、...
- 1,083 篇 化学
15,827 篇 管理学
- 12,056 篇 管理科学与工程(可...
- 5,099 篇 工商管理
- 4,968 篇 图书情报与档案管...
2,680 篇 医学
- 2,090 篇 临床医学
- 1,598 篇 基础医学(可授医学...
1,791 篇 法学
- 1,330 篇 社会学
1,598 篇 经济学
- 1,560 篇 应用经济学
774 篇 教育学
600 篇 农学
370 篇 文学
208 篇 军事学
125 篇 艺术学
4 篇 哲学
4 篇 历史学

主题

11,249 篇 cloud computing
11,088 篇 distributed comp...
6,066 篇 computational mo...
5,955 篇 computer archite...
4,548 篇 computer science
4,382 篇 protocols
4,271 篇 application soft...
4,079 篇 computer network...
3,938 篇 peer to peer com...
3,794 篇 concurrent compu...
3,538 篇 resource managem...
3,474 篇 mobile computing
3,439 篇 distributed comp...
3,372 篇 control systems
3,326 篇 hardware
3,253 篇 servers
3,165 篇 costs
3,122 篇 grid computing
3,040 篇 distributed data...
2,854 篇 monitoring

机构

255 篇 institute of com...
166 篇 school of comput...
123 篇 department of co...
120 篇 university of ch...
87 篇 college of compu...
79 篇 ieee
77 篇 department of co...
63 篇 college of compu...
60 篇 school of automa...
58 篇 georgia inst tec...
56 篇 inria
56 篇 school of comput...
54 篇 shanghai jiao to...
53 篇 university of sc...
52 篇 huazhong univers...
52 篇 tsinghua univers...
52 篇 college of intel...
51 篇 school of comput...
50 篇 institute for in...
50 篇 distributed syst...

作者

118 篇 dustdar schahram
70 篇 hong-linh truong
58 篇 hai jin
55 篇 wang lei
48 篇 lei wang
45 篇 schahram dustdar
40 篇 k.g. shin
40 篇 duerr frank
38 篇 zhang lei
37 篇 buyya rajkumar
35 篇 xiao liu
33 篇 dhabaleswar k. p...
32 篇 dan meng
32 篇 chen shu-ching
31 篇 nectarios koziri...
31 篇 china
30 篇 wang wei
30 篇 jin hai
29 篇 li xin
27 篇 xi chen

语言

147,218 篇 英文
1,615 篇 其他
697 篇 中文
35 篇 俄文
13 篇 西班牙文
11 篇 葡萄牙文
9 篇 法文
5 篇 土耳其文
2 篇 乌克兰文

检索条件"任意字段=IEEE International Conference on Distributed Computing Systems"

共 149581 条记录，以下是171-180 订阅

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

详细简洁

排序：

Research on distributed Node Resource Optimization Mechanism for Multi-Agent systems Combined with Blockchain Technology 7

Research on Distributed Node Resource Optimization Mechanism...

引用

7th ieee international conference on Blockchain (ieee Blockchain)

作者： Yin, Zihang Bai, Bing Liu, Yang Cheng, Tongtong China Acad Informat & Commun Technol Beijing Peoples R China China Inst Commun Beijing Peoples R China

ISBN: (纸本)9798350351606;9798350351590

This paper explores integrating blockchain technology into multi-agent systems (MAS) to enhance distributed node resource optimization. Key challenges addressed include task decision-making, task allocation, and resource scheduling, with a focus on minimizing energy consumption and latency. Blockchain ensures secure, efficient coordination among nodes, mitigating issues like data privacy leaks and system failures. The study also leverages federated learning for secure decentralized machine learning model training. Simulation results demonstrate the enhanced performance, security, and scalability of MAS with blockchain, paving the way for more efficient distributed computing environments.

关键词： Blockchain Multi-Agent systems (MAS) distributed Resource Optimization Federated Learning Secure Coordination

来源：评论

学校读者我要写书评

暂无评论

Enhancing Cloud computing Security Through Blockchain-Based Communication for Electronic Health Records 20

Enhancing Cloud Computing Security Through Blockchain-Based ...

引用

20th Annual international conference on distributed computing in Smart Sensor systems and the Internet of Things (DCOSS-IoT)

作者： Noyon, Md Shahed Islam Moradpoor, Naghmeh Maglaras, Leandros Ahmad, Jawad Univ Greenwich Sch Comp & Math Sci London England Edinburgh Napier Univ Sch Comp Engn & Built Environm Edinburgh Midlothian Scotland

ISBN: (纸本)9798350369458;9798350369441

The health sector stands as one of the most crucial and vulnerable domains, harbouring extensive personal data. Particularly, Electronic Health Records store information in electronic media where users lack control over their data. Unauthorized access to the server or record portal could lead to data manipulation across the entire database. Addressing this security concern, blockchain emerges as a potential solution, surpassing traditional systems in data storage capabilities. In the event of unauthorized access, an attacker can only manipulate a single block of data, leaving the remaining information protected. In addition, blockchain offers new opportunities and avenues for research, particularly in terms of security and scalability. The proposed system in this paper, MediRec, aims to ensure that users have complete control over their personal data by employing a decentralized database. This database securely stores and restricts access to data, allowing only the owner to share it using a secure key. MediRec facilitates patients in creating blockchain-based accounts, ensuring each individual possesses a dedicated block for storing personal data. This innovative approach enables patients to schedule appointments, and doctors can prescribe medications, with details and e -prescriptions securely stored within the patient's block. To maintain the integrity of the system, doctors can undergo verification by healthcare services, such as the National Health Service in the UK, ensuring their validation before accessing the blockchain system. This stringent validation process ensures the security and authenticity of the data stored within the blockchain. Overall, the proposed solution in this paper offers robust security and scalability in electronic data storage, providing users with control over their information through a blockchain-based system. This system presents a promising solution in preventing data breaches and safeguarding sensitive healthcare information.

关键词： Keywords DApps Ethereal'' Encryption Decentralized Health Records Smarr Contact

来源：评论

学校读者我要写书评

暂无评论

How Hard is Asynchronous Weight Reassignment? 43

How Hard is Asynchronous Weight Reassignment?

引用

43rd ieee international conference on distributed computing systems (ICDCS)

作者： Heydari, Hasan Silvestre, Guthemberg Bessani, Alysson Univ Lisbon Fac Ciencias LASIGE Lisbon Portugal Univ Toulouse ENAC Toulouse France

ISBN: (纸本)9798350339864

The performance of distributed storage systems deployed on wide-area networks can be improved using weighted (majority) quorum systems instead of their regular variants due to the heterogeneous performance of the nodes. A significant limitation of weighted majority quorum systems lies in their dependence on static weights, which are inappropriate for systems subject to the dynamic nature of networked environments. To overcome this limitation, such quorum systems require mechanisms for reassigning weights over time according to the performance variations. We study the problem of node weight reassignment in asynchronous systems with a static set of servers and static fault threshold. We prove that solving such a problem is as hard as solving consensus, i.e., it cannot be implemented in asynchronous failure-prone distributed systems. This result is somewhat counter-intuitive, given the recent results showing that two related problems - replica set reconfiguration and asset transfer - can be solved in asynchronous systems. Inspired by these problems, we present two versions of the problem that contain restrictions on the weights of servers and the way they are reassigned. We propose a protocol to implement one of the restricted problems in asynchronous systems. As a case study, we construct a dynamic-weighted atomic storage based on such a protocol. We also discuss the relationship between weight reassignment and asset transfer problems and compare our dynamic-weighted atomic storage with reconfigurable atomic storage.

关键词： distributed storage weighted replication atomic storage asset transfer reconfiguration consensus

来源：评论

学校读者我要写书评

暂无评论

DIME: distributed Inference Model Estimation for Minimizing Profiled Latency 10

DIME: Distributed Inference Model Estimation for Minimizing ...

引用

international conference on Smart computing (SMARTCOMP)

作者： Viramontes, Robert Davoodi, Azadeh Univ Wisconsin Madison Dept Elect & Comp Engn Madison WI 53706 USA

ISBN: (纸本)9798350349955;9798350349948

distributed inference allows minimizing metrics such as latency by offloading some computations from an edge device. It is commonly formulated and solved as an Integer Linear Program (ILP) for layer-wise partitioning of a Deep Neural Network (DNN) to decide transition points from an edge device to a hub and/or cloud devices. The formulation requires parameters reflecting latencies to execute different bundles of consecutive layers of DNN on each device. Profiling is the main way to measure these bundle latencies accurately on a device. In this work, we show a recent ILP of the layer-wise partitioning (JointDNN) cannot in fact always generate an optimal solution. As we show, this happens due to profiling behavior seen in some devices. We propose DIME (distributed Inference Model Estimation) with novel modifications to accurately estimate the latency of a bundle within the ILP formulation. It guarantees generating the optimal solution regardless of the type of device in the network. Additionally, DIME incorporates a new input parameter within the ILP to control the tradeoff between solution quality and the profiling effort. In our experiments we show solving DIME always results in the optimal solution, sometimes with significantly less profiling effort.

关键词： neural networks distributed inference optimization profiling heterogeneous systems

来源：评论

学校读者我要写书评

暂无评论

Fast Prototyping of distributed Stream Processing Applications with stream2gym 43

Fast Prototyping of Distributed Stream Processing Applicatio...

引用

43rd ieee international conference on distributed computing systems (ICDCS)

作者： Ifath, Md. Monzurul Amin Neves, Miguel Haque, Israat Dalhousie Univ Halifax NS Canada

ISBN: (纸本)9798350339864

Stream processing applications have been widely adopted due to real-time data analytics demands, e.g., fraud detection, video analytics, IoT applications. Unfortunately, prototyping and testing these applications is still a cumbersome process for developers that usually requires an expensive testbed and deep multi-disciplinary expertise, including in areas such as networking, distributed systems, and data engineering. As a result, it takes a long time to deploy stream processing applications into production and yet users face several correctness and performance issues. In this paper, we present stream2gym, a tool for the fast prototyping of large-scale distributed stream processing applications. stream2gym builds on Mininet, a widely adopted network emulation platform, and provides a high-level interface to enable developers to easily test their applications under various operating conditions. We demonstrate the benefits of stream2gym by prototyping and testing several applications as well as reproducing key findings from prior research work in video analytics and network traffic monitoring. Moreover, we show stream2gym presents accurate results compared to a hardware testbed while consuming a small amount of resources (enough to be supported in a single commodity laptop even when emulating a dozen of processing nodes).

关键词： Data Analytics

来源：评论

学校读者我要写书评

暂无评论

PASE: Pro-active Service Embedding in The Mobile Edge 43

PASE: Pro-active Service Embedding in The Mobile Edge

引用

43rd ieee international conference on distributed computing systems (ICDCS)

作者： Kolosov, Oleg Yadgar, Gala Breitgand, David Lorenz, Dean H. Technion Comp Sci Haifa Israel IBM Res Israel Hybrid Cloud Haifa Israel

ISBN: (纸本)9798350339864

Mobile edge computing offers ultra-low latency, high bandwidth, and high reliability. Thus, it can support a plethora of emerging services that can be placed in close proximity to the user. One of the fundamental problems in this context is maximizing the benefit from the placement of networked services, while meeting bandwidth and latency constraints. In this study, we propose an adaptive and predictive resource allocation strategy for virtual-network function placement comprising services at the mobile edge. Our study focuses on maximizing the service provider's benefit under user mobility, i.e., uncertainty. This problem is NP-hard, and thus we propose a heuristic solution: we exploit local knowledge about the likely movements of users to speculatively allocate service functions. We allow the service functions to be allocated at different edge nodes, as long as latency and bandwidth constraints are met. We evaluate our proposal against a theoretically optimal algorithm as well as against recent previous work, using widely used simulation tools. We demonstrate that under realistic scenarios, an adaptive and proactive strategy coupled with flexible placement can achieve close-to-optimal benefit.

关键词： 5G mobile communication Connected vehicles edge computing Multi access edge computing Service function chaining virtual network embedding

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Online Task Offloading and Resource Allocation for Mobile Edge computing 43

Energy-Aware Online Task Offloading and Resource Allocation ...

引用

43rd ieee international conference on distributed computing systems (ICDCS)

作者： Liu, Yu Mao, Yingling Shang, Xiaojun Liu, Zhenhua Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA

ISBN: (纸本)9798350339864

Mobile edge computing with the near-data processing paradigm can support applications requiring low latency and high computing capability, where energy cost is a significant part of the expenditure. This paper formulates and studies the problem of online joint task offloading and resource allocation for latency minimization subjecting to a time average energy cost constraint in mobile edge computing systems. The formulated problem has four time-variant system states, i.e., data lengths, task sizes, channel conditions, and electricity prices, which are modeled based on real-world data. At the beginning of each time slot, the system has to make five online decisions jointly: base station selection, server selection for task offloading, communication bandwidth allocation, computing resource allocation, and frequency scaling. We prove the offline version of the formulated problem is NP-hard. We design an online algorithm with a provable approximation ratio and low computational complexity for the proposed problem. In particular, it balances energy cost and latency based on the drift-plus-penalty algorithm and makes server and base station selection decisions using a game theoretic-based algorithm. We conduct extensive real-world data-driven simulations to evaluate the proposed algorithm. Simulation results show that the proposed approach outperforms popular baselines.

关键词： Online Task Offloading Mobile Edge computing Frequency Scaling

来源：评论

学校读者我要写书评

暂无评论

Churn-tolerant Leader Election Protocols 43

Churn-tolerant Leader Election Protocols

引用

43rd ieee international conference on distributed computing systems (ICDCS)

作者： Wang, Jiangran Gupta, Indranil Univ Illinois Dept Elect & Comp Engn Champaign IL 61820 USA Univ Illinois Dept Comp Sci Champaign IL USA

ISBN: (纸本)9798350339864

Classical leader election protocols typically assume complete and correct knowledge of underlying membership lists at all participating nodes. Yet many edge and IoT settings are dynamic, with nodes joining, leaving, and failing continuously-a phenomenon called churn. This implies that in any membership protocol, a given node's membership list may have entries that are missing (e.g., false positive detections, or newly joined nodes whose information has not spread yet) or stale (e.g., failed nodes that are undetected)-these would render classical election protocols incorrect. We present a family of four leader election protocols that are churn-tolerant (or c-tolerant). The key ideas are to: i) involve the minimum number of nodes necessary to achieve safety;ii) use optimism so that decisions are made faster when churn is low;iii) incorporate a preference for electing healthier nodes as leaders. We prove the correctness and safety of our c-tolerant protocols and show their message complexity is optimal. We present experimental results from both a trace-driven simulation as well as our implementation atop Raspberry Pi devices, including a comparison against Zookeeper.

关键词： Leader Election Membership Edge computing Churn

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Service Lifetime Optimization for Energy-Constrained Edge-Edge Collaboration 44

Fine-Grained Service Lifetime Optimization for Energy-Constr...

引用

44th ieee international conference on distributed computing systems (ICDCS)

作者： Zou, Haodong Guo, Jianxiong Zeng, Jiandian Li, Yupeng Cao, Jiannong Wang, Tian BNU HKBU United Int Coll Guangdong Prov Key Lab IRADS Zhuhai Peoples R China Hong Kong Baptist Univ Hong Kong Peoples R China Hong Kong Polytech Univ Hong Kong Peoples R China Beijing Normal Univ Inst Artificial Intelligence & Future Networks Zhuhai Peoples R China

ISBN: (纸本)9798350386066;9798350386059

Collaborative edge computing has been widely advocated by network operators and service providers to promote the quality of service (QoS), provisioning diverse delay-sensitive and computation-intensive applications. Existing studies mainly focus on cloud-edge collaboration, since cloud servers have massive resources to provide diverse services and edge servers can provide low-delay services with close proximity to end users. However, in scenarios that capture privacy, e.g., personal bioinformation and business areas, there is a great need for zero cloud involvement. Moreover, current edge servers are typically energy-constrained, which poses great challenges in enabling high-QoS services in ever-densely deployed edge networks. To tackle these issues, in this paper, we study the energy-constrained edge-edge collaboration problem. First, we formulate the edge-edge collaboration with delay minimization and energy reduction aims and prove its NP-hardness. Second, we propose a novel Fine-Grained Service Lifetime Optimization (FGSLO) scheme as a possible solution. The problem is then transformed and decoupled into three subproblems, namely service placement, service lifetime decision, and task scheduling, which are solved by our proposed method, respectively. Finally, real-world data-driven experimental results show that FGSLO is capable of reducing 21.4%similar to 90.1% system delay in different energy-constrained scenarios, compared to baselines without service lifetime control.

关键词： Service Lifetime Fine-Grained Optimization Energy Consumption Collaborative Edge computing

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2022 ieee international conference on Autonomic computing and Self-Organizing systems, ACSOS 2022

Proceedings - 2022 IEEE International Conference on Autonomi...

引用

3rd ieee international conference on Autonomic computing and Self-Organizing systems, ACSOS 2022

ISBN: (纸本)9781665471374

The proceedings contain 15 papers. The topics discussed include: on evaluating self-adaptive and self-healing systems using chaos engineering;addressing collective computations efficiency: towards a platform-level reinforcement learning approach;a systematic review of fault tolerance techniques for adaptive and context-aware systems;Rango: an intuitive rule language for learning classifier systems in cyber-physical systems;SHIL: self-supervised hybrid learning for security attack detection in containerized applications;explaining online reinforcement learning decisions of self-adaptive systems;towards high-quality battery life for autonomous mobile robot fleets;self-stabilizing priority-based multi-leader election and network partitioning;a generic and modular reference architecture for self-explainable smart homes;and reducing the tail latency of microservices applications via optimal configuration tuning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：