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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Data Partitioning Strategies for Stencil Computations on NUMA systems 1

引用

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

作者： Feinbube, Frank Plauth, Max Knaust, Marius Polze, Andreas Univ Potsdam Hasso Plattner Inst Software Syst Engn Operating Syst & Middleware Grp Potsdam Germany

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

Many scientific problems rely on the efficient execution of stencil computations, which are usually memory-bound. In this paper, stencils on two-dimensional data are executed on NUMA architectures. Each node of a NUMA system processes a distinct partition of the input data independent from other nodes. However, processors may need access to the memory of other nodes at the edges of the partitions. This paper demonstrates two techniques based on machine learning for identifying partitioning strategies that reduce the occurrence of remote memory access. One approach is generally applicable and is based on an uninformed search. The second approach caps the search space by employing geometric decomposition. The partitioning strategies obtained with these techniques are analyzed theoretically. Finally, an evaluation on a real NUMA machine is conducted, which demonstrates that the expected reduction of the remote memory accesses can be achieved.

关键词： NUMA Stencil computation Data partitioning

来源：评论

学校读者我要写书评

暂无评论

A generic HLA-based communication architecture for distributed virtual environments

A generic HLA-based communication architecture for distribut...

引用

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

作者： Ta, Duong Nguyen Binh Zhou, Suiping Shen, Haifeng School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

distributed Virtual Environments (DVEs) are distributed systems that allow multiple geographically distributed users to interact concurrently in a shared virtual world. With recent advances in computer graphics, network technologies and CPU processing power, DVEs are very popular nowadays. These systems are currently used in many different types of application, such as collaborative design, military training, e-learning, multi-player games, etc. In general, the most important requirements for DVEs are scalability, consistency and responsiveness. The communication architecture of DVEs is one of the key factors that should be considered to address these requirements. In this paper, we describe a communication architecture for DVEs based on the High Level Architecture (HLA). A prototype implementation with this architecture, the prey-predator federation, is also presented together with some preliminary characterization experiments and results.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Secure Skyline Groups Queries on Encrypted Data on Cloud Platform 23

Secure Skyline Groups Queries on Encrypted Data on Cloud Pla...

引用

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

作者： Teng, Yiping Sun, Yue Shi, Zhan Jiang, Dongyue Zhao, Liang Fan, Chunlong School of Computer Shenyang Aerospace University Liaoning Large-scale Distributed System Laboratory Shenyang China

ISBN: (纸本)9781665494571

As an important category of skyline queries, the skyline groups query has drawn growing interest from the academic communities. For taking the benefit of cost savings, data owners are motivated to outsource the data storage and query processing to the public cloud to offload the massive data management. However, direct outsourcing may raise severe privacy issues. In this paper, we define and study the secure skyline groups query problem, and propose the secure skyline groups query methods. To address this problem, we first propose the Basic Secure Skyline Groups Query (BSSGQ) method to find the skyline groups on encrypted data. In BSSGQ method, candidate groups and their aggregate tuples are generated under encryption. To calculate group dominance relations, we propose a secure group dominance protocol to facilitate the dominance computation between groups. With the dominance relations, the skyline groups w.r.t the query group can be obtained, and finally the query results of the skyline groups can be securely returned without being learnt by the cloud servers. To address the efficiency problem in BSSGQ method, we further propose a Dynamic-programming-based Secure Skyline Groups Query (DSSGQ) method to effectively avoid generating the candidate groups. In DSSGQ method, the encrypted data are equivalently mapped based on the query group as the preprocessing to achieve a dynamic skyline groups query. Then, DSSGQ method dynamically constructs and calculates the skyline sub-groups in ciphertext, and the final skyline groups can be combined with the obtained skyline sub-groups. Thorough analysis shows the security and complexity of the proposed methods, and extensive experimental results on real datasets and synthetic datasets illustrate the performance of our proposed methods. © 2021 IEEE.

关键词： Cloud computing Privacy Protocols Smart cities Query processing Memory Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A note on efficient key location in pure P2P systems under an environment with dynamic key modifications

A note on efficient key location in pure P2P systems under a...

引用

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

作者： Fujita, Satoshi Department of Information Engineering Graduate School of Engineering Hiroshima University Japan

In this paper, we consider the problem of finding a key from elements distributed over a peer-to-peer (P2P) system, where elements locally stored in each node are drawn from a totally ordered set such as the set of integers and the set of English words. As the basic technique to realize an efficient key location, we focus on the combination of binary search and an approximated sorting of the elements. We provide a detailed analysis of the sorting-based key location scheme, and indicate possible directions for further research.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Challenges of distributed Model-Based Diagnosis

Challenges of Distributed Model-Based Diagnosis

引用

23rd international conference on Industrial, Engineering and Other Applications of Applied Intelligent systems

作者： Wotawa, Franz Weber, Jorg Graz Univ Technol Inst Software Technol A-8010 Graz Austria

ISBN: (纸本)9783642130212

The importance of distributed systems is increasing More and more systems are built using multi-agent or service-oriented architectures The size of the resulting! systems also increases. which makes the diagnosis task mote difficult because of the underlying complexity As a consequence distributed diagnosis has become more and more important but usually it is tied to specific modeling concepts or based on particular algorithms whose correctness and completeness is not proven Therefore. we focus in this paper on a general theory for distributed diagnosis, which provides a framework for checking the correctness and completeness of distributed diagnosis algorithms Moreover. we present a simple algorithm and show that correctness and completeness can only be guaranteed uncle! certain assumptions The theory is of importance for industry to ensure the correctness of diagnosis systems in the distributed case

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Minha: Large-scale distributed systems testing made practical 23

Minha: Large-scale distributed systems testing made practica...

引用

23rd international conference on Principles of distributed systems, OPODIS 2019

作者： Machado, Nuno Maia, Francisco Neves, Francisco Coelho, Fábio Pereira, José Teradata Madrid Spain INESC TEC Porto Portugal U.Minho Braga Portugal

ISBN: (纸本)9783959771337

Testing large-scale distributed system software is still far from practical as the sheer scale needed and the inherent non-determinism make it very expensive to deploy and use realistically large environments, even with cloud computing and state-of-the-art automation. Moreover, observing global states without disturbing the system under test is itself difficult. This is particularly troubling as the gap between distributed algorithms and their implementations can easily introduce subtle bugs that are disclosed only with suitably large scale tests. We address this challenge with Minha, a framework that virtualizes multiple JVM instances in a single JVM, thus simulating a distributed environment where each host runs on a separate machine, accessing dedicated network and CPU resources. The key contributions are the ability to run off-the-shelf concurrent and distributed JVM bytecode programs while at the same time scaling up to thousands of virtual nodes;and enabling global observation within standard software testing frameworks. Our experiments with two distributed systems show the usefulness of Minha in disclosing errors, evaluating global properties, and in scaling tests orders of magnitude with the same hardware resources. © Nuno Machado, Francisco Maia, Francisco Neves, Fábio Coelho, and José Pereira;licensed under Creative Commons License CC-BY 23rd international conference on Principles of distributed systems (OPODIS 2019).

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Approximation Algorithm for Scheduling a Chain of Tasks on Heterogeneous systems 1

引用

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

作者： Aba, Massinissa Ait Zaourar, Lilia Munier, Alix CEA LIST Comp & Design Environm Lab F-91191 Gif Sur Yvette France UPMC LIP6 4 Pl Jussieu F-75005 Paris France

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

This paper presents an efficient approximation algorithm to solve the task scheduling problem on heterogeneous platform for the particular case of the linear chain of tasks. The objective is to minimize both the total execution time (makespan) and the total energy consumed by the system. For this purpose, we introduce a constraint on the energy consumption during execution. Our goal is to provides an algorithm with a performance guarantee. Two algorithms have been proposed;the first provides an optimal solution for preemptive scheduling. This solution is then used in the second algorithm to provide an approximate solution for non-preemptive scheduling. Numerical evaluations demonstrate that the proposed algorithm achieves a close-to-optimal performance compared to exact solution obtained by CPLEX for small instances. For large instances, CPLEX is struggling to provide a feasible solution, whereas our approach takes less than a second to produce a solution for an instance of 10000 tasks.

关键词： Linear chain of tasks Makespan Energy Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

High Performance and Scalable Virtual Machine Storage I/O Stack for Multicore systems 23

High Performance and Scalable Virtual Machine Storage I/O St...

引用

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

作者： Zhang, Diming Wu, Hao Xue, Fei Chen, Liangqiang Huang, Hao Nanjing Univ Dept Comp Sci & Technol Nanjing 210023 Jiangsu Peoples R China Jiangsu Univ Sci & Technol Sch Comp Sci & Engn Zhenjiang 212003 Jiangsu Peoples R China

ISBN: (纸本)9781538621295

Today extending virtualization technology into high-performance, cluster platforms generates exciting new possibilities, including dynamic allocation of resources to job, easier to share resources between different jobs, easy checkpointing of jobs, and deployment of job-specific work environment. However, there still exists an I/O scalability problem in virtualization layer which may impede virtualization technology to be widely used in high-performance computing. Because we meet a sharp performance degradation when a virtual machine uses the multiqueue high performance non-volatile storage device as the secondary storage. Such a problem is caused by the current virtual block I/O layer which uses only one I/O thread to handle all I/O operations to a virtualized storage device. As the number of I/O intensive workloads increases, the rate of mutex contention of the I/O thread is accelerated because only one of them is allowed to run at any given instant. Therefore, it is the key problem that should be settled immediately so as to improve block I/O performance in virtualization. In this paper, we propose a novel design of high performance block I/O stack to solve this problem. The workloads will be free of the I/O contention inside the hypervisor by using the proposed method which uses multi-threaded I/O threads to handle all I/O operations to one storage device in parallel. Meanwhile, we use switch-less mechanisms to reduce the overhead caused by sending notification between a VM and its hypervisor;and improve I/O affinity by assigning a distinct dedicated core to each I/O thread in order to eliminate unnecessary scheduling. The prototype system is implemented on Linux 3.19 kernel and Quick Emulator (QEMU) 2.3.1. We deploy it to the POWER8 server for a detailed evaluation. The experimental results show that the proposed architecture scales graciously with multi-core environment. For example, test on 10-ways parallel I/O intensive workloads gets an 800% increase than t

关键词： igh-performance Block I/O Scalability Multi-threaded Virtualizationigh-performance Block I/O Scalability Multi-threaded VirtualizationH

来源：评论

学校读者我要写书评

暂无评论

distributed access framework for embedded device community

Distributed access framework for embedded device community

引用

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

作者： Yang, Yanwu Larsson, Tony CC-Lab. IDE Department Halmstad University PO Box 823 SE-301 18 Halmstad Sweden

This paper identifies the need for multiple clients to concurrently access a device community. A set of embedded devices cooperate via one or more service discovery protocols, such as UPnP, Jini, HAVi or OSGi. We present an approach that encapsulates additional services into a distributed Access Framework (DAF). The services in DAF are responsible for secure and coordinated access of the distributed devices in the community. The different services of DAF can optionally be implemented and executed on different devices. We specify the DAF and demonstrate an implementation where the devices are organized according to the OSGi specification.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The blackboard resource discovery mechanism for distributed computing over Peer-to-Peer networks

The blackboard resource discovery mechanism for distributed ...

引用

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

作者： Al-Dmour, N.A. Teahan, W.J. School of Informatics University of Wales Bangor Dean Street Bangor Gwynedd LL57 1UT United Kingdom

Peer-to-Peer computing has emerged in the last few years as an alternative to the traditional client/server model. The Blackboard Resource Discovery Mechanism (BrdM) facilitates the discovery of objects (files) in P2P network. We show in this paper that BrdM can also be used to find idle computers in a Peer-to-Peer network and exploits their CPU cycles to work together on solving a computational problem. We analyze the performance of BrdM in comparison with other searching algorithms. The simulations show that BrdM outperforms other algorithms discovering more idle peers than other approaches with fewer number of query messages.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共106页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：