| 1. |
|
|
| 2. |
- Andersen, T. C. B., et al.
(författare)
-
The SH3 domains of the protein kinases ITK and LCK compete for adjacent sites on T cell?specific adapter protein
- 2019
-
Ingår i: Journal of Biological Chemistry. - 0021-9258. ; 294:42, s. 15480-15494
-
Tidskriftsartikel (refereegranskat)abstract
- T-cell activation requires stimulation of specific intracellular signaling pathways in which protein-tyrosine kinases, phosphatases, and adapter proteins interact to transmit signals from the T-cell receptor to the nucleus. Interactions of LCK proto-oncogene, SRC family tyrosine kinase (LCK), and the IL-2?inducible T cell kinase (ITK) with the T cell-specific adapter protein (TSAD) promotes LCK-mediated phosphorylation and thereby ITK activation. Both ITK and LCK interact with TSAD's proline-rich region (PRR) through their Src homology 3 (SH3) domains. Whereas LCK may also interact with TSAD through its SH2 domain, ITK interacts with TSAD only through its SH3 domain. To begin to understand on a molecular level how the LCK SH3 and ITK SH3 domains interact with TSAD in human HEK293T cells, here we combined biochemical analyses with NMR spectroscopy. We found that the ITK and LCK SH3 domains potentially have adjacent and overlapping binding sites within the TSAD PRR amino acids (aa) 239?274. Pulldown experiments and NMR spectroscopy revealed that both domains may bind to TSAD aa 239?256 and aa 257?274. Co-immunoprecipitation experiments further revealed that both domains may also bind simultaneously to TSAD aa 242?268. Accordingly, NMR spectroscopy indicated that the SH3 domains may compete for these two adjacent binding sites. We propose that once the associations of ITK and LCK with TSAD promote the ITK and LCK interaction, the interactions among TSAD, ITK, and LCK are dynamically altered by ITK phosphorylation status.
|
|
| 3. |
|
|
| 4. |
- Andreotti, Eleonora, 1988, et al.
(författare)
-
Cooperative merging strategy between connected autonomous vehicles in mixed traffic
- 2022
-
Ingår i: IEEE Open Journal of Intelligent Transportation Systems. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 2687-7813. ; 3, s. 825-837
-
Tidskriftsartikel (refereegranskat)abstract
- In this work we propose a new cooperation strategy between connected autonomous vehicles in on-ramps merging scenarios and we implement the cut-in risk indicator (CRI) to investigate the safety effect of the proposed strategy. The new cooperation strategy considers a pair of vehicles approaching an on-ramp. The strategy then makes decisions on the target speeds/accelerations of both vehicles, possible lane changing, and a dynamic decision-making approach in order to reduce the risk during the cut-in manoeuvre. In this work, the CRI was first used to assess the risk during the merging manoeuvre. For this purpose, scenarios with penetration rates of autonomous vehicles from 20% to 100%, with step of 10%, both connected and non-connected autonomous vehicles were evaluated. As a result, on average a 35% reduction of the cut-in risk manoeuvres in connected autonomous vehicles compared to non-connected autonomous vehicles is obtained. It is shown through the analysis of probability density functions characterising the CRI distribution that the reduction is not homogeneous across all indicator values, but depends on the penetration rate and the severity of the manoeuvre.
|
|
| 5. |
- Andreotti, Eleonora, 1988, et al.
(författare)
-
Equivalence between spectral properties of graphs with and without loops
- 2018
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- In this paper we introduce a spectra preserving relation between graphs with loops and graphs without loops. This relation is achieved in two steps. First, by generalizing spectra results got on (m, k)-stars to a wider class of graphs, the (m, k, s)-stars with or without loops. Second, by defining a covering space of graphs with loops that allows to remove the presence of loops by increasing the graph dimension. The equivalence of the two class of graphs allows to study graph with loops as simple graph without loosing information.
|
|
| 6. |
- Andreotti, Eleonora, 1988, et al.
(författare)
-
Mathematical Definitions of Scene and Scenario for Analysis of Automated Driving Systems in Mixed-Traffic Simulations
- 2021
-
Ingår i: IEEE Transactions on Intelligent Vehicles. - 2379-8858. ; 6:2, s. 366-375
-
Tidskriftsartikel (refereegranskat)abstract
- This paper introduces a unified mathematical definition for describing commonly used terms encountered in systematical analysis of automated driving systems in mixed-traffic simulations. The most significant contribution of this work is in translating the terms that are clarified previously in literature into a mathematical set and function based format. Our work can be seen as an incremental step towards further formalisation of Domain-Specific-Language (DSL) for scenario representation. We also extended the previous work in the literature to allow more complex scenarios by expanding the model-incompliant information using set-theory to represent the perception capacity of the road-user agents. With this dynamic perception definition, we also support interactive scenarios and are not limited to reactive and pre-defined agent behavior. Our main focus is to give a framework to represent realistic road-user behavior to be used in simulation or computational tool to examine interaction patterns in mixed-traffic conditions. We believe that, by formalising the verbose definitions and extending the previous work in DSL, we can support automatic scenario generation and dynamic/evolving agent behavior models for simulating mixed traffic situations and scenarios. In addition, we can obtain scenarios that are realistic but also can represent rare-conditions that are difficult to extract from field-tests and real driving data repositories.
|
|
| 7. |
- Andreotti, Eleonora, 1988, et al.
(författare)
-
Measuring stability of spectral clustering
- 2019
-
Ingår i: Linear Algebra and Its Applications. - : Elsevier BV. - 0024-3795. ; 610, s. 673-697
-
Tidskriftsartikel (refereegranskat)abstract
- As an indicator of the stability of spectral clustering of an undirected weighted graph into k clusters, the kth spectral gap of the graph Laplacian is often considered. The k-th spectral gap is characterized here as an unstructured distance to ambiguity, namely as the minimal distance of the Laplacian to arbitrary symmetric matrices with vanishing kth spectral gap. As a more appropriate measure of stability, the structured distance to ambiguity of the k-clustering is introduced as the minimal distance of the Laplacian to Laplacians of the same graph with weights that are perturbed such that the k-th spectral gap vanishes. To compute a solution to this matrix nearness problem, a two-level iterative algorithm is proposed that uses a constrained gradient system of matrix differential equations in the inner iteration and a one-dimensional optimization of the perturbation size in the outer iteration. The structured and unstructured distances to ambiguity are compared on some example graphs. The numerical experiments show, in particular, that selecting the number k of clusters according to the criterion of maximal stability can lead to different results for the structured and unstructured stability indicators.
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
- Andreotti, Eleonora, 1988, et al.
(författare)
-
Potential impact of autonomous vehicles in mixed traffic from simulation using real traffic flow
- 2023
-
Ingår i: Journal of Intelligent and Connected Vehicles. - 2399-9802. ; 6:1, s. 1-15
-
Tidskriftsartikel (refereegranskat)abstract
- This work focuses on the potential impacts of the autonomous vehicles in a mixed traffic condition represented in traffic simulator Simulation of Urban MObility (SUMO) with real traffic flow. Specifically, real traffic flow and speed data collected in 2002 and 2019 in Gothenburg were used to simulate daily flow variation in SUMO. In order to predict the most likely drawbacks during the transition from a traffic consisting only manually driven vehicles to a traffic consisting only fully-autonomous vehicles, this study focuses on mixed traffic with different percentages of autonomous and manually driven vehicles. To realize this aim, several parameters of the car following and lane change models of autonomous vehicles are investigated in this paper. Along with the fundamental diagram, the number of lane changes and the number of conflicts are analyzed and studied as measures for improving road safety and efficiency. The study highlights that the autonomous vehicles' features that improve safety and efficiency in 100% autonomous and mixed traffic are different, and the ability of autonomous vehicles to switch between mixed and autonomous driving styles, and vice versa depending on the scenario, is necessary.
|
|
