User login

Jocelyn van Deusen

Organization:	SAP
User Profile	jocelyn.van.deusen
Phone
Homepage:

Activities

Publications

2013

Gillis, Bryan R., Hudson, Michael J., Erben, Thomas, Heymans, Catherine, Hildebrandt, Hendrik, Hoekstra, Henk, Kitching, Thomas D., Mellier, Yannick, Miller, Lance, van Waerbeke, Ludovic, Bonnett, Christopher, Coupon, Jean, Fu, Liping, Hilbert, Stefan, Rowe, Barnaby T. P., Schrabback, Tim, Semboloni, Elisabetta, van Uitert, Edo, Velander, Malin
CFHTLenS: The Environmental Dependence of Galaxy Halo Masses from Weak Lensing

Abstract We use weak gravitational lensing to analyse the dark matter halos around satellite galaxies in galaxy groups in the CFHTLenS dataset. This dataset is derived from the CFHTLS-Wide survey, and encompasses 154 sq. deg of high-quality shape data. Using the photometric redshifts, we divide the sample of lens galaxies with stellar masses in the range 10^9 Msun to 10^10.5 Msun into those likely to lie in high-density environments (HDE) and those likely to lie in low-density environments (LDE). Through comparison with galaxy catalogues extracted from the Millennium Simulation, we show that the sample of HDE galaxies should primarily (~61%) consist of satellite galaxies in groups, while the sample of LDE galaxies should consist of mostly (~87%) non-satellite (field and central) galaxies. Comparing the lensing signals around samples of HDE and LDE galaxies matched in stellar mass, the lensing signal around HDE galaxies clearly shows a positive contribution from their host groups on their lensing signals at radii of ~500--1000 kpc, the typical separation between satellites and group centres. More importantly, the subhalos of HDE galaxies are less massive than those around LDE galaxies by a factor 0.65 +/- 0.12, significant at the 2.9 sigma level. A natural explanation is that the halos of satellite galaxies are stripped through tidal effects in the group environment. Our results are consistent with a typical tidal truncation radius of ~40 kpc.

Treichel, Sabine, Heußner, Melanie, Hahn, Christiane, Wilde, Enrico, Meinel, Frithjof, Mau, Wilfried, Hübner, Gundula
Länger selbstbestimmt leben - das Potenzial von AAL
In: {Verband der Elektrotechnik Elektronik Informationstechnik e.V} (eds.): Lebensqualität im Wandel von Demografie und Technik: Teilhabe und Mobilität: 6. AAL Kongress (Berlin 2013), VDE-Verlag, 2013

Abstract Aufgrund der demografischen Entwicklung, der zunehmenden Mobilitätseinschränkung im Alter sowie der berufsbedingten Ortsunabhängigkeit Jüngerer wird ein selbstbestimmtes Leben mit sozialer Teilhabe im Alter immer schwieriger. Gerade im ländlichen Raum wohnen die Kinder und Enkelkinder oft weit entfernt, die Arztpraxen und Pflegedienste sind nicht vor Ort, und dennoch möchten ältere Menschen nicht auf ihre vertraute Wohnumgebung verzichten. Eine Unterstützungsmöglichkeit, lange ein selbstbestimmtes Leben in der eigenen Wohnung führen zu können, bieten Technische Assistenzsysteme AAL. Doch obwohl bereits eine Vielzahl von AAL Angeboten vorliegt, haben sich in der betreffenden Zielgruppe unterstützungsbedürftiger älterer Menschen nur wenige durchgesetzt, vor allem Notrufsysteme. Die Gründe für den geringen Verbreitungsgrad dürften zum einen motivational auf Anwenderseiter bedingt sein Van Dijk, 2005. Zum anderen ist jedoch fraglich, ob die bestehenden Gestaltungen der AAL den Bedürfnissen und Fähigkeiten der Zielgruppe ausreichend entsprechen. Um zu überprüfen, ob eine veränderte Gestaltung die Akzeptanz von AAL erhöht, werden im Rahmen des Projektes „Technikgestützte Assistenzsystemen und rehabilitativ-soziale Integration älterer Menschen“ in interdisziplinärer Zusammenarbeit von Industriedesignern, Rehabilitationsmedizinern und Psychologen zwei AAL-Schnittstellen entwickelt und auf ihre Akzeptanz in der Zielgruppe getestet: ein Touchpad und sensorierte bewegliche Bilderrahmen s. Abb. 1. Die Akzeptanztestung basierte u. a. auf der Unified Theory of Acceptance and Use of Technology UTAUT; Venkatesh, Morris, Davis & Davis, 2003.

Depeursinge, Adrien, Foncubierta-Rodríguez, Antonio, Vargas, Alejandro, Van De Ville, Dimitri, Platon, Alexandra, Poletti, Pierre-Alexandre, Müller, Henning
Rotation-covariant texture analysis of 4D dual-energy CT as an indicator of local pulmonary perfusion
In: IEEE International Symposium on Biomedical Imaging (ISBI), 2013

2011

Gesing, Sandra, van Hemert, Jano, Kacsuk, Peter, Kohlbacher, Oliver
Special Issue: Portals for life sciences—Providing intuitive access to bioinformatic tools
Concurrency and Computation: Practice and Experience, vol. 23, no. 3, 2011, pp. 223--234

Abstract The topic ‘Portals for life sciences’ includes various research fields, on the one hand many different topics out of life sciences, e.g. mass spectrometry, on the other hand portal technologies and different aspects of computer science, such as usability of user interfaces and security of systems. The main aspect about portals is to simplify the user's interaction with computational resources that are concerted to a supported application domain. Copyright © 2010 John Wiley & Sons, Ltd.

Gesing, Sandra, van Hemert, Jano, Kacsuk, Peter, Kohlbacher, Oliver
Special Issue: Portals for life sciences—Providing intuitive access to bioinformatic tools
Concurrency and Computation: Practice and Experience, vol. 23, no. 3, 2011, pp. 223--234

Abstract The topic ‘Portals for life sciences’ includes various research fields, on the one hand many different topics out of life sciences, e.g. mass spectrometry, on the other hand portal technologies and different aspects of computer science, such as usability of user interfaces and security of systems. The main aspect about portals is to simplify the user's interaction with computational resources that are concerted to a supported application domain. Copyright © 2010 John Wiley & Sons, Ltd.

2010

Gesing, Sandra, van Hemert, Jano, Koetsier, Jos, Bertsch, Andreas, Kohlbacher, Oliver
TOPP goes Rapid
Cluster Computing and the Grid, IEEE International Symposium on, vol. , no. , 2010, pp. 598-599

Gesing, Sandra, van Hemert, Jano, Koetsier, Jos, Bertsch, Andreas, Kohlbacher, Oliver
TOPP goes Rapid
Cluster Computing and the Grid, IEEE International Symposium on, vol. , no. , 2010, pp. 598-599

de Berg, Marc, van Nijnatten, Fred, Sitters, Ren{\'e}, Woeginger, Gerhard J., Wolff, Alexander
The Traveling Salesman Problem Under Squared {Euclidean} Distances
In: Marion, Jean-Yves and Schwentick, Thomas (eds.): Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS'10), 2010, pp. 239--250

2009

Gesing, S, Kohlbacher, O, van Hemert, J. I.
Portals for Life Sciences – a Brief Introduction
In: Proc. of 1st Workshop IWPLS’09, Edinburgh, UK, M. Jeusfeld c/o Redaktion Sun SITE, Informatik V, RWTH Aachen., 2009

Gesing, S, Kohlbacher, O, van Hemert, J. I.
Portals for Life Sciences – a Brief Introduction
In: Proc. of 1st Workshop IWPLS’09, Edinburgh, UK, M. Jeusfeld c/o Redaktion Sun SITE, Informatik V, RWTH Aachen., 2009

Benkert, Marc, Gudmundsson, Joachim, Knauer, Christian, van Oostrum, Ren{\'e}, Wolff, Alexander
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
International Journal of Computational Geometry and Applications, vol. 19, no. 3, 2009, pp. 267--288

Abstract We consider the following packing problem. Let $\alpha$ be a fixed real in $(0,1]$. We are given a bounding rectangle $\rho$ and a set $\cal R$ of $n$ possibly intersecting unit disks whose centers lie in~$\rho$. The task is to pack a set $\cal B$ of $m$ disjoint disks of radius $\alpha$ into $\rho$ such that no disk in $\cal B$ intersects a disk in $\cal R$, where $m$ is the maximum number of \emph{unit} disks that can be packed. In this paper we present a polynomial-time algorithm for $\alpha = 2/3$. So far only the case of packing squares has been considered. For that case Baur and Fekete have given a polynomial-time algorithm for $\alpha=2/3$ and have shown that the problem cannot be solved in polynomial time for any $\alpha > 13/14$ unless ${\cal P}={\cal NP}$.

2006

Benkert, Marc, Gudmundsson, Joachim, Knauer, Christian, Moet, Esther, van Oostrum, Ren{\'e}, Wolff, Alexander
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
In: Proc. 22nd European Workshop on Computational Geometry (EWCG'06), 2006, pp. 141--144

Benkert, Marc, Gudmundsson, Joachim, Knauer, Christian, Moet, Esther, van Oostrum, Ren{\'e}, Wolff, Alexander
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
In: Chen, Danny Z. and Lee, Der-Tsai (eds.): Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON'06), Lecture Notes in Computer Science vol. 4112, Springer-Verlag, 2006, pp. 166--175

Benkert, Marc, Gudmundsson, Joachim, Knauer, Christian, Moet, Esther, van Oostrum, Ren{\'e}, Wolff, Alexander
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

2002

Janata, Petr, Birk, Jeffrey L., Horn, John D. Van, Leman, Marc, Tillmann, Barbara, Bharucha, Jamshed J.
{The Cortical Topography of Tonal Structures Underlying Western Music}
Science, vol. 298, no. 5601, 2002, pp. 2167-2170

1999

Agarwal, Pankaj K., Knipping, Lars, van Kreveld, Marc, Strijk, Tycho, Wolff, Alexander
A Simple and Efficient Algorithm for High-Quality Line Labeling
In: Proc. 15th European Workshop on Computational Geometry (EWCG'99), 1999, pp. 93--96

1996

Huibers, Th. W. C., Lalmas, Mounia, van Rijsbergen, C. J.
Information Retrieval and Situation Theory
SIGIR Forum, vol. 30, no. 1, 1996, pp. 11-25

1984

Berendsen, H.J.C., Postma, J.P.M, van Gunsteren, W.F., DiNola, A., Haak, J.R.
Molecular dynamics with coupling to an external bath
The Journal of Chemical Physics, vol. 81, no. 8, 1984, pp. 3684-3690

1969

Fokker, A.D.
Unison Vectors and Periodicity Blocks in the Tree-Dimensional (3-5-7-)Harmonic Lattice of Notes
Proceedings of Koninklijke Nederlandse Akademie van Wetenschappen, Series B, vol. 72, no. 3, 1969, pp. 153–168

1968

Fokker, A.D.
Selections from the Harmonic Lattice of Perfect Fifths and Major Thirds Containing 12, 19,22,31,41 or 53 Notes
Proceedings of Koninklijke Nederlandse Akademie van Wetenschappen, Series B, vol. 71, no. , 1968, pp. 251–266

Login to post comments