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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Problems in models of opening networks resources and methods for calculating system performance and reliability 18

Problems in models of opening networks resources and methods...

引用

18th international conference on Control, Automation and Systems, ICCAS 2018

作者： Gulnara, Bektemyssova Ahmad, Abdul Rahim Bin Ismail, Roslan Computer Engineering and Telecommunications International Information Technologies University Almaty050040 Kazakhstan Department of Systems and Networking Universiti Tenaga Nasional Selangor43000 Malaysia

ISBN: (纸本)9788993215151

The purpose of this paper is to identify a problem in Grid resource discovery models that affect the overall performance of grid computing. Since, Grid resources are scattered in different geographical locations on heterogeneous platforms and within various administrative policies. Finding resources in grid computing is an actual and complex task. The paper identifies some problems in the Grid resource discovery models. In addition, deals with the application of the mathematical apparatus to calculate the reliability and performance of GRID systems and application of a permanent matrix for calculating the reliability of distributed computing systems based on GRID. © ICROS.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Energy saving and Collision-free Motion Planning for Oblivious Robots 32

Energy saving and Collision-free Motion Planning for Oblivio...

引用

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

作者： Navarra, Alfredo Cacciagrano, Diletta Univ Perugia Dept Math & Comp Sci Via Vanvitelli 1 I-06123 Perugia Italy Univ Camerino Sch Sci & Technol Camerino Italy

ISBN: (纸本)9781538653951

In distributed computing, many tasks have been studied involving mobile entities - also called robots - with weak capabilities. A well-known scenario is that in which robots operate in Look-Compute-Move (LCM) cycles. During each cycle, a robot acquires a snapshot of the surrounding environment (Look phase), then executes an appropriate algorithm by using the obtained snapshot as input (Compute phase), and finally moves toward a desired destination, if any (Move phase). In this context, we consider robots that have to visit a partially ordered set of locations. A solution to the problem is the assignment to each robot of a trajectory to follow in order to visit the required locations. The resolution of the task is subject to two main constraints. Robots have to minimize the energy spent to accomplish an assigned trajectory, and they have to avoid collisions among each other. The minimization of the energy is expressed in terms of the number of turns a robot has to perform in between two different locations. This equals the number of bends the assigned trajectory contains in between such locations. In general, the problem is known to require Omega(n) bends per connection, with n being the number of locations, even if considering just two robots involved. We study the case where the locations that a single robot has to visit are represented as colored points in the Euclidean plane, and only two colors are provided. This means the partial order among the locations is just based on two colors per robot. In this case, we provide a constructive solution for two robots with five bends per connection.

关键词： distributed Algorithms Mobile Robots Trajectory Complexity Energy Minimization

来源：评论

学校读者我要写书评

暂无评论

A Data Flow Architecture for Smart City Applications 21

A Data Flow Architecture for Smart City Applications

引用

21st international conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)

作者： Gregoire, Jean-Charles INRS EMT Montreal PQ Canada

ISBN: (纸本)9781538634585

The smart city is often presented as the combination of sensor networks (IoT) with big data processing, but this largely ignores the issues of bridging these two universes, as well as the need to integrate other environments, which is typically swept aside as back end concerns. We present in this paper the challenges of integrating networks of sensor and actuator devices into a framework suitable for smart city applications, which includes various forms of efficient sharing and processing of information. We propose architectural elements for distributed implementations of gateways in a data flow architecture. We finally discuss how implementing this framework can benefit from contemporary hybrid networking/computing technology, such as SDN/NFV.

关键词： Sensor-Actuator Networks Smart Cities IoT Gateways Data Flow Paradigm distributed Implementation

来源：评论

学校读者我要写书评

暂无评论

A Double Non-Negative Matrix Factorization Model for Signed Network Analysis

A Double Non-Negative Matrix Factorization Model for Signed ...

引用

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

作者： Wei Yu Rongjian Mu Ying Sun Xue Chen Wenjun Wang Huaming Wu College of Intelligence and Computing Tianjin University Tianjin China Law School Tianjin University Tianjin China Center for Applied Mathematics Tianjin University Tianjin China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

As one of the most important characteristics of complex networks, community structure have been studied extensively in real cases. However, in signed networks that include both positive and negative edges, the development of community discovery is still limited now. Because the sign information on edges poses a challenge to modeling the signed network. Most existing methods are based on heuristics, so these methods tend to have high computational complexity and ignore the generation of the networks. Here, we propose a Double Non-negative Matrix Factorization (DouNMF) model from the perspective of generative model to detect communities in the signed network. This algorithm skillfully applies the Non-negative matrix Factorization algorithm to the signed network. In addition, the algorithm integrates indegree information into the process of matrix factorization. Large amounts of experiments on several artificial and real-world signed networks validate that the effectiveness and accuracy of our proposed approaches both in community discovery and link prediction.

关键词： Prediction algorithms Computational modeling Inference algorithms Matrix decomposition Optimization Approximation algorithms Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Finding Potential Empathizers in an Online Mental Health Community: A Deep Graph Embedding Approach

Finding Potential Empathizers in an Online Mental Health Com...

引用

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

作者： Yibo Chai Yahu Cong Rui Sun Fengyang Wu Zhongliang Zhang Yexing Wan Lixin Cui School of Information Central University of Finance and Economics Beijing China School of Finance Central University of Finance and Economics Beijing China School of Culture and Communication Central University of Finance and Economics Beijing China Shenzhen Corerain Technologies Co. Ltd Shenzhen China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Empathic support in online health communities (OHCs) can significantly help patients to feel less suffering and pain, fight against their diseases, and eventually recover. However, effective empathic communications in real-world OHCs are of low percentage. In this paper, we use recommendation techniques to match support-seeking posts with potential empathizers in a real-world online mental health community. Inspired by complex network analysis, we construct information-rich heterogenous network to model OHC. A graph embedding learning algorithm is devised to learn effective user profile embeddings from various information sources in heterogenous network, including node content feature, local neighborhood and sub-community structures. Compared with baseline methods, our approach achieves the best-performing recommendation results and fast computing speed.

关键词： Erbium 6G mobile communication Hafnium distributed processing Big Data Cloud computing Social computing

来源：评论

学校读者我要写书评

暂无评论

A Novel distributed Denial-of-Service Attack Detection Scheme for Software Defined networking Environments

A Novel Distributed Denial-of-Service Attack Detection Schem...

引用

IEEE international conference on Communications (ICC) / Workshop on Integrating UAVs into 5G

作者： Wu, Di Li, Jie Das, Sajal K. Wu, Jinsong Ji, Yusheng Li, Zhetao Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki Japan Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA Univ Chile Dept Elect Engn Santiago Chile Natl Inst Informat Informat Syst Architecture Res Div Tokyo Japan Xiangtan Univ Coll Informat Engn Xiangtan Peoples R China

ISBN: (纸本)9781538631805

Software-Defined networking (SDN), as a new paradigm, fixes the shortage that traditional network does not support the dynamic, scalable computing and storage needs of more computing environments. SDN, however, also faces security problems such as vulnerable to DDoS attacks. DDoS attacks are well-known and powerful attacks. DDoS detection and DDoS traffic separation for SDN environments are still an open research issue. DDoS attacks in SDN environments will not only bring damage to target server, but also takes exact impact on SDN system. In this paper, we identify a new type DDoS attack, specifically aiming SDN environment, which is harder to be detected. We propose a novel real-time DDoS detection scheme for SDN environment, by using Principal Component Analysis (PCA) scheme to analyze the network status on traffic packets data. We separate the network into different parts, to reduce the total calculation burden. We compare our scheme with sample entropy, showed our scheme achieves better detecting ability for DDoS attacks.

关键词： Computer crime Principal component analysis Control systems Entropy Eigenvalues and eigenfunctions Electronic mail Aerospace electronics"

来源：评论

学校读者我要写书评

暂无评论

Access Domain-Based Approach for Anomaly Detection and Resolution in XACML Policies 8th

Access Domain-Based Approach for Anomaly Detection and Resol...

引用

8th international conference on Innovations in Bio-Inspired computing and Applications (IBICA)

作者： El Hadj, Maryem Ait Benkaouz, Yahya Khoumsi, Ahmed Erradi, Mohammed Mohammed V Univ Rabat ENSIAS ITM Team Networking & Distributed Syst Res Grp Rabat Morocco Mohammed V Univ Rabat Concept & Syst Lab FSR Rabat Morocco Univ Sherbrooke Dept Elect & Comp Engn Sherbrooke PQ Canada

ISBN: (纸本)9783319763545;9783319763538

Access control protects systems' resources against unauthorized access via a set of policy rules. In distributed environments, access control policies might be aggregated from multiple tenants and could be managed by more than one administrator. Therefore, errors in the rules definitions may compromise the system security by leading to unauthorized access or denying authorized access. This may result into anomalies, i.e. conflicting rules and redundant rules. In this paper, we propose an approach to detect and resolve anomalies in XACML (eXtensible Access Control Markup Language) policies. We introduce the concept of a rule access domain, which is used to accurately identify and resolve policy anomalies.

关键词： XACML policies Clustering Anomaly detection Anomaly resolution Access domain

来源：评论

学校读者我要写书评

暂无评论

Lightweight distributed Attribute Based Keyword Search System for Internet of Things 1

引用

12th international conference on Security, Privacy, and Anonymity in Computation, Communication, and Storage, SpaCCS 2019

作者： Long, Jiahuan Zhang, Ke Wang, Xiaofen Dai, Hong-Ning School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China Science and Technology on Electronic Information Control Laboratory Chengdu610000 China Department of Information Technology Macau University of Science and Technology Macau China

ISBN: (数字)9783030249007

ISBN: (纸本)9783030248994

Internet of Things (IoT) is a promising networking paradigm that connects various kinds of sensors and exchanges data from smart devices. Since IoT always related to user’s daily life, the problems of security and privacy are of great importance. Presently, the attribute based encryption (ABE) is a popular solution to guarantee the fine-grained sharing of encrypted data in IoT. In this paper, an attribute based keyword search with lightweight decryption in multi-authority (ABKS-LD-MA) is proposed. Our system supports multi-keyword search in cloud by using searchable attribute based encryption. We also integrate the lightweight decryption to searchable ABE scheme that largely reduces the computing overhead for users. Furthermore, our ABKS-LD-MA scheme supports multi-authority scenario, which is more adaptive to the real IoT environment. The experiment analysis shows that our scheme has relatively lowered the communication cost on IoT devices. © 2019, Springer Nature Switzerland AG.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Memory-Based Load Balancing Algorithm in Structured Peer-to-Peer System 4th

Memory-Based Load Balancing Algorithm in Structured Peer-to-...

引用

4th international conference on Advanced computing, networking and Informatics (ICACNI)

作者： Raghu, G. Sharma, Neeraj K. Domanal, Shridhar G. Reddy, G. Ram Mohana Natl Inst Technol Karnataka Mangalore 575025 Karnataka India

ISBN: (纸本)9789811033735;9789811033728

There are several load balancing techniques which are popular used in Structured Peer-to-Peer (SPTP) systems to distribute the load among the systems. Most of the protocols are concentrating on load sharing in SPTP Systems that lead to the performance degeneration in terms of processing delay and processing time due to the lack of resources utilization. The proposed work is related to the sender-initiated load balancing algorithms which are based on the memory. Further to check the performance of the proposed load balancing algorithm, the experimental results carried out in the real-time environment with different type of network topologies in distributed environment. The proposed work performed better over existing load balancing algorithm such as Earliest Completion Load Balancing (ECLB) and First Come First Serve (FCFS) in terms of processing delay and execution time.

关键词： Structured Peer-to-Peer (SPTP) systems Load balancing Sender-initiated algorithm Network topologies distributed environment

来源：评论

学校读者我要写书评

暂无评论

Classification of Textual Data in distributed Environment 2

Classification of Textual Data in Distributed Environment

引用

2nd international conference on Advances in computing, Control and Communication Technology (IAC3T)

作者： Gupta, Sonali Kumar, Vidit Pant, Bhaskar Graph Era Deemed Univ Comp Sci & Engn Dehra Dun Uttarakhand India

ISBN: (纸本)9781538641460

Nowadays data is generating at a very fast pace through internet usage and other sources in large volumes termed as Big Data. A large portion of generated data is in text form collected through emails, blogs, social networking sites, e-commerce reviews etc. which requires deep analysis to extract meaningful patterns from it for applications such as business decision making, social media monitoring, spam detection etc. This results in incapability for processing and storing this data. So it must be handled or processed using parallel computing tools and machine learning algorithms. In this work, we have used Naive Bayes classifier to classify textual data in Hadoop environment using Mahout. This experiment is carried out by using 20 news group dataset and achieved accuracy with 88.38%. After evaluating results we have found that when we increase the number of Hadoop clusters, the processing speed on clusters increase as Apache Hadoop can process large volume of datasets efficiently using map-reduce paradigm.

关键词： Hadoop Big Data Mahout Machine learning Naive Bayes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 198 199 200 201 202 203 204 205 206 207 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：