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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

188 篇 会议
15 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

141 篇 工学
- 135 篇 计算机科学与技术...
- 51 篇 软件工程
- 21 篇 信息与通信工程
- 15 篇 电气工程
- 9 篇 控制科学与工程
- 6 篇 网络空间安全
- 4 篇 化学工程与技术
- 3 篇 建筑学
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
- 2 篇 生物医学工程（可授...
- 1 篇 光学工程
56 篇 理学
- 44 篇 数学
- 9 篇 物理学
- 5 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
18 篇 管理学
- 16 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 2 篇 工商管理
3 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 教育学
- 3 篇 教育学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 药学(可授医学、理...
1 篇 文学
- 1 篇 新闻传播学

主题

13 篇 graph theory
9 篇 artificial intel...
8 篇 automata theory
7 篇 discrete mathema...
6 篇 theory of comput...
6 篇 computers
5 篇 computer communi...
4 篇 software enginee...
4 篇 software enginee...
4 篇 algorithm analys...
4 篇 information stor...
3 篇 turing machines
3 篇 database managem...
3 篇 game theory
3 篇 complexity theor...
3 篇 software
3 篇 computer program...
3 篇 information retr...
2 篇 data storage rep...
2 篇 computer science

机构

3 篇 university of be...
2 篇 department of co...
2 篇 charles universi...
2 篇 department of co...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 dept. of compute...
2 篇 school of comput...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 university of am...
2 篇 department of in...
2 篇 central universi...
2 篇 department of co...
2 篇 school of comput...
1 篇 university of ca...
1 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 ist austria klos...

作者

3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 zhaoquan gu
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 shaohua wang
2 篇 paulusma daniel
2 篇 inenaga shunsuke
2 篇 xinchen wang
2 篇 kiya hironori
2 篇 rossmanith peter
2 篇 wiedermann jiri
2 篇 pokorný jaroslav
2 篇 iliopoulos costa...

语言

206 篇 英文
4 篇 中文

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

共 210 条记录，以下是101-110 订阅

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

详细简洁

排序：

SOFSEM 2009: theory and practice of computer science 2009

引用

丛书名： Lecture Notes in computer science

2009年

作者： Mogens Nielsen Antonin Kucera Peter Bro Miltersen Catuscia Palamidessi Petr Tuma Frank Valencia

ISBN: (数字)9783540958918

ISBN: (纸本)9783540958901

this book constitutes the refereed proceedings of the 35th conference on current trends in theory and practice of computer science, SOFSEM 2009, held in pindleruv Mln, Czech Republic, in January 2009. the 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of computer science; theory and practice of Software Services; Game theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the approximability of interactive knapsack problems 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Aho, Isto Dept. of Computer and Information Sciences University of Tampere 33014 Finland

We show that the interactive knapsack heuristic optimization problem is APX-hard. Moreover, we discuss the relationship between the interactive knapsack heuristic optimization problem and some other knapsack problems.... 详细信息

ISBN: (纸本)9783540429128

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Support ECN in Multi-Queue Datacenter Networks via per-Port Marking with Selective Blindness 38

Support ECN in Multi-Queue Datacenter Networks via per-Port ...

引用

38th IEEE International conference on Distributed Computing Systems (ICDCS)

作者： Pan, Yawen Tian, Chen Zheng, Jiaqi Zhang, Gong Susanto, Hengky Bai, Bo Chen, Guihai Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China Huawei Future Network Theory Lab Hong Kong Peoples R China

ISBN: (纸本)9781538668719

ECN is a powerful tool that can achieve low latency and high throughput simultaneously. Support ECN for multi-queue scenarios is an industry trend in datacenter networks. However, ECN schemes developed for per-port marking cannot be applied directly to the multi-queue scenarios. It hurts at least one metric among latency, throughput, and the scheduling policy. State-of-the-art multi-queue ECN marking schemes each has its own limitations. In this paper, we present per-Port Marking with Selective Blindness (PMSB). the intuition is that: if a flow is found to be a victim of per-port marking, we can either revoke the marking or cancel the flow back-off even if its packets qualify the per-port threshold (i.e., selective blindness). By breaking the fixed causal relationship between ECN marking and flow back-off, flows from un-congested queues can be protected. We evaluate PMSB with large-scale NS-3 simulations. Our results demonstrate that PMSB can preserve a given scheduling policy. Compared with the current practice, PMSB can reduce the average/99% completion time for small flows by 64.49%172.89% respectively while delivering a slightly better performance for large flows.

关键词： throughput Standards Blindness Job shop scheduling Measurement Data centers Acceleration

来源：评论

学校读者我要写书评

暂无评论

Media supported workspaces in agile software development: Doctoral symposium paper 38

Media supported workspaces in agile software development: Do...

引用

38th Annual IEEE computer Software and Applications conference, COMPSAC 2014

作者： Raith, Florian Lindermeier, Robert Dept. of Computer Science Technical University of Munich Munich Germany Dept. of Computer Science and Mathematics University of Applied Sciences Munich Munich Germany

ISBN: (纸本)9781479935741

the use of software tools has become a common practice in global software engineering to handle requirements and to exchange project status amongst distributed teams and stakeholders. In context of agile software development the replacement of paper-based media (e.g. Task Board) with software tools results in heavily decreased collaboration and transparency within agile teams. Since the number of agile projects in global context increases, it is necessary to find an adequate solution to share project status without influencing the underlying agile process in a negative way. the proposed research project investigates why the replacement of paper-based media has such strong influence on group work in agile teams. thereby, the focus of research is on the agile Task Board as the most important example for paper-based media of agile workspaces. With help of these findings we will develop a conceptual and technical solution, based on optical tracking of a paper-based Task Board, to share project status amongst stakeholders. the paper introduces the current state of the art, corresponding research questions, the entire research methods and current progress of our research. © 2014 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Untangling a planar graph 1

引用

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

作者： Spillner, Andreas Wolff, Alexander Univ E Anglia Sch Comp Sci Norwich Norfolk England Fact Wiskunde Informat Eindhoven Netherlands

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

In John Tantalo's on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. the aim is to make the drawing plane as quickly as possible by moving vertices. Pach and Tardos have posed a related problem: can any straight-line drawing of any planar graph with n vertices be made plane by vertex moves while keeping Omega(n(epsilon)) vertices fixed for some absolute constant epsilon > 0? It is known that three vertices can always be kept (if n > 5). We still do not solve the problem of Pach and Tardos, but we report some progress. We prove that the number of vertices that can be kept actually grows with the size of the graph. More specifically, we give a lower bound of Omega(root log n/ log log n) on this number. By the same technique we show that in the case of outerplanar graphs we can keep a lot more, namely Omega(root n) vertices. We also construct a family of outerplanar graphs for which this bound is asymptotically tight.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Living labs for online evaluation: From theory to practice 38th

Living labs for online evaluation: From theory to practice

引用

38th European conference on Information Retrieval Research, ECIR 2016

作者： Schuth, Anne Balog, Krisztian University of Amsterdam Amsterdam Netherlands University of Stavanger Stavanger Norway

ISBN: (纸本)9783319306704

Experimental evaluation has always been central to Information Retrieval research. the field is increasingly moving towards online evaluation, which involves experimenting with real, unsuspecting users in their natural task environments, a so-called living lab. Specifically, with the recent introduction of the Living Labs for IR Evaluation initiative at CLEF and the OpenSearch track at TREC, researchers can now have direct access to such labs. With these benchmarking platforms in place, we believe that online evaluation will be an exciting area to work on in the future. this half-day tutorial aims to provide a comprehensive overview of the underlying theory and complement it with practical guidance. © Springer International Publishing Switzerland 2016.

关键词： Laboratories

来源：评论

学校读者我要写书评

暂无评论

Archetypes based meta-modeling towards evolutionary, dependable and interoperable healthcare information systems 5

Archetypes based meta-modeling towards evolutionary, dependa...

引用

4th International conference on current and Future trends of Information and Communication Technologies in Healthcare (ICth)

作者： Piho, Gunnar Tepandi, Jaak thompson, Douglas Tammer, Triinu Parman, Marko Puusep, Viljam Univ Leeds Clin & Biomed Prote Grp Beckett St Leeds LS9 7TF W Yorkshire England Tallinn Univ Technol Dept Informat EE-12618 Tallinn Estonia

Information systems have to work correctly and securely as expected (dependability);have to be able to communicate and understand each other's data (interoperability);and have to be able to change in an evolutionary way similarly to how the organizations and their business processes are changing (evolutionary). To write software we must know the requirements;to prescribe the requirements we have to understand the domain;to understand the domain we have to analyze and model one. the domain or application domain (e.g. banking, healthcare, clinical laboratory and etc.) can be anything to which computing can be applied. In analyzing and modeling domains we use archetypes and archetype patterns as meta-models. We explain what the archetypes and archetype patterns are and how we utilize them in the development of domain models, requirements, and software in order to meet the dependability, interoperability and evolutionary criteria. Crown Copyright (C) 2014 Published by Elsevier B. V. this is an open access article under the CC BY-NC-ND license.

关键词： theory and practice of meta-modelling with application in healthcare case studies of meta-modelling in healthcare applications archetypes and archetype patterns laboratory information management systems dependability, interoperability and evolutionary criteria of information systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：