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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

576 篇 会议
196 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

441 篇 工学
- 342 篇 计算机科学与技术...
- 257 篇 软件工程
- 71 篇 信息与通信工程
- 46 篇 控制科学与工程
- 41 篇 电子科学与技术（可...
- 37 篇 电气工程
- 33 篇 力学（可授工学、理...
- 32 篇 动力工程及工程热...
- 28 篇 生物工程
- 27 篇 机械工程
- 20 篇 生物医学工程（可授...
- 16 篇 材料科学与工程（可...
- 13 篇 化学工程与技术
- 12 篇 冶金工程
- 11 篇 仪器科学与技术
- 9 篇 环境科学与工程（可...
232 篇 理学
- 156 篇 数学
- 51 篇 物理学
- 30 篇 生物学
- 28 篇 系统科学
- 21 篇 统计学（可授理学、...
- 19 篇 化学
- 11 篇 大气科学
115 篇 管理学
- 77 篇 管理科学与工程(可...
- 48 篇 图书情报与档案管...
- 29 篇 工商管理
17 篇 法学
- 16 篇 社会学
10 篇 经济学
- 10 篇 应用经济学
10 篇 医学
- 10 篇 基础医学(可授医学...
- 10 篇 临床医学
2 篇 农学
2 篇 艺术学
1 篇 教育学
1 篇 军事学

主题

27 篇 mobile communica...
26 篇 computational mo...
25 篇 distributed comp...
24 篇 protocols
23 篇 hardware
22 篇 scalability
19 篇 concurrent compu...
19 篇 servers
18 篇 application soft...
17 篇 routing
17 篇 optimization
17 篇 delay
16 篇 data mining
16 篇 context
15 篇 global positioni...
15 篇 computer archite...
14 篇 information mana...
14 篇 semantics
13 篇 runtime
13 篇 cloud computing

机构

62 篇 institute of par...
50 篇 institute of par...
49 篇 institute for pa...
45 篇 institute for pa...
41 篇 institute of par...
30 篇 institute of par...
26 篇 institute of par...
22 篇 institute of par...
11 篇 faculty of mathe...
11 篇 shanghai key lab...
10 篇 institute of par...
9 篇 institute of par...
9 篇 jožef stefan int...
9 篇 jožef stefan ins...
8 篇 engineering rese...
8 篇 institute for pa...
8 篇 institute for pa...
7 篇 university of st...
7 篇 institute of par...
7 篇 school of comput...

作者

62 篇 kurt rothermel
57 篇 rothermel kurt
53 篇 chen haibo
48 篇 mitschang bernha...
43 篇 kosec gregor
35 篇 frank dürr
33 篇 k. rothermel
27 篇 haibo chen
26 篇 pflüger dirk
26 篇 bernhard mitscha...
23 篇 zang binyu
21 篇 levi paul
20 篇 mayer ruben
19 篇 hirmer pascal
19 篇 jančič mitja
19 篇 dürr frank
17 篇 chen rong
16 篇 schwarz holger
15 篇 rot miha
15 篇 gregor kosec

语言

755 篇 英文
17 篇 其他
3 篇 中文
2 篇 德文

检索条件"机构=Institute Of Parallel and Distributed Systems"

共 776 条记录，以下是31-40 订阅

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

详细简洁

排序：

Fuzzy logic based sensor skin for robotic applications

Fuzzy logic based sensor skin for robotic applications

引用

2012 International Conference on Artificial Intelligence, ICAI 2012

作者： Meister, E. Zilberman, I. Levi, P. Institute of Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)1601322186

Tactile sensors play an important role in many robotic applications providing information about shape, roughness, frictions and acting forces. However, it is challenging cover large robots with tactile sensors. In this paper we introduce a modular tactile sensor skin built on master and slave principle. The structure of the sensor skin was inspired by the biological multi layered skin from humans. Modular design principle allows covering different flat and rough robot geometries. The skin is able to detect tactile and pressure sensor values and is therefore applicable to different applications. Fuzzy logic based data fusion method allows the input values to be fuzzy while receiving numerical values as the output. This concept reduces the number of required sensor to a minimum and consequently also the computational effort and production costs.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

A new approach for establishing pairwise keys for securing wireless sensor networks 05

A new approach for establishing pairwise keys for securing w...

引用

3rd ACM International Conference on Embedded Networked Sensor systems, SenSys 2005

作者： Wacker, Arno Knoll, Mirko Heiber, Timo Rothermel, Kurt Dept. of Distributed Systems Institute of Parallel and Distributed Systems Universiẗat Stuttgart Stuttgart Germany

ISBN: (纸本)159593054X

Wireless sensor networks based on highly resource-constrained devices require symmetric cryptography in order to make them secure. Integral to this is the exchange of unique symmetric keys between two devices. In this paper, we propose a novel decentralized key exchange protocol that guarantees the confidentiality of a key exchange even if an attacker has compromised some of the devices in the network. A central objective of the protocol design was to minimize resource consumption on the individual devices. We evaluate the resource requirements of our protocol in terms of memory requirements, CPU usage and network traffic both through theoretical analysis and through simulations. Categories and Subject Descriptors D.4.6 [Operating systems]: Security and Protection, Cryptographic controls General Terms Algorithms, Security. © 2005 ACM.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Large-scale influence maximization with the influence maximization benchmarker suite 4

Large-scale influence maximization with the influence maximi...

引用

4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and systems and Network Data Analytics, GRADES-NDA 2021

作者： Geppert, Heiko Bhowmik, Sukanya Rothermel, Kurt Institute for Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)9781450384773

Maximizing the influence of a fixed size seed set in a graph was investigated intensively in the past decade. Two very relevant questions are 1) how to solve the influence maximization problem on very large graphs within short time and 2) how to compare possible findings with the current state-of-the-art in a fair manner. To solve the first problem, proxy-based influence maximization strategies emerged. However, today's graphs became too large to be solved quickly for many well-established proxy strategies, since they do not scale to such large graphs. In this paper we propose 1) a novel update scheme for iterative influence maximization strategies named Update Approximation (UA) capable of large influence spreads within a few seconds on billion-scale graphs. Further, we present 2) a generic benchmark suite (Influence Maximization Benchmarker - - IMB) to implement and evaluate influence maximization strategies, alongside with implementations for several established strategies. IMB allows for easy to use benchmarks for further research by the community. © 2021 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

The power of software-defined networking: Line-rate content-based routing using OpenFlow

The power of software-defined networking: Line-rate content-...

引用

7th Workshop on Middleware for Next Generation Internet Computing, MW4NG 2012 - Co-located with the 13th ACM/IFIP/USENIX International Middleware Conference, Middleware 2012

作者： Koldehofe, Boris Dürr, Frank Tariq, Muhammad Adnan Rothermel, Kurt Institute of Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)9781450316071

A lot of research effort has been invested to support efficient content-based routing. Nevertheless, practitioners often fall back to far less expressive communication paradigms like multicast groups. The benefits of content-based routing in minimizing bandwidth consumption are often rendered useless by simpler communication paradigms that rely on line-rate processing of data packets at the switches of the network providers. Contrary content-based routing protocols face the inherent overhead in matching the content of events against subscriptions leading to far lower throughput rates and higher end-to-end delays. However, recent trends in networking such as software defined networking in combination with network virtualization have tremendous potential to change the picture. In our opinion this will significantly increase acceptance of sophisticated middleware like content-based routing in the future. To support our claims we outline in this paper a reference architecture that may be used to build middleware for Future Internet applications. Furthermore, we provide a solution for realizing content-based routing at line-rate relying on this reference architecture and illustrate research problems that need to be addressed. © 2012 ACM.

关键词： Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Secure cryptographic deletion in the swift object store 17

Secure cryptographic deletion in the swift object store

引用

Datenbanksysteme fur Business, Technologie und Web, BTW 2017, 17. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme", DBIS - Database systems for Business, Technology and Web, BTW 2017, 17th Symposium of the GI Department "Databases and Information systems", DBIS

作者： Waizenegger, Tim University of Stuttgart Institute for Parallel and Distributed Systems Germany

ISBN: (纸本)9783885796596

The secure deletion of data is of increasing importance to individuals, corporations as well as governments. Recent data breaches as well as advances in laws and regulations show that secure deletion is becoming a requirement in many areas. However, this requirement is rarely considered in today’s cloud storage services. The reason is that the established processes for secure deletion of on-site storage are not applicable to cloud storage services. Cryptographic deletion is a suitable candidate for these services, but a research gap still exists in applying cryptographic deletion to large cloud storage services. For these reasons, we demonstrate a working prototype for a secure-deletion enabled cloud storage service with the following two main contributions: A model for offering high value service without full plain-text access to the provider, as well as secure deletion of data through cryptography. © 2017 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Records management

来源：评论

学校读者我要写书评

暂无评论

PreMatch: A Prediction-based Scheduler for Dataflow Asynchronous Processing on the Computing Continuum 25

PreMatch: A Prediction-based Scheduler for Dataflow Asynchro...

引用

Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing

作者： Narges Mehran Zahra Najafabadi Samani Samira Afzal Radu Prodan Frank Pallas Peter Dorfinger Intelligent Connectivity Group Salzburg Research Forschungsgesellschaft mbH Salzburg Salzburg Austria Faculty of Digital and Analytical Sciences Paris Lodron University of Salzburg Salzburg Salzburg Austria Distributed and Parallel Systems Group University of Innsbruck Innsbruck Tyrol Austria Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Overijssel Netherlands Institute of Information Technology Alpen-Adria-University of Klagenfurt Klagenfurt Carinthia Austria

ISBN: (纸本)9798400706295

The popularity of asynchronous data exchange patterns has recently increased, as evidenced by 23% of the communication between microservices in an Alibaba trace analysis. Such workloads necessitate methods for reducing dataflow processing and completion time by forecasting the future requirements of their microservices and (re-)scheduling them. Therefore, we investigate a prediction-based scheduling method of asynchronous dataflow processing applications by considering the stochastic changes due to dynamic user requirements. We present a microservice scaling and scheduling method named PreMatch combining a machine learning (ML) prediction strategy based on gradient boosting with ranking and game theory matching scheduling principles. Firstly, PreMatch predicts the number of microservice replicas, and then, the ranking method orders the microservice replicas and devices based on microservice and transmission times. Thereafter, the PreMatch schedules microservice replicas requiring dataflow processing on computing devices. Experimental analysis of the PreMatch method shows lower completion times on average 13% compared to a related prediction-based scheduling method.

关键词： microservice

来源：评论

学校读者我要写书评

暂无评论

Benefits of integrating meta data into a context model

Benefits of integrating meta data into a context model

引用

Third IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom 2005 Workshops

作者： Hönle, Nicola Käppeler, Uwe-Philipp Nicklas, Daniela Schwarz, Thomas Grossmann, Matthias Institute of Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)0769523005

Meta data - data about data - improves the value of the operational data by giving applications and users additional information on the data's origin, its precision or stateness. We outline the benefits of modeling meta data in context models: it can be used for resource finding, enhanced data selection, trust and data quality issues and sensor fusion. We show how meta data included into an object-based context model influences the data modeling and the selection process in the query language. Finally, we describe our implementation of the presented functionality in the Nexus platform. © 2005 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

The tensor flow partitioning and scheduling problem: It's the critical path! 1

The tensor flow partitioning and scheduling problem: It's th...

引用

1st Workshop on distributed Infrastructures for Deep Learning, DIDL 2017

作者： Mayer, Ruben Mayer, Christian Laich, Larissa Institute of Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)9781450351690

State-of-The-Art data flow systems such as TensorFlow impose iterative calculations on large graphs that need to be partitioned on heterogeneous devices such as CPUs, GPUs, and TPUs. However, partitioning can not be viewed in isolation. Each device has to select the next graph vertex to be executed, i.e., perform local scheduling decisions. Both problems, partitioning and scheduling, are NP-complete by themselves but have to be solved in combination in order to minimize overall execution time of an iteration. In this paper, we propose several heuristic strategies to solve the partitioning and scheduling problem in TensorFlow. We simulate the performance of the proposed strategies in heterogeneous environments with communication-intensive workloads that are common to TensorFlow. Our findings indicate that the best partitioning and scheduling heuristics are those that focus on minimizing the execution time of the critical path in the graph. Those strategies provide a speed-up of up to 4 times in comparison to strategies that are agnostic to the critical path, such as hash-based partitioning and FIFO scheduling. © 2017 Copyright held by the owner/author(s).

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Flexible application-aware approximation for modern distributed graph processing frameworks 5

Flexible application-aware approximation for modern distribu...

引用

5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and systems and Network Data Analytics, GRADES-NDA 2022, co-located with ACM SIGMOD Conference

作者： Schramm, Michael Bhowmik, Sukanya Rothermel, Kurt Institute for Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)9781450393843

The interest in the ability of processing data that has an underlying graph structure has grown in the recent past. This has led to the development of many distributed graph processing systems. However, due to rapidly growing amount of data, e.g., web graphs and social graphs, even such distributed graph processing frameworks end up requiring several minutes or even several hours to execute popular graph algorithms. This leads to the question: do we always need to know the exact answer for a large graph? The aforementioned modern distributed graph processing frameworks execute graph algorithms by exchanging messages between vertices. This paper introduces a novel message-dropping approach for approximation in these frameworks. As dropping messages would result in degradation of quality of result, our objective is to drop messages that have least adverse impact on quality. More specifically, we propose an application-aware approach that dynamically drops messages at runtime. We evaluate the effects of our approach for the PageRank algorithm on several representative real-world web graphs and compare its performance to that of existing approximation techniques for modern frameworks.. © 2022 ACM.

关键词： Drops

来源：评论

学校读者我要写书评

暂无评论

Grand challenge: Streamlearner - distributed incremental machine learning on event streams 11

Grand challenge: Streamlearner - Distributed incremental mac...

引用

11th ACM International Conference on distributed Event-Based systems, DEBS 2017

作者： Mayer, Christian Mayer, Ruben Abdo, Majd Institute for Parallel and Distributed Systems University of Stuttgart Germany

ISBN: (纸本)9781450350655

Today, massive amounts of streaming data from smart devices need to be analyzed automatically to realize the Internet of Things. The Complex Event Processing (CEP) paradigm promises low-latency pattern detection on event streams. However, CEP systems need to be extended with Machine Learning (ML) capabilities such as online training and inference in order to be able to detect fuzzy patterns (e.g. outliers) and to improve pattern recognition accuracy during runtime using incremental model training. In this paper, we propose a distributed CEP system denoted as StreamLearner for ML-enabled complex event detection. The proposed programming model and data-parallel system architecture enable a wide range of real-world applications and allow for dynamically scaling up and out system resources for low-latency high-throughput event processing. We show that the DEBS Grand Challenge 2017 case study (i.e., anomaly detection in smart factories) integrates seamlessly into the StreamLearner API. Our experiments verify scalability and high event throughput of StreamLearner. © 2017 Copyright held by the owner/author(s).

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共78页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：