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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

238 篇 会议
18 册 图书
7 篇 期刊文献

馆藏范围

262 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

177 篇 工学
- 161 篇 计算机科学与技术...
- 72 篇 软件工程
- 21 篇 信息与通信工程
- 14 篇 电气工程
- 6 篇 控制科学与工程
- 5 篇 建筑学
- 5 篇 土木工程
- 4 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 2 篇 光学工程
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
70 篇 理学
- 54 篇 数学
- 12 篇 物理学
- 7 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 系统科学
- 2 篇 生物学
20 篇 管理学
- 11 篇 图书情报与档案管...
- 10 篇 管理科学与工程(可...
- 3 篇 工商管理
6 篇 法学
- 5 篇 社会学
- 2 篇 法学
6 篇 教育学
- 6 篇 教育学
4 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
- 3 篇 药学(可授医学、理...
1 篇 经济学
- 1 篇 应用经济学
1 篇 文学

主题

13 篇 graph theory
13 篇 artificial intel...
9 篇 discrete mathema...
8 篇 automata theory
7 篇 theory of comput...
6 篇 software enginee...
6 篇 algorithm analys...
5 篇 computer communi...
4 篇 software enginee...
4 篇 computers
4 篇 game theory
4 篇 data structures
4 篇 computer softwar...
4 篇 information stor...
3 篇 approximation al...
3 篇 turing machines
3 篇 symbolic and alg...
3 篇 information theo...
3 篇 educational inst...
3 篇 database managem...

机构

3 篇 university of be...
2 篇 department of co...
2 篇 uclic university...
2 篇 charles universi...
2 篇 rhein westfal th...
2 篇 warsaw universit...
2 篇 school of comput...
2 篇 centre for desig...
2 篇 centre for socia...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 department of in...
2 篇 department of co...
1 篇 university of ca...
1 篇 adv. digital sci...
1 篇 univ genoa dept ...
1 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 university of sc...

作者

3 篇 wagner dorothea
3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 paulusma daniel
2 篇 sanguineti marce...
2 篇 orponen pekka
2 篇 inenaga shunsuke
2 篇 kiya hironori
2 篇 fuchs janosch
2 篇 bongartz d
2 篇 rossmanith peter
2 篇 pokorný jaroslav

语言

259 篇 英文
4 篇 中文

检索条件"任意字段=35th Conference on Current Trends in Theory and Practice of Computer Science"

共 263 条记录，以下是111-120 订阅

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

详细简洁

排序：

Verifying parameterized taDOM+ lock managers 1

引用

SOFSEM 2008 - 34th conference on current trends in theory and practice of computer science

作者： Siirtola, Antti Valenta, Michal University of Oulu Department of Information Processing Science PL 3000 90014 Oulu Finland Czech Technical University in Prague Faculty of Electrical Engineering Department of Computer Science and Engineering Karlovo námesti 13 121 35 Prague 2 Czech Republic

ISBN: (数字)9783540775669

ISBN: (纸本)354077565X

taDOM* protocols are designed to provide lock-based approach to handle multiple access to XML databases. the notion of taDOM+ protocol is formalized and generalized and a formal model of taDOM+ lock manager that is parameterized in the number of transactions and in the size of database is represented. An important class of safety properties of taDOM+ lock managers were proven to be checked by examining just a small number of finite-state instances of the parameterized model. Our results were applied to prove a generalized mutual exclusion property, known as repeatable-read, of taDOM2+ and taDOM3+ lock managers by model-checking. © Springer-Verlag Berlin Heidelberg 2008.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2002: theory and practice of Informatics - 29th conference on current trends in theory and practice of Informatics, Proceedings

SOFSEM 2002: Theory and Practice of Informatics - 29th Confe...

引用

29th conference on current trends in theory and practice of Informatics, SOFSEM 2002

ISBN: (纸本)354000145X

the proceedings contain 22 papers. the topics discussed include: equivalence-checking with infinite-state systems: techniques and results;database support for multisource multiresolution scientific data;semantic annotation and indexing of news and sports videos;multimedia presentations databases;interactive indexing and retrieval of multimedia content;a model-based approach to semantic-based retrieval of visual information;Hungarian speech synthesis using a phase exact HNM approach;modelling resource transitions in constraint-based scheduling;a specification framework for real-time scheduling;string transformation for N-dimensional image compression;validation and decomposition of partially occluded images;solving conflicts of agent knowledge states in multiagent systems;specification and verification of secure business transaction systems;and the reconstruction of some 3D convex polyominoes from orthogonal projections.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Source Code Rejuvenation Is Not Refactoring

Source Code Rejuvenation Is Not Refactoring

引用

36th conference on current trends in theory and practice of computer science

作者： Pirkelbauer, Peter Dechev, Damian Stroustrup, Bjarne Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA

ISBN: (纸本)9783642112652

Programmers rely on programming idioms, design patterns, and workaround techniques to make up for missing programming language support. Evolving languages often address frequently encountered problems by adding language and library support to subsequent releases. By using new features, programmers can express their intent more directly. As new concerns, such as parallelism or security, arise, early idioms and language facilities can become serious liabilities. Modern code sometimes benefits from optimization techniques not feasible for code that uses less expressive constructs. Manual source code migration is expensive, time-consuming, and prone to errors. In this paper, we present the notion of source code rejuvenation, the automated migration of legacy code and very briefly mention the tools we use to achieve that. While refactoring improves structurally inadequate source code, source code rejuvenation leverages enhanced program language and library facilities by finding and replacing coding patterns that can be expressed through higher-level software abstractions. Raising the level of abstraction benefits software maintainability, security, and performance.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Stability of approximation algorithms for hard optimization problems 26th

Stability of approximation algorithms for hard optimization ...

引用

26th conference on current trends in theory and practice of Informatics

作者： Hromkovic, J Rhein Westfal TH Aachen Dept Comp Sci 1 D-52056 Aachen Germany

ISBN: (纸本)354066694X

To specify the set of tractable (practically solvable) computing problems is one of the few main research tasks of theoretical computer science. Because of this the investigation of the possibility or the impossibility to efficiently compute approximations of hard optimization problems becomes one of the central and most fruitful areas of recent algorithm and complexity theory. the current point of view is that optimization problems are considered to be tractable if there exist polynomial-time randomized approximation algorithms that solve them with a reasonable approximation ratio. If a optimization problem does not admit such a polynomial-time algorithm, then the problem is considered to be not tractable. the main goal of this paper is to relativize this specification of tractability. the main reason for this attempt is that we consider the requirement for the tractability to be strong because of the definition of the complexity as the "worst-case" complexity. this definition is also related to the approximation ratio of approximation algorithms and then an optimization problem is considered to be intractable because some subset of problem instances is hard. But in the practice we often have the situation that the hard problem instances do not occur. the general idea of this paper is to try to partition the set of all problem instances of a hard optimization problem into a (possibly infinite) spectrum of subclasses according to their polynomial-time approximability. Searching for a method enabling such a fine problem analysis (classification of problem instances) we introduce the concept of stability of approximation. To show that the application of this concept may lead to a "fine" characterisation of the hardness of particular problem instances we consider the traveling salesperson problem and the knapsack problem.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Advice Complexity: Quantitative Approach to A-Priori Information (Extended Abstract)

Advice Complexity: Quantitative Approach to A-Priori Informa...

引用

40th International conference on current trends in theory and practice of computer science

作者： Kralovic, Rastislav Comenius Univ Bratislava Slovakia

ISBN: (纸本)9783319042978;9783319042985

We survey recent results from different areas, studying how introducing per-instance a-priori information affects the solvability and complexity of given tasks. We mainly focus on distributed, and online computation, where some sort of hidden information plays a crucial role: in the distributed computing, typically nodes have no or only limited information about the global state of the network;in online problems, the algorithm lacks the information about the future input. the traditional approach in both areas is to study how the properties of the problem change if some partial information is available (e. g., nodes of a distributed system have sense of direction, the online algorithm has the promise that the input requests come in some specified order etc.). Recently, attempts have been made to study this information from a quantitative point of view: there is an oracle that delivers (per-instance) best-case information of a limited size, and the relationship between the amount of the additional information, and the benefit it can provide to the algorithm, is investigated. We show cases where this relationship has a form of a trade-off, and others where one or more thresholds can be identified.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Towards a smart, self-scaling cooperative web cache

Towards a smart, self-scaling cooperative web cache

引用

38th conference on current trends in theory and practice of computer science, SOFSEM 2012

作者： Černý, Tomáš Praus, Petr Jaroměřská, Slávka Matl, Luboš Donahoo, Michael J. Department of Computer Science and Engineering Czech Technical University Charles Square 13 121 35 Prague 2 Czech Republic Department of Computer Science Baylor University P.O. Box 97356 Waco TX 76798-7356 United States

ISBN: (纸本)9783642276590

the traditional client/server architecture for web service delivery fails to naturally scale. this results in growing costs to the service provider for powerful hardware or extensive use of Content Distribution Networks. A P2P overlay network provides inherent scalability with multiple benefits to both clients and servers. In this paper, we provide analysis, design and prototype implementation of Cooperative Web Cache, which allows us to scale web service delivery and cope with demand spikes by employing clients in content replication. To demonstrate performance capabilities, we provide a prototype emulation for both client and server. © 2012 Springer-Verlag.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Dynamic Replanning Algorithm of local trajectory for Unmanned Surface Vehicle 35

Dynamic Replanning Algorithm of local trajectory for Unmanne...

引用

第35届中国控制会议

作者： LIU Deli XU Dong WANG Nan ZHANG Ziying TANG Pingpeng Wuhan Second Ship Design and Research Institute College of computer science and technology Harbin Engineering University

ISBN: (纸本)9781509009107

Unmanned surface vehicle（USV） is a kind of important marine autonomous robots,which has been studied and applied to practice *** the study,the far-field collision conflict scope and marine traffic rules for USV are defined.A novel far-field region collision detection method is proposed for the collision conflict *** constraints from marine traffic rules and collision conflict are denoted by feasible candidate direction angle *** the base of sparse A,a dynamic replanning algorithm of local trajectory is proposed for dynamic obstacles avoidance of USV in the far-field *** the simulation,the validity of the algorithm is demonstrated in the experiments by different types of scenarios.

关键词： Unmanned Surface Vehicle Marine Traffic Rules Dynamic Replanning Algorithm of Local Trajectory sparse A*

来源：评论

学校读者我要写书评

暂无评论

On the approximation ratio of the group-merge algorithm for the shortest common superstring problem 27th

引用

27th International conference on current trends in theory and practice of Informatics (SOFSEM 2000)

作者： Bongartz, D Rhein Westfal TH Aachen Lehrstuhl Informat 1 D-52074 Aachen Germany

ISBN: (纸本)3540413480

the shortest common superstring problem (SCS) is one of the fundamental optimization problems in the. area of data compression and DNA sequencing. the SCS is known to be APX-hard [1]. this paper focuses on the analysis of the approximation ratio of two greedy-based approximation algorithms for it, namely the naive Greedy algorithm and the Group-Merge algorithm. the main results of this paper are: (i) We disprove the claim that the input instances of Jiang and Li (4) prove that the Group-Merge algorithm does not provide any constant approximation for the SCS. We even prove that the Group-Merge algorithm always finds optimal solutions for these instances. (ii) We show that the Greedy algorithm and the Group-Merge algorithm are incomparable according to the approximation ratio. (iii) We attack the main problem whether the Group-Merge algorithm has a constant approximation ratio by showing that this is the case for a slightly modified algorithm denoted as Group-Merge-1 if all strings have approximately the same length and the compression is limited by a constant fraction of the trivial solution.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Detectability Measure on State Estimation of Discrete Event Systems 35

Detectability Measure on State Estimation of Discrete Event ...

引用

第35届中国控制会议

作者： ZHAO Pei SHU Shaolong LIN Feng School of Electronics and Information Engineering Tongji University Department of Electrical and Computer Engineering Wayne State University

ISBN: (纸本)9781509009107

In this paper, we investigate how to quantitatively evaluate the performance of state estimation in a discrete event system. We adopt stochastic automaton to quantitatively describe a discrete event system. With the stochastic automaton, we can calculate the probability of occurrence of any event sequence. We say that an event sequence(with sufficient length) is detectable if we can determine the current state and subsequent states of the system after the occurrence of the sequence. We then define the sum of probabilities of all detectable event sequences as a quantitative state estimation indicator. this indicator is the limit when the length of sequence goes to infinite. In order to calculate the limit, we augment the discrete event system into a larger automaton which includes the information of the discrete event system and all its state estimates. the augmented automaton is also a stochastic automaton and can be converted into a Markov Chain by removing all the event labels. the calculation of the limit is then translated into the calculation of the sum of probabilities of some states in the Markov Chain, which can be done efficiently.

关键词： Detectability Discrete event systems Stochastic automaton Markov chain State estimation

来源：评论

学校读者我要写书评

暂无评论

Explaining alldifferent

Explaining alldifferent

引用

35th Australasian computer science conference, ACSC 2012

作者： Downing, Nicholas Feydy, thibaut Stuckey, Peter J. National ICT Australia University of Melbourne VIC Australia

ISBN: (纸本)9781921770036

Lazy clause generation is a powerful approach to reducing search in constraint programming. For use in a lazy clause generation solver, global constraints must be extended to explain themselves. Alternatively they can be decomposed into simpler constraints which already have explanation capability. In this paper we examine different propagation mechanisms for the alldifferent constraint, and show how they can be extended to explain themselves. We compare the different explaining implementations of alldifferent on a variety of problems to determine how explanation changes the trade-offs for propagaton. the combination of global alldifferent propagators with explnation leads to a state-of-the-art constraint programming solution to problems involving alldifferent. Copyright © 2012, Australian computer Society, Inc.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：