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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

293 篇 会议
18 册 图书
7 篇 期刊文献

馆藏范围

318 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

229 篇 工学
- 218 篇 计算机科学与技术...
- 109 篇 软件工程
- 23 篇 电气工程
- 15 篇 控制科学与工程
- 14 篇 信息与通信工程
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 建筑学
- 3 篇 交通运输工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 生物工程
- 1 篇 力学（可授工学、理...
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 安全科学与工程
47 篇 理学
- 44 篇 数学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
14 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 3 篇 图书情报与档案管...
7 篇 教育学
- 7 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学

主题

69 篇 logic programmin...
17 篇 answer set progr...
15 篇 inductive logic ...
12 篇 mathematical log...
11 篇 artificial intel...
11 篇 logics and meani...
10 篇 fuzzy logic
10 篇 programming
10 篇 programming lang...
9 篇 software enginee...
9 篇 logic
7 篇 application soft...
7 篇 logic gates
7 篇 inductive logic ...
7 篇 semantics
7 篇 programming tech...
7 篇 system testing
6 篇 software enginee...
6 篇 machine learning
6 篇 algorithm analys...

机构

3 篇 new mexico state...
3 篇 univ calabria ar...
3 篇 tu wien inst log...
3 篇 tech univ dresde...
2 篇 technological ed...
2 篇 univ oxford oxfo...
2 篇 univ nebraska om...
2 篇 univ helsinki de...
2 篇 network operatio...
2 篇 univ freiburg in...
2 篇 inria lille nord...
2 篇 tech univ dortmu...
2 篇 ecole polytech i...
2 篇 univ paris 13 li...
2 篇 univ pisa dept c...
2 篇 tech univ munich...
2 篇 portland state u...
2 篇 univ london impe...
2 篇 katholieke univ ...
1 篇 bolsista do prog...

作者

4 篇 riguzzi fabrizio
4 篇 ricca francesco
3 篇 gaggl sarah alic...
3 篇 kramer stefan
3 篇 page david
3 篇 son tran cao
3 篇 srinivasan ashwi...
3 篇 froehler sebasti...
3 篇 alphonse erick
2 篇 muggleton stephe...
2 篇 giordano laura
2 篇 toivonen h.
2 篇 ong irene m.
2 篇 revoredo k.
2 篇 bellodi elena
2 篇 osmani aomar
2 篇 bryant christoph...
2 篇 ray oliver
2 篇 hutter dieter
2 篇 costa vitor sant...

语言

314 篇 英文
2 篇 中文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=16th International Conference of Inductive Logic Programming"

共 318 条记录，以下是131-140 订阅

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

详细简洁

排序：

A Semantic Model for Graphical User Interfaces 11

A Semantic Model for Graphical User Interfaces

引用

16th ACM SIGPLAN international conference on Functional programming (ICFP 11)

作者： Krishnaswami, Neelakantan R. Benton, Nick Microsoft Research Cambridge United Kingdom

ISBN: (纸本)9781450308656

We give a denotational model for graphical user interface (GUI) programming using the Cartesian closed category of ultrametric spaces. the ultrametric structure enforces causality restrictions on reactive systems and allows well-founded recursive definitions by a generalization of guardedness. We capture the arbitrariness of user input (e. g., a user gets to decide the stream of clicks she sends to a program) by making use of the fact that the closed subsets of an ultrametric space themselves form an ultrametric space, allowing us to interpret nondeterminism with a "powerspace" monad. Algebras for the powerspace monad yield a model of intuitionistic linear logic, which we exploit in the definition of a mixed linear/non-linear domain-specific language for writing GUI programs. the non-linear part of the language is used for writing reactive stream-processing functions whilst the linear sublanguage naturally captures the generativity and usage constraints on the various linear objects in GUIs, such as the elements of a DOM or scene graph. We have implemented this DSL as an extension to OCaml, and give examples demonstrating that programs in this style can be short and readable.

关键词： Languages theory Design denotational semantics ultrametric spaces functional reactive programming guarded recursion linear logic

来源：评论

学校读者我要写书评

暂无评论

BET : An inductive logic programming Workbench

引用

20th international conference on inductive logic programming (ILP)

作者： Kalgi, Srihari Gosar, Chirag Gawde, Prasad Ramakrishnan, Ganesh Gada, Kekin Iyer, Chander Kiran, T. V. S. Srinivasan, Ashwin Indian Inst Technol Dept Comp Sci & Engn Bombay Maharashtra India

ISBN: (纸本)9783642212949;9783642212956

Existing ILP (inductive logic programming) systems are implemented in different languages namely C, Progol, etc. Also, each system has its customized format for the input data. this makes it very tedious and time consuming on the part of a user to utilize such a system for experimental purposes as it demands a thorough understanding of that system and its input specification. In the spirit of Weka [1], we present a relational learning workbench called BET(Background + Examples = theories), implemented in Java. the objective of BET is to shorten the learning curve of users (including novices) and to facilitate speedy development of new relational learning systems as well as quick integration of existing ILP systems. the standardized input format makes it easier to experiment with different relational learning algorithms on a common dataset.

关键词： BET ILP systems Golem Progol FOIL PRISM TILDE

来源：评论

学校读者我要写书评

暂无评论

Optimising FOIL by new scoring functions?

Optimising FOIL by new scoring functions?

引用

16th conference on Software Engineering and Databases, JISBD 2011

作者： Jiménez, P. Arjona, J.L. Álvarez, J.L. Department of Information Technology Escuela Politécnica Superior University of Huelva Crta. Huelva - La Rábida Palos de La Frontera 21071 Spain

ISBN: (纸本)9788497494861

FOIL is an inductive logic programming Algorithm to discover first order rules to explain the patterns involved in a domain of knowledge. Domains with a huge amount of information are handicaps for FOIL due to the explosion of the search of space to devise the rules. Current solutions to problems in these domains are restricted to devising ad hoc domain dependent inductive algorithms that use a less-expressive formalism to code rules. We work on optimising FOIL learning process to deal with such complex domain problems while retaining expressiveness. Our hypothesis is that changing the Information Gain scoring function, used by FOIL to decide how rules are learnt, can reduce the number of steps the algorithm performs. We have analysed 15 scoring functions, normalised them into a common notation and checked a test in which they are computed. the learning process will be evaluated according to its efficiency, and the quality of the rules according to their precision, recall, complexity and specificity. the results reinforce our hypothesis, demonstrating that replacing the Information Gain can optimise both the FOIL algorithm execution and the learnt rules. 2011 © Universidade da Coruña.

关键词： inductive logic programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

Tailoring Process Synthesis to Domain Characteristics

Tailoring Process Synthesis to Domain Characteristics

引用

IEEE Int Conf/Workshops on Engineering of Autonomic and Autonomous Systems/Int Conf on the Engineering of Computer-Based Systems/Int Conf on the Engineering of Complex Computer Systems

作者： Naujokat, Stefan Lamprecht, Anna-Lena Steffen, Bernhard Dortmund Univ Technol Chair Programming Syst D-44227 Dortmund Germany

ISBN: (纸本)9780769543819

PROPHETS is our flexible framework for the synthesis of processes from libraries of basic services. In this paper we demonstrate how its synthesis strategy can be tailored to the considered application domain. For this purpose, PROPHETS provides a number of configuration options, such as different data exchange formats (e. g. shared variables and pipelining) for the resulting process, as well as structural and temporal logic constraints for minimizing the inherent search space. We illustrate the impact of adequate synthesis tailoring by contrasting two real-life case studies with diametric characteristics.

关键词： process synthesis domain modeling temporal logic constraints

来源：评论

学校读者我要写书评

暂无评论

A Hierarchy of Mendler style Recursion Combinators Taming inductive Datatypes with Negative Occurrences 11

A Hierarchy of Mendler style Recursion Combinators Taming In...

引用

16th ACM SIGPLAN international conference on Functional programming (ICFP 11)

作者： Ahn, Ki Yung Sheard, Tim Portland State Univ Portland OR 97207 USA

ISBN: (纸本)9781450308656

the Mendler style catamorphism (which corresponds to weak induction) always terminates even for negative inductive datatypes. the Mendler style histomorphism (which corresponds to strong induction) is known to terminate for positive inductive datatypes. To our knowledge, the literature is silent on its termination properties for negative datatypes. In this paper, we prove that histomorphisms do not always termintate by showing a counter-example. We also enrich the Mendler collection of recursion combinators by defining a new form of Mendler style catamorphism (msfcata), which terminates for all inductive datatypes, that is more expressive than the original. We organize the collection of combinators by placing them into a hierarchy of ever increasing generality, and describing the termination properties of each point on the hierarchy. We also provide many examples (including a case study on a negative inductive datatype), which illustrate both the expressive power and beauty of the Mendler style. One lesson we learn from this work is that weak induction applies to negative inductive datatypes but strong induction is problematic. We provide a proof of weak induction by exhibiting an embedding of our new combinator into F-omega. We pose the open question: Is there a safe way to apply strong induction to negative inductive datatypes?

关键词： Languages catamorphism histomorphism higher-order abstract syntax parametric polymorphism parametricity recursion schemes recursion combinators termination totality

来源：评论

学校读者我要写书评

暂无评论

logic programming and fuzzy Monte Carlo for distribution network reconfiguration

Logic programming and fuzzy Monte Carlo for distribution net...

引用

2011 16th international conference on Intelligent System Applications to Power Systems, ISAP 2011

作者： Vale, Zita A. Canizes, Bruno Soares, João Oliveira, Pedro Sousa, Tiago Pinto, Tiago Rua Dr. António Bernardino de Almeida 431 4200-072 Porto Portugal

this paper present a methodology to choose the distribution networks reconfiguration that presents the lower power losses. the proposed methodology is based on statistical failure and repair data of the distribution power system components and uses fuzzy-probabilistic modeling for system component outage parameters. the proposed hybrid method using fuzzy sets and Monte Carlo simulation based on the fuzzy-probabilistic models allows catching both randomness and fuzziness of component outage parameters. © 2011 IEEE.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

ICFP'11 - Proceedings of the 2011 ACM SIGPLAN international conference on Functional programming

ICFP'11 - Proceedings of the 2011 ACM SIGPLAN International ...

引用

16th ACM SIGPLAN international conference on Functional programming, ICFP'11

ISBN: (纸本)9781450308656

the proceedings contain 38 papers. the topics discussed include: on the bright side of type classes: instance arguments in Agda;functional modelling of musical harmony;how to make ad hoc proof automation less ad hoc;temporal higher-order contracts;parsing with derivatives: a functional pearl;an efficient non-moving garbage collector for functional languages;deriving an efficient FPGA implementation of a low density parity check forward error corrector;geometry of synthesis IV: compiling affine recursion into static hardware;a hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences;typed self-interpretation by pattern matching;and using Camlp4 for presenting dynamic mathematics on the web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the web.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Shapemaker: A game-based introduction to programming

Shapemaker: A game-based introduction to programming

引用

international conference on Computer Games

作者： Masso, Nicholas Grace, Lindsay Armstrong Institute for Interactive Media Studies Miami University Oxford OH United States

ISBN: (纸本)9781457714504

As emphasis on Science, Technology, Engineering, and Math (STEM) initiatives increase, students are at a fragile point in their education. It is imperative that students learn core skills like computer programming and procedural logic necessary to living in today's increasingly digital society. Our new game Shapemaker solves these problems in game-based learning that incorporates an engaging augmented reality interface. ShapeMaker utilizes a table-based tactile interface that bridges physical actions with digital results, allowing players to learn basic concepts in programming by playing a card game. Shapemaker aims to transform the process of introducing new students to the world of programming and create a new, wider demographic of computer programmers. this article is a preliminary study of Shapemaker, documenting its concept, current design, and directions for development. © 2011 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Shapemaker: A game-based introduction to programming

Shapemaker: A game-based introduction to programming

引用

international conference on Computer Games (CGAMES)

作者： Nicholas Masso Lindsay Grace Armstrong Institute for Interactive Media Studies Miami University Oxford OH USA

关键词： Games programming profession Shape Syntactics Computers Education

来源：评论

学校读者我要写书评

暂无评论

logic for programming, Artificial Intelligence, and Reasoning - 16th international conference, LPAR-16, Revised Selected Papers

Logic for Programming, Artificial Intelligence, and Reasonin...

引用

16th international conference on logic for programming, Artificial Intelligence, and Reasoning, LPAR-16

ISBN: (纸本)3642175104

the proceedings contain 28 papers. the topics discussed include: speed-up techniques for negation in grounding;constraint-based abstract semantics for temporal logic: a direct approach to design and implementation;on the equality of probabilistic terms;program logics for homogeneous meta-programming;verifying pointer and string analyses with region type systems;ABC: algebraic bound computation for loops;hardness of preorder checking for basic formalisms;a quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae;pairwise cardinality networks;logic and computation in a lambda calculus with intersection and union types;graded alternating-time temporal logic;non-oblivious strategy improvement;label-free proof systems for intuitionistic modal logic IS5;an intuitionistic epistemic logic for sequential consistency on shared memory;disunification for ultimately periodic interpretations;and synthesis of trigger properties.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：