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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

27 篇 会议
7 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

20 篇 工学
- 15 篇 计算机科学与技术...
- 7 篇 软件工程
- 3 篇 信息与通信工程
- 3 篇 土木工程
- 2 篇 电气工程
- 2 篇 环境科学与工程（可...
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 交通运输工程
- 1 篇 船舶与海洋工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
14 篇 理学
- 11 篇 数学
- 3 篇 生物学
- 1 篇 物理学
- 1 篇 海洋科学
4 篇 管理学
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 教育学
- 1 篇 教育学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

4 篇 petri nets
3 篇 software enginee...
3 篇 semantics
3 篇 heuristic algori...
2 篇 fuzzy logic
2 篇 informatics
2 篇 computers and ed...
2 篇 computer languag...
2 篇 computational mo...
2 篇 frequency domain...
2 篇 artificial intel...
2 篇 logics and meani...
2 篇 unified modeling...
1 篇 object oriented ...
1 篇 complex networks
1 篇 software systems
1 篇 conferences
1 篇 computer circuit...
1 篇 reinforcement le...
1 篇 clustering

机构

6 篇 department of th...
3 篇 rostov state med...
3 篇 russian universi...
3 篇 kherson state un...
3 篇 russian customs ...
2 篇 institute of app...
2 篇 department of th...
2 篇 department of sy...
2 篇 department of th...
2 篇 zaporizhzhya nat...
2 篇 lviv polytechnic...
2 篇 department of fi...
2 篇 don state techni...
2 篇 faculty of ecomo...
2 篇 mayr application...
2 篇 department of in...
1 篇 department of pr...
1 篇 programming theo...
1 篇 dept. kino and a...
1 篇 school of mathem...

作者

3 篇 aleksander spiva...
3 篇 vadim ermolayev
3 篇 heinrich c. mayr
3 篇 vasilenko marina...
3 篇 bergenthum robin
3 篇 nikitchenko myko...
3 篇 tagiltseva julia...
3 篇 kuzina elena l.
3 篇 drozdov nikita a...
3 篇 mykola nikitchen...
2 篇 f. xavier moncun...
2 篇 pere palà-schönw...
2 篇 tymofieiev valen...
2 篇 nikitchenko myko...
2 篇 christopher t. l...
2 篇 jordi bonet-dalm...
2 篇 edward j. latess...
2 篇 grygoriy zholtke...
2 篇 francisco del ág...
2 篇 tymofieiev valen...

语言

35 篇 英文
2 篇 其他

检索条件"机构=Department of Theory of Programming"

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

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

详细简洁

排序：

Mathematical foundations of multiple inheritance: Reflexive-transitive closure of the binary relations

Mathematical foundations of multiple inheritance: Reflexive-...

引用

International Conference on Perspective Technologies and Methods in MEMS Design (MEMSTECH)

作者： Dmytro Buy Olena Shyshatska Sunmade Fabunmi Karam Mohammed Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv Kyiv UKRAINE

ISBN: (纸本)9781509014149

The paper is devoted to the mathematical foundations of the linearization algorithms - the method of conflict resolution that occurs in object-oriented programming languages which support multiple inheritance. The main object of study is the reflexive-transitive closure of a binary relation. The basic properties of this closure are found: the criterion to be partial order, closure is the closure operator, denotative representations of closure in terms of its properties and as the least solution of some equation (the structure of the set of all solutions of this equation is established).

关键词： Standards Object oriented programming Heuristic algorithms Electronic mail Computer languages

来源：评论

学校读者我要写书评

暂无评论

Verification of logs - revealing faulty processes of a medical laboratory 35th

Verification of logs - revealing faulty processes of a medic...

引用

Workshops held at 35th International Conference on Application and theory of Petri Nets and Concurrency, Petri Nets 2014 and 14th International Conference on Application of Concurrency to System Design, ACSD 2014

作者： Bergenthum, Robin Schick, Joachim Department of Software Engineering and Theory of Programming FernUniversität in Hagen Hagen Germany

ISBN: (纸本)9783662486498

If there is suspicion of Lyme disease, a doctor sends a blood sample of the patient to a medical laboratory. The laboratory performs a number of different blood examinations, testing for antibodies against the Lyme disease bacteria. The total number of performed examinations depends on the intermediate results of the blood count. Of course, the number of performed examinations is important since the cost of each examination needs to be covered by the health insurance companies. In order to control and restrict the number of performed examinations, the health insurance companies provide a so called charges regulation document. If some health insurance company disagrees with the charges of a laboratory, it is the job of the public prosecution service to validate the charges according to this document. In this paper we present a case study showing a systematic approach to revealing faulty processes in a medical laboratory. Different files produced by the information system of the respective laboratory are analyzed, consolidated, and stored in a database. An excerpt of this data is translated into an event log, providing a list of all events performed by the information system. This list is further compressed and translated into the language of the information system. Compared to the size of the data and the size of the event log, the size of the language is small. With the help of the regulation document this language can be split in two sets - the set of valid and the set of faulty words. In a next step, we build a colored Petri net model corresponding to the set of valid words in a sense that only the valid words are executable in the Petri net model. In a last step we translate the colored Petri net into a PL/SQL-program. This program can automatically reveal all faulty processes stored in the database. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Blood

来源：评论

学校读者我要写书评

暂无评论

Compact regions for place/transition nets

Compact regions for place/transition nets

引用

Workshop on Algorithms and Theories for the Analysis of Event Data, ATAED 2015

作者： Bergenthum, Robin Department of Software Engineering and Theory of Programming Fern Universität in Hagen Germany

This paper presents compact regions to synthesize a Petri net from a partial language. We synthesize a Petri net using the theory of regions. Let there be a partial language, every region definition provides an inequality system and a solution of this system is called a region. Every region defines a valid place where a place is valid if it enables every word of the partial language. The new compact region definition relies on compact tokenflows. Compact tokenflows are a very efficient behavioral model for the partial language of Petri nets [3, 4]. Compact regions will lead to faster synthesis algorithms computing smaller Petri nets solving the synthesis problem.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Including gap junctions into distributed neuronal network simulations 1

引用

2nd International Workshop on Brain-Inspired Computing, BrainComp 2015

作者： Hahne, Jan Helias, Moritz Kunkel, Susanne Igarashi, Jun Kitayama, Itaru Wylie, Brian Bolten, Matthias Frommer, Andreas Diesmann, Markus School of Mathematics and Natural Sciences University of Wuppertal Wuppertal Germany and JARA BRAIN Institute I Jülich Research Centre Jülich Germany RIKEN Advanced Institute for Computational Science Programming Environment Research Team Kobe Japan Department of Computational Science and Technology School of Computer Science and Communication KTH Royal Institute of Technology Stockholm Sweden Simulation Laboratory Neuroscience Bernstein Facility for Simulation and Database Technology Institute for Advanced Simulation Jülich Aachen Research Alliance Jülich Research Centre Jülich Germany Okinawa Institute of Science and Technology Neural Computation Unit Okinawa Japan Laboratory for Neural Circuit Theory RIKEN Brain Science Institute Wako Japan HPC Usability Research Team RIKEN Advanced Institute for Computational Science Kobe Japan Jülich Supercomputing Centre Jülich Research Centre Jülich Germany Institut für Mathematik Universität Kassel Kassel Germany Department of Psychiatry Psychotherapy and Psychosomatics Medical Faculty RWTH Aachen University Aachen Germany Department of Physics Faculty 1 RWTH Aachen University Aachen Germany

ISBN: (数字)9783319508627

ISBN: (纸本)9783319508610

Contemporary simulation technology for neuronal networks enables the simulation of brain-scale networks using neuron models with a single or a few compartments. However, distributed simulations at full cell density are still lacking the electrical coupling between cells via so called gap junctions. This is due to the absence of efficient algorithms to simulate gap junctions on large parallel computers. The difficulty is that gap junctions require an instantaneous interaction between the coupled neurons, whereas the efficiency of simulation codes for spiking neurons relies on delayed communication. In a recent paper [15] we describe a technology to overcome this obstacle. Here, we give an overview of the challenges to include gap junctions into a distributed simulation scheme for neuronal networks and present an implementation of the new technology available in the NEural Simulation Tool (NEST 2.10.0). Subsequently we introduce the usage of gap junctions in model scripts as well as benchmarks assessing the performance and overhead of the technology on the supercomputers JUQUEEN and K computer. © Springer International Publishing AG 2016.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Linearization algorithms CLOS and LOOPS of the classes in programming languages: The formal definitions

Linearization algorithms CLOS and LOOPS of the classes in pr...

引用

IEEE International Scientific Conference on Informatics

作者： D. Buy J. Karam S. Kompan S. Polyakov Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv Kyiv Ukraine Kiivs'kij nacional'nij universitet imeni Tarasa Sevcenka Kiiv KiÃ¯v UA

The methods of conflict resolution of names in programming languages that allow multiple inheritance were researched. Those methods are based on the linearization of the classes. The idea of linearization is to reduce multiple inheritance to single, in which the problem of selecting a suitable attribute is solved trivially. The definition of a hierarchy of classes is introduced. The property of monotonicity was clarified. The idea of monotonicity is that all the attributes that the class inherits either identified in its direct ancestors, or inherited them. Methods of conflict resolution used in programming languages CLOS and LOOPS were formally defined.

关键词： Computer languages programming Heuristic algorithms Semantics Yttrium Conferences Informatics

来源：评论

学校读者我要写书评

暂无评论

Visual Language Plans - Formalization of a pedagogical learnflow modeling language

Visual Language Plans - Formalization of a pedagogical learn...

引用

International Workshop on Petri Nets and Software Engineering, PNSE 2014

作者： Irgang, Kerstin Irgang, Thomas Human-Centered Information Systems Clausthal University of Technology Germany Department of Software Engineering and Theory of Programming Fernuniversität Hagen Germany

In this paper we present an approach to support selfregulated learn-flows in the collaborative environment Metafora. In this environment students construct Visual Language Plans. Those plans model workflows of learning activities, which the students execute to solve complex learning scenarios across different tools. Visual Language plans were already used in the context of different pedagogical studies but have no formal syntax or semantics, yet. In this paper, we present the syntax of Visual Language Plans and develop a mapping from Visual Language Plans to Petri net defining semantics. With the help of this semantics, the environment can support the students executing their learnflows. If students execute activities given in a Visual Language Plan which are not enabled in the corresponding Petri net, feedback messages occur guiding the students. Students can refine their Visual Language Plan during execution. If a plan changes the corresponding Petri net model also changes. Analyzing the newly generated Petri net model can help to uncover faulty states of the learnflow model.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Algebraic models of application of computer systems and information technologies

Algebraic models of application of computer systems and info...

引用

IEEE International Scientific Conference on Informatics

作者： Volodymyr Ovsyak Oleksandr Ovsyak Dmytro Bui Julia Petruszka Dept. Application of Informatics Kielce University of Technology Kielce Poland Dept. Kino and Arts National University of Culture and Arts L'viv Ukraine Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv Kyiv Ukraine Dept. Automatic and Information Technology Ukrainian University of Printing L'viv Ukraine

The mathematical models of diagrams of using cases of computer systems and information technologies (for Microsoft Visual *** platform) are built in the forms of Glushkov's algorithmic algebra systems, Zeitlin-Pogorilyi's modified algorithmic algebra systems, modified algorithmic algebras and primitive program algebras (PPA), which is an example of programing algebra class of composite type. Property of monotonicity and continuity is established for the branching operation of PPA as the corollary of the representation of branching operation in terms of set-theoretic constructions of function restriction over set using the properties of monotonicity and distributivity of function restriction and whole image of set with respect to binary relation.

关键词： Algebra Unified modeling language Computational modeling Computers Information technology Mathematical model Visualization

来源：评论

学校读者我要写书评

暂无评论

Faster verification of partially ordered runs in Petri nets using compact tokenflows

Faster verification of partially ordered runs in Petri nets ...

引用

34th International Conference on Application and theory of Petri Nets and Concurrency, PETRI NETS 2013

作者： Bergenthum, Robin Department of Software Engineering and Theory of Programming FernUniversität in Hagen Germany

ISBN: (纸本)9783642386961

In this paper we tackle the problem of verifying whether a labeled partial order (LPO) is executable in a Petri net. In contrast to sequentially ordered runs an LPO includes both, information about dependencies and independencies of events. Consequently an LPO allows a precise and intuitive specification of the behavior of a concurrent or distributed system. In this paper we consider Petri nets with arc weights, namely marked place/transition-nets (p/t-nets). Accordingly the question is whether a given LPO is an execution of a given p/t-net. Different approaches exist to define the partial language (i.e. the set of executions) of a p/t-net. Each definition yields a different verification algorithm, but in terms of runtime all these algorithms perform quite poorly for most examples. In this paper a new compact characterization of the partial language of a p/t-net will be introduced, optimized with respect to the verification problem. The goal is to develop an algorithm to efficiently decide the verification problem. © 2013 Springer-Verlag.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Satisfiability and validity problems in many-sorted composition-nominative pure predicate logics

Satisfiability and validity problems in many-sorted composit...

引用

8th International Conference on ICT in Education, Research, and Industrial Applications, ICTERI 2012

作者： Nikitchenko, Mykola S. Tymofieiev, Valentyn G. Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 64 Volodymyrska Street 01601 Kyiv Ukraine

ISBN: (纸本)9783642357367

We propose methods for solving the satisfiability and validity problems in many-sorted composition-nominative pure predicate logics (without functions and with equality). These logics are algebra-based logics of many-sorted partial predicates constructed in a semantic-syntactic style on the methodological basis that is common with programming;they can be considered as generalizations of traditional many-sorted logics on classes of partial predicates that do not have fixed arity. We show the reduction of the satisfiability problem to the same problem for many-sorted classical first-order pure predicate logic with equality. As validity is dual to satisfiability, the method proposed can be adopted to the validity problem. This enables us to use existent satisfiability and validity checking procedures developed for classical logic also for solving these problems in composition-nominative pure predicate logics with equality. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Structure theory of Petri nets

Structure theory of Petri nets

引用

5th International Summer School "Advanced Course on Petri Nets"

作者： Best, Eike Wimmel, Harro Parallel Systems Department of Computing Science Carl Von Ossietzky Universität Oldenburg D-26111 Oldenburg Germany Theory of Programming Languages and Programming Institut für Informatik Universität Rostock Albert-Einstein-Straße 22 D-18059 Rostock Germany

ISBN: (纸本)9783642381423

The aim of this tutorial is to give a concise, but nonetheless not too narrow, overview of definitions and results pertaining centrally to Petri net structure theory. The Petri net model considered in these notes are the classical place/transition nets, as they have been defined in the First Advanced Course held in 1979 and originate back to the late Sixties. Structure theory asks what behavioural properties of a Petri net can be derived from its structural properties. Other aspects of Petri nets are neglected to a large extent in the present notes, such as various extensions and generalisations of central notions and results, as well as almost all algorithmic and complexity-theoretic consequences that accompany the structure-theoretic results. Because full proofs can easily be retrieved from the literature, they are not given, unless they are small and perhaps somewhat characteristic for Petri net oriented reasoning. Proof ideas are often sketched, however, and the sharpness of various results is accentuated by means of examples and counterexamples. A list for further reading is also provided. © Springer-Verlag 2013.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：