Monumenttikuvista elämyskuviin : Helsinki matkaesitteiden kuvituksessa 1895 - 2005

The purpose of this study is to define how Helsinki has been presented in the pictures of tourist brochures and how their illustration has changed over time. Attention is also paid to the values and meanings that the pictures mediate, as well as their historical and societal connections. The pictures are approached as representations selectively interpreting and illustrating the reality of Helsinki, while constructing mental images of it. An iconological framework structures the study. It proceeds from the description and classification of the physical features towards an analysis of time- and culture-specific meanings. The emergence of meanings and their historical and cultural underpinnings are examined from the perspectives of humanistic geography, semiotics and constructionism. In the analysis attention is paid to the discourses, myths and ideologies that underlie the representations. Information on the physical features of the pictures and their changes is collected with a content analysis. The classified data consists of 1377 photographs. These pictures are collected from 75 tourist brochures of Helsinki that have been published between 1895 and 2005. The deeper meanings of the pictures are studied qualitatively, by paying attention to the mental images that the content elements and visual effects evoke. Research studies, contemporary literature and the texts of the tourist brochures are utilised in the interpretation of the meanings. There has been a permanent core to objects of the pictures during the entire study period. It has consisted mainly of sights that are located close to the Senate and Market Squares. In addition, marine elements have been popular. The area of Helsinki represented in the brochures has extended from the Senate Square towards Töölö Bay. Pictures of monumental buildings and statues have been complemented with snapshots and portraits. In the beginning of the 20th century, brochures were mainly produced for the travelling, educated elite. The style of the pictures was declaratory and educative. They aimed at medating an objective image of the reality that prevailed in Helsinki. In practice, the pictures were connected to a patriotic ideology and the corresponding myth of Finnishness. In the second half of the 20th century the improvement of the standard of living led to a democratisation of consumers and an increase in the tourism demand. Local culture and the everyday life of "ordinary" people became popular themes in the pictures. A new welfare ideology manifested itself in the people of the local residential areas, for instance. The increase in the cultural diversity has led to the recognition of new target groups, expecially since the 1980s. The human figures in the pictures have started to function as objects of identification and a means of constructing mental images. A pronounced emphasis on experience and individuality in the illustration of the tourist brochures mirrors the post-modern change and a new ideology based on consumption. The construction and consumption of the pictures in the tourist brochures is governed by the conventions of representation and interpretaion that are typical of the genre of tourist brochures. The pictures emphasize the perceived positive characteristics of Helsinki and thus construct a skewed view of the reality. However, consumers can knowingly use the pictures as a means of dreaming and detaching themselves from their everyday reality.

Path integral description of polymers using fractional Brownian walks

The statistical properties of fractional Brownian walks are used to construct a path integral representation of the conformations of polymers with different degrees of bond correlation. We specifically derive an expression for the distribution function of the chains’ end‐to‐end distance, and evaluate it by several independent methods, including direct evaluation of the discrete limit of the path integral, decomposition into normal modes, and solution of a partial differential equation. The distribution function is found to be Gaussian in the spatial coordinates of the monomer positions, as in the random walk description of the chain, but the contour variables, which specify the location of the monomer along the chain backbone, now depend on an index h, the degree of correlation of the fractional Brownian walk. The special case of h=1/2 corresponds to the random walk. In constructing the normal mode picture of the chain, we conjecture the existence of a theorem regarding the zeros of the Bessel function.

Löydöstä muinaispuvuksi : arkeologisten tekstiilien ennallistaminen

From a find to an ancient costume - reconstruction of archaeological textiles Costume tells who we are. It warms and protects us, but also tells about our identity: gender, age, family, social group, work, religion and ethnicity. Textile fabrication, use and trade have been an important part of human civilization for more than 10 000 years. There are plenty of archaeological textile findings, but they are small, fragmentary and their interpretation requires special skills. Finnish textile findings from the younger Iron Age have already been studied for more than hundred years. They have also been used as a base for several reconstructions called muinaispuku , ancient costume. Thesis surveys the ancient costume reconstruction done in Finland and discusses the objectives of the reconstruction projects. The earlier reconstruction projects are seen as a part of the national project of constructing a glorious past for Finnish nationality, and the part women took in this project. Many earlier reconstructions are designed to be festive costumes for wealthy ladies. In the 1980s and 1990s many new ancient costume reconstructions were made, differing from their predecessors at the pattern of the skirt. They were also done following the principles of making a scientific reconstruction more closely. At the same time historical re-enactment and living history as a hobby have raised in popularity, and the use of ancient costumes is widening from festive occasions to re-enactment purposes. A hypothesis of the textile craft methods used in younger Iron Age Finland is introduced. Archaeological findings from Finland and neighboring countries, ethnological knowledge of textile crafts and experimental archaeology have been used as a basis for this proposition. The yarn was spinned with a spindle, the fabrics woven on a warp-weighted loom and dyed with natural colors. Bronze spiral applications and complicated tablet-woven bands have possibly been done by specialist craftswomen or -men. The knowledge of the techniques and results of experimenting and experimental archaeology gives a possibility to review the success of existing ancient costume reconstructions as scientific reconstructions. Only one costume reconstruction project, the Kaarina costume fabricated in Kurala Kylämäki museum, has been done using as authentic methods as possible. The use of ancient craft methods is time-consuming and expensive. This fact can be seen as one research result itself for it demonstrates how valuable the ancient textiles have been also in their time of use. In the costume reconstruction work, the skill of a craftswoman and her knowledge of ancient working methods is strongly underlined. Textile research is seen as a process, where examination of original textiles and reconstruction experiments discuss with each other. Reconstruction projects can give a lot both to the research of Finnish younger Iron Age and the popularization of archaeological knowledge. The reconstruction is never finished, and also the earlier reconstructions should be reviewed in the light of new findings.

Sosiaaliturvan ulkopuolella - kokemuksia kansalaisuuden reunalta

Muuttaessaan maasta toiseen ihminen kohtaa useita rajoja. Ylittäessään kohdemaan valtion rajan hän kulkee läpi ensimmäisestä maahanmuuton portista. Toinen raja erottaa tilapäiset asukkaat pysyvistä: tämän maahanmuuton toisen portin läpikulkemisen myötä yksilö pääsee osalliseksi sosiaalisista oikeuksista. Maahanmuuton viimeisestä portista kuljettuaan yksilö saavuttaa kyseisen valtion kansalaisuuden. (Hammar 1990, 21.) Tässä pro gradu -tutkielmassa tarkastelen toisen maahanmuuton portin aukeamista ja sosiaaliturvan piiriin pääsyä odottavien maahan-muuttajien kokemuksia. Käytän tarkastelussa sosiaalisen kansalaisuuden ja marginaalisuuden käsitteitä. Tutkielmassa selvitän, miten sosiaali- ja terveyspalveluiden sekä toimeentuloturvan ulkopuolelle jääminen vaikuttaa maahanmuuttajien arkeen ja miten he kokevat osallisuutensa ja jäsenyytensä yhteiskunnassa. Tutkimus on lähtökohdiltaan fenomenologis-hermeneuttinen ja sovellan lähestymistapana ko-kemuksiin keskittyvän narratiivista tutkimusta. Tutkimusaineisto on koottu kevään 2011 aikana ja se koostuu 10 teemahaastattelusta. Haastateltavien maahanmuuton keinot ja syyt vaihtelivat: he olivat saapuneet Suomeen perhesyistä, työn vuoksi tai hakeakseen turvaa. Haastateltavat tavoitettiin Helsingin Diakoniaopiston, Pro-tukipisteen, Kansainvälisen seurakunnan ja tuttava-verkostojen kautta. Aineiston analyysi toteutettiin sisällönanalyysillä Atlas-ohjelman avulla syksyn 2011 aikana. Toisen maahanmuuton portin aukeamisen odottaminen oli raskaaksi: tuota aikaa leimasi epä-varmuus, tyhjyys ja yksinäisyys. Sosiaaliturvan ulkopuolella jääminen aiheutti osalle haastatel-tavista taloudellisia vaikeuksia sekä ongelmia terveydenhuollon palveluiden piiriin pääsemisessä. Toisaalta apua hakeneet haastateltavat olivat sitä lopulta saaneet. Auttamistyön ammattilaiset ja maistraatti saivat haastateltavien kertomuksissa portinvartijan aseman. Kaikille sosiaaliturvan ulkopuolelle jääminen ei ollut ongelma vaan he kokivat sosiaaliturvan puutetta suuremmaksi ongelmaksi työnteko-oikeuden puuttumisen. Kuulumisen ja ulkopuolisuuden kokemus voivat olla läsnä samanaikaisesti, ja kuulumisesta neuvotellaan jatkuvasti esimerkiksi sosiaalisessa kanssakäymisessä tai palveluita hakiessa. Insti-tutionaaliset käytännöt ja poiskäännyttämisen kokemukset tuottavat marginaalisia identiteettejä. Tasavertainen oikeus sosiaaliturvaan vahvistaa kokemusta kuulumisesta ja kodista. Sosiaaliturva ei kuitenkaan yksin määritä kuulumisen ja kodin kokemusta vaan siihen vaikuttavat myös muut tekijät. Näistä tärkeimmät ovat kehon fyysinen sijoittuminen Suomeen, perhe- ja ystä-vyyssuhteet, työ, asunto ja rasismin kokemukset.

The Design and Construction of Synthetic Protein Mimics

A strategy for the modular construction of synthetic protein mimics based on the ability non-protein amino acids to act as stereochemical directors of polypeptide chain folding, is described. The use of alpha-aminoisobutyric acid (Aib) to construct stereochemically rigid helices has been exemplified by crystallographic and spectroscopic studies of several apolar peptides, ranging in length from seven to sixteen residues. The problem of linker design in elaborating alpha,alpha motifs has been considered. Analysis of protein crystal structure data provides a guide to choosing linking sequences. Attempts at constructing linked helical motifs using linking Gly-Pro segments have been described. The use of flexible linkers, like epsilon-aminocaproic acid has been examined and the crystallographic and solution state analysis of a linked helix motif has been presented. The use of bulky sidechain modifications on a helical scaffold, as a means of generating putative binding sites has been exemplified by a crystal structure of a peptide packed in a parallel zipper arrangement.

Chance constrained uncertain classification via robust optimization

This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain data points are classified correctly with high probability. Unfortunately such a CCP turns out to be intractable. The key novelty is in employing Bernstein bounding schemes to relax the CCP as a convex second order cone program whose solution is guaranteed to satisfy the probabilistic constraint. Prior to this work, only the Chebyshev based relaxations were exploited in learning algorithms. Bernstein bounds employ richer partial information and hence can be far less conservative than Chebyshev bounds. Due to this efficient modeling of uncertainty, the resulting classifiers achieve higher classification margins and hence better generalization. Methodologies for classifying uncertain test data points and error measures for evaluating classifiers robust to uncertain data are discussed. Experimental results on synthetic and real-world datasets show that the proposed classifiers are better equipped to handle data uncertainty and outperform state-of-the-art in many cases.

Additive Spanners and (alpha, beta)-Spanners

An (alpha, beta)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of a and an additive term beta. It is well known that any graph contains a (multiplicative) (2k - 1, 0)-spanner of size O(n(1+1/k)) and an (additive) (1, 2)-spanner of size O(n(3/2)). However no other additive spanners are known to exist. In this article we develop a couple of new techniques for constructing (alpha, beta)-spanners. Our first result is an additive (1, 6)-spanner of size O(n(4/3)). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well approximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs. Our second result addresses the problem of which (alpha, beta)-spanners can be computed efficiently, ideally in linear time. We show that, for any k, a (k, k - 1)-spanner with size O(kn(1+1/k)) can be found in linear time, and, further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.

Construction of solid model from measured point data

This paper describes an algorithm for constructing the solid model (boundary representation) from pout data measured from the faces of the object. The poznt data is assumed to be clustered for each face. This algorithm does not require any compuiier model of the part to exist and does not require any topological infarmation about the part to be input by the user. The property that a convex solid can be constructed uniquely from geometric input alone is utilized in the current work. Any object can be represented a5 a combznatzon of convex solids. The proposed algorithm attempts to construct convex polyhedra from the given input. The polyhedra so obtained are then checked against the input data for containment and those polyhedra, that satisfy this check, are combined (using boolean union operation) to realise the solid model. Results of implementation are presented.

Correlated electronic states of C-60 fragments

We have studied electronic states of various fragments of C-60 within the Pariser-Parr-Pople (PPP) model and have obtained structural, magnetic and spectral properties of these molecules. The fragments studied include corannulene, fluoranthene and pyracylene. Pyracylene is studied using the exact valence bond (VB) approach while fluoranthene and corannulene are studied using a novel restricted CI technique which employs molecular orbitals for constructing the VB functions. The electronic excitations, bond order and ring currents are calculated for these systems. From these studies, the wide range of absorptions in C-60 can be viewed as those localized on pyracylene units or on the corannulene/fluoranthene units. The bond orders and ring currents show the hexagons to be similar to benzene rings. The pentagon-hexagon bonds are also found to be longer than the hexagon-hexagon bonds.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

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 symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.