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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

525 篇 会议
195 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

464 篇 工学
- 374 篇 计算机科学与技术...
- 305 篇 软件工程
- 55 篇 信息与通信工程
- 52 篇 控制科学与工程
- 27 篇 电气工程
- 27 篇 土木工程
- 24 篇 电子科学与技术（可...
- 23 篇 船舶与海洋工程
- 22 篇 生物工程
- 19 篇 机械工程
- 16 篇 建筑学
- 15 篇 网络空间安全
- 14 篇 生物医学工程（可授...
- 10 篇 材料科学与工程（可...
- 9 篇 农业工程
222 篇 理学
- 124 篇 数学
- 38 篇 系统科学
- 35 篇 物理学
- 29 篇 生物学
- 27 篇 统计学（可授理学、...
- 21 篇 海洋科学
117 篇 管理学
- 76 篇 管理科学与工程(可...
- 44 篇 图书情报与档案管...
- 41 篇 工商管理
18 篇 经济学
- 17 篇 应用经济学
15 篇 法学
- 14 篇 社会学
15 篇 教育学
- 13 篇 教育学
15 篇 医学
- 12 篇 临床医学
- 11 篇 基础医学(可授医学...
12 篇 农学
- 11 篇 作物学
3 篇 文学
2 篇 哲学
1 篇 军事学

主题

21 篇 application soft...
20 篇 semantics
17 篇 programming
17 篇 software
14 篇 testing
14 篇 unified modeling...
13 篇 software enginee...
12 篇 optimization
12 篇 monitoring
12 篇 data models
11 篇 runtime
11 篇 hardware
11 篇 artificial intel...
10 篇 java
9 篇 computer archite...
9 篇 model checking
9 篇 analytical model...
8 篇 computer science
8 篇 software systems
8 篇 electronic mail

机构

15 篇 institute for pr...
11 篇 department of sy...
10 篇 technical univer...
8 篇 programming syst...
7 篇 chair for progra...
7 篇 department of pr...
6 篇 department of co...
6 篇 programming syst...
6 篇 department of co...
6 篇 computer enginee...
6 篇 computer techniq...
5 篇 department of co...
5 篇 department of el...
5 篇 department of pr...
5 篇 technical univer...
5 篇 tu braunschweig ...
5 篇 department of co...
5 篇 department of co...
5 篇 institute for so...
5 篇 institute for pr...

作者

48 篇 steffen bernhard
33 篇 margaria tiziana
19 篇 bernhard steffen
17 篇 michael philipps...
17 篇 bauer bernhard
15 篇 philippsen micha...
13 篇 goltz ursula
13 篇 wu youfeng
13 篇 lochau malte
12 篇 gancheva veska
12 篇 tiziana margaria
12 篇 christopher muts...
10 篇 veska gancheva
9 篇 wang cheng
9 篇 lamprecht anna-l...
9 篇 youfeng wu
9 篇 christiansen hen...
9 篇 naujokat stefan
9 篇 niehren joachim
8 篇 mostafa abotaleb

语言

693 篇 英文
18 篇 其他
5 篇 德文
2 篇 中文
1 篇 法文
1 篇 日文

检索条件"机构=Systems and Programming"

共 720 条记录，以下是301-310 订阅

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

详细简洁

排序：

Double inspection for run-time loop parallelization

Double inspection for run-time loop parallelization

引用

24th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2011

作者： Philippsen, Michael Tillmann, Nikolai Brinkers, Daniel Computer Science Dept. Programming Systems Group University of Erlangen-Nuremberg Erlangen Germany Microsoft Research One Microsoft Way Redmond WA United States

ISBN: (纸本)9783642360350

The Inspector/Executor is well-known for parallelizing loops with irregular access patterns that cannot be analyzed statically. The downsides of existing inspectors are that it is hard to amortize their high run-time overheads by actually executing the loop in parallel, that they can only be applied to loops with dependencies that do not change during their execution and that they are often specifically designed for array codes and are in general not applicable in object oriented just-in-time compilation. In this paper we present an inspector that inspects a loop twice to detect if it is fully parallelizable. It works for arbitrary memory access patterns, is conservative as it notices if changing data dependencies would cause errors in a potential parallel execution, and most importantly, as it is designed for current multicore architectures it is fast - despite of its double inspection effort: it pays off at its first use. On benchmarks we can amortize the inspection overhead and outperform the sequential version from 2 or 3 cores onward. © 2013 Springer-Verlag.

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

A declarative pipeline language for complex data analysis

A declarative pipeline language for complex data analysis

引用

22nd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2012

作者： Christiansen, Henning Theil Have, Christian Torp Lassen, Ole Petit, Matthieu Research Group PLIS: Programming Logic and Intelligent Systems Department of Communication Business and Information Technologies Roskilde University P.O. Box 260 Roskilde 4000 Denmark

ISBN: (纸本)9783642381966

We introduce BANpipe - a logic-based scripting language designed to model complex compositions of time consuming analyses. Its declarative semantics is described together with alternative operational semantics facilitating goal directed execution, parallel execution, change propagation and type checking. A portable implementation is provided, which supports expressing complex pipelines that may integrate different Prolog systems and provide automatic management of files. © 2013 Springer-Verlag.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms that use Runtime Migration of Detector Processes to Reduce Latency in Event-Based systems

Evolutionary Algorithms that use Runtime Migration of Detect...

引用

NASA/ESA Conference on Adaptive Hardware and systems

作者： Christoffer Loffler Christopher Mutschler Michael Philippsen Programming Systems Group CS Dept. University of Erlangen-Nuremberg

ISBN: (纸本)9781467363822

Event-based systems (EBS) are widely used to efficiently process massively parallel data streams. In distributed event processing the allocation of event detectors to machines is crucial for both the latency and efficiency, and a naive allocation may even cause a system failure. But since data streams, network traffic, and event loads cannot be predicted sufficiently well the optimal detector allocation cannot be found a-priori and must instead be determined at runtime. This paper describes how evolutionary algorithms (EA) can be used to minimize both network and processing latency by means of runtime migration of event detectors. The paper qualitatively evaluates the algorithms on synthetical data streams in a distributed event-based system. We show that some EAs work efficiently even with large numbers of event detectors and machines and that a hybrid of Cuckoo Search and Particle Swarm Optimization outperforms others.

关键词： Heuristics Evolutionary Algorithms Particle Swarm Optimization Publish/Subscribe Distributed Computing

来源：评论

学校读者我要写书评

暂无评论

Reliable speculative processing of out-of-order event streams in generic publish/subscribe middlewares 13

Reliable speculative processing of out-of-order event stream...

引用

7th ACM International Conference on Distributed Event-Based systems, DEBS 2013

作者： Mutschler, Christopher Philippsen, Michael University of Erlangen-Nuremberg Department of Computer Science Programming Systems Group Erlangen Germany Fraunhofer Institute for Integrated Circuits IIS Locating and Communication Department Sensor Fusion and Event Processing Group Erlangen Germany

ISBN: (纸本)9781450317580

In surveillance, sports, finances, etc., distributed event-based systems are used to detect meaningful events with low latency in high data rate event streams. Both known approaches to deal with the predominant out-of-order event arrival at the distributed detectors have their shortcomings: buffering approaches introduce latencies for event ordering and stream revision approaches may result in system overloads due to unbounded retraction cascades. This paper presents a speculative processing technique for out-of-order event streams that enhances typical buffering approaches. In contrast to other stream revision approaches our novel technique encapsulates the event detector, uses the buffering technique to delay events but also speculatively processes a portion of it, and adapts the degree of speculation at runtime to fit the available system resources so that detection latency becomes minimal. Our technique outperforms known approaches on both synthetical data and real sensor data from a Realtime Locating System (RTLS) with several thousands of out-of-order sensor events per second. Speculative buffering exploits system resources and reduces latency by 40% on average. Copyright © 2013 ACM.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

The functional programming language R and the paradigm of dynamic scientific programming (Position paper)

The functional programming language R and the paradigm of dy...

引用

13th Symposium on Trends in Functional programming, TFP 2012

作者： Widemann, Baltasar Trancón Y. Bolz, Carl Friedrich Grelck, Clemens Ecological Modelling and Computer Science Universität Bayreuth Germany Software Engineering and Programming Languages Heinrich-Heine-Universität Düsseldorf Germany Computer Systems Architecture Universiteit Van Amsterdam Netherlands

ISBN: (纸本)9783642404467

R is an environment and functional programming language for statistical data analysis and visualization. Largely unknown to the functional programming community, it is popular and influential in many empirical sciences. Due to its integrated combination of dynamic and reflective scripting on one hand, and array-based numerical computation on the other, R poses unique and challenging implementation problems, at odds with the conservative language technology employed by its developers. We discuss the background of R in historical context, highlight some of the more problematic language features, and discuss the potential for the effective use of state-of-the-art language technology in a future, safe and efficient implementation. © 2013 Springer-Verlag.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

Synthesis-based variability control: Correctness by construction

Synthesis-based variability control: Correctness by construc...

引用

10th International Symposium on Formal Methods for Components and Objects, FMCO 2011

作者： Lamprecht, Anna-Lena Margaria, Tiziana Schaefer, Ina Steffen, Bernhard Department for Service and Software Engineering University of Potsdam Germany Institut für Softwaretechnik und Fahrzeuginformatik Technische Universität Braunschweig Germany Department for Programming Systems Technical University Dortmund Germany

ISBN: (纸本)9783642358869

In this paper, we show the power of combining modern synthesis technology with a constraint-oriented approach to variability modeling. This combination guarantees the validity of all the required properties simply by construction: including a new property simply requires adding a corresponding constraint. The synthesis procedure will then automatically take care that all generated variants are property-conform. This fully declarative approach leads to a very agile variability modeling framework, where new product lines guaranteeing new properties can be defined ad hoc and are, due to our synthesis technology, immediately operational. As the underlying constraint language allows fully describing the intended solution space without imposing any overspecification, neither on the structure, nor on the artifacts, our approach may in particular be regarded as a step from the today typical settings with closed-world assumption to one with an open-world assumption. Impact and ease of this method are illustrated along a small case study running on our prototypical framework implementation. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Object Support for OpenMP-style programming of GPU Clusters in Java

Object Support for OpenMP-style Programming of GPU Clusters ...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Carolin Wolf Georg Dotzler Ronald Veldema Michael Philippsen Computer Science Department Programming Systems Group University of Erlangen-Nuremberg Erlangen Germany

ISBN: (纸本)9781467362399

For scientists, it is advantageous to use a high level of abstraction for programming their simulations, so that they can focus on the problem at hand instead of struggling with low-level details. However, current HPC clusters with multiple GPUs per node only offer explicit communication to and from the GPUs, require manual work to keep the data consistent, and often need explicit kernel programming. Moreover, known GPU programming frameworks are limited to a single GPU or a single machine and also rarely support objects. Our system removes the above restrictions. With a slight but necessary change in Java's semantics, we achieve automatic distribution and efficient use of objects and arrays of objects on multiple GPUs in a cluster. On benchmarks that distribute arrays of objects over five machines with 10 GPUs, we achieve speedups of up to 4.9 compared to one node.

关键词： Arrays Java Graphics processing units Kernel programming Vectors Middleware

来源：评论

学校读者我要写书评

暂无评论

A Methodology for Model-based Development and Automated Verification of Software for Aerospace systems

A Methodology for Model-based Development and Automated Veri...

引用

IEEE Aerospace Conference

作者： Lukas Martin Maxim Schatalov Matthias Hagner Ursula Goltz Olaf Maibaum Institute for Programming and Reactive Systems TU Braunschweig Simulation and Software Technology German Aerospace Center

ISBN: (纸本)9781467318129

Today's software for aerospace systems typically is very complex. This is due to the increasing number of features as well as the high demand for safety, reliability, and quality. This complexity also leads to significant higher software development costs. To handle the software complexity, a structured development process is necessary. Additionally, compliance with relevant standards for quality assurance is a mandatory concern. To assure high software quality, techniques for verification are necessary. Besides traditional techniques like testing, automated verification techniques like model checking become more popular. The latter examine the whole state space and, consequently, result in a full test coverage. Nevertheless, despite the obvious advantages, this technique is rarely yet used for the development of aerospace systems. In this paper, we propose a tool-supported methodology for the development and formal verification of safety-critical software in the aerospace domain. The methodology relies on the V-Model and defines a comprehensive work flow for model-based software development as well as automated verification in compliance to the European standard series ECSS-E-ST-40C. Furthermore, our methodology supports the generation and deployment of code. For tool support we use the tool SCADE Suite (Esterel Technology), an integrated design environment that covers all the requirements for our methodology. The SCADE Suite is well established in avionics and defense, rail transportation, energy and heavy equipment industries. For evaluation purposes, we apply our approach to an up-to-date case study of the TET-1 satellite bus. In particular, the attitude and orbit control software is considered. The behavioral models for the subsystem are developed, formally verified, and optimized.

关键词： aerospace systems computer software Quality assurance Workflow Software design Verification state space safety-critical software computer programs test coverage Automation avionics Formal verification

来源：评论

学校读者我要写书评

暂无评论

Property-driven benchmark generation

Property-driven benchmark generation

引用

20th International Symposium on Model Checking Software, SPIN 2013

作者： Steffen, Bernhard Isberner, Malte Naujokat, Stefan Margaria, Tiziana Geske, Maren Department of Programming Systems Dortmund University of Technology Dortmund D-44227 Germany Carnegie Mellon University Moffett Field CA United States Department of Service and Software Engineering Universität Potsdam Potsdam D-14482 Germany

ISBN: (纸本)9783642391750

We present a systematic approach to the automatic generation of platform-independent benchmarks of tailored complexity for evaluating verification tools for reactive systems. Key to this approach is a tool chain that essentially transforms a set of automatically generated LTL properties into source code for various formats, platforms, and competition scenarios via a sequence of property-preserving steps. These steps go through dedicated representations in terms of Büchi Automata, Mealy machines, Decision Diagram Models, Code Models, and finally the source code of the chosen scenario. The required transformations comprise LTL synthesis, model checking, property-oriented expansion, path condition extraction, theorem proving, SAT solving, and code motion. This combination allows us to address different communities via a growing set of programming languages, tailored sets of programming constructs, different notions of observation, and the full variety of LTL properties-ranging from mere reachability over general safety properties to arbitrary liveness properties. The paper illustrates the whole tool chain along accompanying examples, emphasizes the current state of development, and sketches the envisioned potential and impact of our approach. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A Distributed Polling with Probabilistic Privacy

A Distributed Polling with Probabilistic Privacy

引用

Reliable Distributed systems

作者： Yahya Benkaouz Rachid Guerraoui Mohammed Erradi Florian Huc Networking and Distributed Systems Research Group Mohammed V-Souissi University Rabat Morocco Distributed Programming Laboratory EPFL Lausanne Switzerland

In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptography. PDP is an overlay-based protocol where a subset of participants may use a simple sharing scheme to express their votes. In a system of M participants arranged in groups of size N where at least 2k-1 participants are honest, PDP bounds the probability for a given participant to have its vote recovered with certainty by a coalition of B dishonest participants by π(B/N) (k+1) , where π is the proportion of participants splitting their votes, and k a privacy parameter. PDP bounds the impact of dishonest participants on the global outcome by 2(kα + BN), where represents the number of dishonest nodes using the sharing scheme.

关键词： Protocols Privacy Cryptography Complexity theory Probabilistic logic Reliability Collaboration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：