| 1. |
- Burch, J. L., et al.
(författare)
-
Electron-scale measurements of magnetic reconnection in space
- 2016
-
Ingår i: Science. - : AMER ASSOC ADVANCEMENT SCIENCE. - 0036-8075 .- 1095-9203. ; 352:6290, s. 1189-
-
Forskningsöversikt (refereegranskat)abstract
- Magnetic reconnection is a fundamental physical process in plasmas whereby stored magnetic energy is converted into heat and kinetic energy of charged particles. Reconnection occurs in many astrophysical plasma environments and in laboratory plasmas. Using measurements with very high time resolution, NASA's Magnetospheric Multiscale (MMS) mission has found direct evidence for electron demagnetization and acceleration at sites along the sunward boundary of Earth's magnetosphere where the interplanetary magnetic field reconnects with the terrestrial magnetic field. We have (i) observed the conversion of magnetic energy to particle energy; (ii) measured the electric field and current, which together cause the dissipation of magnetic energy; and (iii) identified the electron population that carries the current as a result of demagnetization and acceleration within the reconnection diffusion/dissipation region.
|
|
| 2. |
- Torbert, R. B., et al.
(författare)
-
Electron-scale dynamics of the diffusion region during symmetric magnetic reconnection in space
- 2018
-
Ingår i: Science. - : AMER ASSOC ADVANCEMENT SCIENCE. - 0036-8075 .- 1095-9203. ; 362:6421, s. 1391-1395
-
Tidskriftsartikel (refereegranskat)abstract
- Magnetic reconnection is an energy conversion process that occurs in many astrophysical contexts including Earth's magnetosphere, where the process can be investigated in situ by spacecraft. On 11 July 2017, the four Magnetospheric Multiscale spacecraft encountered a reconnection site in Earth's magnetotail, where reconnection involves symmetric inflow conditions. The electron-scale plasma measurements revealed (i) super-Alfvenic electron jets reaching 15,000 kilometers per second; (ii) electron meandering motion and acceleration by the electric field, producing multiple crescent-shaped structures in the velocity distributions; and (iii) the spatial dimensions of the electron diffusion region with an aspect ratio of 0.1 to 0.2, consistent with fast reconnection. The well-structured multiple layers of electron populations indicate that the dominant electron dynamics are mostly laminar, despite the presence of turbulence near the reconnection site.
|
|
| 3. |
- Björklund, Johanna, 1961-, et al.
(författare)
-
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- 2019
-
Ingår i: Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing. - : Association for Computational Linguistics. ; , s. 7-17
-
Konferensbidrag (refereegranskat)abstract
- We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs. These tree-to-graph transducers can serve as a formal basis of transition systems for semantic parsing which recently have been shown to perform very well, yet hitherto lack formalization. Our model features "extended" rules and an arc-factored normal form, comes with an efficient translation algorithm, and can be equipped with weights in a straightforward manner.
|
|
| 4. |
- Björklund, Johanna, 1961-, et al.
(författare)
-
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- 2021
-
Ingår i: Theoretical Computer Science. - : Elsevier. - 0304-3975 .- 1879-2294. ; 870, s. 3-28
-
Tidskriftsartikel (refereegranskat)abstract
- We develop a finite-state transducer for translating unranked trees into general graphs. This work is motivated by recent progress in semantic parsing for natural language, where sentences are first mapped into tree-shaped syntactic representations, and then these trees are translated into graph semantic representations. We investigate formal properties of our tree-to-graph transducers and develop a polynomial time algorithm for translating a weighted language of input trees into a packed representation, from which best-score graphs can be efficiently recovered.
|
|
| 5. |
|
|
| 6. |
|
|
