Undervisning i forskningsetik

Abstract (Teaching in research ethics): The aim of this paper is to discuss teaching in research ethics. According to the guidelines issued by the National Advisory Board on Research Ethics in Finland (2002) the units providing researcher training have a duty to include good scientific practice and research ethics in this training. Various kinds of materials are needed in teaching in research ethics. One of them is fiction, which has appeared to be helpful in discussions of ethic problems. A number of examples taken from Finnish and Swedish fiction are discussed by referring to the above mentioned guidelines. The presentation is based on a chiasm, i.e. it goes from good scientific practice to fiction and further from fiction to teaching in research ethics.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Magnetically induced currents and magnetic response properties of molecules

The magnetically induced currents in organic monoring and multiring molecules, in Möbius shaped molecules and in inorganic all-metal molecules have been investigated by means of the Gauge-including magnetically induced currents (GIMIC) method. With the GIMIC method, the ring-current strengths and the ring-current density distributions can be calculated. For open-shell molecules, also the spin current can be obtained. The ring-current pathways and ring-current strengths can be used to understand the magnetic resonance properties of the molecules, to indirectly identify the effect of non-bonded interactions on NMR chemical shifts, to design new molecules with tailored properties and to discuss molecular aromaticity. In the thesis, the magnetic criterion for aromaticity has been adopted. According to this, a molecule which has a net diatropic ring current might be aromatic. Similarly, a molecule which has a net paratropic current might be antiaromatic. If the net current is zero, the molecule is nonaromatic. The electronic structure of the investigated molecules has been resolved by quantum chemical methods. The magnetically induced currents have been calculated with the GIMIC method at the density-functional theory (DFT) level, as well as at the self-consistent field Hartree-Fock (SCF-HF), at the Møller-Plesset perturbation theory of the second order (MP2) and at the coupled-cluster singles and doubles (CCSD) levels of theory. For closed-shell molecules, accurate ring-current strengths can be obtained with a reasonable computational cost at the DFT level and with rather small basis sets. For open-shell molecules, it is shown that correlated methods such as MP2 and CCSD might be needed to obtain reliable charge and spin currents. The basis set convergence has to be checked for open-shell molecules by performing calculations with large enough basis sets. The results discussed in the thesis have been published in eight papers. In addition, some previously unpublished results on the ring currents in the endohedral fullerene Sc3C2@C80 and in coronene are presented. It is shown that dynamical effects should be taken into account when modelling magnetic resonance parameters of endohedral metallofullerenes such as Sc3C2@C80. The ring-current strengths in a series of nano-sized hydrocarbon rings are related to static polarizabilities and to H-1 nuclear magnetic resonance (NMR) shieldings. In a case study on the possible aromaticity of a Möbius-shaped [16]annulene we found that, according to the magnetic criterion, the molecule is nonaromatic. The applicability of the GIMIC method to assign the aromatic character of molecules was confirmed in a study on the ring currents in simple monocylic aromatic, homoaromatic, antiaromatic, and nonaromatic hydrocarbons. Case studies on nanorings, hexaphyrins and [n]cycloparaphenylenes show that explicit calculations are needed to unravel the ring-current delocalization pathways in complex multiring molecules. The open-shell implementation of GIMIC was applied in studies on the charge currents and the spin currents in single-ring and bi-ring molecules with open shells. The aromaticity predictions that are made based on the GIMIC results are compared to other aromaticity criteria such as H-1 NMR shieldings and shifts, electric polarizabilities, bond-length alternation, as well as to predictions provided by the traditional Hückel (4n+2) rule and its more recent extensions that account for Möbius twisted molecules and for molecules with open shells.

Optimal explicit guidance of multistage launch vehicle along three-dimensional trajectory

Details of an efficient optimal closed-loop guidance algorithm for a three-dimensional launch are presented with simulation results. Two types of orbital injections, with either true anomaly or argument of perigee being free at injection, are considered. The resulting steering-angle profile under the assumption of uniform gravity lies in a canted plane which transforms a three-dimensional problem into an equivalent two-dimensional one. Effects of thrust are estimated using a series in a recursive way. Encke's method is used to predict the trajectory during powered flight and then to compute the changes due to actual gravity using two gravity-related vectors. Guidance parameters are evaluated using the linear differential correction method. Optimality of the algorithm is tested against a standard ground-based trajectory optimization package. The performance of the algorithm is tested for accuracy, robustness, and efficiency for a sun-synchronous mission involving guidance for a multistage vehicle that requires large pitch and yaw maneuver. To demonstrate applicability of the algorithm to a range of missions, injection into a geostationary transfer orbit is also considered. The performance of the present algorithm is found to be much better than others.

Analysis of the evanescent field coupling between a fiber and a planar waveguide using the explicit finite difference method with a nonuniform mesh (Journal Paper)

We investigate an optical waveguide system consisting of an unclad fiber core suspended at a constant distance parallel to the surface of a planar waveguide. The coupling and propagation of light in the combined system is studied using the three-dimensional explicit finite difference beam propagation method with a nonuniform mesh configuration. The power loss in the fiber and the field distribution in the waveguide are studied as a function of various parameters, such as index changes, index profile, and propagation distance, for the combined system.

Optimal explicit terminal guidance for a launch vehicle

It is observed that general explicit guidance schemes exhibit numerical instability close to the injection point. This difficulty is normally attributed to the demand for exact injection which, in turn, calls for finite corrections to be enforced in a relatively short time. The deviations in vehicle state which need corrective maneuvers are caused by the off-nominal operating conditions. Hence, the onset of terminal instability depends on the type of off-nominal conditions encountered. The proposed separate terminal guidance scheme overcomes the above difficulty by minimizing a quadratic penalty on injection errors rather than demanding an exact injection. There is also a special requirement in the terminal phase for the faster guidance computations. The faster guidance computations facilitate a more frequent guidance update enabling an accurate terminal thrust cutoff. The objective of faster computations is realized in the terminal guidance scheme by employing realistic assumptions that are accurate enough for a short terminal trajectory. It is observed from simulations that one of the guidance parameters (P) related to the thrust steering angular rates can indicate the onset of terminal instability due to different off-nominal operating conditions. Therefore, the terminal guidance scheme can be dynamically invoked based on monitoring of deviations in the lone parameter P.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

On the explicit determination of the polar decomposition in n-dimensional vector spaces

A method for the explicit determination of the polar decomposition (and the related problem of finding tensor square roots) when the underlying vector space dimension n is arbitrary (but finite), is proposed. The method uses the spectral resolution, and avoids the determination of eigenvectors when the tensor is invertible. For any given dimension n, an appropriately constructed van der Monde matrix is shown to play a key role in the construction of each of the component matrices (and their inverses) in the polar decomposition.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit and Optimal Codes for Distributed Storage

In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing � symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading �symbols from each of them. Our goal is to minimize the repair bandwidth d�. In this paper we provide explicit constructions for several parameter sets of interest.

Explicit filtering LES for turbulent non-premixed combustion

Two models for large eddy simulation of turbulent reacting flow in homogeneous turbulence were studied. The sub-grid stress arising out of non-linearities of the Navier-Stokes equations were modeled using an explicit filtering approach. A filtered mass density function (FMDF) approach was used for closure of the sub-grid scalar fluctuations. A posteriori calculations, when compared with the results from the direct numerical simulation, indicate that the explicit filtering is adequate in representing the effect of sub-grid stress on the filtered velocity field in the absence of reaction. Discrepancies arise when reactions occur, but the FMDF approach suffices to account for sub-grid scale fluctuations of the reacting scalars, accurately.