Man vs machine: examining the three themes of service robotics in tourism and hospitality

Electronic Markets - There is a growing need in the tourism and hospitality literature to harmonise service robots and artificial intelligence’s (AI) meaning and foundations, while also...     

Patientenverfügungen und Advance Care Planning bei Demenz und anderen kognitiven Beeinträchtigungen

Definition of the problem

Advance directives for later states of grave cognitive impairment that are typical for late stages of dementia meet with more far-reaching reservations than advance directives for other states of reduced competence. One of the reasons seems to lie in the ethical and psychological conflicts arising from advance directives demanding nontreatment of additional diseases or the abstention from artificial nutrition in situations in which patients show no signs of suffering from their condition.

Arguments

In this article, it is argued that a “mixed” ethical strategy be used for these cases.

Conclusion

Advance directives in the legally defined sense, especially if drawn up in a process of advance care planning, should be followed in order to avoid that advance directives as an instrument of patient autonomy are rendered futile to a degree incompatible with confidence that wishes for terminating medical treatment will be followed. In contrast, the authority of “care directives” without recognized legal status should be restricted to cases in which there is concordance between the patient’s will as expressed in the directive and the patient’s “natural” will in the relevant situation.

     

Upcycling by grafting onto semi-crystalline polymers using supercritical CO2

The creation of graft copolymers by selectively grafting a second polymer to the amorphous fraction of a semi-crystalline polymer in supercritical CO₂ is demonstrated herein. The graft copolymer is synthesized by free radical polymerization of a vinyl monomer within the semi-crystalline polymer below its melt temperature. Such conditions afford selective grafting on the amorphous regions (block “B”) while leaving the crystalline domains (block “A”) unmodified. Accordingly, unique A-B, A-B-A, A-B-A-B-A, and so forth. block structures are formed. In this work, styrene is polymerized within polyamide 6, polyethylene terephthalate, and isotactic polypropylene. Purification of these material is performed to remove the un-grafted homopolymer, allowing for determination of the graft yield, the portion of polymer which covalently bonds to the semi-crystalline matrix. Grafting yields achieved in polyamide 6, polyethylene terephthalate, and isotactic polypropylene were 98%, 59%, and 15%, respectively. Property enhancements were observed upon further characterization of polystyrene-polyamide 6 copolymers, including high glass transition temperatures, the ability to be remelted, and tunable grafting molecular weight. Additionally, hydrophobicity is controlled by varying polystyrene composition. The remarkable range of accessed properties demonstrates this as a potential route to upcycling plastics.     

Upcycling of polypropylene with various concentrations of peroxydicarbonate and dilauroyl peroxide and two processing steps

The influence of two peroxides (peroxydicarbonate/dilauroyl peroxide) with various concentrations (10–200 mmol/kg PP) and their effective opportunity to introduce long chain branched (LCB) were investigated. The dependence of a single and double extrusion step and the changes of the properties were studied. Experiments were carried out in a single screw extruder at 180°C for the first extrusion step (modification) and at 240°C for the second extrusion step (processing simulation). Melt flow rate and dynamic rheological properties were studied at a measuring temperature of 230°C. For the definitive determination of long chain branched polypropylene (LCB-PP) served the extensional rheology measurements. The mechanical properties were examined via tensile test and impact tensile test. Summarized, LCB (melt strength) could be observed via extensional rheology for all modified specimens and the mechanical properties were maintained or even improved for the modified samples. Particularly, samples containing dilauroyl peroxide display excellent mechanical properties in this study.     

Segmentation of the fascia lata and reproducible quantification of intermuscular adipose tissue (IMAT) of the thigh

Magnetic Resonance Materials in Physics, Biology and Medicine - To develop a precise semi-automated segmentation of the fascia lata (FL) of the thigh to quantify IMAT volume in T1w MR images and...     

An efficient method for solving the Signorini problem in the simulation of free-form surfaces produced by belt grinding

Industrial robots are recently introduced to the belt grinding of free-form surfaces to obtain high productive efficiency and constant surface quality. The simulation of belt grinding process can facilitate planning grinding paths and writing robotic programs before manufacturing. In simulation, it is crucial to get the force distribution in the contact area between the workpiece and the elastic contact wheel because the uneven distributed local forces are the main reason to the unequal local removals on the grated surface. The traditional way is to simplify this contact problem as a Signorini contact problem and use the finite element method (FEM) to calculate the force distribution. However, the FEM model is too computationally expensive to meet the real-time requirement. A new model based on support vector regression (SVR) technique is developed in this paper to calculate the force distribution instead of the FEM model. The new model approximates the FEM model with an error smaller than 5%, but executes much faster (1 s vs 15 min by FEM). With this new model, the real-time simulation and even the on-line robot control of grinding processes can be further conducted.     

Ongoing verification of a multiphysics community code: FLASH

When developing a complex, multi‐authored code, daily testing on multiple platforms and under a variety of conditions is essential. It is therefore necessary to have a regression test suite that is easily administered and configured, as well as a way to easily view and interpret the test suite results. We describe the methodology for verification of FLASH, a highly capable multiphysics scientific application code with a wide user base. The methodology uses a combination of unit and regression tests and an in‐house testing software that is optimized for operation under limited resources. Although our practical implementations do not always comply with theoretical regression‐testing research, our methodology provides a comprehensive verification of a large scientific code under resource constraints.Copyright © 2013 John Wiley & Sons, Ltd.     

Simulating protection rackets: a case study of the Sicilian Mafia

Protection racketeering groups are powerful, deeply entrenched in multiple societies across the globe, and they harm the societies and economies in which they operate in multiple ways. These reasons make their dynamics important to understand and an objective of both scientific and application-oriented interest. Legal and social norm-based approaches arguably play significant roles in influencing protection racket dynamics. We propose an agent-based simulation model, the Palermo Scenario, to enrich our understanding of these influences and to test the effect of different policies on protection racket dynamics. Our model integrates the legal and the social norm-based approaches and uses a complex normative agent architecture that enables the analysis of both agents’ behaviours and mental normative representations driving behaviour. We demonstrate the usefulness of the model and the benefits of using this complex normative architecture through a case study of the Sicilian Mafia.     

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

A set A is computably Lipschitz or cl-reducible, for short, to a set B if A is Turing reducible to B by an oracle Turing machine with use function ? such that ? is bounded by the identity function up to an additive constant, i.e., ?(n)??n+O(1). In this paper we study maximal pairs of computably enumerable (c.e.) cl-degrees or maximal pairs, for short, i.e., pairs of c.e. cl-degrees such that there is no c.e. cl-degree that is above both cl-degrees in this pair. Our main results are as follows. (1) A c.e. Turing degree contains a c.e. cl-degree that is half of a maximal pair if and only if this Turing degree contains a maximal pair if and only if this Turing degree is array noncomputable. (2) The cl-degrees of all weak truth-table complete sets are halves of maximal pairs while there is a Turing complete set A such that the cl-degree of A is not half of any maximal pair. In fact, any high c.e. Turing degree contains a c.e. cl-degree that is not half of a maximal pair. (3) Above any c.e. cl-degree there is a maximal pair. (4) There is a maximal pair which at the same time is a minimal pair. (5) There is a pair of c.e. cl-degrees that is not maximal and does not possess a least upper bound. Moreover, we make some observations on the structure of the c.e. cl-degrees in general. For instance, we give a very simple proof of the fact that there are no maximal c.e. cl-degrees.