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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

262 篇 会议
21 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

221 篇 工学
- 185 篇 软件工程
- 177 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 18 篇 电气工程
- 16 篇 信息与通信工程
- 8 篇 机械工程
- 7 篇 安全科学与工程
- 6 篇 生物医学工程（可授...
- 6 篇 生物工程
- 5 篇 电子科学与技术（可...
- 5 篇 交通运输工程
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
- 4 篇 航空宇航科学与技...
- 4 篇 网络空间安全
- 3 篇 仪器科学与技术
- 3 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
48 篇 理学
- 36 篇 数学
- 7 篇 系统科学
- 6 篇 生物学
- 5 篇 物理学
- 5 篇 化学
- 2 篇 统计学（可授理学、...
41 篇 管理学
- 25 篇 管理科学与工程(可...
- 23 篇 图书情报与档案管...
- 9 篇 工商管理
10 篇 教育学
- 10 篇 教育学
- 2 篇 心理学(可授教育学...
1 篇 法学
- 1 篇 社会学
1 篇 农学
1 篇 医学
1 篇 艺术学

主题

23 篇 software enginee...
21 篇 design
19 篇 languages
11 篇 computer program...
11 篇 computer program...
10 篇 object oriented ...
9 篇 algorithms
8 篇 performance
8 篇 programming
8 篇 programming tech...
8 篇 code generation
7 篇 feature-oriented...
7 篇 automatic progra...
7 篇 java
7 篇 optimization
7 篇 generic programm...
7 篇 middleware
6 篇 generative progr...
6 篇 component
6 篇 software archite...

机构

4 篇 texas a&m univ c...
3 篇 univ alberta dep...
3 篇 school of space ...
3 篇 univ magdeburg d...
2 篇 univ lugano luga...
2 篇 college of telec...
2 篇 university of co...
2 篇 orange labs maps...
2 篇 johannes kepler ...
2 篇 institute of sys...
2 篇 univ southampton...
2 篇 shanghai yanding...
2 篇 univ marburg d-3...
2 篇 kansas state uni...
2 篇 department of in...
2 篇 johannes kepler ...
2 篇 ecole polytech f...
2 篇 school of inform...
2 篇 northeastern uni...
2 篇 sixty-third rese...

作者

7 篇 apel sven
6 篇 binder walter
5 篇 ansaloni danilo
5 篇 moret philippe
4 篇 kaestner christi...
4 篇 batory don
4 篇 moessenboeck han...
3 篇 stefani jean-ber...
3 篇 schaeffer j
3 篇 schmitt alan
3 篇 marcus mat
3 篇 smith jacob n.
3 篇 szafron d
3 篇 cassou damien
3 篇 fischer bernd
2 篇 yuehui chen
2 篇 yang yuan
2 篇 javad marzbanrad
2 篇 hatcliff john
2 篇 guddat j

语言

279 篇 英文
13 篇 其他
1 篇 中文

检索条件"任意字段=6th International Conference on Generative Programming and Component Engineering"

共 292 条记录，以下是191-200 订阅

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

详细简洁

排序：

Context-aware scanning for parsing extensible languages 07

Context-aware scanning for parsing extensible languages

引用

GPCE'07 - 6th international conference on generative programming and component engineering

作者： Van Wyk, Eric R. Schwerdfeger, August C. Department of Computer Science and Engineering University of Minnesota Minneapolis MN United States

ISBN: (纸本)9781595938558

this paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. the parser uses a slightly modified LR-style algorithm that passes to the scanner the set of valid symbols that the scanner may return at that point in parsing. this set is those terminals whose entries in the parse table for the current parse state are shift, reduce, or accept, but not error. the scanner then only returns tokens in this set. An analysis is given that can statically verify that the scanner will never return more than one token for a single input. Context-aware scanning is especially useful when parsing and scanning extensible languages in which domain specific languages can be embedded. It has been used in extensible versions of Java 1.4 and ANSI C. We illustrate this approach with a declarative specification of a subset of Java and extensions that embed SQL queries and Boolean expression tables into Java. Copyright © 2007 ACM.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Library composition and adaptation using c++ concepts 07

Library composition and adaptation using c++ concepts

引用

GPCE'07 - 6th international conference on generative programming and component engineering

作者： Järvi, Jaakko Marcus, Matthew A. Smith, Jacob N. Texas A and M University College Station TX United States Adobe Systems Inc. Seattle WA United States

ISBN: (纸本)9781595938558

Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to APIs of another are essential for the success of large software projects. Concepts and concept maps, planned features for the next version of C++, have been designed to support adaptation, promising generic, non-intrusive, efficient, and identity preserving adapters. this paper analyses the use of concept maps for library composition and adaptation, comparing and contrasting concept maps to other common adaptation mechanisms. We report on two cases of data structure adaptation between different libraries, indicating best practices and idioms along the way. First, we adapt GUI controls from several frameworks for use with a generic layout engine, extending the application of concepts to run-time polymorphism. Second, we develop a transparent adaptation layer between an image processing library and a graph algorithm library, enabling the efficient application of graph algorithms to the image processing domain. Copyright © 2007 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Seamless development of software product lines 07

Seamless development of software product lines

引用

GPCE'07 - 6th international conference on generative programming and component engineering

作者： Laguna, Miguel A. González-Baixauli, Bruno Marqués, José M. Department of Computer Science University of Valladolid

ISBN: (纸本)9781595938558

One of the key problems in the development of software product lines is the representation and management of variability and commonality. the customary way to define both aspects is by means of feature models that also allow the configuration of each specific application within the product line to be selected. However the control of traceability between the features and the architectural models (generally based on UML) is not simple. the fundamental reasons are the complexity of the traceability relationships, and the fact that the same modeling mechanisms (e.g., the specialization in a class diagram) serve to express the variation points in the models that represent the product line and in each specific application. the aim of this work is to use the package merge mechanism of the UML 2 infrastructure meta-model as the representation (and support for the configuration) of the variability in the product line while reserving the classical mechanisms (the specialization in the structural models, the > relationship in the use case models, etc.) to express the variants in execution time of each specific application. the structure of the feature models is directly reflected in the relationships between packages in the architectural models, so the traceability of the configuration decisions is straightforward. the direct implementation of the package merge mechanism using the facility of partial classes of languages such as C# is an additional advantage that leads to the ideal of "seamless development". Copyright © 2007 ACM.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Open multi-methods for c++ 07

Open multi-methods for c++

引用

GPCE'07 - 6th international conference on generative programming and component engineering

作者： Pirkelbauer, Peter Solodkyy, Yuriy Stroustrup, Bjarne Texas A and M University College Station TX 77843-3112

ISBN: (纸本)9781595938558

Multiple dispatch - the selection of a function to be invoked based on the dynamic type of two or more arguments - is a solution to several classical problems in object-oriented programming. Open multi-methods generalize multiple dispatch towards open-class extensions, which improve separation of concerns and provisions for retroactive design. We present the rationale, design, implementation, and performance of a language feature, called open multi-methods, for C++. Our open multi-methods support both repeated and virtual inheritance. Our call resolution rules generalize both virtual function dispatch and overload resolution semantics. After using all information from argument types, these rules can resolve further ambiguities by using covariant return types. Great care was taken to integrate open multi-methods with existing C++ language features and rules. We describe a model implementation and compare its performance and space requirements to existing open multi-method extensions and workaround techniques for C++. Compared to these techniques, our approach is simpler to use, catches more user mistakes, and resolves more ambiguities through link-time analysis, runs significantly faster, and requires less memory. In particular, the runtime cost of calling an open multi method is constant and less than the cost of a double dispatch (two virtual function calls). Finally, we provide a sketch of a design for open multi-methods in the presence of dynamic loading and linking of libraries. Copyright © 2007 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Simple and safe SQL queries with c++ templates 07

Simple and safe SQL queries with c++ templates

引用

GPCE'07 - 6th international conference on generative programming and component engineering

作者： Gil, Joseph Lenz, Keren Department of Computer Science Technion-Israel Institute of Technology Technion City Haifa 32000 Israel

ISBN: (纸本)9781595938558

Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with valid SQL statements, which are then sent for execution to the database engine. the fact that these statements are only checked for correctness at runtime is a source for many potential problems such as type and syntax errors and vulnerability to injection attacks. the ARARAT system presented here offers a method for dealing with these predicaments, by coercing the host C++ compiler to do the necessary checks of the generated strings. A library of templates and preprocessor directives effectively extends C++ with a little language representing an augmented relational algebra formalism. Type checking of this language extension, carried out by our template library, assures, at compile-time, the correctness and safety of the generated SQL strings. that is to say that all SQL statements constructed by the system are syntactically correct, legal with respect to the database schema, and immune to injection attacks. Standard techniques (e.g., "expression templates") for compile time representation of symbolic structures, are enhanced in our system to support a type system (featuring structural equivalence) and a symbol table lookup of the symbolic structure. Our work may also open the way for embedding other domain specific languages in C++. the system provides also initial support for the task of defining C++ data structures required for storing the results returned by database queries. An optional pre-processor can be used to define the database scheme to the C++ program. Copyright © 2007 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Can we teach computers to write fast libraries 07

Can we teach computers to write fast libraries

引用

GPCE'07 - 6th international conference on generative programming and component engineering

作者： Püschel, Markus Electrical and Computer Engineering Carnegie Mellon University 5000 Forbes Ave Pittsburgh PA 15232 United States

ISBN: (纸本)9781595938558

As the computing world "goes multicore", high performance library development finally becomes a nightmare. Optimal programs, and their underlying algorithms, have to be adapted to take full advantage of the platform's parallelism, memory hierarchy, and available instruction set. To make things worse, the best implementations are often platform-dependent and platforms are constantly evolving, which quickly renders libraries obsolete. As a consequence, developers are forced to permanently re-implement and re-optimize the same functionality and often even revert to assembly coding just as 50 years ago. A number of research efforts have started to address this problem in a new area called Automatic Performance Tuning with the common goal to rethink the way libraries are created. In this talk we present Spiral (***), a program generation system for linear transforms. Spiral generates highly optimized, platform-tuned implementations of transforms directly from a problem specification. For a user-specified transform, Spiral generates alternative algorithms, optimizes them, compiles them into programs, and "intelligently" searches for the best match to the computing platform. the main idea behind Spiral is a mathematical, declarative framework to represent algorithms and the use of rewriting systems to generate and optimize algorithms at a high level of abstraction. Optimization includes parallelization for vector architectures, shared and distributed memory platforms, GPUs, and even FPGAs. Experimental results show that the code generated by Spiral competes with, and sometimes outperforms, the best available human-written library code. Further, recent research shows that it may be possible to extend Spiral into other domains such as coding or linear algebra. As for the question in the title: Spiral shows that, at least for well-understood problem domains, a positive answer may be in reach.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

A type-level approach to component prototyping

A type-level approach to component prototyping

引用

SYANCO'07: international Workshop on Synthesis and Analysis of component Connectors: 6th ESEC(European Software engineering conference)/FSE(Foundations of Software engineering) Joint Meeting

作者： Barbosa, Luís Cunha, Jácome Visser, Joost DI-CCTC Univ. do Minho Portugal Software Improvement Group Netherlands

Algebraic theories for modeling components and their interactions offer abstraction over the specifics of component states and interfaces. For example, such theories deal with forms of sequential composition of two components in a manner independent of the type of data stored in the states of the components, and independent of the number and types of methods offered by the interfaces of the combinators. General purpose programming languages do not offer this level of abstraction, which implies that a gap must be bridged when turning component models into implementations. In this paper, we present an approach to prototyping of component-based systems that employs so-called type-level programming (or compile-time computation) to bridge the gap between abstract component models and their type-safe implementation in a functional programming language. We demonstrate our approach using Barbosa's model of components as generalized Mealy machines. For this model, we develop a combinator library in Haskell, which uses type-level programming with two effects. Firstly, wiring between components is computed during compilation. Secondly, the well-formedness of the component compositions is guarded by Haskell's strong type system. Copyright 2007 ACM.

关键词： Software prototyping

来源：评论

学校读者我要写书评

暂无评论

Model-driven engineering for development-time QoS validation of component-based software systems

Model-driven engineering for development-time QoS validation...

引用

14th Annual IEEE international conference and Workshop on engineering of Computer-Based Systems (ECBS 2007)

作者： Hill, James H. Tambe, Sumant Gokhale, Aniruddha Vanderbilt Univ 221 Kirkland Hall Nashville TN 37240 USA

ISBN: (纸本)9780769527727

Model-driven engineering (MDE) techniques are increasingly being used to address many of the development and operational lifecycle concerns of large-scale component-based systems. One such concern lacking significant research deals with the validation of quality-of-service (QoS) properties of component-based systems throughout their development lifecycle instead of waiting until system integration time, which is very late and can be detrimental to project schedules and costs. this paper describes our novel MDE-based solution to address this challenge. At the core of our solution approach are (1) a set of domain-specific modeling languages that allow us to mimic component "business logic," and (2) a generative programming framework that synthesizes empirical benchmarking codefor system emulation and continuous QoS evaluation.

关键词： model-driven system engineering continuous QoS validation code generation

来源：评论

学校读者我要写书评

暂无评论

Session details: Session 6 07

Session details: Session 6

引用

Proceedings of the 6th international conference on generative programming and component engineering

作者： Peter Sestoft IT University of Copenhagen

No abstract available.

ISBN: (纸本)9781595938558

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reuse of database access layer components in JEE product lines: Limitations and a possible solution (Case Study)

Reuse of database access layer components in JEE product lin...

引用

19th international conference on Software engineering and Knowledge engineering, SEKE 2007

作者： Peng, Ding Jarzabek, Stan Rajapakse, Damith C. Zhang, Hongyu Department of Computer Science School of Computing National University of Singapore Singapore Singapore Tsinghua University China

ISBN: (纸本)9781627486613

We set up an experiment to evaluate JEE as a platform for product line development. While JEE provides many useful mechanisms for reuse of common services/components, still we found that systematic across-the-board reuse in application domain-specific areas was hard. the main difficulty was the lack of a mechanism to represent groups of similar components in a generic, adaptable form. Such similar components arise as the number of variant features of a product line grows, and we need to accommodate legal combinations of variant features in components of a product line architecture. Such uncontrolled growth of similar component versions hinders productivity of reuse-based development and raises maintenance costs. In the paper, we study the manifestation of this problem in the JEE™ database access layer. Interactive Development Environments such as NetBeans or JBuilder speed up the development process, but they do not address the source of the problem, which is the lack of mechanisms to design generic components capable of accommodating variant features in various combinations. We filled this gap with a "mixed strategy" solution based on generative programming technique of XVCL applied on top of JEE. In the paper, we highlight the nature of the problems we encountered and our solution. Copyright © (2007) by Knowledge Systems Institute (KSI).

关键词： Knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：