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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

168 篇 会议
14 册 图书
10 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

120 篇 工学
- 103 篇 计算机科学与技术...
- 90 篇 软件工程
- 8 篇 电气工程
- 7 篇 信息与通信工程
- 3 篇 冶金工程
- 2 篇 力学（可授工学、理...
- 2 篇 材料科学与工程（可...
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 交通运输工程
- 1 篇 矿业工程
- 1 篇 生物工程
18 篇 理学
- 16 篇 数学
- 2 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
18 篇 管理学
- 10 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 2 篇 工商管理
1 篇 教育学
- 1 篇 教育学

主题

15 篇 programming
13 篇 software enginee...
13 篇 computer languag...
11 篇 languages
10 篇 query languages
10 篇 computer program...
9 篇 database languag...
9 篇 programming tech...
8 篇 computer science
8 篇 logic programmin...
8 篇 programming lang...
7 篇 programming prof...
7 篇 application soft...
7 篇 mathematical log...
7 篇 databases
7 篇 artificial intel...
6 篇 object oriented ...
6 篇 concurrent compu...
6 篇 xml
6 篇 parallel program...

机构

4 篇 univ edinburgh e...
2 篇 transnct univ li...
2 篇 univ colorado bo...
2 篇 transnat univ li...
2 篇 hasselt univ has...
2 篇 univ oslo oslo
2 篇 ibm corp tj wats...
2 篇 univ mons b-7000...
2 篇 tu dortmund univ...
2 篇 univ koblenz lan...
2 篇 university of ok...
1 篇 computing depart...
1 篇 department of co...
1 篇 polytech inst po...
1 篇 univ oslo dept i...
1 篇 poznan univ life...
1 篇 the hong kong an...
1 篇 xerox research c...
1 篇 riken aics wako ...
1 篇 school of comput...

作者

4 篇 steffen bernhard
3 篇 van den bussche ...
2 篇 peshansky igor
2 篇 procter adam
2 篇 gelade wouter
2 篇 krumrey marco
2 篇 page rex
2 篇 horváth zoltán
2 篇 allwein gerard
2 篇 zsók viktória
2 篇 smyth steven
2 篇 bosselmann steve
2 篇 neven frank
2 篇 becchi michela
2 篇 harrison william...
2 篇 anon
2 篇 graves ian
2 篇 laemmel ralf
2 篇 wijsen jef
2 篇 reichenbach chri...

语言

188 篇 英文
4 篇 其他

检索条件"任意字段=11th International Symposium on Database Programming Languages"

共 192 条记录，以下是11-20 订阅

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

详细简洁

排序：

Set Functions for Functional Logic programming

Set Functions for Functional Logic Programming

引用

11th international ACM SIGPLAN symposium on Principles and Practice of Declarative programming (PPDP 09)

作者： Antoy, Sergio Hanus, Michael Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (纸本)9781605585680

We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the results of a corresponding ordinary operation. A characteristic feature of our approach is the complete separation between a usually-non-deterministic operation and its possibly-non-deterministic arguments. this separation leads to the first provably order-independent approach to computing the set of values of non-deterministic expressions. the proof is provided within the framework of graph rewriting in constructor-based systems. We propose an abstract implementation of our approach and prove its independence of the order of evaluation. Our approach solves easily and naturally problems mishandled by current implementations of functional logic languages.

关键词： Functional Logic programming languages Non-Determinism Subspaces Rewrite Systems

来源：评论

学校读者我要写书评

暂无评论

Optimization schemas for parallel implementation of nondeterministic languages and systems

Optimization schemas for parallel implementation of nondeter...

引用

11th international Parallel Processing symposium (IPPS 97)

作者： Gupta, G Pontelli, E New Mexico State Univ Las Cruces United States

ISBN: (纸本)0818677937

Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language) can result in poor performance. We present three optimization schemas based on flattening of the computation tree, procrastination of overheads, and sequentialization of computations that can be systematically applied to parallel implementations of non-deterministic systems/languages to reduce the parallel overhead and to obtain improved efficiency of parallel execution. the effectiveness of these schemas is illustrated by applying them to the ACE parallel logic programming system. Performance data presented shows that considerable improvement in performance can result.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Scrap Your Boilerplate-Prologically! PPDP'09 Invited Talk

Scrap Your Boilerplate-Prologically! PPDP'09 Invited Talk

引用

11th international ACM SIGPLAN symposium on Principles and Practice of Declarative programming (PPDP 09)

作者： Laemmel, Ralf Univ Koblenz Landau Software Languages Team Koblenz Germany

ISBN: (纸本)9781605585680

"Scrap Your Boilerplate" (SYB) is an established style of generic functional programming. the present paper reconstructs SYB within the Prolog language with the help of the univ operator and higher-order logic programming techniques. We pay attention to the particularities of Prolog. For instance, we deal with traversal of non-ground terms. We also develop an alternative model of SYB-like traversal based on metaprogramming. this generative, type-driven model is also amenable to type-driven optimization.

关键词： Scrap Your Boilerplate Haskell Prolog Stratego

来源：评论

学校读者我要写书评

暂无评论

A Linear programming Approach for Deadline Assignment of Update Transactions in Co-Scheduling Environment 14

A Linear Programming Approach for Deadline Assignment of Upd...

引用

14th international symposium on Pervasive Systems, Algorithms and Networks (I-SPAN) / 11th international Conference on Frontier of Computer Science and Technology (FCST) / 3rd international symposium of Creative Computing (ISCC)

作者： Li, Guohui Deng, Chenggang Li, Jianjun Zhou, Quan Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China

ISBN: (纸本)9781538608401

Deriving deadline and period for update transactions has long been recognized as an important problem in real-time database research. Despite years of active study, the state of the art only focuses on scheduling of update or control transaction separately. In this paper, we study the problem of deriving deadlines for update transactions in co-scheduling environment upon uniprocessor platforms. We consider how to compute deadlines for update transactions to minimize the total workload of the transaction set, while maintaining the temporal validity of real-time data objects and guaranteeing the EDF-schedulability of the hybrid transaction set. To address this problem, we propose a linear programming approach to derive deadlines for update transactions, namely DC-LP (Deadline Calculation based on Linear programming). Finally, the success ratio, workload and time performance of DC-LP are evaluated through extensive simulation experiments.

关键词： real-time database real-time co-scheduling temporal consistency update transaction

来源：评论

学校读者我要写书评

暂无评论

Alias analysis for Fortran90 array slices

Alias analysis for Fortran90 array slices

引用

11th international Parallel Processing symposium (IPPS 97)

作者： Gopinath, K Seshadri, R INST IND SCI DEPT COMP SCI & AUTOMATBANGALOREKARNATAKAINDIA

Most alias analyses produce approximate results in the presence of array slices. this may lead to inefficient code which is of concern, especially, in languages like Fortran90. in this paper, we present an overview of... 详细信息

ISBN: (纸本)0818677937

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

Creating database queries by demonstration

Creating database queries by demonstration

引用

Proceedings of the 11th IEEE symposium on Visual languages

作者： Sugiura, Atsushi Koseki, Yoshiyuki NEC Corp Kawasaki Japan

programming by demonstration (PBD) systems offer an advantage of easy programming. However, they have difficulty in inferring user intent behind user actions, because of ambiguity of those actions. this paper describes a novel approach `action management' to the inference problem. It is based on an idea that PBD systems are able to properly determine user intent by making users demonstrate only non-ambiguous actions. With the action management approach, a PBD system for creating database queries, called DADIE, can correctly infer user intent even in creating complex queries, such as join, group-by and subquery.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Querying structural and behavioral properties of business processes

引用

11th international symposium on database programming languages

作者： Deutch, Daniel Milo, Tova Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel

ISBN: (纸本)9783540759867

BPQL is a novel query language for querying business process specifications, introduced recently in [5,6]. It is based on an intuitive model of business processes as rewriting systems, an abstraction of the emerging BPEL (Business Process Execution Language) standard [7]. BPQL allows users to query business processes visually, in a manner very analogous to the language used to specify the processes. the goal of the present paper is to study the formal model underlying BPQL and investigate its properties as well as the complexity of query evaluation. We also study its relationship to previously suggested formalisms for process modeling and querying. In particular we propose a query evaluation algorithm of polynomial data complexity that can be applied uniformly to queries on the structure of the process specification as well as on the potential behavior of the defined process. We show that unless P=NP the efficiency of our algorithm is asymptotically optimal.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

A Dynamically Customizable Process-Centered Evaluation Model

A Dynamically Customizable Process-Centered Evaluation Model

引用

11th international ACM SIGPLAN symposium on Principles and Practice of Declarative programming (PPDP 09)

作者： Clerici, Silvia Zoltan, Cristina Univ Politecn Cataluna Dept Llenguatges & Sistemes Informat Barcelona Spain

ISBN: (纸本)9781605585680

We present the graph operational semantics approach used for defining NiMo nets execution, which mix lazy, data-driven and a weak form of eager evaluation, all in parallel. NiMo is a totally graphic language from the family of higher order typed languages but with a strong data-flow inspiration. Programs are process networks that evolve showing the full state at each execution step and can be dynamically changed or completed. In NiMo parallelization is implicit. the conjunction of two kinds of tags determine which processes are able to act in the same execution step. According to their tag, processes can behave in five modes that can be globally or locally set for each one, and can be also dynamically changed. Combining modes gives a very flexible way to experiment different strategies to increase processor usage, decrease channel population, and achieve subnet synchronization. Together with symbolic execution it also provides the means for generative and multi-stage programming.

关键词： Computation model functional languages

来源：评论

学校读者我要写书评

暂无评论

Datalog programs over infinite databases, revisited - (Extended abstract)

引用

11th international symposium on database programming languages

作者： Cohen, Sara Gil, Joseph (Yossi) Zarivach, Evelina Technion Israel Inst Technol IL-32000 Haifa Israel

ISBN: (纸本)9783540759867

this paper's revisit of infinite relational databases, a model traditionally perceived as purely theoretical, was sparked by a concrete implementation setting, and the results obtained here were used in a practical database problem. in the course of implementing a database system for querying Java software, we found that the universe of Java code can be effectively modeled as an infinite database. this modeling makes it possible to distinguish between queries which are "open-ended," that is, whose result may grow as software components are added into the system, and queries which are "closed," in that their result does not change as the software base grows. Further, closed queries can be implemented much more efficiently than open queries. Achievements include an algorithm for distinguishing between these two kinds of queries (we assume that queries are written in Datalog), and an algorithm to generate an efficient evaluation scheme of closed queries, which is a generalization of Vieille's famous QSQR algorithm for top-down evaluation of Datalog programs. A by-product of this work is a rather terse and elegant representation of QSQR.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

Efficient evaluation of HAVING queries on a probabilistic database

引用

11th international symposium on database programming languages

作者： Re, Christopher Suciu, Dan Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)9783540759867

We study the evaluation of positive conjunctive queries with Boolean aggregate tests (similar to HAVING queries in SQL) on probabilistic databases. Our motivation is to handle aggregate queries over imprecise data resulting from information integration or information extraction. More precisely, we study conjunctive queries with predicate aggregates using MIN, MAX, COUNT, SUM, AVG or COUNT(DISTINCT) on probabilistic databases. Computing the precise output probabilities for positive conjunctive queries (without HAVING) is #P-hard, but is in P for a restricted class of queries called safe queries. Further, for queries without self-joins either a query is safe or its data complexity is #P-Hard, which shows that safe queries exactly capture tractable queries without self-joins. In this paper, for each aggregate above, we find a class of queries that exactly capture efficient evaluation for HAVING queries without self-joins. Our algorithms use a novel technique to compute the marginal distributions of elements in a semiring, which may be of independent interest.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：