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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

235 篇 会议
17 册 图书
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

171 篇 工学
- 160 篇 计算机科学与技术...
- 64 篇 软件工程
- 17 篇 电气工程
- 17 篇 信息与通信工程
- 6 篇 控制科学与工程
- 5 篇 机械工程
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
- 3 篇 建筑学
- 3 篇 土木工程
- 3 篇 交通运输工程
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
71 篇 理学
- 56 篇 数学
- 12 篇 物理学
- 7 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 生物学
- 4 篇 系统科学
19 篇 管理学
- 11 篇 图书情报与档案管...
- 10 篇 管理科学与工程(可...
- 6 篇 工商管理
6 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
- 3 篇 公共卫生与预防医...
- 3 篇 药学(可授医学、理...
5 篇 法学
- 5 篇 社会学
4 篇 教育学
- 4 篇 教育学
1 篇 经济学
1 篇 文学

主题

16 篇 graph theory
11 篇 artificial intel...
8 篇 discrete mathema...
8 篇 automata theory
6 篇 theory of comput...
6 篇 computer communi...
6 篇 algorithm analys...
5 篇 software enginee...
5 篇 information stor...
4 篇 software enginee...
4 篇 database managem...
4 篇 computers
4 篇 data structures
4 篇 information retr...
3 篇 computer science
3 篇 approximation al...
3 篇 computational co...
3 篇 turing machines
3 篇 set theory
3 篇 logic programmin...

机构

3 篇 university of be...
2 篇 katholieke univ ...
2 篇 department of co...
2 篇 charles universi...
2 篇 rhein westfal th...
2 篇 warsaw universit...
2 篇 vrije univ bruss...
2 篇 university of ch...
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 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 univ nacl pedro ...
1 篇 weizmann inst sc...
1 篇 univ kassel fach...
1 篇 univ wroclaw ins...

作者

3 篇 wagner dorothea
3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
3 篇 černá ivana
2 篇 peleg david
2 篇 bieliková mária
2 篇 bogaerts b. a. r...
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 paulusma daniel
2 篇 inenaga shunsuke
2 篇 denecker m. a. r...
2 篇 kiya hironori
2 篇 fuchs janosch
2 篇 bongartz d
2 篇 donahoo michael ...

语言

255 篇 英文
4 篇 中文
1 篇 其他

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

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

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

详细简洁

排序：

Automatic Bug Detection in Microcontroller Software by Static Program Analysis

Automatic Bug Detection in Microcontroller Software by Stati...

引用

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

作者： Fehnker, Ansgar Huuck, Ralf Schlich, Bastian Tapp, Michael Univ New South Wales NICTA Ltd Locked Bag 6016 Sydney NSW 1466 Australia Rhein Westfal TH Aachen Embedded Software Lab Aachen Germany

ISBN: (纸本)9783540958901

Microcontroller software typically consists of a few hundred lines of code only, but, it is rather different from standard application code.. the software is highly hardware and platform specific, and bugs are often a consequence of neglecting subtle specifications of the microcontroller architecture. currently, there are hardly any tools for analyzing such software automatically. Tu this paper, we outline Specifies of microcontroller software that explain why those programs are different to standard C/C++ code. We develop a static program analysis for a specific microcontroller, in our case the ATmega16, to spot code deficiencies, and integrate it into our generic static analyzer Comma. Finally, we illustrate the results by a case study of an automotive application. the case study highlights that even without formal proof the proposed static techniques can be valuable in pinpointing software bugs that are otherwise hard to find.

关键词： Microcontrollers

来源：评论

学校读者我要写书评

暂无评论

A Set-membership Smoother for State Estimation in Disturbances of Unknown Distribution 36

A Set-membership Smoother for State Estimation in Disturbanc...

引用

第36届中国控制会议

作者： Jieyu Liu Qiang Shen John R.Deller Xi'an Research Institute of High-Tech Department of Electrical and Computer Engineering Michigan State University

ISBN: (纸本)9781538629185

A novel set-membersbip-based smoothing method for state estimation using the optimal bounding ellipsoid（OBE）algorithms is *** filters have been proven to be effective in state estimation problems with unknown but bounded *** with filtering methods,smoothing methods provide a much more accurate and reliable state estimate because observations beyond the current estimation time are *** new method is a Rauch-Tung-Striebel（RTS）-type smoother which employs both forward and backward passes to estimate the system *** forward pass is performed using the OBE filter,while the backward pass maintains the fundamental spirit of OBE algorithm in the backward *** minimum-volume and minimum-trace bounding ellipsoids containing the feasible state set are derived from this *** results show the performance of the proposed smoother is superior to both the traditional OBE filter and Kalman filter for state estimation.

关键词： smoother state estimation filter set-membership optimal bounding ellipsoid(OBE)

来源：评论

学校读者我要写书评

暂无评论

Computing longest common substring and all palindromes from compressed strings 1

引用

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

作者： Matsubara, Wataru Inenaga, Shunsuke Ishino, Akira Shinohara, Ayumi Nakamura, Tomoyuki Hashimoto, Kazuo Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 980 Japan Kyushu Univ Dept Comp Sci & Commun Fukuoka 812 Japan

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

this paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the length of the longest common substring of two given SLP-compressed strings, and the other is to compute all palindromes of a given SLP-compressed string. In order to solve these problems efficiently (in polynomial time w.r.t. the compressed size) decompression is never feasible, since the decompressed size can be exponentially large. We develop combinatorial algorithms that solve these problems in O(n(4) log n) time with O(n(3)) space, and in O(n(4)) time with O(n(2)) space, respectively, where n is the size of the input SLP-compressed strings.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

the kernel interaction trick: Fast Bayesian discovery of pairwise interactions in high dimensions 36

The kernel interaction trick: Fast Bayesian discovery of pai...

引用

36th International conference on Machine Learning, ICML 2019

作者： Agrawal, Raj Huggins, Jonathan H. Trippe, Brian L. Broderick, Taniara Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology CambridgeMA United States Department of Biostatistics Harvard CambridgeMA United States

ISBN: (纸本)9781510886988

Discovering interaction effects on a response of interest is a fundamental problem faced in biology, medicine, economics, and many other scientific disciplines. In theory, Bayesian methods for discovering pairwise interactions enjoy many benefits such as coherent uncertainty quantification, the ability to incorporate background knowledge, and desirable shrinkage properties. In practice, however, Bayesian methods are often computationally intractable for even moderate-dimensional problems. Our key insight is that many hierarchical models of practical interest admit a particular Gaussian process (GP) representation;the GP allows us to capture the posterior with a vector of O(p) kernel hyper-parameters rather than O(p2) interactions and main effects. With the implicit representation, we can run Markov chain Monte Carlo (MCMC) over model hyper-parameters in time and memory linear in p per iteration. We focus on sparsity-inducing models and show on datasets with a variety of covariate behaviors that our method: (1) reduces runtime by orders of magnitude over naive applications of MCMC, (2) provides lower Type I and Type II error relative to state-of-the-art LASSO-based approaches, and (3) offers improved computational scaling in high dimensions relative to existing Bayesian and LASSO-based approaches. © 36th International conference on Machine Learning, ICML 2019. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

SOFSEM'97: theory and practice of Informatics 1

引用

丛书名： Lecture Notes in computer science

1000年

ISBN: (数字)9783540696452

ISBN: (纸本)9783540637745

this book constitutes the refereed proceedings of the 24th Seminar on current trends in theory and practice of Informatics, SOFSEM'97, held in Milovy, Czech Republic, in November 1997. SOFSEM is special in being a mix of a winter school, an international conference, and an advanced workshop meeting the demand for ongoing education in the area of computer science. the volume presents 22 invited contributions by leading experts together with 24 revised contributed papers selected from 63 submissions. the invited presentations are organized in topical sections on foundations, distributed and parallel computing, software engineering and methodology, and databases and information systems.

关键词： theory of Computation Software Engineering/Programming and Operating Systems Database Management Discrete Mathematics in computer science Numeric Computing

来源：评论

学校读者我要写书评

暂无评论

Some notes on the complexity of protein similarity search under mRNA structure constraints

引用

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

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

ISBN: (纸本)3540207791

In [2], Backofen et al. propose the MRSO problem, that is to compute an mRNA sequence of maximal similarity to a given rnRNA and a given protein, that additionally satisfies some secondary structure constraints. the study of this problem is motivated by an application in the area of protein engineering. Modeled in a mathematical framework, we would like to compute a string s is an element of {a, b, (a) over bar, (b) over bar}(3n) which maximizes the sum of the values of n functions, which are blockwise applied to triples of s, and additionally satisfies some complementary constraints on the characters of s given in terms of position pairs. While the decision version of this problem is known to be NP-complete (see [2]), we prove here the APX-hardness of the general as well as of a restricted version of the problem. Moreover, we attack the problem by proposing a 4-approximation algorithm.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Parameterized Algorithms for Covering by Arithmetic Progressions 49th

Parameterized Algorithms for Covering by Arithmetic Progress...

引用

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

作者： Bliznets, Ivan Nederlof, Jesper Szilagyi, Krisztina Univ Groningen Groningen Netherlands Univ Utrecht Utrecht Netherlands

ISBN: (纸本)9783031521126;9783031521133

An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two problems related to arithmetic progressions, called COVER BY ARIthMETIC PROGRESSIONS (CAP) and EXACT COVER BY ARIthMETIC PROGRESSIONS (XCAP). In both problems, we are given a set X consisting of n integers along with an integer k, and our goal is to find k arithmetic progressions whose union is X. In XCAP we additionally require the arithmetic progressions to be disjoint. Both problems were shown to be NP-complete by Heath [IPL'90]. We present a 2(O(k2)) poly(n) time algorithm for CAP and a 2(O(k3)) poly(n) time algorithm for XCAP. We also give a fixed parameter tractable algorithm for CAP parameterized below some guaranteed solution size. We complement these findings by proving that CAP is Strongly NP-complete in the field Z(p), if p is a prime number part of the input.

关键词： Arithmetic Progressions Set Cover Parameterized Complexity Number theory

来源：评论

学校读者我要写书评

暂无评论

the Equational theory of Weak Complete Simulation Semantics over BCCSP

The Equational Theory of Weak Complete Simulation Semantics ...

引用

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

作者： Aceto, Luca de Frutos-Escrig, David Gregorio-Rodriguez, Carlos Ingolfsdottir, Anna Reykjavik Univ Sch Comp Sci ICE TCS Reykjavik Iceland Univ Complutense Madrid Dept Sist Informat Comp Madrid Spain Reykjavik Univ Abel Extraordinary Chair Reykjavik Iceland

ISBN: (纸本)9783642276590;9783642276606

this paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak complete simulation pre-congruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equational theory of the weak complete simulation precongruence over BCCSP does not have a finite (in)equational basis. In fact, the set of (in)equations in at most one variable that hold in weak complete simulation semantics over BCCSP does not have an (in)equational basis of 'bounded depth', let alone a finite one.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Deterministic Rendezvous on the Line

Asynchronous Deterministic Rendezvous on the Line

引用

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

作者： Stachowiak, Grzegorz Univ Wroclaw Inst Comp Sci PL-50383 Wroclaw Poland

ISBN: (纸本)9783540958901

We study the rendezvous problem in the asynchronous setting in the graph of infinite line following the model introduced in [13]. We formulate general lemmas about deterministic rendezvous algorithms in this setting which characterize the algorithms in which the agents have the shortest routes. We also improve rendezvous algorithms in the infinite line which formulated in [13]. Two agents have distinct labels L-min, L-max and vertical bar L-min vertical bar <= vertical bar L-max vertical bar. When the initial distance D between the agents is known, our algorithm has cost D vertical bar L-min vertical bar(2) which is ail improvement in the constant. If the initial distance is unknown we give an algorithm of cost O(D log(2) D + D log D vertical bar L-max vertical bar + D vertical bar L-min vertical bar(2) + vertical bar L-max vertical bar vertical bar L-min vertical bar log vertical bar L-min vertical bar) which is an asymptotic improvement.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Finding Disjoint Paths in Split Graphs

Finding Disjoint Paths in Split Graphs

引用

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

作者： Heggernes, Pinar van 't Hof, Pim van Leeuwen, Erik Jan Saei, Reza Univ Bergen Dept Informat N-5020 Bergen Norway MPI Informatik Saarbucken Germany

ISBN: (纸本)9783319042978;9783319042985

the well-known Disjoint Paths problem takes as input a graph G and a set of k pairs of terminals in G, and the task is to decide whether there exists a collection of k pairwise vertex-disjoint paths in G such that the vertices in each terminal pair are connected to each other by one of the paths. this problem is known to NP-complete, even when restricted to planar graphs or interval graphs. Moreover, although the problem is fixed-parameter tractable when parameterized by k due to a celebrated result by Robertson and Seymour, it is known not to admit a polynomial kernel unless NP subset of coNP/poly. We prove that Disjoint Paths remains NP-complete on split graphs, and show that the problem admits a kernel with O(k(2)) vertices when restricted to this graph class. We furthermore prove that, on split graphs, the edge-disjoint variant of the problem is also NP-complete and admits a kernel with O(k(3)) vertices. To the best of our knowledge, our kernelization results are the first non-trivial kernelization results for these problems on graph classes.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：