scispace - formally typeset
Search or ask a question
Institution

University of Luxembourg

EducationLuxembourg, Luxembourg
About: University of Luxembourg is a education organization based out in Luxembourg, Luxembourg. It is known for research contribution in the topics: Context (language use) & Computer science. The organization has 4744 authors who have published 22175 publications receiving 381824 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors proposed a massive MIMO transmission scheme with full frequency reuse (FFR) for LEO satellite communication systems and exploited statistical channel state information (sCSI) to address the difficulty of obtaining instantaneous CSI at the transmitter.
Abstract: Low earth orbit (LEO) satellite communications are expected to be incorporated in future wireless networks, in particular 5G and beyond networks, to provide global wireless access with enhanced data rates. Massive multiple-input multiple-output (MIMO) techniques, though widely used in terrestrial communication systems, have not been applied to LEO satellite communication systems. In this paper, we propose a massive MIMO transmission scheme with full frequency reuse (FFR) for LEO satellite communication systems and exploit statistical channel state information (sCSI) to address the difficulty of obtaining instantaneous CSI (iCSI) at the transmitter. We first establish the massive MIMO channel model for LEO satellite communications and simplify the transmission designs via performing Doppler and delay compensations at user terminals (UTs). Then, we develop the low-complexity sCSI based downlink (DL) precoder and uplink (UL) receiver in closed-form, aiming to maximize the average signal-to-leakage-plus-noise ratio (ASLNR) and the average signal-to-interference-plus-noise ratio (ASINR), respectively. It is shown that the DL ASLNRs and UL ASINRs of all UTs reach their upper bounds under some channel condition. Motivated by this, we propose a space angle based user grouping (SAUG) algorithm to schedule the served UTs into different groups, where each group of UTs use the same time and frequency resource. The proposed algorithm is asymptotically optimal in the sense that the lower and upper bounds of the achievable rate coincide when the number of satellite antennas or UT groups is sufficiently large. Numerical results demonstrate that the proposed massive MIMO transmission scheme with FFR significantly enhances the data rate of LEO satellite communication systems. Notably, the proposed sCSI based precoder and receiver achieve the similar performance with the iCSI based ones that are often infeasible in practice.

147 citations

Book ChapterDOI
03 Mar 2014
TL;DR: In this paper, the authors apply a recently proposed technique for automatic search for differential trails in ARX ciphers and improve the trails in Simon32 and Simon48 previously reported as best.
Abstract: In this paper we continue the previous line of research on the analysis of the differential properties of the lightweight block ciphers Simon and Speck. We apply a recently proposed technique for automatic search for differential trails in ARX ciphers and improve the trails in Simon32 and Simon48 previously reported as best. We further extend the search technique for the case of differentials and improve the best previously reported differentials on Simon32, Simon48 and Simon64 by exploiting more effectively the strong differential effect of the cipher. We also present improved trails and differentials on Speck32, Speck48 and Speck64. Using these new results we improve the currently best known attacks on several versions of Simon and Speck. A second major contribution of the paper is a graph based algorithm (linear time) for the computation of the exact differential probability of the main building block of Simon: an AND operation preceded by two bitwise shift operations. This gives us a better insight into the differential property of the Simon round function and differential effect in the cipher. Our algorithm is general and works for any rotation constants. The presented techniques are generic and are therefore applicable to a broader class of ARX designs.

147 citations

Journal ArticleDOI
TL;DR: This work investigates simultaneously the transcriptional changes of miRNA and mRNA expression levels over time after activation of the Janus kinase/Signal transducer and activator of transcription (Jak/STAT) pathway by interferon-γ stimulation of melanoma cells and demonstrates the dynamic interplay of miRNAs and upstream regulators with biological functions.
Abstract: MicroRNAs (miRNAs) are ubiquitously expressed small non-coding RNAs that, in most cases, negatively regulate gene expression at the post-transcriptional level. miRNAs are involved in fine-tuning fundamental cellular processes such as proliferation, cell death and cell cycle control and are believed to confer robustness to biological responses. Here, we investigated simultaneously the transcriptional changes of miRNA and mRNA expression levels over time after activation of the Janus kinase/Signal transducer and activator of transcription (Jak/STAT) pathway by interferon-γ stimulation of melanoma cells. To examine global miRNA and mRNA expression patterns, time-series microarray data were analysed. We observed delayed responses of miRNAs (after 24-48 h) with respect to mRNAs (12-24 h) and identified biological functions involved at each step of the cellular response. Inference of the upstream regulators allowed for identification of transcriptional regulators involved in cellular reactions to interferon-γ stimulation. Linking expression profiles of transcriptional regulators and miRNAs with their annotated functions, we demonstrate the dynamic interplay of miRNAs and upstream regulators with biological functions. Finally, our data revealed network motifs in the form of feed-forward loops involving transcriptional regulators, mRNAs and miRNAs. Additional information obtained from integrating time-series mRNA and miRNA data may represent an important step towards understanding the regulatory principles of gene expression.

147 citations

Journal ArticleDOI
TL;DR: The data show that replication in particular helps to reduce overall bandwidth as well as user-perceived latency, and can also provide a more fault-tolerant and evenly balanced system.
Abstract: The World Wide Web and the phrase 'traffic jam' have become as linked in the minds of many computer users as are the urban superhighway and rush hour to the early morning commuter. Insufficient bandwidth causing high latency are the order of the day. Caching is a standard solution for this type of problem, and it was applied to the Web early on for this reason. The more advanced approaches of replication and application level naming were introduced to further attack the problem. However, these complex methods could easily exacerbate the situation if the implementation is not well designed and the results are not evaluated carefully. This article examines the benefits that can be obtained from both caching and replication by analyzing the performance of the main proxy cache at the University of Kaiserslautern as well as a system of replicate servers designed and implemented at the University's System Software research group. Our data show that replication in particular helps to reduce overall bandwidth as well as user-perceived latency. It can also provide a more fault-tolerant and evenly balanced system.

147 citations

Proceedings ArticleDOI
18 Jul 2016
TL;DR: PIT is a practical mutation testing tool for Java, applicable on real-world codebases and robust and well integrated with development tools, as it can be invoked through a command line interface, Ant or Maven.
Abstract: Mutation testing introduces artificial defects to measure the adequacy of testing. In case candidate tests can distinguish the behaviour of mutants from that of the original program, they are considered of good quality -- otherwise developers need to design new tests. While, this method has been shown to be effective, industry-scale code challenges its applicability due to the sheer number of mutants and test executions it requires. In this paper we present PIT, a practical mutation testing tool for Java, applicable on real-world codebases. PIT is fast since it operates on bytecode and optimises mutant executions. It is also robust and well integrated with development tools, as it can be invoked through a command line interface, Ant or Maven. PIT is also open source and hence, publicly available at \url{http://pitest.org/}

147 citations


Authors

Showing all 4893 results

NameH-indexPapersCitations
Jun Wang1661093141621
Leroy Hood158853128452
Andreas Heinz108107845002
Philippe Dubois101109848086
John W. Berry9735152470
Michael Müller9133326237
Bart Preneel8284425572
Bjorn Ottersten81105828359
Sander Kersten7924623985
Alexandre Tkatchenko7727126863
Rudi Balling7523819529
Lionel C. Briand7538024519
Min Wang7271619197
Stephen H. Friend7018453422
Ekhard K. H. Salje7058119938
Network Information
Related Institutions (5)
Royal Institute of Technology
68.4K papers, 1.9M citations

90% related

University of York
56.9K papers, 2.4M citations

90% related

ETH Zurich
122.4K papers, 5.1M citations

90% related

Carnegie Mellon University
104.3K papers, 5.9M citations

90% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202360
2022250
20211,671
20201,776
20191,710
20181,663