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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,032 篇 会议
19 册 图书
8 篇 期刊文献

馆藏范围

1,059 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

626 篇 工学
- 576 篇 计算机科学与技术...
- 291 篇 软件工程
- 229 篇 电气工程
- 225 篇 信息与通信工程
- 80 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 38 篇 动力工程及工程热...
- 37 篇 网络空间安全
- 36 篇 交通运输工程
- 36 篇 安全科学与工程
- 17 篇 电子科学与技术（可...
- 12 篇 机械工程
- 11 篇 生物工程
- 7 篇 建筑学
- 7 篇 环境科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
122 篇 理学
- 62 篇 数学
- 36 篇 化学
- 13 篇 系统科学
- 12 篇 生物学
- 10 篇 统计学（可授理学、...
- 6 篇 物理学
111 篇 管理学
- 81 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 34 篇 工商管理
8 篇 经济学
- 8 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
3 篇 法学
- 3 篇 社会学
1 篇 军事学

主题

121 篇 distributed comp...
73 篇 computer science
57 篇 protocols
56 篇 distributed comp...
55 篇 cloud computing
53 篇 mobile computing
49 篇 middleware
47 篇 computer archite...
46 篇 costs
42 篇 scalability
41 篇 application soft...
41 篇 computer network...
40 篇 computational mo...
39 篇 intelligent netw...
38 篇 bandwidth
36 篇 real time system...
35 篇 peer to peer com...
33 篇 monitoring
31 篇 network servers
31 篇 internet

机构

4 篇 university of st...
4 篇 school of scienc...
3 篇 college of compu...
3 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 school of comput...
3 篇 brown univ dept ...
3 篇 dept. of cs geor...
3 篇 department of el...
3 篇 univ chicago il ...
3 篇 nppd tehran
3 篇 georgia institut...
3 篇 institute of com...
3 篇 natl univ def te...
3 篇 distributed syst...
2 篇 department of co...
2 篇 school of comput...
2 篇 univ nevada dept...
2 篇 department of co...
2 篇 the chinese univ...

作者

5 篇 yi pan
4 篇 uwe breitenbüche...
4 篇 frank leymann
3 篇 y. shibata
3 篇 jianhua sun
3 篇 dustdar schahram
3 篇 nong xiao
3 篇 hai jin
3 篇 takizawa hiroyuk...
3 篇 jiannong cao
2 篇 j.a. stankovic
2 篇 posdorfer wolf
2 篇 miremadi seyed g...
2 篇 datskova olga
2 篇 m. ito
2 篇 garcia jordi
2 篇 li j
2 篇 jukan admela
2 篇 souissi samia
2 篇 cheng yijun

语言

1,059 篇 英文

检索条件"任意字段=23rd International Conference on Distributed Computing Systems Workshops"

共 1059 条记录，以下是321-330 订阅

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

详细简洁

排序：

Voltage Regulation in Resonant Coupled systems for Near Field Power Transfer

Voltage Regulation in Resonant Coupled Systems for Near Fiel...

引用

23rd international conference on systems Engineering

作者： Ramachandran, Hema Bindu, G. R. Govt Coll Engn Dept Elect Engn Thiruvananthapuram Kerala India

ISBN: (纸本)9783319084213

A resonant coupled wireless power transfer system modeled using inherent distributed capacitances and external capacitances is powered using the near evanescent electromagnetic field. The equivalent receiver circuit is generated to study the effects of loading. Voltage regulation phasor diagrams representing varying load conditions for resistive, inductive and capacitive are studied and power factor correction methods for maintaining fine tuning between the source and receiver coils are proposed for inductive and capacitive loads. Experimental verification is performed on a light resistive load of 60 W, attaining a maximum efficiency of 15.73 %. © Springer international Publishing Switzerland 2015.

关键词： near field power transfer, evanescent wave coupling, high frequency transformer model, voltage regulation

来源：评论

学校读者我要写书评

暂无评论

Context awareness for e-Tourism: An adaptive mobile application 23

Context awareness for e-Tourism: An adaptive mobile applicat...

引用

23rd international conference on distributed Multimedia systems, Visual Languages and Sentient systems, DMSVLSS 2017

作者： Colace, Francesco Lemma, Saverio Lombardi, Marco Italy Italy

ISBN: (纸本)189170642X

The Italian towns have a cultural heritage that often do not succeed in being completely enhanced. The natural, artistic and cultural resources present in the Italian towns, above all the smallest ones, many times remain hidden and are not enjoyed by the tourists. In this paper, it is introduced an Adaptive Context Aware app able to support a tourist inside a town. The system can guide the tourist in the discovery of a town proposing him/her resources and services mainly interesting for the user according to his/her interests and the position where he/she is. The objective is reached through the use of a system of description of the context through a graphical formalism named Context Dimension Tree. The App collects information also from social environments adapting the proposed itinerary taking into account the communities and the interests of the user. The entire approach has been tested inside the town of Salerno with very interesting results.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

A Multiple-Blockchains based Service Monitoring Framework in Edge-Cloud computing 23

A Multiple-Blockchains based Service Monitoring Framework in...

引用

23rd IEEE international conference on High Performance computing and Communications, 7th IEEE international conference on Data Science and systems, 19th IEEE international conference on Smart City and 7th IEEE international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Fu, Hang Wang, Puwei Li, Haoran Zhan, Ying Chen, Jinchuan Du, Xiaoyong Guizhou University of Finance and Economics Guiyang City550025 China School of Information Renmin University of China China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing100872 China

ISBN: (纸本)9781665494571

In the edge-cloud computing, the applications usually are delivered as services, each of which runs independently and can cooperate to construct the complicated applications. However, it is difficult to monitor the services in the decentralized edge-cloud environment since there usually does not exist the central authorization to guarantee trustiness of the service quality data collected. To address the trust issue, the blockchain techniques have been introduced to the service monitoring. Considering the services usually are distributed on the edge nodes, if we deploy only a blockchain on the edge nodes near to the services, it may have to support both the service registration and monitoring because of the loose-coupling principle. That would influence the performance, even would crash the edge nodes. In this paper, we propose a multiple-blockchains based framework, including a registration blockchain that focuses on the service registration and discovery, and a set of monitoring blockchains that focus on the service invocation and monitoring. The registration blockchain is deployed on the cloud nodes, and the monitoring blockchains are deployed on the edge nodes near to the services for collecting efficiently and precisely the service quality data. Based on the cross-chain technology, we design a cross-chain service discovery between the monitoring blockchain and the registration blockchain for finding the services the requesters need. Finally, we implement the registration and monitoring blockchains based on the blockchain platform Cosmos and conduct a set of experiments to show the effectiveness of the proposed framework. © 2021 IEEE.

关键词： Authorization Cloud computing Smart cities Computer crashes Blockchains Monitoring

来源：评论

学校读者我要写书评

暂无评论

AutoMJ: Towards Efficient Multi-way Join Query on distributed Data-parallel Platform 23

AutoMJ: Towards Efficient Multi-way Join Query on Distribute...

引用

23rd IEEE international conference on Parallel and distributed systems (ICPADS)

作者： Zhu, Guanghui Wu, Xiaoqi Gu, Rong Yuan, Chunfeng Huang, Yihua Nanjing Univ Natl Key Lab Novel Software Technol Collaborat Innovat Ctr Novel Software Technol & I Nanjing 210023 Jiangsu Peoples R China

ISBN: (纸本)9781538621295

The multi-way join query has attracted considerable attention from research community for its importance in many big data analytic applications. For the multi-round multi-way join algorithm in distributed data-parallel platforms, the huge communication cost caused by shuffling large intermediate results over the network is the main bottleneck. The one-round multi-way join algorithm processes the join query in a single communication round, which can significantly reduce the communication cost in complex queries, including cyclic queries. However, the one-round method is not always superior to the multi-round method, because the intermediate result size of the multi-round method may the much smaller than the size of data shuffled in the one-round method. Therefore, it is challenging to choose the best multi-way join algorithm in practice. To solve this problem, in this paper, we present AutoMJ, an efficient framework for multi-way join queries. In AutoMJ, we propose a novel automatic join strategy selection model based on the size estimation of intermediate join results. AutoMJ chooses the multi-way join strategy with the minimal shuffle data size. In addition, we propose an optimized HyperCube algorithm for the one-round multi-way join. We have implemented the prototype of AutoMJ on the widely-used distributed data-parallel platform Apache Spark. Experiments show that for multi-way join queries with large intermediate results, the one-round join strategy can outperform the multi-round join strategy built in Spark SQL 1.2-159.3x faster. In contrast, the multi-round join strategy is 2.1-6.2 x faster than the one-round method for the queries with small intermediate results. Experiments also show that the relative error of size estimation can be within 0.1 for the Twitter dataset and 0.25 for the Wikidata dataset. Furthermore, experiments verify that the automatic join strategy selection model is effective for choosing the optimal multi-way join algorithm.

关键词： multi-way join HyperCube shuffle distributed computing join size estimation Apache Spark

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing failure detector algorithms

Self-stabilizing failure detector algorithms

引用

IASTED international conference on Parallel and distributed computing and Networks, as part of the 23rd IASTED international Multi-conference on Applied Informatics

作者： Hutle, Martin Widder, Josef TU Wien Embedded Computing Systems Group 182/2 Treitlstraße 3/2 A-1040 Wien Austria

This paper revisits the interconnection of self-stabilization and fault-tolerance. Self-stabilizing algorithms are able to recover from arbitrary system states given that from some point in time on, there are no faults. Fault-tolerance, on the other hand, refers to algorithms that cope with systems where a (bounded) part of the system (e.g. at most f out of n processes) may fail permanently. In previous work [16] we considered the interconnection of these two paradigms, i.e., algorithms that recover from arbitrary states despite of permanent faults. We have shown that in certain settings, problems as failure detection cannot be solved. This paper presents ways to circumvent this impossibility result.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

ICAC 2017 - 2017 23rd IEEE international conference on Automation and computing: Addressing Global Challenges through Automation and computing

ICAC 2017 - 2017 23rd IEEE International Conference on Autom...

引用

23rd IEEE international conference on Automation and computing, ICAC 2017

ISBN: (纸本)9780701702618

The proceedings contain 128 papers. The topics discussed include: event-triggered variance-constrained finite-horizon state estimation for discrete-time systems with redundant channels;distributed sampled-data Hinf state estimation for sensor networks with nonuniform samplings;novel models for the extension pneumatic muscle actuator performances;a clustering approach to triage categorization in A&E departments;recursive filtering for two-dimensional systems with missing measurements subject to uncertain probabilities;a dynamic deformation based lubrication model between the piston rings and cylinder liner;effects of abrasive grit shape on grinding performance;neural learning and Kalman filtering enhanced teaching by demonstration for a Baxter robot;indoor object recognition using pre-trained convolutional neural network;analysis of the sitting posture comfort based on motion capture system and jack software;digital image classification and detection using a 2D-NARX model;the identification of shaft current induced defects on rolling bearings in wind turbine generators;early detection of rolling bearing faults using an auto-correlated envelope ensemble average;planetary gear fault diagnosis based on instantaneous angular speed analysis;effective task migration to reduce execution time in mobile cloud computing;a noncontact-sensor surveillance system towards assisting independent living for older people;nonlinear dynamic predictive model selection and interference using information criteria;and token passing techniques to support real time communications on WTPN used for industrial control applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Shutdown Policies with Power Capping for Large Scale computing systems 23rd

Shutdown Policies with Power Capping for Large Scale Computi...

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Benoit, Anne Lefevre, Laurent Orgerie, Anne-Cecile Rais, Issam Univ Claude Bernard Lyon 1 Univ Lyon INRIA CNRSENS LyonLIP Lyon France IRISA CNRS Rennes France

ISBN: (纸本)9783319642031;9783319642024

Large scale distributed systems are expected to consume huge amounts of energy. To solve this issue, shutdown policies constitute an appealing approach able to dynamically adapt the resource set to the actual workload. However, multiple constraints have to be taken into account for such policies to be applied on real infrastructures, in particular the time and energy cost of shutting down and waking up nodes, and power capping to avoid disruption of the system. In this paper, we propose models translating these various constraints into different shutdown policies that can be combined. Our models are validated through simulations on real workload traces and power measurements on real testb eds.

关键词： Large scale distributed systems Energy models Shutdown policies Simulations

来源：评论

学校读者我要写书评

暂无评论

An optimal early stopping uniform consensus protocol in synchronous distributed systems with orderly crash failures

An optimal early stopping uniform consensus protocol in sync...

引用

international conference on distributed computing systems Workshop

作者： Xianbing Wang Jiannong Cao Internet and Mobile Computing Laboratory Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China Computer Center School of Computer Wuhan University of China Wuhan Hubei China

ISBN: (纸本)0769519210

Most existing consensus protocols for synchronous distributed systems are designed to tolerate crash failures of processes. It has been proved that there is no n-process stopping consensus protocol for synchronous distributed systems that tolerates up to t crash failures, in which all non-faulty processes always decide by the end of round t, where t

关键词： Protocols Computer crashes distributed computing Internet Mobile computing Clocks

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of the globus toolkit monitoring and discovery service, MDS2

Performance analysis of the globus toolkit monitoring and di...

引用

23rd IEEE international Performance, computing, and Communications conference, conference Proceedings, IPCCC 2004

作者： Zhang, Xuehai Schopf, Jennifer M. Department of Computer Science University of Chicago Mathematic Division Argonne National Laboratory

Monitoring and information services form a key component of a distributed system, or Grid. A quantitative study of such services can aid in understanding the performance limitations, advise in the deployment of the monitoring system, and help evaluate future development work To this end, we examined the performance of the Globus Toolkit® Monitoring and Discovery Service (MDS2) by instrumenting its main services using NetLogger. Our study shows a strong advantage to caching or prefetching the data, as well as the need to have primary components at well-connected sites.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A weighted fat-tree routing algorithm for efficient load-balancing in InfiniBand enterprise clusters 23

A <i>weighted</i> fat-tree routing algorithm for efficient l...

引用

23rd Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Zahid, Feroz Gran, Ernst Gunnar Bogdanski, Bartosz Johnsen, Bjorn Dag Skeie, Tor Simula Res Lab Fornebu Norway Oracle Corp Redwood City CA USA Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9781479984909

InfiniBand (IB) has become a popular network interconnect for high-performance computing (HPC) systems. Many of the large IB-based HPC systems use some variant of the fat-tree topology to take advantage of the useful properties fat-trees offer. The fat-tree routing algorithm is one of the most efficient deterministic routing algorithms for fat-tree topologies. The algorithm ensures that the number of routes assigned to each link are balanced across the fabric. However, one problem with its load-balancing technique is that it assumes uniform traffic distribution in the network. When routes towards nodes that mainly consume large amount of data are assigned to share links in the fabric while alternative links are underutilized, sub-optimal network throughput is obtained. Also, as the fat-tree algorithm routes nodes according to the indexing order, the performance may differ for two systems cabled in the exact same way. In this paper, we propose wFatTree, a novel fat-tree routing algorithm, which considers node traffic characteristics to balance load across the network links more evenly, and with predictable network performance. Our experiments and simulations show an improvement of up to 60% in total network throughput on large fat-tree installations when using wFatTree routing. Furthermore, wFatTree can also be used to prioritize traffic flowing towards the critical nodes in the network.

关键词： Infini Band fat-trees interconnection networks load-balancing routing algorithms Load balancing Routing algorithms Interconnection networks Network throughput Ganglia Traffic distribution number of routes High Performance computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共106页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：