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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

69 篇 会议
2 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

41 篇 工学
- 40 篇 计算机科学与技术...
- 25 篇 软件工程
- 7 篇 电气工程
- 7 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
23 篇 理学
- 23 篇 数学
- 3 篇 生物学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学

主题

12 篇 logic programmin...
11 篇 fuzzy logic
6 篇 fuzzy systems
6 篇 semantics
6 篇 fuzzy control
4 篇 fuzzy sets
4 篇 uncertainty
3 篇 computer circuit...
3 篇 control systems
3 篇 fuzzy reasoning
3 篇 artificial intel...
2 篇 computer science
2 篇 application soft...
2 篇 input variables
2 篇 logic
2 篇 linear programmi...
2 篇 specifications
2 篇 speech recogniti...
2 篇 mathematical log...
2 篇 genetic algorith...

机构

2 篇 department of so...
2 篇 school of comput...
2 篇 dipartimento di ...
2 篇 programming rese...
2 篇 queen mary and w...
2 篇 cwi p.o. box 940...
2 篇 university of me...
2 篇 rmit gpo box 247...
1 篇 laboratoire pps ...
1 篇 institut für inf...
1 篇 dipartimento di ...
1 篇 dept.of comp.sci...
1 篇 dipartimento di ...
1 篇 dpto. inforras y...
1 篇 texas a&m univ c...
1 篇 department of co...
1 篇 electrical and c...
1 篇 math& cs departm...
1 篇 dipartimento di ...
1 篇 mathematics depa...

作者

2 篇 klint p.
2 篇 j. yen
2 篇 marchiori massim...
2 篇 jacquet jean-mar...
2 篇 marchiori elena
2 篇 gilbert david
2 篇 hermenegildo man...
2 篇 gori roberta
2 篇 marriott kim
1 篇 poetzsch-heffter...
1 篇 bogju lee
1 篇 vasiloglou vb
1 篇 huangdezhong tia...
1 篇 bowles j
1 篇 j.c. liao
1 篇 pym david
1 篇 adi kamel
1 篇 e.p. glinert
1 篇 tian huangdezhon...
1 篇 bruynooghe mauri...

语言

72 篇 英文

检索条件"任意字段=5th International Conference on Algebraic and Logic Programming, ALP 1996"

共 72 条记录，以下是51-60 订阅

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

详细简洁

排序：

Using fuzzy logic and a hybrid genetic algorithm for metabolic modeling

Using fuzzy logic and a hybrid genetic algorithm for metabol...

引用

Proceedings of the 1996 5th IEEE international conference on Fuzzy Systems. Part 1 (of 3)

作者： Yen, John Lee, Bogju Liao, James C. Texas A&M Univ College Station United States

the identification of metabolic systems such as metabolic pathways, enzyme actions, and gene regulations is a complex task due to the complexity of the system and limited knowledge about the model. Mathematical equations and ODE's have been used to capture the structure of the model, and the conventional optimization techniques have been used to identify the parameters of the model. In general, however, a pure mathematical formulation of the model is difficult due to parametric uncertainty and incomplete knowledge of mechanisms. In this paper, we propose a modeling approach that (1) uses fuzzy rule-based model to augment algebraic enzyme models that are incomplete, and (2) uses a hybrid genetic algorithm (GA) to identify uncertain parameters in the model.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

5th international conference on Database theory, ICDT 1995

5th International Conference on Database Theory, ICDT 1995

引用

5th international conference on Database theory, ICDT 1995

ISBN: (纸本)3540589074

the proceedings contain 33 papers. the special focus in this conference is on Optimization and Nonmonotonic Semantics I. the topics include: Parallel database systems;languages for polynomial-time queries;distributed query optimization in loosely coupled multidatabase systems;on the complexity of generating optimal left-deep processing trees with cross products;querying disjunctive databases through nonmonotonic logics;on the kolmogorov expressive power of boolean query languages;on two forms of structural recursion;partial strictness in two-phase locking;unified transaction model for semantically rich operations;domain-independent queries on databases with external functions;an algebra for pomsets;on the power of stratified logic programs with value invention for expressing database transformations;a stable model semantics for behavioral inheritance in deductive object oriented languages;a rewriting technique for the analysis and the optimization of active databases;sorts in higher-order logic data languages;uniformly-distributed random generation of join orders;a probabilistic view of datalog parallelization;a first step towards implementing dynamic algebraic dependencies;constraint-generating dependencies;optimization using tuple subsumption;deterministic and non-deterministic stable model semantics for unbound DATALOG queries;revision programming, database updates and integrity constraints;some positive results for boundedness of multiple recursive rules;increment boundedness and nonrecursive incremental evaluation of datalog queries;approximation in databases;datalog queries of set constraint databases and space usage in functional query languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

5th international Andrei Ershov Memorial conference, PSI 2003

引用

5th international Andrei Ershov Memorial conference on Perspectives of System Informatics, PSI 2003

ISBN: (纸本)3540208135

the proceedings contain 55 papers. the special focus in this conference is on programming Issues and Software Engineering. the topics include: A grand challenge for computing research;linear types for cashflow reengineering;storing properties in grouped tagged tuples;a polymorphic radix-n framework for fast fourier transforms;intersecting classes and prototypes;making software more flexible;program construction in the context of evolutionary computation;a layered architecture sustaining model-driven and event-driven software development;the outside-in method of teaching introductory programming;numeric types in formal synthesis;on the possibility of provably secure obfuscating programs;verification-oriented language C-light and its structural operational semantics;application to synthesis of contracts;on the visualization and aesthetics of large graphs;data mappings in the model-view-controller pattern;the translation power of the futamura projections;a compiler generator for constraint logic programs;the supercompiler SCP4;partial evaluation for common intermediate language;verification of distributed dataspace architectures;using SPIN and STeP to verify business processes specifications;integrating tools for automatic program verification;open maps and trace semantics for timed partial order models;confidentiality for multithreaded programs via bisimulation;dynamic modification of system structures using LLPNs;principles for entity authentication;causality and replication in concurrent processes;event-driven traversal of logic circuits for re-evaluation of boolean functions in reactive systems;teams of pushdown automata;algebraic state machines: concepts and applications to security;combining aspects of reactive systems;OCL extended with temporal logic and the definition of transitive closure with OCL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the discrete time toolbus 5th

The discrete time toolbus

引用

5th international conference on algebraic Methodology and Software Technology, AMAST 1996

作者： Bergstra, J.A. Klint, P. Programming Research Group University of Amsterdam P.O. Box 41882 Amsterdam1009 DB Netherlands Department of Philosophy Utrecht University Heidelberglaan 8 Utrecht3584 CS Netherlands Department of Software Technology Centre for Mathematics and Computer Science P.O. Box 4079 Amsterdam1009 AB Netherlands

ISBN: (纸本)9783540614630

the notion of "time" plays an important role when coordinating large, heterogeneous, distributed software systems. We present a generic coordination architecture that supports relative and absolute, discrete time. First, we briefly sketch the ToolBus coordination architecture. Next, we give a major example of its use: a distributed auction. Finally, we present the theory underlying our notion of discrete time. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Stepwise introduction and preservation of safety properties in algebraic high-level net systems 3rd

引用

3rd international conference on Fundamental Approaches to Software Engineering (FACE 2000) at the European conference on theory and Practice of Software (ETAPS 2000)

作者： Padberg, J Hoffmann, K Gajewsky, M Tech Univ Berlin Inst Commun & Software Technol D-1000 Berlin Germany

ISBN: (纸本)3540672613

Our approach of rule-based refinement(1) provides a formal description for the stepwise system development based on Petri nets. Rules with a left-hand and a right-hand side allow replacing subnets in a given algebraic high-level net system. the extension of these rules supports the preservation of system properties. In this paper we extend the preservation of safety properties significantly. We define rules, that introduce new safety properties. In our new approach we propose first the verification of properties at the moment they can be expressed and then their preservation further on. Hence, properties can be checked as long as the system is still small. Moreover, introducing properties allows checking these for the relevant subpart only. Changes that are required later on can be treated the same way and hence preserve the system properties. Hence, we have made a step towards a formal technique for the stepwise system development during analysis and design.

关键词： algebraic high-level net systems rule-based refinement temporal logic safety properties safety preserving morphisms safety introducing rules safety preserving rules

来源：评论

学校读者我要写书评

暂无评论

5th international conference on Fundamentals of Computation theory, FCT 1985

5th International Conference on Fundamentals of Computation ...

引用

5th international conference on Fundamentals of Computation theory, FCT 1985

ISBN: (纸本)9783540156895

the proceedings contain 53 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Lower bounds on the complexity of 1-time only branching programs (Preliminary version);on coordinated rewriting;elements of a general theory of combinatorial structures;a language theoretic approach to serialization problem in concurrent systems;logic programming and substitutions;a lower bound on the oscilation complexity of context-free languages;depth efficient transformations of arithmetic into boolean circuits;free cost measures of trees;discrete extremal problems on covering;a unifying theorem for algebraic semantics and dynamic logics;parallel algorithms for connected components in a graph;statistical testing of finite sequences based on algorithmic complexity;lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version);Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete;linear comparison complexity of the n-cube membership problem;string grammars with disconnecting;array processing machines;a fast heuristic for covering polygons by rectangles;on the decidability of the theory of free groups;products of group languages;on some “non-uniform” complexity measures;the complexity of embedding graphs into binary trees;on some topological properties of logic programs;recent results on continuous ordered algebras;are lower bounds on the complexity lower bounds for universal circuits?: Preliminary version;probabilistic algorithms in group theory;recent results on codes;a multiparameter analysis of the boundedness problem for vector addition systems;about two-way transducers;Parallel time O(log N) recognition of unambiguous CFLs;generalized thue-morse sequences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

5th international conference on Parallel Architectures and Languages Europe, PARLE 1993

5th International Conference on Parallel Architectures and L...

引用

5th international conference on Parallel Architectures and Languages Europe, PARLE 1993

ISBN: (纸本)9783540568919

the proceedings contain 79 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Simulation-based comparison of hash functions for emulated shared memory;task management, virtual shared memory, and multithreading in a distributed memory implementation of sisal;simulating the data diffusion machine;an FP based programming language for efficient parallel programming of multiprocessor networks;the data-parallel categorical abstract machinedata parallel implementation of extensible sparse functional arrays;embeddings of tree-related networks in incomplete hypercubes;optimal mappings of m dimensional FFT communication to k dimensional mesh for arbitrary m and k;the united functions and objects approach;detection of recurrences in sequential programs with loops;parallel programming using skeleton functions;data-parallel portable software platform: principles and implementation;a compositional approach for fault-tolerance using specification transformation;concurrent metatem — a language for modelling reactive systems;trace-based compositional reasoning about fault tolerant systems;a kahn principle for networks of nonmonotonic real-time processes;adaptive multicast wormhole routing in 2D mesh multicomputer;the impact of packetization in wormhole-routed networks;a high-performance flat concurrent logic programming system;exploiting recursion-parallelism in prolog;why and how in the elipsys or-parallel CLP system;skewed-associative caches;trace-splitting for the parallel simulation of cache memory;locality and false sharing in coherent-cache parallel graph reduction;SLiD — a cost-effective and scalable limited-directory scheme for cache coherence and formal development of actor programs using structured algebraic petri nets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Colourful linear programming 5th

Colourful linear programming

引用

5th international conference Integer programming and Combinatorial Optimization, IPCO 1996

作者： Bárány, Imre Onn, Shmuel Mathematical Institute of the Hungarian Academy of Sciences P.O.Box127 Budapest1364 Hungary Department of Operations Research School of Industrial Engineering and Management Technion - Israel Institute of Technology Haifa32000 Israel

ISBN: (纸本)3540613102

We consider the following Colourful generalization of Linear programming: given sets of points S 1, ..., S k ⊂ d, referred to as colours, and a point b Ε d, decide whether there is a colourful T = {s 1,...,s k } such that b Ε conv(T), and if there is, find one. Linear programming is obtained by taking k = d + 1 and S 1 = ... = S d +1. If k = d + 1 and b Ε ∩ i=1d+1 conv(S i) then a solution always exists, but finding it is still hard. We describe an iterative approximation algorithm for this problem, that finds a colourful T whose convex hull contains a point Ε-close to b, and analyze its Real Arithmetic and Turing complexities. We then consider a class of linear algebraic relatives of this problem, and give a computational complexity classification for the related decision and counting problems that arise. In particular, Colourful Linear programming is strongly NP-complete. We also introduce and discuss the complexity of a hierarchy of (w1, w2)-Matroid-Basis-Nonbasis problems, and give an application of Colourful Linear programming to the algorithmic problem of Tverberg's theorem in combinatorial geometry. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Proving behavioural theorems with standard first-order logic 4th

引用

4th international conference on algebraic and logic programming, alp 1994

作者： Bidoit, Michel Hennicker, Rolf LIENS C.N.R.S. U.R.A. 1327 & Ecole Normale Supérieure 45 Rue d’Ulm Paris Cedex 05F-75230 France Institut für Informatik Ludwig-Maximilians-Universität München Leopoldstr. 11B MünchenD-80802 Germany

ISBN: (纸本)9783540584315

Behavioural logic is a generalization of first-order logic where the equality predicate is interpreted by a behavioural equality of objects (and not by their identity). We establish simple and general sufficient conditions under which the behavioural validity of some first-order formula with respect to a given first-order specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequence any proof system for first-order logic can be used to prove the behavioural validity of first-order formulas. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

alpSolver: A Solver for Assumable logic programming

ALPSolver: A Solver for Assumable Logic Programming

引用

Intelligent Computing and Human-Computer Interaction (ICHCI), international conference on

作者： Zhizheng Zhang Jiayi Chen Huangdezhong Tian School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications (Southeast University) Ministry of Education China

ISBN: (数字)9798350368284

ISBN: (纸本)9798350368291

Assumable logic programming (alp), an extension of Answer Set programming (ASP), has been theoretically demonstrated to possess significant advantages in addressing problems involving incomplete information. therefore, the development of alp solvers is urgently needed to facilitate further research and applications. this paper proposes a solving algorithm named Answer Set Based View Search (ASBVS) and its optimization to compute the results of alp programs. Based on this, the alpSolver has been implemented and integrated into an online platform for public use. this paper experimentally validates the correctness of the solving algorithm and confirms the advantages of alp in handling default information, indirect exception and abductive reasoning. Additionally, the experimental results demonstrate the effectiveness of the optimization algorithm, with a notable increase in efficiency as the problem scale increases.

关键词： Human computer interaction logic programming Semantics Optimization methods Answer set programming Syntactics Cognition logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：