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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,036 篇 会议
92 篇 期刊文献
52 册 图书

馆藏范围

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

日期分布

学科分类号

3,966 篇 工学
- 3,411 篇 计算机科学与技术...
- 1,568 篇 信息与通信工程
- 1,424 篇 软件工程
- 1,051 篇 电气工程
- 245 篇 控制科学与工程
- 123 篇 电子科学与技术（可...
- 95 篇 网络空间安全
- 78 篇 动力工程及工程热...
- 74 篇 仪器科学与技术
- 64 篇 生物工程
- 54 篇 机械工程
- 37 篇 安全科学与工程
- 34 篇 建筑学
- 34 篇 土木工程
- 33 篇 测绘科学与技术
- 32 篇 交通运输工程
- 31 篇 生物医学工程（可授...
566 篇 管理学
- 416 篇 管理科学与工程(可...
- 189 篇 图书情报与档案管...
- 143 篇 工商管理
520 篇 理学
- 314 篇 数学
- 95 篇 物理学
- 74 篇 生物学
- 73 篇 系统科学
- 66 篇 统计学（可授理学、...
100 篇 法学
- 52 篇 社会学
- 49 篇 法学
63 篇 医学
- 37 篇 基础医学(可授医学...
- 31 篇 公共卫生与预防医...
42 篇 经济学
- 41 篇 应用经济学
26 篇 文学
24 篇 教育学
12 篇 农学
6 篇 军事学
2 篇 艺术学

主题

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

机构

110 篇 beijing univ pos...
90 篇 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,055 篇 英文
81 篇 其他
47 篇 中文

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

共 7180 条记录，以下是1161-1170 订阅

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

详细简洁

排序：

A Generic Efficient Biased Optimizer for Consensus Protocols 20

A Generic Efficient Biased Optimizer for Consensus Protocols

引用

21st international conference on distributed computing and networking (ICDCN)

作者： Buchnik, Yehonatan Friedman, Roy Technion Comp Sci Dept Haifa Israel

ISBN: (纸本)9781450377515

Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on its exact variant and other environmental assumptions, solving consensus requires multiple communication rounds. Yet, there are known optimistic protocols that guarantee termination in a single communication round under favorable conditions. In this paper we present a generic optimizer that can turn any consensus protocol into an optimized protocol that terminates in a single communication round whenever all nodes start with the same predetermined value and no Byzantine failures occur (although node crashes are allowed). This is regardless of the network timing assumptions and additional oracle capabilities assumed by the base consensus protocol being optimized. In the case of benign failures, our optimizer works whenever the number of faulty nodes f < n/2. For Byzantine behavior, our optimizer's resiliency depends on the validity variant sought. In the case of classical validity, it can accommodate f < n/4 Byzantine failures. With the more recent external validity function assumption, it works whenever f < n/3. Either way, our optimizer only relies on oral messages, thereby imposing very light-weight crypto requirements.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

GRAPHTM: An Efficient Framework for Supporting Transactional Memory in a distributed Environment 20

GRAPHTM: An Efficient Framework for Supporting Transactional...

引用

21st international conference on distributed computing and networking (ICDCN)

作者： Poudel, Pavan Sharma, Gokarna Kent State Univ Kent OH 44242 USA

ISBN: (纸本)9781450377515

In this paper, we present GRAPHTM, an efficient and scalable framework for processing transactions in a distributed environment. The distributed environment is modeled as a graph where each node of the graph is a processing node that issues transactions. The objects that transactions use to execute are also on the graph nodes (the initial placement may be arbitrary). The transactions execute on the nodes which issue them after collecting all the objects that they need following the data-flow model of computation. This collection is done by issuing the requests for the objects as soon as transaction starts and wait until all required objects for the transaction come to the requesting node. The challenge is on how to schedule the transactions so that two crucial performance metrics, namely (i) total execution time to commit all the transactions, and (ii) total communication cost involved in moving the objects to the requesting nodes, are minimized. We implemented GRAPHTM in Java and assessed its performance through 3 micro-benchmarks and 5 complex benchmarks from STAMP benchmark suite on 5 different network topologies, namely, clique, line, grid, cluster, and star, that make an underlying communication network for a representative set of distributed systems commonly used in practice. The results show the efficiency and scalability of our approach.

关键词： distributed system transactional memory scheduling execution time communication cost conflicts waiting time

来源：评论

学校读者我要写书评

暂无评论

Towards an Ideal Queue Lock 20

Towards an Ideal Queue Lock

引用

21st international conference on distributed computing and networking (ICDCN)

作者： Jayanti, Prasad Jayanti, Siddhartha Jayanti, Sucharita Dartmouth Coll Hanover NH 03755 USA MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450377515

The MCS lock was the first mutual exclusion lock to support an arbitrary number of processes with unknown identities such that each process can acquire and release the lock in a constant number of RMRs on both Cache-Coherent and distributed Shared Memory multiprocessors. The MCS algorithm, however, has a shortcoming: its Exit section is not bounded. The algorithm also requires hardware support for more than one special instruction, namely, Fetch&Store and Compare&Swap. Many MCS-style algorithms were subsequently designed to overcome these shortcomings, but to the best of our knowledge they either lack some desirable property of the MCS lock or introduce a new shortcoming. In this paper we present a new MCS-style algorithm that has all of the desirable properties and no ostensible shortcoming. We also provide a rigorous, invariant-based proof of correctness. To realize a bounded Exit section, all prior MCS-style algorithms use either the "node-switching" or the "node-toggling" strategy. Our work unifies these two strategies: we present a single algorithm which, when appropriately instantiated, yields both a node-switching and a node-toggling algorithm. Moreover, the two algorithms so derived are the simplest in their respective classes among all known MCS-style algorithms.

关键词： mutual exclusion concurrent algorithm queue lock distributed computing RMR

来源：评论

学校读者我要写书评

暂无评论

Proceedings of XLOOP 2019: 1st Annual Workshop on Large-Scale Experiment-in-the-Loop computing, Held in conjunction with SC 2019: The international conference for High Performance computing, networking, Storage and Analysis

Proceedings of XLOOP 2019: 1st Annual Workshop on Large-Scal...

引用

1st IEEE/ACM Annual Workshop on Large-Scale Experiment-in-the-Loop computing, XLOOP 2019

ISBN: (纸本)9781728159836

The proceedings contain 6 papers. The topics discussed include: computational strategies to increase ef?ciency of Gaussian-process-driven autonomous experiments;scientific image restoration anywhere;distributed global digital volume correlation by optimal transport;sparse data management in HDF5;Balsam: near real-time experimental data analysis on supercomputers;and data processing at the linac coherent light source.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impact of Word of Mouth Effect on the Korean Overseas Travel: Based on Tourists Type

Impact of Word of Mouth Effect on the Korean Overseas Travel...

引用

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

作者： Su Yeon Kim Taegu Kim Hanbat National Univ. Daejeon Korea

The purpose of this study is to analyze the influence of word of mouth effect on Koreans' overseas travel destination decisions. The tourist group was divided into package travelers and free travelers, and various influencing factors were included as independent variables. As a result of the analysis, we found that package travelers tend to supply information to social media after travel, while free travelers collect information from social media before travel and use it for decision-making. Economic variables, which have been claimed as a major factor in previous studies, have relatively low influence, and in particular, economic indicators of Korea are not significant.

关键词： Exchange rates Social networking (online) Decision making Tourism industry Mouth Regression analysis Software engineering

来源：评论

学校读者我要写书评

暂无评论

Structure-Noise-Aware Anchor Link Prediction Across Social Networks

Structure-Noise-Aware Anchor Link Prediction Across Social N...

引用

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： Dongwei Zhu Peng Zhang Wenhao Zhu Minghao Tang Wenyu Zang Hongbo Xu Chinese Academy of Sciences Institute of Information Engineering School of Cyber Security University of Chinese Academy of Sciences School of Cyberspace Security Nanjing University of Science and Technology China Electronics Corporation

Anchor Link Prediction (ALP) across social networks plays a pivotal role in inter-network applications. The difficulty of anchor link prediction across social networks lies in how to consider the factors affecting nodes alignment comprehensively. In recent years, predicting anchor links based on network embedding has become the main trend. For social networks, previous anchor link prediction methods first integrate neighbourhood nodes associated with a user node to obtain a fusion embedding vector from global perspective, and then predict anchor links based on the similarity between fusion vectors corresponding with different user nodes. However, the social network structure contains a lot of structural noise, which is ignored by the fusion vector. To address the challenge, we propose a novel structure-noise-aware anchor link prediction framework across social networks (SNALP), which models all the edges of the node from a fine-grained perspective and evaluates the contribution of them. Then, each edge is given a different weight according to their contribution. While the trusted edges are enhanced, the effects of noisy edges are reduced. SNALP can solve the network embedding and structure-noise-aware alignment under a unified optimization framework. Extensive experiments on real social network datasets demonstrate the effectiveness and efficiency of the proposed approach compared with several state-of-the-art methods.

关键词： Social networking (online) Predictive models Market research Noise measurement Optimization

来源：评论

学校读者我要写书评

暂无评论

Investigation and System Design of distributed Communication Radios

Investigation and System Design of Distributed Communication...

引用

networking, Communications and Information Technology (NetCIT), international conference on

作者： Ting Ding Shanghai Aircraft Design and Research Institute Shanghai China

ISBN: (纸本)9781665400718

The communication distributed radio concept distributes the RADIO frequency transceiver (TX/RX) sensor portion and most of the processing portion of the system to the aircraft area near the antenna. The rest of the digital portion of the system can be hosted on a common computing platform, such as the Integrated Modular Avionics System (IMA).

关键词： Radio frequency Costs Coaxial cables distributed databases Computer architecture Aerospace electronics Transceivers

来源：评论

学校读者我要写书评

暂无评论

Towards Secure Bilateral Friend Query with Conjunctive Policy Matching in Social Networks

Towards Secure Bilateral Friend Query with Conjunctive Polic...

引用

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： Chuan Zhang Mingyang Zhao Tong Wu Weiting Zhang Qing Fan Liehuang Zhu Cyberspace Science and Technology Beijing Institute of Technology Beijing China Cyberspace Science and Technology Beijing Institute of Technology Defense Innovation Institute Chinese Academy of Military Science Beijing China Electronic and Information Engineering Beijing Jiaotong University Beijing China

Bilateral friend queries have attracted increasing interest in social networks, as each user has a common requirement to specify a policy for the other. However, existing bilateral friend query schemes either only cannot support conjunctive policy matching, where the match is successful if the policy is a subset of attributes, or compromise user privacy, which reduces users' enthusiasm for friend query services. In this paper, we propose a secure bilateral friend query with conjunctive policy matching named BFQ. Specifically, the matchmaking encryption technique is utilized to achieve bilateral policy specification, where both sender and requester can specify policies for the other. Then, based on the Newton interpolation theorem, we design a novel conjunctive policy matching algorithm, where the match succeeds if and only if user authenticity holds and the policies of both parties are the subset of attributes. Otherwise, nothing is revealed except whether the match occurs or not. Security analysis proves that user authenticity and privacy, i.e., attribute privacy, policy privacy, and match privacy, are well guaranteed under the chosen-plaintext attack. We then implement a real prototype application and demonstrate that BFQ has practical efficiency through theoretical and experimental evaluation.

关键词： Access control Privacy Interpolation Analytical models Social networking (online) Prototypes Encryption

来源：评论

学校读者我要写书评

暂无评论

Autonomic ZTA-based Network Management Engine (AZNME)

Autonomic ZTA-based Network Management Engine (AZNME)

引用

IEEE international conference on Software Reliability Engineering Workshops (ISSRE Wksp)

作者： Cihan Tunc James Durflinger Charif Mahmoudi Valerio Formicola Computer Science & Engineering University of North Texas Denton Texas Siemens Technology US Princeton New Jersey Electrical and Computer Engineering California Polytechnic State University Pomona California

ISBN: (数字)9781665476799

ISBN: (纸本)9781665476805

The advancements in computer and networking technologies created closely connected cyberspaces. Nevertheless, this also invalidated many traditional and isolated/local network solutions and introduced higher cybersecurity risk. As a solution, NIST's Zero-Trust Architecture (ZTA) with “never trust, always verify” principle has been widely accepted; yet, its implementation, enforcement, and compliance-check mechanisms are still immature as the solutions are generally applied manually. In this paper, we present an autonomic computing based management engine for networking of a cyberspace, we refer as Autonomic ZTA-based Network Management Engine (AZNME), which monitors an asset's network connections, checks if these connections fulfill ZTA requirements, and evaluates trust continuously, and takes mitigation actions as needed. As a proof of concept, we implemented the AZNME focusing on active connections (e.g., IPs and ports) to enforce policies and create firewall rules based on trust evaluation.

关键词： Firewalls (computing) conferences Cyberspace Focusing NIST Software reliability distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Modified Data Clustering Algorithm for Uncertain Data in Peer to Peer Networks

A Modified Data Clustering Algorithm for Uncertain Data in P...

引用

Advances in computing, Communication Control and networking (ICAC3N), international conference on

作者： Shailender Kumar Divyanka Delhi Technological University New Delhi India

ISBN: (纸本)9781665438124

A sensational rise of various applications and businesses has led to the rise of data being collected, it is getting harder to store this data on a single machine. It has become more feasible to manage dispersed data sets and organizations. That is the reason distributed data mining methods have become popular. Perhaps the main hurdle of data mining is to perform data clustering. While many clustering calculations exist for certain and uncertain data sets, there is need of productive calculations for distributed data sets. In this paper, a modified hierarchical clustering algorithm is proposed for uncertain dataset to improve timing in execution of the process.

关键词： distributed databases Clustering algorithms Organizations Peer-to-peer computing Timing Data mining Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 113 114 115 116 117 118 119 120 121 122 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：