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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

187 篇 会议
7 册 图书
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

157 篇 工学
- 147 篇 计算机科学与技术...
- 95 篇 软件工程
- 12 篇 电气工程
- 8 篇 控制科学与工程
- 6 篇 信息与通信工程
- 6 篇 化学工程与技术
- 3 篇 机械工程
- 2 篇 电子科学与技术（可...
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
22 篇 理学
- 17 篇 数学
- 3 篇 物理学
- 3 篇 生物学
- 3 篇 系统科学
12 篇 管理学
- 8 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 2 篇 工商管理
2 篇 文学
- 2 篇 外国语言文学
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...
1 篇 艺术学
- 1 篇 艺术学理论
- 1 篇 音乐与舞蹈学

主题

41 篇 logic programmin...
22 篇 functional progr...
13 篇 semantics
7 篇 temporal logic
6 篇 computer science
5 篇 automatic contro...
4 篇 computer circuit...
4 篇 model checking
4 篇 software enginee...
4 篇 mathematical log...
4 篇 hardware
4 篇 programming lang...
4 篇 specification la...
4 篇 dynamic programm...
4 篇 computer program...
3 篇 fuzzy logic
3 篇 formal logic
3 篇 logic gates
3 篇 computational mo...
3 篇 real-time system...

机构

2 篇 cinvestav gdl de...
2 篇 departamento de ...
2 篇 univ complutense...
2 篇 carnegie mellon ...
2 篇 univ limerick le...
2 篇 nara inst sci & ...
2 篇 univ tokyo
2 篇 cau kiel inst in...
2 篇 tu dortmund univ...
2 篇 univ london impe...
1 篇 univ augsburg de...
1 篇 telecom bretagne...
1 篇 univ innsbruck i...
1 篇 department of co...
1 篇 univ pisa dipart...
1 篇 tu dortmund univ...
1 篇 univ pisa dept c...
1 篇 department of ma...
1 篇 katholieke univ ...
1 篇 univ southern ca...

作者

4 篇 steffen bernhard
3 篇 kobayashi naoki
2 篇 jain v
2 篇 nishitani h
2 篇 stuckey peter j.
2 篇 vidal g
2 篇 albert e
2 篇 grossman ie
2 篇 imafuku k
2 篇 lano k
2 篇 vidal german
2 篇 chavoya a
2 篇 neubauer johanne...
2 篇 sanchez a
2 篇 harjunkoski i
2 篇 ramakrishnan i.v...
2 篇 naujokat stefan
2 篇 hanus m
2 篇 margaria tiziana
2 篇 antoniou grigori...

语言

194 篇 英文
4 篇 其他

检索条件"任意字段=7th International Symposium on Functional and Logic Programming"

共 198 条记录，以下是21-30 订阅

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

详细简洁

排序：

A Calculus of Space, Time, and Causality: Its Algebra, Geometry, logic 7th

A Calculus of Space, Time, and Causality: Its Algebra, Geome...

引用

7th international symposium on Unifying theories of programming, UTP 2019

作者： Hoare, Tony Struth, Georg Woodcock, Jim University of Cambridge Cambridge United Kingdom University of Sheffield Sheffield United Kingdom University of York York United Kingdom

ISBN: (纸本)9783030310370

the calculus formalises human intuition and common sense about space, time, and causality in the natural world. Its intention is to assist in the design and implementation of programs, of programming languages, and of interworking by tool chains that support rational program development. the theses of this paper are that Concurrent Kleene Algebra (CKA) is the algebra of programming, that the diagrams of the Unified Modeling Language provide its geometry, and that Unifying theories of programming (UTP) provides its logic. these theses are illustrated by a formalisation of features of the first concurrent object-oriented language, Simula 67. Each level of the calculus is a conservative extension of its predecessor. We conclude the paper with an extended section on future research directions for developing and applying UTP, CKA, and our calculus, and on how we propose to implement our algebra, geometry, and logic. © 2019, Springer Nature Switzerland AG.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear logic 1

引用

14th international symposium on functional and logic programming (FLOPS)

作者： Matsuoka, Satoshi Natl Inst Adv Ind Sci & Technol 1-1-1 Umezono Tsukuba Ibaraki 3058565 Japan

In this paper, we provide direct encodings into Horn sequents of Multiplicative Linear logic for two NP-complete problems, 3D MATCHING and PARTITION. their correctness proofs are given by using a characterization of m... 详细信息

ISBN: (数字)9783319906867

ISBN: (纸本)9783319906867;9783319906850

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers 1

引用

14th international symposium on functional and logic programming (FLOPS)

作者： Morihata, Akimasa Emoto, Kento Matsuzaki, Kiminori Hu, Zhenjiang Iwasaki, Hideya Univ Tokyo Tokyo Japan Kyushu Inst Technol Kitakyushu Fukuoka Japan Kochi Univ Technol Kami Japan Natl Inst Informat Tokyo Japan Univ Electrocommun Chofu Tokyo Japan

ISBN: (数字)9783319906867

ISBN: (纸本)9783319906867;9783319906850

Vertex-centric graph processing is a promising approach for facilitating development of parallel distributed graph processing programs. Each vertex is regarded as a tiny thread and graph processing is described as cooperation among vertices. this approach resolves many issues in parallel distributed processing such as synchronization and load balancing. However, it is still difficult to develop efficient programs requiring careful problem-specific tuning. We present a method for automatically optimizing vertex-centric graph processing programs. the key is the use of constraint solvers to analyze the subtle properties of the programs. We focus on a functional vertex-centric graph processing language, Fregel, and show that quantifier elimination and SMT (Satisfiability Modulo theories) are useful for optimizing Fregel programs. A preliminary experiment indicated that a modern SMT solver can perform optimization within a realistic time frame and that our method can significantly improve the performance of naively written declarative vertex-centric graph processing programs.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Breaking Symmetries with Lex Implications 1

引用

14th international symposium on functional and logic programming (FLOPS)

作者： Codish, Michael Ehlers, thorsten Gange, Graeme Itzhakov, Avraham Stuckey, Peter J. Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Univ Kiel Dept Comp Sci Kiel Germany Univ Melbourne Dept Comp & Informat Syst Melbourne Vic Australia Data61 CSIRO Melbourne Vic Australia

ISBN: (数字)9783319906867

ISBN: (纸本)9783319906867;9783319906850

Breaking symmetries is crucial when solving hard combinatorial problems. A common way to eliminate symmetries in CP/SAT is to add symmetry breaking constraints. Ideally, symmetry breaking constraints should be complete and compact. the aim of this paper is to find compact and complete symmetry breaks applicable when solving hard combinatorial problems using CP/SAT approach. In particular: graph search problems and matrix model problems where symmetry breaks are often specified in terms of lex constraints. We show that sets of lex constraints can be expressed with only a small portion of their inner lex implications which are a particular form of Horn clauses. We exploit this fact and compute a compact encoding of the row-wise LexLeader and state of the art partial symmetry breaking constraints. We illustrate the approach for graph search problems and matrix model problems.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Confluence Modulo Equivalence with Invariants in Constraint Handling Rules 1

引用

14th international symposium on functional and logic programming (FLOPS)

作者： Gall, Daniel Fruehwirth, thom Univ Ulm Inst Software Engn & Programming Languages D-89069 Ulm Germany

ISBN: (数字)9783319906867

ISBN: (纸本)9783319906867;9783319906850

Confluence denotes the property of a state transition system that states can be rewritten in more than one way yielding the same result. Although it is a desirable property, confluence is often too strict in practical applications because it also considers states that can never be reached in practice. Additionally, sometimes states that have the same semantics in the practical context are considered as different states due to different syntactic representations. By introducing suitable invariants and equivalence relations on the states, programs may have the property to be confluent modulo the equivalence relation w.r.t. the invariant which often is desirable in practice. In this paper, a sufficient and necessary criterion for confluence modulo equivalence w.r.t. an invariant for Constraint Handling Rules (CHR) is presented. It is the first approach that covers invariant-based confluence modulo equivalence for the de facto standard semantics of CHR. there is a trade-off between practical applicability and the simplicity of proving a confluence property. therefore, a better manageable subset of equivalence relations has been identified that allows for the proposed confluence criterion and simplifies the confluence proofs by using well established CHR analysis methods.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Everybody's Got To Be Somewhere 7

Everybody's Got To Be Somewhere

引用

7th Workshop on Mathematically Structured functional programming (MSFP) / 2nd international Conference on Formal Structures for Computation and Deduction (FSCD) part of the Federated logic Conference (FLoC)

作者： McBride, Conor Univ Strathclyde Math Struct Programming Grp Dept Comp & Informat Sci Glasgow Lanark Scotland

the key to any nameless representation of syntax is how it indicates the variables we choose to use and thus, implicitly, those we discard. Standard de Bruijn representations delay discarding maximally till the leaves of terms where one is chosen from the variables in scope at the expense of the rest. Consequently, introducing new but unused variables requires term traversal. this paper introduces a nameless 'co-de-Bruijn' representation which makes the opposite canonical choice, delaying discarding minimally, as near as possible to the root. It is literate Agda: dependent types make it a practical joy to express and be driven by strong intrinsic invariants which ensure that scope is aggressively whittled down to just the support of each subterm, in which every remaining variable occurs somewhere. the construction is generic, delivering a universe of syntaxes with higher-order meta variables, for which the appropriate notion of substitution is hereditary. the implementation of simultaneous substitution exploits tight scope control to avoid busywork and shift terms without traversal. Surprisingly, it is also intrinsically terminating, by structural recursion alone.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Microflows: Leveraging Process Mining and an Automated Constraint Recommender for Microflow Modeling 1

引用

7th international symposium on Business Modeling and Software Design (BMSD)

作者： Oberhauser, Roy Stigler, Sebastian Aalen Univ Comp Sci Dept Aalen Germany

ISBN: (数字)9783319784281

ISBN: (纸本)9783319784281;9783319784274

Businesses and software development processes alike are being challenged by the digital transformation and agility trend. Business processes are increasingly being automated yet are also expected to be agile. Current business process modeling is typically labor-intensive and results in rigid process models. For larger processes it becomes arduous to consider all possible process variations and enactment circumstances. Contemporaneously, in software development microservices have become a popular software architectural style for partitioning business logic into fine-grained services accessible via lightweight protocols which can be rapidly and individually developed by small teams and flexibly (re) deployed. this results in an increasing number of available services and a much more dynamic IT service landscape. thus, a more dynamic form of modeling, integration, and orchestration of these microservices with business processes is needed. this paper describes agile business process modeling with Microflows, an automatic lightweight declarative approach for the workflow-centric orchestration of semantically-annotated microservices using agent-based clients, graph-based methods, and the lightweight semantic vocabularies JSON-LD and Hydra. A graphical modeling tool supports Microflow modeling and provides dynamic constraint and microservice recommendations via a recommender service using machine learning of domain-categorized Microflows. To be able to utilize existing process model knowledge, a case study shows how Microflow constraints can be automatically extracted from existing Business Process Modeling Notation (BPMN) process files and transformed into flexible Microflow constraints, which can then be used to train the recommendation service. Further, it describes process mining of Microflow execution logs to automatically extract BPMN models and automated recovery for errors occurring during enactment.

关键词： Business process modeling Workflow management systems Microservices Service orchestration Agent systems Semantic technology Declarative programming Recommenders Recommendation engines Business process mining Business Process Modeling Notation

来源：评论

学校读者我要写书评

暂无评论

Multirotor Performance Optimization using Genetic Algorithm 7

Multirotor Performance Optimization using Genetic Algorithm

引用

7th international symposium on Embedded Computing and System Design (ISED)

作者： Agarwal, Umang Natl Inst Technol Dept Mech Engn Kurukshetra 136119 Haryana India

ISBN: (纸本)9781538630327

Designing and implementing a multirotor imposes some challenges: limited flight time and take-off mass, motor/propeller matching and unsteady dynamics. In this paper, these challenges are addressed by multi-objective optimization of a multirotor's operational parameters like flight velocity, flight altitude and motor/propeller rpm, and physical parameters like motor, battery and propeller geometry. New contributions are establishing a functional dependence of rotor thrust and power coefficients on design parameters, and incorporating aerodynamic effects within the optimization environment. Additionally, the rationality of optimization is enhanced by modeling physical parameters as discrete variables. the numerical results indicate that Genetic Algorithm reliably finds an optimum design, and improves flight time and maximum take-off mass by 35%.

关键词： Unmanned Aerial Vehicles Genetic Algorithm Multi-Objective Optimization Normal Equations of Least Squares Mixed Integer Non-linear programming

来源：评论

学校读者我要写书评

暂无评论

Parallelization, Modeling, and Performance Prediction in the Multi-/Many Core Area: A Systematic Literature Review 7

Parallelization, Modeling, and Performance Prediction in the...

引用

IEEE 7th international symposium on Cloud and Service Computing (IEEE SC2)

作者： Frank, Markus Hilbrich, Marcus Lehrig, Sebastian Becker, Steffen Tech Univ Chemnitz Chemnitz Germany Univ Stuttgart Stuttgart Germany

ISBN: (纸本)9781538658628

Context: Software developers face complex, connected, and large software projects. the development of such systems involves design decisions that directly impact the quality of the software. For an early decision making, software developers can use model-based prediction approaches for (non-)functional quality properties. Unfortunately, the accuracy of these approaches is challenged by newly introduced hardware features like multiple cores within a single CPU (multicores) and their dependence on shared memory and other shared resources. Objectives: Our goal is to understand whether and how existing model-based performance prediction approaches face this challenge. We plan to use gained insights as foundation for enriching existing prediction approaches with capabilities to predict systems running on multicores. Methods: We perform a Systematic Literature Review (SLR) to identify current model-based prediction approaches in the context of multicores. Results: Our SLR covers the software engineering, embedded systems, High Performance Computing, and Software Performance Engineering domains for which we examined 34 sources in detail. We found various performance prediction approaches which tries to increase prediction accuracy for multicore systems by including shared memory designs to the prediction models. Conclusion: However, our results show that the memory designs models are only in an initial phase. Further research has to be done to improve cache, memory, and memory bandwidth model as well as to include auto tuner support.

关键词： Software Multicore processing Predictive models Unified modeling language Parallel programming Hardware Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Abductive logic programming for Normative Reasoning and Ontologies 7th

Abductive Logic Programming for Normative Reasoning and Onto...

引用

7th international symposium on Artificial Intelligence (ISAI)

作者： Gavanelli, Marco Lamma, Evelina Riguzzi, Fabrizio Bellodi, Elena Riccardo, Zese Cota, Giuseppe Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy

ISBN: (纸本)9783319509532;9783319509525

Abductive logic programming (ALP) has been exploited to formalize societies of agents, commitments and norms, taking advantage from ALP operational support as a (static or dynamic) verification tool. In [7], the most common deontic operators (obligation, prohibition, permission) are mapped into the abductive expectations of an ALP framework for agent societies. Building upon such correspondence, in [5], authors introduced Deon +, a language where obligation and prohibition deontic operators are enriched with quantification over time, by means of ALP and Constraint logic programming (CLP). In recent work [30,31], we have shown that the same ALP framework can be suitable to represent Datalog +/- ontologies. Ontologies are a fundamental component of both the Semantic Web and knowledge-based systems, even in the legal setting, since they provide a formal and machine manipulable model of a domain. In this work, we show that ALP is a suitable framework for representing both norms and ontologies. Normative reasoning and ontological query answering are obtained by applying the same abductive proof procedure, smoothly achieving their integration. In particular, we consider the ALP framework named SCIFF and derived from the IFF abductive framework, able to deal with existentially (and universally) quantified variables in rule heads and CLP constraints. the main advantage is that this integration is achieved within a single language, grounded on abduction in computational logic.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：