Grad–Shafranov Reconstruction of Magnetic Clouds: Overview and Improvements

The Grad–Shafranov reconstruction is a method of estimating the orientation (invariant axis) and cross section of magnetic flux ropes using the data from a single spacecraft. It can be applied to various magnetic structures such as magnetic clouds (MCs) and flux ropes embedded in the magnetopause and in the solar wind. We develop a number of improvements of this technique and show some examples of the reconstruction procedure of interplanetary coronal mass ejections (ICMEs) observed at 1 AU by the STEREO, Wind, and ACE spacecraft during the minimum following Solar Cycle 23. The analysis is conducted not only for ideal localized ICME events but also for non-trivial cases of magnetic clouds in fast solar wind. The Grad–Shafranov reconstruction gives reasonable results for the sample events, although it possesses certain limitations, which need to be taken into account during the interpretation of the model results.

Discriminative learning of Bayesian networks via factorized conditional log-likelihood

We propose an efficient and parameter-free scoring criterion, the factorized conditional log-likelihood (ˆfCLL), for learning Bayesian network classifiers. The proposed score is an approximation of the conditional log-likelihood criterion. The approximation is devised in order to guarantee decomposability over the network structure, as well as efficient estimation of the optimal parameters, achieving the same time and space complexity as the traditional log-likelihood scoring criterion. The resulting criterion has an information-theoretic interpretation based on interaction information, which exhibits its discriminative nature. To evaluate the performance of the proposed criterion, we present an empirical comparison with state-of-the-art classifiers. Results on a large suite of benchmark data sets from the UCI repository show that ˆfCLL-trained classifiers achieve at least as good accuracy as the best compared classifiers, using significantly less computational resources.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.

Costs and Benefits of a Shared Digital Long-Term Preservation System

This paper describes the cost-benefit analysis of digital long-term preservation (LTP) that was carried out in the context of the Finnish National Digital Library Project (NDL) in 2010. The analysis was based on the assumption that as many as 200 archives, libraries, and museums will share an LTP system. The term ‘system’ shall be understood as encompassing not only information technology, but also human resources, organizational structures, policies and funding mechanisms. The cost analysis shows that an LTP system will incur, over the first 12 years, cumulative costs of €42 million, i.e. an average of €3.5 million per annum. Human resources and investments in information technology are the major cost factors. After the initial stages, the analysis predicts annual costs of circa €4 million. The analysis compared scenarios with and without a shared LTP system. The results indicate that a shared system will have remarkable benefits. At the development and implementation stages, a shared system shows an advantage of €30 million against the alternative scenario consisting of five independent LTP solutions. During the later stages, the advantage is estimated at €10 million per annum. The cumulative cost benefit over the first 12 years would amount to circa €100 million.

Paradoxical reflection in quantum mechanics

This article concerns a phenomenon of elementary quantum mechanics that is quite counter-intuitive, very non-classical, and apparently not widely known: a quantum particle can get reflected at a downward potential step. In contrast, classical particles get reflected only at upward steps. The conditions for this effect are that the wave length is much greater than the width of the potential step and the kinetic energy of the particle is much smaller than the depth of the potential step. This phenomenon is suggested by non-normalizable solutions to the time-independent Schroedinger equation, and we present evidence, numerical and mathematical, that it is also indeed predicted by the time-dependent Schroedinger equation. Furthermore, this paradoxical reflection effect suggests, and we confirm mathematically, that a quantum particle can be trapped for a long time (though not forever) in a region surrounded by downward potential steps, that is, on a plateau.

Arabidopsis GRI is involved in the regulation of cell death induced by extracellular ROS

Reactive oxygen species (ROS) have important functions in plant stress responses and development. In plants, ozone and pathogen infection induce an extracellular oxidative burst that is involved in the regulation of cell death. However, very little is known about how plants can perceive ROS and regulate the initiation and the containment of cell death. We have identified an Arabidopsis thaliana protein, GRIM REAPER (GRI), that is involved in the regulation of cell death induced by extracellular ROS. Plants with an insertion in GRI display an ozone-sensitive phenotype. GRI is an Arabidopsis ortholog of the tobacco flower-specific Stig1 gene. The GRI protein appears to be processed in leaves with a release of an N-terminal fragment of the protein. Infiltration of the N-terminal fragment of the GRI protein into leaves caused cell death in a superoxide-and salicylic acid-dependent manner. Analysis of the extracellular GRI protein yields information on how plants can initiate ROS-induced cell death during stress response and development.