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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

1,160 篇 distributed comp...
419 篇 software enginee...
362 篇 cloud computing
360 篇 artificial intel...
312 篇 computer archite...
303 篇 computer network...
284 篇 social networkin...
269 篇 protocols
247 篇 computer science
239 篇 computational mo...
221 篇 wireless sensor ...
215 篇 scalability
207 篇 resource managem...
205 篇 peer to peer com...
196 篇 routing
190 篇 bandwidth
190 篇 servers
188 篇 application soft...
187 篇 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 篇 beijing universi...
10 篇 poznan supercomp...
10 篇 school of comput...
10 篇 department of co...
10 篇 beijing universi...
9 篇 inria
9 篇 research institu...
9 篇 school of comput...
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...

作者

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

语言

6,885 篇 英文
277 篇 其他
50 篇 中文

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

共 7206 条记录，以下是1901-1910 订阅

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

详细简洁

排序：

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits 18

Set-Constrained Delivery Broadcast: Definition, Abstraction ...

引用

19th international conference on distributed computing and networking (ICDCN)

作者： Imbs, Damien Mostefaoui, Achour Perrin, Matthieu Raynal, Michel Univ Aix Marseille LIF Marseille France Univ Nantes LS2N Nantes France Univ Rennes Inst Univ France IRISA Rennes France

ISBN: (纸本)9781450363723

This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures. This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers a set of messages including a message m', no process delivers first a set of messages including m' and later a set of message including m. After having presented an algorithm implementing SCD-broadcast, the paper investigates its programming power and its computability limits. On the "power" side it presents SCD-broadcast-based algorithms, which are both simple and efficient, building objects (such as snapshot and conflict-free replicated data), and distributed tasks. On the "computability limits" side it shows that SCD-broadcast and read/write registers are computationally equivalent.

关键词： Abstraction Asynchronous system Communication abstraction Conflict-free replicated data type Design simplicity distributed task Linearizability Message-passing system Process crash Read/write atomic register Snapshot object

来源：评论

学校读者我要写书评

暂无评论

distributed User-based Collaborative Filtering on an Opportunistic Network 32

Distributed User-based Collaborative Filtering on an Opportu...

引用

32nd IEEE international conference on Advanced Information networking and Applications (IEEE AINA)

作者： Barbosa, Lucas Nunes Gemmell, Jonathan Horvath, Miller Heimfarth, Tales Univ Fed Lavras UFLA Comp Sci Dept Lavras Brazil DePaul Univ Coll Comp & Digital Media Chicago IL USA Ctr Univ FEI Comp Sci Dept Sao Bernardo Do Campo Brazil

ISBN: (纸本)9781538621950

This paper presents a novel collaborative filtering recommender system based on an opportunistic distributed network. Collaborative filtering algorithms are widely used in many online systems. Often, the computation of these recommender systems is performed on a central server, controlled by the provider, requiring constant internet connection for gathering and computing data. However, in many scenarios, such constraints cannot be guaranteed or may not even be desired. This work proposes a recommendation engine where users share information via an opportunistic network independent of a dedicated internet connection. In this framework, each node is responsible for gathering information from nearby nodes and calculating its own recommendations. Using a centralized collaborative filtering recommender as a baseline, we evaluate three simulated scenarios composed by different movement speeds and data exchange parameters. Our results show that in a relatively short time, an opportunistic distributed recommender systems can achieve results similar to a traditional central system. Our analysis shows that the speed at which the opportunistic recommender system stabilizes depends on several factors including density of the users, movement speed and patterns of the users, and transmission strategies.

关键词： opportunistic networks recommender systems mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Optimizing High Performance distributed Memory Parallel Hash Tables for DNA k-mer Counting

Optimizing High Performance Distributed Memory Parallel Hash...

引用

international conference on High Performance computing, networking, Storage, and Analysis (SC)

作者： Pan, Tony C. Misra, Sanchit Aluru, Srinivas Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA Intel Corp Parallel Comp Lab Bangalore Karnataka India

ISBN: (纸本)9781538683842

High-throughput DNA sequencing is the mainstay of modern genomics research. A common operation used in bioinformatic analysis for many applications of high-throughput sequencing is the counting and indexing of fixed length substrings of DNA sequences called k-mers. Counting k-mers is often accomplished via hashing, and distributed memory k-mer counting algorithms for large datasets are memory access and network communication bound. In this work, we present two optimized distributed parallel hash table techniques that utilize cache friendly algorithms for local hashing, overlapped communication and computation to hide communication costs, and vectorized hash functions that are specialized for k-mer and other short key indices. On 4096 cores of the NERSC Cori supercomputer, our implementation completed index construction and query on an approximately 1 TB human genome dataset in just 11.8 seconds and 5.8 seconds, demonstrating speedups of 2.06x and 3.7x, respectively, over the previous state-of-the-art distributed memory k-mer counter.

关键词： Hash tables k-mer counting vectorization cache-aware optimizations distributed memory algorithms

来源：评论

学校读者我要写书评

暂无评论

Topology-based analysis of performance evaluation of centralized vs. distributed SDN controller

Topology-based analysis of performance evaluation of central...

引用

2018 IEEE international conference on Current Trends in Advanced computing, ICCTAC 2018

作者： Research, Pushpa. J. Raj, Pethuru VTU Bangalore India Division Reliance Jio Infocomm. Ltd Bangalore India

ISBN: (纸本)9781538643228

Software Defined Network (SDN) Technology made tremendous changes in networking field by controlling the hardware with remote software by decoupling data plane and control plane. The focus here is on the controller which is part of control plane. A controller is a central part of SDN;it is an intermediary between Data plane and Forwarding plane. It takes prime place in SDN architecture like Operating System in Computers. SDN Controller is a software which directs the packets using flow rules and also contains statistical information of network. The controller orchestrates the networking devices such as switches and routers by channelizing the packets. SDN controller has different flavor based on the commercial requirement achieved by including new pluggable module. This paper discusses some of the SDN Controller with their feature;the controllers are POX, NOX, Floodlight, ODL, Open Contrail. This paper also compares the characteristic of centralized and distributed controller by focusing on performance, bandwidth and round-trip time of Floodlight and Open Daylight (ODL) controller. The simulation is conducted using Mininet. © 2018 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

A distributed Algorithm for Multi-Stage Computation Offloading 7

A Distributed Algorithm for Multi-Stage Computation Offloadi...

引用

IEEE 7th international conference on Cloud networking (CloudNet)

作者： Mahn, Tobias Becker, Dennis Al-Shatri, Hussein Klein, Anja Tech Univ Darmstadt Commun Engn Lab Darmstadt Germany

ISBN: (纸本)9781538668313

A scenario consisting of several mobile users, an access point (AP) and a cloud server in a multi-stage hierarchy is considered. Each user has a computation task which can be computed locally or offloaded to the AP or to the cloud server. Considering the shared access channel between users and the AP, the shared computation resources at the AP and the shared backhaul link connection from the AP to the cloud, an energy minimization computation offloading problem with a time constraint is tackled. The time constraint guarantees that the offloading time will not exceed the local computation time. In this paper, we propose a distributed game theoretic algorithm which decomposes the offloading problem into the subproblems of resource allocation and offloading decisions. The algorithm works iteratively between the two subproblems as follows: The AP receives offloading decisions from the users and accordingly optimizes the fractions of the bandwidth on the access channel, the fractions of the backhaul link rate and the fractions of the computation resource at the AP for all offloading users. Based on the assigned resources, each user autonomously decides between local computation or offloading to the AP or to the cloud server and reports its decision to the AP. Our proposed algorithm is shown to require only limited signaling between users and AP and converges in significantly few iterations. Furthermore, the results show that our algorithm performs close to the optimal policy.

关键词： Task analysis Servers Cloud computing Computational modeling Minimization Bandwidth OFDM

来源：评论

学校读者我要写书评

暂无评论

A Rumor Blocking Method Based on Tolerance of Users

A Rumor Blocking Method Based on Tolerance of Users

引用

IEEE international Symposium on Parallel and distributed Processing with Applications and IEEE international conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Min Zhang Xiaoming Wang Xueyang Qin School of Computer Science Shaanxi Normal University Xi’an China

ISBN: (纸本)9781728152103

With the development of online social networks (OSNs), not only the positive and useful information propagates rapidly and widely, but also the misinformation such as rumors have a high propagating speed, which makes it extremely difficult to prevent rumors from propagating in OSNs. Currently, there are two main measures to control the propagation of rumors in OSNs: blocking rumors through blocking influential users and competing to the rumors to clarify them through propagation of the truth. In this paper, we aim to prevent rumors through blocking measures so as to minimize the influence of rumors in OSNs within the tolerance of users. Considering the realistic factors, we propose a novel rumor blocking method based on tolerance of users, called RBMTU. In this model, a new influential nodes selecting method is firstly proposed based on information entropy. Then we introduce the concept of user blocking tolerance and construct the formalized definition of it. Finally, we use two algorithms to solve the problem and two experiments are designed to verify the validity of our proposed method.

关键词： entropy social networking (online) Gossip Consumers entropy BLOCKING Tolerances Tolerance Tolerance Tolerance physiologic tolerance Propagating misinformation

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Trajectory Features Based Sensitive Relationship Protection

Spatio-Temporal Trajectory Features Based Sensitive Relation...

引用

IEEE international Symposium on Parallel and distributed Processing with Applications and IEEE international conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Xiangyu Liu Yifan Shen Xiufeng Xia Jiajia Li Chuanyu Zong Rui Zhu School of Computer Science Shenyang Aerospace University Shenyang China School of IT and Business Wellington Institute of Technology Lower Hutt New Zealand

ISBN: (纸本)9781728152103

To solve the problem of privacy leakage of sensitive relationships caused by the spatial-temporal trajectory correlation of users in social networks, this paper proposes a privacy protection algorithm for sensitive relationships based on spatial-temporal trajectory features. In this paper, we propose a new measurement model for evaluating users' similarities, the basic idea of which is to calculate the similarity between users' sub-trajectories based on spatial and temporal dimensions. The proposed privacy protection algorithm adopts a heuristic to evaluate the inference contribution and information loss caused by data modification in order to protect sensitive relationship privacy meanwhile maintaining the trajectory data utility. We also provide the security analysis and theoretically prove the availability of the proposed algorithm. Based on the real social network data, the experimental results show that the proposed algorithm is efficient and could achieve high data utility.

关键词： data privacy social networking (online) Data privacy Privacy trajectory Consumers information loss Social Networks Heuristics algorithms

来源：评论

学校读者我要写书评

暂无评论

Critical Investigation of Denial of Service and distributed Denial of Service Models and Tools

Critical Investigation of Denial of Service and Distributed ...

引用

2018 IEEE international conference on Advances in computing, Communication Control and networking, ICACCCN 2018

作者： Sharma, Ankita Bhasin, Anshu Dept: Computer Science Engineering IKGPTU Jalandhar Punjab India

ISBN: (纸本)9781538641194

distributed Denial of Service (DDOS)and Denial of Service (DoS) attacks has become a major threat to steal information over computer networks. Today, mostly hacker launches the attack using DoS, which works on internet based system such as Net banking, defense, government ,e-commerce etc. The purpose of this paper is to perform comparative analysis for tools to handle attacks. The investigations brought out depth control, technical advantage and limitations of these contemporary tools. This would help all researchers to hand pick the tool, for their experimentation work in field of DoS attacks. © 2018 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Detection of Social Groups in Class by Affinity Propagation

Detection of Social Groups in Class by Affinity Propagation

引用

IEEE international Symposium on Parallel and distributed Processing with Applications and IEEE international conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Yajie Wang Qiyang Peng Zhao Pei Miao Ma Yuli Chen Chengcai Leng Honghong Yang School of Information Engineering Shaanxi Xueqian Normal University Xi’an China School of Computer Science Shaanxi Normal University Xi’an China Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an China School of Mathematics Northwest University Xi’an China

ISBN: (纸本)9781728152103

The social groups often represent the groups within which are dense connections and between which are sparse connections. The social groups are actually the clusters. In this paper, we propose a simple but powerful method to combine the content and link information of the social network in the class, and analyze the results of different graph clustering algorithms, our experimental result shows that social groups detection by Affinity Propagation algorithm outperforms than the other clustering algorithms. In addition, we analyze the centrality of the detected communities and find the groups detected can significantly help to improve the quality of the teaching and learning.

关键词： computer aided instruction network theory (graphs) pattern clustering social networking (online) social group computer-assisted instruction Clustering algorithms Communities Cluster Analysis Social Media Social Networks

来源：评论

学校读者我要写书评

暂无评论

Improving Accuracy of Key Information Acquisition for Social Media Text Summarization

Improving Accuracy of Key Information Acquisition for Social...

引用

IEEE international Symposium on Parallel and distributed Processing with Applications and IEEE international conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Wanwan Miao Guiping Zhang Yu Bai Dongfeng Cai Human-Computer Intelligence Research Center Shenyang Aerospace University Shenyang Liaoning China Shenyang Aerospace University Shenyang China

ISBN: (纸本)9781728152103

The attention-based sequence-to-sequence (Seq2Seq) model for abstractive summarization has achieved good performance, but it still suffers from generating inaccurate information and repetitive content when applied to noisy social media text. To address these issues, we propose a novel model that includes a feature extractor and a semantic enhancer. In our model, the feature extractor produces feature vectors that contain key information, filtering out noise in the source text. The semantic enhancer takes the concatenation of the feature vectors and the encoder hidden states as input to learn long-range dependencies, further improving semantic relevance and reducing repetition. Experimental results on a Chinese social media dataset show that our model can capture the key information from noisy text and achieve improvement as compared to state-of-the-art baseline models.

关键词： feature extraction social networking (online) text analysis text processing information gathering Feature extraction Social Media texts Eigenvector Noise Semantics extraction device

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 187 188 189 190 191 192 193 194 195 196 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：