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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,152 篇 会议
135 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,112 篇 工学
- 1,037 篇 软件工程
- 800 篇 计算机科学与技术...
- 48 篇 控制科学与工程
- 43 篇 电气工程
- 36 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 航空宇航科学与技...
- 5 篇 生物工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 农业工程
141 篇 理学
- 117 篇 数学
- 13 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 生物学
- 5 篇 物理学
- 4 篇 化学
89 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 28 篇 工商管理
15 篇 教育学
- 15 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

180 篇 design
167 篇 languages
103 篇 computer program...
99 篇 performance
59 篇 algorithms
49 篇 object oriented ...
49 篇 computer program...
45 篇 experimentation
45 篇 java programming...
39 篇 verification
35 篇 reliability
34 篇 java
32 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 software design
21 篇 theory
20 篇 concurrency
19 篇 domain-specific ...
18 篇 type systems

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
12 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 microsoft res re...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
9 篇 microsoft resear...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
7 篇 august david i.
7 篇 bacon david f.
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 rajan hridesh
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,204 篇 英文
82 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM Sigplan 2003 Conference on Programming Language Design and Implementation"

共 1287 条记录，以下是1261-1270 订阅

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

详细简洁

排序：

Domain model translation using graph transformations

Domain model translation using graph transformations

引用

International conference and Workshop on Engineering of Computer-Based Systems

作者： J. Sprinkle A. Agrawal T. Levendovszky Feng Shi G. Karsai Institute for Software-Integrated Systems Vanderbilt University USA

The implementation of computer based systems (CBSs) is commonly guided by constraints imposed by the particular domain of the CBS. Domain-specific programming is a convenient way to provide a domain expert with a language that is customized to the particular constraints and assumptions of the domain.. The careful thought and design that precede the development of any domain-specific visual language restrict the programmer from illegal formalisms, and allow for the rapid determination of the validity of the "program". Usually, the domain-specific visual language is designed and produced using a metamodel of some sort. Occasionally, similar domains can benefit from models created according to the ontology of this original metamodel, but usually some amount of model-transformation is required to give validity of the transformed models. This paper presents a visual language for transforming domain-models that can express the mapping between the meta-models of the "input" (i.e. the "old" domain) and the "output" (i.e. the "new" domain), and uses graph-rewriting techniques to transform the "old" domain-models into the appropriate "new" form.

关键词： Software engineering Metamodeling Production Pattern matching programming profession Ontologies Employment Buildings Investments Tree graphs

来源：评论

学校读者我要写书评

暂无评论

Load-reuse analysis: design and evaluation 99

Load-reuse analysis: design and evaluation

引用

proceedings of the acm sigplan 1999 conference on programming language design and implementation

作者： Rastislav Bodík Rajiv Gupta Mary Lou Soffa Dept. of Computer Science University of Pittsburgh Pittsburgh PA

ISBN: (纸本)9781581130942

Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the results of prior memory accesses. This paper develops a load-reuse analysis and designs a method for evaluating its *** designing the analysis, we aspire for completeness---the goal of exposing all reuse that can be harvested by a subsequent program transformation. For register promotion, a suitable transformation is partial redundancy elimination (PRE). To approach the ideal goal of PRE-completeness, the load-reuse analysis is phrased as a data-flow problem on a program representation that is path-sensitive, as it detects reuse even when it originates in a different instruction along each control flow path. Furthermore, the analysis is comprehensive, as it treats scalar, array and pointer-based loads *** evaluating the analysis, we compare it with an ideal analysis. By observing the run-time stream of memory references, we collect all PRE-exploitable reuse and treat it as the ideal analysis performance. To compare the (static) load-reuse analysis with the (dynamic) ideal reuse, we use an estimator algorithm that computes, given a data-flow solution and a program profile, the dynamic amount of reuse detected by the analysis. We developed a family of estimators that differ in how well they bound the profiling error inherent in the edge profile. By bounding the error, the estimators offer a precise and practical method for determining the run-time optimization *** experiments show that about 55% of loads executed in Spec95 exhibit reuse. Of those, our analysis exposes about 80%.

关键词： register promotion program representations data-flow analysis profile-guided optimizations

来源：评论

学校读者我要写书评

暂无评论

Structured programming: From theory to practice 76

Structured Programming: From theory to practice

引用

proceedings of the 2nd international conference on Software engineering

作者： John C. Carrow

One of the more controversial topics to appear within the field of Computer Science has been the theory of Structured programming and the specific tools and techniques associated with this generic title. With respect to this topic, it is the intent of this paper to provide a documented history of the research, prototyping and deliberate implementation of the Structured programming Technology within the United States Army Computer Systems Command. Structured programming as used within the context of this paper involves the concepts of structured code, top down development, walkthrus, program design language, design and documentation tools, program support library and a programming team. The USACSC experience is viewed as not just another case study but rather an organizational change impacting a large number (500 COBOL programmers) of personnel, standards, and normal operating *** of the more intriguing topics to appear within the field of Computer Science has been the theory of Structured programming and the specific tools and techniques associated with this generic title. After several years of discussion, pilot projects, technical articles and more discussions, the basic questions remain: What does the technology buy you? What does it cost you? How does one implement the technology on a large scale in a software production shop?With respect to these questions, and many others that the Software community shares regarding Structured programming, it is the intent of this paper to provide a documented history of the research, prototyping and deliberate implementation of the Structured programming Technology within the United States Army Computer Systems Command (USACSC).

关键词： Functional decomposition

来源：评论

学校读者我要写书评

暂无评论

Goal-oriented requirements analysis for process control systems design 03

Goal-oriented requirements analysis for process control syst...

引用

acm and IEEE International conference on Formal Methods and Models for Co-design (MEMOCODE)

作者： I. El-Maddah T. Maibaum Department of Computer Science and Information Engineering King''s College London UK

ISBN: (纸本)9780769519234

During the last two decades, a lot of effort has been focused on automating the generation of software applications. The automation process can start early, after some manual stage(s) or following (a) previous automatic stage(s). Such automation tools should have the capability of generating executable programs, specifications, or formal requirements, as appropriate. The requirements gathering and checking is considered as the most important phase to eliminate bugs that appear later and may be removed during the design or implementation phases, but with higher cost and effort. The GOPCSD (goal-oriented process control systems design) tool is designed to gather and structure the requirements for process control systems. The tool achieves separation between the process system engineer's view and the software engineer's. The tool hides the mathematic details of B method from the system engineer; enabling him to focus only on the operation specifications while the software engineer within the B toolkit environment focuses on programming paradigms. Some adaptations have been applied to the method of KAOS in order to yield maximum benefit while minimizing both the required time and the effort to complete the gathering of application requirements for process control systems. After studying different process control case studies, six patterns have been identified: two (alternative and conjunction pattern) of them extending the existing patterns in the KAOS method and four (sequence, disjunction, simultaneous, and inheritance patterns) are new and can be extensively found within the process control systems.

关键词： Control system analysis Process control System analysis and design Application software Automation Systems engineering and theory Software tools Computer bugs Costs Mathematics

来源：评论

学校读者我要写书评

暂无评论

Java-through-C compilation: an enabling technology for Java in embedded systems 04

Java-through-C compilation: an enabling technology for Java ...

引用

design, Automation and Test in Europe conference and Exhibition

作者： A. Varma S.S. Bhattacharyya University of Maryland College Park USA

ISBN: (纸本)9780769520858

The Java programming language is acheiving greater acceptance in high-end embedded systems such as cellphones and PDAs. However, current embedded implementations of Java impose tight constraints on functionality, while requiring significant storage space. In addition, they require that a JVM be ported to each such platform. We demonstrate the first Java-to-C compilation strategy that is suitable for a wide range of embedded systems, thereby enabling broad use of Java on embedded platforms. This strategy removes many of the constraints on functionality and reduces code size without sacrificing performance. The compilation framework described is easily retargetable, and is also applicable to bare-bones embedded systems with no operating system or JVM. On an average, we found the size of the generated executables to be over 25 times smaller than those generated by a cutting-edge Java-to-native-code compiler, while providing performance comparable to the best of various Java implementation strategies.

关键词： Java Embedded system Yarn Libraries Data structures Educational institutions design automation Automatic testing System testing Europe

来源：评论

学校读者我要写书评

暂无评论

A randomized implementation of multiple functional arrays 94

A randomized implementation of multiple functional arrays

引用

proceedings of the 1994 acm conference on LISP and functional programming

作者： Tyng-Ruey Chuang

ISBN: (纸本)9780897916431

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single-threaded accesses to an aggregate, by means of compiler-time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi-threaded ***'s shallow binding scheme can be used to implement multi-threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on-line, simple to implement, and its expected performance comparable to that of the optimal off-line solutions. All this is achieved without using compiler-time analyses, and without restricting the *** expected performance of the randomization scheme is analyzed in details, and some preliminary results are shown. Applications of the randomization technique to other functional aggregates, as well as its implications, are briefly outlined.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An expert tutor in the SLAW programming environment (abstract only) 87

An expert tutor in the SLAW programming environment (abstrac...

引用

proceedings of the 15th annual conference on Computer Science

作者： Michael V. Doran Tulane University Department of Computer Science

ISBN: (纸本)9780897912181

SLAW is a language free programming environment based on structure chart techniques presented in the department's introductory courses [LAW83] [LAW86]. The current implementation, which was developed on the IBM-PC, allows for automatic translation of an algorithm design (structure chart) into PASCAL, FORTRAN and BASIC [DOR86a]. This translation is possible due in part to inclusion of the dictionary of variables into the design [DOR85]. The environment has been tested and used by many students at Tulane and is currently being used in a local high school's advanced computer science course [DOR86b].A structure chart is a tree representation of an algorithm. Procedures and functions are represented as separate charts, themselves forming trees, with all the trees forming a forest of trees. Within this tree representation only certain structured constructs are allowed to be used. These constructs are: sequence, selection, looping and procedure/function call. Under no conditions are unrestricted branches allowed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving design and source code modularity using AspectJ (tutorial session) 00

Improving design and source code modularity using AspectJ (t...

引用

proceedings of the 22nd international conference on Software engineering

作者： Cristina Videira Lopes Gregor Kiczales Computer Science Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Rd. Palo Alto CA Department of Computer Science University of British Columbia 201-2366 Main Mall Vancouver BC V6T 1Z4 Canada

ISBN: (纸本)9781581132069

Using only traditional techniques the implementation of concerns like exception handling, multi-object protocols, synchronization constraints, and security policies tends to be spread out in the code. The lack of modularity for these concerns makes them more difficult to develop and maintain. This tutorial shows how to use Aspect-oriented programming (AOP) [2, 3] to implement concerns like these in a concise modular way. We discuss the effect aspects have on software design and on code modularity. The concrete examples in the tutorial use AspectJ [1], a freely available aspect-oriented extension to the Java™ programming language.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High Performance Computing with the Array Package for Java: A Case Study using Data Mining

High Performance Computing with the Array Package for Java: ...

引用

Supercomputing conference

作者： J. Moreira S. Midkiff M. Gupta R. Lawrence IBM Thomas J. Watson Research Center Yorktown Heights NY USA

This paper discusses several techniques used in developing a parallel, production quality data mining application in Java. We started by developing three sequential versions of a product recommendation data mining application: (i) a Fortran 90 version used as a performance reference, (ii) a plain Java implementation that only uses the primitive array structures from the language, and (iii) a baseline Java implementation that uses our Array package for Java. This Array package provides parallelism at the level of individual Array and BLAS operations. Using this Array package, we also developed two parallel Java versions of the data mining application: one that relies entirely on the implicit parallelism provided by the Array package, and another that is explicitly parallel at the application level. We discuss the design of the Array package, as well as the design of the data mining application. We compare the trade-offs between performance and the abstraction level the different Java versions present to the application programmer. Our studies show that, although a plain Java implementation performs poorly, the Java implementation with the Array package is quite competitive in performance with Fortran. We achieve a single processor performance of 109 Mflops, or 91% of Fortran performance, on a 332 MHz PowerPC 604e processor. Both the implicitly and explicitly parallel forms of our Java implementations also parallelize well. On an SMP with four of those PowerPC processors, the implicitly parallel form achieves 290 Mflops with no effort from the application programmer, while the explicitly parallel form achieves 340 Mflops.

关键词： High performance computing Packaging Java Computer aided software engineering Data mining Production Parallel processing programming profession Image processing Computer crime

来源：评论

学校读者我要写书评

暂无评论

USDP application: cutting out a sustainable process for the public local administration

USDP application: cutting out a sustainable process for the ...

引用

International conference on Information Technology Interfaces

作者： T. Massimo P. Alberto DMI University of Camerino Italy

We present the earliest results of a research work, which has started two years ago with the primary goal to get the best useful implementation of the unified software development process for business applications, taking in our mind the real-world needs of local public administrations in central Italy. In particular, we have focused on requirements capturing and analysis, considered to be responsible for 70% of overall failure of software projects (Standish Group). The iterative and incremental principles of the unified process has been applied, at first, to learn UML and the USDP guidelines, then to define the detailed implementation of the development process itself and, finally, to perform an analysis and an object oriented design, staying close to customers requirements. These conclusions are positive and encouraging. They also highlight a successful application of these processes, in which the mentor plays a key-role, whereas activities and artifacts must be tailored as appropriate to the application size and customer features.

关键词： programming Application software Guidelines Cost function Unified modeling language Delay estimation Failure analysis Project management Resource management Software development management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共129页 << < 120 121 122 123 124 125 126 127 128 129 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：