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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是121-130 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

A Turing machine resisting isolated bursts of faults

A Turing machine resisting isolated bursts of faults

引用

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

作者： Çapuni, Ilir Gács, Peter Boston University Department of Computer Science 111 Cummington str Boston MA 02215 United States

ISBN: (纸本)9783642276590

We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound β on the size of bursts of faults, we construct a Turing machine M(β) subject to faults that can simulate any fault-free machine under the condition that bursts not closer to each other than V for an appropriate V = O(β). © 2012 Springer-Verlag.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

the interaction between organizational subcultures and user-centered design - A case study of an implementation effort 35

The interaction between organizational subcultures and user-...

引用

35th Annual Hawaii International conference on System sciences, HICSS 2002

作者： Iivari, N. Abrahamsson, P. University of Oulu Department of Information Processing Science P.O. Box 3000 OuluFIN-90014 Finland

ISBN: (纸本)0769514359

Usability is a quality characteristic of a software product or system. User-centered design (UCD) is an approach focusing on making systems usable. However, improving the position of UCD is widely recognized as a challenge. this paper reports results from a case study, in which a small software development company was introduced to UCD principles and activities, and thus expected to change their current practice. the paper takes a culture-oriented approach to the analysis. the focus is on the interaction between organizational culture and UCD, organizational culture being conceived as a set of subcultures. the results indicate that there exist differences: 1) in the views of the nature of UCD;2) in the motives for implementing it;and 3) in the experiences gained and interpretations made of the use of it in relation to each subculture. the implications for the prospective research and practice are discussed. © 2002 IEEE.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

Relaxed Clustered Hawkes Process for Procrastination Modeling in MOOCs 35

Relaxed Clustered Hawkes Process for Procrastination Modelin...

引用

35th AAAI conference on Artificial Intelligence / 33rd conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence

作者： Yao, Mengfan Zhao, Siqian Sahebi, Shaghayegh Behnagh, Reza Feyzi SUNY Albany Dept Comp Sci Albany NY 12222 USA SUNY Albany Dept Educ Theory & Practice Albany NY 12222 USA

ISBN: (纸本)9781577358664

Hawkes processes have been shown to be efficient in modeling bursty sequences in a variety of applications, such as finance and social network activity analysis. Traditionally, these models parameterize each process independently and assume that the history of each point process can be fully observed. Such models could however be inefficient or even prohibited in certain real-world applications, such as in the field of education, where such assumptions are violated. Motivated by the problem of detecting and predicting student procrastination in students Massive Open Online Courses (MOOCs) with missing and partially observed data, in this work, we propose a novel personalized Hawkes process model (RCHawkes-Gamma) that discovers meaningful student behavior clusters by jointly learning all partially observed processes simultaneously, without relying on auxiliary features. Our experiments on both synthetic and real-world education datasets show that RCHawkes-Gamma can effectively recover student clusters and their temporal procrastination dynamics, resulting in better predictive performance of future student activities. Our further analyses of the learned parameters and their association with student delays show that the discovered student clusters unveil meaningful representations of various procrastination behaviors in students.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2001: theory and practice of Informatics 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Leszek Pacholski Peter Ružička

ISBN: (数字)9783540456278

ISBN: (纸本)9783540429128

SOFSEM 2001, the International conference on current trends in theory and practice of Informatics, was held on November 24 – December 1, 2001 in the ? well-known spa Pie?stany, Slovak Republic. this was the 28th annual conference in the SOFSEM series organized either in the Slovak or the Czech Republic. SOFSEM has a well-established tradition. currently it is a broad, multid- ciplinary conference, devoted to the theory and practice of software systems. Its aim is to foster cooperation among professionals from academia and industry working in various areas of informatics. the scienti?c program of SOFSEM consists of invited talks, which determine the topics of the conference, and short contributed talks presenting original - sults. the topics of the invited talks are chosen so as to cover the whole range from theory to practice and to bring interesting research areas to the attention of conference participants. For the year 2001, the following three directions were chosen for presentation by the SOFSEM Steering Committee: – trends in Informatics – Enabling Technologies for Global Computing – Practical Systems Engineering and Applications the above directions were covered through 12 invited talks presented by pro- nent researchers. there were 18 contributed talks, selected by the international Program Committee from among 46 submitted papers. the conference was also accompanied by workshops on Electronic Commerce Systems (coordinated by H. D. Zimmermann) and Soft Computing (coordinated by P. H´ajek).

关键词： Software Engineering/Programming and Operating Systems theory of Computation computer Communication Networks Artificial Intelligence Mathematics of Computing Information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

Geometrie rates of approximation by neural networks

Geometrie rates of approximation by neural networks

引用

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

作者： Kůrková, Věra Sanguineti, Marcello Institute of Computer Science Academy of Sciences of the Czech Republic Pod Vodárenskou věží 2 Prague 8 Czech Republic University of Genova Via Opera Pia 13 16145 Genova Italy

ISBN: (纸本)354077565X

Model complexity of feedforward neural networks is studied in terms of rates of variable-basis approximation. Sets of functions, for which the errors in approximation by neural networks with n hidden units converge to zero geometrically fast with increasing number n, are described. However, the geometric speed of convergence depends on parameters, which are specific for each function to be approximated. the results are illustrated by examples of estimates of such parameters for functions in infinite-dimensional Hulbert spaces. © Springer-Verlag Berlin Heidelberg 2008.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

An Exact Algorithm to Check the Existence of (Elementary) Pa...

引用

39th conference on current trends in theory and practice of computer science (SOFSEM)

作者： Kante, Mamadou Moustapha Laforest, Christian Momege, Benjamin Univ Blaise Pascal Clermont Univ LIMOS CNRS Clermont Ferrand France

ISBN: (纸本)9783642358432

A graph with forbidden transitions is a pair (G, F-G) where G := (V-G, E-G) is a graph and FG is a subset of the set {({y, x}, {x, z}) epsilon E-G(2)}. A path in a graph with forbidden transitions (G, F-G) is a path in G such that each pair ({y, x}, {x, z}) of consecutive edges does not belong to FG. It is shown in [S. Szeider, Finding paths in graphs avoiding forbidden transitions, DAM 126] that the problem of deciding the existence of a path between two vertices in a graph with forbidden transitions is Np-complete. We give an exact exponential time algorithm that decides in time O(2(n) center dot n(5) center dot log(n)) whether there exists a path between two vertices of a given n-vertex graph with forbidden transitions. We also investigate a natural extension of the minimum cut problem: we give a polynomial time algorithm that computes a set of forbidden transitions of minimum size that disconnects two given vertices (while in a minimum cut problem we are seeking for a minimum number of edges that disconnect the two vertices). the polynomial time algorithm for that second problem is obtained via a reduction to a standard minimum cut problem in an associated allowed line graph.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

On the Complexity of Color-Avoiding Site and Bond Percolation 45th

On the Complexity of Color-Avoiding Site and Bond Percolatio...

引用

45th International conference on current trends in theory and practice of computer science (SOFSEM)

作者： Molontay, Roland Varga, Kitti Budapest Univ Technol & Econ Dept Stochast Budapest Hungary MTA BME Stochast Res Grp Budapest Hungary Budapest Univ Technol & Econ Dept Comp Sci & Informat Theory Budapest Hungary

ISBN: (纸本)9783030108014;9783030108007

the mathematical analysis of robustness and error-tolerance of complex networks has been in the center of research interest. On the other hand, little work has been done when the attack-tolerance of the vertices or edges are not independent but certain classes of vertices or edges share a mutual vulnerability. In this study, we consider a graph and we assign colors to the vertices or edges, where the color-classes correspond to the shared vulnerabilities. An important problem is to find robustly connected vertex sets: nodes that remain connected to each other by paths providing any type of error (i.e. erasing any vertices or edges of the given color). this is also known as color-avoiding percolation. In this paper, we study various possible modeling approaches of shared vulnerabilities, we analyze the computational complexity of finding the robustly (color-avoiding) connected components. We find that the presented approaches differ significantly regarding their complexity.

关键词： Computational complexity Color-avoiding percolation Robustly connected components Attack tolerance Shared vulnerability

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2021: theory and practice of computer science 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Tomáš Bureš Riccardo Dondi Johann Gamper Claus Pahl Giovanna Guerrini Tomasz Jurdziński Florian Sikora Prudence W.H. Wong

this book contains the invited and contributed papers selected for presentation at SOFSEM 2021, the 47th International conference on current trends in theory and practice of computer science, which was held online dur... 详细信息

ISBN: (数字)9783030677312

ISBN: (纸本)9783030677305

关键词： theory of Computation Data Structures and Information theory computer Imaging, Vision, Pattern Recognition and Graphics Software Engineering/Programming and Operating Systems Information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：