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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

94 篇 期刊文献
46 篇 会议
4 册 图书
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

128 篇 工学
- 111 篇 计算机科学与技术...
- 38 篇 电气工程
- 38 篇 软件工程
- 7 篇 信息与通信工程
- 6 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 2 篇 机械工程
- 2 篇 航空宇航科学与技...
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
31 篇 理学
- 27 篇 数学
- 3 篇 物理学
- 1 篇 科学技术史(分学科...
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 7 篇 管理科学与工程(可...
1 篇 教育学
- 1 篇 教育学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

147 篇 models of comput...
10 篇 computational co...
8 篇 systemc
7 篇 embedded systems
7 篇 cyber-physical s...
7 篇 cellular automat...
5 篇 simulation
5 篇 turing machines
5 篇 algorithms
4 篇 theory of comput...
4 篇 dataflow
4 篇 heterogeneous mo...
3 篇 parallel algorit...
3 篇 languages
3 篇 reconfigurable s...
3 篇 time hierarchies
3 篇 hypercomputation
3 篇 design
3 篇 theory
3 篇 vlsi

机构

4 篇 univ calif berke...
3 篇 leiden univ leid...
3 篇 univ giessen ins...
3 篇 univ calif berke...
2 篇 univ kassel fach...
2 篇 loughborough uni...
2 篇 univ cantabria d...
2 篇 virginia polytec...
2 篇 queens univ sch ...
2 篇 univ auckland de...
2 篇 univ milan dipar...
2 篇 univ maryland in...
1 篇 univ illinois de...
1 篇 tetra pak packag...
1 篇 natl instruments...
1 篇 univ vaasa sch t...
1 篇 saab ab business...
1 篇 microsoft res ca...
1 篇 univ calabria de...
1 篇 univ surrey ctr ...

作者

4 篇 sander ingo
4 篇 lee ea
4 篇 akl selim g.
3 篇 stefanov todor
3 篇 klein a
3 篇 pighizzini giova...
3 篇 loubach denis s.
3 篇 kutrib m
3 篇 bhattacharyya sh...
3 篇 bournez olivier
2 篇 shafiei arash
2 篇 prigioniero luca
2 篇 schneider klaus
2 篇 nicollin xavier
2 篇 bingham brad d.
2 篇 shukla sk
2 篇 liu xj
2 篇 krishnaswamy rub...
2 篇 duarte gabriel c...
2 篇 ungureanu george

语言

140 篇 英文
6 篇 其他
1 篇 中文

检索条件"主题词=Models of computation"

共 147 条记录，以下是101-110 订阅

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

详细简洁

排序：

Translating Synchronous Guarded Actions to Interleaved Guarded Actions

Translating Synchronous Guarded Actions to Interleaved Guard...

引用

11th IEEE/ACM International Conference on Formal Methods and models for Codesign (MEMOCODE)

作者： Gesell, Manuel Schneider, Klaus Univ Kaiserslautern Dept Comp Sci D-67663 Kaiserslautern Germany

ISBN: (纸本)9781479909032

In general, guarded actions are well suited to describe systems with different models of computations (MoCs). Different MoCs are thereby obtained by different ways to select actions for execution: In particular, in synchronous models, one executes all enabled actions, in interleaved models, one executes one of the enabled actions, and in asynchronous models, some non-empty subset of the enabled actions is executed. It seems to be impossible to use tools for one of these MoCs for guarded actions that are based on another MoC. In particular, it is unfortunate for the synchronous models that many rewrite-based verification tools and theorem provers are based on interleaved MoCs. In this paper, we therefore develop a translation from synchronous guarded actions (SGAs) to interleaved guarded actions (IGAs). This allows us to use many established tools for formal verification also for systems represented by SGAs. To achieve this, we have to solve four major problems: first, the causal execution order of the synchronous guarded actions must be encoded in the IGAs. Second, the different behaviors of immediate and delayed assignments of our SGAs must be preserved. Third, it must be guaranteed that all IGAs of one macro step are executed before the IGAs of the next macro step are started. Finally, temporal logic specifications stated for the SGAs have to be adequately adapted for IGAs. Our results are finally used to verify SGAs obtained by compilation of synchronous programs by means of the symbolic analysis laboratory (SAL) of SRI.

关键词： synchronous systems models of computation synchronous guarded actions interleaved guarded actions guarded commands

来源：评论

学校读者我要写书评

暂无评论

Tri-State Circuits A Circuit Model that Captures RAM 43rd

Tri-State Circuits A Circuit Model that Captures RAM

引用

43rd International Cryptology Conference (CRYPTO)

作者： Heath, David Kolesnikov, Vladimir Ostrovsky, Rafail UIUC Champaign IL 61820 USA Georgia Tech Atlanta GA USA Univ Calif Los Angeles Los Angeles CA USA

ISBN: (纸本)9783031385506;9783031385513

We introduce tri-state circuits (TSCs). TSCs form a natural model of computation that, to our knowledge, has not been considered by theorists. The model captures a surprising combination of simplicity and power. TSCs are simple in that they allow only three wire values (0, 1, and undefined - Z) and three types of fan-in two gates;they are powerful in that their statically placed gates fire (execute) eagerly as their inputs become defined, implying orders of execution that depend on input. This behavior is sufficient to efficiently evaluate RAM programs. We construct a TSC that emulates T steps of any RAM program and that has only O(T center dot log(3) T center dot log log T) gates. Contrast this with the reduction from RAM to Boolean circuits, where the best approach scans all of memory on each access, incurring quadratic cost. We connect TSCs with Garbled Circuits (GC). TSCs capture the power of garbling far better than Boolean Circuits, offering a more expressive model of computation that leaves per-gate cost essentially unchanged. As an important application, we construct authenticated Garbled RAM (GRAM), enabling constant-round maliciously-secure 2PC of RAM programs. Let lambda denote the security parameter. We extend authenticated garbling to TSCs;by simply plugging in our TSC-based RAM, we obtain authenticated GRAM running at cost O(T center dot log(3) T center dot log log T center dot lambda), outperforming all prior work, including prior semi-honest GRAM. We also give semi-honest garbling of TSCs from a one-way function (OWF). This yields OWF-based GRAM at cost O(T center dot log(3) T center dot log log T center dot lambda), outperforming the best prior OWF-based GRAM by more than factor lambda.

关键词： Garbled RAM MPC models of computation Malicious Security

来源：评论

学校读者我要写书评

暂无评论

Instrumentation-driven Framework for Validation of Dataflow Applications

Instrumentation-driven Framework for Validation of Dataflow ...

引用

IEEE Workshop on Signal Processing Systems (SiPS)

作者： Chukhman, Ilya Bhattacharyya, Shuvra S. Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA

ISBN: (纸本)9781479965885

Dataflow modeling offers a myriad of tools in designing and optimizing signal processing systems. A designer is able to take advantage of dataflow properties to effectively tune the system in connection with functionality and different performance metrics. However, a disparity in the specification of dataflow properties and the final implementation can lead to incorrect behavior that is difficult to detect. This motivates the problem of ensuring consistency between dataflow properties that are declared or otherwise assumed as part of dataflow-based application models and the dataflow behavior that is exhibited by implementations that are derived from the models. In this paper, we address this problem by introducing a novel dataflow validation framework (DVF) that is able to identify disparities between an application's formal dataflow representation and its implementation. We demonstrate the utility of our DVF through design and implementation case studies involving an automatic speech recognition application, and a JPEG encoder.

关键词： Dataflow graphs models of computation signal processing systems validation

来源：评论

学校读者我要写书评

暂无评论

Timing enclaves for performance in Lingua Franca 27

Timing enclaves for performance in Lingua Franca

引用

27th Forum on Specification and Design Languages (FDL)

作者： Robledo, Julian Menar, Christian Jellum, Erling Lee, Edward A. Castrillon, Jeronimo Tech Univ Dresden Dresden Germany NTNU Trondheim Norway Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9798331504588;9798331504571

The reactor model is a model of computation for concurrent systems that includes semantics for time to guarantee deterministic execution of events. However, the guarantee of determinism comes at the price of raising the complexity of building a runtime scheduling algorithm that efficiently exploit parallelism of real time systems. In this paper we propose a methodology called "timing enclaves" for partitioning of reactor programs written using Lingua Franca, a novel coordination language that implements the reactor model. Timing enclaves decouple the timeline of an application to use multiple schedulers that allow parallel computation while preserving determinism. We evaluate our approach on a baseband processing benchmark, a complex use case with a high degree of parallelism and real-time constraints. We show that our approach has performance comparable to a prior asynchronous and nondeterministic implementation while ensuring determinism.

关键词： Baseband processing models of computation reactors

来源：评论

学校读者我要写书评

暂无评论

Interoperation of heterogeneous CAD tools in Ptolemy II

Interoperation of heterogeneous CAD tools in Ptolemy II

引用

Conference on Design, Test, and Microfabrication of MEMS and MOEMS

作者： Liu, J Wu, BC Liu, XJ Lee, EA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)0819431540

Typical complex systems that involve microsensors and microactuators exhibit heterogeneity both at the implementation level and the problem level. For example, a system can be modeled using discrete events for digital circuits and SPICE-like analog descriptions for sensors. This heterogeneity exists not only in different implementation domains, but also at different levels of abstraction. This naturally leads to a heterogeneous approach to system design that uses domain-specific models of computation (MoC) at various levels of abstractions to define a system, and leverages multiple CAD tools to do simulation, verification and synthesis. As the size and scope of the system increase, the integration becomes too difficult and unmanageable if different tools are coordinated using simple scripts. In addition, for MEMS devices and mixed-signal circuits, it is essential to integrate tools with different MoC to simulate the whole system. Ptolemy TI, a heterogeneous system-level design tool, supports the interaction among different MoCs. This paper discusses heterogeneous CAD tool interoperability in the Ptolemy II framework. The key is to understand the semantic interface and classify the tools by their MoC and their level of abstraction. Interfaces are designed for each domain so that the external tools can be easily wrapped. Then the interoperability of the tools becomes the interoperability of the semantics. Ptolemy II can act as the standard interface among different tools to achieve the overall design modeling. A micro-accelerometer with digital feedback is studied as an example.

关键词： heterogeneous simulation models of computation tool interaction Ptolemy II

来源：评论

学校读者我要写书评

暂无评论

An Overview of Cyber-Physical Systems' Hardware Architecture Concerning Machine Learning 40

An Overview of Cyber-Physical Systems' Hardware Architecture...

引用

IEEE/AIAA 40th Digital Avionics Systems Conference (DASC)

作者： Loubach, Denis S. Aeronaut Inst Technol ITA Comp Sci Div Dept Comp Syst BR-12228900 Sao Jose Dos Campos SP Brazil

ISBN: (纸本)9781665434201

In this paper, we present the main cyber-physical systems' hardware architectures that also take into account the use or possible use of machine learning algorithms to improve the overall system performance. Our brief overview considers aspects including domain-specific architecture, runtime reconfiguration, separation of virtual and physical platforms, formal models of computation, and the use of machine learning algorithms. Here, we also regard the safety aspect since these key concepts and the application of autonomy seems to have some level of acceptance in digital avionics systems. Our study highlights the main benefits and drawbacks of analyzed architectures and their impact on safety.

关键词： Domain-specific architecture Cyber-physical systems Embedded systems Avionics systems Hardware architectures Heterogeneous and Multicore systems models of computation

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Properties of Combinatory Logic 12

Asymptotic Properties of Combinatory Logic

引用

12th Annual Conference on Theory and Applications of models of computation (TAMC)

作者： Bendkowski, Maciej Grygiel, Katarzyna Zaionc, Marek Jagiellonian Univ Fac Math & Comp Sci Theoret Comp Sci Dept Ul Lojasiewicza 6 PL-30348 Krakow Poland

ISBN: (纸本)9783319171425;9783319171418

We present a quantitative analysis of random combinatory logic terms. Our main goal is to investigate likelihood of semantic properties of random combinators. We show that asymptotically almost all weakly normalizing terms are not strongly normalizing. Moreover, we present a proof that asymptotically almost all strongly normalizing terms are not in normal form. We also prove that asymptotically almost all normal forms in combinatory logic are not typeable.

关键词： models of computation Combinatory logic Asymptotic probability in logic

来源：评论

学校读者我要写书评

暂无评论

Realizing FIFO Communication When Mapping Kahn Process Networks onto the Cell

引用

9th SAMOS International Workshop

作者： Nadezhkin, Dmitry Meijer, Sjoerd Stefanov, Todor Deprettere, Ed Leiden Univ Leiden Inst Adv Comp Sci NL-2333 CA Leiden Netherlands

ISBN: (纸本)9783642031373

Kahn Process Networks (KPN) are an appealing model of computation to specify streaming applications. When a KPN has to execute on a multi-processor platform, a mapping of the KPN model to the execution platform model should mitigate all possible overhead introduced by the mismatch between primitives realizing the communication semantics of the two models. In this paper, we consider mappings of KPN specification of streaming applications onto the Cell BE multi-processor execution platform. In particular, we investigate how to realize the FIFO communication of a KPN onto the Cell BE in order to reduce the synchronization overhead. We present a solution based on token packetization and show the performance results of five different streaming applications mapped onto the Cell BE.

关键词： models of computation Kahn Process Networks distributed FIFO communication the Cell BE platform

来源：评论

学校读者我要写书评

暂无评论

Toward Enabling Automated Cognition and Decision-Making in Complex Cyber-Physical Systems

Toward Enabling Automated Cognition and Decision-Making in C...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Bogdan, Paul Pedram, Massoud Univ Southern Calif Ming Hsieh Dept Elect Engn 3740 McClintock Ave Los Angeles CA 90089 USA

ISBN: (纸本)9781538648810

This article presents a framework for empowering automated cognition and decision making in complex cyber-physical systems (CPS). The key idea is for each cyber-physical component in the system to be able to construct from observations and actions a reduced model of its behavior and respond to external stimuli in the form of a (timed) probabilistic automaton such as a semi-Markov decision process. The reduced order behavioral models of various cyber-physical components can then be integrated into an optimization and decision-making module to determine the best actions for the components under different operating scenarios and cost / payoff functions by solving a bounded-rationality global decision-making problem.(1)

关键词： Cyber-physical systems autonomy partially observable Markov decision processes models of computation

来源：评论

学校读者我要写书评

暂无评论

A Physically Universal Cellular Automaton 15

A Physically Universal Cellular Automaton

引用

6th Conference on Innovations in Theoretical Computer Science (ITCS)

作者： Schaeffer, Luke MIT 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450333337

Several cellular automata (CA) are known to be universal in the sense that one can simulate arbitrary computations (e.g., circuits or Turing machines) by carefully encoding the computational device and its input into the cells of the CA. In this paper, we consider a different kind of universality proposed by Janzing. A cellular automaton is physically universal if it is possible to implement any transformation on a finite region of the CA by initializing the complement of the region and letting the system evolve. We give the first known example of a physically universal CA, answering an open problem of Janzing and opening the way for further research in this area.

关键词： Cellular automata universality models of computation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：