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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
14 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

46 篇 工学
- 41 篇 计算机科学与技术...
- 30 篇 软件工程
- 7 篇 控制科学与工程
- 5 篇 信息与通信工程
- 4 篇 电气工程
- 2 篇 机械工程
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 土木工程
- 1 篇 船舶与海洋工程
- 1 篇 生物工程
- 1 篇 安全科学与工程
- 1 篇 网络空间安全
18 篇 理学
- 10 篇 数学
- 4 篇 物理学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 1 篇 海洋科学
- 1 篇 生物学
13 篇 管理学
- 9 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
- 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 篇 reussner ralf
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 篇 kalinke florian
2 篇 piotr rygielski
2 篇 christian von de...

语言

86 篇 英文
1 篇 其他

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

共 87 条记录，以下是21-30 订阅

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

详细简洁

排序：

Strategic provider selection in a policy-based helping scenario

Strategic provider selection in a policy-based helping scena...

引用

12th IEEE Conference on Commerce and Enterprise Computing, CEC 2010

作者： Hütter, Christian Yue, Jing Zhi Von Der Weth, Christian Böhm, Klemens Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Germany School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9780769542287

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. © 2010 IEEE.

关键词： Software agents

来源：评论

学校读者我要写书评

暂无评论

DIANE: An integrated approach to automated service discovery, matchmaking and composition 07

DIANE: An integrated approach to automated service discovery...

引用

16th International World Wide Web Conference, WWW2007

作者： Küster, Ulrich König-Ries, Birgitta Stern, Mirco Klein, Michael Institute of Computer Science Friedrich-Schiller University Jena Jena Germany Institute for Program Structures and Data Organization University Karlsruhe Germany

ISBN: (纸本)1595936548

Automated matching of semantic service descriptions is the key to automatic service discovery and binding. But when trying to find a match for a certain request it may often happen, that the request cannot be serviced by a single offer but could be handled by combining existing offers. In this case automatic service composition is needed. Although automatic composition is an active field of research it is mainly viewed as a planning problem and treated separatedly from service discovery. In this paper we argue that an integrated approach to the problem is better than seperating these issues as is usually done. We propose an approach that integrates service composition into service discovery and matchmaking to match service requests that ask for multiple connected effects, discuss general issues involved in describing and matching such services and present an efficient algorithm implementing our ideas.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Hybrid online autotuning for parallel ray tracing

Hybrid online autotuning for parallel ray tracing

引用

19th Eurographics Symposium on Parallel Graphics and Visualization, EGPGV 2019

作者： Herveau, K. Pfaffe, P. Tillmann, M. Tichy, W.F. Dachsbacher, C. Computer Graphics Group Karlsruhe Institute of Technology Germany Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Germany

ISBN: (纸本)9783038680796

Acceleration structures are key to high performance parallel ray tracing. Maximizing performance requires configuring the degrees of freedom (e.g., construction parameters) these data structures expose. Whether a parameter setting is optimal depends on the input (e.g., the scene and view parameters) and hardware. Manual selection is tedious, error prone, and is not portable. To automate the parameter selection task we use a hybrid of model-based prediction and online autotuning. The combination benefits from the best of both worlds: One-shot configuration selection when inputs are known or similar, effective exploration of the configuration space otherwise. Online tuning additionally serves to train the model on real inputs without requiring a-priori training samples. Online autotuning outperforms best-practice configurations recommended by the literature, by up to 11% median. The model predictions achieve 95% of the online autotuning performance while reducing 90% of the autotuner overhead. Hybrid online autotuning thus enables always-on tuning of parallel ray tracing. © 2019 Eurographics Association. All rights reserved.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

The Minimax Rate of HSIC Estimation for Translation-Invariant Kernels 38

The Minimax Rate of HSIC Estimation for Translation-Invarian...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Kalinke, Florian Szabó, Zoltán Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Karlsruhe Germany Department of Statistics London School of Economics London United Kingdom

Kernel techniques are among the most influential approaches in data science and statistics. Under mild conditions, the reproducing kernel Hilbert space associated to a kernel is capable of encoding the independence of M ≥ 2 random variables. Probably the most widespread independence measure relying on kernels is the so-called Hilbert-Schmidt independence criterion (HSIC;also referred to as distance covariance in the statistics literature). Despite various existing HSIC estimators designed since its introduction close to two decades ago, the fundamental question of the rate at which HSIC can be estimated is still open. In this work, we prove that the minimax optimal rate of HSIC estimation on Rd for Borel measures containing the Gaussians with continuous bounded translation-invariant characteristic kernels is (Equation Presented). Specifically, our result implies the optimality in the minimax sense of many of the most-frequently used estimators (including the U-statistic, the V-statistic, and the Nyström-based one) on Rd © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Palladio optimization suite: QoS optimization for component-based cloud applications 9

Palladio optimization suite: QoS optimization for component-...

引用

9th EAI International Conference on Performance Evaluation Methodologies and Tools, ValueTools 2015

作者： Ciavotta, Michele Ardagna, Danilo Koziolek, Anne Politecnico di Milano Dipartimento di Elettronica Informazione e Bioingegneria Italy Karlsruhe Institute of Technology Institute for Program Structures and Data Organization Italy

ISBN: (纸本)9781631900969

One important issue in software engineering is to find an effective way to deal with the increasing complexity of software computing system. Modern software applications have evolved in terms of size and scope. Specific tools have been created to predict the Quality of Service (QoS) at designtime. However, the optimization of an architecture usually has to be done manually, resulting in an arduous and timeconsuming process. For this reason, we present the Palladio Optimization Suite (POS), a collection of complementary plugins realized to run atop Palladio Bench with the aim of automatizing the exploration of the space of possible architectures by means of advanced search paradigms. © Copyright 2016 ICST.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Evaluating and enhancing meta-search performance in digital libraries 3

Evaluating and enhancing meta-search performance in digital ...

引用

3rd International Conference on Web Information Systems Engineering, WISE 2002

作者： Schmitt, B. Oberländer, S. Institute for Program Structures and Data Organization - IPD Computer Science Department University of Karlsruhe Am Fasanengarten 3 KarlsruheD-76128 Germany

ISBN: (纸本)0769517668

Applying meta search systems is a suitable method for supporting the user if there are many different retrieval services available on the Web. Due to information splitting strategies of literature services existing meta search systems either provide minimal integration of results or slow response times. We present an approach that combines techniques of personalization and query processing in order to satisfy the user's demand for both fast and comprehensive results. In order to evaluate and compare different query processing strategies and additional influencing parameters we developed a simulation tool called SIMPSON. Thereby, we can observe the performance of query processing within the context of different response times of the underlying digital library services in the Web, with different kinds of user queries, and with different sizes of query results. To evaluate and compare the performance of different query processing and duplicate detection strategies we developed metrics, particularly with regard to user satisfaction. We present results from our first experiments with SIMPSON, focusing on duplicate detection, query specification, and Web server performance of the underlying digital library services. © 2002 IEEE.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of virtual assistants from databases using active ontologies 31

Automatic generation of virtual assistants from databases us...

引用

31st International Conference on Software Engineering and Knowledge Engineering, SEKE 2019

作者： Blersch, Martin Weigelt, Sebastian Tichy, Walter F. Angele, Kevin Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Karlsruhe Germany Semantic Technology Institute University of Innsbruck Innsbruck Austria ONLIM GmbH Telfs Austria

ISBN: (纸本)1891706489

Virtual assistants such as Siri or Google Assistant are omnipresent. However, their development remains costly. One must either manually model the problem domain or provide thousands of labeled samples. We propose to automatically create virtual assistants based on Active Ontologies for interacting with databases. Our approach generates Active Ontologies;we use the database structure to derive a concept hierarchy and database values together with synonyms to extract information from user queries. Our approach also learns common phrases from samples, e.g. from existing Dialogflow agents. We extract pre- and postfixes and attach them to concepts, e.g. at to detect a succeeding location. The generated Active Ontologies reply to previously unseen and composed requests. The approach is not limited to virtual assistants but can be applied to any system with a textual or voice-based conversational interface such as chatbots. We evaluate our approach in three domains: tourism, hotel, and web cams. The study shows that automatically generated Active Ontologies extract relevant information from user utterances with a precision of 58%. The precision increases to 79% (recall 46%, F1 58%) when we use sample utterances. Our approach successfully transfers between domains, e.g. we learn phrases from the tourism domain and use them to reply to hotel requests without any adjustments. © 2019 Knowledge Systems institute Graduate School. All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Soft reservations uncertainty-aware resource reservations in IaaS environments 3

Soft reservations uncertainty-aware resource reservations in...

引用

3rd International Symposium on Business Modeling and Software Design, BMSD 2013

作者： Mohammadi, Seyed Vahid Kounev, Samuel Juan-Verdejo, Adrian Surajbali, Bholanathsingh CAS Software A.G CAS-Weg 1-5 Karlsruhe Germany Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (纸本)9789898565563

Modern Infrastructure-as-a-Service (IaaS) provides flexible access to data center resources on demand in an elastic fashion to meet the highly variable workload requirements of cloud applications. Cloud providers aim to provision resources as efficiently and as quickly as possible to their consumers. However, the lack of information about the hosted applications and their workloads makes it hard for cloud providers to anticipate the future resource demands of their customers so that they can plan the capacity of their infrastructure. Cloud providers can receive arbitrary requests for allocating resources on-the-fly in a completely unpredictable manner. Given this unpredictability, it may happen that providers might not be able to provision the requested resources quickly enough, or in the worst case, they might ran out of capacity and may not be able to satisfy their customers resource demands. To address these concerns, in this paper we propose a new resource reservation mechanism, based on the concept of soft reservations, addressing the issue of uncertainty and lack of information concerning the expected future customer workloads and corresponding resource demands. The proposed resource reservation mechanism makes it possible for cloud providers to better plan the capacity of their infrastructure and continuously optimize the placement of virtual machines on physical nodes thus improving the infrastructure cost and energy efficiency. It also takes into account the uncertainty of resource demand estimations and enables proactive online capacity planning resulting in cost benefits for both cloud providers and cloud customers.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Stochastic performance analysis and capacity planning of publish/subscribe systems 10

Stochastic performance analysis and capacity planning of pub...

引用

4th ACM International Conference on Distributed Event-Based Systems, DEBS 2010

作者： Schröter, Arnd Mühl, Gero Kounev, Samuel Parzyjegla, Helge Richling, Jan Communication and Operating Systems Group Berlin University of Technology Germany Architecture of Application Systems University of Rostock Germany Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Germany

ISBN: (纸本)9781605589275

Publish/subscribe systems are used increasingly often as a communication mechanism in loosely-coupled distributed applications. With their gradual adoption in mission critical areas, it is essential that systems are subjected to a rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a set of generalized and comprehensive analytical models of publish/subscribe systems employing different peer-to-peer and hierarchical routing schemes. The proposed analytical models address the major limitations underlying existing work in this area and are the first to consider all major performance-relevant system metrics including the expected broker and link utilization, the expected notification delay, the expected time required for new subscriptions to become fully active, as well as the expected routing table sizes and message rates. To illustrate our approach and demonstrate its effectiveness and practicality, we present a case study showing how our models can be exploited for capacity planning and performance prediction in a realistic scenario. © 2010 ACM.

关键词： Analytical models

来源：评论

学校读者我要写书评

暂无评论

Evolving Cooperation through Reciprocity Using a Centrality-Based Reputation System

Evolving Cooperation through Reciprocity Using a Centrality-...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Christian Hutter Raphael Lorch Klemens Bohm Institute for Program Structures and Data Organization Karlsruhe Institute of Technology Germany

Reciprocity is the basis for cooperation between agents in settings without payments. Research has shown that cooperation through reciprocity can emerge if reputation information is available. Various reputation mechanisms have been proposed, which are either not efficient or vulnerable to errors in perception. We propose a reputation mechanism based on centrality, which outperforms existing mechanisms in terms of efficiency and robustness. To evaluate our approach, we first conduct numerical simulations where we analyze different centrality measures. We then use the `winning' measure in a behavioral experiment to evaluate its effectiveness with real users. Our results are that distance-based centrality measures are most suitable for multi-agent systems. Furthermore, humans adopt strategies based on centrality for sending requests, but not for processing them.

关键词： Measurement Games Robustness History Stability analysis Humans Multiagent systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：