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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

906 篇 会议
450 篇 期刊文献
23 册 图书

馆藏范围

1,379 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

811 篇 工学
- 603 篇 计算机科学与技术...
- 434 篇 软件工程
- 128 篇 控制科学与工程
- 121 篇 信息与通信工程
- 59 篇 电气工程
- 49 篇 电子科学与技术（可...
- 47 篇 机械工程
- 47 篇 安全科学与工程
- 38 篇 生物医学工程（可授...
- 34 篇 建筑学
- 34 篇 土木工程
- 34 篇 生物工程
- 28 篇 仪器科学与技术
- 25 篇 化学工程与技术
- 24 篇 材料科学与工程（可...
- 18 篇 交通运输工程
490 篇 理学
- 335 篇 数学
- 81 篇 统计学（可授理学、...
- 64 篇 物理学
- 64 篇 系统科学
- 45 篇 生物学
- 26 篇 化学
208 篇 管理学
- 148 篇 管理科学与工程(可...
- 87 篇 工商管理
- 61 篇 图书情报与档案管...
42 篇 经济学
- 40 篇 应用经济学
33 篇 医学
- 26 篇 基础医学(可授医学...
- 26 篇 临床医学
27 篇 法学
- 25 篇 社会学
27 篇 教育学
- 22 篇 教育学
15 篇 农学
3 篇 文学
2 篇 哲学
2 篇 军事学
2 篇 艺术学

主题

35 篇 artificial intel...
33 篇 safety
31 篇 computer science
28 篇 computer archite...
27 篇 software
23 篇 monitoring
23 篇 hardware
21 篇 computational mo...
20 篇 application soft...
18 篇 software enginee...
18 篇 semantics
17 篇 data models
16 篇 optimization
15 篇 reliability
14 篇 programming prof...
14 篇 system-on-chip
14 篇 iec standards
13 篇 functional progr...
13 篇 standards
13 篇 training

机构

47 篇 department of ap...
25 篇 department of co...
18 篇 department of ap...
17 篇 department of sy...
17 篇 computer archite...
15 篇 department of co...
15 篇 department of co...
13 篇 department of pr...
13 篇 department of co...
11 篇 department of ap...
10 篇 technical univer...
9 篇 department of co...
9 篇 icas institute f...
9 篇 department of ap...
8 篇 institute for co...
8 篇 department of co...
8 篇 computer techniq...
7 篇 department of ma...
7 篇 department of pr...
7 篇 chair for comput...

作者

43 篇 josef börcsök
34 篇 pal madhumangal
30 篇 ali hayek
22 篇 börcsök josef
20 篇 madhumangal pal
19 篇 gancheva veska
17 篇 veska gancheva
15 篇 börcsök j.
15 篇 boercsoek josef
15 篇 fritzson peter
14 篇 hayek ali
12 篇 mondal shyamal k...
12 篇 maiti manoranjan
12 篇 gurkan tuna
12 篇 mostafa abotaleb
11 篇 mariana arghir
10 篇 tuna gurkan
10 篇 xue jingling
10 篇 roy abi zeid dao...
9 篇 roy sankar kumar

语言

1,336 篇 英文
32 篇 其他
8 篇 中文
1 篇 日文
1 篇 俄文
1 篇 土耳其文

检索条件"机构=Computer Programming"

共 1379 条记录，以下是1041-1050 订阅

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

详细简洁

排序：

Rapidly prototyping implementation infrastructure of Domain Specific Languages: A semantics-based approach

Rapidly prototyping implementation infrastructure of Domain ...

引用

20th Annual ACM Symposium on Applied Computing

作者： Wang, Qian Gupta, Gopal Applied Logic Programming-Languages and System Lab Department of Computer Science University of Texas Dallas

Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. However, designing of a domain specific language is a difficult task. The design of a domain specific language will evolve as it is used more and more and experienced is gained by its designers. Being able to rapidly develop the implementation infrastructure (interpreter, compiler, debugger, profiler, etc.) of a domain specific language is thus of utmost importance so that as the language evolves, the implementation infrastructure can keep pace. In this paper we present a framework for automatically generating interpreters, compilers, debuggers, and profilers from semantic specification of a domain specific language. We illustrate our approach via the SCR language, a language used by the US defense department for developing control systems. Copyright 2005 ACM.

关键词： Software prototyping

来源：评论

学校读者我要写书评

暂无评论

Checking RSC criteria for extended dixon resultant by interpolation method

Checking RSC criteria for extended dixon resultant by interp...

引用

7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2005

作者： Yong, Feng Yaohui, Li Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications Academia Sinica 610041 Chengdu China

ISBN: (纸本)0769524532

Dixon Resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon Resultant vanishes identically yielding no information about solutions for many algebraic and geometry problems. So, Extended Dixon Method (KSY method) was proposed for the case when the Dixon matrix is singular, but satisfies RSC criteria. However, checking RSC criteria and extracting a maximum nonsingular submatrix of Dixon matrix are symbolic methods, which restrict Extended Dixon Method to be applied in more fields. In this paper, based on polynomial interpolation theory, an efficient numerical algorithm is developed to check RSC criteria and to extract a maximum nonsingular submatrix of singular Dixon matrix. Combining with interpolation methods for computing determinant, our method can solve larger scale problems. Furthermore, our method can be carried out parallel. © 2005 IEEE.

关键词： Natural sciences computing

来源：评论

学校读者我要写书评

暂无评论

Model checking

引用

作者： Berg, Therese Raffelt, Harald Computer Science Department Uppsala University Sweden Department of Programming Systems and Compiler Construction University of Dortmund Germany

ISBN: (纸本)3540262784

In this chapter an introduction to model checking and model learning was given. Furthermore, it was shown how to combine both techniques to an approach in which properties of a SUT are verified directly. First of all we have presented Kripke transition systems which build a simple basis for temporal logics used in model checking. The essential difference between linear time logics and branching time logics was made plain on the basis of an example. Subsequently we presented linear time logic (LTL) and computational tree logic (CTL) which are widely used for model checking purposes. Since the combination of model checking and model learning for testing purposes is only meaningful with linear time logics we presented a basic model checking algorithm for linear time logic. In the second part of the chapter we first gave an introduction to the general ideas of model learning algorithms. Continuing in the same subject, we presented a number of learning algorithms;the observation pack algorithm, Angluin's algorithm, the reduced observation table algorithm and, the discrimination tree algorithm. Subsequently we discussed the algorithms' query complexity and presented some domain specific optimizations to reduce the number of queries. We rounded the model learning part off with some experimental results. The final part in this chapter presented the adaptive model checking algorithm, which combines model checking and model learning into one approach. The approach try to make use of information in an existing model of the SUT in order to save effort in the learning procedure. If no model exist or the existing model is irrelevant compared to the current SUT, the approach is still applicable. Although model checking and model learning are both established research areas, a lot of work remains to be done when considering testing. The combination of model checking and testing techniques should be clarified. Models to be used for testing might ask for different characteristics of

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Debugging natural semantics specifications 05

Debugging natural semantics specifications

引用

AADEBUG 2005: 6th International Symposium on Automated and Analysis-Driven Debugging

作者： Pop, Adrian Fritzson, Peter Programming Environments Laboratory Department of Computer and Information Science Linköping University S-58183 Linköping

ISBN: (纸本)1595930507

In this paper we present the design and usage of a debugging framework for the Relational Meta-Language (RML), which is a language for writing executable Natural Semantics specifications. The language is successfully used at our department for writing large specifications for a range of languages like Java, Modelica, Pascal, MiniML etc. The RML system previously had no debugging facilities, which made it hard for programmers to debug their specifications. With this work we address these issues by providing a debugging framework for debugging high level Natural Semantics specifications in RML. Copyright 2005 ACM.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Interprocedural side-effect analysis and optimisation in the presence of dynamic class loading

Interprocedural side-effect analysis and optimisation in the...

引用

28th Australasian computer Science Conference, ACSC 2005

作者： Hua, Phung Xue, Nguyen Jingling Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2032 Australia

ISBN: (纸本)1920682201

We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes can be loaded dynamically, the points-to and modification sets computed statically based on the analysed program, called internal world, may be incomplete. Thus, the modification side effects cannot be determined based on such sets alone. We present a technique, called internal analysis (IA), to classify the references, objects and call sites in the analysed program so that we can determine which points-to and modification sets are deffinitely complete and which may be not. By combining the points-to sets and this classification, we obtain a new IA-based interprocedural side-effect analysis for determining the modification side-effects of any statement on any variable with good accuracy. We have implemented our algorithms in Soot. This paper demonstrates two important applications of this work: partial redundancy elimination (PRE) and copy propagation for field accesses. We report significantly increased opportunities in performing these optimisations over benchmarks when compared with a recently proposed technique in these areas. Our techniques are simple since they are flow-insensitive and achieve these improvements at small analysis costs. Copyright © 2005, Australian computer Society, Inc.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Compiler-directed scratchpad memory management

Compiler-directed scratchpad memory management

引用

ICESS 2005 - 2nd International Conference on Embedded Software and Systems

作者： Jingling, Xue Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2052 Australia

ISBN: (纸本)0769525121

On-chip memory, in the form of (hardware-managed) cache,(software-managed) scratchpad memory (SPM) or some combination of both, is widely used in embedded systems. Most high-end embedded systems have both cache and SPM on-chip since each addresses a different need. Caches allow easy integration and are often effective but are un-predictable. SPMs are more energy-efficient than caches since they do not need complex tag-decoding logic. In addition, SPMs provide absolutely predictable performance but the programmer or compiler must schedule explicit data/instruction transfers between the SPM and off-chip main memory in an embedded system. In today's industry, this task is largely accomplished manually. The programmer often spends a lot of time on partitioning data and/or instructions and inserting explicit data/instruction transfers required between the SPM and main memory. Such a manual approach is time-consuming and error-prone. Obtaining satisfactory solutions for large application programs by hand can be challenging. Furthermore, hand-crafted code is not portable since it is usually customized for one particular architecture. This talk introduces a compiler approach, called memory coloring that we have recently developed to automatically allocating the arrays in a program to an SPM. The arrays are frequently used in embedded applications such as image processing and signal processing. The novelty of this approach lies in partitioning an SPM into a pseudo register file, splitting the live ranges of arrays to create potential data transfer statements between the SPM and of-chip main memory, and finally, adapting an existing graph-colouring algorithm for register allocation to assign the arrays in the program into the register file. This compiler-directed approach is efficient due to the practical efficiency of graph-colouring algorithms. We have implemented this work in the SUIF/mach SUIF compiler framework. Preliminary results over benchmarks show that this compiler

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Completeness analysis for incomplete object-oriented programs

Completeness analysis for incomplete object-oriented program...

引用

14th International Conference on Compiler Construction, CC 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005

作者： Xue, Jingling Nguyen, Phung Hua Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2032 Australia

We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynamic class loading. One distinctive feature of this work is that the access and modification properties of fields are taken into account. By combining with a whole-program points-to analysis, completeness analysis yields not only the required points-to sets but also determines which points-to sets and call sites are complete (when the pointed-to objects and target methods are statically resolvable) or not. Such a compositional approach yields more precise points-to sets than those computed by the points-to analysis alone. In addition, our technique also determines (for the first time) which objects may be incompletely detectable, i.e., may be missing in some statically computed points-to sets. We provide experimental evidence to demonstrate that better analysis precision in benchmarks is obtained when the field access and modification properties are exploited. In particular, we are able to find significantly more complete and mono call sites in an incomplete program, which is useful in devirtualisation and inlining. Our analysis is simple since it is flow- and context-insensitive and achieves these improvements at reasonably small analysis costs. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Strict bidirectional type checking

Strict bidirectional type checking

引用

TLDI'05: 2005 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation

作者： Chlipala, Adam Petersen, Leaf Harper, Robert Computer Science Division University of California Berkeley United States Programming Systems Laboratory Intel Corporation United States Computer Science Department Carnegie Mellon University United States

ISBN: (纸本)1581139993

Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, the completely annotated forms are almost never used in practice, since partially annotated forms can be defined which still allow syntax directed type checking. An additional optimization that is used in some proof and type systems is to take advantage of the context of occurrence of terms to further elide type information using bidirectional type checking rules. While this technique is generally effective, we show that there exist bidirectional terms which exhibit asymptotic increases in the size of their type decorations when sequentialized into a named-form calculus (a common first step in compilation). In this paper, we introduce a refinement of the bidirectional type system based on strict logic which allows additional type decorations to be eliminated, and show that it is well-behaved under sequentialization. Copyright 2005 ACM.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Personalizing and discussing algorithms within CS1 studio experiences: An observational study 05

Personalizing and discussing algorithms within CS1 studio ex...

引用

1st International Computing Education Research Workshop, ICER 2005

作者： Hundhausen, Christopher D. Brown, Jonathan Lee Visualization and End User Programming Lab School of Electrical Engineering and Computer Science Washington State University Pullman WA 99164-2752

ISBN: (纸本)1595930434

Pedagogical algorithm visualization technology aims to assist learners in understanding the dynamic behavior of computer algorithms. A key trend in past experimental studies is that learners benefit most when they are actively engaged with algorithm visualization technology. Inspired by this trend, we are exploring the pedagogical value of a novel active learning activity - the Studio Experience - within the context of an introductory CS1 unit on algorithmic problem-solving. In a Studio Experience, student pairs are given algorithm design problems, e.g., "design two alternative algorithms that reverse the values in a list." They are tasked both with constructing algorithmic solutions and accompanying visualizations, and with presenting their visualizations for feedback and discussion in a session modeled after an architectural "design crit." Through an observational study of studio experience sessions in which students used two alternative forms of visualization technology -art supplies and a computer-based tool - we gained insight into (a) the processes by which students construct visual presentations of algorithms, (b) the characteristics of their visual presentations;(c) the nature of conversations mediated by visual algorithmic solutions;and (d) the kind of visualization technology that best supports these activities. Based on our results, we suggest improvements to the approach, and propose an agenda for future empirical studies. Copyright 2004 ACM.

关键词： computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共138页 << < 101 102 103 104 105 106 107 108 109 110 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：