Low Temperature Characteristics of the Metal–Superconductor NIS Tunneling Thermometer

We discuss the temperature dependence of a common low temperature local thermometer, a tunnel junction between a superconductor and a normal metal (NIS junction). Towards the lowest temperatures its characteristics tend to saturate, which is usually attributed to selfheating effects. In this technical note, we reanalyze this saturation and show that the temperature independent subgap current of the junction alone explains in some cases the low temperature behavior quantitatively.

     

The time course of plausibility effects on eye movements in reading: Evidence from noun-noun compounds.

Readers' eye movements were monitored as they read sentences containing noun-noun compounds that varied in frequency (e.g., elevator mechanic, mountain lion). The left constituent of the compound was either plausible or implausible as a head noun at the point at which it appeared, whereas the compound as a whole was always plausible. When the head noun analysis of the left constituent was implausible, reading times on this word were inflated, beginning with the first fixation. This finding is consistent with previous demonstrations of very rapid effects of plausibility on eye movements. Compound frequency did not modulate the plausibility effect, and all disruption was resolved by the time readers' eyes moved to the next word. These findings suggest (contra Kennison, 2005) that the parser initially analyzes a singular noun as a head instead of a modifier. In addition, the findings confirm that the very rapid effect of plausibility on eye movements is not due to strategic factors, because in the present experiment, unlike in previous demonstrations, this effect appeared in sentences that were globally plausible. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Efficient prolog programming

This paper presents some basic programming strategies for Prolog programmers. The strategies are based on knowledge about the operational behaviour of the Warren Abstract Machine (WAM). The aim is to provide simple principles for making programs both faster and less space-consuming. The programming hints given are mostly local, i.e. only a single clause or procedure need be considered at a time.     

Enhanced user performance in an image gallery application with a mobile autostereoscopic touch display

In this study, we explored how stereoscopic depth affects performance and user experience in a mobile device with an autostereoscopic touch display. Participants conducted a visual search task with an image gallery application on three layouts with different depth ranges. The task completion times were recorded, and the participants were asked to rate their experiences. The results revealed that the image search times were facilitated by a mild depth effect and that too great a depth slowed search times and decreased user-experience ratings.     

Distributed information service architecture for overlapping multiaccess networks

Multimedia delivery in mobile multiaccess network environments has emerged as a key area within the future Internet research domain. When network heterogeneity is coupled with the proliferation of multiaccess capabilities in mobile handheld devices, one can expect many new avenues for developing novel services and applications. New mechanisms for audio/video delivery over multiaccess networks will define the next generation of major distribution technologies, but will require significantly more information to operate according to their best potential. In this paper we present and evaluate a distributed information service, which can enhance media delivery over such multiaccess networks. We describe the proposed information service, which is built upon the new distributed control and management framework (DCMF) and the mobility management triggering functionality (TRG). We use a testbed which includes 3G/HSPA, WLAN and WiMAX network accesses to evaluate our proposed architecture and present results that demonstrate its value in enhancing video delivery and minimizing service disruption in an involved scenario.     

Bayesian Clustering of Fuzzy Feature Vectors Using a Quasi-Likelihood Approach

Bayesian model-based classifiers, both unsupervised and supervised, have been studied extensively and their value and versatility have been demonstrated on a wide spectrum of applications within science and engineering. A majority of the classifiers are built on the assumption of intrinsic discreteness of the considered data features or on the discretization of them prior to the modeling. On the other hand, Gaussian mixture classifiers have also been utilized to a large extent for continuous features in the Bayesian framework. Often the primary reason for discretization in the classification context is the simplification of the analytical and numerical properties of the models. However, the discretization can be problematic due to its textit{ad hoc} nature and the decreased statistical power to detect the correct classes in the resulting procedure. We introduce an unsupervised classification approach for fuzzy feature vectors that utilizes a discrete model structure while preserving the continuous characteristics of data. This is achieved by replacing the ordinary likelihood by a binomial quasi-likelihood to yield an analytical expression for the posterior probability of a given clustering solution. The resulting model can be justified from an information-theoretic perspective. Our method is shown to yield highly accurate clusterings for challenging synthetic and empirical data sets.     

Digital Game Dynamics Preferences and Player Types

In this study, we examine digital game preferences by identifying game dynamics, i.e. player–game interaction modes, of 700 contemporary digital games, and players' (N = 1717) desire to play games with specific types of dynamics. Based on statistical analysis of the data, 5 game dynamics preference categories (“assault,” “manage,” “journey,” “care,” and “coordinate”) and 7 player types were revealed. The results show that identifying player types requires including both preferred and undesired game dynamics categories in the analysis. The findings unveil digital gaming as a more multifaceted phenomenon than common stereotypes suggest. The original game preferences model we present in this study can be conceptualized as a complementary approach for motivations to play and player behavior studies.     

Mobile crowdsensing with mobile agents

We introduce mobile agents for mobile crowdsensing. Crowdsensing campaigns are designed through different roles that are implemented as mobile agents. The role-based tasks of mobile agents include collecting data, analyzing data and sharing data in the campaign. Mobile agents execute and control the campaign autonomously as a multi-agent system and migrate in the opportunistic network of participants’ devices. Mobile agents take into account the available resources in the devices and match participants’ privacy requirements to the campaign requirements. Sharing of task results in real-time facilitates cooperation towards the campaign goal while maintaining a selected global measure, such as energy efficiency. We discuss current challenges in crowdsensing and propose mobile agent based solutions for campaign execution and monitoring, addressing data collection and participant-related issues. We present a software framework for mobile agents-based crowdsensing that is seamlessly integrated into the Web. A set of simulations are conducted to compare mobile agent-based campaigns with existing crowdsensing approaches. We implemented and evaluated a small-scale real-world mobile agent based campaign for pedestrian flock detection. The simulation and evaluation results show that mobile agent based campaigns produce comparable results with less energy consumption when the number of agents is relatively small and enables in-network data processing with sharing of data and task results with insignificant overhead.     

Temporal Kohonen Map and the Recurrent Self-Organizing Map: Analytical and Experimental Comparison

This paper compares two Self-Organizing Map (SOM) based models for temporal sequence processing (TSP) both analytically and experimentally. These models, Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM), incorporate leaky integrator memory to preserve the temporal context of the input signals. The learning and the convergence properties of the TKM and RSOM are studied and we show analytically that the RSOM is a significant improvement over the TKM, because the RSOM allows simple derivation of a consistent learning rule. The results of the analysis are demonstrated with experiments.     

Application of evolutionary optimisers in data-based calibration of Activated Sludge Models

Modelling activated sludge systems has become an accepted practice in Wastewater Treatment Plant (WWTP) design, teaching and research, and Activated Sludge Models (ASM) are by far the most widely used models for activated sludge systems. In most ASM applications, calibration is based on more or less ad-hoc and trial and error approaches. Calibration of the ASMs remains the weakest link in the overall process of modelling biological wastewater treatment. In this paper, a calibration approach is proposed where the need for expert knowledge and modeller effort is significantly reduced. The calibration approach combines identifiability analysis and evolutionary optimisers to automate the ASM calibration. Identifiability analysis is used to deal with poor identifiability of the model structures and evolutionary optimisers are used to identify the model parameters. The applied evolutionary optimisers are Genetic Algorithms and Differential Evolution. Performance of the evolutionary optimisers is compared with a previously proposed calibration approach based on Monte Carlo simulations. All methods were capable of calibrating the model when given enough computation time. However, some of the evolutionary optimisation methods had an advantage in terms of computation time against the Monte Carlo method.