University of Luxembourg

About: University of Luxembourg is a education organization based out in Luxembourg, Luxembourg. It is known for research contribution in the topics: Population & European union. The organization has 4744 authors who have published 22175 publications receiving 381824 citations.

Derivation of human midbrain-specific organoids from neuroepithelial Stem Cells

Abstract: Research on human brain development and neurological diseases is limited by the lack of advanced experimental in vitro models that truly recapitulate the complexity of the human brain. Here, we describe a robust human brain organoid system that is highly specific to the midbrain derived from regionally patterned neuroepithelial stem cells. These human midbrain organoids contain spatially organized groups of dopaminergic neurons, which make them an attractive model for the study of Parkinson’s disease. Midbrain organoids are characterized in detail for neuronal, astroglial, and oligodendrocyte differentiation. Furthermore, we show the presence of synaptic connections and electrophysiological activity. The complexity of this model is further highlighted by the myelination of neurites. The present midbrain organoid system has the potential to be used for advanced in vitro disease modeling and therapy development.

Trends and cyclical variation in the incidence of childhood type 1 diabetes in 26 European centres in the 25 year period 1989-2013: a multicentre prospective registration study.

Abstract: Against a background of a near-universally increasing incidence of childhood type 1 diabetes, recent reports from some countries suggest a slowing in this increase. Occasional reports also describe cyclical variations in incidence, with periodicities of between 4 and 6 years. Age/sex-standardised incidence rates for the 0- to 14-year-old age group are reported for 26 European centres (representing 22 countries) that have registered newly diagnosed individuals in geographically defined regions for up to 25 years during the period 1989–2013. Poisson regression was used to estimate rates of increase and test for cyclical patterns. Joinpoint regression software was used to fit segmented log-linear relationships to incidence trends. Significant increases in incidence were noted in all but two small centres, with a maximum rate of increase of 6.6% per annum in a Polish centre. Several centres in high-incidence countries showed reducing rates of increase in more recent years. Despite this, a pooled analysis across all centres revealed a 3.4% (95% CI 2.8%, 3.9%) per annum increase in incidence rate, although there was some suggestion of a reduced rate of increase in the 2004–2008 period. Rates of increase were similar in boys and girls in the 0- to 4-year-old age group (3.7% and 3.7% per annum, respectively) and in the 5- to 9-year-old age group (3.4% and 3.7% per annum, respectively), but were higher in boys than girls in the 10- to 14-year-old age group (3.3% and 2.6% per annum, respectively). Significant 4 year periodicity was detected in four centres, with three centres showing that the most recent peak in fitted rates occurred in 2012. Despite reductions in the rate of increase in some high-risk countries, the pooled estimate across centres continues to show a 3.4% increase per annum in incidence rate, suggesting a doubling in incidence rate within approximately 20 years in Europe. Although four centres showed support for a cyclical pattern of incidence with a 4 year periodicity, no plausible explanation for this can be given.

Phase-field modeling of fracture

Abstract: Fracture is one of the most commonly encountered failure modes of engineering materials and structures. Prevention of cracking-induced failure is, therefore, a major concern in structural designs. Computational modeling of fracture constitutes an indispensable tool not only to predict the failure of cracking structures but also to shed insights into understanding the fracture processes of many materials such as concrete, rock, ceramic, metals, and biological soft tissues. This chapter provides an extensive overview of the literature on the so-called phase-field fracture/damage models (PFMs), particularly, for quasi-static and dynamic fracture of brittle and quasi-brittle materials, from the points of view of a computational mechanician. PFMs are the regularized versions of the variational approach to fracture which generalizes Griffith's theory for brittle fracture. They can handle topologically complex fractures such as initiation, intersecting, and branching cracks in both two and three dimensions with a quite straightforward implementation. One of our aims is to justify the gaining popularity of PFMs. To this end, both theoretical and computational aspects are discussed and extensive benchmark problems (for quasi-static and dynamic brittle/cohesive fracture) that are successfully and unsuccessfully solved with PFMs are presented. Unresolved issues for further investigations are also documented.

Distinguisher and Related-Key Attack on the Full AES-256

Abstract: In this paper we construct a chosen-key distinguisher and a related-key attack on the full 256-bit key AES. We define a notion of differential q -multicollision and show that for AES-256 q-multicollisions can be constructed in time q·267 and with negligible memory, while we prove that the same task for an ideal cipher of the same block size would require at least $O(q\cdot 2^{\frac{q-1}{q+1}128})$ time. Using similar approach and with the same complexity we can also construct q-pseudo collisions for AES-256 in Davies-Meyer mode, a scheme which is provably secure in the ideal-cipher model. We have also computed partial q-multicollisions in time q·237 on a PC to verify our results. These results show that AES-256 can not model an ideal cipher in theoretical constructions. Finally we extend our results to find the first publicly known attack on the full 14-round AES-256: a related-key distinguisher which works for one out of every 235 keys with 2120 data and time complexity and negligible memory. This distinguisher is translated into a key-recovery attack with total complexity of 2131 time and 265 memory.