A system framework for gamified Cost Engineering

This study develops a system framework and an enterprise IT solution for integrating gamification elements to efficiently implement and continuously perform Cost Engineering. Cost Engineering is a systematic approach to manage knowledge and competencies regarding costs reduction measures throughout the life cycle of products and is technology, resource and time intensive. Gamification as a non-monetary multidimensional incentive system holds great potential to implement and establish Cost Engineering in a novel and less resource demanding manner and stipulate knowledge sharing and dissemination. Building on a review of the relevant literature we conducted 20 interviews with experts from eight companies of the German and Austrian high-tech manufacturing industry to examine the system requirements from an organizational perspective. Analyzing the interviews, we found that companies need a flexible platform where the game elements help to align management objectives with concrete tasks, meet legislative regulations and have different evaluation methods. Our proposed system framework combines the organizational and IT requirements with gamification elements to efficiently steer Cost Engineering methods and best manage knowledge and competencies.     

Game-based creativity assessment system: the application of fuzzy theory

“Creative development” and “creativity” have become important topics in the field of education research. The assessment of creativity is a key to understanding how instructional strategies influences the creative process and the output of learners. At present, most methods of assessing creativity are paper-and-pencil tests scored by individuals. Despite the professional training of evaluators, subjectivity in scoring assessments remains inevitable. Therefore, a completely objective tool of measurement is crucial for the progress of education to eliminate the subjectivity in manual grading. This paper presents at first place a review of the literature related to the development of creativity, the assessment of creativity, and further on the means of measuring creativity, particularly in a digital game environment. Our focus is on the application of computing technologies for the assessment of creativity, while exploring the possibility of using computerized systems such as fuzzy logic and hybrid methods to produce objective measurement results. The results of Pearson correlation coefficient between the fuzzy inference scores and the Williams CAP scores is 0.805, which shows the strong construct validity. Additionally, the fuzzy inference system can eliminate subjectivity in scoring and provide analysis results to enhance creativity, unlike paper-and-pencil scores provided without explanations.     

Note: a high transmission Faraday optical isolator in the 9.2 μm range

We have fabricated and characterized an n-doped InSb Faraday isolator in the mid-IR range (9.2 μm). A high isolation ratio (31(2) dB) and low insertion loss (1.9(3) dB) are obtained. Temperature dependance is analyzed. Further possible improvements are discussed, including the realization of a two-stage isolator. A similar design can be used to cover a wide wavelength range (λ ~ 7.5-30 μm).     

A high temperature apparatus for measurement of the Seebeck coefficient

A high temperature Seebeck coefficient measurement apparatus with various features to minimize typical sources of error is designed and built. Common sources of temperature and voltage measurement error are described and principles to overcome these are proposed. With these guiding principles, a high temperature Seebeck measurement apparatus with a uniaxial 4-point contact geometry is designed to operate from room temperature to over 1200 K. This instrument design is simple to operate, and suitable for bulk samples with a broad range of physical types and shapes.     

Supervised collaboration for syntactic annotation of Quranic Arabic

The Quranic Arabic Corpus (http://corpus.quran.com) is a collaboratively constructed linguistic resource initiated at the University of Leeds, with multiple layers of annotation including part-of-speech tagging, morphological segmentation (Dukes and Habash 2010) and syntactic analysis using dependency grammar (Dukes and Buckwalter 2010). The motivation behind this work is to produce a resource that enables further analysis of the Quran, the 1,400 year-old central religious text of Islam. This project contrasts with other Arabic treebanks by providing a deep linguistic model based on the historical traditional grammar known as i′rāb (?????). By adapting this well-known canon of Quranic grammar into a familiar tagset, it is possible to encourage online annotation by Arabic linguists and Quranic experts. This article presents a new approach to linguistic annotation of an Arabic corpus: online supervised collaboration using a multi-stage approach. The different stages include automatic rule-based tagging, initial manual verification, and online supervised collaborative proofreading. A popular website attracting thousands of visitors per day, the Quranic Arabic Corpus has approximately 100 unpaid volunteer annotators each suggesting corrections to existing linguistic tagging. To ensure a high-quality resource, a small number of expert annotators are promoted to a supervisory role, allowing them to review or veto suggestions made by other collaborators. The Quran also benefits from a large body of existing historical grammatical analysis, which may be leveraged during this review. In this paper we evaluate and report on the effectiveness of the chosen annotation methodology. We also discuss the unique challenges of annotating Quranic Arabic online and describe the custom linguistic software used to aid collaborative annotation.     

Wetland change mapping for the U.S. mid-Atlantic region using an outlier detection technique

Although the impacts of wetland loss are often felt at regional scales, effective planning and management require a comparative assessment of local needs, costs, and benefits. Satellite remote sensing can provide spatially explicit, synoptic land cover change information to support such an assessment. However, a common challenge in conventional remote sensing change detection is the difficulty of obtaining phenologically and radiometrically comparable data from the start and end of the time period of interest. An alternative approach is to use a prior land cover classification as a surrogate for historic satellite data and to examine the self-consistency of class spectral reflectances in recent imagery. We produced a 30-meter resolution wetland change probability map for the U.S. mid-Atlantic region by applying an outlier detection technique to a base classification provided by the National Wetlands Inventory (NWI). Outlier-resistant measures – the median and median absolute deviation – were used to represent spectral reflectance characteristics of wetland class populations, and formed the basis for the calculation of a pixel change likelihood index. The individual scene index values were merged into a consistent region-wide map and converted to pixel change probability using a logistic regression calibrated through interpretation of historic and recent aerial photography. The accuracy of a regional change/no-change map produced from the change probabilities was estimated at 89.6%, with a Kappa of 0.779. The change probabilities identify areas for closer inspection of change cause, impact, and mitigation potential. With additional work to resolve confusion resulting from natural spatial heterogeneity and variations in land use, automated updating of NWI maps and estimates of areal rates of wetland change may be possible. We also discuss extensions of the technique to address specific applications such as monitoring marsh degradation due to sea level rise and mapping of invasive species.     

Random Bichromatic Matchings

Given a graph with edges colored Red and Blue, we study the problem of sampling and approximately counting the number of matchings with exactly k Red edges. We solve the problem of estimating the number of perfect matchings with exactly k Red edges for dense graphs. We study a Markov chain on the space of all matchings of a graph that favors matchings with k Red edges. We show that it is rapidly mixing using non-traditional canonical paths that can backtrack. We show that this chain can be used to sample matchings in the 2-dimensional toroidal lattice of any fixed size ℓ with k Red edges, where the horizontal edges are Red and the vertical edges are Blue. An extended abstract appeared in J.R. Correa, A. Hevia and M.A. Kiwi (eds.) Proceedings of the 7th Latin American Theoretical Informatics Symposium, LNCS 3887, pp. 190–201, Springer, 2006. N. Bhatnagar’s and D. Randall’s research was supported in part by NSF grants CCR-0515105 and DMS-0505505. V.V. Vazirani’s research was supported in part by NSF grants 0311541, 0220343 and CCR-0515186. N. Bhatnagar’s and E. Vigoda’s research was supported in part by NSF grant CCR-0455666.     

A review of smart homes- present state and future challenges

In the era of information technology, the elderly and disabled can be monitored with numerous intelligent devices. Sensors can be implanted into their home for continuous mobility assistance and non-obtrusive disease prevention. Modern sensor-embedded houses, or smart houses, cannot only assist people with reduced physical functions but help resolve the social isolation they face. They are capable of providing assistance without limiting or disturbing the resident's daily routine, giving him or her greater comfort, pleasure, and well-being. This article presents an international selection of leading smart home projects, as well as the associated technologies of wearable/implantable monitoring systems and assistive robotics. The latter are often designed as components of the larger smart home environment. The paper will conclude by discussing future challenges of the domain.     

The space complexity of unbounded timestamps

The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.