Educational affordances of PDAs: A study of a teacher’s exploration of this technology

This paper reports on a case study of a teacher from a technical education institution who explored the educational affordances of PDA technology over a period of six months. Based on this teacher’s perspectives, the study was designed to inform our own understanding of educational affordances of this new and emerging technology. Understanding of educational affordances is important in the context of planning a suitable intervention to support pedagogically effective integration of PDA technology. The study explicated a set of five affordances of PDA technology: as a multimedia-access tool, connectivity tool, capture tool, representational tool and analytical tool. We call on further research to expand this set into a more comprehensive collage of educational affordances of PDA technology.     

Classification of slice-based VBR video traffic and estimation of link loss by exceedance

Classification of a video stream is an essential preliminary step to estimate the bit loss when the video stream is transmitted over a communication network. In this paper, we classify the video frames by the average frame size and estimate the bit loss for each class when the bitrate exceeds the capacity of the bottleneck link. The video stream under study is encoded using the explicit slice-based H.264/AVC encoding scheme. This scheme reduces the burstiness of regular H.264/AVC encoded video by removing the traditional GOP structure. Instead, a repetitive combination of intracoded and predicted slices is employed, thereby introducing a specific dependence structure in the video data. We consider a bufferless model of the communication system and evaluate the channel capacity required to give a maximum allowed loss rate for each class.Due to the high variability, non-stationarity and non-homogeneity of the underlying video data, the obtained classes are checked regarding the dependence and distribution structure of the data. The high quantiles of the losses are estimated for each class.     

Advanced Characterization and Optimization of NiOx:Cu-SAM Hole-Transporting Bi-Layer for 23.4% Efficient Monolithic Cu(In,Ga)Se2-Perovskite Tandem Solar Cells

The performance of five hole-transporting layers (HTLs) is investigated in both single-junction perovskite and Cu(In, Ga)Se₂ (CIGSe)-perovskite tandem solar cells: nickel oxide (NiO_x,), copper-doped nickel oxide (NiO_x:Cu), NiO_x+SAM, NiO_x:Cu+SAM, and SAM, where SAM is the [2-(3,-6Dimethoxy-9H-carbazol-9yl)ethyl]phosphonic acid (MeO-2PACz) self-assembled monolayer. The performance of the devices is correlated to the charge-carrier dynamics at the HTL/perovskite interface and the limiting factors of these HTLs are analyzed by performing time-resolved and absolute photoluminescence ((Tr)PL), transient surface photovoltage (tr-SPV), and X-ray/UV photoemission spectroscopy (XPS/UPS) measurements on indium tin oxide (ITO)/HTL/perovskite and CIGSe/HTL/perovskite stacks. A high quasi-Fermi level splitting to open-circuit (QFLS-V_oc) deficit is detected for the NiO_x-based devices, attributed to electron trapping and poor hole extraction at the NiO_x-perovskite interface and a low carrier effective lifetime in the bulk of the perovskite. Simultaneously, doping the NiO_x with 2% Cu and passivating its surface with MeO-2PACz suppresses the electron trapping, enhances the holes extraction, reduces the non-radiative interfacial recombination, and improves the band alignment. Due to this superior interfacial charge-carrier dynamics, NiO_x:Cu+SAM is found to be the most suitable HTL for the monolithic CIGSe-perovskite tandem devices, enabling a power-conversion efficiency (PCE) of 23.4%, V_oc of 1.72V, and a fill factor (FF) of 71%, while the remaining four HTLs suffer from prominent V_oc and FF losses.     

Reduction of the self-forces in Monte Carlo simulations of semiconductor devices on unstructured meshes

When using an unstructured mesh for device geometry, the ensemble Monte Carlo simulations of semiconductor devices may be affected by unwanted self-forces resulting from the particle-mesh coupling. We report on the progress in minimisation of the self-forces on arbitrary meshes by showing that they can be greatly reduced on a finite element mesh with proper interpolation functions. The developed methodology is included into a self-consistent finite element 3D Monte Carlo device simulator. Minimising of the self-forces using the proper interpolation functions is tested by simulating the electron transport in a 10 nm gate length, 6.1 nm body thick, double gate metal-oxide-semiconductor field-effect transistor (MOSFET). We demonstrate the reduction in the self-force and illustrate the practical distinction by showing I-V characteristics for the device.     

Spatial generalization and aggregation of massive movement data

Movement data (trajectories of moving agents) are hard to visualize: numerous intersections and overlapping between trajectories make the display heavily cluttered and illegible. It is necessary to use appropriate data abstraction methods. We suggest a method for spatial generalization and aggregation of movement data, which transforms trajectories into aggregate flows between areas. It is assumed that no predefined areas are given. We have devised a special method for partitioning the underlying territory into appropriate areas. The method is based on extracting significant points from the trajectories. The resulting abstraction conveys essential characteristics of the movement. The degree of abstraction can be controlled through the parameters of the method. We introduce local and global numeric measures of the quality of the generalization, and suggest an approach to improve the quality in selected parts of the territory where this is deemed necessary. The suggested method can be used in interactive visual exploration of movement data and for creating legible flow maps for presentation purposes.     

The train driver recovery problem—A set partitioning based model and solution method

The need to recover a train driver schedule occurs during major disruptions in the daily railway operations. Based on data from the Danish passenger railway operator DSB S-tog A/S, a solution method to the train driver recovery problem (TDRP) is developed. The TDRP is formulated as a set partitioning problem. We define a disruption neighbourhood by identifying a small set of drivers and train tasks directly affected by the disruption. Based on the disruption neighbourhood, the TDRP model is formed and solved. If the TDRP solution provides a feasible recovery for the drivers within the disruption neighbourhood, we consider that the problem is solved. However, if a feasible solution is not found, the disruption neighbourhood is expanded by adding further drivers or increasing the recovery time period. Fractional solutions to the LP relaxation of the TDRP are resolved with a constraint branching strategy using the depth-first search of the Branch & Bound tree. The LP relaxation of the TDRP possesses strong integer properties. We present test scenarios generated from the historical real-life operations data of DSB S-tog A/S. The numerical results show that all but one tested instances produce integer solutions to the LP relaxation of the TDRP and solutions are found within a few seconds.     

Parallel batch scheduling of equal-length jobs with release and due dates

In this paper we study parallel batch scheduling problems with bounded batch capacity and equal-length jobs in a single and parallel machine environment. It is shown that the feasibility problem 1|p-batch,b<n,r _j ,p _j =p,C _j ≤d _j |− can be solved in O(n ²) time and that the problem of minimizing the maximum lateness can be solved in O(n ²log n) time. For the parallel machine problem P|p-batch,b<n,r _j ,p _j =p,C _j ≤d _j |− an O(n ³log n)-time algorithm is provided, which can also be used to solve the problem of minimizing the maximum lateness in O(n ³log ² n) time.     

Urinary proteomic analysis of chronic allograft nephropathy

The pathogenesis of progressive renal allograft injury, which is termed chronic allograft nephropathy (CAN), remains obscure and is currently defined by histology. Prospective protocol-biopsy trials have demonstrated that clinical and standard laboratory tests are insufficiently sensitive indicators of the development and progression of CAN. The study aim was to determine if CAN could be characterized by urinary proteomic data and identify the proteins associated with disease. The urinary proteome of 75 renal transplant recipients and 20 healthy volunteers was analyzed using surface enhanced laser desorption and ionization MS. Patients could be classified into subgroups with normal histology and Banff CAN grades 2-3 with a sensitivity of 86% and a specificity of 92% by applying the classification algorithm Adaboost to urinary proteomic data. Several urinary proteins associated with advanced CAN were identified including α1-microglobulin, β2-microglobulin, prealbumin, and endorepellin, the antiangiogenic C-terminal fragment of perlecan. Increased urinary endorepellin was confirmed by ELISA and increased tissue expression of the endorepellin/perlecan ratio by immunofluoresence analysis of renal biopsies. In conclusion, analysis of urinary proteomic data has further characterized the more severe CAN grades and identified urinary endorepellin, as a potential biomarker of advanced CAN.     

On techniques for angle compensation in nonideal iris recognition.

The popularity of the iris biometric has grown considerably over the past two to three years. Most research has been focused on the development of new iris processing and recognition algorithms for frontal view iris images. However, a few challenging directions in iris research have been identified, including processing of a nonideal iris and iris at a distance. In this paper, we describe two nonideal iris recognition systems and analyze their performance. The word "nonideal" is used in the sense of compensating for off-angle occluded iris images. The system is designed to process nonideal iris images in two steps: 1) compensation for off-angle gaze direction and 2) processing and encoding of the rotated iris image. Two approaches are presented to account for angular variations in the iris images. In the first approach, we use Daugman's integrodifferential operator as an objective function to estimate the gaze direction. After the angle is estimated, the off-angle iris image undergoes geometric transformations involving the estimated angle and is further processed as if it were a frontal view image. The encoding technique developed for a frontal image is based on the application of the global independent component analysis. The second approach uses an angular deformation calibration model. The angular deformations are modeled, and calibration parameters are calculated. The proposed method consists of a closed-form solution, followed by an iterative optimization procedure. The images are projected on the plane closest to the base calibrated plane. Biorthogonal wavelets are used for encoding to perform iris recognition. We use a special dataset of the off-angle iris images to quantify the performance of the designed systems. A series of receiver operating characteristics demonstrate various effects on the performance of the nonideal-iris-based recognition system.     

Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice

We consider the multiple-depot multiple-vehicle-type scheduling problem (MDVSP) which arises in public transport bus companies and aims to assign buses to cover a given set of timetabled trips with consideration of practical requirements, such as multiple depots and vehicle types as well as depot capacities. An optimal schedule is characterized by minimal fleet size and minimal operational costs including costs for empty movements and waiting time. It is well-known that the MDVSP is NP-hard.Although progress has recently been made in solving large practical MDVSP to optimality with time-space network models, current optimization technology sets limits to the model size that can be solved. In order to approach very large practical instances we propose a two-phase method which produces close to optimal solutions. This modeling approach enables us to solve real-world problem instances with thousands of scheduled trips by direct application of standard optimization software. Furthermore, we introduce the concept of depot groups for the case that a bus may return in the evening into another depot than where it started in the morning.