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

(CSMR) European Conference on software Maintenance and Reengineering

作者： Natalia Negara Nikolaos Tsantalis Eleni Stroulia Department of Computing Science University of Alberta Edmonton Canada Department of Computer Science and Software Engineering Concordia University Montreal QUE Canada

ISBN: (纸本)9781467358330

In this paper we propose a method for reverse engineering the features of Ajax-enabled web applications. The method first collects instances of the DOM trees underlying the application web pages, using a state-of-the-art crawling framework. Then, it clusters these instances into groups, corresponding to distinct features of the application. The contribution of this paper lies in the novel DOM-tree similarity metric of the clustering step, which makes a distinction between simple and composite structural changes. We have evaluated our method on three real web applications. In all three cases, the proposed distance metric leads to a number of clusters that is closer to the actual number of features and classifies web page instances into these feature-specific clusters more accurately than other traditional distance metrics. We therefore conclude that it is a reliable distance metric for reverse engineering the features of Ajax-enabled web applications.

关键词： Clustering algorithms Measurement Web pages Partitioning algorithms HTML Feature extraction Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing design models with composition properties: A software maintenance study 13

Enhancing design models with composition properties: A softw...

引用

12th Annual International Conference on Aspect-Oriented software Development, AOSD 2013

作者： Dantas, Francisco Garcia, Alessandro Whittle, Jon Araújo, João Opus Research Group Informatics Department Software Engineering Lab Brazil Department of Computer Science State University of Rio Grande do Norte Brazil School of Computing and Communications Lancaster University Lancaster United Kingdom CITI/FCT Universidade Nova de Lisboa Portugal

ISBN: (纸本)9781450317665

A considerable part of software design is dedicated for the composition of two or more modules. The implication is that changes made later in the implementation often require some reasoning about module composition properties. However, these properties are often not explicitly specified in design artefacts. Moreover, they cannot be easily inferred from the source code either. As a result, implicit composition properties may represent a major source of software maintenance complexity. This fact is particularly true with the advent of post object-oriented techniques, which are increasingly providing advanced mechanisms to enable flexible module composition. However, there is little empirical knowledge on how design models with explicitly-specified composition properties can improve software maintenance tasks. This paper reports an experiment that analyses the impact of design models enriched with composition properties on system maintenance. Explicit composition modelling was achieved in the experiment through a conservative approach, i.e., a specific set of additional UML stereotypes dedicated to model composition properties. The experiment involved 28 participants, who were asked to realize four maintenance tasks using UML design models with different levels of module composition details. Our findings suggested that explicit composition modelling contributed to better results in the realization of program change tasks, regardless of the developers' expertise. Users of composition-enhanced models consistently yielded better results when compared to users of plain UML models. The use of explicit composition specification also led to an average increase of 44.7% in the quality of changes produced by the participants. Copyright © 2013 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

An Algebraic Approach Towards Data Cleaning

引用

Procedia Computer science 2013年 21卷 50-59页

作者： Ridha Khedri Fei Chiang Khair Eddin Sabri Department of Computing and Software Faculty of Engineering McMaster University Hamilton Ontario Canada Department of Computer Science King Abdullah II School for Information Technology The University of Jordan Jordan

There has been a proliferation in the amount of data being generated and collected in the past several years. One of the leading factors contributing to this increased data scale is cheaper commodity storage, making it easier for organisations to house large data stores containing massive amounts of historical data. To effectively analyse these data sets, a preprocessing step is often required as most real data sets are inherently dirty and inconsistent. Existing data cleaning tools have focused on cleaning the errors at hand. In this paper, we take a more formal approach and propose the use of information algebra as a general theory to describe structured data sets and data cleaning. We formally define the notion of association rule, association function, and we present results relating these concepts. We also propose an algorithm for generating association rules from a given structured data set.

关键词： Dirty data data consistency algebraic approach data cleansing formal methods information algebra

来源：评论

学校读者我要写书评

暂无评论

Can First-year Students Program Yet? A Study Revisited

Can First-year Students Program Yet? A Study Revisited

引用

9th Annual International computing Education Research Conference, ICER 2013

作者： McCartney, Robert Boustedt, Jonas Eckerdal, Anna Sanders, Kate Zander, Carol Department of Computer Science and Engineering University of Connecticut Storrs CT United States Faculty of Engineering and Sustainable Development University of Gávie Gávie Sweden Department of Information Technology Uppsala University Uppsala Sweden Mathematics and Computer Science Rhode Island College Providence Rl United States Computing and Software Systems University of Washington Bothell Bothell WA United States

ISBN: (纸本)9781450322430

The McCracken et al. working group paper is often cited for the proposition that students can't program. In that study, students from four different institutions were each assigned to implement one of three versions of a calculator. More than half of the students failed to produce a program that compiled and executed in the time assigned. Lost in this discussion, however, is the fact that the original paper had the goal of evaluating its instrument, as well as the students. We examine and adjust their instrument, and present the results of the revised study. With a modified instrument, we have obtained significantly improved results. Copyright © 2013 ACM.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Teaching introductory programming to IS students: The impact of teaching approaches on learning performance

引用

Journal of Information Systems Education 2013年第2期24卷 147-155页

作者： Zhang, Xihui Zhang, Chi Stafford, Thomas F. Zhang, Ping Department of Computer Science and Information Systems College of Business University of North Alabama Florence AL 35632 United States Department of Information Technology School of Computing and Software Engineering Southern Polytechnic State University Marietta GA 30060 United States Department of Management Information Systems Fogelman College of Business and Economics University of Memphis Memphis TN 38152 United States Department of Mathematical Sciences College of Basic and Applied Sciences Middle Tennessee State University Murfreesboro TN 37132 United States

Introductory programming courses are typically required for undergraduate students majoring in Information Systems. Instructors use different approaches to teaching this course: some lecturing and assigning programming exercises, others only assigning programming exercises without lectures. This research compares the effects of these two teaching approaches on learning performance by collecting data from two sections of an introductory programming course in an urban public university. One section used lectures and assignments while the other used assignments only. Data analysis included tests within each dataset, tests across the two datasets, and tests of a simple model over the combined dataset. Results indicated that both approaches are effective, but the exercises-only approach is more effective than lectures combined with exercises. Further analysis indicated that students' current programming skills, prior programming experience, and grade expectations are significant antecedents of learning performance in the course. Results support the conclusion suggesting that when teaching introductory programming courses, instructors may want to consider choosing the student-centered active learning over the traditional lecture format in order to improve students' learning performance. This study contributes to the improvement of teaching and learning effectiveness as well as efficiency of introductory programming classes to the benefit of instructors and students, alike.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Electronic Media and Digital Convergence

Electronic Media and Digital Convergence

引用

International Conference on Computer science and Information Technology

作者： O. Al Sheik Salem R.A.Earnshaw Software Engineering Department Applied Science University Jordan Amman Jordan School of Computing Informatics and Media University of Bradford UK Bradford UK

ISBN: (纸本)9781467356107

—The shift of media from traditional forms to new digital ones has raised the possibility of new kinds of media services, including mobile television. In today's communications market, mobile phones are of increasing importance to users and, since mobile devices are connected most of the time, they have a high degree of location independence.

关键词： Mobile Television User-Generated Content HCI Infotainment Human-Mobile Interaction. mobile television computer human interaction data storage media User generated content digital convergence Digital media Mobile phones Mobile devices

来源：评论

学校读者我要写书评

暂无评论

Thesaurus Performance with Information Retrieval: Schema Matching as A Case Study

Thesaurus Performance with Information Retrieval: Schema Mat...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Thabit Sabbah Ali Selamat Faculty of Computing Department of Computer Science Universiti Teknologi Malaysia (UTM) 81310 Skudai Johor Malaysia Faculty of Computing Department of Software Engineering Universiti Teknologi Malaysia (UTM) 81310 Skudai Johor Malaysia

ISBN: (纸本)9781479906505

Thesaurus is used with many Information Retrieval (IR) models such as data integration, data warehousing, semantic query processing and classifiers. Considering the existence of various thesauri for a particular domain of knowledge;output quality of an IR model when using different thesauri in the same domain is not predictable. In this paper, we propose a methodology to study the performance of thesaurus in solving schema matching as a case study of IR models. The paper also presents initial results of experiment conducted using different thesauri. Precision, recall, and F-measure were calculated to show that the quality of matching was changed according to the used thesaurus.

关键词： Schema Matching Thesaurus Information Retrieval Performance thesaurus information retrieval Case studies schema iridium

来源：评论

学校读者我要写书评

暂无评论

eXRUP: A Hybrid software Development Model for Small to Medium Scale Projects

引用

Journal of software engineering and Applications 2013年第9期6卷 446-457页

作者： Ghulam Rasool Shabib Aftab Shafiq Hussain Detlef Streitferdt Department of Computer Science COMSATS Institute of Information Technology Lahore Pakistan Department of Engineering Computing and Technology University of Sunderland Sunderland UK Software Architectures and Product Lines Group The Ilmenau University of Technology Ilmenau Germany

The conventional and agile software development process models are proposed and used nowadays in software industry to meet emergent requirements of the customers. Conventional software development models such as Waterfall, V model and RUP have been predominant in industry until mid 1990s, but these models are mainly focused on extensive planning, heavy documentation and team expertise which suit only to medium and large scale projects. The Rational Unified Process is one of the widely used conventional models. Agile process models got attention of the software industry in last decade due to limitations of conventional models such as slow adaptation to rapidly changing business requirements and they overcome problems of schedule and cost. Extreme Programming is one of the most useful agile methods that provide best engineering practices for a good quality product at small scale. XP follows the iterative and incremental approach, but its key focus is on programming, and reusability becomes arduous. In this paper, we present characteristics, strengths, and weaknesses of RUP and XP process models, and propose a new hybrid software development model eXRUP (eXtreme Programming and Rational Unified Process), which integrates the strengths of RUP and XP while suppressing their weaknesses. The proposed process model is validated through a controlled case study.

关键词： Process Models Agile Modeling eXtreme Programming Rational Unified Process Process Evaluation

来源：评论

学校读者我要写书评

暂无评论

Choice of boundary condition for lattice-Boltzmann simulation of moderate-Reynolds-number flow in complex domains

引用

Physical Review E 2014年第2期89卷 023303-023303页

作者： Rupert W. Nash Hywel B. Carver Miguel O. Bernabeu James Hetherington Derek Groen Timm Krüger Peter V. Coveney Centre for Computational Science Department of Chemistry University College London 20 Gordon Street London WC1H 0AJ United Kingdom CoMPLEX University College London Physics Building Gower Street London WC1E 6BT United Kingdom Research Software Development Team Research Computing and Facilitating Services University College London Podium Building - 1st Floor Gower Street London WC1E 6BT United Kingdom Institute for Materials and Processes School of Engineering University of Edinburgh King's Buildings Mayfield Road Edinburgh EH9 3JL United Kingdom

Modeling blood flow in larger vessels using lattice-Boltzmann methods comes with a challenging set of constraints: a complex geometry with walls and inlets and outlets at arbitrary orientations with respect to the lattice, intermediate Reynolds (Re) number, and unsteady flow. Simple bounce-back is one of the most commonly used, simplest, and most computationally efficient boundary conditions, but many others have been proposed. We implement three other methods applicable to complex geometries [Guo, Zheng, and Shi, Phys. Fluids 14, 2007 (2002); Bouzidi, Firdaouss, and Lallemand, Phys. Fluids 13, 3452 (2001); Junk and Yang, Phys. Rev. E 72, 066701 (2005)] in our open-source application hemelb. We use these to simulate Poiseuille and Womersley flows in a cylindrical pipe with an arbitrary orientation at physiologically relevant Re number (1–300) and Womersley (4–12) numbers and steady flow in a curved pipe at relevant Dean number (100–200) and compare the accuracy to analytical solutions. We find that both the Bouzidi-Firdaouss-Lallemand (BFL) and Guo-Zheng-Shi (GZS) methods give second-order convergence in space while simple bounce-back degrades to first order. The BFL method appears to perform better than GZS in unsteady flows and is significantly less computationally expensive. The Junk-Yang method shows poor stability at larger Re number and so cannot be recommended here. The choice of collision operator (lattice Bhatnagar-Gross-Krook vs multiple relaxation time) and velocity set (D3Q15 vs D3Q19 vs D3Q27) does not significantly affect the accuracy in the problems studied.

关键词： BOUNDARY value problems BOLTZMANN'S equation REYNOLDS number BLOOD flow STOCHASTIC convergence

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for liver surgery planning

A fast algorithm for liver surgery planning

引用

17th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2013

作者： Li, Fajie Fu, Xinbo Klette, Gisela Klette, Reinhard College of Computer Science and Technology Huaqiao University Xiamen Fujian China Xiamen ZhiYe Software Engineering Company Limited Xiamen Fujian China School of Computing and Mathematical Sciences Auckland University of Technology Private Bag 92006 Auckland 1142 New Zealand Computer Science Department University of Auckland Private Bag 92019 Auckland 1142 New Zealand

ISBN: (纸本)9783642370663

Assume that a simplified liver model consists of some vein cells and liver cells. Such a liver model contains two kinds of components, the vein component and the liver components, each of them consists of cells which are 26-connected. The vein component has a tree-shape topology. Suppose that the vein component has already been cut into two parts, and one of them is diseased. Liver surgery planning systems need to design an algorithm to decompose the liver components into two kinds of subsets, one (usually just one component) that has been affected by the diseased vein component while the other one is still healthy. So far, existing algorithms depend heavily on surgeons' personal expertise to detect the diseased liver component which needs to be removed. We propose an efficient algorithm for computing the diseased liver component which is based on the diseased vein component, and not on surgeons' personal manipulations. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Surgery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：