@misc{KleinpeterShainyan2019, author = {Kleinpeter, Erich and Shainyan, Bagrat A.}, title = {Very low-temperature dynamic Si-29 NMR study of the conformational equilibrium of (1,1-phenyl-1,1-silacyclohex-1-yl)disiloxane}, series = {Magnetic resonance in chemistry}, volume = {57}, journal = {Magnetic resonance in chemistry}, number = {6}, publisher = {Wiley}, address = {Hoboken}, issn = {0749-1581}, doi = {10.1002/mrc.4870}, pages = {317 -- 319}, year = {2019}, language = {en} } @misc{SianiparWillemsMeinel2019, author = {Sianipar, Johannes Harungguan and Willems, Christian and Meinel, Christoph}, title = {Virtual machine integrity verification in Crowd-Resourcing Virtual Laboratory}, series = {2018 IEEE 11th Conference on Service-Oriented Computing and Applications (SOCA)}, journal = {2018 IEEE 11th Conference on Service-Oriented Computing and Applications (SOCA)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-9133-5}, issn = {2163-2871}, doi = {10.1109/SOCA.2018.00032}, pages = {169 -- 176}, year = {2019}, abstract = {In cloud computing, users are able to use their own operating system (OS) image to run a virtual machine (VM) on a remote host. The virtual machine OS is started by the user using some interfaces provided by a cloud provider in public or private cloud. In peer to peer cloud, the VM is started by the host admin. After the VM is running, the user could get a remote access to the VM to install, configure, and run services. For the security reasons, the user needs to verify the integrity of the running VM, because a malicious host admin could modify the image or even replace the image with a similar image, to be able to get sensitive data from the VM. We propose an approach to verify the integrity of a running VM on a remote host, without using any specific hardware such as Trusted Platform Module (TPM). Our approach is implemented on a Linux platform where the kernel files (vmlinuz and initrd) could be replaced with new files, while the VM is running. kexec is used to reboot the VM with the new kernel files. The new kernel has secret codes that will be used to verify whether the VM was started using the new kernel files. The new kernel is used to further measuring the integrity of the running VM.}, language = {en} } @misc{SalzwedelVoellerReibis2019, author = {Salzwedel, Annett and V{\"o}ller, Heinz and Reibis, Rona Katharina}, title = {Vocational reintegration in coronary heart disease patients - the holistic approach of the WHO biopsychosocial concept}, series = {European journal of preventive cardiology : the official ESC journal for primary \& secondary cardiovascular prevention, rehabilitation and sports cardiology}, volume = {26}, journal = {European journal of preventive cardiology : the official ESC journal for primary \& secondary cardiovascular prevention, rehabilitation and sports cardiology}, number = {13}, publisher = {Sage Publ.}, address = {London}, issn = {2047-4873}, doi = {10.1177/2047487319850699}, pages = {1383 -- 1385}, year = {2019}, language = {en} } @misc{Miklashevsky2019, author = {Miklashevsky, Alex A.}, title = {Words as social tools}, series = {Physics of life reviews}, volume = {29}, journal = {Physics of life reviews}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1571-0645}, doi = {10.1016/j.plrev.2019.04.002}, pages = {164 -- 165}, year = {2019}, language = {en} } @misc{HalfpapSchlosser2019, author = {Halfpap, Stefan and Schlosser, Rainer}, title = {Workload-Driven Fragment Allocation for Partially Replicated Databases Using Linear Programming}, series = {2019 IEEE 35th International Conference on Data Engineering (ICDE)}, journal = {2019 IEEE 35th International Conference on Data Engineering (ICDE)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-7474-1}, issn = {1084-4627}, doi = {10.1109/ICDE.2019.00188}, pages = {1746 -- 1749}, year = {2019}, abstract = {In replication schemes, replica nodes can process read-only queries on snapshots of the master node without violating transactional consistency. By analyzing the workload, we can identify query access patterns and replicate data depending to its access frequency. In this paper, we define a linear programming (LP) model to calculate the set of partial replicas with the lowest overall memory capacity while evenly balancing the query load. Furthermore, we propose a scalable decomposition heuristic to calculate solutions for larger problem sizes. While guaranteeing the same performance as state-of-the-art heuristics, our decomposition approach calculates allocations with up to 23\% lower memory footprint for the TPC-H benchmark.}, language = {en} }