Digital technology becomes more powerful, intelligent, pervasive and ubiquitous. Ethical aspects of this development have not yet drawn the appropriate attention of researchers and engineers. This paper presents an instrument that aims at measuring the individual ethical position with regard to the design and development of computer software. The development of the Epos tool was based on two data collections. The data of the first survey (n1= 147 participants) were used to select items and to determine the factorial structure of the questionnaire. Results show that the Epos instrument reliably assesses peoples’ ethical opinion with respect to five central components: (1) regulation, (2) data privacy, (3) domain specific knowledge, (4) societal responsibility and (5) company responsibility. In the second survey, we determined the stability of the instruments factor structure by assessing a sample of n2?=?196 participants. A confirmatory factor analysis (CFA) supported the initial factor structure. Next steps and further implications are discussed regarding the final version of the questionnaire. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献