| 1. |
- Momozawa, Y, et al.
(författare)
-
IBD risk loci are enriched in multigenic regulatory modules encompassing putative causative genes
- 2018
-
Ingår i: Nature communications. - : Springer Science and Business Media LLC. - 2041-1723. ; 9:1, s. 2427-
-
Tidskriftsartikel (refereegranskat)abstract
- GWAS have identified >200 risk loci for Inflammatory Bowel Disease (IBD). The majority of disease associations are known to be driven by regulatory variants. To identify the putative causative genes that are perturbed by these variants, we generate a large transcriptome data set (nine disease-relevant cell types) and identify 23,650 cis-eQTL. We show that these are determined by ∼9720 regulatory modules, of which ∼3000 operate in multiple tissues and ∼970 on multiple genes. We identify regulatory modules that drive the disease association for 63 of the 200 risk loci, and show that these are enriched in multigenic modules. Based on these analyses, we resequence 45 of the corresponding 100 candidate genes in 6600 Crohn disease (CD) cases and 5500 controls, and show with burden tests that they include likely causative genes. Our analyses indicate that ≥10-fold larger sample sizes will be required to demonstrate the causality of individual genes using this approach.
|
|
| 2. |
|
|
| 3. |
- Chiesa, Marco, 1987-, et al.
(författare)
-
On the resiliency of randomized routing against multiple edge failures
- 2016
-
Ingår i: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. - : Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. - 9783959770132
-
Konferensbidrag (refereegranskat)abstract
- We study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph G = (V, E), a unique destination vertex d, and an integer constant c > 0, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source s to the destination d is guaranteed so long as (1) no more than c edges fail and (2) there exists a physical path from s to d? We embark upon a study of this problem by relating the edge-connectivity of a graph, i.e., the minimum number of edges whose deletion partitions G, to its resiliency. Following the success of randomized routing algorithms in dealing with a variety of problems (e.g., Valiant load balancing in the network design problem), we embark upon a study of randomized routing algorithms for the Static-Routing-Resiliency problem. For any k-connected graph, we show a surprisingly simple randomized algorithm that has expected number of hops O(|V|k) if at most k-1 edges fail, which reduces to O(|V|) if only a fraction t of the links fail (where t < 1 is a constant). Furthermore, our algorithm is deterministic if the routing does not encounter any failed link.
|
|
| 4. |
- Chiesa, Marco, 1987-, et al.
(författare)
-
On the Resiliency of Static Forwarding Tables
- 2017
-
Ingår i: IEEE/ACM Transactions on Networking. - : Institute of Electrical and Electronics Engineers (IEEE). - 1063-6692 .- 1558-2566. ; 25:2, s. 1133-1146
-
Tidskriftsartikel (refereegranskat)abstract
- Fast reroute and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-headerrewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the "connectivity" k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k - 1 failures, with limited path stretch, by storing log(k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.
|
|
| 5. |
- Chiesa, Marco, 1987-, et al.
(författare)
-
The quest for resilient (static) forwarding tables
- 2016
-
Ingår i: INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, IEEE. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467399531
-
Konferensbidrag (refereegranskat)abstract
- Fast Reroute (FRR) and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. We embark upon a systematic algorithmic study of the resiliency of immediate failover in a variety of models (with/without packet marking/duplication, etc.). We leverage our findings to devise new schemes for immediate failover and show, both theoretically and experimentally, that these outperform existing approaches.
|
|
| 6. |
- Mitrovic, I. Z., et al.
(författare)
-
Atomic-layer deposited thulium oxide as a passivation layer on germanium
- 2015
-
Ingår i: Journal of Applied Physics. - : AIP Publishing. - 0021-8979 .- 1089-7550. ; 117:21
-
Tidskriftsartikel (refereegranskat)abstract
- A comprehensive study of atomic-layer deposited thulium oxide (Tm2O3) on germanium has been conducted using x-ray photoelectron spectroscopy (XPS), vacuum ultra-violet variable angle spectroscopic ellipsometry, high-resolution transmission electron microscopy (HRTEM), and electron energy-loss spectroscopy. The valence band offset is found to be 3.05±0.2eV for Tm2O3/p-Ge from the Tm 4d centroid and Ge 3p3/2 charge-corrected XPS core-level spectra taken at different sputtering times of a single bulk thulium oxide sample. A negligible downward band bending of ∼0.12eV is observed during progressive differential charging of Tm 4d peaks. The optical band gap is estimated from the absorption edge and found to be 5.77eV with an apparent Urbach tail signifying band gap tailing at ∼5.3eV. The latter has been correlated to HRTEM and electron diffraction results corroborating the polycrystalline nature of the Tm2O3 films. The Tm2O3/Ge interface is found to be rather atomically abrupt with sub-nanometer thickness. In addition, the band line-up of reference GeO2/n-Ge stacks obtained by thermal oxidation has been discussed and derived. The observed low reactivity of thulium oxide on germanium as well as the high effective barriers for holes (∼3eV) and electrons (∼2eV) identify Tm2O3 as a strong contender for interfacial layer engineering in future generations of scaled high-κ gate stacks on Ge.
|
|
| 7. |
- Palmqvist, Lisa, et al.
(författare)
-
The Relationship Between Working Memory Capacity and Students' Behaviour in a Teachable Agent-Based Software
- 2015
-
Ingår i: Artificial Intelligence in Education. - Cham : Springer International Publishing. - 0302-9743 .- 1611-3349. - 9783319197739 - 9783319197722 ; 9112, s. 670-673
-
Konferensbidrag (refereegranskat)abstract
- The current study investigated if and how students' behaviour when using a teachable agent-based educational software were related to their working memory capacity. Thirty Swedish students aged 11-12, participated in the study. Results showed that differences in behaviour such as time spent on an off-task activity, time spent on interactive dialogues, and the number of tests that students let their TA take, were associated with differences in working memory capacity.
|
|
