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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
23 篇 期刊文献
10 册 图书

馆藏范围

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

日期分布

学科分类号

286 篇 工学
- 273 篇 计算机科学与技术...
- 187 篇 软件工程
- 19 篇 控制科学与工程
- 16 篇 电气工程
- 15 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 生物工程
- 2 篇 安全科学与工程
90 篇 理学
- 74 篇 数学
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
36 篇 管理学
- 27 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
7 篇 医学
- 7 篇 临床医学
- 6 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
3 篇 教育学
- 3 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

87 篇 logic programmin...
29 篇 knowledge repres...
18 篇 semantics
13 篇 programming
12 篇 computer circuit...
10 篇 computer program...
9 篇 object oriented ...
9 篇 artificial intel...
9 篇 ontology
8 篇 logic gates
8 篇 mathematical log...
8 篇 functional progr...
6 篇 programming tech...
6 篇 logics and meani...
6 篇 temporal logic
6 篇 logic design
5 篇 answer set progr...
4 篇 computer archite...
4 篇 logic
4 篇 inductive logic ...

机构

2 篇 genusion inc. am...
2 篇 computer science...
2 篇 univ adelaide sc...
2 篇 faculty of infor...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ minho ctr a...
2 篇 dlvsyst srl arca...
2 篇 listic universit...
2 篇 school of comput...
2 篇 vienna univ tech...
2 篇 school of softwa...
2 篇 open university ...
2 篇 centro algoritmi...
2 篇 facultad de mate...
2 篇 univ calabria de...
2 篇 etsii universida...
2 篇 university of wi...
2 篇 sri internationa...
2 篇 univ london impe...

作者

5 篇 vicente henrique
3 篇 dastani mehdi
3 篇 pereira luís mon...
3 篇 brain martin
3 篇 neves josé
3 篇 heymans stijn
3 篇 tompits hans
3 篇 de vos marina
2 篇 meseguer josé
2 篇 hommersom arjen
2 篇 durán f.
2 篇 porto antónio
2 篇 n. ajika
2 篇 leone nicola
2 篇 dell’acqua piera...
2 篇 de mel geeth
2 篇 madalina croitor...
2 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.

语言

354 篇 英文
11 篇 其他
1 篇 中文

检索条件"任意字段=3rd International Workshop on Logic Programming and Knowledge Representation"

共 365 条记录，以下是231-240 订阅

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

详细简洁

排序：

The abstract scheme for concurrent programming 3rd

引用

3rd international workshop on Extensions of logic programming, ELP 1992

作者： Porto, António Rosado, Paulo Departamento de Informática Universidade Nova de Lisbon Monte da Caparica2825 Portugal

ISBN: (纸本)9783540564546

We present a new model for concurrent programming, which we call AbstrAct. A system is specified through collections of rules defining all possible state transformations that may occur. The activity of a system is driven by goals (actions) organized in parallel and sequence in a structure called the agenda. Actions in the agenda communicate and synchronize by atomically consulting and updating a global shared space, the blackboard, which may, in general, be regarded as a logic program. An action rule corresponds to an atomic step in the execution of an action in the agenda, that replaces it by a structure of subactions while changing the blackboard;the rule specifies conditions on the current and new blackboard. We give operational semantics to AbstrAct through a variant of Fair Transition Systems, and ilustrate the expressiveness and programming style of AbstrAct derived languages through small examples. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A fuzzy approach to hand functioning in virtual programming 3

A fuzzy approach to hand functioning in virtual programming

引用

3rd IEEE international Symposium on Computational Intelligence in Robotics and Automation, CIRA 1999

作者： Yuan, Xiaobu Sun, Hanqiu Department of Computer Science Memorial University of Newfoundland St. John'sNLA1B 3X5 Canada Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin N.T. Hong Kong Hong Kong

ISBN: (纸本)0780358066

Virtual assembly allows human operators to use their hands manipulating the graphics representation of machinery parts and programming assembly tasks directly in a three-dimensional operation space. The imprecise measurements of data gloves and uncertainty of human factors, however, make the incorporation of human hands an error-probing and time-consuming task. This paper investigates the application of fuzzy logic in posture recognition. It presents a simple yet efficient method to handle the imprecision in both the registered sample patterns and run-time glove inputs. Experiment results demonstrate the advantages of us-, ing this approach in robot programming of virtual assembly systems. © 1999 IEEE.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

The Regularization of Small Sub-Constraint Satisfaction Problems 22nd

The Regularization of Small Sub-Constraint Satisfaction Prob...

引用

22nd international Conference on Applications of Declarative programming and knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on Functional and Constraint logic programming, WFLP 2019

作者： Löffler, Sven Liu, Ke Hofstedt, Petra Department of Mathematics and Computer Science MINT Programming Languages and Compiler Construction Group Brandenburg University of Technology Cottbus-Senftenberg Konrad-Wachsmann-Allee 5 Cottbus03044 Germany

ISBN: (纸本)9783030467135

This paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. The purpose of this approach is to reduce the number of fails in the resolution process, to improve the inferences made during search by the constraint solver by strengthening constraint propagation, and to maintain the level of propagation while reducing the cost of propagating the constraints. Our experimental results show improvements in terms of the resolution speed compared to the original CSPs and a competitiveness to the recent tabulation approach [1, 15]. Besides, our approach can be realized in a preprocessing step, and therefore wouldn’t collide with redundancy constraints or parallel computing if implemented. © 2020, Springer Nature Switzerland AG.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A framework for the study of evolved term-weighting schemes in information retrieval

A framework for the study of evolved term-weighting schemes ...

引用

ECAI 2006 3rd international workshop on Text-Based Information Retrieval, TIR 2006

作者： Cummins, Ronan O'Riordan, Colm University of Ireland Galway Ireland

Evolutionary algorithms and, in particular, Genetic programming (GP) are increasingly being applied to the problem of evolving term-weighting schemes in Information Retrieval (IR). One fundamental problem with the solutions generated by these stochastic processes is that they are often difficult to analyse. A number of questions regarding these evolved term-weighting schemes remain unanswered. One interesting question is;do different runs of the GP process bring us to similar points in the solution space? This paper deals with determining a number of measures of the distance between the ranked lists (phenotype) returned by different term-weighting schemes. Using these distance measures, we develop trees that show the phenotypic distance between these termweighting schemes. This framework gives us a representation of where these evolved solutions lie in the solution space. Finally, we evolve several global term-weighting schemes and show that this framework is indeed useful for determining the relative closeness of these schemes and for determining the expected performance on general test data.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Cyber threat analysis with structured probabilistic argumentation 3

Cyber threat analysis with structured probabilistic argument...

引用

3rd workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2019

作者： Leiva, Mario A. Simari, Gerardo I. Simari, Guillermo R. Shakarian, Paulo Argentina Cyber Reconnaissance Inc. TempeAZ United States

Capturing the uncertain aspects in cyber threat analyses is an important part of a wide range of efforts, including diagnostics, threat evaluation, and preventing attacks. However, there has been insufficient research and development of modeling approaches that are able to correctly capture and handle such uncertainty. In this work, we present an application example of the DeLP3E framework - a formalism that extends structured argumentation based on logic programming - in the domain of cyber threat analysis;in particular, near real-time analyses such as incident response in enterprise networks. The DeLP3E framework provides a unique combination of dialectical reasoning, rule-based inference, and probabilistic modeling to not only offer suggested responses to given situations, but also to explain to the analyst why the system reaches its conclusions. Copyright © 2019 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 international (CC BY 4.0).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

ON THE representation OF DATA IN LAMBDA-CALCULUS 3rd

引用

3rd workshop ON COMPUTER SCIENCE logic ( CSL 89 )

作者： PARIGOT, M Equipe de Logique CNRS UA 753 Université Paris 7 UFR de Mathématiques 2 place Jussieu PARIS Cedex 05 75251 France

ISBN: (纸本)3540527532

We analyse the algorithmic properties of programs induced by the choice of the representation of data in lambda-calculus. From a logical point of view there are two canonical ways of defining the data types: the iterative one and the recursive one. Both define the same mathematical object, but we show that they have a completely different algorithmic content. The essential of the difference appears in the operational properties of two programs: the predecessor and the addition on the type of unary natural numbers (for the type of lists this would be the programs cdr and append). The results we prove in this paper state a fundamental duality between the iterative and recursive representation of data in lambda-calculus. For the iterative representation of natural numbers (Church numerals) there is a “one-step” addition, but we prove in §3 that there is no “one-step” predecessor (by “one-step” we mean “whose computation requires only number of reduction steps bounded by a constant”). For the recursive representation of natural numbers we have the converse situation: there is a “one-step” predecessor but we prove in §4 that there is no “one-step” addition. For simplicity, we state these results for the type of natural numbers, but they hold in fact for all the usual data types defined as ultisorted term algebras. Their practical significance for programming, may be, appears clearer on the type of lists where the predecessor is replaced by the cdr and the addition by append. In §5, we briefly present a new representation of natural numbers for which we have both, a “one-step” predecessor and a “one-step” addition. © Springer-Verlag Berlin Heidelberg 1990.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

international workshop on Parallel Symbolic Languages and Systems 1995

引用

3rd international workshop on Parallel Symbolic Languages and Systems, PSLS 1995

ISBN: (纸本)3540611436

The proceedings contain 21 papers. The special focus in this conference is on Evaluation Strategies and programming Tools. The topics include: Lazy remote procedure call and its implementation;efficient evaluation strategies for structured concurrency constructs in parallel scheme systems;the semantics of pcall and fork in the presence of first-class continuations and side-effects;understanding the performance of parallel symbolic programs;a debugging scheme for fine-grain threads on massively parallel processors with a small amount of log information;distributed prograph;experiences with strong moding in concurrent logic/constraint programming;portable parallel irregular applications;understanding language support for irregular parallelism;efficient parallel graph coloring with prioritization;group-based fields;parallel symbolic computing in cid;an overview of MPC++ - extended abstract;fault tolerance via replication in coarse grain data-flow;experience with parallel symbolic applications in orca;a portable parallel implementation of a concurrent logic programming language;DMEROON, overview of a distributed class-based causally-coherent data model;lessons from the experience;the role of distributed lisp in open hypermedia information systems;foundations for a virtual multicomputer - progress report and process calculi at work - an account of the LCS project.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On spatial constraint solving approaches 1

引用

3rd international workshop on Automated Deduction in Geometry, ADG 2000

作者： Hoffmann, Christoph M. Yuan, Bo Computer Science Department Purdue University West LafayetteIN47907-1398 United States

ISBN: (数字)9783540454106

ISBN: (纸本)3540425985

Simultaneous spatial constraint problems can be approached algebraically, geometrically, or constructively. We examine how each approach performs, using several example problems, especially constraint problems involving lines. We also prove that there are at most 12 real tangents to four given spheres in R3. © Springer-Verlag Berlin Heidelberg 2001.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards a computer algebra system with automatic differentiation for use with object-oriented modelling languages

Towards a computer algebra system with automatic differentia...

引用

3rd international workshop on Equation-Based Object-Oriented Modeling Languages and Tools, EOOLT 2010 - In Conjunction with the MODELS 2010 Conference

作者： Andersson, Joel Houska, Boris Diehl, Moritz K.U. Leuven Belgium

The Directed Acyclic Graph (DAG), which can be generated by object oriented modelling languages, is often the most natural way of representing and manipulating a dynamic optimization problem. With this representation, it is possible to step-by-step reformulate an (infinite dimensional) dynamic optimization problem into a (finite dimensional) non-linear program (NLP) by parametrizing the state and control trajectories. We introduce CasADi, a minimalistic computer algebra system written in completely self-contained C++. The aim of the tool is to offer the benifits of a computer algebra to developers of C++ code, without the overhead usually associated with such systems. In particular, we use the tool to implement automatic differentiation, AD. For maximum efficiency, CasADi works with two different graph representations interchangeably: One supporting only scalar-valued, built-in unary and binary operations and no branching, similar to the representation used by today's tools for automatic differentiation by operator overloading. Secondly, a representation supporting matrixvalued operations, branchings such as if-statements as well as function calls to arbitrary functions (e.g. ODE/DAE integrators). We show that the tool performs favorably compared to CppAD and ADOL-C, two state-of-the-art tools for AD by operator overloading. We also show how the tool can be used to solve a simple optimal control problem, minimal fuel rocket flight, by implementing a simple ODE integrator with sensitivity capabilities and solving the problem with the NLP solver IPOPT. In the last example, we show how we can use the tool to couple the modelling tool JModelica with the optimal control software ACADO Toolkit.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

CONTROLLING TRAINING OF NEURAL NETWORK CLASSIFIERS WITH FUZZY-logic

CONTROLLING TRAINING OF NEURAL NETWORK CLASSIFIERS WITH FUZZ...

引用

3rd workshop ON NEURAL NETWORKS : ACADEMIC / INDUSTRIAL / NASA / DEFENSE ( WNN 92 )

作者： DEROUIN, E BROWN, J Thought Processes Inc Maitland United States

ISBN: (纸本)1565550072

Neural networks have proven very useful in the field of pattern classification by mapping input patterns into one of several categories. The most popular methods of training neural networks use gradient descent techniques to minimize mean square error measured against a training set. The composition of this training set, therefore, will determine the performance of the resulting trained network. Deficiencies in the training set, such as unequal class representation or ineffective training vectors will diminish the network's ultimate performance. Additionally, the characteristics of the training set will implicitly set network performance goals that may or may not match the desired goals of the network designer. This paper investigates the utilization of a fuzzy system to overcome these training set inadequacies by incorporating performance goals into the training strategy. Fuzzy control is used to modify the learning rate parameter during backpropagation training. The method is tested using artificial training data and real-world hyperspectral imagery.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：