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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

80 篇 会议
52 篇 期刊文献
8 册 图书

馆藏范围

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

日期分布

学科分类号

96 篇 工学
- 73 篇 计算机科学与技术...
- 51 篇 软件工程
- 14 篇 控制科学与工程
- 11 篇 信息与通信工程
- 10 篇 电气工程
- 7 篇 电子科学与技术（可...
- 6 篇 安全科学与工程
- 5 篇 机械工程
- 5 篇 网络空间安全
- 4 篇 土木工程
- 4 篇 石油与天然气工程
- 4 篇 交通运输工程
- 2 篇 力学（可授工学、理...
- 2 篇 化学工程与技术
- 2 篇 船舶与海洋工程
- 2 篇 生物工程
54 篇 理学
- 33 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 6 篇 生物学
- 5 篇 物理学
- 2 篇 化学
- 2 篇 海洋科学
23 篇 管理学
- 18 篇 管理科学与工程(可...
- 10 篇 工商管理
- 5 篇 图书情报与档案管...
5 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
1 篇 法学
1 篇 农学

主题

9 篇 artificial intel...
8 篇 computer science
6 篇 software enginee...
4 篇 logic programmin...
4 篇 dipper throated ...
3 篇 grey wolf optimi...
3 篇 computational in...
3 篇 data mining and ...
3 篇 java
3 篇 semantics
3 篇 unified modeling...
3 篇 information stor...
2 篇 compilers
2 篇 access control
2 篇 information syst...
2 篇 metaheuristics
2 篇 object oriented ...
2 篇 decision support...
2 篇 operating system...
2 篇 concurrent compu...

机构

9 篇 department of sy...
5 篇 department of co...
5 篇 department of co...
5 篇 department of co...
4 篇 department of co...
4 篇 computer enginee...
3 篇 department of ap...
3 篇 zuse institute b...
3 篇 university of tw...
3 篇 rwth aachen univ...
3 篇 friedrich-alexan...
3 篇 department of in...
3 篇 department of in...
3 篇 institute of sof...
3 篇 institute for so...
3 篇 technische unive...
2 篇 school of mathem...
2 篇 department of co...
2 篇 department of co...
2 篇 dr fusco is a ch...

作者

6 篇 mostafa abotaleb
6 篇 abdelhameed ibra...
5 篇 el-sayed m.el-ke...
5 篇 abdelaziz a.abde...
5 篇 doaa sami khafag...
4 篇 choe km
4 篇 kapur deepak
4 篇 raschke alexande...
3 篇 serrano felipe
3 篇 scholz sven-bodo
3 篇 mondal shyamal k...
3 篇 narendran paliat...
3 篇 maiti manoranjan
3 篇 weninger dieter
3 篇 reem alkanhel
3 篇 hojny christophe...
3 篇 chmiela antonia
3 篇 mühmer erik
3 篇 mozhaiev mykhail...
3 篇 halbig katrin

语言

137 篇 英文
3 篇 其他

检索条件"机构=Institute for Programming and Logics Department of computer science"

共 140 条记录，以下是21-30 订阅

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

详细简洁

排序：

Component + aspect = An extensible and adaptable system software

Component + aspect = An extensible and adaptable system soft...

引用

2005 International Conference on Software Engineering Research and Practice, SERP'05

作者： Netinant, Paniti Department of Computer Science Bangkok University Bangkok Thailand Concurrent Programming Research Group Computer Science Department Illinois Institute of Technology Chicago IL United States

ISBN: (纸本)9781932415490

The benefits associated with separation of concerns are well established. Aspect-Orientation is a methodology that aims at separating components and aspects from the early stages of the software life cycle, and using techniques to combining them together at the implementation phase. Componentbased programming systems have shown themselves to be a natural way of constructing extensible software. Well-defined interfaces, encapsulation, late binding and polymorphism promote extensibility, yet despite this synergy, components have not been widely employed at the systems level. This is primarily due to the failure of existing component technologies to provide the protection and performance required of systems software. In this paper we identify the requirements for a component system to support extensions, and describe an extensibility and adaptability in the design of system software. We discuss an aspect-oriented framework that can simplify system design by expressing it at a higher level of abstraction. Our work concentrates on how to achieve a higher separation of aspects, components, and layers from each other. Our goal is to achieve a better design model for system software in terms of extensibility, reuse and adaptability.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Double-exponential complexity of computing a complete set of AC-unifiers

Double-exponential complexity of computing a complete set of...

引用

Annual Symposium on Logic in computer science

作者： D. Kapur P. Narendran Institute of Programming and Logics Department of Computer Science State University of New York Albany Albany NY USA

An algorithm for computing a complete set of unifiers for two terms involving associative-commutative function symbols is presented. It is based on a nondeterministic algorithm given by the authors in 1986 to show the NP-completeness of associative-commutative unifiability. The algorithm is easy to understand, and its termination can be easily established. Its complexity is easily analyzed and shown to be doubly exponential in the size of the input terms. The analysis also shows that there is a double-exponential upper bound on the size of a complete set of unifiers of two input terms. Since there is a family of simple associative-commutative unification problems which have complete sets of unifiers whose size is doubly exponential, the algorithm is optimal in its order of complexity in this sense.< >

关键词： Logic programming Functional programming computer science AC generators Upper bound Algorithm design and analysis Equations Artificial intelligence Database languages History

来源：评论

学校读者我要写书评

暂无评论

Some independence results for equational unification 6th

Some independence results for equational unification

引用

6th International Conference on Rewriting Techniques and Applications, RTA 1995

作者： Otto, Friedrich Narendran, Paliath Dougherty, Daniel J. Fachbereich Mathematik/Iuformatik Universität-GH Kassel Kassel34109 Germany Institute of Programming and Logics Department of Computer Science State University of New York AlbanyNY12222 United States Mathematics Department Wesleyan University MiddletownCT06459 United States

ISBN: (纸本)9783540592006

For finite convergent term-rewriting systems the equational unification problem is shown to be recursively independent of the equational matching problem, the word matching problem, and the (simultaneous) 2nd-order equational matchingprobtem. We also present some new decidability results for simultaneous equational unification and 2nd -order equational matching. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Comprehensive curriculum of programming for engineers, its teaching models and in-lab monitoring technique

Comprehensive curriculum of programming for engineers, its t...

引用

International MultiConference of Engineers and computer Scientists 2015, IMECS 2015

作者： Satoskar, Mohit Mali, Sagar Department of Computer Science and Information Technology Ramrao Adik Institute of Technology Mumbai India Computer Programming and System Software Design Area of Computer Science at Kolhapur Maharashtra India

ISBN: (纸本)9789881925329

Issues related to the curriculum design of C programming language is analysed. Aspects and necessity of programming for engineers is discussed. The enhanced outlay of programming for engineers and generating the curriculum is presented. Relativity and dependency briefly highlighted. A superlative teaching model of computer languages is discussed along with its principles. In-Lab monitoring technique is developed successfully using client-server architecture which ensures learner live workshop progress. It is shown how the programming for engineer's curriculum design and techniques help to create highest quality outcome.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Friends or foes An AI planning perspective on abstraction and search

Friends or foes An AI planning perspective on abstraction an...

引用

ICAPS 2006 - 16th International Conference on Automated Planning and Scheduling

作者： Hoffmann, Jörg Sabharwal, Ashish Domshlak, Carmel Programming Logics Group Max Planck Institute for CS 66123 Saarbrücken Germany Dept. of Computer Science Cornell University Ithaca NY 14853-7501 United States Fac. of Industrial Engr. and Management Technion Israel Institute of Technology Haifa 32000 Israel

There is increasing awareness that planning and model checking are closely related fields. Abstraction means to perform search in an over-approximation of the original problem instance, with a potentially much smaller state space. This is the most essential method in model checking. One would expect that it can also be made successful in planning. We show, however, that this is likely to not be the case. The main reason is that, while in model checking one traditionally uses blind search to exhaust the state space and prove the absence of solutions, in planning informed search is used to find solutions. We give an exhaustive theoretical and practical account of the use of abstraction in planning. For all abstraction (over-approximation) methods known in planning, we prove that they cannot improve the best-case behavior of informed search. While this is easy to see for heuristic search, we were quite surprised to find that it also holds, in most cases, for the resolution-style proofs of unsolvability underlying SAT-based optimal planners. This result is potentially relevant also for model checking, where SAT-based techniques have recently been combined with abstraction. Exploring the issue in planning practice, we find that even hand-made abstractions do not tend to improve the performance of planners, unless the attacked task contains huge amounts of irrelevance. We relate these findings to the kinds of application domains that are typically addressed in model checking.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Optimistic Versioning for Conflict-tolerant Collaborative Blended Modeling 10

Optimistic Versioning for Conflict-tolerant Collaborative Bl...

引用

STAF 2022 Workshop: 10th International Workshop on Bidirectional Transformations, BX 2022, 2nd International Workshop on Foundations and Practice of Visual Modeling, FPVM 2022 and 2nd International Workshop on MDE for Smart IoT Systems, MeSS 2022

作者： Exelmans, Joeri Pietron, Jakob Raschke, Alexander Vangheluwe, Hans Tichy, Matthias Department of Computer Science University of Antwerp - Flanders Make Antwerp Belgium Institute of Software Engineering and Programming Languages Ulm University Ulm Germany

Optimistic versioning is a key component in supporting collaborative workflows. Text-based versioning has been widely adopted for versioning code, but in model-driven engineering, dealing with visual concrete syntaxes, new methods are required. In the case of blended modeling, a mixture of both textual and visual syntaxes, concurrently editable and synchronizable, introduces additional challenges. We propose a type of operation-based versioning to record not only user edits, but also bi-directional change propagations between concrete and abstract syntax. This way we can support blended modeling with layout continuity, and flexible handling of missing information (e. g., layout information) when rendering changes from abstract to concrete syntax. In addition, the proposed versioning approach enables collaborative conflict resolution by allowing partial conflict resolution, thus deferring a final resolution. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Security goals assurance based on software active monitoring

Security goals assurance based on software active monitoring

引用

International Conference on Secure Software Integration and Reliability Improvement

作者： Zhao, Changzhi Dong, Wei Leucker, Martin Qi, Zhichang Department of Computer Science National University of Defense Technology Changsha 410073 China Institute of Software Technology and Programming Languages University of Lubeck Germany

ISBN: (纸本)9780769544533

Access control is a vital security mechanism in today's operating systems and the security policies dictating the security relevant behaviors is lengthy and complex for example in Security-Enhanced Linux (SELinux). It is extremely difficult to verify the consistency between the security policies and the security goals desired by applications. In this paper we present how to predict whether the information flow security goal is violated or not during runtime how to generate the corresponding control actions on-line when divergence is detected and how to apply these actions in time based on software active monitoring technique. The symbolic security information flow model of SElinux is generated from a formalization of the access control mechanism which can be used to generate the N-step ahead projection of the future behavior. Information flow security goals are expressed in linear temporal logic (LTL) which provides clear description of the objectives desired by applications. Anticipatory monitor is generated from LTL formula automatically. We consider an on-line scheme where after the occurrence of an event, the next control action is determined on the basis of the N-step ahead projection of the future behavior. This procedure is repeated after the occurrence of next security relevant event. Thus a closed-loop system is generated that all behavior sequences will satisfy the security goals. © 2011 IEEE.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Designing modularity architecture for multithread programming

Designing modularity architecture for multithread programmin...

引用

4th International Conference on Communications and Information Technology, CIT'10

作者： Netinant, Paniti Computer Science Department Bangkok University Bangkok Thailand Concurrent Programming Research Group Illinois Institute of Technology Chicago IL United States

ISBN: (纸本)9789604742073

Multithreaded Object-Oriented programming in concurrency environment using object-oriented technology is a complex activity. Programmers need to be aware of issues unrelated to their domain of problem, and are often unprepared for the challenges of the concurrent object-oriented programming brings. The interaction of their components becomes more complex, and makes it difficult to validate the design and correctness of the implemented program. Supporting separation of concerns in the design and implementation of the multithreaded object-oriented programming can provide a number of benefits such as comprehension, reusability, extensibility and adaptability in both design and implementation. We have tackled this problem by adopting the technique of separation of concerns in multithreaded object-oriented programming. In this paper we demonstrate an Aspect-Oriented approach that can be used for multithreaded object-oriented programming. We also show how better the separation of concerns in components. Readers/Writers problem is demonstrated using an aspect-oriented approach. Our methodology, which is based on aspect-oriented techniques as well as language and architecture independence, is an aspect-oriented framework.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Evaluating Keyphrase Extraction Methods for Clustering Influenza-Related Scientific Papers 8

Evaluating Keyphrase Extraction Methods for Clustering Influ...

引用

8th International Iranian Conference on Signal Processing and Intelligent Systems, ICSPIS 2022

作者： Forghani, Majid Firstkov, Artyom Alyannezhadi, Mohammad. M. Forghani, Kazem Krasovskii Institute of Mathematics & Mechanics Mathematical Programming Lab. Yekaterinburg Russia University of Science and Technology of Mazandaran Department of Science Behshahr Iran Iran University of Science and Technology Computer Science Department Tehran Iran

ISBN: (纸本)9781665476232

The number of annual scientific publications is growing year by year, which has led to the accumulation and formation of large databases. This increases the complexity of the search for relevant articles. Modern search engines leverage keyphrases to improve the performance of search results. Keyphrases (or keywords) are a set of single or multi-word expressions which provide a very compact summary of contents and describe the overall topic of a document. Implementation of keyphrase extraction can be varied for specific-domain databases. This motivated us to evaluate these methods on a database of influenza scientific literature. In this work, we considered 9 well known methods for extracting keyphrases. Our preliminary results show txhat graph-based methods which employ topics outperform others using our database. We also determined that influenza-related papers can be grouped into three general topics: public health & medical care;molecular biology & immunology;and phylogenetic & epidemiological studies. © 2022 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Evaluating Length of a Shortest Adaptive Homing Sequence for Weakly Initialized FSMs

Evaluating Length of a Shortest Adaptive Homing Sequence for...

引用

2020 IEEE East-West Design and Test Symposium, EWDTS 2020

作者： Vinarskii, Evgenii Yevtushenko, Nina Lomonosov Moscow State University Department of Computer Science Moscow Russia Ivannikov Institute for System Programming of Ras Software Engineering Deparment Moscow Russia

ISBN: (数字)9781728198996

ISBN: (纸本)9781728198996

There are many research papers devoted to the state identification problem of finite state machines (FSMs) which are widely used for analysis of discrete event systems. A deterministic complete reduced FSM always has a homing sequence (HS) but a number of non-deterministic FSMs not necessarily have a preset HS;nevertheless, those FSMs can still have an adaptive HS. Moreover, adaptive HS can be shorter than the preset. If each state can be an initial state of a complete FSM, i.e., an FSM is non-initialized, then a shortest adaptive HS (if it exists) has polynomial length in the number of FSM states. We show that it is not the case for weakly-initialized FSMs: such FSMs can have a shortest adaptive HS of exponential length in the number of FSM states/transitions. However, the experimental evaluation shows that the non-polynomial upper bound for a shortest adaptive HS was never reached for randomly generated weakly-initialized two-input FSMs. © 2020 IEEE.

关键词： Adaptive homing sequence Non-deterministic FSM weakly initialized FSM

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：