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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

85 篇 期刊文献
83 篇 会议
3 册 图书
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

157 篇 工学
- 138 篇 计算机科学与技术...
- 68 篇 软件工程
- 20 篇 电气工程
- 12 篇 信息与通信工程
- 9 篇 控制科学与工程
- 3 篇 仪器科学与技术
- 2 篇 机械工程
- 2 篇 动力工程及工程热...
- 2 篇 石油与天然气工程
- 1 篇 力学（可授工学、理...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
29 篇 理学
- 22 篇 数学
- 3 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 科学技术史(分学科...
8 篇 管理学
- 6 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
3 篇 哲学
- 1 篇 哲学
2 篇 教育学
- 2 篇 教育学
1 篇 农学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

174 篇 declarative prog...
18 篇 logic programmin...
10 篇 answer set progr...
8 篇 prolog
6 篇 imperative progr...
6 篇 constraint progr...
5 篇 constraints
5 篇 artificial intel...
5 篇 program complete...
5 篇 programming lang...
4 篇 program correctn...
4 篇 languages
4 篇 extensible middl...
4 篇 search
4 篇 metadata
4 篇 multidimensional...
4 篇 separation of co...
3 篇 cartesian progra...
3 篇 parallelism
3 篇 deductive databa...

机构

6 篇 univ pisa dept c...
3 篇 univ penn philad...
3 篇 linkoping univ d...
3 篇 univ new s wales...
3 篇 polish acad sci ...
2 篇 univ malaga lcc ...
2 篇 vrije universite...
2 篇 univ texas arlin...
2 篇 linkoping univ i...
2 篇 rise kista
2 篇 cau kiel inst in...
2 篇 univ parma dipar...
2 篇 univ politecn va...
2 篇 univ turku turku
2 篇 polish acad sci ...
2 篇 univ bergen berg...
2 篇 univ americas pu...
2 篇 johns hopkins un...
2 篇 university of am...
2 篇 vrije univ bruss...

作者

7 篇 forti stefano
7 篇 brogi antonio
5 篇 drabent wlodzimi...
4 篇 mancilla blanca
4 篇 plaice john
3 篇 ferrari gian-lui...
3 篇 hellerstein jose...
3 篇 calimeri frances...
3 篇 loo boon thau
3 篇 hanus michael
3 篇 germano stefano
3 篇 gopal sriram
2 篇 barash mikhail
2 篇 casadei roberto
2 篇 stevens reinout
2 篇 salvador lucas
2 篇 henderson chris
2 篇 varela carlos a.
2 篇 stokke knut ande...
2 篇 enrico pontelli

语言

159 篇 英文
14 篇 其他
1 篇 中文

检索条件"主题词=DECLARATIVE PROGRAMMING"

共 174 条记录，以下是111-120 订阅

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

详细简洁

排序：

From Non-determinism to Goroutines: A Fair Implementation of Curry in Go 2021

From Non-determinism to Goroutines: A Fair Implementation of...

引用

23rd International Symposium on Principles and Practice of declarative programming (PPDP)

作者： Boehm, Jonas Hanus, Michael Teegen, Finn CAU Kiel Inst Informat Kiel Germany

ISBN: (纸本)9781450386890

The declarative programming language Curry amalgamates demand-driven evaluation from functional programming with non-determinism from logic programming. In contrast to Prolog, the search strategy for non-deterministic computations is not fixed so that complete or parallel strategies are reasonable for Curry. In particular, a desirable option is a fair strategy which frees the programmer from considering the influence of the search strategy to the success of a computation. In this paper we describe an implementation with this property. Based on recent developments on operational models for functional logic programming, we present a new implementation which transforms Curry programs in several transformation steps into Go programs. By exploiting lightweight threads in the form of goroutines, we obtain a complete and fair implementation which automatically uses multi-processing to speed up non-deterministic computations. This has the effect that, in some cases, non-deterministic algorithms are more efficiently evaluated than deterministic ones.

关键词： declarative programming implementation parallelism

来源：评论

学校读者我要写书评

暂无评论

DeXteR - An Extensible Framework for declarative Parameter Passing in Distributed Object Systems

引用

9th International Middleware Conference

作者： Gopal, Sriram Tansey, Wesley Kannan, Gokulnath C. Tilevich, Eli Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA

ISBN: (纸本)9783540898559

In modern distributed object systems, reference parameters are passed to a remote method based on their runtime type. We argue that such type-based parameter passing is limiting with respect to expressiveness, readability, and maintainability, and that parameter passing semantics should be decoupled from parameter types. We present declarative parameter passing, an approach that fully decouples parameter passing semantics from parameter types in distributed object systems. In addition, we describe DeXteR, an extensible framework for transforming a type-based remote parameter passing model to a declaration-based model transparently. Our framework leverages aspect-oriented and generative programming techniques to enable adding new remote parameter passing semantics, without requiring detailed understanding of the underlying middleware implementation. Our approach is applicable to both application and library code and incurs negligible performance overhead. We validate the expressive power of our framework by adding several non-trivial remote parameter passing semantics (i.e., copy-restore, lazy, streaming) to Java RMI.

关键词： Extensible Middleware Metadata Parameter Passing Aspect Oriented programming declarative programming

来源：评论

学校读者我要写书评

暂无评论

The Practical Uses of TransLucid

The Practical Uses of TransLucid

引用

1st International Workshop on Context-Aware Software Technology and Applications

作者： Plaice, John Mancilla, Blanca Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

ISBN: (纸本)9781605587073

TransLucid is a declarative coordination language in which all expressions vary according to an arbitrarily-dimensional context. Using only the concepts of context change and of context query, a wide variety of programming constructs are demonstrated to be easily programmed in Trans Lucid. The language can therefore be used in its own right or as a target language for different paradigms.

关键词： Cartesian programming Lucid language declarative programming multidimensional programming context-aware programming

来源：评论

学校读者我要写书评

暂无评论

Unifying Execution of Imperative and declarative Code 11

Unifying Execution of Imperative and Declarative Code

引用

33rd International Conference on Software Engineering (ICSE)

作者： Milicevic, Aleksandar Rayside, Derek Yessenov, Kuat Jackson, Daniel MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781450304450

We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, written in first-order relational logic with transitive closure, and the imperative language is Java. By being able to mix imperative code with executable declarative specifications, the user can easily express constraint problems in place, i.e., in terms of the existing data structures and objects on the heap. After a solution is found, the heap is updated to reflect the solution, so the user can continue to manipulate the program heap in the usual imperative way. We show that this approach is not only convenient, but, for certain problems can also outperform a standard imperative implementation. We also present an optimization technique that allowed us to run our tool on heaps with almost 2000 objects.

关键词： formal methods executable specifications declarative programming constraint-based languages

来源：评论

学校读者我要写书评

暂无评论

Picture resolution enhancement

Picture resolution enhancement

引用

Conference on Visual Data Exploration and Analysis IV

作者： Boyd, E Akama, K Brody, B Univ. of Hokkaido (United States) Univ. of Hokkaido (Japan) Univ. of Alaska/Fairbanks (United States)

ISBN: (纸本)0819424285

When making an animation by moving inside a three dimensional scene, areas close to the camera will be larger on the screen and the limited resolution of the data will become visible. To make a more natural appearing scene it is necessary to enhance the resolution of these areas. An initial version is made from the lower resolution data by interpolation and then individual pixels are adjusted to make it better match a desired texture. The texture is derived from a number of closeup photographs by a classification algorithm which compares the local low resolution data with low resolution versions of the closeups. Rather than choosing a single closeup as a target texture, the classification algorithm generates a similarity score between the region to be enhanced and each of the closeup samples. This score is then used as a weighting function to determine how strongly each of the closeups is used to correct the enhanced region. The closeups may be used directly by comparing them to the enhanced region as it is being corrected, or for increased efficiency, they may be measured for some parameters and then the enhanced region is made to match these parameters.

关键词： image processing Prolog neural net texture classification genetic algorithm declarative programming

来源：评论

学校读者我要写书评

暂无评论

A declarative Approach to Information Extraction Using Web Service API 16th

A Declarative Approach to Information Extraction Using Web S...

引用

16th International Conference on Web Engineering (ICWE)

作者： Samuel, John Rey, Christophe Univ Lyon LIRIS CNRS UMR CNRS 5205 Lyon France Univ Clermont Ferrand LIMOS UMR CNRS 6158 Aubiere France

ISBN: (纸本)9783319387918;9783319387901

The number of diverse web services that we use regularly is significantly increasing. Most of these services are managed by autonomous service providers. However it has become very difficult to get a unified view of this widespread data, which in all likelihood is substantially important to enterprises. A classical approach followed by the enterprises is to write applications using imperative languages making use of the web service API. Such an approach is not scalable and is difficult to maintain considering the ever-evolving web services landscape. This tutorial explores a semi-automated declarative approach to information extraction from the web services using a classical virtual data integration approach, namely mediation, that relies on a well-known query rewriting algorithm, namely the inverse-rules algorithm. It is targeted to audience from both industry as well as academia and requires a basic understanding of database principles and web technologies.

关键词： Data integration Web services Application programming interface declarative programming

来源：评论

学校读者我要写书评

暂无评论

Industrial Big Data Analytics Lessons from the trenches 1

Industrial Big Data Analytics Lessons from the trenches

引用

International Workshop on Big Data Software Engineering

作者： Villanustre, Flavio LexisNexis Risk Solut Reed Elsevier Atlanta GA 30303 USA

ISBN: (纸本)9781467370257

Big Data Analytics in particular and Data Science in general have become key disciplines in the last decade. The convergence of Information Technology, Statistics and Mathematics, to explore and extract information from Big Data have challenged the way many industries used to operate, shifting the decision making process in many organizations. A new breed of Big Data platforms has appeared, to fulfill the needs to process data that is large, complex, variable and rapidly generated. The author describes the experience in this field from a company that provides Big Data analytics as its core business.

关键词： Big Data Distributed Algorithms declarative programming Dataflow programming Abstraction Models

来源：评论

学校读者我要写书评

暂无评论

Querying the History of Software Projects using QWALKEKO 30

Querying the History of Software Projects using QWALKEKO

引用

30th IEEE International Conference on Software Maintenance and Evolution (ICSME)

作者： Stevens, Reinout De Roover, Coen Vrije Univ Brussel Software Languages Lab Brussels Belgium Osaka Univ Software Engn Lab Osaka Japan

ISBN: (纸本)9780769553030

We present the QWALKEKO meta-programming library for Clojure that enables querying the history of versioned software projects in a declarative manner. Unique to this library is its support for regular path expressions within history queries. Regular path expressions are akin to regular expressions, except that they match a sequence of successive snapshots of a software project along which user-specified logic conditions must hold. Such logic conditions can concern the source code within a snapshot, versioning information associated with the snapshot, as well as patterns of source code changes with respect to other snapshots. We have successfully used the resulting multi-faceted queries to detect refactorings in project histories. In this paper, we discuss how applicative logic meta-programming enabled combining the heterogenous components of QWALKEKO into a uniform whole. We focus on the applicative logic interface to a new implementation of a well-known change distilling algorithm. We use the problem of detecting and categorizing changes made to SELENIUM-based test scripts for illustration purposes.

关键词： declarative programming history querying mining software repositories program querying

来源：评论

学校读者我要写书评

暂无评论

Program Synthesis for declarative Systems

Program Synthesis for Declarative Systems

引用

作者： Chen, Haoxian University of Pennsylvania

学位级别：Ph.D., Doctor of Philosophy

Formal methods are essential in assuring system correctness. However, formal specification languages have steep learning curves, thus hindering broader application to system development in practice. To address this problem, we propose NetSpec, a tool that generates system specification via intuitive example-based interface, DeCon, a high-level language for Ethereum smart contracts that provides unified interfaces for contract implementation and specification, and DCV, a safety verification tool for DeCon. NetSpec aims to be i) highly expressive, capable of synthesizing network specifications with complex semantics; ii) scalable, by virtue of using a novel stochastic search algorithm to efficiently explore an unbounded solution space, and iii) robust, avoiding the need for exhaustive input-output examples by actively generating new examples. Our experiments demonstrate that NetSpec can synthesize a wide range of specifications used in network verification, analysis, and implementations. Furthermore, NetSpec improves upon existing approaches in terms of expressiveness, efficiency, and robustness to examples. DeCon, a specification language for Ethereum smart contracts, models a contract as a set of relational tables that store transaction records, driven by the observation that smart contract operations and contract-level properties can be naturally expressed as relational constraints. This relational representation enables convenient specification of contract properties, facilitates run-time monitoring of potential property violations, and brings clarity to debugging via data provenance. DeCon programs are compiled into executable Solidity programs, with instrumentation for run-time property monitoring. Our case studies demonstrate that DeCon can implement realistic smart contracts such as ERC20 and ERC721 digital tokens. The evaluation shows that DeCon has comparable efficiency with the open-source reference implementation, incurring 14% median gas overhead for exec

关键词： Computer networks declarative programming Program synthesis Program verification Smart contracts NetSpec DeCon

来源：评论

学校读者我要写书评

暂无评论

declarative Provisioning of Virtual Network Function Chains in Intent-based Networks 9

Declarative Provisioning of Virtual Network Function Chains ...

引用

9th IEEE International Conference on Network Softwarization (IEEE NetSoft) - Boosting Future Networks through Advanced Softwarization

作者： Massa, Jacopo Forti, Stefano Paganelli, Federica Dazzi, Patrizio Brogi, Antonio Univ Pisa Dept Comp Sci Pisa Italy

ISBN: (纸本)9798350399806

Intent-based Networking (IBN) aims at simplifying network configuration and management by using high-level objectives that express the desired state of the network rather than the details of how to implement it. In this article, we propose a declarative methodology and an associated open-source Prolog prototype (i) to model IBN intents related to the provisioning of Virtual Network Function (VNF) chains, and (ii) to process those intents to assemble and place a VNF chain that fulfils them. Our prototype is assessed over a lifelike motivating scenario.

关键词： intent-based networking declarative programming virtual network functions cloud-edge continuum

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：