Looking-Glass Reflections : Norms in translating Lewis Carroll

This thesis in the field of translation studies focusses on the role of norms in the work of a literary translator. Norms are seen as guidelines for the translator; they also reflect the way the target audience either accepts or rejects the translation. Thus they are of an intersubjective nature. The theoretical background of the study is based on the views on norms of Andrew Chesterman and Gideon Toury. The writer makes use of her own editing and publishing experience, as well as her experience in translating Lewis Carroll, considering these in respect to theoretical views of norms and vice versa. The aim is also to bring to light some of the tacit knowledge related to translating, editing and publishing in Finland. The study has three angles. First, the writer introduces the norms of Finnish literary translation as gathered from her own working experience. The sources from which these norms arise and which affect them are briefly described. Six central translation norms emerge; they are described and exemplified through cases of Carroll translation. Secondly, a small-scale questionnaire study is presented. This was carried out in order to sound the normative views of other translators and to limit the role of subjectivity. The views of the informants largely support the set of norms presented by the writer, although the norms of quotability and harmony between translation and illustration do not arise. Instead, the answers give rise to a seventh, ethical norm, which is labelled the norm of integrity. Thirdly, there is a brief presentation of Lewis Carroll, his Alice books and their translation history in Finland. The retranslation hypothesis and the motives of retranslation are considered in the light of the work of Outi Paloposki and Kaisa Koskinen. The final part of the thesis plunges into actual translation work. It includes one and a half chapters of Through the Looking-Glass (Alicen seikkailut peilintakamaassa) as translated into Finnish by the writer. The translation commentary first discusses a number of recurring and general translation points; the running commentary then analyses 77 individual translation solutions and their justifications. The writer uses introspection as a way of reflecting on her own translation process, its decisive points and the role of norms therein. Keywords: Translation studies, Carroll, norms

Vänner, kolleger och gynnare : Namngivningen av de finska fästningsverken under Augustin Ehrensvärds tid

Under 1700-talets andra hälft hörde Sveriges nya fästningar i öst (Helsingfors, Sveaborg, Lovisa och Svartholm) till rikets största satsningar. Fästningsprojektet leddes med undantag av ett par avbrott av Augustin Ehrensvärd (1710 1772). När arbetet tog fart namngavs de enskilda fästningsverken i så gott som alla fall efter samtida personer. Under Ehrensvärds tid tillämpades denna namngivning på omkring femtio av Sveaborgs och Helsingfors fästningsverk samt på Lovisas och Svartholms totalt aderton verk. Genom personerna de knöts till berättar namnen en hel del om Augustin Ehrensvärds samtid och omvärld. Hur de gjorde det är denna avhandlings huvudfråga. Källmaterialet utgörs av relationsritningar och brev, medan de teoretiska ramarna står att finna i nätverksteori och onomastiska teorier om namnmönster. Ehrensvärd förklarade sin namngivningspraxis för sin överordnade, tronföljaren Adolf Fredrik, 1749 i samband med att Gustavssvärd med fästningsverk namngavs: tanken var att namnge bastioner efter de som bidragit till arbetets framgång och att namnge utanverk efter officerare vid fästningsbygget. Innebörden av Ehrensvärds ord framgår ur namnbeståndet. De största grupperna består av ämbetsmän och militärer. Med de som bidragit till arbetets framgång avsågs sålunda den lokala eliten: landshövdingar som involverats i fästningsbygget samt högre och lägre militärer som tjänstgjorde vid fästningarna. Redan från början syns en klar hierarki i namngivningen. Medan landshövdingarna och de högre militärerna tillägnades bastioner, fick de lägre officerarna se mindre fästningsverk namngivna efter sig, helt i enlighet med Ehrensvärds egen beskrivning. Utanför de ovan nämnda grupperna, hedrades en hel del personer som inte konkret hade engagerats i fästningsbygget. Denna namngivning kan förklaras å ena sidan inom ramen för Ehrensvärds sociala nätverk och å andra sidan mot bakgrund av riksdagspolitiken i frihetstidens Sverige. Av de två förklaringsmodeller bör Ehrensvärds personliga vänskaper ses som en bidragande orsak, medan de politiska motiven utgjorde en avgörande orsak. Som en del av Ehrensvärds nätverk kan de gynnare ses som hade stöttat Ehrensvärd under hans karriär samt hans närmaste medarbetare vid fästningsbygget, ofta officerer han själv handplockat. Namngivningens politiska aspekt syns i det stora antalet riksråd som tillägandes bastionnamn. Vid sidan om riksråden hedrades också talmän vid de samtida riksdagarna. En komparativ studie i namngivningen av fästningsverk vid samtida och äldre svenska fästningar framhäver Ehrensvärd som en innovativ namngivare. Fästningsverk namngivna efter kungligheter verkar ha varit en norm, som också Ehrensvärd anknöt till genom ett fåtal namn. Däremot var namn efter personer inte vanliga, vilket gav den Ehrensvärdska namngivningen en förhållandevis stark anknytning till samtiden. Denna aspekt bekräftas om namnen ses mot bakgrund av 1700-talets uppfattning om ära och äregirighetens samhälleliga nytta. I denna uppfattning syns bakgrunden till förekomsten av personer med både hög och låg status i Ehrensvärds namngivning. Sammanfattningsvis speglar namnen på de finska fästningsverken sin samtid genom den byråkratiska, militära och politiska elit de representerar samt genom motiveringen till dem.

Growing pseudo-eigenmodes and positive logarithmic norms in rotating shear flows

Rotating shear flows, when angular momentum increases and angular velocity decreases as functions of radiation coordinate, are hydrodynamically stable under linear perturbation. The Keplerian flow is an example of such a system, which appears in an astrophysical context. Although decaying eigenmodes exhibit large transient energy growth of perturbation which could govern nonlinearity in the system, the feedback of inherent instability to generate turbulence seems questionable. We show that such systems exhibiting growing pseudo-eigenmodes easily reach an upper bound of growth rate in terms of the logarithmic norm of the involved non-normal operators, thus exhibiting feedback of inherent instability. This supports the existence of turbulence of hydrodynamic origin in the Keplerian accretion disc in astrophysics. Hence, this answers the question of the mismatch between the linear theory and experimental/observed data and helps in resolving the outstanding question of the origin of turbulence therein.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

Decorrelation of broad band signals by toeplitz-block-toeplitz structuring

We propose F-norm of the cross-correlation part of the array covariance matrix as a measure of correlation between the impinging signals and study the performance of different decorrelation methods in the broadband case using this measure. We first show that dimensionality of the composite signal subspace, defined as the number of significant eigenvectors of the source sample covariance matrix, collapses in the presence of multipath and the spatial smoothing recovers this dimensionality. Using an upper bound on the proposed measure, we then study the decorrelation of the broadband signals with spatial smoothing and the effect of spacing and directions of the sources on the rate of decorrelation with progressive smoothing. Next, we introduce a weighted smoothing method based on Toeplitz-block-Toeplitz (TBT) structuring of the data covariance matrix which decorrelates the signals much faster than the spatial smoothing. Computer simulations are included to demonstrate the performance of the two methods.

Variable Sparsity Kernel Learning

This paper(1) presents novel algorithms and applications for a particular class of mixed-norm regularization based Multiple Kernel Learning (MKL) formulations. The formulations assume that the given kernels are grouped and employ l(1) norm regularization for promoting sparsity within RKHS norms of each group and l(s), s >= 2 norm regularization for promoting non-sparse combinations across groups. Various sparsity levels in combining the kernels can be achieved by varying the grouping of kernels-hence we name the formulations as Variable Sparsity Kernel Learning (VSKL) formulations. While previous attempts have a non-convex formulation, here we present a convex formulation which admits efficient Mirror-Descent (MD) based solving techniques. The proposed MD based algorithm optimizes over product of simplices and has a computational complexity of O (m(2)n(tot) log n(max)/epsilon(2)) where m is no. training data points, n(max), n(tot) are the maximum no. kernels in any group, total no. kernels respectively and epsilon is the error in approximating the objective. A detailed proof of convergence of the algorithm is also presented. Experimental results show that the VSKL formulations are well-suited for multi-modal learning tasks like object categorization. Results also show that the MD based algorithm outperforms state-of-the-art MKL solvers in terms of computational efficiency.

Performance analysis of a modified spatial smoothing technique for direction estimation

The statistical performance analysis of ESPRIT, root-MUSIC, minimum-norm methods for direction estimation, due to finite data perturbations, using the modified spatially smoothed covariance matrix, is developed. Expressions for the mean-squared error in the direction estimates are derived based on a common framework. Based on the analysis, the use of the modified smoothed covariance matrix improves the performance of the methods when the sources are fully correlated. Also, the performance is better even when the number of subarrays is large unlike in the case of the conventionally smoothed covariance matrix. However, the performance for uncorrelated sources deteriorates due to an artificial correlation introduced by the modified smoothing. The theoretical expressions are validated using extensive simulations. (C) 1999 Elsevier Science B.V. All rights reserved.

Data rectification and detection of trend shifts in jet engine path measurements using median filters and fuzzy logic

Filtering methods are explored for removing noise from data while preserving sharp edges that many indicate a trend shift in gas turbine measurements. Linear filters are found to be have problems with removing noise while preserving features in the signal. The nonlinear hybrid median filter is found to accurately reproduce the root signal from noisy data. Simulated faulty data and fault-free gas path measurement data are passed through median filters and health residuals for the data set are created. The health residual is a scalar norm of the gas path measurement deltas and is used to partition the faulty engine from the healthy engine using fuzzy sets. The fuzzy detection system is developed and tested with noisy data and with filtered data. It is found from tests with simulated fault-free and faulty data that fuzzy trend shift detection based on filtered data is very accurate with no false alarms and negligible missed alarms.

Surfaces of Bounded Mean Curvature In Riemannian Manifolds

Consider a sequence of closed, orientable surfaces of fixed genus g in a Riemannian manifold M with uniform upper bounds on the norm of mean curvature and area. We show that on passing to a subsequence, we can choose parametrisations of the surfaces by inclusion maps from a fixed surface of the same genus so that the distance functions corresponding to the pullback metrics converge to a pseudo-metric and the inclusion maps converge to a Lipschitz map. We show further that the limiting pseudo-metric has fractal dimension two. As a corollary, we obtain a purely geometric result. Namely, we show that bounds on the mean curvature, area and genus of a surface F subset of M, together with bounds on the geometry of M, give an upper bound on the diameter of F. Our proof is modelled on Gromov's compactness theorem for J-holomorphic curves.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.

Multigrid algorithms for symmetric discontinuous Galerkin methods on graded meshes

We study a class of symmetric discontinuous Galerkin methods on graded meshes. Optimal order error estimates are derived in both the energy norm and the L 2 norm, and we establish the uniform convergence of V-cycle, F-cycle and W-cycle multigrid algorithms for the resulting discrete problems. Numerical results that confirm the theoretical results are also presented.

Relay Precoder Optimization in MIMO-Relay Networks With Imperfect CSI

In this paper, we consider robust joint designs of relay precoder and destination receive filters in a nonregenerative multiple-input multiple-output (MIMO) relay network. The network consists of multiple source-destination node pairs assisted by a MIMO-relay node. The channel state information (CSI) available at the relay node is assumed to be imperfect. We consider robust designs for two models of CSI error. The first model is a stochastic error (SE) model, where the probability distribution of the CSI error is Gaussian. This model is applicable when the imperfect CSI is mainly due to errors in channel estimation. For this model, we propose robust minimum sum mean square error (SMSE), MSE-balancing, and relay transmit power minimizing precoder designs. The next model for the CSI error is a norm-bounded error (NBE) model, where the CSI error can be specified by an uncertainty set. This model is applicable when the CSI error is dominated by quantization errors. In this case, we adopt a worst-case design approach. For this model, we propose a robust precoder design that minimizes total relay transmit power under constraints on MSEs at the destination nodes. We show that the proposed robust design problems can be reformulated as convex optimization problems that can be solved efficiently using interior-point methods. We demonstrate the robust performance of the proposed design through simulations.

Subspace-based DOA estimation using Fractional Lower Order statistics

Direction Of Arrival (DOA) estimation, using a sensor array, in the presence of non-Gaussian noise using Fractional Lower-Order Moments (FLOM)matrices is studied. In this paper, a new FLOM based technique using the Fractional Lower Order Infinity Norm based Covariance (FLIC) Matrix is proposed. The bounded property and the low-rank subspace structure of the FLIC matrix is derived. Performance of FLIC based DOA estimation using MUSIC, ESPRIT, is shown to be better than other FLOM based methods.

Robust Observer Design with Application to Fault Detection

A new scheme for robust estimation of the partial state of linear time-invariant multivariable systems is presented, and it is shown how this may be used for the detection of sensor faults in such systems. We consider an observer to be robust if it generates a faithful estimate of the plant state in the face of modelling uncertainty or plant perturbations. Using the Stable Factorization approach we formulate the problem of optimal robust observer design by minimizing an appropriate norm on the estimation error. A logical candidate is the 2-norm, corresponding to an H�¿ optimization problem, for which solutions are readily available. In the special case of a stable plant, the optimal fault diagnosis scheme reduces to an internal model control architecture.