Jet bundle formulation of infinite-dimensional port-Hamiltonian systems using differential operators

We consider infinite-dimensional port-Hamiltonian systems described on jet bundles. Based on a power balance relation we introduce the port-Hamiltonian system representation using differential operators regarding the structural mapping, the dissipation mapping and the input mapping. In contrast to the well-known representation on the basis of the underlying Stokes–Dirac structure our approach is not necessarily based on using energy-variables which leads to a different port-Hamiltonian representation of the analyzed partial differential equations. The presented constructions will be specialized to mechanical systems to which class also the presented examples belong.     

Interactional Order and Constructed Ways of Seeing with Touchless Imaging Systems in Surgery

While surgical practices are increasingly reliant on a range of digital imaging technologies, the ability for clinicians to interact and manipulate these digital representations in the operating theatre using traditional touch based interaction devices is constrained by the need to maintain sterility. To overcome these concerns with sterility, a number of researchers are have been developing ways of enabling interaction in the operating theatre using touchless interaction techniques such as gesture and voice to allow clinicians control of the systems. While there have been important technical strides in the area, there has been little in the way of understanding the use of these touchless systems in practice. With this in mind we present a touchless system developed for use during vascular surgery. We deployed the system in the endovascular suite of a large hospital for use in the context of real procedures. We present findings from a study of the system in use focusing on how, with touchless interaction, the visual resources were embedded and made meaningful in the collaborative practices of surgery. In particular we discuss the importance of direct and dynamic control of the images by the clinicians in the context of talk and in the context of other artefact use as well as the work performed by members of the clinical team to make themselves sensable by the system. We discuss the broader implications of these findings for how we think about the design, evaluation and use of these systems.     

IISPH‐FLIP for incompressible fluids

We propose to use Implicit Incompressible Smoothed Particle Hydrodynamics (IISPH) for pressure projection and boundary handling in Fluid‐Implicit‐Particle (FLIP) solvers for the simulation of incompressible fluids. This novel combination addresses two issues of existing SPH and FLIP solvers, namely mass preservation in FLIP and efficiency and memory consumption in SPH. First, the SPH component enables the simulation of incompressible fluids with perfect mass preservation. Second, the FLIP component efficiently enriches the SPH component with detail that is comparable to a standard SPH simulation with the same number of particles, while improving the performance by a factor of 7 and significantly reducing the memory consumption. We demonstrate that the proposed IISPH‐FLIP solver can simulate incompressible fluids with a quantifiable, imperceptible density deviation below 0.1%. We show large‐scale scenarios with up to 160 million particles that have been processed on a single desktop PC using only 15GB of memory. One‐ and two‐way coupled solids are illustrated.     

Tailoring of Surfaces with Ultrathin Layers for Controlled Binding of Biopolymers and Adhesion and Guidance of Cells

Various strategies are described for the bio-functionalization of solid substrates by design of interfacial architectures. The first approach is based on the self-assembly process of long-chain thiol molecules from solution to a (noble) metal surface. If some of these building blocks carry a binding site (ligand) for proteins (receptors, antibodies, etc.) the metal surface can be tailored for maximum specific binding while simultaneously minimizing nonspecific adsorption. The second concept is based on polymers that are covalently attached to (oxide) surfaces. The preparation of these (end-) grafted functional polymers involves either the binding of preformed macromolecules to corresponding sites at the surface of the support or the recently introduced “grafting-from” method, by which an initiator molecule is first covalently bound to the surface and then activated — either by heat or light — in the presence of suitable monomer units such that a polymer chain grows from the solid/solution interface. Finally, the functionalization of patterned surfaces by peptide chains that mimic the binding domains of cell adhesion proteins is summarized. It is demonstrated that not only the selective adhesion of neuronal cells can then be controlled, but also their development with the outgrowth of dendrites and axons.     

Toward a secure Kerberos key exchange with smart cards

Public key Kerberos (PKINIT) is a standard authentication and key establishment protocol. Unfortunately, it suffers from a security flaw when combined with smart cards. In particular, temporary access to a user’s card enables an adversary to impersonate that user for an indefinite period of time, even after the adversary’s access to the card is revoked. In this paper, we extend Shoup’s key exchange security model to the smart card setting and examine PKINIT in this model. Using this formalization, we show that PKINIT is indeed flawed, propose a fix, and provide a proof that this fix leads to a secure protocol.     

Stabilised finite element methods for a bending moment formulation of the Reissner-Mindlin plate model

This work presents new stabilised finite element methods for a bending moments formulation of the Reissner-Mindlin plate model. The introduction of the bending moment as an extra unknown leads to a new weak formulation, where the symmetry of this variable is imposed strongly in the space. This weak problem is proved to be well-posed, and stabilised Galerkin schemes for its discretisation are presented and analysed. The finite element methods are such that the bending moment tensor is sought in a finite element space constituted of piecewise linear continuos and symmetric tensors. Optimal error estimates are proved, and these findings are illustrated by representative numerical experiments.     

Giving too much social support: social overload on social networking sites

As the number of messages and social relationships embedded in social networking sites (SNS) increases, the amount of social information demanding a reaction from individuals increases as well. We observe that, as a consequence, SNS users feel they are giving too much social support to other SNS users. Drawing on social support theory (SST), we call this negative association with SNS usage ‘social overload’ and develop a latent variable to measure it. We then identify the theoretical antecedents and consequences of social overload and evaluate the social overload model empirically using interviews with 12 and a survey of 571 Facebook users. The results show that extent of usage, number of friends, subjective social support norms, and type of relationship (online-only vs offline friends) are factors that directly contribute to social overload while age has only an indirect effect. The psychological and behavioral consequences of social overload include feelings of SNS exhaustion by users, low levels of user satisfaction, and a high intention to reduce or even stop using SNS. The resulting theoretical implications for SST and SNS acceptance research are discussed and practical implications for organizations, SNS providers, and SNS users are drawn.     

The complexity of intersecting finite automata having few final states

The problem of determining whether several finite automata accept a word in common is closely related to the well-studied membership problem in transformation monoids. We raise the issue of limiting the number of final states in the automata intersection problem. For automata with two final states, we show the problem to be \({\oplus}\)L-complete or NP-complete according to whether a nontrivial monoid other than a direct product of cyclic groups of order 2 is allowed in the automata. We further consider idempotent commutative automata and (Abelian, mainly) group automata with one, two, or three final states over a singleton or larger alphabet, elucidating (under the usual hypotheses on complexity classes) the complexity of the intersection nonemptiness and related problems in each case.