24小时热门版块排行榜    

查看: 474  |  回复: 1
【奖励】 本帖被评价1次,作者conanwj增加金币 0.8

[资源] [Free]Software Engineering and Development.Nova.2009

Software Engineering and Development
免责声明
本资源来自于互联网,仅供网络测试之用,请务必在下载后24小时内删除!所有资源不涉及任何商业用途。发帖人不承担由下载使用者引发的一切法律责任及连带责任!
著作权归原作者或出版社所有。未经发贴人许可,严禁任何人以任何形式转贴本文,违者必究!
如果本帖侵犯您的著作权,请与发贴人联系,收到通知后我们将立即删除此帖!

Authors(Editors):
        Enrique A. Belin
Publisher: Nova
Pub Date: 2009
Pages: 247
ISBN: 978-1-61668-289-7

CONTENTS
Preface vii
Expert Commentaries 1
A Succinct Representation of Bit Vectors Supporting Efficient rank
and select Queries
3
Jesper Jansson and Kunihiko Sadakane
B Heterogeneity as a Corner Stone of Software Development in
Robotics
13
Juan-Antonio Fernández-Madrigal, Ana Cruz-Martín,
Cipriano Galindo and Javier González
Short Communications 23
A Embedding Domain-Specific Languages in General-Purpose
Programming Languages
25
Zoltán ádám Mann
B Studying Knowledge Flows in Software Processes 37
Oscar M. Rodríguez-Elias, Aurora Vizcaíno,
Ana I. Martínez-García , Jesús Favela and Mario Piattini
C Software Product Line Engineering:
The Future Research Directions
69
Faheem Ahmed, Luiz Fernando Capretz
and Muhammad Ali Babar
D Software Development for Inverse Determination of Constitutive
Model Parameters
93
A. Andrade-Campos, P. Pilvin, J. Sim?es and F. Teixeira-Dias
E Design of Molecular Visualization Educational Software
for Chemistry Learning
125
L.D. Antonoglou, N.D. Charistos and M.P. Sigalas
vi Contents
F Software Components for Large Scale Super and Grid Computing
Applications
151
Muthu Ramachandran
G Principles and Practical Aspects
of Educational Software Evaluation
175
Quynh Lê and Thao Lê
Research and Review Studies 185
Chapter 1 Testing Event-driven Software – the Next QA Challenge? 187
Atif M. Memon
Chapter 2 Debugging Concurrent Programs Using Metaheuristics 193
Francisco Chicano and Enrique Alba
Index 223

PREFACE
Software engineering is one of the most knowledge intensive jobs. Thus, having a good
knowledge management (KM) strategy in these organizations is very important. This book
examines software processes from a knowledge perspective flow, in order to identify the
particular knowledge needs of such processes to then be in a better position for proposing
systems or strategies to address those needs. Its possible benefits are illustrated through the
results of a study in a software maintenance process within a small software organization.
Furthermore, software product line architecture is regarded as one of the crucial piece of
entity in software product lines. The authors of this book discuss the state of the art of
software product line engineering from the perspectives of business, architecture, process and
organization. In recent years, domain-specific languages have been proposed for modelling
applications on a high level of abstraction. Although the usage of domain-specific languages
offers clear advantages, their design is a highly complex task. This book presents a pragmatic
way for designing and using domain-specific languages. Other chapters in this book examine
the development of numerical methodologies for inverse determination of material
constitutive model parameters, discuss some of the reasons for the irrelevancy of software
engineering to the robotic community, review the evolution of robotic software over time, and
propose the use of Ant Colony Optimization, a kind of metaheuristic algorithm, to find
general property violations in concurrent systems using a explicit state model checker.
In the design of succinct data structures, the main objective is to represent an object
compactly while still allowing a number of fundamental operations to be performed
efficiently. In Expert Commentary A, the authors consider succinct data structures for storing
a bit vector B of length n. More precisely, in this setting, one needs to represent B using n+
o(n) bits so that rank and select queries can be answered in O(1) time, where for any i ∈ {1,
2, . . . , n}, rank0(B, i) is the number of 0s in the first i positions of B, select0(B, i) is the
position in B of the ith 0 (assuming B contains at least i 0s), and rank1(B, i) and select1(B, i) are
defined analogously. These operations are useful because bit vectors supporting rank and
select queries are employed as a building block for many other more complex succinct data
structures. The authors first describe two succinct indexing data structures for supporting rank
and select queries on B in which B is stored explicitly together with some auxiliary
information. The authors then present some matching lower bounds. Finally, the authors
discuss generalizations and related open problems for supporting rank and select queries
efficiently on strings over non-binary alphabets.


本资源链接友情奉送,共4个可选网络硬盘链接,1.69 MB,免积分资源不提供保质
--------------------------------------------------------------------------------------------------------
回复此楼
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
简单回复
sanren2楼
2014-11-27 11:49   回复  
五星好评  顶一下,感谢分享!
相关版块跳转 我要订阅楼主 conanwj 的主题更新
☆ 无星级 ★ 一星级 ★★★ 三星级 ★★★★★ 五星级
普通表情 高级回复 (可上传附件)
信息提示
请填处理意见