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

Finding and fixing problems early: A perspective-based approach to requirements and design inspections

CrossTalk 2006年第12期19卷 25-28页

作者： Carver, Jeffrey C. Shull, Forrest Rus, Ioana Mississippi State University Fraunhofer Center for Experimental Software Engineering Department of Computer Science and Engineering 300 Butler Hall Mississippi State University MS 39762 Fraunhofer Center for Experimental Software Engineering Maryland University of Maryland 4321 Hartwick RD STE 500 College Park MD 20742-3290

Viewing security vulnerabilities as a specific type of software defect allows proven software engineering techniques for finding and fixing them to be used early in the development of the product. Finding and fixing these problems early (i.e. at the requirements or design phase) mil reduce the overall risk and cost of tee product. This article describes the application of a previously successful early life cycle software inspection approach (perspective-based reading [PBR]) to the problem of software security. Excerpts from this tailored approach are provided along with guidance on it use.

关键词： Requirements engineering

来源：评论

学校读者我要写书评

暂无评论

Discount Anonymous On Demand Routing for Mobile Ad hoc Networks

Discount Anonymous On Demand Routing for Mobile Ad hoc Netwo...

引用

International Conference on Security and Privacy for Emerging Areas in Communications Networks (SecureComm)

作者： Liu Yang Markus Jakobsson Susanne Wetzel Software Engineering College Sichuan University Chengdu China School of Informatics Indiana University Bloomington Bloomington IN USA Department of Computer Science Stevens Institute of Technology Hoboken NJ USA

Recent years have seen a large number of proposals for anonymity mechanisms operating on the application layer. Given that anonymity is no stronger than its weakest link, such proposals are only meaningful if one can offer anonymity guarantees on the communication layer as well. ANODR - or anonymous on demand routing - is one of the leading proposals to deal with this issue. In this paper, we propose a novel technique to address the same problem, but at a lower cost. Our proposal, which we dub discount-ANODR, is built around the same set of techniques as ANODR is. Our proposal has the benefit of achieving substantially lower computation and communication complexities at the cost of a slight reduction of privacy guarantees. In particular, discount-ANODR achieves source anonymity and routing privacy. A route is "blindly generated" by the intermediaries on the path between an anonymous source and an identified destination. Route requests in discount-ANODR bear strong similarities to route requests in existing source routing protocols, with the limitation that intermediaries only know the destination of the request and the identity of the previous intermediary - but not whether the latter was the originator of the request. The response to a route request protects the compiled route by means of iterated symmetric encryption, drawing on how messages are prepared before being submitted to a typical synchronous mix network (or onion router). The communication of data subsequently uses such "route onions" to channel the packet to the intended destination. We do not use any key exchange, nor do we utilize public key operations at any time; consequently, we do not need to rely on any PKI, CRL or related constructions

关键词： Mobile ad hoc networks Proposals Costs Privacy Mobile communication Complexity theory Routing protocols Protection Cryptography Public key

来源：评论

学校读者我要写书评

暂无评论

Perspective-based reading: A replicated experiment focused on individual reviewer effectiveness

Perspective-based reading: A replicated experiment focused o...

引用

作者： Maldonado, José C. Carver, Jeffrey Shull, Forrest Fabbri, Sandra Dória, Emerson Martimiano, Luciana Mendonça, Manoel Basili, Victor 400-Centro Av. Trabalhador São-Carlense 13560 São Carlos SP Brazil Department of Computer Science and Engineering 300 Butler Hall Mississippi State University Mississippi State MS 39762 United States Fraunhofer Center for Experimental Software Engineering Maryland 4321 Hartwick Road College Park MD 20740 United States Departamento de Computação Universidade Federal de São Carlos Rodovia Washington Luiz km235 Caixa Postal 676 São Carlos SP 13565-905 Brazil Universidade do Oeste Paulista Faculdade de Informática de Presidente Prudente Campus I 700 Bloco H - 1o andar CEP:19050-680 São Carlos SP Brazil 400-Centro Av. Trabalhador São-Carlense 13560 São Carlos SP Brazil Departamento de Ciências Exatas-NUPERC Universidade Salvador Rua Ponciano de Salvador-BA 41950 Oliveira 126 275 Brazil Fraunhofer Center for Experimental Software Engineering Department of Computer Science University of Maryland College Park MD 20742 United States ACM IEEE Computer Society Computer Science and Engineering Department Mississippi State University Department of Computer Science Federal University of São Carlos São Paulo Brazil Faculdade de Informática de Presidente Prudente Universidade do Oeste Paulista Brazilian Computer Society Brazil Department of Computer Science University of Maryland NASA/GSFC

This paper describes a replication conducted to compare the effectiveness of inspectors using Perspective Based Reading (PBR) to the effectiveness of inspectors using a checklist. The goal of this replication was to better understand the complementary aspects of the PBR perspectives. To this end, a brief discussion of the original study is provided as well as a more detailed description of the replication. A detailed statistical analysis is then provided along with analysis of the PBR perspectives. For the individual PBR perspectives, we saw an interesting dichotomy: In the original study there was little overlap among the sets of defects found by each of the three perspectives, while in the replication two of the three perspectives found similar sets of defects on one of the two documents used in the study. Interestingly this document was the only case where the users of PBR were not more effective than the users of a checklist. This result leads to a new hypothesis that the complementary aspect of the PBR perspectives is the characteristic that provides the benefit over other defect detection techniques. © Springer science + Business Media, Inc. 2006.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Approach to dynamic program slicing based on modular monadic semantics

引用

Jisuanji Xuebao/Chinese Journal of computers 2006年第4期29卷 526-534页

作者： Zhang, Ying-Zhou Xu, Bao-Wen Department of Computer Science and Engineering Southeast University Nanjing 210096 China College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

This paper presents a new dynamic slicing method, the modular monadic approach, which is based on modular monadic semantics. With the use of monad transformers, each representing a single notion of computation, the computation of program slicing can be abstracted as an entity that is independent of the language being analyzed, dynamic-slice monad transformer. Its definition and correctness proofs are provided in this paper. This paper also gives and illustrates dynamic slicing algorithm based on modular monadic semantics. The algorithm allows dynamic slices to be computed directly on abstract syntax, without recording an execution history or explicitly constructing intermediate structures, such as dependence graphs, in the corresponding monadic slicers. It is showed to be an appropriate approach to program slicing with excellent flexibility and modularity properties.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Algorithm of data aggregation based on data compression for sensor networks

引用

Ruan Jian Xue Bao/Journal of software 2006年第4期17卷 860-867页

作者： Xie, Zhi-Jun Wang, Lei Lin, Ya-Ping Chen, Hong Liu, Yong-He College of Information Renmin University of China Beijing 100872 China College of Software Hu'nan University Changsha 410082 China Department of Computer Science and Engineering University of Texas at Arlington Arlington United States

Considering the characteristics and location information of nodes in sensor networks, a modified directed transfer model of sensor networks and a new distributed data aggregation model based on area are proposed. On the basis of these new models, a novel mixed entropy data compression algorithm based on interval wavelet transforming is proposed for sensor network, according to the characteristics of data in sensor networks and the good performances of wavelet transforming in compression of the data stream. Theoretical analyses and simulation results show that, the above new methods can compress the data stream and reduce the energy costs of nodes in data transferring efficiently for sensor networks. So, it can prolong the lifetime of the whole networks to a greater degree when the above new methods are deployed with those traditional DC (data centric) routing algorithms such as DD (directed diffusion) protocol for sensor networks.

关键词： Data compression

来源：评论

学校读者我要写书评

暂无评论

Energy efficient and location-independent QoS protocol for wireless sensor networks

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2006年第6期43卷 1019-1026页

作者： Mao, Yingchi Gong, Haigang Liu, Ming Chen, Daoxu Xie, Li State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China Computer and Information Engineering College Hehai University Nanjing 210098 China

Wireless sensor networks often face the critical problem of maintaining the sufficient sensing coverage (QoS) at an application specific level while keeping a small number of nodes active at any time to save energy. To solve this problem, the relationship between the desired QoS requirement and the minimum number of active nodes is analyzed without the knowledge of location or directional information in the randomly deployed sensor networks. Based on the analytical results, an energy efficient and location-independent QoS (ELIQoS) protocol is proposed, which selects the minimum number of active nodes based on the nodes' energy without using any location information. Simulation and analysis study demonstrates that the ELIQoS protocol can not only reduce the network consumption and balance the energy dissipation among nodes, but can provide the desired QoS requirement effectively.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive ant clustering algorithm

引用

Ruan Jian Xue Bao/Journal of software 2006年第9期17卷 1884-1889页

作者： Xu, Xiao-Hua Chen, Ling College of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Department of Computer Science and Engineering Yangzhou University Yangzhou 225009 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

Enlightened by the behaviors of gregarious ant colonies, an artificial ant movement (AM) model and an adaptive ant clustering (AAC) algorithm for this model are presented. In the algorithm, each ant is treated as an agent to represent a data object. In the AM model, each ant has two states: sleeping state and active state. In the algorithm AAC, the ant's state is controlled by both a function of the ant's fitness to the environment it locates and a probability function for the ants becoming active. By moving dynamically, the ants form different subgroups adaptively, and consequently the whole ant group dynamically self-organizes into distinctive and independent subgroups within which highly similar ants are closely connected. The result of data objects clustering is therefore achieved. This paper also present a method to adaptively update the parameters and the ants' local movement strategies which greatly improve the speed and the quality of clustering. Experimental results show that the AAC algorithm on the AM model is much superior to other ant clustering methods such as BM and LF in terms of computational cost, speed and quality. It is adaptive, robust and efficient, and achieves high autonomy, simplicity and efficiency. It is suitable for solving high dimensional and complicated clustering problems.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Petri nets-based modeling for dynamic stock trading systems

引用

Journal of Computational Information Systems 2005年第3期1卷 543-548页

作者： Zheng, Hong Du, Yuyue Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China

Temporal Petri nets can not only enhance the modeling and analyzing power of Petri nets, but compensate the shortcoming that Petri nets do not represent timing constraint. By means of temporal Petri nets, an online dynamic stock trading system based on shared-variable distributed shared memory is adopted, and the requirements specification of the dynamic stock trading system is formally modeled and elegantly described by formulas containing the temporal operators.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Work in progress - Developing the community of software engineering educators

Work in progress - Developing the community of software engi...

引用

Frontiers in Education - 35th Annual Conference 2005, FIE' 05

作者： Hislop, Gregory W. Hilburn, Thomas B. Lutz, Michael J. Sebern, Mark J. College of Information Science and Technology Drexel University Department of Computing Embry-Riddle Aeronautical University Department of Software Engineering Rochester Institute of Technology Department of Electrical Engineering and Computer Science Milwaukee School of Engineering

ISBN: (纸本)0780390776

SWENET, the Network Community for software engineering Education, is an NSF funded project to produce and organize high-quality materials supporting software engineering education. The project supports faculty members delivering software engineering degrees and also individual software engineering courses in other computing degrees. SWENET also seeks to foster the development of the community of software engineering educators. This paper discusses plans to continue this development beyond the period of the initial NSF grant. The paper begins with a summary of the SWENET efforts to create course materials and other SWENET activities. The paper also addresses future directions in developing shared course materials, and creation of permanent resources and mechanisms for interaction among software engineering educators. © 2005 IEEE.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

A comparison of PCA/ICA for data preprocessing in remote sensing imagery classification

A comparison of PCA/ICA for data preprocessing in remote sen...

引用

MIPPR 2005: Image Analysis Techniques

作者： He, Hui Yu, Xianchuan Department of Computer College of Information Science Beijing Normal University Beijing 100875 China Information Technology Software Engineering College Beijing Normal University Zhuhai Zhuhai 519085 China

In this paper a performance comparison of a variety of data preprocessing algorithms in remote sensing image classification is presented. These selected algorithms are principal component analysis (PCA)and three different independent component analyses, ICA(Fast-ICA(Aapo Hyvarinen, 1999), Kernel-ICA(KCCA and KGV(Bach & Jordan, 2002)), EFFICA(Aiyou Chen & Peter Bickel,2003)). These algorithms were applied to a remote sensing imagery (1600×1197), obtained from Shunyi, Beijing. For classification, a MLC method is used for the raw and preprocessed data. The results show that classification with the preprocessed data have more confident results than that with raw data and among the preprocessing algorithms, ICA algorithms improve on PCA and EFFICA performs better than the others. The convergence of these ICA algorithms (for data points more than a million) are also studied, the result shows EFFICA converges much faster than the others. Furthermore, because EFFICA is a one-step maximum likelihood estimate (MLE) which reaches asymptotic Fisher efficiency (EFFICA), it computers quite small so that its demand of memory come down greatly, which settled the "out of memory" problem occurred in the other algorithms. In addition, a technological framework for combining results from different techniques is presented and it shows that further improvement is arrived.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：