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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,053 篇 会议
51 册 图书
46 篇 期刊文献

馆藏范围

2,150 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,274 篇 工学
- 1,024 篇 计算机科学与技术...
- 583 篇 软件工程
- 254 篇 电气工程
- 157 篇 控制科学与工程
- 69 篇 信息与通信工程
- 50 篇 机械工程
- 42 篇 材料科学与工程（可...
- 36 篇 电子科学与技术（可...
- 18 篇 安全科学与工程
- 15 篇 交通运输工程
- 12 篇 仪器科学与技术
- 12 篇 土木工程
- 12 篇 化学工程与技术
- 12 篇 生物医学工程（可授...
- 12 篇 生物工程
- 11 篇 冶金工程
- 11 篇 动力工程及工程热...
- 10 篇 建筑学
296 篇 理学
- 227 篇 数学
- 39 篇 物理学
- 39 篇 统计学（可授理学、...
- 34 篇 系统科学
- 22 篇 生物学
- 16 篇 化学
119 篇 管理学
- 84 篇 管理科学与工程(可...
- 37 篇 工商管理
- 32 篇 图书情报与档案管...
47 篇 教育学
- 46 篇 教育学
25 篇 医学
- 24 篇 临床医学
10 篇 法学
- 10 篇 社会学
9 篇 经济学
5 篇 农学
4 篇 文学

主题

172 篇 logic gates
137 篇 fuzzy logic
129 篇 programming
118 篇 linear programmi...
94 篇 logic programmin...
65 篇 probabilistic lo...
59 篇 dynamic programm...
57 篇 optimization
52 篇 semantics
50 篇 training
49 篇 computer science
48 篇 logic
44 篇 object oriented ...
42 篇 computer archite...
41 篇 computational mo...
38 篇 hardware
38 篇 artificial intel...
37 篇 java
36 篇 computer program...
35 篇 software

机构

6 篇 laboratory of co...
5 篇 stevens inst tec...
5 篇 institute of log...
5 篇 university of to...
5 篇 institute for lo...
5 篇 chinese univ hon...
4 篇 univ oxford oxfo...
4 篇 school of electr...
4 篇 ibm corp thomas ...
3 篇 north carolina s...
3 篇 creighton univ o...
3 篇 univ politecn ca...
3 篇 ecole polytech f...
3 篇 tu wien austria
3 篇 department of co...
3 篇 department of el...
3 篇 rhein westfal th...
3 篇 school of comput...
3 篇 univ tokyo
3 篇 school of mathem...

作者

7 篇 inoue katsumi
5 篇 sakama chiaki
5 篇 gupta gopal
4 篇 wang liang
4 篇 iosif radu
4 篇 pontelli enrico
4 篇 liang wang
4 篇 tompits hans
4 篇 beck j. christop...
3 篇 kumar amruth n.
3 篇 chopra amit k.
3 篇 proietti maurizi...
3 篇 il han park
3 篇 m.-r. akbarzadeh...
3 篇 wei li
3 篇 riguzzi fabrizio
3 篇 schaub torsten
3 篇 melin p
3 篇 leonidas deligia...
3 篇 mcdirmid sean

语言

2,101 篇 英文
35 篇 其他
15 篇 中文
2 篇 葡萄牙文
1 篇 西班牙文
1 篇 法文

检索条件"任意字段=22nd International Conference on Logic Programming"

共 2150 条记录，以下是1711-1720 订阅

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

详细简洁

排序：

Jeannie: Granting Java native interface developers their wishes 07

Jeannie: Granting Java native interface developers their wis...

引用

22nd international conference on Object-Oriented programming, Systems, Languages and Applications

作者： Hirzel, Martin Grimm, Robert IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA NYU New York NY USA

ISBN: (纸本)9781595937865

Higher-level languages interface with lower-level languages such as C to access platform functionality, reuse legacy libraries, or improve performance. This raises the issue of how to best integrate different languages while also reconciling productivity, safety, portability, and efficiency. This paper presents Jeannie, a new language design for integrating Java with C. In Jeannie, both Java and C code are nested within each other in the same file and compile down to JNI, the Java platform's standard foreign function interface. By combining the two languages' syntax and semantics, Jeannie eliminates verbose boiler-plate code, enables static error detection across the language boundary, and simplifies dynamic resource management. We describe the Jeannie language and its compiler, while also highlighting lessons from composing two mature programming languages.

关键词： design languages programming language composition Java C JNI foreign function interface xtc modular syntax Rats

来源：评论

学校读者我要写书评

暂无评论

Description logics for multi-issue bilateral negotiation with incomplete information

Description logics for multi-issue bilateral negotiation wit...

引用

AAAI-07/IAAI-07 Proceedings: 22nd AAAI conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence conference

作者： Ragone, Azzurra Di Noia, Tommaso Di Sciascio, Eugenio Donini, Francesco M. SisIntLab. Politecnico di Bari via Re David 200 70125 Bari Italy DISCOM Università della Tuscia via San Carlo 32 01100 Viterbo Italy

ISBN: (纸本)1577353234

We propose a framework for multi-issue bilateral negotiation, where issues are expressed and related to each other via Description logics. Agents' goals are expressed through (complex) concepts, and the worth of goals as weights over concepts, We adopt a very general setting with incomplete information by letting agents keep both goals and worths of goals as private information. We introduce a negotiation protocol for such a setting, and discuss different possible strategies that agents can adopt during the negotiation process. We show that such a protocol converges, if the Description logic used enjoys the finite implicants property. Copyright © 2007, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Establishing object invariants with delayed types 07

Establishing object invariants with delayed types

引用

OOPSLA 2007: 22nd international conference on Object-Oriented programming, Systems, Languages, and Applications

作者： Fähndrich, Manuel Songtao, Xia Microsoft Research

ISBN: (纸本)9781595937865

Mainstream object-oriented languages such as C# and Java provide an initialization model for objects that does not guarantee programmer controlled initialization of fields. Instead, all fields are initialized to default values (0 for scalars and null for non-scalars) on allocation. This is in stark contrast to functional languages, where all parts of an allocation are initialized to programmer-provided values. These choices have a direct impact on two main issues: 1) the prevalence of null in object oriented languages (and its general absence in functional languages), and 2) the ability to initialize circular data structures. This paper explores connections between these differing approaches and proposes a fresh look at initialization. Delayed types are introduced to express and formalize prevalent initialization patterns in object-oriented languages. Copyright © 2007 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Efficient time-aware prioritization with knapsack solvers

Efficient time-aware prioritization with knapsack solvers

引用

1st international ACM Workshop on Empirical Assessment of Software Engineering Languages and Technologies, WEASELTech 2007, Held in Conjunction with the 22nd IEEE/ACM international conference on Automated Software Engineering, ASE 2007

作者： Alspaugh, Sara Walcott, Kristen R. Belanich, Michael Kapfhammer, Gregory M. Soffa, Mary Lou Department of Computer Science University of Virginia United States Department of Computer Science Allegheny College United States

ISBN: (纸本)9781595938800

Regression testing is frequently performed in a time constrained environment. This paper explains how 0/1 knapsack solvers (e.g., greedy, dynamic programming, and the core algorithm) can identify a test suite reordering that rapidly covers the test requirements and always terminates within a specified testing time limit. We conducted experiments that reveal fundamental trade-offs in the (i) time and space costs that are associated with creating a reordered test suite and (ii) quality of the resulting prioritization. We find knapsack-based prioritizers that ignore the overlap in test case coverage incur a low time overhead and a moderate to high space overhead while creating prioritizations exhibiting a minor to modest decrease in effectiveness. We also find that the most sophisticated 0/1 knapsack solvers do not always identify the most effective prioritization, suggesting that overlap-aware prioritizers with a higher time overhead are useful in certain testing contexts. Copyright 2007 ACM.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Verbs/verb phrases driven class identification

Verbs/verb phrases driven class identification

引用

22nd international conference on Computers and Their Applications 2007, CATA 2007

作者： Pei, Tzusheng Kim, Hyunju Department of Computer Science Jackson State University Jackson MS 39217 United States

ISBN: (纸本)9781604237559

The set of classes identified from software requirements, described by a number of use cases and related scenarios for each use case, lays the foundation for the subsequent stages in object-oriented analysis and design. At this crucial analysis phase, objects and classes emerge. This paper proposes a top-down, verbs/verb phrases driven approach centered on use cases for class identification. The class identification process is described by a sequence of steps. Discussions are provided for each step. A short, simplified case study is demonstrated. This process works on the most important verbs/verb phrases, which name use cases, first and then directs attention to secondary verbs/verb phrases, which are in scenarios. The process is repeated for all use cases and scenarios until all the classes are identified. Nouns/noun phrases support the verbs/verb phrase in the class identification process. Use cases are named by verb phrases, which summarize the most important activities in the domain, and serve as the starting point of class identification. This approach is in contrast to most traditional processes for class identification, which mainly focus on nouns and noun phrases. The proposed approach is both intuitive and relatively easy to follow. Consequently, it would produce a semantically clear class diagram. Copyright © 2007 by the international Society for Computers and Their Applications (ISCA).

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

On the approximation of instance level update and erasure in description logics

On the approximation of instance level update and erasure in...

引用

AAAI-07/IAAI-07 Proceedings: 22nd AAAI conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence conference

作者： De Giacomo, Giuseppe Lenzerini, Maurizio Poggi, Antonella Rosati, Riccardo Dipartimento di Informatica e Sistemistica Sapienza Università di Roma Italy

ISBN: (纸本)1577353234

A Description logics knowledge base is constituted by two components, called TBox and ABox, where the former expresses general knowledge about the concepts and their relationships, and the latter describes the properties of instances of concepts. We address the problem of how to deal with changes to a Description logic knowledge base, when these changes affect only its ABox. We consider two types of changes, namely update and erasure, and we characterize the semantics of these operations on the basis of the approaches proposed by Winslett and by Katsuno and Mendelzon. It is well known that, in general. Description logics are not closed with respect to updates, in the sense that the set of models corresponding to an update applied to a knowledge base in a Description logic L may not be expressible by ABoxes in L. We show that this is true also for erasure. To deal with this problem. we introduce the notion of best approximation of an update (erasure) in a DL L, with the goal of characterizing the L ABoxes that capture the update (erasure) at best. We then focus on DL-Lite?F. a tractable Description logic, and present polynomial algorithms for computing the best approximation of updates and erasures in this logic, which shows that the nice computational properties of DL-LiteF are retained in dealing with the evolution of the ABox. Copyright © 2007. Association for the Advancement of Artificial Intelligence (***), All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

The JastAdd Extensible Java Compiler 07

The JastAdd Extensible Java Compiler

引用

22nd international conference on Object-Oriented programming, Systems, Languages and Applications

作者： Ekman, Torbjorn Hedin, Gorel Univ Oxford Programming Tools Grp Oxford England Lund Univ Dept Comp Sci S-22100 Lund Sweden

ISBN: (纸本)9781595937865

The JastAdd Extensible Java Compiler is a high quality Java compiler that is easy to extend in order to build static analysis tools for Java, and to extend Java with new language constructs. It is built modularly, with a Java 1.4 compiler that is extended to a Java 5 compiler. Example applications that are built as extensions include an alternative backend that generates Jimple, an extension of Java with AspectJ constructs, and the implementation of a pluggable type system for non-null checking and inference. The system is implemented using JastAdd, a declarative Java-like language. We describe the compiler architecture, the major design ideas for building and extending the compiler, in particular, for dealing with complex extensions that affect name and type analysis. Our extensible compiler compares very favorably concerning quality, speed and size with other extensible Java compiler frameworks. It also compares favorably in quality and size compared with traditional non-extensible Java compilers, and it runs within a factor of three compared to javac.

关键词： design languages OOP compilers extensibility declarative frameworks modularity Java

来源：评论

学校读者我要写书评

暂无评论

Complexity boundaries for horn description logics

Complexity boundaries for horn description logics

引用

AAAI-07/IAAI-07 Proceedings: 22nd AAAI conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence conference

作者： Krötzsch, Markus Rudolph, Sebastian Hitzler, Pascal Institute AIFB Universität Karlsruhe Germany

ISBN: (纸本)1577353234

Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large ABoxes. However, the natural question whether Horn-DLs also provide advantages for TBox reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of Horn-DLs. While the combined complexity for many Horn-DLs turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning. Copyright ©2007, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

1st international workshop on in Process Software Engineering Measurement and Analysis (ISEMA 2007)

1st international workshop on in Process Software Engineerin...

引用

22nd international conference on Object-Oriented programming Systems, Languages, and Applications, OOPSLA 2007 - Companion

作者： Johnson, Philip M. Sillitti, Alberto University of Hawaii Honolulu United States Free University of Bolzano Bolzano Italy

ISBN: (纸本)9781595938657

Improving the software engineering development process requires collection of data, but collection of data interferes with how developers work. At present, most of the software engineering tools, data collection, and analysis techniques available use manual data collection, despite known problems with reliability, correctness, and timeliness of the data. To overcome such limitations and reduce interference with the development process, software engineering researchers must develop tools and data analysis techniques that collect data without human interactions. Such tools produce very detailed and extensive data, but lack the filtering and classification that humans perform on manually collected data. This unfiltered data requires the development of new analysis techniques and new prediction models to use it effectively. This workshop focuses on defining the research challenges created by in process software measurement and analysis of the software development process using tools that do not affect or modify the process but extract data automatically from it.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Fifth international Workshop on SOA & Web Services Best Practices

Fifth International Workshop on SOA & Web Services Best Prac...

引用

WikiSym'07, ISMM'07, HPC-GECO/CompFrame'07, DLS'07 - 22nd ACM SIGPLAN conference on Object-Oriented programming Systems and Applications Companion, OOPSLA'07

作者： Bjerkestrand, Anders Aas Zeid Dr., Amir Skaar, Lars Arne Zimmermann, Olaf Bekk Consulting Norway The British University in Egypt Egypt Tieto Enator Banking and Insurance Norway IBM Zurich Research Lab Switzerland

ISBN: (纸本)9781595938657

In this 5th international Workshop on SOA and Web Services, we will explore best-practices in the adoption, design, implementation, management and monitoring of SOA- and Web services-related methods, tools and technologies. This workshop is a continuation of a highly successful series of workshops at OOPSLA 2006, OOPSLA 2005, OOPSLA 2004, and OOPSLA 2003.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共215页 << < 168 169 170 171 172 173 174 175 176 177 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：