一种可行的可用性测试过程

文章综述用户模型法、用户调查法、专家评审法和观察法4类可用性测试方法,根据可用性测试的经验,总结出一套合理实用的可用性测试过程,使得可用性测试的效率高、代价低,尽可能发现更多的可用性问题;提出在程序设计类课程的教学中,应适当向学生介绍可用性测试的方法和过程,以培养学生对自己开发的软件系统进行可用性测试的能力。     

基于网络的主题协作学习模式的探索

以微型计算机原理及应用课程网络教学改革为例,详细介绍一种基于网络资源利用的主题协作学习的模式,并提出网络环境下学生学习态度、网络教学环境、教师指导和自我评价表质量等建议。     

工业设计之创新思维方法浅析

工业设计是科学和艺术的综合体,创新思维在工业设计中具有十分重要的作用。它不仅决定了产品的外观,甚至还影响着产品的制造和使用过程。我国著名教育家陶行知先生认为,"处处是创造之地""天天是创造之时""人人是创造之人"。中国是制造大国,却不是设计大国。中国设计的原创性产品很少,中国的创新能力也亟待加强。但是随着科技的进步,中国的设计能力也在突飞猛进地发展。可以相信,未来的中国一定会成为一个设计大国。     

A simple model for laser drilling

A simple mathematical model of laser drilling is proposed. Assuming axi-symmetry of the process around the axis of the laser beam, a one-dimensional formulation is obtained after cross-sectional averaging. The novelty of the approach relies on the fact that even after dimension reduction, the shape of the hole can still be described. The model is derived, implemented and validated for drilling using lasers with intensities in the GW/cm² range and microsecond pulses.     

Further results of recursive evaluation for compound distribution with the severity distribution of mixed type

Yang et al. [J.P. Yang, S.H. Cheng, Q. Wu, Recursive equations for compound distribution with the severity distribution of the mixed type, Science in China Series A 48 (2005) 594-609] investigated a recursive procedure for a kind of compound distributions with the number of claims belonging to (a,b)-family and the severity distribution of the mixed type. In this paper, we extend their results by assuming that the claim number belongs to a larger class. As applications, the excess-of-loss reinsurance treaty is discussed and concrete examples are considered in some detail.     

Usability evaluation methods for the web: A systematic mapping study

Context

In recent years, many usability evaluation methods (UEMs) have been employed to evaluate Web applications. However, many of these applications still do not meet most customers’ usability expectations and many companies have folded as a result of not considering Web usability issues. No studies currently exist with regard to either the use of usability evaluation methods for the Web or the benefits they bring.

Objective

The objective of this paper is to summarize the current knowledge that is available as regards the usability evaluation methods (UEMs) that have been employed to evaluate Web applications over the last 14 years.

Method

A systematic mapping study was performed to assess the UEMs that have been used by researchers to evaluate Web applications and their relation to the Web development process. Systematic mapping studies are useful for categorizing and summarizing the existing information concerning a research question in an unbiased manner.

Results

The results show that around 39% of the papers reviewed reported the use of evaluation methods that had been specifically crafted for the Web. The results also show that the type of method most widely used was that of User Testing. The results identify several research gaps, such as the fact that around 90% of the studies applied evaluations during the implementation phase of the Web application development, which is the most costly phase in which to perform changes. A list of the UEMs that were found is also provided in order to guide novice usability practitioners.

Conclusions

From an initial set of 2703 papers, a total of 206 research papers were selected for the mapping study. The results obtained allowed us to reach conclusions concerning the state-of-the-art of UEMs for evaluating Web applications. This allowed us to identify several research gaps, which subsequently provided us with a framework in which new research activities can be more appropriately positioned, and from which useful information for novice usability practitioners can be extracted.     

Worst-case optimal algorithm for XPath evaluation over XML streams

We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML document D; i.e., determine the set Q(D) of document elements selected by Q. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the streaming version use Ω(dn) space and Ω(dn|D|) time in the worst case; d denotes the depth of D, and n denotes the number of location steps in Q. Their exponential space requirement could well exceed the O(|D|) space used by the in-memory algorithms. We present an efficient algorithm that uses O(d|Q|+nc) space and O((|Q|+dn)|D|) time in the worst case; c denotes the maximum number of elements of D that can be candidates for output, at any one instant. For some worst case Q and D, the memory space used by our algorithm matches our lower bound proved in a different paper; so, our algorithm uses optimal memory space in the worst case.     

Word level bitwidth reduction for unbounded hardware model checking

In this paper we present a word-level model checking method that attempts to speed up safety property checking of industrial netlists. Our aim is to construct an algorithm that allows us to check both bounded and unbounded properties using standard bit-level model checking methods as back-end decision procedures, while incurring minimum runtime penalties for designs that are unsuited to our analysis. We do this by combining modifications of several previously known techniques into a static abstraction algorithm which is guaranteed to produce bit-level netlists that are as small or smaller than the original bitblasted designs. We evaluate our algorithm on several challenging hardware components.     

Image contrast enhancement using fuzzy clustering with adaptive cluster parameter and sub-histogram equalization

Histogram equalization is an effective technique to boost image quality and contrast enhancement. However, in some cases the increase in image contrast by traditional histogram equalization exceeds the desired amount Which damages the image properties and wanes its natural look. Histogram division and performing a separate equalization for each sub-histogram is one of the presented solutions. The dividing method and determining the number of sub-histograms are the main problems directly affecting the output image quality. In this study, a method is introduced for automatic determination of the number of sub-histograms and density based histogram division leading to appropriate output with no need for parameter setting. Each main peak is in a separate section. Image contrast is increased with no loss of image specifications through determining the number of sub-histograms based on the number of main peaks. The introduced histogram equalization approach consists of three stages. The first stage, using histogram analysis, produces an automated estimate of number of clusters for image brightness levels. The second, clusters the image brightness levels, and using the provided transfer function, the final stage includes contrast enhancement for each individual cluster separately. The results of the proposed approach demonstrate not only clearer details along with a boost in contrast, but also noticeably more natural appearance in the images.