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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

160 篇 会议
8 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

132 篇 工学
- 125 篇 计算机科学与技术...
- 75 篇 软件工程
- 16 篇 电气工程
- 8 篇 信息与通信工程
- 7 篇 控制科学与工程
- 4 篇 电子科学与技术（可...
- 3 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 农业工程
32 篇 理学
- 28 篇 数学
- 5 篇 系统科学
- 2 篇 物理学
- 2 篇 统计学（可授理学、...
11 篇 管理学
- 6 篇 图书情报与档案管...
- 5 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 临床医学

主题

33 篇 logic programmin...
17 篇 functional progr...
13 篇 semantics
6 篇 computer archite...
5 篇 computer science
5 篇 computer circuit...
5 篇 application soft...
5 篇 software enginee...
5 篇 dynamic programm...
4 篇 programming prof...
4 篇 object oriented ...
4 篇 programming
4 篇 logic gates
4 篇 computer system ...
4 篇 programming lang...
4 篇 logics and meani...
4 篇 logic design
3 篇 software systems
3 篇 libraries
3 篇 formal logic

机构

2 篇 cnrs f-75205 par...
2 篇 gran sasso sci i...
2 篇 no arizona univ ...
2 篇 univ paris dider...
2 篇 univ southampton...
2 篇 max-planck-insti...
2 篇 tohoku univ send...
2 篇 uva subotica ser...
2 篇 cau kiel inst in...
1 篇 xidian univ sch ...
1 篇 univ pisa dipart...
1 篇 institute for vi...
1 篇 univ almeria dep...
1 篇 tu dortmund univ...
1 篇 institut für inf...
1 篇 department of el...
1 篇 informatik ii rw...
1 篇 institute of inf...
1 篇 departamento de ...
1 篇 department of co...

作者

6 篇 hanus michael
3 篇 antoy sergio
3 篇 huch frank
3 篇 brassel bernd
2 篇 dameri enrico
2 篇 kiselyov oleg
2 篇 parlato gennaro
2 篇 habermehl peter
2 篇 simari guillermo...
2 篇 inverso omar
2 篇 eriksson agneta
2 篇 moreno gines
2 篇 tick e
2 篇 fischer sebastia...
2 篇 martelli maurizi...
2 篇 degano pierpaolo
2 篇 johansson anna-l...
2 篇 antoniou grigori...
2 篇 levi giorgio
2 篇 enea constantin

语言

173 篇 英文
1 篇 中文

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

共 174 条记录，以下是81-90 订阅

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

详细简洁

排序：

Boundary-scan test circuit designed for FPGA 5

Boundary-scan test circuit designed for FPGA

引用

5th international Conference on ASIC

作者： Ma, XJ Tong, JR Fudan Univ ASIC Microelect Dept Shanghai 200433 Peoples R China

ISBN: (纸本)078037889X

Boundary scan is a widely adopted DFT (Design For Test). According to the characteristic of FPGA application, this paper presents a boundary scan circuit designed for FDEGA (Field-programmable Datapath Enhanced Gate Array), an FPGA new architecture of our group. this design emphasizes the function of PCB level test while considering chip level test function as well. We also integrate device-programming function into the circuit. In implementation of our design, "single DFF (D Flip-Flop) chain" structure is adopted to decrease area consumption. We finished the layout design in 0.6um CMOS process and integrated it into our FDEGA chip. Test result of fabricated chip meets the design requirement, and shows that the circuit can achieve the expected test function and programming function while observing IEEE1149.1 standard.

关键词： field programmable gate arrays logic design integrated circuit layout boundary scan testing design for testability flip-flops IEEE standards boundary-scan test circuit FPGA DFT design for test boundary scan circuit FDEGA field-programmable datapath enhanced gate array PCB level test chip level test function device-programming function D flip-flop chain structure programming function IEEE1149.1 standard 0.6 microns

来源：评论

学校读者我要写书评

暂无评论

Sequence quantification

引用

5th international symposium on Practical Aspects of Declarative Languages

作者： Schachte, P Univ Melbourne Dept Comp Sci Melbourne Vic 3010 Australia

ISBN: (纸本)3540003894

Several earlier papers have shown that bounded quantification is an expressive and comfortable addition to logic programming languages. One shortcoming of bounded quantification, however, is that it does not allow easy and efficient relation of corresponding elements of aggregations being quantified over (lockstep iteration). Bounded quantification also does not allow easy quantification over part of an aggregation, nor does it make it easy to accumulate a result over an aggregation. We generalize the concept of bounded quantification to quantification over any finite sequence, as we can use a rich family of operations on sequences to create a language facility that avoids the weaknesses mentioned above. We also propose a concrete syntax for sequence quantification in Prolog programs, which we have implemented as a source-to-source transformation.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A relational algebra for functional logic deductive databases

引用

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

作者： Almendros-Jiménez, Jesús Manuel Becerra-Terón, Antonio Dpto. de Lenguajes y Computación Universidad de Almería Spain

ISBN: (纸本)3540208135

In this paper, we study the integration of functional logic programming and databases by presenting a data model, and a query and data definition language. the data model is adopted from functional logic programming by allowing complex values. the query and data definition language is based on the use of algebra expressions built from a set of algebra operators over an extended relational algebra. In addition, algebra expressions can be used for defining functions, typical in a functional logic program. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Intelligent databases

来源：评论

学校读者我要写书评

暂无评论

An integrated information system powered by Prolog

引用

5th international symposium on Practical Aspects of Declarative Languages

作者： Porto, A Univ Nova Lisboa Fac Ciencias & Tecnol Dept Informat P-1200 Lisbon Portugal

ISBN: (纸本)3540003894

Our Faculty embarked a few years ago on an ambitious project to redesign itself around an integrated information system, aimed at supporting all information handling activities and deployed through dynamic Web interfaces automatically customized for individual users. the project includes both the design of the services and the development of appropriate software technology to implement them. It led already to a running system, supporting many official academic procedures, which is under constant evolution. the system architecture is fully based on Prolog, connected to an external database engine. this paper summarizes and discusses the characteristics that make Prolog a vehicle of choice for the implementation, along with a sketch of main aspects of the system architecture and the specific declarative techniques that were developed for them. the recurring methodological gain is the ease of building abstraction layers supported by specific term sub-languages, due to the combination of flexible operator syntax with the power of the underlying machinery to define new constructs. the basic programming layer evolved from standard Prolog to a novel structured version of it, with compositional semantics (no cuts) and direct support for structural abstraction and application, combining in practice the logic programming style with the higher-order power and some of the programming flavour of functional languages. the system's main architectural glue is the conceptual scheme, for which a definition language was developed whose expressions are compiled (by Prolog) to induce the database tables and (the instantiation of) a query/update language with a syntax based on compositionality principles of natural language, whose expressions are both more natural and much more compact than the equivalent in SQL.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Research on the extraction of quasi-circular object contours using active contour model in polar coordinate

Research on the extraction of quasi-circular object contours...

引用

5th international symposium on Instrumentation and Control Technology

作者： Long, DF Fan, SC BeiHang Univ Sch Automat Sci & Elect Engn Beijing 100083 Peoples R China

ISBN: (纸本)0819451371

In this paper, we present the active contour model in polar coordinate with a new internal energy term corresponding to the particularity of the quasi-circular object. the energy functional is minimized by the dynamic programming method. A precise initial contour is not necessary in this model which is different from the typical model. the proposed approach is robust to local minima because it searches the whole energy space. Another advantage of this model is that it searches the solution only once, which is different from the iterative method of the traditional model. the approach is tested on synthetic and real images. Results show that the model is robust to local minima and location of the center point.

关键词： active contour model quasi-circular object polar coordinate dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Reconstructing the evolutionary history of Indo-European languages using answer set programming

引用

5th international symposium on Practical Aspects of Declarative Languages

作者： Erdem, E Lifschitz, V Nakhleh, L Ringe, D Univ Toronto Dept Comp Sci Toronto ON M5S 3H5 Canada Univ Texas Dept Comp Sci Austin TX 78712 USA Univ Penn Dept Linguist Philadelphia PA 19104 USA

ISBN: (纸本)3540003894

the evolutionary history of languages can be modeled as a tree, called a phylogeny, where the leaves represent the extant languages, the internal vertices represent the ancestral languages, and the edges represent the genetic relations between the languages. Languages not only inherit characteristics from their ancestors but also sometimes borrow them from other languages. Such borrowings can be represented by additional non-tree edges. this paper addresses the problem of computing a small number of additional edges that turn a phylogeny into a "perfect phylogenetic network". To solve this problem, we use answer set programming, which represents a given computational problem as a logic program whose answer sets correspond to solutions. Using the answer set solver SMODELS, with some heuristics and optimization techniques, we have generated a few conjectures regarding the evolution of Indo-European languages.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

A Strafunski application letter

引用

5th international symposium on Practical Aspects of Declarative Languages

作者： Lämmel, R Visser, J Ctr Wiskunde & Informat NL-1098 SJ Amsterdam Netherlands Vrije Univ Amsterdam NL-1081 HV Amsterdam Netherlands Software Improvement Grp NL-1098 SJ Amsterdam Netherlands

ISBN: (纸本)3540003894

Strafunski is a Haskell-centred software bundle for implementing language processing components - most notably program analyses and transformations. Typical application areas include program optimisation, refactoring, software metrics, software re- and reverse engineering. Strafunski started out as generic programming library complemented by generative tool support to address the concern of generic traversal over typed representations of parse trees in a scalable manner. Meanwhile, Strafunski also encompasses means of integrating external components such as parsers, pretty printers, and graph visualisation tools. In a selection of case studies, we demonstrate that typed functional programming in Haskell, augmented with Strafunski's support for generic traversal and external components, is very appropriate for the development of practical language processors. In particular, we discuss using Haskell for Cobol reverse engineering, Java code metrics, and Haskell re-engineering.

关键词： Strafunski program transformation program analysis language processing generic traversal external components interchange formats functional programming

来源：评论

学校读者我要写书评

暂无评论

A demand-driven narrowing calculus with overlapping definitional trees 03

A demand-driven narrowing calculus with overlapping definiti...

引用

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

作者： Rafael del Vado Vírseda Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)9781581137057

We propose a demand-driven conditional narrowing calculus in which a variant of definitional trees [2] is used to efficiently control the narrowing strategy. this calculus is sound and strongly complete w.r.t. Constructor-based ReWriting logic (CRWL) semantics [7] for a wide class of constructor-based conditional term rewriting systems. the calculus mantains the optimality properties of the needed narrowing strategy [5]. Moreover, the treatment of strict equality as a primitive rather than a defined function symbol, leads to an improved behaviour w.r.t. needed narrowing.

关键词： functional logic programming languages rewrite systems

来源：评论

学校读者我要写书评

暂无评论

A metrics suite for measuring reusability of software components

A metrics suite for measuring reusability of software compon...

引用

international symposium on Software Metrics

作者： H. Washizaki H. Yamamoto Y. Fukazawa Department of Computer Science Waseda University Tokyo Japan Matsushita Elecrric Indusrrial Company Limited Kadoma Osaka Japan

In component-based software development, it is necessary to measure the reusability of components in order to realize the reuse of components effectively. there are some product metrics for measuring the reusability of object-oriented software. However, in application development with reuse, it is difficult to use conventional metrics because the source codes of components cannot be obtained, and these metrics require analysis of source codes. We propose a metrics suite for measuring the reusability of such black-box components based on limited information that can be obtained from the outside of components without any source codes. We define five metrics for measuring a component's understandability, adaptability, and portability, with confidence intervals that were set by statistical analysis of a number of JavaBeans components. Moreover, we provide a reusability metric by combining these metrics based on a reusability model. As a result of evaluation experiments, it is found that our metrics can effectively identify black-box components with high reusability.

关键词： Software measurement Software reusability programming Software metrics logic Object oriented modeling Software systems Computer science Computer industry Cities and towns

来源：评论

学校读者我要写书评

暂无评论

Using service utilization metrics to assess the structure of product line architectures

Using service utilization metrics to assess the structure of...

引用

international symposium on Software Metrics

作者： A. van der Hoek E. Dincel N. Medvidovic Institute for Software Research University of California Irvine CA USA Computer Science Department University of Southern California CA USA

Metrics have long been used to measure and evaluate software products and processes. Many metrics have been developed that have lead to different degrees of success. Software architecture is a discipline in which few metrics have been applied, a surprising fact given the critical role of software architecture in software development. Software product line architectures represent one area of software architecture in which we believe metrics can be of especially great use. the critical importance of the structure defined by a product line architecture requires that its properties be meaningfully assessed and that informed architectural decisions be made to guide its evolution. To begin addressing this issue, we have developed a class of closely related metrics that specifically target product line architectures. the metrics are based on the concept of service utilization and explicitly take into account the context in which individual architectural elements are placed. We define the metrics, illustrate their use, and evaluate their strengths and weaknesses through their application on three example product line architectures.

关键词： Programmable logic arrays Computer architecture Software architecture Computer science programming Application software Software measurement Context-aware services History Software engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：