Information and communication technologies in the life of university freshmen: An analysis of change

The passage from secondary school to university puts students in an environment with different expectations. Not only the expectations towards learning might change, but also towards ICT competences and computer use. The purpose of this article is to find out whether freshmen, after 6 months at the university, changed their self-perception of ICT competences and computer use in comparison with their behaviour at secondary school, and what factors can explain the self-perception of ICT competences and computer use in secondary school, in the university and their possible change. Based on a panel research among 714 freshmen of a large university, this article answers the following questions: (1) What is the self-perception of ICT competences among freshmen and is there a change in this self-perception 6 months after entering the university? (2) How often and for what purpose do freshmen use a computer and is there a change in the frequency of the use of a computer? (3) What factors might influence this attitude, behaviour, and possible change? In function of the basic components of Unified Theory of Acceptance and Use of Technology (Venkatesh, Morris, Davis, & Davis, 2003) hypotheses was developed and tested to answer these questions. Students who consider the computer to be a useful instrument, have control over the computer, possess a certain level of Internet competence, and are at ease with computers are more likely to have the skills needed to maintain a computer, to develop a web site, and to use basic ICT skills. The predictors have little influence on Internet usage. The same predictors contribute modestly to the explanation of the different frequencies of computer use, and a few of the predictors explain parts of change in ICT skills and frequency of computer use.     

Illustrative stream surfaces

Stream surfaces are an intuitive approach to represent 3D vector fields. In many cases, however, they are challenging objects to visualize and to understand, due to a high degree of self-occlusion. Despite the need for adequate rendering methods, little work has been done so far in this important research area. In this paper, we present an illustrative rendering strategy for stream surfaces. In our approach, we apply various rendering techniques, which are inspired by the traditional flow illustrations drawn by Dallmann and Abraham \& Shaw in the early 1980s. Among these techniques are contour lines and halftoning to show the overall surface shape. Flow direction as well as singularities on the stream surface are depicted by illustrative surface streamlines. ;To go beyond reproducing static text book images, we provide several interaction features, such as movable cuts and slabs allowing an interactive exploration of the flow and insights into subjacent structures, e.g., the inner windings of vortex breakdown bubbles. These methods take only the parameterized stream surface as input, require no further preprocessing, and can be freely combined by the user. We explain the design, GPU-implementation, and combination of the different illustrative rendering and interaction methods and demonstrate the potential of our approach by applying it to stream surfaces from various flow simulations. ;     

Automated bidding in computational markets: an application in market-based allocation of computing services

Autonomous agents are widely applied to automate interactions in robotics, e.g. for selling and purchasing goods on eBay, and in financial markets, e.g. in the form of quote machines and algorithmic traders. Current research investigates efficient economic mechanisms that fully automate the provisioning and usage processes of Grid-based services. On the one hand, consumers want to allocate resources on demand for their various applications, e.g. data sharing, stream processing, email, business applications and simulations. On the other hand, providers of Grid services want to govern business policies to meet their utilization and profit goals. The above-mentioned processes are not manually manageable, however, because decisions need to be taken within milliseconds. Therefore, such processes have to be automated to minimize human interactions. Hence, market mechanisms and strategic behavior play important roles when it comes to achieving automated and efficient allocation of Grid services. The paper begins by presenting a framework for automated bidding, providing a methodology for the design and implementation of configurable bidding strategies. Second, it presents a novel bidding strategy based on a reinforcement learning technique. This strategy is designed to automate the bid generation processes of consumers and providers in various market mechanisms. Third, the behavior and convergence of the strategy is evaluated in a centralized Continuous Double Auction and a decentralized on-line machine scheduling mechanism against selected benchmark bidding strategies. Fourth, we define a bidding language for communicating consumer and provider preferences to the market as well as report back the match of the market-based allocation process.     

Miniaturized ceramic differential scanning calorimeter with integrated oven and crucible in LTCC technology

A miniaturized ceramic differential scanning calorimeter (MC-DSC) with integrated oven and crucible is presented. Despite its small size of only 11 mm × 39 mm × 1.5 mm, all functions of a conventional DSC apparatus are integrated in this novel device - including the oven. The MC-DSC is fully manufactured in thick-film and green glass ceramic tape-based low temperature co-fired ceramics (LTCC) technology. Therefore, production costs are considered to be low. Initial results using indium as a sample material show a good dynamic performance of the MC-DSC. Full width at half maximum of the melting peak is 2.4 °C (sample mass approx. 11 mg, heating rate approx. 50 °C/min). Repeatability of the indium melting point is within ±0.02 °C. The melting peak area increases linearly with the sample mass up to at least 26 mg. Simulations of a strongly simplified finite element model of the MC-DSC are in a good agreement with measurement results allowing a model-based prediction of its basic characteristics.     

From embedded sensors to sensorial materials—The road to function scale integration

Ubiquitous computing is about to become part of our everyday lives by integrating hundreds of “invisible” to us computing devices in our environment, so that they can unobtrusively and constantly assist us. This will imply more and smaller “invisible” sensors, homogeneously distributed and at the same time densely packed in host materials, responding to various stimuli and immediately delivering information. In order to reach this aim, the embedded sensors should be integrated within the host material, heading towards sensorial materials. The first step is to omit all parts that are not needed for the sensorial task and to find new solutions for a gentle integration. This is what we call function scale integration. The paper discusses sensor embedding in the human hand as an example of integration in nature, new technological applications and main challenges associated with this approach.     

The impact of parametrization in memetic evolutionary algorithms

Memetic (evolutionary) algorithms integrate local search into the search process of evolutionary algorithms. As computational resources have to be spread adequately among local and evolutionary search, one has to care about when to apply local search and how much computational effort to devote to local search. Often local search is called with a fixed frequency and run for a fixed number of iterations, the local search depth. There is empirical evidence that these parameters have a significant impact on performance, but a theoretical understanding as well as concrete design guidelines are missing.     

An Efficient Newton-Krylov Implementation of the Constrained Runs Scheme for Initializing on a Slow Manifold

The long-term dynamic behavior of many dynamical systems evolves on a low-dimensional, attracting, invariant slow manifold, which can be parameterized by only a few variables (“observables”). The explicit derivation of such a slow manifold (and thus, the reduction of the long-term system dynamics) is often extremely difficult or practically impossible. For this class of problems, the equation-free framework has been developed to enable performing coarse-grained computations, based on short full model simulations. Each full model simulation should be initialized so that the full model state is consistent with the values of the observables and close to the slow manifold. To compute such an initial full model state, a class of constrained runs functional iterations was proposed (Gear and Kevrekidis, J. Sci. Comput. 25(1), 17–28, 2005; Gear et al., SIAM J. Appl. Dyn. Syst. 4(3), 711–732, 2005). The schemes in this class only use the full model simulator and converge, under certain conditions, to an approximation of the desired state on the slow manifold. In this article, we develop an implementation of the constrained runs scheme that is based on a (preconditioned) Newton-Krylov method rather than on a simple functional iteration. The functional iteration and the Newton-Krylov method are compared in detail using a lattice Boltzmann model for one-dimensional reaction-diffusion as the full model simulator. Depending on the parameters of the lattice Boltzmann model, the functional iteration may converge slowly or even diverge. We show that both issues are largely resolved by using the Newton-Krylov method, especially when a coarse grid correction preconditioner is incorporated.     

Scheduling shipments in closed-loop sortation conveyors

At the very core of most automated sorting systems— for example, at airports for baggage handling and in parcel distribution centers for sorting mail—we find closed-loop tilt tray sortation conveyors. In such a system, trays are loaded with cargo as they pass through loading stations, and are later tilted upon reaching the outbound container dedicated to a shipment’s destination. This paper addresses the question of whether the simple decision rules typically applied in the real world when deciding which parcel should be loaded onto what tray are, indeed, a good choice. We formulate a short-term deterministic scheduling problem where a finite set of shipments must be loaded onto trays such that the makespan is minimized. We consider different levels of flexibility in how to arrange shipments on the feeding conveyors, and distinguish between unidirectional and bidirectional systems. In a comprehensive computational study, we compare these sophisticated optimization procedures with widespread rules of thumb, and find that the latter perform surprisingly well. For almost all problem settings, some priority rule can be identified which leads to a low-single-digit optimality gap. In addition, we systematically evaluate the performance gains promised by different sorter layouts.     

Cluster formation in a time-varying multi-agent system

We introduce time-varying parameters in a multi-agent clustering model and we derive necessary and sufficient conditions for the occurrence of clustering behavior with respect to a given cluster structure. For periodically varying parameters the clustering conditions may be formulated in a similar way as for the time-invariant model. The results require the individual weights assigned to the agents to be constant. For time-varying weights we illustrate with an example that the obtained results can no longer be applied.