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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 会议
14 册 图书
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

153 篇 工学
- 134 篇 计算机科学与技术...
- 89 篇 软件工程
- 18 篇 电气工程
- 11 篇 控制科学与工程
- 5 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 机械工程
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 测绘科学与技术
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 石油与天然气工程
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 食品科学与工程（可...
- 1 篇 生物工程
49 篇 理学
- 46 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 6 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 教育学
- 2 篇 教育学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 医学
- 1 篇 临床医学

主题

43 篇 logic programmin...
10 篇 mathematical log...
10 篇 probabilistic lo...
9 篇 fuzzy logic
9 篇 software enginee...
9 篇 logic gates
8 篇 computer circuit...
8 篇 semantics
7 篇 linear programmi...
7 篇 programming lang...
7 篇 artificial intel...
7 篇 logics and meani...
6 篇 optimization
6 篇 logic
5 篇 formal logic
5 篇 inductive logic ...
5 篇 knowledge repres...
4 篇 computer science
4 篇 programming
4 篇 application soft...

机构

2 篇 university of ma...
2 篇 univ london impe...
2 篇 institute of log...
2 篇 cornell univ dep...
2 篇 institute of mic...
2 篇 simon fraser uni...
2 篇 vienna univ tech...
2 篇 univ southampton...
2 篇 istanbul tech un...
2 篇 univ milano bico...
1 篇 osaka prefecture...
1 篇 national institu...
1 篇 system and softw...
1 篇 univ karlsruhe t...
1 篇 iit delhi dept c...
1 篇 dept. mathematic...
1 篇 univ bologna dei...
1 篇 univ wisconsin d...
1 篇 xidian univ inst...
1 篇 key laboratory o...

作者

4 篇 schaub torsten
4 篇 tompits hans
3 篇 muggleton stephe...
3 篇 riguzzi fabrizio
3 篇 woltran stefan
3 篇 lamma evelina
2 篇 neves mariana
2 篇 ternovska eugeni...
2 篇 gomes guida
2 篇 santos jose
2 篇 akira notsu
2 篇 penaloza rafael
2 篇 seiki ubukata
2 篇 voronkov andrei
2 篇 potena domenico
2 篇 storti emanuele
2 篇 olivetti nicola
2 篇 katsuhiro honda
2 篇 fadja arnaud ngu...
2 篇 de giacomo giuse...

语言

215 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=17th International Conference on Logic Programming, ICLP 2001"

共 217 条记录，以下是91-100 订阅

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

详细简洁

排序：

17th international Symposium on Practical Aspects of Declarative Languages, PADL 2015

17th International Symposium on Practical Aspects of Declara...

引用

17th international Symposium on Practical Aspects of Declarative Languages, PADL 2015

ISBN: (纸本)9783319196855

the proceedings contain 10 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Ontology-driven data semantics discovery for cyber-security;state space planning using transaction logic;on compiling linear logic programs with comprehensions, aggregates and rule priorities;declaratively solving Google code jam problems with Picat;reactive single-page applications with dynamic dataflow;interpretation and compilation of constraint handling rules in curry;implementation and performance of probabilistic inference pipelines;a Haskell implementation of a rule-based program transformation for c programs;on logic programming representations of lambda terms and programming microcontrollers in OCAML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving Safety in Collaborative Robot Tasks 17

Improving Safety in Collaborative Robot Tasks

引用

17th IEEE international conference on Industrial Informatics (INDIN)

作者： Mandal, Avijit Sharma, Divyasheel Sukhwani, Mohak Jetley, Raoul Sarkar, Santonu ABB Bangalore Karnataka India BITS Pilani Sancoale Goa India

ISBN: (纸本)9781728129273

In recent times, there has been significant interest in collaborative robots where the tasks performed by a robot are non-repetitive and complex, and humans and robots share an overlapping workspace. In such a case, the robot controller must necessarily be safety-aware. In this paper, we propose a mechanism to evaluate a robot program and compute a safety score for each action that the robot is about to perform. To this end, we have implemented a code analyzer that examines the robot's Move instructions and assigns a safety score. A subjective logic based approach is used to compute the safety score for each instruction. We have evaluated the approach through ABB's RobotStudio (R) simulator. We simulate two scenarios: First, where two robots share a workspace and second, where a robot moves along a path with an obstacle. the simulations show that using our code analyzer and safety score formalism;it is possible to evaluate the application code for safety and enable avoidance of potentially unsafe behavior.

关键词： Safety Human-Robot Co-operation RAPID programming Collaborative Robots Subjective logic

来源：评论

学校读者我要写书评

暂无评论

Encoding of Planning Problems and their Optimizations in Linear logic

Encoding of Planning Problems and Their Optimizations in Lin...

引用

17th international conference on Applications of Declarative programming and Knowledge Management/21st Workshop on logic programming

作者： Chrpa, Lukas Surynek, Pavel Vyskocil, Jiri Charles Univ Prague Dept Theoret Comp Sci & Math Log Fac Math & Phys Prague Czech Republic

ISBN: (纸本)9783642006746

Girard's Linear logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems. We concentrated on expressing planning problems by linear logic in this paper. We observed a rich usage of a construct of consumable resources in planning problem formulations. this fact motivates us to provide a possible encoding of planning problems in linear logic. this paper shows how planning problems can be encoded in Linear logic and how some optimizations of planning problems can be encoded. these optimizations can help planners to improve the efficiency of finding solutions (plans).

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Characterizing Fuzzy y-Models in Multi-adjoint Normal logic programming 17th

Characterizing Fuzzy y-Models in Multi-adjoint Normal Logic ...

引用

17th international conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU)

作者： Eugenia Cornejo, M. Lobo, David Medina, Jesus Univ Cadiz Dept Math Cadiz Spain

ISBN: (纸本)9783319914794;9783319914787

this paper includes the main notions associated with the syntax and semantics of two interesting paradigms in fuzzy logic programming with default negation: multi-adjoint normal logic programming introduced in [5] and the fuzzy answer set logic programming approach presented in [16]. We will show that fuzzy answer set logic programs can be translated into multi-adjoint normal logic programs, as long as the implication operator used in the former is a residuated implication. Moreover, we will relate the notions of fuzzy y-model and model by means of a characterization theorem which allow us to guarantee the existence of fuzzy y-models of fuzzy answer set logic programs.

关键词： Multi-adjoint logic programming Fuzzy model Negation operator

来源：评论

学校读者我要写书评

暂无评论

Expansion Nets: Proof-Nets for Propositional Classical logic

Expansion Nets: Proof-Nets for Propositional Classical Logic

引用

17th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： McKinley, Richard Univ Bern Inst Informat & Angew Math CH-3012 Bern Switzerland

ISBN: (纸本)9783642162411

We give a calculus of proof-nets for classical propositional logic. these nets improve on a proposal due to Robinson by validating the associativity and commutativity of contraction, and provide canonical representants for classical sequent proofs modulo natural equivalences. We present the relationship between sequent proofs and proof-nets as an annotated sequent calculus, deriving formulae decorated with expansion/deletion trees. We then show a subcalculus, expansion nets, which in addition to these good properties has a polynomial-time correctness criterion.

关键词： Expansion

来源：评论

学校读者我要写书评

暂无评论

Power Management in Cluster-Based Energy-Harvesting Sensor Networks through Dynamic Modulation Scaling 17

Power Management in Cluster-Based Energy-Harvesting Sensor N...

引用

2015 IEEE 17th international conference on High Performance Computing and Communications (HPCC)

作者： Bandari, Maryam Simon, Robert Aydin, Hakan George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

ISBN: (纸本)9781479989379

this paper considers real-time cluster-based wireless sensor networks where the nodes harvest energy from the environment. We target performance sensitive applications that have to collectively send their information to cluster head by a predefined deadline, such as in distributed real-time monitoring and detection. the nodes are equipped with Dynamic Modulation Scaling (DMS) capable wireless radios. the problem is to determine the time slots and modulation levels that will be used by each node while communicating with the cluster-head in order to achieve energy-neutral (perpetual) operation and maximize energy reserves. We propose a solution that adjusts underlying TDMA slots to enable high-energy nodes to transmit faster and thus produce larger slack for low-energy nodes, while meeting the performance constraint. We present an optimal mixed integer programming based solution. We also develop fast heuristics that are shown to provide approximate solutions through comprehensive experiments with actual solar energy harvesting profiles.

关键词： energy harvesting integer programming modulation pattern clustering telecommunication power management wireless sensor networks DMS TDMA cluster-based energy-harvesting wireless sensor network dynamic modulation scaling energy-neutral operation optimal mixed integer programming power management solar energy harvesting profile wireless radio Batteries Energy harvesting logic gates Modulation Real-time systems Wireless communication Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

FCUBE: An Efficient Prover for Intuitionistic Propositional logic

FCUBE: An Efficient Prover for Intuitionistic Propositional ...

引用

17th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Ferrari, Mauro Fiorentini, Camillo Fiorino, Guido Univ Insubria DICOM Via Mazzini 5 I-21100 Varese Italy Univ degli Studi Milano DSI I-20135 Milan Italy Univ degli Studi Milano Bicocca DIMEQUANT Milan Italy

ISBN: (纸本)9783642162411

We present FCUBE, a theorem prover for Intuitionistic propositional logic based on a tableau calculus. the main novelty of FCUBE is that it implements several optimization techniques that allow to prune the search space acting on different aspects of proof-search. We tested the efficiency of our techniques by comparing FCUBE with other theorem provers. We found that our prover outperforms the other provers on several interesting families of formulas.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

17th international Symposium on Functional and logic programming, FLOPS 2024

17th International Symposium on Functional and Logic Program...

引用

17th international Symposium on Functional and logic programming, FLOPS 2024

ISBN: (纸本)9789819722990

the proceedings contain 16 papers. the special focus in this conference is on Functional and logic programming. the topics include: Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement;a Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting;tabulation with Zippers;declarative Pearl: Rigged Contracts;System Description: DeepLLM, Casting Dialog threads into logic Programs;a Constraint-Based Mathematical Modeling Library in Prolog with Answer Constraint Semantics;grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description);inferring Non-failure Conditions for Declarative Programs;being Lazy When It Counts Practical Constant-Time Memory Management for Functional programming;MetaOCaml: Ten Years Later System Description;An ML-Style Module System for Cross-Stage Type Abstraction in Multi-stage programming;rhyme: A Data-Centric Multi-paradigm Query Language Based on Functional logic Metaprogramming System Description;language-parameterized Proofs for Functional Languages with Subtyping;system Description: A theorem-Prover for Subregular Systems: the Language Toolkit and Its Interpreter, Plebby.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Expectation Maximization in Deep Probabilistic logic programming 17th

Expectation Maximization in Deep Probabilistic Logic Program...

引用

17th international conference of the Italian-Association-for-Artificial-Intelligence (AI*IA)

作者： Fadja, Arnaud Nguembang Riguzzi, Fabrizio Lamma, Evelina Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy

ISBN: (纸本)9783030038403;9783030038397

Probabilistic logic programming (PLP) combines logic and probability for representing and reasoning over domains with uncertainty. Hierarchical probability logic programming (HPLP) is a recent language of PLP whose clauses are hierarchically organized forming a deep neural network or arithmetic circuit. Inference in HPLP is done by circuit evaluation and learning is therefore cheaper than any generic PLP language. We present in this paper an Expectation Maximization algorithm, called Expectation Maximization Parameter learning for HIerarchical Probabilistic logic programs (EMPHIL), for learning HPLP parameters. the algorithm converts an arithmetic circuit into a Bayesian network and performs the belief propagation algorithm over the corresponding factor graph.

关键词： Hierarchical probabilistic logic programming Arithmetic circuits Expectation Maximization Factor graph Belief propagation

来源：评论

学校读者我要写书评

暂无评论

Conversion Method of Netlists Consisting of Conventional logic Gates to RSFQ logic Circuits Using the Characteristics of Pulse logic 17

Conversion Method of Netlists Consisting of Conventional Log...

引用

17th IEEE international Superconductive Electronics conference (ISEC)

作者： Kito, Nobutaka Takagi, Kazuyoshi Takagi, Naofumi Chukyo Univ Dept Informat Engn Toyota Aichi Japan Mie Univ Grad Sch Engn Tsu Mie Japan Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9781728111964

Conversion method of netlists consisting of conventional logic gates to RSFQ circuits is proposed. It treats netlists for CMOS circuits as the design entry, and converts them considering reduction of the number of clocked gates. It utilizes two characteristics of pulse logic for the reduction. One is utilizing confluence of pulses to realize logic-OR. the other is utilizing a small resettable DFF as an NIMPLY gate by tuning the order of pulse arrival. To minimize the number of clocked gates with minimum replacements of gates, the selection problem of gates for replacements utilizing those characteristics and assignment of logic level to each gate are formulated as an instance of integer linear programming.

关键词： RSFQ circuits pulse logic digital circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：