Towards a Better Prediction of Cell Settling on Nanostructure Arrays—Simple Means to Complicated Ends

Vertical arrays of nanostructures (NSs) are emerging as promising platforms for probing and manipulating live mammalian cells. The broad range of applications requires different types of interfaces, but cell settling on NS arrays is not yet fully controlled and understood. Cells are both seen to deform completely into NS arrays and to stay suspended like tiny fakirs, which have hitherto been explained with differences in NS spacing or density. Here, a better understanding of this phenomenon is provided by using a model that takes into account the extreme membrane deformation needed for a cell to settle into a NS array. It is shown that, in addition to the NS density, cell settling depends strongly on the dimensions of the single NS, and that the settling can be predicted for a given NS array geometry. The predictive power of the model is confirmed by experiments and good agreement with cases from the literature. Furthermore, the influence of cell‐related parameters is evaluated theoretically and a generic method of tuning cell settling through surface coating is demonstrated experimentally. These findings allow a more rational design of NS arrays for the numerous exciting biological applications where the mode of cell settling is crucial.     

The effect of annealing on the elastoplastic and viscoelastic responses of isotactic polypropylene

Observations are reported on isotactic polypropylene (i) in a series of tensile tests with a constant strain rate on specimens annealed for 24 h at various temperatures in the range from 110 to 150 °C, (ii) in two series of creep tests in the subyield region of deformations on samples not subjected to thermal treatment and on specimens annealed at 140 °C, and (iii) in a series of tensile relaxation tests on non-annealed specimens. Constitutive equations are derived for the elastoplastic and non-linear viscoelastic responses of semicrystalline polymers. A polymer is treated as an equivalent transient network of macro-molecules bridged by junctions (physical cross-links, entanglements and lamellar blocks). The network is assumed to be highly heterogeneous, and it is thought of as an ensemble of meso-regions with different activation energies for separation of strands from temporary nodes. The elastoplastic behavior is modelled as sliding of junctions in meso-domains with respect to their reference positions driven by macro-deformation. The viscoelastic response is attributed to detachment of active strands from temporary junctions and attachment of dangling chains to the network. Constitutive equations for isothermal deformations with small strains are derived by using the laws of thermodynamics. Adjustable parameters in the stress–strain relations are found by fitting the experimental data.     

Enzymatic biodiesel production: Technical and economical considerations

It is well documented in the literature that enzymatic processing of oils and fats for biodiesel is technically feasible. However, with very few exceptions, enzyme technology is not currently used in commercial‐scale biodiesel production. This is mainly due to non‐optimized process design and a lack of available cost‐effective enzymes. The technology to re‐use enzymes has typically proven insufficient for the processes to be competitive. However, literature data documenting the productivity of enzymatic biodiesel together with the development of new immobilization technology indicates that enzyme catalysts can become cost effective compared to chemical processing. This work reviews the enzymatic processing of oils and fats into biodiesel with focus on process design and economy.     

Contrast‐enhanced wide‐angle high‐speed polarization modulator for active‐retarder 3‐D displays

Abstract— A contrast‐enhanced wide‐angle high‐speed polarization modulator for active‐retarder 3‐D displays is proposed. By using a double liquid‐crystal‐cell structure together with a dedicated driving scheme and an external quarter‐wave retarder, a high‐performance modulator can be realized, resulting in minimized brightness loss and low cross‐talk levels in fast‐refresh time‐multiplexed 3‐D displays.     

Inclusion/Exclusion Meets Measure and Conquer

Inclusion/exclusion and measure and conquer are two central techniques from the field of exact exponential-time algorithms that recently received a lot of attention. In this paper, we show that both techniques can be used in a single algorithm. This is done by looking at the principle of inclusion/exclusion as a branching rule. This inclusion/exclusion-based branching rule can be combined in a branch-and-reduce algorithm with traditional branching rules and reduction rules. The resulting algorithms can be analysed using measure and conquer allowing us to obtain good upper bounds on their running times. In this way, we obtain the currently fastest exact exponential-time algorithms for a number of domination problems in graphs. Among these are faster polynomial-space and exponential-space algorithms for #Dominating Set and Minimum Weight Dominating Set (for the case where the set of possible weight sums is polynomially bounded), and a faster polynomial-space algorithm for Domatic Number. This approach is also extended in this paper to the setting where not all requirements in a problem need to be satisfied. This results in faster polynomial-space and exponential-space algorithms for Partial Dominating Set, and faster polynomial-space and exponential-space algorithms for the well-studied parameterised problem k-Set Splitting and its generalisation k-Not-All-Equal Satisfiability.     

Real-Time Global Illumination for VR Applications

Real-time global illumination in VR systems enhances scene realism by incorporating soft shadows, reflections of objects in the scene, and color bleeding. The Virtual Light Field (VLF) method enables real-time global illumination rendering in VR. The VLF has been integrated with the Extreme VR system for real-time GPU-based rendering in a Cave Automatic Virtual Environment.     

Optimization of friction stir welding using space mapping and manifold mapping—an initial study of thermal aspects

The aim of this paper is to optimize a thermal model of a friction stir welding process by finding optimal welding parameters. The optimization is performed using space mapping and manifold mapping techniques in which a coarse model is used along with the fine model to be optimized. Different coarse models are applied and the results and computation time are compared to gradient based optimization using the full model. It is found that the use of space and manifold mapping reduces the computational cost significantly due to the fact that fewer function evaluations and no fine model gradient information is required.     

Disruption management in the airline industry—Concepts,models and methods

This paper provides a thorough review of the current state-of-the-art within airline disruption management of resources, including aircraft, crew, passenger and integrated recovery. An overview of model formulations of the aircraft and crew scheduling problems is presented in order to emphasize similarities between solution approaches applied to the planning and recovery problems. A brief overview of research within schedule robustness in airline scheduling is included in the review, since this proactive measure is a natural complement to disruption management.     

A generalization of Paillier’s public-key system with applications to electronic voting

We propose a generalization of Paillier’s probabilistic public-key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without losing the homomorphic property. We show that the generalization is as secure as Paillier’s original system and propose several ways to optimize implementations of both the generalized and the original scheme. We construct a threshold variant of the generalized scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts. We then show how these building blocks can be used for applying the scheme to efficient electronic voting. This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes. We show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up to t out of L candidates. The same basic building blocks can also be adapted to provide receipt-free elections, under appropriate physical assumptions. The scheme for 1 out of L elections can be optimized such that for a certain range of the other parameter values, the ballot size is logarithmic in L.