Den brændende Fakkel : Om dobbeltgrebet i Knud Lyne Rahbeks liv og revolutionsroman

Professor Knud Lyne Rahbek was a novelist, playwright, poet, magazine editor, journalist, socialite person, host of the Bakkehus , historian, theatre manager, translator, publisher etc., but his versatility either side of 1800 is better known than read and more despised than understood. In terms of methodology, the thesis is based on biographical, historical and philological research, while at the same time making use of formalistic and close reading methods. This study begins and ends with 7th of February 1800, when Kamma and Knud Lyne Rahbek join the exiled P.A. Heiberg at the inn near Frederiksberg Castle. What falls between is an interpretation of Rahbek s works in the service of democracy, human rights and freedom of the press as a pragmatic navigation between activities - both subversive and legitimate. Posterity mistook this range as mere spinelessness, and Rahbek was relegated to the literary and historical margins as an anachronism and as a jack of all trades, who did not know what he really wanted and therefore flitted about in so many fields just to be present. But Rahbek s problem was not one of standpoint, but rather how to find a balance between totalizing attitudes and confrontations between rebellious idealism and deep-rooted absolutism, without foregoing his belief in enlightenment, humanism and tolerance. In this way, and also through his personal conduct, which at that time was seen as jovial bonhommie, he made his contribution to the development of modern democratic Denmark in the full awareness of a popular, peaceful and down-to-earth community. Rahbek s principal work about the event of the French Revolution, which provides the focus for the above, is Camill og Constance. Et Revolutions Skilderie (1799). For today s reader, the novel about the revolution is an obvious example of a historical novel, as it does not only provide fictionalized information about past events placing them in a generally accepted perspective of historical development, but also gives the characters qualities, which, in Rahbek s words, allows the real events to influence the fictional characters. From this point of view, the novel of the revolution has shifted the benchmark for the first real historical novel on the European literary scene back by fifteen years. Lacking the aura so easily foisted on fearless iconoclasts or tragic losers, Rahbek s contribution may seem modest in spite of its enormous volume; but only when it is not evaluated in its full context, which is the development of Denmark towards an international democratic society.

Aritmetiikasta algebraan : Muutoksia osaamisessa peruskoulun päättöluokalla 20 vuoden aikana

From Arithmetic to Algebra. Changes in the skills in comprehensive school over 20 years. In recent decades we have emphasized the understanding of calculation in mathematics teaching. Many studies have found that better understanding helps to apply skills in new conditions and that the ability to think on an abstract level increases the transfer to new contexts. In my research I take into consideration competence as a matrix where content is in a horizontal line and levels of thinking are in a vertical line. The know-how is intellectual and strategic flexibility and understanding. The resources and limitations of memory have their effects on learning in different ways in different phases. Therefore both flexible conceptual thinking and automatization must be considered in learning. The research questions that I examine are what kind of changes have occurred in mathematical skills in comprehensive school over the last 20 years and what kind of conceptual thinking is demonstrated by students in this decade. The study consists of two parts. The first part is a statistical analysis of the mathematical skills and their changes over the last 20 years in comprehensive school. In the test the pupils did not use calculators. The second part is a qualitative analysis of the conceptual thinking of pupils in comprehensive school in this decade. The study shows significant differences in algebra and in some parts of arithmetic. The largest differences were detected in the calculation skills of fractions. In the 1980s two out of three pupils were able to complete tasks with fractions, but in the 2000s only one out of three pupils were able to do the same tasks. Also remarkable is that out of the students who could complete the tasks with fractions, only one out of three pupils was on the conceptual level in his/her thinking. This means that about 10% of pupils are able to understand the algebraic expression, which has the same isomorphic structure as the arithmetical expression. This finding is important because the ability to think innovatively is created when learning the basic concepts. Keywords: arithmetic, algebra, competence

Hautamuistomerkki elämän ja kuoleman tulkitsijana : Heikki Häiväojan, Kain Tapperin ja Matti Peltokankaan tekemät hautamuistomerkit 1952-2002

Grave sculpture as interpreter of life and death. Grave sculptures done by Heikki Häiväoja, Kain Tapper and Matti Peltokangas 1952-2002. The thoughts of Philippe Ariès and Erwin Panofsky on western funeral art constitute the starting point of this study. These scholars speak about the 20th century as a period of decline regarding western funeral art. The reason for this situation lies, according to them, in the fact that death has been rejected and become a private affair in modern society. Especially Panofsky sees an important reason for the decay of funeral art also in the separation of death from religion. In this study, I approach the view of Ariès and Panofsky from the angle of Finnish funeral art. The subject of the study is grave sculptures of three Finnish sculptors: Heikki Häiväoja, Kain Tapper and Matti Peltokangas, from 1952 to 2002. (The analysis of the grave sculptures has been performed with the Iconology of Erwin Panofsky. The analysis has been deepened by the ideas of a graveyard as a semiotic text according to Werner Enninger and Christa Schwens. In order to confirm their argumentation, they analyse the graveyard text with the model of communicative functions of Roman Jakobson and verify that the graveyard is a cultural text according to Juri Lotman.) Results of the study In the grave sculptures of the sculptors, different worldviews appear alongside Christian thoughts indicating a new stage in the tradition of funeral art. In the grave sculptures characterised as Christian, the view of life after death is included. In these memorials the direction of life is prospective, pointing to the life beyond. Death is a border, beyond which one is unable to see. Nevertheless the border is open or marked by the cross. On this open border, death is absence of pain, glory and new unity. In memorials with different worldviews, the life beyond is a possibility which is not excluded. Memorials interpret life retrospectively; life is a precious memory which wakens grief and longing. Many memorials have metaphysical and mystic features. In spite of democratization the order and valuation of social classes appear in some memorials. The old order also materializes in the war memorials relating the same destiny of the deceased. Different burial places, nevertheless, do not indicate social inequality but are rather signs of diversity. The sculptors' abstract means of modern funeral art deepen the handling of the subject matter of death and reveal the mystery of it. Grave sculptures are a part of Finnish and sacral modern art, and there is an interaction between funeral art and modern art. Modern art acquires a new dimension, when grave sculptures become a part of its field. Grave sculptures offer an alternative to anonymous burying. The memorial is a sign of the end of life; it gives death significance and publicity and creates a relation to the past of the society. In this way, grave sculptures are a part of the chain of memory of the western funeral art, which extends throughout Antiquity until ancient Egypt. (In this study I have spoken of funeral art as a chain of memory using the thoughts of Danièle Hervieu-Léger.) There are no signs of decay in the grave sculptures, on the contrary the tradition of funeral art continues in them as a search for the meaning of life and death and as an intuitive interpretation of death. As such, grave sculptures are part of the Finnish discussion of death.

Kiista, eheys, unohdus : Vapaussodan muistaminen suojeluskunnan ja veteraaniliikkeen toiminnassa 1918-1944

Conflict, Unity, Oblivion: Commemoration of the Liberation War by the Civic Guard and the Veterans´ Union in 1918-1944 The Finnish Civil War ended in May 1918 as a victory for the white side. The war was named by the winners as the Liberation War and its legacy became a central theme for public commemorations during the interwar period. At the same time the experiences of the defeated were hindered from becoming a part of the official history of Finland. The commemoration of the war was related not only to the war experience but also to a national mission, which was seen fulfilled with the independence of Finland. Although the idea of the commemoration was to form a unifying non-political scene for the nation, the remembrance of the Liberation War rather continued than sought to reconcile to the conflict of 1918. The outbreak of the war between the Soviet Union and Finland in 1939 immediately affected the memory culture. The new myth of the Miracle of the Winter War, which referred to the unity shown by the people, required a marginalization of controversial memory of the Liberation War. This study examines from the concepts of public memory and narrative templates how the problematic experience of a civil war developed to a popular public commemoration. Instead of dealing with the manipulative and elite-centered grandiose commemoration projects, the study focuses on the more modest local level and emphasizes the significance of local memory agents and narrative templates of collective memory. The main subjects in the study are the Civil Guard and the Veterans´ Union. Essential for the widespread movement was the development of the Civic Guard from a wartime organization to a peacetime popular movement. The guards, who identified themselves trough the memories and the threats of civil war, formed a huge network of memory agents in every corner of the country. They effectively linked both local memory with official memory and the civic society with the state level. Only with the emergence of the right wing veteran movement in the 30ies did the tensions grow between the two levels of public memory. The study shows the diversity of the commemoration movement of the Liberation War. It was not only a result of a nation-state project and political propaganda, but also a way for local communities to identify and strengthen themselves in a time of political upheaval and uncertainty.

Single-Generation Network Coding for Networks with Delay

A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.

MFIS and MFS structures using SrBi2Ta2O9 thin films for the FRAM applications

Recently there is an increasing demand and extensive research on high density memories, in particular to the ferroelectric random access memory composed of 1T/1C (1 transistor/1 capacitor) or 2T/2C. FRAM's exhibit fast random acess in read/write mode, non - volatility and low power for good performance. An integration of the ferroelectric on Si is the key importance and in this regard, there had been various models proposed like MFS, MFIS, MFMIS structure etc., Choosing the proper insulator is very essential for the better performance of the device and to exhibit excellent electrical characteristics. ZrTiO4 is a potential candidate because of its excellent thermal stability and lattice match on the Si substrate. SrBi2Ta2O9 and ZrTiO4 thin films were prepared on p - type Si substrate by pulsed excimer laser ablation technique. Optimization of both ZT and SBT thin films in MFS and MFIS structure had been done based on the annealing, oxygen partial pressures and substrate temperatures to have proper texture of the thin films. The dc leakage current, P - E hysteresis, capacitance - voltage and conductance - voltage measurement were carried out. The effect of the frequency dependence on MFIS structure was observed in the C – V curve. It displays a transition of C - V curve from high frequency to low frequency curve on subjection to varied frequencies. Density of interface states has been calculated using Terman and high - low frequency C - V curve. The effect of memory window in the C - V hysteresis were analysed in terms of film thickness and annealing temperatures. DC conduction mechanism were analysed in terms of poole - frenkel, Schottky and space charge limited conduction separately on MFS, MIS structure.

MFIS and MFS structures using SrBi2Ta2O9 thin films for the FRAM applications

Recently there is an increasing demand and extensive research on high density memories, in particular to the ferroelectric random access memory composed of 1T/1C (1 transistor/1 capacitor) or 2T/2C. FRAM's exhibit fast random acess in read/write mode, non - volatility and low power for good performance. An integration of the ferroelectric on Si is the key importance and in this regard, there had been various models proposed like MFS, MFIS, MFMIS structure etc., Choosing the proper insulator is very essential for the better performance of the device and to exhibit excellent electrical characteristics. ZrTiO4 is a potential candidate because of its excellent thermal stability and lattice match on the Si substrate. SrBi2Ta2O9 and ZrTiO4 thin films were prepared on p - type Si substrate by pulsed excimer laser ablation technique. Optimization of both ZT and SBT thin films in MFS and MFIS structure had been done based on the annealing, oxygen partial pressures and substrate temperatures to have proper texture of the thin films. The dc leakage current, P - E hysteresis, capacitance - voltage and conductance - voltage measurement were carried out. The effect of the frequency dependence on MFIS structure was observed in the C – V curve. It displays a transition of C - V curve from high frequency to low frequency curve on subjection to varied frequencies. Density of interface states has been calculated using Terman and high - low frequency C - V curve. The effect of memory window in the C - V hysteresis were analysed in terms of film thickness and annealing temperatures. DC conduction mechanism were analysed in terms of poole - frenkel, Schottky and space charge limited conduction separately on MFS, MIS structure.

MODLEX: A Multi Objective Data Layout EXploration Framework for Embedded Systems-on-Chip

The memory subsystem is a major contributor to the performance, power, and area of complex SoCs used in feature rich multimedia products. Hence, memory architecture of the embedded DSP is complex and usually custom designed with multiple banks of single-ported or dual ported on-chip scratch pad memory and multiple banks of off-chip memory. Building software for such large complex memories with many of the software components as individually optimized software IPs is a big challenge. In order to obtain good performance and a reduction in memory stalls, the data buffers of the application need to be placed carefully in different types of memory. In this paper we present a unified framework (MODLEX) that combines different data layout optimizations to address the complex DSP memory architectures. Our method models the data layout problem as multi-objective genetic algorithm (GA) with performance and power being the objectives and presents a set of solution points which is attractive from a platform design viewpoint. While most of the work in the literature assumes that performance and power are non-conflicting objectives, our work demonstrates that there is significant trade-off (up to 70%) that is possible between power and performance.

A generalized network alignment for three-source three-destination multiple unicast networks with delays

The concept of interference alignment when extended to three-source three-destination instantaneous multiple unicast network for the case where, each source-destination pair has a min-cut of 1 and zero-interference conditions are not satisfied, is known to achieve a rate of half for every source-destination pair under certain conditions [6]. This was called network alignment. We generalize this concept of network alignment to three-source three-destination multiple unicast (3S-3D-MU) networks with delays, without making use of memory at the intermediate nodes (i.e., nodes other than the sources and destinations) and using time varying Local Encoding Kernels (LEKs). This achieves half the rate corresponding to the individual source-destination min-cut for some classes of 3S-3D-MU network with delays which do not satisfy the zero-interference conditions.

Row-buffer reorganization: simultaneously improving performance and reducing energy in DRAMs

In this paper, based on the temporal and spatial locality characteristics of memory accesses in multicores, we propose a re-organization of the existing single large row buffer in a DRAM bank into multiple smaller row-buffers. The proposed configuration helps improve the row hit rates and also brings down the energy required for row-activations. The major contribution of this work is proposing such a reorganization without requiring any significant changes to the existing widely accepted DRAM specifications. Our proposed reorganization improves performance by 35.8%, 14.5% and 21.6% in quad, eight and sixteen core workloads along with a 42%, 28% and 31% reduction in DRAM energy. Additionally, we introduce a Need Based Allocation scheme for buffer management that shows additional performance improvement.

Interdependent cache analyses for better precision and safety

One of the challenges for accurately estimating Worst Case Execu-tion Time(WCET) of executables is to accurately predict their cache behaviour. Various techniques have been developed to predict the cache contents at different program points to estimate the execution time of memory-accessing instructions. One of the most widely used techniques is Abstract Interpretation based Must Analysis, which de-termines the cache blocks guaranteed to be present in the cache, and hence provides safe estimation of cache hits and misses. However,Must Analysis is highly imprecise, and platforms using Must Analysis have been known to produce blown-up WCET estimates. In our work, we propose to use May Analysis to assist the Must Analysis cache up-date and make it more precise. We prove the safety of our approach as well as provide examples where our Improved Must Analysis provides better precision. Further, we also detect a serious flaw in the original Persistence Analysis, and use Must and May Analysis to assist the Persistence Analysis cache update, to make it safe and more precise than the known solutions to the problem.

Multiple sub-row buffers in DRAM: unlocking performance and energy improvement opportunities

The twin demands of energy-efficiency and higher performance on DRAM are highly emphasized in multicore architectures. A variety of schemes have been proposed to address either the latency or the energy consumption of DRAMs. These schemes typically require non-trivial hardware changes and end up improving latency at the cost of energy or vice-versa. One specific DRAM performance problem in multicores is that interleaved accesses from different cores can potentially degrade row-buffer locality. In this paper, based on the temporal and spatial locality characteristics of memory accesses, we propose a reorganization of the existing single large row-buffer in a DRAM bank into multiple sub-row buffers (MSRB). This re-organization not only improves row hit rates, and hence the average memory latency, but also brings down the energy consumed by the DRAM. The first major contribution of this work is proposing such a reorganization without requiring any significant changes to the existing widely accepted DRAM specifications. Our proposed reorganization improves weighted speedup by 35.8%, 14.5% and 21.6% in quad, eight and sixteen core workloads along with a 42%, 28% and 31% reduction in DRAM energy. The proposed MSRB organization enables opportunities for the management of multiple row-buffers at the memory controller level. As the memory controller is aware of the behaviour of individual cores it allows us to implement coordinated buffer allocation schemes for different cores that take into account program behaviour. We demonstrate two such schemes, namely Fairness Oriented Allocation and Performance Oriented Allocation, which show the flexibility that memory controllers can now exploit in our MSRB organization to improve overall performance and/or fairness. Further, the MSRB organization enables additional opportunities for DRAM intra-bank parallelism and selective early precharging of the LRU row-buffer to further improve memory access latencies. These two optimizations together provide an additional 5.9% performance improvement.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

A Split-and-Merge Dictionary Learning Algorithm for Sparse Representation: Application to Image Denoising

In big data image/video analytics, we encounter the problem of learning an over-complete dictionary for sparse representation from a large training dataset, which cannot be processed at once because of storage and computational constraints. To tackle the problem of dictionary learning in such scenarios, we propose an algorithm that exploits the inherent clustered structure of the training data and make use of a divide-and-conquer approach. The fundamental idea behind the algorithm is to partition the training dataset into smaller clusters, and learn local dictionaries for each cluster. Subsequently, the local dictionaries are merged to form a global dictionary. Merging is done by solving another dictionary learning problem on the atoms of the locally trained dictionaries. This algorithm is referred to as the split-and-merge algorithm. We show that the proposed algorithm is efficient in its usage of memory and computational complexity, and performs on par with the standard learning strategy, which operates on the entire data at a time. As an application, we consider the problem of image denoising. We present a comparative analysis of our algorithm with the standard learning techniques that use the entire database at a time, in terms of training and denoising performance. We observe that the split-and-merge algorithm results in a remarkable reduction of training time, without significantly affecting the denoising performance.

A Stochastic Approximation Algorithm for Quantile Estimation

In this paper, we present two new stochastic approximation algorithms for the problem of quantile estimation. The algorithms uses the characterization of the quantile provided in terms of an optimization problem in 1]. The algorithms take the shape of a stochastic gradient descent which minimizes the optimization problem. Asymptotic convergence of the algorithms to the true quantile is proven using the ODE method. The theoretical results are also supplemented through empirical evidence. The algorithms are shown to provide significant improvement in terms of memory requirement and accuracy.