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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

2,761 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,880 篇 工学
- 1,600 篇 计算机科学与技术...
- 778 篇 软件工程
- 500 篇 信息与通信工程
- 389 篇 电气工程
- 171 篇 控制科学与工程
- 67 篇 生物工程
- 61 篇 电子科学与技术（可...
- 48 篇 仪器科学与技术
- 46 篇 机械工程
- 41 篇 动力工程及工程热...
- 34 篇 安全科学与工程
- 31 篇 网络空间安全
- 27 篇 环境科学与工程（可...
- 25 篇 建筑学
- 22 篇 生物医学工程（可授...
- 20 篇 土木工程
- 19 篇 交通运输工程
365 篇 理学
- 221 篇 数学
- 80 篇 生物学
- 61 篇 物理学
- 50 篇 统计学（可授理学、...
- 40 篇 系统科学
307 篇 管理学
- 213 篇 管理科学与工程(可...
- 118 篇 图书情报与档案管...
- 96 篇 工商管理
43 篇 医学
- 28 篇 临床医学
- 26 篇 基础医学(可授医学...
- 18 篇 公共卫生与预防医...
40 篇 法学
- 28 篇 社会学
39 篇 经济学
- 39 篇 应用经济学
12 篇 农学
11 篇 教育学
9 篇 文学
3 篇 军事学

主题

239 篇 cloud computing
171 篇 distributed comp...
154 篇 social networkin...
80 篇 protocols
79 篇 computational mo...
76 篇 computer archite...
68 篇 servers
66 篇 mobile computing
57 篇 wireless sensor ...
53 篇 internet of thin...
53 篇 distributed data...
50 篇 resource managem...
49 篇 security
48 篇 computer network...
47 篇 distributed comp...
44 篇 peer to peer com...
43 篇 bandwidth
43 篇 mobile communica...
42 篇 edge computing
41 篇 grid computing

机构

36 篇 state key labora...
14 篇 saint petersburg...
11 篇 beijing univ pos...
9 篇 institute of com...
8 篇 beijing universi...
8 篇 lakhshya cyber s...
8 篇 amrita vishwa vi...
8 篇 lakhshya cyber s...
8 篇 tu wien distribu...
6 篇 center for compu...
6 篇 school of comput...
6 篇 plekhanov russia...
6 篇 institute of inf...
5 篇 department of ph...
5 篇 dept. of astrono...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 columbia astroph...
5 篇 iii. physikalisc...
5 篇 dept. of physics...

作者

11 篇 dustdar schahram
10 篇 yang yang
9 篇 soman k. p.
9 篇 vinayakumar r.
8 篇 bandyopadhyay su...
8 篇 bogdanov alexand...
8 篇 pradeep menon
8 篇 menon pradeep
7 篇 r vinayakumar
7 篇 zomaya albert y.
7 篇 kp soman
7 篇 korkhov vladimir
6 篇 calton pu
6 篇 jaekel arunita
6 篇 li jinglin
6 篇 degtyarev alexan...
6 篇 taheri javid
5 篇 huang tao
5 篇 haungs a.
5 篇 fürst p.

语言

2,702 篇 英文
32 篇 中文
28 篇 其他
4 篇 俄文

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

共 2762 条记录，以下是561-570 订阅

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

详细简洁

排序：

Medical Data Crawling Algorithm Based on PageRank 9th

Medical Data Crawling Algorithm Based on PageRank

引用

9th international conference on Computer Engineering and Networks, CENet2019

作者： Hao, Maojie Shu, Peng Zhai, Zhengan Zhu, Liang Yang, Yang Wang, Jianxin State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China State Grid Zhejiang Electric Power Research Institute Hangzhou China Satellite Communication Center Beijing China

ISBN: (纸本)9789811537523

In order to establish a database of characteristics related to physical conditions and then build a remote health intelligence-assisted diagnosis model based on the deep learning training mechanism, it is necessary to perform deep mining of medical data. In addition to the structured medical data stored in medical institutions, there are a large number of doctors and patients on the Internet about the interaction of the disease, and these are important sources of medical data. PageRank algorithm is an efficient link-based Web page sorting algorithm. this algorithm considers the Internet as a whole and uses links between pages as an important indicator. through the relationship between Web pages pointing to each other, the algorithm calculates the importance of the page. However, it also has some problems, such as the heavy emphasis on old Web pages, the theme drift, and so on. In this paper, based on the characteristics of medical data crawling, an improved PageRank algorithm based on PageRank is designed. the algorithm introduces time factors and potential correlation factors, and solves the problems of the original algorithm. Experiments show that the algorithm presented in this paper has good performance, both in terms of operating speed and accuracy. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Kollaps/thunderstorm: Reproducible Evaluation of distributed Systems Tutorial Paper 20th

Kollaps/Thunderstorm: Reproducible Evaluation of Distributed...

引用

20th IFIP WG 6.1 international conference on distributed Applications and Interoperable Systems (DAIS) Held as Part of the 15th international Federated conference on distributed computing Techniques (DisCoTec)

作者： Matos, Miguel Univ Lisbon Lisbon Portugal INESC ID Lisbon Portugal

ISBN: (纸本)9783030503222;9783030503239

Reproducing experimental results is nowadays seen as one of the greatest impairments for the progress of science in general and distributed systems in particular. this stems from the increasing complexity of the systems under study and the inherent complexity of capturing and controlling all variables that can potentially affect experimental results. We argue that this can only be addressed with a systematic approach to all the stages and aspects of the evaluation process, such as the environment in which the experiment is run, the configuration and software versions used, and the network characteristics among others. In this tutorial paper, we focus on the networking aspect, and discuss our ongoing research efforts and tools to contribute to a more systematic and reproducible evaluation of large scale distributed systems.

关键词： distributed Systems network characteristic Complex systems science in general large-scale systems

来源：评论

学校读者我要写书评

暂无评论

distributed Logging Service with distributed Hash Table for Cloud 1

引用

6th international conference on Internet of Vehicles and the 9th international Symposium on Cloud and Service computing, IOV/SC2 2019

作者： Kushida, Takayuki School of Computer Science Tokyo University of Technology Katakura Tokyo Hachouji192-0914 Japan

ISBN: (数字)9783030386511

ISBN: (纸本)9783030386504

the logging service on cloud is a critical component for administrators who maintain applications and solutions for end users. the service is usually a central server deployment to accept log messages from leaf computing nodes. Since several leaf computing nodes and their usages are dynamically changed for applications and solutions, the amount of generated log messages is also changed. this paper proposes the architecture and design for distributed Logging Service (DLS) which can distribute processing powers and storage resources to leaf computing nodes with distributed Hash Table (DHT). those nodes generate log messages and also have DLS components locally. the evaluation results with the emulated environment show the feasibility of DLS with the scalability. © 2020, Springer Nature Switzerland AG.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

PASSWORDLESS AUthENTICATION USING MAGIC LINK TECHNOLOGY 9

PASSWORDLESS AUTHENTICATION USING MAGIC LINK TECHNOLOGY

引用

9th international conference "distributed computing and Grid Technologies in Science and Education", GRID 2021

作者： Matiushin, Iurii Korkhov, Vladimir Saint Petersburg State University 7-9 Universitetskaya emb. Saint Petersburg199034 Russia

Nowadays, the problem of identification and authentication on the Internet is more urgent than ever. there are several reasons for this: on the one hand, there are many Internet services that keep records of users and differentiate their access rights to certain resources;on the other hand, cybercriminals' attacks on web services have become much more frequent lately. At the same time, in many cases, the weak point of systems exposed to attacks is precisely the authentication system. Authentication methods based on the knowledge factor (e. g. password protection) are the most common and are applied almost everywhere. their advantages are ease and low cost of implementation. On the other hand, such systems are often vulnerable to various kinds of attacks. It is estimated that up to 80% of successful hacker attacks (including attacks on the largest services with millions of users) succeeded precisely because of the weakness of the password protection system. this paper presents a solution to the problem of passwordless authentication, which can be applied in a number of online services and systems. In particular, we consider the magic link technology and present an authentication system implemented using Keycloak, an open-source software product that implements single sign-on technology. In the future, it is possible to further improve the system, in particular, using adaptive authentication, which allows switching between different authentication mechanisms depending on certain factors. © 2021 CEUR-WS. All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

IMpart: A Partitioning-based Parallel Approach to Accelerate Influence Maximization

IMpart: A Partitioning-based Parallel Approach to Accelerate...

引用

international conference on High Performance computing

作者： Reet Barik Marco Minutoli Mahantesh Halappanavar Ananth Kalyanaraman Washington State University Pullman WA Pacific Northwest National Laboratory Richland WA

Influence maximization (IM) is a fundamental operation among graph problems that involve simulating a stochastic diffusion process on real-world networks. Given a graph G(V, E), the objective is to identify a small set of key influential "seeds"— i.e., a fixed-size set of k nodes, which when influenced is likely to lead to the maximum number of nodes in the network getting influenced. the problem has numerous applications including (but not limited to) viral marketing in social networks, epidemic control in contact networks, and in finding influential proteins in molecular networks. Despite its importance, application of influence maximization at scale continues to pose significant challenges. While the problem is NP-hard, efficient approximation algorithms that use greedy hill climbing are used in practice. However those algorithms consume hours of multithreaded execution time even on modest-sized inputs with hundreds of thousands of nodes. In this paper, we present IMpart, a partitioning-based approach to accelerate greedy hill climbing based IM approaches on both shared and distributed memory computers. In particular, we present two parallel algorithms— one that uses graph partitioning (IMpart-metis) and another that uses community-aware partitioning (IMpart-gratis)— with provable guarantees on the quality of approximation. Experimental results show that our approaches are able to deliver two to three orders of magnitude speedup over a state-of-the-art multithreaded hill climbing implementation with negligible loss in quality. For instance, on one of the modest-sized inputs (Slashdot: 73K nodes; 905K edges), our partitioning-based shared memory implementation yields 4610× speedup, reducing the runtime from 9h 36m to 7 seconds on 128 threads. Furthermore, our distributed memory implementation enhances problem size reach to graph inputs with ×10 6 nodes and ×10 8 edges and enables sub-minute computation of IM solutions.

关键词： Proteins Privacy Runtime Social networking (online) Instruction sets Pipelines Memory management

来源：评论

学校读者我要写书评

暂无评论

Load balancing strategy for substation multi-service access edge computing terminal 9

Load balancing strategy for substation multi-service access ...

引用

9th IEEE Joint international Information Technology and Artificial Intelligence conference, ITAIC 2020

作者： Wang, Xuyan Xu, Han Chai, Ruijun Yan, Xin State Grid Jiangsu Power Co. Ltd. Nanjing Power Supply Branch China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology China

With the significant increase in the requirements for power applications in all links of the power network, a large number of sensor deployments and more complex multi-service access scenarios have been formed. In this scenario, there are problems such as a waste of resources caused by the complexity of the network structure and the inability to efficiently use multiple services in a coordinated manner. To this end, edge computing technology is introduced to achieve efficient collaborative processing of multiple services in substations. At the same time, because of the imbalance of intervention, this paper considers two aspects of traffic load and computing load, and proposes a load balancing strategy for substation multi-service access edge computing terminal based on improved differential evolution multi-objective algorithm. Comparing the method proposed in this paper with the benchmark method, we can see that the method in this paper has a significant improvement in both internal and external load balancing and average delay. © 2020 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

An Immuno-inspired distributed Artificial Classification System 1

引用

9th international conference on Soft computing for Problem Solving, SocProS 2019

作者： Semwal, Tushar Nair, Shivashankar B. Indian Institute of Technology Guwahati Guwahati781039 India

ISBN: (数字)9789811532900

ISBN: (纸本)9789811532894

With the advent of distributed systems such as the Internet of things (IoT), there has been a surge in the amount of data being generated by the computational nodes. Classification of these datasets remains a challenging problem, especially in distributed scenarios where the data is not situated within a single node. this paper describes a novel immuno-inspired distributed Artificial Classification System (iDACS) to solve this problem within a distributed network of nodes. It uses a combination of mechanisms from the Clonal Selection theory, the Immune Network theory, and the Danger theory, to realize a system that can solve the classification problem in a distributed manner. the results obtained from experiments performed on real networks when compared with five other standard classification models revealed that the proposed system was more suited to distributed scenarios. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Network Slice Access Selection Scheme for 5G Network Power Terminal Based on Grey Analytic Hierarchy Process 9th

Network Slice Access Selection Scheme for 5G Network Power T...

引用

9th international conference on Computer Engineering and Networks, CENet2019

作者： Zhang, Yake Jiao, Xiaobo Yang, Xin Yang, Erpeng Du, Jianpo Zi, Yueqi Yang, Yang Feng, Lei Xuchang Power Supply Company State Grid Henan Electric Power Company Xuchang China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9789811537523

the rapid development of 5G network meets more demands of the application of the Internet of things. In order to further optimize the resource utilization and QoS of the network, the 5G network introduces the network slice to meet the different needs of different users. Under this background, it is particularly important to research the guaranteed low-cost 5G network slice access selection strategy. In this paper, an access selection algorithm: grey analytic hierarchy process (GAHP) for 5G power network is proposed. the algorithm is based on the analytic hierarchy process, combined with network performance and user experience two kinds of indicators to select QoS parameters, combined with grey correlation method to screen the QoS parameters, and select the candidate networks. Simulation result shows that the proposed algorithm GAHP can quickly and accurately select the optimal network with a low cost. And it can improve the satisfaction of the users. © 2021, Springer Nature Singapore Pte Ltd.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

A Fractional Order Model for Rumor Spreading in Mobile Social Networks from A Stochastic Process

A Fractional Order Model for Rumor Spreading in Mobile Socia...

引用

international conference on Systems and Control (ICSC)

作者： Guojian Ren Yongguang Yu Zhenzhen Lu Wei Chen Beijing Jiaotong University Beijing China

ISBN: (纸本)9781665407830

In this manuscript, a fractional order model for rumor spreading in mobile social networks (MSNs) is derived from an underlying physical stochastic process, which can be regarded as a heterogeneous-network-based fractional order epidemic model. In the model, the fractional derivative appears because of the time for denying the rumor is power law distributed. then, the basic reproduction number R 0 depended on the fractional derivative order is calculated. If $R_distributed\lt 1$, the rumor-free equilibrium is global asymptotically stable, the rumors will disappear. If $R_distributed\gt 1$, the rumor-endemic equilibrium is local stable, then the rumors will become endemic. Further, the numerical simulation based on the Digg2009 data set demonstrate the effectiveness of the proposed model.

关键词： Epidemics Analytical models Social networking (online) Stochastic processes Numerical simulation Control systems Data models

来源：评论

学校读者我要写书评

暂无评论

Analyzing and Predicting the Allocation and Utilization of Resources in Cloud computing System 9

Analyzing and Predicting the Allocation and Utilization of R...

引用

9th international conference on Cloud computing, Data Science and Engineering (CONFLUENCE)

作者： Barnwal, Anil Pugla, Satyakam Jangade, Rajesh Amity Univ Noida India

ISBN: (纸本)9781538659335

the increasing use of cloud computing, constructed on good research in utility computing, networking, virtualization and web services provides some important benefits such as flexibility, cost reduction and easy availability for people using the system. these advantages are expected to increase the demand for more cloud services which further increase the installation of more clouds and its customer base. these demands lead to many technical issues such as applications of internet services, service oriented architecture including high scalability and availability, fault tolerance. So the core issue is to develop techniques for balancing of load effectively. It is clear from the fact that the measure and complexity makes these systems infeasible for assignment of centralized jobs to specific servers. So there is need of productive distributed solutions. In the current paper three proposed load balancing solutions for distributed environment is investigated. they are biased Random Sampling, Honeybee Foraging and Active Clustering.

关键词： Cloud computing Cloud Services SaaS PaaS IaaS Active Clustering Random Sampling Honeybee Foraging

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共277页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：