| 11. |
- Wuttke, Matthias, et al.
(författare)
-
A catalog of genetic loci associated with kidney function from analyses of a million individuals
- 2019
-
Ingår i: Nature Genetics. - : NATURE PUBLISHING GROUP. - 1061-4036 .- 1546-1718. ; 51:6, s. 957-972
-
Tidskriftsartikel (refereegranskat)abstract
- Chronic kidney disease (CKD) is responsible for a public health burden with multi-systemic complications. Through transancestry meta-analysis of genome-wide association studies of estimated glomerular filtration rate (eGFR) and independent replication (n = 1,046,070), we identified 264 associated loci (166 new). Of these,147 were likely to be relevant for kidney function on the basis of associations with the alternative kidney function marker blood urea nitrogen (n = 416,178). Pathway and enrichment analyses, including mouse models with renal phenotypes, support the kidney as the main target organ. A genetic risk score for lower eGFR was associated with clinically diagnosed CKD in 452,264 independent individuals. Colocalization analyses of associations with eGFR among 783,978 European-ancestry individuals and gene expression across 46 human tissues, including tubulo-interstitial and glomerular kidney compartments, identified 17 genes differentially expressed in kidney. Fine-mapping highlighted missense driver variants in 11 genes and kidney-specific regulatory variants. These results provide a comprehensive priority list of molecular targets for translational research.
|
|
| 12. |
- Arvidsson, Åke, 1957-, et al.
(författare)
-
Web metrics for the next generation performance enhancing proxies
- 2019
-
Ingår i: 2019 27TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM). - : IEEE. - 9789532900880 ; , s. 171-176
-
Konferensbidrag (refereegranskat)abstract
- The fast growth of Internet traffic, the growing importance of cellular accesses and the escalating competition between content providers and network operators result in a growing interest in improving network performance and user experience. In terms of network transport, different solutions ranging from tuning TCP to installing middleboxes are applied. It turns out, however, that the practical results sometimes are disappointing and we believe that poor testing is one of the reasons for this. Indeed, many cases in the literature limit testing to the simple and rare use case of a single file download, while common and complex use cases like web browsing often are ignored or modelled only by considering smaller files. To facilitate better testing, we present a broader view which includes domain counts, flow counts and different forms of concurrency to better characterise the complexity around web pages, and from which the potential for different optimisation techniques can be estimated. We also derive numerical values of these metrics for a small set of popular web pages and study similarities and differences between pages with the same kind of content (newspapers, e-commerce and video) and between pages designed for the same platform (computer and smartphone).
|
|
| 13. |
- Braco, Veletanlic, et al.
(författare)
-
Flipped classroom approach and its implementation in an online course
- 2016
-
Ingår i: Lärarlärdom 2016. - Högskolan Kristianstad : Kristianstad University Press.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Active learning is the process where students learn beyond passively listening to an instructor's lecture. In this way students are engaged in their learning activities. It has been accepted that active learning leads to deeper understanding and better learning outcomes.The term flipped classroom has been widely used to describe a new pedagogical approach in which traditional lecture and homework elements of a course are reversed so that the initial exposure to the learning content takes place outside of the classroom. This approach frees up class time, promotes active learning and engagement in learning and facilitates student-centered learning.In this study we experimented with flipped classroom approach in the online course Programming in C during the autumn term 2015. The purpose of the experiment was to determine whether flipped classroom can serve as an appropriate method to use in an online course and to find out to what extent flipped classroom can stimulate active learning in an online setting. Based on known concept of flipped classroom approach and literature review, we systematically reviewed YouTube videos and selected 52 video clips to use as companion course materials. We also compiled and produced 212 quiz questions to use as formative assessment. In order to promote interaction among the students, we experimented with peer-review as a part of the laboratory work process. We also provided scheduled online sessions in the form of chat rooms. Short video clips were positively received by the students. Even the peer-review approach was positively received but the students gave up this activity at the end of the course, due to the work load. Flipped classroom has potential to be used in online settings but distinction between "classroom" and "outside classroom" is not always clear.More work is needed to make this distinction visible and to make the transition between these two learning environments smooth.
|
|
| 14. |
- Braco, Veletanlic, et al.
(författare)
-
Flipped classroom approach and its implementation in an online course
- 2016
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Active learning is the process where students learn beyond passively listening to an instructor's lecture. In this way students are engaged in their learning activities. It has been accepted that active learning leads to deeper understanding and better learning outcomes. The term flipped classroom has been widely used to describe a new pedagogical approach in which traditional lecture and homework elements of a course are reversed so that the initial exposure to the learning content takes place outside of the classroom. This approach frees up class time, promotes active learning and engagement in learning and facilitates student-centered learning. In this study we experimented with flipped classroom approach in the online course Programming in C during the autumn term 2015. The purpose of the experiment was to determine whether flipped classroom can serve as an appropriate method to use in an online course and to find out to what extent flipped classroom can stimulate active learning in an online setting. Based on known concept of flipped classroom approach and literature review, we systematically reviewed YouTube videos and selected 52 video clips to use as companion course materials. We also compiled and produced 212 quiz questions to use as formative assessment. In order to promote interaction among the students, we experimented with peer-review as a part of the laboratory work process. We also provided scheduled online sessions in the form of chat rooms. Short video clips were positively received by the students. Even the peer-review approach was positively received but the students gave up this activity at the end of the course, due to the work load. Flipped classroom has potential to be used in online settings but distinction between "classroom" and "outside classroom" is not always clear. More work is needed to make this distinction visible and to make the transition between these two learning environments smooth.
|
|
| 15. |
- Chen, Eric Zhi, 1963-, et al.
(författare)
-
A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- 2015
-
Ingår i: Journal of Algebra Combinatorics Discrete Structures and Application. - Turkey. - 2148-838X. ; 2:1, s. 1-16
-
Tidskriftsartikel (refereegranskat)abstract
- Error control codes have been widely used in data communications and storage systems. One centralproblem in coding theory is to optimize the parameters of a linear code and construct codes withbest possible parameters. There are tables of best-known linear codes over finite fields of sizes up to9. Recently, there has been a growing interest in codes over F13 and other fields of size greater than9. The main purpose of this work is to present a database of best-known linear codes over the fieldF13 together with upper bounds on the minimum distances. To find good linear codes to establishlower bounds on minimum distances, an iterative heuristic computer search algorithm is employed toconstruct quasi-twisted (QT) codes over the field F13 with high minimum distances. A large numberof new linear codes have been found, improving previously best-known results. Tables of [pm;m] QTcodes over F13 with best-known minimum distances as well as a table of lower and upper bounds onthe minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.
|
|
| 16. |
- Chen, Eric Zhi, et al.
(författare)
-
A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- 2015
-
Ingår i: Journal of Algebra Combinatorics Discrete Structures and Application. - : Journal of Algebra Combinatorics Discrete Structures and Applications. - 2148-838X. ; 2:1, s. 1-16
-
Tidskriftsartikel (refereegranskat)abstract
- Error control codes have been widely used in data communications and storage systems. One centralproblem in coding theory is to optimize the parameters of a linear code and construct codes withbest possible parameters. There are tables of best-known linear codes over finite fields of sizes up to9. Recently, there has been a growing interest in codes over F13 and other fields of size greater than9. The main purpose of this work is to present a database of best-known linear codes over the fieldF13 together with upper bounds on the minimum distances. To find good linear codes to establishlower bounds on minimum distances, an iterative heuristic computer search algorithm is employed toconstruct quasi-twisted (QT) codes over the field F13 with high minimum distances. A large numberof new linear codes have been found, improving previously best-known results. Tables of [pm;m] QTcodes over F13 with best-known minimum distances as well as a table of lower and upper bounds onthe minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.
|
|
| 17. |
- Chen, Eric Zhi, 1963-
(författare)
-
A new iterative computer search algorithm for good quasi-twisted codes
- 2015
-
Ingår i: Designs, Codes and Cryptography. - 0925-1022 .- 1573-7586. ; 76:2, s. 307-323
-
Tidskriftsartikel (refereegranskat)abstract
- As a generalization to cyclic and consta-cyclic codes, quasi-twisted (QT) codes contain many good linear codes. During the last twenty years, a lot of record-breaking codes have been found by computer search for good QT codes. But due to the time complexity, very few QT codes have been reported recently. In this paper, a new iterative, heuristic computer search algorithm is presented, and a lot of new QT codes have been obtained. With these results, a total of 45 entries in the code tables for the best-known codes have been improved. Also, as an example to show the effectiveness of the algorithm, 8 better binary quasi-cyclic codes with dimension 12 and m = 13 than previously best-known results are constructed.
|
|
| 18. |
- Chen, Eric Zhi
(författare)
-
A new iterative computer search algorithm for good quasi-twisted codes
- 2015
-
Ingår i: Designs, Codes and Cryptography. - : Springer Science and Business Media LLC. - 0925-1022 .- 1573-7586. ; 76:2, s. 307-323
-
Tidskriftsartikel (refereegranskat)abstract
- As a generalization to cyclic and consta-cyclic codes, quasi-twisted (QT) codes contain many good linear codes. During the last twenty years, a lot of record-breaking codes have been found by computer search for good QT codes. But due to the time complexity, very few QT codes have been reported recently. In this paper, a new iterative, heuristic computer search algorithm is presented, and a lot of new QT codes have been obtained. With these results, a total of 45 entries in the code tables for the best-known codes have been improved. Also, as an example to show the effectiveness of the algorithm, 8 better binary quasi-cyclic codes with dimension 12 and m = 13 than previously best-known results are constructed.
|
|
| 19. |
- Chen, Eric Zhi, 1963-
(författare)
-
An explicit construction of 2-generator quasi-twisted codes
- 2008
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 54:12, s. 5770-5773
-
Tidskriftsartikel (refereegranskat)abstract
- Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.
|
|
| 20. |
- Chen, Eric Zhi
(författare)
-
An explicit construction of 2-generator quasi-twisted codes
- 2008
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers Inc.. - 0018-9448 .- 1557-9654. ; 54:12, s. 5770-5773
-
Tidskriftsartikel (refereegranskat)abstract
- Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.
|
|
