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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Study of Deadlock Avoidance Strategy in Knowledgeable Manufacturing Systems

A Study of Deadlock Avoidance Strategy in Knowledgeable Manu...

引用

The 4th international conference on Wireless Communications, networking and Mobile computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Hongbing Yang Hongsen Yan Qi Wu Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Southeast University Nanjing Jiangsu P.R.China

Based on the finite automata theory, a thinking of distributed deadlock supervisor is proposed to avoid deadlock in Knowledgeable Manufacturing Systems, which is insensitive to system size and improves the efficiency of automata modeling and operating. The conception of the auto-correlation operation is presented, then the corresponding distributed deadlock supervisors are constructed, and thus the deadlock-free strategy of the knowledgeable manufacturing cell is obtained, which can be used to monitor status of the knowledge manufacturing cell in real-time and guarantees safe running of the system. Finally, a case study is presented to demonstrate the feasibility and effectiveness of the proposed strategy.

关键词： Deadlock-free Automata distributed deadlock supervisor Knowledgeable manufacturing cell

来源：评论

学校读者我要写书评

暂无评论

Software Defined networking: From Theory to Practice

Software Defined Networking: From Theory to Practice

引用

international conference on Parallel distributed and Grid computing (PDGC)

作者： Jitendra Bhatia Radha Govani Madhuri Bhavsar Institute of Technology Nirma University Ahmedabad India Vishwakarma Government Engineering College Gujarat Technological University Ahmedabad India

ISBN: (纸本)9781728106489

Evolving mega-trends such as mobile, social, cloud, and big data and correspondence innovations (ICT) are identifying new difficulties to evolving technologies, for which omnipresent availability, high data transmission, and dynamic management are essential. Conventional network approaches being manually configured are awkward and mistake inclined, and are incapable to completely use the capacity of physical network infrastructure. Automation can be difficult in cases where the decision making is distributed for switching or routing that coexist on the same device. To mitigate these challenges, programmable network is regained through the emergence of Software Defined Network (SDN). As of late, SDN has been endorsed as a standout amongst the most encouraging arrangements for future and emerging Internet. SDN is also known as “revolutionary paradigm shifts” in networking. We initially depict a by and large acknowledged definition for SDN, highlighting its distinctive attributes and prospective advantages. We then harp on its three layered design, including an infrastructure layer, a control layer, and an application layer, upholding every layer with present research efforts and its concerned research domains. We then propose a load balancing approach incorporating SDN which highlights the practical application of SDN and proves to be efficient. At last, we conclude with some recommended open research challenges in this domain.

关键词： Control systems Software defined networking Standards Software Computer architecture Hardware Protocols

来源：评论

学校读者我要写书评

暂无评论

An Efficient ID-Based Partially Blind Signature Scheme

An Efficient ID-Based Partially Blind Signature Scheme

引用

ACIS international conference on Software Engineering, Artificial Intelligence, networking, and Parallel/distributed computing (SNPD)

作者： Xiaoming Hu Shangteng Huang Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

A partially blind signature allows a signer to explicitly embed a pre-agreed common information into a blind signature without the loss of blindness property. It is an important technology in e-commerce. In ID-based public key setting, a user's public key can be derived directly from his identity without access to public key certificate. It can simplify the key management process in traditional certificate based cryptosystem. To our knowledge, many partially blind signature schemes have been proposed till now. However, no ID-based partially blind signature scheme has been proposed. Recently, Chow et al. first proposed an ID-based partially blind signature scheme based on bilinear pairings, but it isn 't very efficient. In this paper, we improve C how et al's scheme and present a new ID-based partially blind signature scheme. We also analyze the security and efficiency of the proposed scheme. We show that our scheme is more efficient and needs less computation cost than Chow et al.'s scheme and is provably secure under the random oracle model.

关键词： Identity-based encryption Public key Public key cryptography Blindness Information security Software engineering Artificial intelligence distributed computing Computer science Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Early Experiences with Write-Write Design of NFS over RDMA

Early Experiences with Write-Write Design of NFS over RDMA

引用

international conference on networking, Architecture, and Storage (NAS)

作者： Bo Li Panyong Zhang Zhigang Huo Dan Meng National Research Center for Intelligent Computing Systems Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy of Sciences China National Research Center for Intelligent Computing Systems Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy and Sciences China

The network file system (NFS) protocol, as the de facto standard for sharing files in a distributed environment, has deployed Infiniband as the underlying transport of sunRPC, namely NFS over RDMA. In the current Read-Write design of NFS over RDMA, NFS write performance is limited for not fully utilizing the features of Infiniband. In this paper, we take on the challenge of enhancing the write performance of NFS. We propose and evaluate a new design of sunRPC over RDMA, namely Write-Write design. To guarantee the security of our design, we propose an HCA-based memory protection extension of Infiniband. Evaluations show that our Write-Write design increases the kernel-to-kernel RPC bandwidth by 15~27%. In real disk test, our Write-Write design gains 15%~22% in multi-client benchmarks compared with the Read-Write design.

关键词： Security Protection Bandwidth Scalability Computer architecture Computer networks distributed computing File systems Benchmark testing Protocols

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracing: Memoization of Task Graphs for Dynamic Task-Based Runtimes 18

Dynamic Tracing: Memoization of Task Graphs for Dynamic Task...

引用

ACM/IEEE international conference for High Performance computing, networking, Storage, and Analysis

作者： Wonchan Lee Elliott Slaughter Michael Bauer Sean Treichler Todd Warszawski Michael Garland Alex Aiken Stanford University SLAC National Accelerator Laboratory NVIDIA

ISBN: (纸本)9781538683859

Many recent programming systems for both supercomputing and data center workloads generate task graphs to express computations that run on parallel and distributed machines. Due to the overhead associated with constructing these graphs the dependence analysis that generates them is often statically computed and memoized, and the resulting graph executed repeatedly at runtime. However, many applications require a dynamic dependence analysis due to data dependent behavior, but there are new challenges in capturing and re- executing task graphs at runtime. In this work, we introduce dynamic tracing, a technique to capture a dynamic dependence analysis of a trace that generates a task graph, and replay it. We show that an implementation of dynamic tracing improves strong scaling by an average of 4.9× and up to 7.0× on a suite of already optimized benchmarks.

关键词： Task analysis Runtime Programming Calculus Coherence distributed databases Dynamic programming task graphs Runtime distributed databases task analysis Calculus Calculi Programming dynamic programming coherence

来源：评论

学校读者我要写书评

暂无评论

Load balancing and quality of service constrained framework for distributed Virtual Environments

Load balancing and quality of service constrained framework ...

引用

international conference on Collaborative computing: networking, Applications and Worksharing (CollaborateCom)

作者： Noah Dietrich Shankar M. Banik College of Charleston Charleston SC USA Citadel Charleston SC USA

distributed Virtual Environments (DVE) have become increasingly popular over the last few years. Examples of DVEs are Massively Multiplayer Online Games (MMOGs), distributed interactive simulations, and shared virtual worlds. The service providers of DVEs need to ensure that certain Quality of Service (QoS) (messages delivered within a threshold delay) is guaranteed for the users participating in the DVE. In addition to ensuring QoS, the service providers want to balance the load on the servers that maintain the DVE. In this paper, we propose a framework for DVEs which provides QoS to the users and balances the load among the servers. Our framework uses the concept of a virtual server which is a piece of software that does the processing for the DVEs. Each region in the DVE is maintained by an overlay of virtual servers. We provide a heuristic that maps the virtual servers to physical servers, balances the load among the servers and ensures that the servers are not overloaded with objects. We also present a heuristic for creating a Degree and Diameter Bounded Multicast Tree of virtual servers for each region in the DVE which guarantees QoS for users in the DVE. We have conducted simulation experiments to evaluate the performance of our proposed framework.

关键词： Servers Quality of service Cooling

来源：评论

学校读者我要写书评

暂无评论

SLA-driven Creditable and Negotiable Resource optimized Allocation Scheme in Cloud 16

SLA-driven Creditable and Negotiable Resource optimized Allo...

引用

16th IEEE international Wireless Communications and Mobile computing conference, IWCMC 2020

作者： Peng, Yu Yong, Yan Haotian, Qiu Ying, Wang Fanqin, Zhou Lei, Feng Wenjing, Li Xue-Song, Qiu State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China State Grid Zhejiang Electric Power Company Ltd Hangzhou310014 China

ISBN: (纸本)9781728131290

The cloud computing market is dynamic, distributed, and lacks central authorization. In this environment, cloud resource providers are vulnerable to deception and cloud resources may be abused. How to implement efficient and feasible trusted negotiations with users to expand Benefits is an urgent issue. Based on SLA (Service Level Agreement), this paper proposes a trusted negotiation method to optimize cloud resource allocation from the perspective of cloud resource providers. In a nutshell, it firstly quantifies each indicator based on the total amount of cloud resources requested by the user and the corresponding price, the user's comprehensive credit, and the total amount of resources corresponding to each SLA level, then filters the users who meet the requirements. Next knapsack algorithm and the greedy algorithm based on dynamic programming are used to predict the allocation of cloud resources respectively. Finally, the allocated users are negotiated to reach a transaction. This article takes the resource allocation price, negotiated price, and negotiated success rate as the evaluation index. The simulation results show that compared with the greedy algorithm, the algorithm in this paper has higher resource allocation price, negotiated price and negotiated success rate under different numbers of users, and can effectively realize the optimal allocation of cloud resources. © 2020 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Optimizing the performance of Database as a Service (DaaS) model — A distributed approach

Optimizing the performance of Database as a Service (DaaS) m...

引用

international conference on computing and networking Technology (ICCNT)

作者： R J Thara S Shine C Sanu Terna Public Charitable Trust's College of Engineering Osmanabad Maharashtra IN

Database as a Service (DaaS) is one among the latest service models offered by cloud computing and is adapted by most of the organizations. Database fragmentation, replication and allocation are the key issues to be tackled by most of the DaaS framework. Out of these issues the problem of replication is discussed throughout this paper. Optimizing the performance of DaaS service model by means of strategic database replication is the motivation behind this paper. We assume that the database fragmentation is already done for a given DaaS platform, and we take database fragments as the unit of replication in our replication procedure. As part of the survey, we studied the existing database replication schemes in detail and identified their major performance issues. After review we introduced a new strategy for database replication in DaaS framework. Our approach solves some of the current issues involved and targets to mixed goals out of replication. The replication strategy proceed in three phases; selecting the most popular database fragment, its placement at optimal server and finally the maintenance of replicas forever. Simulation experiments are conducted to evaluate the performance of proposed algorithm. We observed that our algorithm runs in polynomial time and yields suboptimal solution.

关键词： Servers Cloud computing Computational modeling distributed databases Availability Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Improvement of Multi-Dimensional Indexing System for Multimedia Big Data

Improvement of Multi-Dimensional Indexing System for Multime...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, networking, and Parallel/distributed computing (SNPD)

作者： Kazuto Nakanishi Teruhisa Hochin Hiroki Nomiya Hiroaki Hirata Graduate School of Information Science Kyoto Institute of Technology Kyoto Japan Faculty of Information and Human Sciences Kyoto Institute of Technology Kyoto Japan

This paper improves the parallel multi-dimensional indexing system which stores data into several multi-dimensional indexes and retrieves required data from them in parallel. This system treats a set of data as a rectangle, which covers the data. The rectangle is inserted into an index. We must consider two important points. One is that the area of each index covers as wide as possible so that many indexes could be used in the retrieval. The other is that the number of rectangles which each index has is the same as possible so that the time in finishing the retrieval on each index could be the same as possible. The conventional system selects an index to which a rectangle is moved by using the area that the index covers and the number of rectangles that the index has. The conventional system first evaluates the degree of the expansion of area and then evaluates the number of rectangles. This paper changes the evaluation order. The number of rectangles is firstly evaluated. It is experimentally shown that the new evaluation order gives us good retrieval performance.

关键词： Indexing distributed databases Multimedia systems Gaussian distribution Big Data Information science

来源：评论

学校读者我要写书评

暂无评论

Research of an Innovative Light distributed Workflow Management System

Research of an Innovative Light Distributed Workflow Managem...

引用

The 4th international conference on Wireless Communications, networking and Mobile computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Y.CHE G.WANG B.Y.REN School of Mechatronics Engineering Harbin Institute of Technology Harbin China

At present, most of WfMSs (workflow management systems) in the market are based on centralized defining in the organization. Further more, they have poor ability to describe the complex process, and have difficulty to deal with the business process share between cross-organizations. To support virtual and cross-organizational workflows in distributed environment, WfMSs must realize cross-organizational and distributed management to improve the dependability and extensible etc. To solve these issues, a Web-based lightweight process modeling system has been developed in this paper. This system is based on Java and XML technology, and provides friendly GUI which is easy to be used. The model document can be saved in XML format, so the interoperation between different workflow products becomes easy. This system establishes the base for enacting the WfMSs.

关键词： WfMS distributed Modeling Lightweight

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 488 489 490 491 492 493 494 495 496 497 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：