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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

204 篇 会议
4 册 图书
2 篇 期刊文献

馆藏范围

210 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

147 篇 工学
- 122 篇 计算机科学与技术...
- 69 篇 软件工程
- 41 篇 信息与通信工程
- 22 篇 电气工程
- 8 篇 控制科学与工程
- 5 篇 动力工程及工程热...
- 5 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 4 篇 土木工程
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
22 篇 管理学
- 19 篇 管理科学与工程(可...
- 12 篇 工商管理
- 5 篇 图书情报与档案管...
21 篇 理学
- 14 篇 数学
- 5 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 大气科学
- 2 篇 系统科学
6 篇 法学
- 3 篇 法学
- 3 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
- 3 篇 公共卫生与预防医...
2 篇 农学

主题

27 篇 cloud computing
16 篇 mobile computing
11 篇 internet
10 篇 distributed comp...
9 篇 social networkin...
9 篇 peer-to-peer com...
8 篇 routing
8 篇 wireless sensor ...
8 篇 protocols
7 篇 software enginee...
6 篇 artificial intel...
6 篇 distributed data...
5 篇 fault tolerance
5 篇 computer archite...
5 篇 smart phones
5 篇 security
5 篇 mobile communica...
4 篇 peer to peer com...
4 篇 grid computing
4 篇 resource managem...

机构

3 篇 department of in...
3 篇 univ fed paraiba...
3 篇 beijing jiaotong...
2 篇 inria
2 篇 rhein westfal th...
2 篇 department of co...
2 篇 parallel and dis...
2 篇 parallel wireles...
2 篇 univ minnesota d...
2 篇 freelance kanaga...
2 篇 faculty of elect...
2 篇 department of co...
2 篇 amrita vishwa vi...
2 篇 univ stuttgart i...
1 篇 anna university ...
1 篇 king abdulaziz u...
1 篇 sprint
1 篇 department of co...
1 篇 techno internati...
1 篇 department of co...

作者

3 篇 teruhisa hochin
3 篇 shen hong
2 篇 jin miao
2 篇 duerr frank
2 篇 shigeaki tanimot...
2 篇 zhou hongyu
2 篇 hiroki nomiya
2 篇 mostefaoui achou...
2 篇 motoi iwashita
2 篇 raynal michel
2 篇 mokbel mohamed f...
2 篇 li yidong
2 篇 sattler kai-uwe
2 篇 hiep hoang-van
2 篇 chen chao-chun
2 篇 henze martin
2 篇 iwashita motoi
2 篇 ziegeldorf jan h...
2 篇 wu hongyi
2 篇 chuang kun-ta

语言

209 篇 英文
1 篇 其他

检索条件"任意字段=14th International Conference on Distributed Computing and Networking, ICDCN 2013"

共 210 条记录，以下是51-60 订阅

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

详细简洁

排序：

On the analysis of a label propagation algorithm for community detection

On the analysis of a label propagation algorithm for communi...

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Kothapalli, Kishore Pemmaraju, Sriram V. Sardeshmukh, Vivek International Institute of Information Technology Hyderabad 500 032 India Department of Computer Science University of Iowa Iowa City IA 52242-1419 United States

ISBN: (纸本)9783642356674

this paper initiates formal analysis of a simple, distributed algorithm for community detection on networks. We analyze an algorithm that we call Max-LPA, both in terms of its convergence time and in terms of the "quality" of the communities detected. Max-LPA is an instance of a class of community detection algorithms called label propagation algorithms. As far as we know, most analysis of label propagation algorithms thus far has been empirical in nature and in this paper we seek a theoretical understanding of label propagation algorithms. In our main result, we define a clustered version of Erdös-Rényi random graphs with clusters V1, V 2, . . . , Vk where the probability p′, of an edge connecting nodes within a cluster Vi is higher than p′, the probability of an edge connecting nodes in distinct clusters. We show that even with fairly general restrictions on p and p′ (p = Ω (1/n 1/4-Ω) for any Ε > 0, p′ = O (p2), where n is the number of nodes), MAX-LPA detects the clusters V1, V2, . . . , Vn in just two rounds. Based on this and on empirical results, we conjecture that Max-LPA can correctly and quickly identify communities on clustered Erdös-Rényi graphs even when the clusters are much sparser, i.e., with p = c log n/n for some c > 1. © Springer-Verlag 2013.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing 1

引用

丛书名： Studies in Computational Intelligence

1000年

作者： Roger Lee

ISBN: (数字)9783319007380

ISBN: (纸本)9783319007373;9783319032726

this edited book presents scientific results of the 14th ACIS/IEEE international conference on Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing (SNPD 2013), held in Honolulu, Hawaii, USA on July 1-3, 2013. the aim of this conference was to bring together scientists, engineers, computer users, and students to share their experiences and exchange new ideas, research results about all aspects (theory, applications and tools) of computer and information science, and to discuss the practical challenges encountered along the way and the solutions adopted to solve them. the conference organizers selected the 17 outstanding papers from those papers accepted for presentation at the conference.

关键词： Computational Intelligence Artificial Intelligence Software Engineering

来源：评论

学校读者我要写书评

暂无评论

Gait Optimization for Multiple Humanoid Robots Based on Parallel Multi-swarm Particle Swarm Algorithm 2017

Gait Optimization for Multiple Humanoid Robots Based on Para...

引用

14th EAI international conference on Mobile and Ubiquitous Systems - computing, networking and Services (MobiQuitous)

作者： Li, Chunguang He, Rongyi Yao, Lina Tao, Chongben Changzhou Inst Technol Sch Comp & Informat Engn Changzhou Jiangsu Peoples R China Hohai Univ Sch Comp & Informat Inst Intelligence Sci & Technol Nanjing Jiangsu Peoples R China Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia Suzhou Univ Sci & Technol Sch Elect & Informat Engn Suzhou Jiangsu Peoples R China

ISBN: (纸本)9781450353687

In the RoboCup 3D simulation competition, how to find a flexible and stable gait pattern is one of the keys to win the match. To achieve such walking gait, a machine learning method of optimizing the vertical Center of Mass(CoM) trajectory is presented. the vertical CoM trajectory is planned by multiple polynomial function. Inverted Pendulum Model(IPM) and a numerical method are utilized to control the Zero Moment Point(ZMP). then the key parameters are extracted from the gait pattern, a distributed multi-robot training environment based on RoboCup 3D simulated platform is constructed, and the parallel multi-swarm particle swarm algorithm is applied to optimize the parameters. the results of experiment and competition demonstrate that the effectiveness of the proposed method.

关键词： humaniod robot multi-swarm Particle Swarm Optimization gait optimization distributed system RoboCup

来源：评论

学校读者我要写书评

暂无评论

Maximal antichain lattice algorithms for distributed computations

Maximal antichain lattice algorithms for distributed computa...

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642356674

the lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct and enumerate the lattice of maximal antichains. Previously known algorithm by Nourine and Raynoud [NR99, NR02] to construct the lattice takes O (n2m) time where n is the number of events in the computation, and m is the size of the lattice of maximal antichains. the algorithm by Jourdan, Rampon and Jard [JRJ94] takes O ((n + w2)wm) time where w is the width of the computation. All these algorithms assume as input the lattice of maximal antichains prior to the arrival of a new event. We present a new online incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. the OLMA algorithm takes O (mw2 log w L) time and O (wL w log n) space where wL is the width of the lattice of maximal antichains. the lower space complexity makes our algorithm applicable for online global predicate detection in a distributed system. For the purposes of analyzing offline traces, we also propose new enumeration algorithms to traverse the lattice. © Springer-Verlag 2013.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A Framework for Automated Software Testing on the Cloud 14

A Framework for Automated Software Testing on the Cloud

引用

14th international conference on Parallel and distributed computing, Applications and Technologies (PDCAT)

作者： de Oliveira, Gustavo Savio Duarte, Alexandre Univ Fed Paraiba Informat Ctr BR-58059900 Joao Pessoa Paraiba Brazil

ISBN: (纸本)9781479924189

this work presents the framework CloudTesting, a solution to parallelize the execution of a test suite over a distributed cloud infrastructure. the use of a cloud as runtime environment for automated software testing provides a more efficient and effective solution when compared to traditional methods regarding the exploration of diversity and heterogeneity for testing coverage. the objective of this work is evaluate our solution regarding the performance gains achieved with the use of the framework showing that it is possible to improve the software testing process with very little configuration overhead and low costs.

关键词： software testing cloud computing

来源：评论

学校读者我要写书评

暂无评论

Intelligent healthcare computing and networking

Intelligent healthcare computing and networking

引用

2012 IEEE 14th international conference on e-Health networking, Applications and Services, Healthcom 2012

作者： Hasan, Masum Z. Cisco Systems 170 West Tasman Drive San Jose CA 95134 United States

ISBN: (纸本)9781457720390

there is need for providing proper quality of service (QoS) and security to healthcare traffic in the network in a healthcare environment. In addition, there is need for global visibility of healthcare related communications or transactions between various entities (applications, information systems and devices). there are three major factors that make this challenging: 1) healthcare network traffic is shared by other non-healthcare traffic, 2) there are plethora of healthcare information systems, devices and modalities with respective plethora of protocols and message formats, 3) healthcare network with its wide varieties of information systems, devices and modalities may be widely distributed (across various departments and wide-area network segments). To provide proper QoS and security in the midst of these challenges we bring healthcare application protocol and message related intelligence in the network, thus creating a logical overlay network (we call IHON: Intelligent Healthcare Overlay Network). © 2012 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Virtual tree: A robust overlay network for ensuring interval valid queries in dynamic distributed systems

Virtual tree: A robust overlay network for ensuring interval...

引用

13th international conference on distributed computing and networking, icdcn 2012

作者： Baldoni, Roberto Bonomi, Silvia Cerocchi, Adriano Querzoni, Leonardo Sapienza Università di Roma Via Ariosto 25 00185 Roma Italy

ISBN: (纸本)9783642259586

Today's large scale distributed systems are characterized by strong dynamics caused by the inherent unreliability of their constituting elements (e.g. process and link failures, processes joining or leaving the system). this continuous dynamism has a strong negative impact on distributed algorithms designed to work on such systems. Regular registers [1], Replication [2], in-network aggregation[3], are all examples of such problem. © 2012 Springer-Verlag.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

引用

14th international conference on Emerging networking EXperiments and Technologies (CoNEXT)

作者： Li, Hangyu Xu, Hong Nutanong, Sarana City Univ Hong Kong Hong Kong Peoples R China Vidyasirimedhi Inst Sci & Technol Wangchan Thailand

ISBN: (纸本)9781450360807

We propose Bohr, a similarity aware geo-distributed data analytics system that minimizes query completion time. the key idea is to exploit similarity between data in different data centers (DCs), and transfer similar data from the bottleneck DC to other sites with more WAN bandwidth. though these sites have more input data to process, these data are more similar and can be more effciently aggregated by the combiner to reduce the intermediate data that needs to be shuffled across the WAN. thus our similarity aware approach reduces the shuffle time and in turn the query completion time (QCT). We design Bohr based on OLAP data cubes to perform efficient similarity checking among datasets in different sites. We implement Bohr on Spark and deploy it across ten sites of AWS EC2. Our extensive evaluation using realistic query workloads shows that Bohr improves the QCT by up to 50% and reduces the intermediate data by up to 6x compared to state-of-the-art solutions that also use OLAP cubes.

关键词： Data Analytics Cloud computing WAN

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 14th IEEE/ACM international conference on Utility and Cloud computing, UCC 2021

Proceedings of the 14th IEEE/ACM International Conference on...

引用

14th IEEE/ACM international conference on Utility and Cloud computing, UCC 2021

ISBN: (纸本)9781450385640

the proceedings contain 21 papers. the topics discussed include: game-theoretic modeling of DDoS attacks in cloud computing;distributed federated service chaining for heterogeneous network environments;system-aware dynamic partitioning for batch and streaming workloads;automated detection of design patterns in declarative deployment models;exploring the cost and performance benefits of AWS step functions using a data processing pipeline;multi-cloud serverless function composition;apollo: towards an efficient distributed orchestration of serverless function compositions in the cloud-edge continuum;courier: delivering serverless functions within heterogeneous FaaS deployments;accord: application-driven networking in the datacenter;QoS-aware 5G component selection for content delivery in multi-access edge computing;and enforcing deployment latency SLA in edge infrastructures through multi-objective genetic scheduler.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Real-Time Network Monitoring: A Big Data Approach 14

Real-Time Network Monitoring: A Big Data Approach

引用

14th international conference on computing Communication and networking Technologies, ICCCNT 2023

作者： Jaswanth, Kunisetty Sruthi, S. Ramachandrula, Pranav Saravanan, S. Amrita School of Computing Dept. of Computer Science Engineering Bengaluru India Amrita School of Computing Dept. of Computer Science Engineering Chennai India

ISBN: (纸本)9798350335095

Real-time network monitoring is a critical requirement for tracking user activities and ensuring optimal network performance. In this paper, we propose a big data approach to real-time network monitoring that leverages the capabilities of Apache Spark, MongoDB, and Apache Kafka with Python. Our approach utilizes distributed stream processing of network data, enabling real-time analytics for user activity monitoring and network performance optimization. Our approach demonstrates the effectiveness of our system through experiments with real network traffic data, showing how it can identify and track user activities in real-time. Our system can be used by network administrators and IT professionals to optimize network performance, improve user experience, and enhance security through real-time monitoring and analysis of user activity data. this approach can also be opted as a feature in SDNs. © 2023 IEEE.

关键词： Network performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：