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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

983 篇 会议
37 篇 期刊文献
25 册 图书

馆藏范围

1,043 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

704 篇 工学
- 585 篇 计算机科学与技术...
- 368 篇 软件工程
- 146 篇 电气工程
- 56 篇 控制科学与工程
- 30 篇 信息与通信工程
- 27 篇 材料科学与工程（可...
- 19 篇 电子科学与技术（可...
- 16 篇 机械工程
- 11 篇 动力工程及工程热...
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 7 篇 仪器科学与技术
- 7 篇 石油与天然气工程
- 6 篇 城乡规划学
- 4 篇 核科学与技术
- 4 篇 农业工程
188 篇 理学
- 155 篇 数学
- 18 篇 系统科学
- 17 篇 物理学
- 12 篇 统计学（可授理学、...
- 10 篇 生物学
69 篇 管理学
- 53 篇 管理科学与工程(可...
- 22 篇 工商管理
- 19 篇 图书情报与档案管...
16 篇 教育学
- 16 篇 教育学
11 篇 文学
- 11 篇 新闻传播学
9 篇 法学
- 8 篇 社会学
6 篇 医学
- 4 篇 基础医学(可授医学...
4 篇 农学
- 4 篇 作物学
3 篇 经济学
- 3 篇 应用经济学
1 篇 军事学

主题

96 篇 logic gates
77 篇 programming
63 篇 logic programmin...
40 篇 fuzzy logic
35 篇 application soft...
30 篇 probabilistic lo...
29 篇 linear programmi...
27 篇 programming prof...
27 篇 computer archite...
26 篇 computer science
26 篇 dynamic programm...
23 篇 software enginee...
23 篇 protocols
21 篇 uncertainty
20 篇 object oriented ...
20 篇 java
20 篇 semantics
18 篇 computer circuit...
18 篇 costs
17 篇 software systems

机构

4 篇 univ potsdam pot...
4 篇 vienna univ tech...
4 篇 imdea software i...
4 篇 institute for lo...
3 篇 tu wien austria
3 篇 graduate school ...
3 篇 univ calabria de...
3 篇 carnegie mellon ...
3 篇 univ freiburg fr...
3 篇 univ british col...
3 篇 imperial coll lo...
3 篇 department of in...
2 篇 univ tecn federi...
2 篇 ist austria klos...
2 篇 univ savoie savo...
2 篇 tel aviv univers...
2 篇 zhongguancun lab...
2 篇 univ ferrara dip...
2 篇 south china univ...
2 篇 univ neuchatel i...

作者

8 篇 alviano mario
6 篇 lamma evelina
5 篇 schaub torsten
4 篇 riguzzi fabrizio
3 篇 lin yu
3 篇 vardi moshe y.
3 篇 gebser martin
3 篇 bellodi elena
3 篇 costa vitor sant...
3 篇 shinji sakamoto
3 篇 lakemeyer gerhar...
3 篇 ikeda markus
3 篇 zhou neng-fa
3 篇 xu hongxiang
3 篇 sabuncu orkunt
3 篇 leonard barolli
3 篇 schockaert steve...
3 篇 pichler andreas
3 篇 wang bin
3 篇 de givry simon

语言

1,013 篇 英文
25 篇 其他
8 篇 中文
1 篇 法文

检索条件"任意字段=30th International Conference on Logic Programming"

共 1045 条记录，以下是511-520 订阅

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

详细简洁

排序：

One-dimensional logic over words 25

One-dimensional logic over words

引用

25th EACSL Annual conference on Computer Science logic, CSL 2016 and the 30th Workshop on Computer Science logic

作者： Kieronski, Emanuel University of Wroclaw Poland

ISBN: (纸本)9783959770224

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. We investigate one-dimensional fragment over words and over !-words. We show that it is expressively equivalent to the twovariable fragment of first-order logic. We also show that its satisfiability problem is NExpTimecomplete. Further, we show undecidability of some extensions, whose two-variable counterparts remain decidable. © Emanuel Kieronski;licensed under Creative Commons License CC-BY.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Fuzzy-Based Trust Model for Detection of Selfish Nodes in MANETs 30

Fuzzy-Based Trust Model for Detection of Selfish Nodes in MA...

引用

30th IEEE international conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Ullah, Zia Khan, Muhammad Saleem Ahmed, Idrees Javaid, Nadeem Khan, Majid I. COMSATS Inst Informat Technol Dept Comp Sci Islamabad Pakistan Pakistan Inst Engn & Appl Sci Islamabad Pakistan

ISBN: (纸本)9781509018574

Cooperation among nodes is mandatory for smooth operation of Mobile Ad Hoc Networks (MANETs) in terms of data routing. A participating node may refuse to deplete its resources for the benefit of others because of not getting any direct advantage for its service. Nodes showing such behavior are called selfish or non-cooperative nodes. Non-cooperative nodes can severely affect the performance of MANETs. Noncooperative behavior of nodes in the MANETs may lead to network partitioning. In this paper, we address the issue of noncooperative behavior by incorporating the concept of fuzzy logic closely coupled with the concept of trust. Fuzzy-based analyzer is used to distinguish between the non-cooperative behavior nodes and trustworthy nodes. We propose a fuzzy-based scheme to detect and isolate non-cooperative nodes in MANETs. In the proposed scheme, every node in the network constantly monitors its one-hop neighbors for their actions. Every node computes the trust of the observed neighbors. these trust values are passed on to a fuzzy function which is mapped into different classes. the resulting classes show the trust levels of the observed nodes. On the basis of the calculated trust value, the non-cooperative nodes are detected and isolated from the active routes of the MANET. Proposed fuzzy-based scheme is robust enough in terms of detecting packet drop attack in the network. Results show that proposed scheme detects non-cooperative nodes effectively with low false positives rate. Moreover, proposed scheme increases the packet delivery ratio and throughput in the presence of noncooperative nodes in the network.

关键词： MANETs Non-cooperative nodes Fuzzy logic Trust Fuzzy-based OLSR

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Services with Multiple Levels of Quality 30

Algorithms for Services with Multiple Levels of Quality

引用

30th IEEE international conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Navarra, Alfredo Palazzo, Pietro Pinotti, Cristina M. Mostarda, Leonardo Univ Perugia Dept Math & Comp Sci Via Vanvitelli 1 I-06123 Perugia Italy Univ Camerino Sch Sci & Technol Camerino Italy

ISBN: (纸本)9781509024612

We consider the problem of serving a set of sensors/end-users at multi-level quality of service. Consider for example the problem, which arises in augmented reality applications, of single-hop radio broadcasting a common content from a provider. Each end-user requires a minimal quality level of the common content. the provider must satisfy all end-users at their required minimal quality level with a point-to-point encrypted transmission. Since the number of different quality level versions of the common content cannot be as large as the number of end-users, the provider has to partition the end-users into groups. the provider adopts for each group a quality level which is the maximum among the levels required by the end-users of that group. In doing so, the provider incurs into an encryption and transmission cost which is proportional to the product between the end-user group size and the adopted quality level. Such a problem consists in finding a partition of the end-users that satisfies their requests and minimizes the overall provider cost. these quality of service problems are optimally solved in polynomial time by dynamic programming techniques for an arbitrary number of end-users. A faster greedy heuristic is also proposed which quickly finds a solution very close to the optimum one.

关键词： Quality of Service Partitioning Dynamic programming Augmented Reality Broadcast Algorithm

来源：评论

学校读者我要写书评

暂无评论

Effect of Security Parameter for Selection of Actor Nodes in WSAN: A Comparison Study of Two Fuzzy-Based Systems 30

Effect of Security Parameter for Selection of Actor Nodes in...

引用

30th IEEE international conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Elmazi, Donald Sakamoto, Shinji Oda, Tetsuya Kulla, Elis Spaho, Evjola Barolli, Leonard Fukuoka Inst Technol Grad Sch Engn Higashi Ku 3-30-1 Wajiro Higashi Fukuoka 8110295 Japan Okayama Univ Sci Dept Informat & Comp Sci Kita Ku 1-1 Ridai Cho Okayama 7000005 Japan Polytech Univ Tirana Dept Elect & Telecommun Bul D Eshmoret e KombitMother Theresa Sq 4 Tirana Albania Fukuoka Inst Technol Dept Informat & Commun Engn Higashi Ku 3-30-1 Wajiro Higashi Fukuoka 8110295 Japan

ISBN: (纸本)9781509018574

A group of wireless devices with the ability to sense physical events (sensors) or/and to perform relatively complicated actions (actors), is referred to as Wireless Sensor and Actor Network (WSAN). In this work, we propose and implement two Fuzzy Based Actor Selection Systems (FBASS): FBASS1 and FBASS2 for actor selection in WSANs. the systems decide whether the actor will be selected for the required job or not, based on data supplied by sensors and actual actor condition. the simulation results show that the proposed systems decide the actor selection in order to have short delays, low energy consumption and proper task assignment. Comparing FBASS1 with FBASS2, the FBASS2 is more complex than FBASS1, because it has more rules in FRB. However, FBASS2 is able to decide secure actor nodes, which makes the system more secure.

关键词： Fuzzy logic Actor Nodes Selection Wireless Sensor and Actor Networks Security Effects

来源：评论

学校读者我要写书评

暂无评论

the height of piecewise-testable languages with applications in logical complexity 25

The height of piecewise-testable languages with applications...

引用

25th EACSL Annual conference on Computer Science logic, CSL 2016 and the 30th Workshop on Computer Science logic

作者： Karandikar, Prateek Schnoebelen, Philippe IRIF Université Paris Diderot LIPN Université Paris 13 France LSV CNRS ENS Cachan Université Paris-Saclay France

ISBN: (纸本)9783959770224

the height of a piecewise-testable language L is the maximum length of the words needed to define L by excluding and requiring given subwords. the height of L is an important descriptive complexity measure that has not yet been investigated in a systematic way. this paper develops a series of new techniques for bounding the height of finite languages and of languages obtained by taking closures by subwords, superwords and related operations. As an application of these results, we show that FO2 (A∗

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

A sequent calculus for a modal logic on finite data trees 25

A sequent calculus for a modal logic on finite data trees

引用

25th EACSL Annual conference on Computer Science logic, CSL 2016 and the 30th Workshop on Computer Science logic

作者： Baelde, David Lunel, Simon Schmitz, Sylvain LSV ENS Cachan CNRS Inria Université Paris-Saclay France Inria Rennes France

ISBN: (纸本)9783959770224

We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests over finite data trees, i.e. over finite unranked trees where nodes are labelled with both a symbol from a finite alphabet and a single data value from an infinite domain. We present a sound and complete sequent calculus for this logic, which yields the optimal PSPACE complexity bound for its validity problem. © David Baelde, Simon Lunel, and Sylvain Schmitz;licensed under Creative Commons License CC-BY.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Dependence logic vs. constraint satisfaction 25

Dependence logic vs. constraint satisfaction

引用

25th EACSL Annual conference on Computer Science logic, CSL 2016 and the 30th Workshop on Computer Science logic

作者： Hella, Lauri Kolaitis, Phokion G. School of Information Sciences University of Tampere Finland University of California Santa Cruz IBM Research-Almaden United States

ISBN: (纸本)9783959770224

During the past decade, dependence logic has emerged as a formalism suitable for expressing and analyzing notions of dependence and independence that arise in different scientific areas. the sentences of dependence logic have the same expressive power as those of existential second-order logic, hence dependence logic captures NP on the class of all finite structures. In this paper, we identify a natural fragment of universal dependence logic and show that, in a precise sense, it captures constraint satisfaction. this tight connection between dependence logic and constraint satisfaction contributes to the descriptive complexity of constraint satisfaction and elucidates the expressive power of universal dependence logic. © Lauri Hella and Phokion G. Kolaitis;licensed under Creative Commons License CC-BY.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

IceDust: Incremental and eventual computation of derived values in persistent object graphs 30

IceDust: Incremental and eventual computation of derived val...

引用

30th European conference on Object-Oriented programming, ECOOP 2016

作者： Harkes, Daco C. Groenewegen, Danny M. Visser, Eelco Delft University of Technology Netherlands

ISBN: (纸本)9783959770149

Derived values are values calculated from base values. they can be expressed in object-oriented languages by means of getters calculating the derived value, and in relational or logic databases by means of (materialized) views. However, switching to a different calculation strategy (for example caching) in object-oriented programming requires invasive code changes, and the databases limit expressiveness by disallowing recursive aggregation. In this paper, we present IceDust, a data modeling language for expressing derived attribute values without committing to a calculation strategy. IceDust provides three strategies for calculating derived values in persistent object graphs: Calculate-on-Read, Calculate-on-Write, and Calculate-Eventually. We have developed a path-based abstract interpretation that provides static dependency analysis to generate code for these strategies. Benchmarks show that different strategies perform better in different scenarios. In addition we have conducted a case study that suggests that derived value calculations of systems used in practice can be expressed in IceDust. © Daco C. Harkes, Danny M. Groenewegen, and Eelco Visser;licensed under Creative Commons License CC-BY.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Boolean Functions with Ordered Domains in Answer Set programming 30

Boolean Functions with Ordered Domains in Answer Set Program...

引用

30th Association-for-the-Advancement-of-Artificial-Intelligence (AAAI) conference on Artificial Intelligence

作者： Alviano, Mario Faber, Wolfgang Strass, Hannes Univ Calabria Commenda Di Rende Italy Univ Huddersfield Huddersfield W Yorkshire England Univ Leipzig Leipzig Germany

ISBN: (纸本)9781577357605

Boolean functions in Answer Set programming have proven a useful modelling tool. they are usually specified by means of aggregates or external atoms. A crucial step in computing answer sets for logic programs containing Boolean functions is verifying whether partial interpretations satisfy a Boolean function for all possible values of its undefined atoms. In this paper, we develop a new methodology for showing when such checks can be done in deterministic polynomial time. this provides a unifying view on all currently known polynomial time decidability results, and furthermore identifies promising new classes that go well beyond the state of the art. Our main technique consists of using an ordering on the atoms to significantly reduce the necessary number of model checks. For many standard aggregates, we show how this ordering can be automatically obtained.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Execution traces as a powerful data representation for intelligent tutoring systems for programming 9

Execution traces as a powerful data representation for intel...

引用

9th international conference on Educational Data Mining, EDM 2016

作者： Paaßen, Benjamin Jensen, Joris Hammer, Barbara CITEC center of excellence Inspiration 1 Bielefeld33619 Germany

the first intelligent tutoring systems for computer programming have been proposed more than 30 years ago, mostly focusing on well defined programming tasks e.g. in the context of logic programming. Recent systems also teach complex programs, where explicit modelling of every possible program and mistake is no longer possible. Such systems are based on data-driven approaches, which focus on the syntax of a program or consider the output for example cases. However, the system’s understanding of student programs could be enriched by a deeper focus on the actual execution of a program. this requires a suitable data representation which encodes information of programming style as well as its functionality in a suitable way, thus offering entry points for automated feedback generation. In this contribution we propose a representation of computer programs via execution traces for example input and demonstrate the power of this representation in three key challenges for intelligent tutoring systems: identifying the underlying solution strategy, identifying erroneous solutions and locating the errors in erroneous programs for feedback display. © 2016 international Educational Data Mining Society. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：