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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

91 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

64 篇 工学
- 45 篇 计算机科学与技术...
- 38 篇 软件工程
- 12 篇 信息与通信工程
- 9 篇 电气工程
- 4 篇 控制科学与工程
- 3 篇 生物工程
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
- 1 篇 网络空间安全
12 篇 管理学
- 8 篇 管理科学与工程(可...
- 7 篇 工商管理
- 5 篇 图书情报与档案管...
6 篇 理学
- 4 篇 数学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
4 篇 法学
- 4 篇 社会学
2 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 公共卫生与预防医...
1 篇 教育学
- 1 篇 教育学
1 篇 农学
- 1 篇 作物学

主题

4 篇 design patterns
3 篇 pattern matching
3 篇 design
3 篇 machine learning
3 篇 pattern language
2 篇 tools
2 篇 career
2 篇 educational patt...
2 篇 program synthesi...
2 篇 program repair
2 篇 brain-computer i...
2 篇 electronic mail
2 篇 pattern language...
2 篇 natural language...
2 篇 education
2 篇 binding time
2 篇 pattern recognit...
2 篇 powerpoint
2 篇 cybersecurity
2 篇 pattern selectio...

机构

2 篇 infineon technol...
2 篇 university of co...
2 篇 department of co...
2 篇 brightone munich
2 篇 syracom ag
2 篇 graz university ...
2 篇 univ calif los a...
2 篇 han university o...
2 篇 university duisb...
2 篇 university of ca...
2 篇 cert program sof...
2 篇 technische unive...
1 篇 univ waterloo wa...
1 篇 ist italiano tec...
1 篇 eãtvãs lorãind u...
1 篇 kyushu univ dept...
1 篇 univ wisconsin m...
1 篇 pricewaterhousec...
1 篇 greenhouse techn...
1 篇 university of be...

作者

2 篇 bhatia sahil
2 篇 preschern christ...
2 篇 lu bao-liang
2 篇 kreiner christia...
2 篇 seshia sanjit a.
2 篇 christian kreine...
2 篇 christopher pres...
2 篇 shi li-chen
2 篇 moore andrew p.
2 篇 iba takashi
2 篇 kim miryung
2 篇 cheung alvin
1 篇 azal wasif
1 篇 geman oana
1 篇 khiu eric
1 篇 viciana-abad raq...
1 篇 li shutao
1 篇 steger christian
1 篇 schoppmann phill...
1 篇 holtel stefan

语言

92 篇 英文
1 篇 其他

检索条件"任意字段=Proceedings of the 18th European Conference on Pattern Languages of Program"

共 93 条记录，以下是41-50 订阅

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

详细简洁

排序：

A pattern calculus for rule languages: Expressiveness, compilation, and mechanization 29

A pattern calculus for rule languages: Expressiveness, compi...

引用

29th european conference on Object-Oriented programming, ECOOP 2015

作者： Shinnar, Avraham Siméon, Jérôme Hirzel, Martin IBM Research United States

ISBN: (纸本)9783939897866

this paper introduces a core calculus for pattern-matching in production rule languages: the Calculus for Aggregating Matching patterns (CAMP). CAMP is expressive enough to capture modern rule languages such as JRules, including extensions for aggregation. We show how CAMP can be compiled into a nested-relational algebra (NRA), with only minimal extension. this paves the way for applying relational techniques to running rules over large stores. Furthermore, we show that NRA can also be compiled back to CAMP, using named nested-relational calculus (NNRC) as an intermediate step. We mechanize proofs of correctness, program size preservation, and type preservation of the translations using modern theorem-proving techniques. A corollary of the type preservation is that polymorphic type inference for both CAMP and NRA is NP-complete. CAMP and its correspondence to NRA provide the foundations for efficient implementations of rules languages using databases technologies. © Avraham Shinnar, Jérôme Siméon, and Martin Hirzel;.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

Computer-Assisted Clinical Diagnosis in the Official european Union languages 18

Computer-Assisted Clinical Diagnosis in the Official Europea...

引用

18th IEEE International conference on e-Health Networking, Applications and Services (Healthcom)

作者： Mizera-Pietraszko, Jolanta Opole Univ Inst Math & Comp Sci Opole Poland

ISBN: (纸本)9781509033706

eHealth services integrate Web Information Retrieval and Intelligent Medical Decision Support for health care professionals based on the range of possible symptoms which a patient reports. However, many symptoms like high temperature, fever, or headache, are ambiguous in terms of suggesting wide variety of possible patient's conditions to the GP, while other symptoms are mutually dependant, which again can be misleading to make an accurate diagnosis. On the other hand, doctor's up-to-date knowledge on the medicaments, drugs, active medical substances included, anticipated range of diseases relating to the symptoms reported, and the most reliable pharmaceutical manufacturers, are of the greatest importance to cure the illness successfully. this study proposes an approach to support so called standard medical procedure or clinical guidelines in treatment of each of the diseases by delivering such a knowledge to the physician and by individualizing the selection of drugs in respect to the patient's specific needs in order to avoid a potential drug interaction. We evaluate efficiency of a medical multilingual decision support system Diagnosia on the grounds of accessibility to such a knowledge depending on the EU language and we use Bayesian inference for generating the optimal decision on reaching a particular diagnosis accuracy. Our methodology is examined on the real data taken from the American service Prescriber Checkup and some other knowledge-based medical resources of nationally recognized rank. Our findings indicate that this approach outperforms not only traditional standard procedure of curing some commonly occurring illnesses, but also many commercial computer-assisted medical support diagnostic systems.

关键词： eHealth Medical Informatics Information Retrieval Decision Support Systems pattern Recognition

来源：评论

学校读者我要写书评

暂无评论

WACO: LearningWorkload-Aware Co-optimization of the Format and Schedule of a Sparse Tensor program 2023

WACO: LearningWorkload-Aware Co-optimization of the Format a...

引用

28th ACM International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Won, Jaeyeon Mendis, Charith Emer, Joel S. Amarasinghe, Saman MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA UIUC Urbana IL USA UIUC Champaign IL USA NVIDIA Santa Clara CA USA

ISBN: (纸本)9781450399166

In this paper, we present WACO, a novel method of co-optimizing the format and the schedule of a given sparsity pattern in a sparse tensor program. A core challenge in this paper is the design of a lightweight cost model that accurately predicts the runtime of a sparse tensor program by considering the sparsity pattern, the format, and the schedule. the key idea in addressing this is exploiting a sparse convolutional network to learn meaningful features of the sparsity pattern and embedding a coupled behavior between the format and the schedule using a specially designed schedule template. In addition, within the enormous search space of co-optimization, our novel search strategy, an approximate nearest neighbor search, efficiently and accurately retrieves the best format and schedule for a given sparsity pattern. We evaluated WACO for four different algorithms (SpMV, SpMM, SDDMM, and MTTKRP) on a CPU using 726 different sparsity patterns. Our experimental results showed thatWACO outperformed four state-of-the-art baselines, IntelMKL, BestFormat, TACO with a default schedule, and ASpT. Compared to the best of four baselines, WACO achieved 1.43x, 1.18x, 1.14x, and 1.27x average speedups on SpMV, SpMM, SDDMM, and MTTKRP, respectively.

关键词： Sparse Tensor Auto-Scheduling Tensor Compiler

来源：评论

学校读者我要写书评

暂无评论

Practical Automatic Loop Specialization 13

Practical Automatic Loop Specialization

引用

18th International conference on Architectural Support for programming languages and Operating Systems

作者： Oh, Taewook Kim, Hanjun Johnson, Nick P. Lee, Jae W. August, David I. Princeton Univ Princeton NJ 08544 USA Sungkyunkwan Univ Suwon South Korea

ISBN: (纸本)9781450318709

program specialization optimizes a program with respect to program invariants, including known, fixed inputs. these invariants can be used to enable optimizations that are otherwise unsound. In many applications, a program input induces predictable patterns of values across loop iterations, yet existing specializers cannot fully capitalize on this opportunity. To address this limitation, we present Invariant-induced pattern based Loop Specialization (IPLS), the first fully-automatic specialization technique designed for everyday use on real applications. Using dynamic information-flow tracking, IPLS profiles the values of instructions that depend solely on invariants and recognizes repeating patterns across multiple iterations of hot loops. IPLS then specializes these loops, using those patterns to predict values across a large window of loop iterations. this enables aggressive optimization of the loop;conceptually, this optimization reconstructs recurring patterns induced by the input as concrete loops in the specialized binary. IPLS specializes real-world programs that prior techniques fail to specialize without requiring hints from the user. Experiments demonstrate a geomean speedup of 14.1% with a maximum speedup of 138% over the original codes when evaluated on three script interpreters and eleven scripts each.

关键词： Design languages Performance Loop specialization Partial evaluation Profile based optimization program specialization

来源：评论

学校读者我要写书评

暂无评论

Scalable and Precise Refinement Types for Imperative languages 18th

Scalable and Precise Refinement Types for Imperative Languag...

引用

18th International conference on Integrated Formal Methods (IFM)

作者： Lanzinger, Florian Bachmeier, Joshua Ulbrich, Mattias Dietl, Werner Karlsruhe Inst Technol Karlsruhe Germany FZI Res Ctr Informat Technol Karlsruhe Germany Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9783031477041;9783031477058

In formal verification, there is a dichotomy between tools which are scalable and easy to use but imprecise, like most pluggable type systems, and tools which are expressive and precise but badly scalable and difficult to use, like deductive verification. Our previous research to create a formal link between refinement types and deductive verification allows programmers to use a scalable type system for most of the program, while automatically generating specifications for a deductive verifier for the difficult-to-prove parts. However, this is currently limited to immutable objects. In this work, we thus present an approach which combines uniqueness and refinement type systems in an imperative language. Unlike existing similar approaches, which limit refinements such that they cannot contain any reference-typed program variables, our approach allows more general refinements, because even if a type constraint is not provable in the type system itself, it can be translated and proven by a deductive verifier.

关键词： Pluggable type systems Deductive verification Refinement types Ownership types

来源：评论

学校读者我要写书评

暂无评论

Singularity: pattern Fuzzing for Worst Case Complexity 2018

Singularity: Pattern Fuzzing for Worst Case Complexity

引用

26th ACM Joint Meeting on european Software Engineering conference (ESEC) / Symposium on the Foundations of Software Engineering (FSE)

作者： Wei, Jiayi Chen, Jia Feng, Yu Ferles, Kostas Dillig, Isil Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450355735

We describe a new blackbox complexity testing technique for determining the worst-case asymptotic complexity of a given application. the key idea is to look for an input pattern - rather than a concrete input - that maximizes the asymptotic resource usage of the target program. Because input patterns can be described concisely as programs in a restricted language, our method transforms the complexity testing problem to optimal program synthesis. In particular, we express these input patterns using a new model of computation called Recurrent Computation Graph (RCG) and solve the optimal synthesis problem by developing a genetic programming algorithm that operates on RCGs. We have implemented the proposed ideas in a tool called SINGULARITY and evaluate it on a diverse set of benchmarks. Our evaluation shows that SINGULARITY can effectively discover the worst-case complexity of various algorithms and that it is more scalable compared to existing state-of-the-art techniques. Furthermore, our experiments also corroborate that SINGULARITY can discover previously unknown performance bugs and availability vulnerabilities in real-world applications such as Google Guava and JGraphT.

关键词： Complexity testing optimal program synthesis fuzzing genetic programming performance bug availability vulnerability

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient Bipedal Gait pattern Generation via CoM Acceleration Optimization 18

Energy-efficient Bipedal Gait Pattern Generation via CoM Acc...

引用

18th IEEE-RAS International conference on Humanoid Robots (Humanoids)

作者： Ding, Jiatao Zhou, Chengxu Xiao, Xiaohui Wuhan Univ Sch Power & Mech Engn Wuhan 430072 Hubei Peoples R China Ist Italiano Tecnol Humanoid & Human Centered Mechatron Res Line Via Morego 30 I-16163 Genoa Italy

ISBN: (纸本)9781538672839

Energy consumption for bipedal walking plays a central role for a humanoid robot with limited battery capacity. Studies have revealed that exploiting the allowable Zero Moment Point region (AZR) and Center of Mass (CoM) height variation (CoMHV) are strategies capable of improving energy performance. In general, energetic cost is evaluated by integrating the electric power of multi joints. However, this Joint-Power-based Index requires computing joint torques and velocities in advance, which usually requires time-consuming iterative procedures, especially for multi-joints robots. In this work, we propose a CoM-Acceleration-based Optimal Index (CAOI) to synthesize an energetically efficient CoM trajectory. the proposed method is based on the Linear Inverted Pendulum Model, whose energetic cost can be easily measured by the input energy required for driving the point mass to track a reference trajectory. We characterize the CoM motion for a single walking cycle and define its energetic cost as Unit Energy Consumption. Based on the CAOI, an analytic solution for CoM trajectory generation is provided. Hardware experiments demonstrated the computational efficiency of the proposed approach and the energetic benefits of exploiting AZR and CoMHV strategies.

关键词： Legged locomotion Trajectory Energy consumption Acceleration Humanoid robots Optimization Indexes

来源：评论

学校读者我要写书评

暂无评论

Personal culture patterns a pattern language for living with continuous self-fulfillments 13

Personal culture patterns a pattern language for living with...

引用

proceedings of the 18th european conference on pattern languages of program

作者： Mika Nakada Arisa Kamada Takashi Iba Keio University

ISBN: (纸本)9781450334655

In this paper we present the Personal Culture patterns, a pattern language to support youth in creating a living with continuous self-fulfillments. the Personal Culture patterns consist of 27 patterns describing practical knowledge for effective life design among young people. this paper will go over the following five patterns from the Personal Culture patterns: "I did it!" Search, Dream Tiles, the Power of Words, Fun Along the Way, and Relay for Happiness.

关键词： work-life-balance career culture

来源：评论

学校读者我要写书评

暂无评论

Hardware-Based Runtime Verification with Embedded Tracing Units and Stream Processing 18th

Hardware-Based Runtime Verification with Embedded Tracing Un...

引用

18th International conference on Runtime Verification (RV)

作者： Convent, Lukas Hungerecker, Sebastian Scheffel, Torben Schmitz, Malte thoma, Daniel Weiss, Alexander Univ Lubeck Inst Software Engn & Programming Languages Lubeck Germany Accem Technol GmbH Kiefersfelden Germany

ISBN: (纸本)9783030037697;9783030037680

In this tutorial, we present a comprehensive approach to non-intrusive monitoring of multi-core processors. Modern multi-core processors come with trace-ports that provide a highly compressed trace of the instructions executed by the processor. We describe how these compressed traces can be used to reconstruct the actual control flow trace executed by the program running on the processor and to carry out analyses on the control flow trace in real time using FPGAs. We further give an introduction to the temporal stream-based specification language TeSSLa and show how it can be used to specify typical constraints of a cyber-physical system from the railway domain. Finally, we describe how light-weight, hardware-supported instrumentation can be used to enrich the control-flow trace with data values from the application.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

From Natural Language Requirements to Passive Test Cases using Guarded Assertions 18

From Natural Language Requirements to Passive Test Cases usi...

引用

18th IEEE International conference on Software Quality, Reliability, and Security (QRS)

作者： Flemstrom, Daniel Enoiu, Eduard Azal, Wasif Sundmark, Daniel Gustafsson, thomas Kobetski, Avenir Malardalen Univ Vasteras Sweden Scania CV AB Oskarshamn Sweden RISE SICS AB Kista Sweden

ISBN: (纸本)9781538677575

In large-scale embedded system development, requirements are often expressed in natural language. Translating these requirements to executable test cases, while keeping the test cases and requirements aligned, is a challenging task. While such a transformation typically requires extensive domain knowledge, we show that a systematic process in combination with passive testing would facilitate the translation as well as linking the requirements to tests. Passive testing approaches observe the behavior of the system and test their correctness without interfering with the normal behavior. We use a specific approach to passive testing: guarded assertions (G/A). this paper presents a method for transforming system requirements expressed in natural language into G/As. We further present a proof of concept evaluation, performed at Bombardier Transportation Sweden AB, in which we show how the process would be used, together with practical advice of the reasoning behind the translation steps.

关键词： Testing Natural languages Tools Brakes Electronic mail Systematics Ear"

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：