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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

158 篇 会议
14 册 图书
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

123 篇 工学
- 119 篇 计算机科学与技术...
- 79 篇 软件工程
- 20 篇 电气工程
- 4 篇 信息与通信工程
- 3 篇 控制科学与工程
- 2 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 农业工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 环境科学与工程（可...
42 篇 理学
- 37 篇 数学
- 9 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
13 篇 管理学
- 8 篇 管理科学与工程(可...
- 6 篇 工商管理
- 5 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

26 篇 logic programmin...
9 篇 mathematical log...
9 篇 programming lang...
9 篇 artificial intel...
8 篇 logics and meani...
8 篇 constraint theor...
7 篇 programming tech...
5 篇 constraint satis...
5 篇 semantics
4 篇 constraint logic...
4 篇 computer program...
4 篇 functional progr...
3 篇 object oriented ...
3 篇 prolog (programm...
3 篇 software enginee...
3 篇 computer system ...
2 篇 computer science
2 篇 computer circuit...
2 篇 theory of comput...
2 篇 formal logic

机构

3 篇 ercis leonardo-c...
3 篇 univ complutense...
2 篇 institut für inf...
2 篇 fraunhofer first
2 篇 institut für wir...
2 篇 fraunhofer first...
2 篇 institut für inf...
2 篇 department of in...
2 篇 department of co...
2 篇 cau kiel inst in...
2 篇 michigan state u...
2 篇 htwk leipzig fak...
1 篇 arm inc architec...
1 篇 inria
1 篇 kielce univ tech...
1 篇 facoltà di scien...
1 篇 penn state univ ...
1 篇 singapore manage...
1 篇 univ politecn ca...
1 篇 lomonosov moscow...

作者

8 篇 hanus michael
4 篇 michael hanus
3 篇 hofstedt petra
3 篇 dageförde jan c.
3 篇 kuchen herbert
3 篇 antoy sergio
2 篇 waldmann johanne...
2 篇 sarna-starosta b...
2 篇 teegen finn
2 篇 winkelmann hendr...
2 篇 liu ke
2 篇 caballero rafael
2 篇 lepper markus
2 篇 dillon laura k.
2 篇 ricardo rocha
2 篇 seipel dietmar
2 篇 mossakowski till
2 篇 dasseville ingma...
2 篇 leuschel michael
2 篇 löffler sven

语言

174 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=18th International Workshop on Functional and Constraint Logic Programming"

共 177 条记录，以下是41-50 订阅

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

详细简洁

排序：

FMS: functional programming as a Modelling Language 26th

FMS: Functional Programming as a Modelling Language

引用

26th international workshop on functional and constraint logic programming, WFLP 2018

作者： Dasseville, Ingmar Janssens, Gerda Department of Computer Science KU Leuven Leuven3001 Belgium

ISBN: (纸本)9783030162016

In this paper we introduce the functional Modelling System (FMS). the system introduces the functional Modelling Language (FML), which is a modelling language for NP-complete search problems based on concepts of functional programming. Internally, we translate FML specifications to an Answer Set Program to obtain models. We give a general overview of the new FML language, and how this language is handled in the system. We give a step-by-step walkthrough of the system, pointing out what features are in place, and what improvements are still possible. © 2019, Springer Nature Switzerland AG.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

A progressive resampling algorithm for finding very sparse investment portfolios 3rd

A progressive resampling algorithm for finding very sparse i...

引用

3rd workshop on Mining Data for Financial Applications, MIDAS 2018 and 2nd international workshop on Personal Analytics and Privacy, PAP 2018 held at 18th European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2018

作者： Hassinen, Marko Ukkonen, Antti Department of Computer Science University of Helsinki Helsinki Finland

ISBN: (纸本)9783030134624

the mean-variance framework by Markowitz is a classical approach to portfolio selection. Earlier work has shown that the basic Markowitz portfolios obtained by solving a quadratic program tend to have poor out-of-sample performance. these issues have been addressed by devising sparse variants of Markowitz portfolios in which the number of active positions is reduced either by applying a no-short-selling constraint or L1-regularisation. In this work we consider a combinatorial approach for finding sparse portfolios, which we call naive k-portfolios, that allocate available capital uniformly on a fixed number of k assets, and only take long positions. We present a novel randomised algorithm, progressive resampling, that efficiently finds such portfolios, and compare this with a number of well-known portfolio selection strategies using public stock price data. We find that naive k-portfolios can be a viable alternative to L1-regularisation when constructing sparse portfolios. © Springer Nature Switzerland AG 2019.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Multi-paradigm programming in Maude 1

引用

12th international workshop on Rewriting logic and its Applications (WRLA)

作者： Escobar, Santiago Univ Politecn Valencia DSIC ELP Valencia Spain

ISBN: (数字)9783319998404

ISBN: (纸本)9783319998404;9783319998398

Modern multi-paradigm programming languages combine the most important features of functional programming, logic programming, concurrent programming, and constraint programming. Multi-paradigm programming applied to the Maude specification language would replace the functional viewpoint by an equational viewpoint while retaining and extending the other features. A former paper illustrated how many features available in modern functional logic languages are easily definable and simulated in Maude, and showed how Maude goes beyond standard practices in the functional logic area by using, e.g. equational properties such as associativity and commutativity or order-sorted information. As a practical application the paper used the Missionaries and Cannibals equational logic program given by Goguen and Meseguer for Eqlog in the eighties. However, no relevant execution results were included due to the preliminary implementation of narrowing in Maude. In this paper we provide more relevant execution results by changing the focus from narrowing with rules (i.e., symbolic reachability) into narrowing with variant equations (i.e., equational unification), the latter now implemented in Maude 2.7.1 with very good performance.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

12th international workshop on Rewriting logic and its Applications, WRLA 2018

12th International Workshop on Rewriting Logic and its Appli...

引用

12th international workshop on Rewriting logic and its Applications, WRLA 2018

ISBN: (纸本)9783319998398

the proceedings contain 14 papers. the special focus in this conference is on Rewriting logic and its Applications. the topics include: Proving ground confluence of equational specifications modulo axioms;uniform strong normalization for multi-discipline calculi;real-time rewriting logic semantics for spatial concurrent constraint programming;Approximating any logic program by a CS-program;multi-paradigm programming in maude;MUnit: A unit framework for maude;parameterized programming for compositional system specification;Symbolic specification and verification of data-aware BPMN processes using rewriting modulo SMT;associative unification and symbolic reasoning modulo associativity in maude;proving structural properties of sequent systems in rewriting logic;formal modeling and analysis of the walter transactional data store;extending timbuk to verify functional programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Test Program Generator MicroTESK for RISC-V 19

Test Program Generator MicroTESK for RISC-V

引用

19th international workshop on Microprocessor and SOC Test, Security and Verification (MTV)

作者： Chupilko, Mikhail Kamkin, Alexander Kotsynyak, Artem Protsenko, Alexander Smolov, Sergey Tatarnikov, Andrei RAS ISP Ivannikov Inst Syst Programming Moscow Russia Lomonosov Moscow State Univ MSU Moscow Russia MIPT Moscow Russia Natl Res Univ Higher Sch Econ HSE Moscow Russia

ISBN: (纸本)9781538692509

the paper presents a test program generator for functional verification of RISC-V microprocessors. the generator is implemented on the base of MicroTESK framework and consists of formal specifications of RISC-V ISA and ISA-independent core. the specifications describe instructions' syntax and semantics and can be easily modified to support more instructions (including custom extensions). the core implements techniques of instruction sequences composition and test data generation. Test programs are generated from test templates, describing the programs' structural and behavioral properties;among generation techniques, random, combinatorial, and constraint-based ones are supported.

关键词： functional verification ISA MicroTESK RISC-V

来源：评论

学校读者我要写书评

暂无评论

constraint logic programming over Infinite Domains with an Application to Proof 30

Constraint Logic Programming over Infinite Domains with an A...

引用

30th workshops on (constraint) logic programming (WLP) / 24th international workshop on functional and (constraint) logic programming (WFLP)

作者： Krings, Sebastian Leuschel, Michael Heinrich Heine Univ Dusseldorf Inst Informat Univ Str 1 D-40225 Dusseldorf Germany

We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and if this has an impact on the soundness of the result. We present a technique which guarantees soundness in the following way: if the constraint solver finds a solution it is guaranteed to be correct;if the constraint solver fails to find a solution it can either return the result "definitely false" in case it knows enumeration was exhaustive, or "unknown" in case it was aborted. the technique can deal with nested universal and existential quantifiers. It can easily be extended to set comprehensions and other operators introducing new quantified variables. We show applications in data validation and proof.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A Practical Study of Control in Objected-Oriented-functional-logic programming with Paisley 30

A Practical Study of Control in Objected-Oriented-Functional...

引用

30th workshops on (constraint) logic programming (WLP) / 24th international workshop on functional and (constraint) logic programming (WFLP)

作者： Trancon y Widemann, Baltasar Lepper, Markus Ilmenau Univ Technol Ilmenau Germany Semant GmbH Aachen Germany

Paisley is an extensible lightweight embedded domain-specific language for nondeterministic pattern matching in Java. Using simple APIs and programming idioms, it brings the power of functional-logic processing of arbitrary data objects to the Java platform, without constraining the underlying object-oriented semantics. Here we present an extension to the Paisley framework that adds pattern-based control flow. It exploits recent additions to the Java language, namely functional interfaces and lambda expressions, for an explicit and transparent continuation-passing style approach to control. We evaluate the practical impact of the novel features on a real-world case study that reengineers a third-party open-source project to use Paisley in place of conventional object-oriented data query idioms. We find the approach viable for incremental refactoring of legacy code, with significant qualitative improvements regarding separation of concerns, clarity and intentionality, thus making for easier code understanding, testing and debugging.

关键词： pattern matching control flow embedded domain-specific language object orientation refactoring

来源：评论

学校读者我要写书评

暂无评论

SequenceLanguage: A constraint Random MP-RIS Generation Framework 18

SequenceLanguage: A Constraint Random MP-RIS Generation Fram...

引用

18th international workshop on Microprocessor and SOC Test, Security and Verification (MTV)

作者： Pappireddy, Madhukar Reddy Ravi, Bipin ARM Inc Architecture & Technol Grp Austin TX 78735 USA

ISBN: (纸本)9781538633519

Modern System-on-chip designs implement processors in a multi-core, multi-cluster configurations making the verification of such designs an overwhelming task. Several industry standard MP-RIS test generators have been adopted by verification engineers across companies which provide robust solutions to the challenging task of verification/validation of complex multi-processor designs. Such generators are continuously improved to add more functionality to support wide range of stimulus for functional verification, in the process of which, could become unwieldy and difficult to be adopted by early stage designs. Hitting corner/special cases at top level using constrained random stimulus through these RIS generators is a task faced with huge hurdles (limited compute slots/time/randomness/large state space!!). these cases could be hit with directed tests but, real world scenarios are rarely directed. that's where SequenceLanguage (SL) comes into the picture. Insertion of highly directed interesting "Sequences" between long chains of random instructions to hit potential bugs as well as improve functional coverage is invaluable for Coverage-Driven Verification Methodology. SequenceLanguage is built over the existing generator core by leveraging the capabilities of underlying utilities and modules. It provides a user-friendly framework for engineers to rapidly develop useful suite of tests without the nuances of complex generator syntax.

关键词： RIS (Random Instruction Stream) MP-RIS (Multi Processor RIS) SL (SequenceLanguage) PE (Processing Element) ARMv8 Architecture Verification API (Application programming Interface)

来源：评论

学校读者我要写书评

暂无评论

An Agglomeration Law for Sorting Networks and its Application in functional programming 30

An Agglomeration Law for Sorting Networks and its Applicatio...

引用

30th workshops on (constraint) logic programming (WLP) / 24th international workshop on functional and (constraint) logic programming (WFLP)

作者： Schiller, Lukas Immanuel Univ Marburg Marburg Germany

In this paper we will present a general agglomeration law for sorting networks. Agglomeration is a common technique when designing parallel programmes to control the granularity of the computation thereby finding a better fit between the algorithm and the machine on which the algorithm runs. Usually this is done by grouping smaller tasks and computing them en bloc within one parallel process. In the case of sorting networks this could be done by computing bigger parts of the network with one process. the agglomeration law in this paper pursues a different strategy: the input data is grouped and the algorithm is generalised to work on the agglomerated input while the original structure of the algorithm remains. this will result in a new access opportunity to sorting networks well-suited for efficient parallelization on modern multicore computers, computer networks or GPGPU programming. Additionally this enables us to use sorting networks as (parallel or distributed) merging stages for arbitrary sorting algorithms, thereby creating new hybrid sorting algorithms with ease. the expressiveness of functional programming languages helps us to apply this law to systematically constructed sorting networks, leading to efficient and easily adaptable sorting algorithms. An application example is given, using the Eden programming language to show the effectiveness of the law. the implementation is compared with different parallel sorting algorithms by runtime behaviour.

关键词： Agglomeration

来源：评论

学校读者我要写书评

暂无评论

Optimization of Freight Transportation Brokerage Using Agents and constraints 18th

引用

18th international Conference on Engineering Applications of Neural Networks (EANN)

作者： Badica, Amelia Badica, Costin Leon, Florin Danciulescu, Daniela Univ Craiova Craiova Romania Tech Univ Gheorghe Asachi Iasi Iasi Romania

ISBN: (纸本)9783319651729;9783319651712

In this paper we address the problem of declarative modeling of freight transportation brokering using agents and constraints. Our model can be used for the optimization of vehicle assignments to customer orders that request the transportation of freight from source to destination points. the advantage is that a single vehicle can serve multiple customer orders on its multi-hop route that is part of a solution schedule. Our model is mapped to the ECLiPSe constraint logic programming system such that optimal schedules can be automatically computed using the available constraint solvers. We propose a method and protocol for integrating this constraint-based scheduler into a multi-agent system.

关键词： Combinatorial optimization Pickup and delivery problem constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：