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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,699 篇 会议
32 篇 期刊文献
25 册 图书

馆藏范围

2,756 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,682 篇 工学
- 1,477 篇 计算机科学与技术...
- 671 篇 软件工程
- 490 篇 信息与通信工程
- 355 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
323 篇 理学
- 192 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
27 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
83 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,687 篇 英文
62 篇 其他
6 篇 中文
2 篇 法文

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

共 2756 条记录，以下是951-960 订阅

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

详细简洁

排序：

Design and Analysis of a Modified Remote Attestation Protocol 16

Design and Analysis of a Modified Remote Attestation Protoco...

引用

16th IEEE international conference on Trust, Security and Privacy in computing and Communications / the 11th IEEE international conference on Big Data Science and Engineering / the 14th IEEE international conference on Embedded Software and Systems

作者： Santra, Monika Peddoju, Sateesh K. Bhattacharjee, A. K. Khan, Arindam Indian Inst Technol Roorkee Dept Comp Sci & Engn Roorkee 247667 Uttar Pradesh India Bhabha Atom Res Ctr Reactor Control Div Mumbai Maharashtra India

ISBN: (纸本)9781509049066

Secure interaction amongst system components is inherent to ensure the trustworthiness of the applications. In a distributed system, the attester should know whether the communicating client as well as the user who is using that client system is trustworthy. this can be achieved by a technique called remote attestation. this study presents a three-phase remote attestation protocol which provides relaxation over the low extensibility and low openness problem of binary remote attestation method, using the support of the SELinux module. It also analyses the performance of different existing and related binary remote attestation methods with the proposed approach which shows that the suggested remote attestation method is efficient. the results of the formal analysis are achieved using ProVerif tool which proves that the proposed remote attestation protocol satisfies several security properties such as secrecy, authenticity, indistinguishability and unlinkability.

关键词： Trusted computing remote attestation formal model analysis attestation protocols security analysis

来源：评论

学校读者我要写书评

暂无评论

PU-ABE: Lightweight Attribute-Based Encryption Supporting Access Policy Update for Cloud Assisted IoT

PU-ABE: Lightweight Attribute-Based Encryption Supporting Ac...

引用

IEEE international conference on Cloud computing, CLOUD

作者： Sana Belguith Nesrine Kaaniche Giovanni Russello Cyber Security Foundry The University of Auckland New Zealand Telecom SudParis Univ. Paris-Saclay France

Cloud-assisted IoT applications are gaining an expanding interest, such that IoT devices are deployed in different distributed environments to collect and outsource sensed data to remote servers for further processing and sharing among users. On the one hand, in several applications, collected data are extremely sensitive and need to be protected before outsourcing. Generally, encryption techniques are applied at the data producer side to protect data from adversaries as well as curious cloud provider. On the other hand, sharing data among users requires fine grained access control mechanisms. To ensure both requirements, Attribute Based Encryption (ABE) has been widely applied to ensure encrypted access control to outsourced data. Although, ABE ensures fine grained access control and data confidentiality, updates of used access policies after encryption and outsourcing of data remains an open challenge. In this paper, we design PU-ABE, a new variant of key policy attribute based encryption supporting efficient access policy update that captures attributes addition to access policies. PU-ABE contributions are multifold. First, access policies involved in the encryption can be updated without requiring sharing secret keys between the cloud server and the data owners neither re-encrypting data. Second, PU-ABE ensures privacy preserving and fine grained access control to outsourced data. third, ciphertexts received by the end-user are constant sized and independent from the number of attributes used in the access policy which affords low communication and storage costs.

关键词： Encryption Servers Access control Cloud computing Boolean functions

来源：评论

学校读者我要写书评

暂无评论

distributed Deep Convolutional Neural Network For Smart Camera Image Recognition 2017

Distributed Deep Convolutional Neural Network For Smart Came...

引用

11th international conference on distributed Smart Cameras (ICDSC)

作者： Castillo, Emmanuel Ayuyao Ahmadinia, Ali Calif State Univ San Marcos Dept Comp Sci 333 S Twin Oaks Valley Rd San Marcos TX 92069 USA

ISBN: (纸本)9781450354875

Smart Cameras brought sight to the idea of cameras as sensors for visual data rather than strictly for taking pictures. One set of applications that leverages this idea are image recognition applications. Unfortunately, a main drawback on these applications is the hardware limitations that they compromise with due to many of its applications residing in the embedded domain. As a matter of fact, a Deep Convolutional Neural Network (DCNN) is the main general algorithm used in handling the image recognition tasks that can be costly in response time, power consumption and data transfer bandwidth. However, the general architecture of a DCNN is consisted of layers that do specific processing tasks. these distribution of layers can be efficiently organized on a system consisted of Smart Cameras that can improve response time, limit power usage and reduce data transfer bandwidth. A concept is proposed to distribute the layers of a DCNN within a distributed set of Smart Cameras on embedded devices, an edge device and the Cloud that may improve response time, power consumption and data transfer bandwidth.

关键词： distributed Neural Network Edge computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive distributed energy-saving data gathering technique for wireless sensor networks 13

Adaptive distributed energy-saving data gathering technique ...

引用

13th IEEE international conference on Wireless and Mobile computing, networking and Communications, WiMob 2017

作者： Idrees, Ali Kadhum Harb, Hassan Jaber, Ali Zahwe, Oussama Taam, Mohamad Abou Department of Computer Science University of Babylon Babylon Iraq Nabatiyeh/Tyre Lebanon Computer Science Department Faculty of Sciences Lebanese University Beirut Lebanon

ISBN: (纸本)9781538638392

Popularity of wireless sensor networks (WSNs) is increasing day a day where hundreds or thousands of applications are explored. In most of such applications, the need of gathering data periodically about the monitored environment beside the limited, generally irreplaceable, power sensor sources make energy conservation and big data gathering reduction two fundamental challenges in such networks. In this paper, we propose an Adaptive distributed Data Gathering (ADiDaG) technique for saving energy in periodic WSN applications. ADiDaG works into rounds where each round consists of three phases: data gathering, sampling decision, and transmission. these phases respectively use Map reduce, longest common subsequence similarity and grouping approach in order to search data redundancy and adapt sensor sampling rate at each round. the performance of ADiDaG is evaluated based on both simulation and experimentations where the obtained results show significant energy savings and high accurate data gathering compared to existing approaches. © 2017 IEEE.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

Corruption-Resistant Privacy Preserving distributed EM Algorithm for Model-Based Clustering 16

Corruption-Resistant Privacy Preserving Distributed EM Algor...

引用

作者： Leemaqz, Kaleb L. Lee, Sharon X. McLachlan, Geoffrey J. Univ Queensland Sch Math & Phys Brisbane Qld Australia

ISBN: (纸本)9781509049066

Statistical clustering plays an important role in data analysis and is one of the most widely used data mining methods. Concerns about the security and privacy of analyzing modern-day massive data across distributed networks have prompted the development of privacy preserving data mining algorithms. this paper proposes a scheme for model-based clustering and classification through a privacy-preserving EM-based learning of a mixture model. We focus on cooperative learning in a multiparty scenario where the parameters of the mixture model can be estimated on the entire data and learnt by all parties without disclosing any private data. In contrast to most existing works which assumed the adversary is Honest-but-Curious, we consider the seldom studied and much stronger and more realistic case of Malicious adversary with unlimited corruption capabilities. the proposed scheme adopts a cyclic communication topology and utilizes cryptographic techniques to encrypt communicated messages, rendering it resistant to multiple corrupted parities. By enforcing one way communication across a ring topology, no trust level hierarchy is required. Upon completion of the training algorithm, each party obtains a clustering of its own private data and is able service a third party by providing predicted cluster labels for new data. For illustration, the Gaussian mixture model is used to present our scheme.

关键词： Protocols Mixture models Data privacy Encryption Privacy Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Anonymous CoinJoin Transactions with Arbitrary Values 16

Anonymous CoinJoin Transactions with Arbitrary Values

引用

作者： Maurer, Felix Konstantin Neudecker, Till Florian, Martin Rhein Westfal TH Aachen Commun & Distributed Syst Aachen Germany Karlsruhe Inst Technol Inst Telemat Karlsruhe Germany

ISBN: (纸本)9781509049066

Bitcoin, the arguably most popular cryptocurrency to date, allows users to perform transactions using freely chosen pseudonymous addresses. Previous research, however, suggests that these pseudonyms can easily be linked, implying a lower level of privacy than originally expected. To obfuscate the links between pseudonyms, different mixing methods have been proposed. One of the first approaches is the CoinJoin concept, where multiple users merge their transactions into one larger transaction. In theory, CoinJoin can be used to mix and transact bitcoins simultaneously, in one step. Yet, it is expected that differing bitcoin amounts would allow an attacker to derive the original single transactions. Solutions based on CoinJoin therefore prescribe the use of fixed bitcoin amounts and cannot be used to perform arbitrary transactions. In this paper, we define a model for CoinJoin transactions and metrics that allow conclusions about the provided anonymity. We generate and analyze CoinJoin transactions and show that with differing, representative amounts they generally do not provide any significant anonymity gains. As a solution to this problem, we present an output splitting approach that introduces sufficient ambiguity to effectively prevent linking in CoinJoin transactions. Furthermore, we discuss how this approach could be used in Bitcoin today.

关键词： Bitcoin Joining processes Delays Public key Telematics Peer-to-peer computing

来源：评论

学校读者我要写书评

暂无评论

Balanced Iterative Reducing and Clustering Using Hierarchies with Principal Component Analysis (PBirch) for Intrusion Detection over Big Data in Mobile Cloud Environment 11th

Balanced Iterative Reducing and Clustering Using Hierarchies...

引用

11th international conference on Security, Privacy and Anonymity in Computation, Communication, and Storage (SpaCCS)

作者： Peng, Kai Zheng, Lixin Xu, Xiaolong Lin, Tao Leung, Victor C. M. Huaqiao Univ Coll Engn Quanzhou 362021 Fujian Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada Fujian Prov Acad Engn Res Ctr Ind Intellectual Te Quanzhou 362021 Fujian Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

ISBN: (纸本)9783030053451;9783030053444

With the development of big data, mobile cloud computing, cyber security issues have become more and more critical. thus, enabling an intrusion detection method over big data in mobile cloud environment is of paramount importance. In our previous research, we proposed an approach named Mini Batch Kmeans with Principal Component Analysis (PMBKM) for big data which can effectively solve the clustering problem for intrusion detection of big data, but it needs to preset the number of clusters. the best clustering number is selected by comparing the clustering results of different clustering values multiple times. To address the above issue, we propose a new clustering method named Balanced Iterative Reducing and Clustering Using Hierarchies with Principal Component Analysis (PBirch) in this paper. Compared to PMBKM, the experimental results show that PBirch can obtain a good clustering result without presetting clustering values, and the clustering result can be further improved by optimizing the relevant parameters. the clustering time of PBirch decreases linearly with the increasing of the cluster numbers. thus, the larger the number of clusters, the smaller the PBirch time cost. All in all, our proposed method can be widely used for big data in mobile cloud environment.

关键词： Mobile cloud environment Big data Intrusion detection Birch PCA

来源：评论

学校读者我要写书评

暂无评论

One-Round Provably Secure Yoking-Proof for RFID Applications 16

One-Round Provably Secure Yoking-Proof for RFID Applications

引用

作者： Sun, Da-Zhi Xu, Guang-Quan Tianjin Univ Sch Comp Sci & Technol Tianjin Key Lab Adv Networking TANK Tianjin Peoples R China Inst Informat Engn State Key Lab Informat Secur Beijing Peoples R China Univ Wollongong Sch Comp & Informat Technol Wollongong NSW Australia

ISBN: (纸本)9781509049066

Under the Internet of things (IoT), the coexistence proof of multiple RFID tagged objects becomes a very useful mechanism in many application areas such as health care, evidences in court, and stores. the yoking-proof scheme addresses this issue. However, all existing yoking-proof schemes require two or more rounds communication to generate the yoking-proof. In this paper, we investigate the design of one-round yoking-proof schemes. Our contributions are threefold: (1) to confirm the coexistence of the RFID tag pair, we propose a one-round offline yoking-proof scheme with privacy protection. (2) We define a privacy model of the yoking-proof scheme and enhance Moriyama's security model for the yoking-proof scheme. the security and the privacy of the proposed scheme are proved under our models. (3) We further extend the yoking-proof scheme for the coexistence of m RFID tags, where m>2. the extended scheme maintains one round. In addition, the proposed technique has efficiency advantage, compared with previous work.

关键词： RFID authentication yoking-proof provable security

来源：评论

学校读者我要写书评

暂无评论

PacketSkip: Skip Graph for Multidimensional Search in Structured Peer-to-Peer Systems 11

PacketSkip: Skip Graph for Multidimensional Search in Struct...

引用

11th IEEE international conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Disterhoeft, Andreas Funke, Andreas Graffi, Kalman Heinrich Heine Univ Dusseldorf Technol Social Networks Univ Str 1 D-40225 Dusseldorf Germany

ISBN: (纸本)9781509065554

(T)he Internet is ubiquitous and nodes participating in it are becoming increasingly diverse and heterogeneous. Especially is this true in decentralized, overlay-based networks, which traditionally build upon the infrastructure of the Internet. An ability to search for nodes with specific capabilities becomes of growing interest, for example, to support the node capacity discovery in large scale, distributed networks, such as in peer-to-peer systems. With PacketSkip, we propose a distributed, ordered, multidimensional indexing structure based on a Skip Graph, which operates on top of popular distributed hash tables. Its purpose is to offer, among other functions, capacity-based, high dimensional range searches for peers and their dynamic capacities. PacketSkip provides a very high search performance, also in comparison to other approaches, as well as low update and maintenance costs. Evaluations show that update and search durations arc low and well scalable. Even in dynamic systems, its inner graph structure remains robust and stable.

关键词： Peer-to-peer computing Bandwidth Indexing Robustness Protocols

来源：评论

学校读者我要写书评

暂无评论

Xor-overlay Topology Management Beyond Kademlia 11

Xor-overlay Topology Management Beyond Kademlia

引用

11th IEEE international conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Lavoie, Erick Hendren, Laurie Correia, Miguel McGill Univ Montreal PQ Canada Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal

ISBN: (纸本)9781509065554

Kademlia is a widely successful distributed Hash Table (ma) implementation, better known for its use in the BitTorrent protocol. In this paper, we revisit its overlay management separately from the MIT operations to allow it to be used with other distributed abstractions by providing an accurate and consistent view of the k-closest nodes to any given identifier. We then present invariants that avoid the irregularities that are necessary with the original k-bucket design and improve on later published solutions by not needing an additional parameter to tune. We then provide a specification of a distributed abstraction that provides the automatic management of routing tables using our invariants and a pseudo code implementation of that abstraction. We finally sketch how our abstraction may be used for a security mechanism and how it could be combined with other known distributed abstractions to provide other services than life sharing in xor-based overlay networks enabling xor-based network overlays to go beyond their original Kademlia design.

关键词： Peer-to-peer computing Routing Topology Protocols Overlay networks Electronic mail Security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 92 93 94 95 96 97 98 99 100 101 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：