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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Probabilistic Parameterized Polynomial Time 1

引用

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

作者： Donselaar, Nils Radboud Univ Nijmegen Donders Inst Brain Cognit & Behav Montessorilaan 3 NL-6525 HR Nijmegen Netherlands

ISBN: (数字)9783030108014

ISBN: (纸本)9783030108014;9783030108007

We examine a parameterized complexity class for randomized computation where only the error bound and not the full runtime is allowed to depend more than polynomially on the parameter, based on a proposal by Kwisthout in [15,16]. We prove that this class, for which we propose the shorthand name PPPT, has a robust definition and is in fact equal to the intersection of the classes paraBPP and PP. this result is accompanied by a Cook-style proof of completeness for the corresponding promise class (under a suitable notion of reduction) for parameterized approximation versions of the inference problem in Bayesian networks, which is known to be PP-complete. With these definitions and results in place, we proceed by showing how it follows from this that derandomization is equivalent to efficient deterministic approximation methods for the inference problem. Furthermore, we observe as a straightforward application of a result due to Drucker in [8] that these problems cannot have polynomial size randomized kernels unless the polynomial hierarchy collapses to the third level. We conclude by indicating potential avenues for further exploration and application of this framework.

关键词： Parameterized complexity theory Randomized computation Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Risk Analysis for Trust and Reputation Systems

Asymptotic Risk Analysis for Trust and Reputation Systems

引用

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

作者： Boreale, Michele Celestini, Alessandro Univ Florence I-50121 Florence Italy IMT Inst Adv Studies Lucca Piazza S Ponziano 6 I-55100 Lucca Italy

ISBN: (纸本)9783642358432

Trust and reputation systems are decision support tools used to drive parties' interactions on the basis of parties' reputation. In such systems, parties rate with each other after each interaction. Reputation scores for each ratee are computed via reputation functions on the basis of collected ratings. We propose a general framework based on Bayesian decision theory for the assessment of such systems, with respect to the number of available ratings. Given a reputation function g and n independent ratings, one is interested in the value of the loss a user may incur by relying on the ratee's reputation as computed by the system. To this purpose, we study the behaviour of both Bayes and frequentist risk of reputation functions with respect to the number of available observations. We provide results that characterise the asymptotic behaviour of these two risks, describing their limits values and the exact exponential rate of convergence. One result of this analysis is that decision functions based on Maximum-Likelihood are asymptotically optimal. We also illustrate these results through a set of numerical simulations.

关键词： trust reputation information theory Bayesian decision 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

来源：评论

学校读者我要写书评

暂无评论

Destructive Rule-Based Properties and First-Order Logic

Destructive Rule-Based Properties and First-Order Logic

引用

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

作者： Duris, David Univ Paris 07 Equipe Log Math F-75221 Paris 05 France

ISBN: (纸本)9783642112652

We study properties characterized by applying successively a "destructive" rule expressed in first-order logic. the rule says that Points, a(1),...,a(k) of a structure can be removed if they satisfy a certain first-order formula. phi(a(1),...,a(k)). the property defined this way by the formula is the set of finite structures such that we are able to obtain the empty structure when applying the rule repeatedly. Many classical properties can be formulated by means of a. "destructive" rule. We do a systematic study of the computational complexity of these properties according to the fragment of first-order logic in which the rule is expressed. We give the list of minimal fragments able to define NP-complete properties and maximal fragments that define only PTIME properties (unless PTIME = NP), depending on the number k of free variables and the quantifier symbols used in the formula. We also study more specifically the case where the formula has one free variable and is universal.

关键词： Finite model theory definability complexity model checking destructive rule

来源：评论

学校读者我要写书评

暂无评论

Quantum finite one-counter automata 26th

Quantum finite one-counter automata

引用

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

作者： Kravtsev, M Latvian State Univ Dept Comp Sci Riga Latvia

ISBN: (纸本)354066694X

In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. the well-formedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. that allows specify rules for constructing such automata more naturally and simpler than in general case. Possible models of language recognition by QF1CA are considered. the recognition of some languages by QF1CA is shown and compared with recognition by probabilistic counterparts.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

the HyperBagGraph DataEdron: An Enriched Browsing Experience of Datasets Track: Foundation of Data science and Engineering 46th

The HyperBagGraph DataEdron: An Enriched Browsing Experience...

引用

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

作者： Ouvrard, Xavier Le Goff, Jean-Marie Marchand-Maillet, Stephane CERN 1 Esplanade Particules Meyrin Switzerland Univ Geneva Carouge Switzerland

ISBN: (纸本)9783030389192;9783030389185

Traditional verbatim browsers give back information linearly according to a ranking performed by a search engine that may not be optimal for the surfer. the latter may need to assess the pertinence of the information retrieved, particularly when s center dot he wants to explore other facets of a multi-facetted information space. Simultaneous facet visualisation can help to gain insights into the information retrieved and call for further refined searches. Facets are potentially heterogeneous co-occurrence networks, built choosing at least one reference type, and modeled by HyperBag-Graphs-families of multisets on a given universe. References allow to navigate inside the dataset and perform visual queries. the approach is illustrated on Arxiv scientific pre-prints searches.

关键词： Hyper-Bag-Graphs Knowledge discovery Visual queries Information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Building a bridge between mirror neurons and theory of embodied cognition

引用

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

作者： Wiedermann, J Acad Sci Czech Republ Inst Comp Sci Prague 18207 8 Czech Republic

ISBN: (纸本)3540207791

Mirror neurons are specialized neurons recently discovered in the brains of primates. In experiments mirror neurons showed activity both when a subject performed an action and when it observed the same action performed by self or another (possibly conspecific) subject. We formulate and study possible computational consequences of the hypothesis in which the experimentally observed properties of mirror neurons are generalized to other perceptive modalities and the underlying mechanism for coupling sensory and motor information is extended by an associative mechanism serving for completion of cross-modal information composed of perception and motor information. Depending on of what kind of information is completed, the hypothesis opens the door for understanding the mechanisms for sensorimotor coordination, imitation learning, and thinking and is inspiring for the design of such mechanisms in the case of artificial agents. Our results justify the hopes generally related to the discovery of mirror neurons.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：