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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

69 篇 会议
15 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

46 篇 工学
- 41 篇 计算机科学与技术...
- 30 篇 软件工程
- 7 篇 控制科学与工程
- 5 篇 信息与通信工程
- 4 篇 电气工程
- 2 篇 机械工程
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 船舶与海洋工程
- 1 篇 生物工程
- 1 篇 安全科学与工程
- 1 篇 网络空间安全
18 篇 理学
- 9 篇 数学
- 4 篇 物理学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 海洋科学
- 1 篇 生物学
14 篇 管理学
- 9 篇 图书情报与档案管...
- 7 篇 管理科学与工程(可...
- 3 篇 工商管理
- 1 篇 公共管理
2 篇 法学
- 2 篇 社会学
- 1 篇 政治学
1 篇 文学
- 1 篇 新闻传播学

主题

8 篇 software enginee...
5 篇 computer archite...
5 篇 semantics
4 篇 task analysis
4 篇 predictive model...
4 篇 software
4 篇 intelligent syst...
3 篇 service oriented...
3 篇 ontologies
3 篇 internet
3 篇 analytical model...
3 篇 humans
3 篇 hardware
3 篇 management of co...
3 篇 data models
3 篇 web services
2 篇 computer science
2 篇 information syst...
2 篇 tuning
2 篇 reliability

机构

16 篇 institute for pr...
15 篇 institute for pr...
8 篇 karlsruhe instit...
6 篇 institute for pr...
3 篇 department of st...
3 篇 institute for pr...
2 篇 department of ma...
2 篇 software enginee...
2 篇 software enginee...
2 篇 mayflower gmbh m...
2 篇 department of co...
2 篇 institute of com...
2 篇 institute for pr...
2 篇 program structur...
2 篇 corporate resear...
2 篇 department of co...
1 篇 computer science...
1 篇 institute of pro...
1 篇 institute for in...
1 篇 chair for public...

作者

9 篇 walter f. tichy
7 篇 tichy walter f.
7 篇 böhm klemens
7 篇 klemens böhm
6 篇 weigelt sebastia...
5 篇 ralf reussner
4 篇 tobias hey
4 篇 hütter christian
4 篇 klemens bohm
4 篇 christian hütter
4 篇 sebastian weigel...
3 篇 wilhelm hasselbr...
3 篇 vanessa steurer
3 篇 birgit vogel-heu...
3 篇 szabó zoltán
3 篇 klein michael
3 篇 reussner ralf
3 篇 kalinke florian
2 篇 piotr rygielski
2 篇 christian von de...

语言

87 篇 英文
1 篇 其他

检索条件"机构=Institute for Program Structures and Data Organization Karlsruhe Institute of Technology"

共 88 条记录，以下是41-50 订阅

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

详细简洁

排序：

Cooperation through reciprocity in multiagent systems: an evolutionary analysis 11

Cooperation through reciprocity in multiagent systems: an ev...

引用

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1

作者： Christian Hütter Klemens Böhm Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Germany

ISBN: (纸本)9780982657157

The Service Game is a model for reciprocity in multiagent systems. Here, agents interact repeatedly by requesting and providing services. In contrast to existing models where players are matched randomly, players of the Service Game may choose with whom they play. The rationale behind provider selection is to choose a provider that is likely to perform a task as desired. We develop a formal model for provider selection in the Service Game. An evolutionary process based on a genetic algorithm allows us to incorporate notions of bounded rationality, learning, and adaptation into the analysis of the game. We conduct a series of experiments to study the evolution of strategies and the emergence of cooperation. We show that cooperation is more expensive with provider selection than with random matching. Further, populations consisting of discriminators and defectors form a bistable community.

关键词： agent cooperation evolution formal model social simulation

来源：评论

学校读者我要写书评

暂无评论

Strategic Provider Selection in a Policy-Based Helping Scenario

Strategic Provider Selection in a Policy-Based Helping Scena...

引用

IEEE International Conference on E-Commerce technology Workshops

作者： Christian Hutter Jing Zhi Yue Christian von der Weth Klemens Bohm Institute of Program Structures and Data Organization Karlsruhe Institute of Technology Germany

In service-oriented computing, software agents interact by requesting and providing services. Since providing a service incurs cost, uncooperative behavior dominates in the absence of an incentive mechanism. An economic model that describes interactions between individuals is the Helping Game. There, pairs of requester and provider are randomly matched. In various real-world applications in turn, several providers offer similar services, and requesters have a choice of providers. The rationale behind strategic provider selection is to choose the provider that is most likely to perform the task as desired. The results from existing studies of the Helping Game are not directly applicable to settings with provider selection. To analyze how strategic provider selection affects the efficiency of enterprise systems, we have designed and carried out an experimental study. Our results show that cooperative participants receive significantly more requests than uncooperative ones, making cooperation expensive. We conclude that system designers must incentivize requesters to balance their tasks between providers.

关键词： Games Economics Biological system modeling Manuals Software agents Analytical models Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Online-Autotuning in the Presence of Algorithmic Choice

Online-Autotuning in the Presence of Algorithmic Choice

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Philip Pfaffe Martin Tillmann Sigmar Walter Walter F. Tichy Karlsruhe Institute of Technology (KIT) Institute for Program Structures and Data Organization Karlsruhe Germany

In this paper we explore the problem of autotuning the choice of algorithm. For a given task, there may be multiple algorithms available, each of which may contain its own set of tunable parameters and may provide optimal performance under different sets of inputs. Algorithmic choice is a type of tuning parameter which has not been well studied in the history of autotuning. To close this gap, we examine established autotuning techniques with regard to their ability of handling these parameters. We discuss the inadequacy of the state-of-the-art autotuning toolbox in manipulating algorithmic choice parameters and introduce four strategies to tackle this task. We evaluate our strategies in two case studies of online-autotuning scenarios, both with and without additional, numeric tuning parameters. The strategies are able to determine the optimal algorithm, and can even interoperate with the autotuning of the additional parameters.

关键词： Tuning Algorithm design and analysis Runtime Optimization Genetic algorithms Approximation algorithms Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving Traceability Link Recovery Using Fine-grained Requirements-to-Code Relations

Improving Traceability Link Recovery Using Fine-grained Requ...

引用

International Conference on Software Maintenance (ICSM)

作者： Tobias Hey Fei Chen Sebastian Weigelt Walter F. Tichy Karlsruhe Institute of Technology (KIT) Institute for Program Structures and Data Organization Karlsruhe Germany

Traceability information is a fundamental prerequisite for many essential software maintenance and evolution tasks, such as change impact and software reusability analyses. However, manually generating traceability information is costly and error-prone. Therefore, researchers have developed automated approaches that utilize textual similarities between artifacts to establish trace links. These approaches tend to achieve low precision at reasonable recall levels, as they are not able to bridge the semantic gap between high-level natural language requirements and code. We propose to overcome this limitation by leveraging fine-grained, method and sentence level, similarities between the artifacts for traceability link recovery. Our approach uses word embeddings and a Word Mover's Distance-based similarity to bridge the semantic gap. The fine-grained similarities are aggregated according to the artifacts structure and participate in a majority vote to retrieve coarse-grained, requirement-to-class, trace links. In a comprehensive empirical evaluation, we show that our approach is able to outperform state-of-the-art unsupervised traceability link recovery approaches. Additionally, we illustrate the benefits of fine-grained structural analyses to word embedding-based trace link generation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

data Center Network Throughput Analysis Using Queueing Petri Nets

Data Center Network Throughput Analysis Using Queueing Petri...

引用

International Conference on Distributed Computing Systems Workshop

作者： Piotr Rygielski Samuel Kounev Institute for Program Structures and Data Organization Karlsruhe Institute of Technology (KIT) Karlsruhe Germany

In this paper, we contribute performance modeling and analysis approach in computer networks. We present a meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our meta-model can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present a transformation to Queueing Petri Nets (QPNs). We show that despite the high level of abstraction of the QPN models, we are able to predict the utilization of resources with good accuracy within a short time.

关键词： Predictive models Analytical models Image color analysis Stochastic processes Protocols Cameras Throughput

来源：评论

学校读者我要写书评

暂无评论

NoRBERT: Transfer Learning for Requirements Classification

NoRBERT: Transfer Learning for Requirements Classification

引用

IEEE International Conference on Requirements Engineering

作者： Tobias Hey Jan Keim Anne Koziolek Walter F. Tichy Karlsruhe Institute of Technology (KIT) Institute for Program Structures and Data Organization Karlsruhe Germany

ISBN: (数字)9781728174389

ISBN: (纸本)9781728174396

Classifying requirements is crucial for automatically handling natural language requirements. The performance of existing automatic classification approaches diminishes when applied to unseen projects because requirements usually vary in wording and style. The main problem is poor generalization. We propose NoRBERT that fine-tunes BERT, a language model that has proven useful for transfer learning. We apply our approach to different tasks in the domain of requirements classification. We achieve similar or better results F 1 -scores of up to 94%) on both seen and unseen projects for classifying functional and non-functional requirements on the PROMISE NFR dataset. NoRBERT outperforms recent approaches at classifying non-functional requirements subclasses. The most frequent classes are classified with an average F 1 -score of 87%. In an unseen project setup on a relabeled PROMISE NFR dataset, our approach achieves an improvement of 15 percentage points in average F 1 score compared to recent approaches. Additionally, we propose to classify functional requirements according to the included concerns, i.e., function, data, and behavior. We labeled the functional requirements in the PROMISE NFR dataset and applied our approach. NoRBERT achieves an F 1 -score of up to 92%. Overall, NoRBERT improves requirements classification and can be applied to unseen projects with convincing results.

关键词： Bit error rate Task analysis Requirements engineering Machine learning Training Natural language processing

来源：评论

学校读者我要写书评

暂无评论

Service oer and request descriptions in mobile environments?

Service oer and request descriptions in mobile environments?

引用

8th Workshop of the German Informatics Society on Mobile databases and Information Systems: Mobile databases - Today, Tomorrow and in 20 Years, GI 2005, GI Conference on database Systems for Business, technology and Web, BTW 2005

作者： Grunbauer, Johannes Klein, Michael Institut fur Informatik Technische Universität München 85748 Garching Germany Institute for Program Structures and Data Organization Universität Karlsruhe 76128 Karlsruhe Germany

In order to obtain robust and context-aware applications in mobile environments, service oriented computing can be a very promising programming paradigm. Here, the participants cooperate in a loosely coupled manner by invoking context-depend services on demand. However, the approach demands for an expressive description of the offered and requested services. This paper aims at giving a basis for discussion on the requirements and approaches when describing services for mobile environments.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Locating Parallelization Potential in Object-Oriented data structures

Locating Parallelization Potential in Object-Oriented Data S...

引用

IEEE International Parallel and Distributed Processing Symposium

作者： Korbinian Molitorisz Thomas Karcher Alexander Bieles Walter F. Tichy Institute for Program Structures and Data Organization (IPD) Karlsruhe Institute of Technology (KIT)

ISBN: (纸本)9781479938018

The free lunch of ever increasing single-processor performance is over. Software engineers have to parallelize software to gain performance improvements. But not every software engineer is a parallel expert and with millions of lines of code that have not been developed with multicore in mind, we have to find ways to assist in identifying parallelization potential. This paper makes three contributions: 1) An empirical study of more than 900,000 lines of code reveals five use cases in the runtime profile of object-oriented data structures that carry parallelization potential. 2) The study also points out frequently used data structures in realistic software in which these use cases can be found. 3) We developed DSspy, an automatic dynamic profiler that locates these use cases and makes recommendations on how to parallelize them. Our evaluation shows that DSspy reduces the search space for parallelization by up to 77% and engineers only need to consider 23% of all data structure instances for parallelization.

关键词： Parallelization Detection Dynamic Analysis Tool

来源：评论

学校读者我要写书评

暂无评论

Parallelizing a Real-Time Audio Application -- A Case Study in Multithreaded Software Engineering

Parallelizing a Real-Time Audio Application -- A Case Study ...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Marc Aurel Kiefer Korbinian Molitorisz Jochen Bieler Walter F. Tichy Institute for Program Structures and Data Organization (IPD) Karlsruhe Institute of Technology (KIT) Karlsruhe Germany

ISBN: (纸本)9781467376853

Multicore hardware is ubiquitous, but billions of lines of code in performance-critical commodity software are still sequential. Although parallel libraries, design patterns, and best practice guidelines are available, thinking parallel is still a big challenge for many software engineers. In this paper we present a case study on parallelizing commodity software using a commercial real-time audio application with over 700,000 lines of code. In contrast to best practice guidelines, our goal is to investigate what parallelization strategy can effectively be used in data stream-intensive applications. Performing an in-depth analysis of the software architecture and its run-time performance, we locate parallelization potential and propose three different parallelization strategies. We evaluate them with respect to their parallel performance impact. Regarding the application's intrinsic real-time requirement and a very short audio cycle turnaround time, a busy-waiting strategy offers the best audio performance of 327 μs per cycle on an eight-core machine. With an efficiency of 99% this is close to the optimal schedule.

关键词： Instruction sets Hardware Real-time systems Optimal scheduling Mixers Software architecture

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Service Discovery in Mobile Ad-hoc Networks

Asynchronous Service Discovery in Mobile Ad-hoc Networks

引用

Persistence, Scalability, Transactions - database Mechanisms for Mobile Applications 2003

作者： Nagi, Khaled König-Ries, Birgitta Computer Science Department Faculty of Engineering Alexandria University El-Shatby Alexandria Egypt Institute for Program Structures Data Organization Universität Karlsruhe KarlsruheD-76128 Germany

ISBN: (纸本)3885793725

The wide availability of mobile devices equipped with wireless communication devices paves the way for building highly dynamic communities of ad-hoc networks. For an asynchronous service discovery in this environment, we suggest the use of mobile agents. Here, we concentrate on file sharing and exchanging services. We adopt a new asynchronous approach for discovering and locating these files, since the availability of files in this particular domain will change significantly over time when nodes constantly join and leave the network. In this paper, we present a typical application scenario, highlight the main components of the system architecture and discuss the technical challenges facing us while trying to port main infrastructural features of traditional database management systems to our mobile light-weight software agents. © 2003 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：