Limit Analysis of Slabs with Free Edge

The general method earlier developed by the writers for obtaining valid lower bound solutions to slabs under uniformly distributed load and supported along all edges is extended to the slabs with a free edge. Lower bound solutions with normal moment criterion are presented for six cases of orthotropically reinforced slabs, with one of the short edges being free and the other three edges being any combination of fixed and simply supported conditions. The expressions for moment field and collapse load are given for each slab. The lower bounds have been compared with the corresponding upper bound values obtained from the yield line theory with simple straight yield line modes of failure. They are also compared with Nielsen’s solutions available for two cases with isotropic reinforcement.

Local structure and magneto-transport in Sr2FeMoO6 oxides

Double perovskite oxides Sr2FeMoO6 have attracted a great interest for their peculiar magneto-transport properties, and, ill particular, for the large values of low-field magneto-resistance (MR) which remains elevated even at room temperature, thanks to their high Curie temperature (T-c > 400 K). These properties are strongly influenced by chemical cation disorder, that is by the relative arrangement of Fe and Mo on their sublattices: the regular alternation of Fe and Mo enhances the M R and saturation magnetization. On the contrary the disorder generally depresses the magnetization and worsen the MR response. In this work the X-ray absorption fine structure (XAFS) technique has been employed in order to probe the cation order from a local point of view. XAFS spectra were collected at the Fe and Mo K edges on Sr2FeMoO6 samples with different degree of long-range chemical order. The XAFS results prove that a high degree of short-range cation order is preserved, despite the different long-range order: the Fe-Mo correlations are always preferred over the Fe-Fe and Mo-Mo ones in the perfectly ordered as well as in highly disordered samples.

Multiple contour extraction from graylevel images using an artificial neural network

For active contour modeling (ACM), we propose a novel self-organizing map (SOM)-based approach, called the batch-SOM (BSOM), that attempts to integrate the advantages of SOM- and snake-based ACMs in order to extract the desired contours from images. We employ feature points, in the form of ail edge-map (as obtained from a standard edge-detection operation), to guide the contour (as in the case of SOM-based ACMs) along with the gradient and intensity variations in a local region to ensure that the contour does not "leak" into the object boundary in case of faulty feature points (weak or broken edges). In contrast with the snake-based ACMs, however, we do not use an explicit energy functional (based on gradient or intensity) for controlling the contour movement. We extend the BSOM to handle extraction of contours of multiple objects, by splitting a single contour into as many subcontours as the objects in the image. The BSOM and its extended version are tested on synthetic binary and gray-level images with both single and multiple objects. We also demonstrate the efficacy of the BSOM on images of objects having both convex and nonconvex boundaries. The results demonstrate the superiority of the BSOM over others. Finally, we analyze the limitations of the BSOM.

Sosiaalityön ammattilaiset refleksiivisinä toimijoina : tutkimus erikoistumiskoulutuksesta Margaret Archerin teorian valossa

In Finland, specialized studies in social work (professional licentiate education) were begun in the year 2000. The education is targeted at experienced social workers and leads to a licentiate degree (a degree between master s and doctorate). In this study, the experiences of members of the first study cohort, specializing in social work with children and young people, are examined. The study s theoretical frame of reference is based on the morphogenetic approach, developed by British sociologist Margaret Archer. In it, the potential powers of both an agent as well as social and cultural structures are considered important and worth taking into account. Archer sees reflexivity, a person s ability to analyze herself/himself, as an essential starting point for agency. Thanks to reflexivity, people are able to engage in internal conversations , discuss the concerns that are important to them and form agential projects . In Archer s theory, the social structures and traits of the cultural system are seen as having potential power in relation to people s agential projects; these powers can enable but also restrain the realization of the projects. On the other hand, individuals can try to review the factors affecting their agential projects and find ways of action that facilitate them. The research task is to study the self-understanding of social work professionals in the 21st century, the issues and goals professionally important for them, as well as the contexts framing the realization of these goals. The research questions are as follows: 1) What kind of internal conversations, concerns and agential projects related to their work did the professionals taking part in licentiate education bring to light? 2) What kind of enabling and restraining factors can be identified in their situations? And 3) What kind of social structures and traits related to the cultural system are connected to these factors? The research material was collected by interviewing the students in different phases of their education. In 2001 and 2004 all members of the study group (n = 25) were interviewed. In 2007, 13 students took part. The themes of the internal conversations brought to light in the interviews were divided into four broad thematic categories: professional development, the position of children in social work, multiprofessional work and structural social work. In relation to these themes the students formed different kinds of agential projects. In addition, the study reveals several cultural and social structures that have enabled but also restrained the realization of the agential projects. These structures are linked, for example, to the relations between employees and employers, students and teachers, children and adults as well as between the representatives of different professions. Working conditions which social workers often consider weak are discussed as a focal issue related to many themes. These working conditions become evident, for example, in the great imbalance which exists between the professional tasks and the amount of time that social workers have for them. Difficult situations arise when social workers feel they cannot reach the goals that are professionally important to them because of the strict external conditions of the work.

Luonnonhoitopellot maatalousympäristön luonnon monimuotoisuuden edistämisessä

Luonnonhoitopellot lisättiin uutena vapaaehtoisena toimenpiteenä maatalouden ympäristötukeen vuonna 2009. Luonnonhoitopeltoihin kuuluvat monivuotiset nurmipellot sekä niitty-, riista- ja maisemakasveilla kylvetyt pellot. Toimenpiteen avulla pyritään suojelemaan ja lisäämään maatalousympäristön luonnon monimuotoisuutta sekä muun muassa vähentämään maatalouden ravinnehuuhtoumia. Vuonna 2010 luonnonhoitopeltoja oli yli seitsemän prosenttia Suomen viljelyalasta. Luonnonhoitopeltojen ympäristövaikutusten arvioiminen ja toimenpiteen kehittäminen on tärkeää, jotta toimenpiteeseen käytettävät varat eivät valu hukkaan. Tämän tutkimuksen tavoitteena oli selvittää, millainen merkitys luonnonhoitopelloilla on maatalousympäristön monimuotoisuuden kannalta; millaiset luonnonhoitopellot ovat monimuotoisuuden kannalta arvokkaimpia; ja kuinka toimenpidettä kannattaa kehittää. Kysymyksiin pyrittiin vastaamaan tutkimalla putkilokasvilajistoa, -lajirikkautta ja kasvillisuuden rakennetta erilaisilla luonnonhoitopelloilla, sekä vertaamalla luonnonhoitopeltojen kasvillisuutta pientareiden ja niittyjen kasvillisuuteen. Maastotyö luonnonhoitopelloilla tehtiin kesällä 2010 Uudenmaan ja Pohjois-Pohjanmaan ELY-keskusalueilla. Lisäksi tutkimuslohkoista kerättiin tietoja viljelijäkyselyn kautta. Niittypellot osoittautuivat tutkimuksessa lajirikkaimmaksi luonnonhoitopeltotyypiksi, mikä selittynee lähinnä sillä, että ne kylvetään heikosti kilpailukykyisellä siemenseoksella. Nurmi- ja niittypelloilla lohkon viljavuus korreloi negatiivisesti lajirikkauden kanssa. Lajikoostumukseltaan kaikki luonnonhoitopellot eroavat toisistaan sekä maatalousympäristön puoliluonnontilaisista elinympäristöistä, ja lisäävät siten monimuotoisuutta maisematasolla. Luonnonhoitopeltojen lajisto ei ole kuitenkaan suojelun kannalta erityisen arvokasta. Toimenpiteen maatalousympäristöä rikastuttavaa vaikutusta vähentää, että tällä hetkellä valtaosa luonnonhoitopelloista on monivuotisia nurmipeltoja. Luonnonhoitopeltojen siemenseoksia kehittämällä, perustamis- ja hoitomenetelmiä tutkimalla ja neuvontaan panostamalla voidaan lisätä luonnonhoitopeltojen arvoa niin luonnon, viljelijän kuin yhteiskunnankin kannalta.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Uloimmalla rannalla : Luotsi- ja majakkamiesperheet asemayhdyskunnissaan

The subject of the present research is historical lighthouse and maritime pilot stations in Finland. If one thinks of these now-abandoned sites as an empty stage, the dissertation aims to recreate the drama that once played out there. The research comprises three main themes. The first, the family problematic, focuses on the relationship between the family members concerned and the public service positions held, as well as the islands on which these people were stationed. The role of the male actors becomes apparent through an examination of the job descriptions of pilots and lighthouse keepers, but the role of the wives appears more problematic: running a household and the insularity of the community came with their own challenges, and the husbands were away for much of the time. In this context the children emerge as crucial. What was their role in the family of a public official? What were the effects of having to move to the mainland for school? The second theme is the station community. A socioecological examination is undertaken which defines the islands as plots allowing the researcher to study the social behaviours of the isolated communities in question. The development of this theme is based on interpretations of interviews revealing starkly opposed views on the existing neighbourly relations. The premise is that social friction is inevitable among people living within close proximity of each other, and the study proceeds to become an analysis that seeks to uncover the sociocultural strategies designed to control the risks of communal living either by creating distance between neighbours or by enhancing their mutual ties. In connection with this, the question of why some neighbourhoods were open and cooperative while others were restrained and quarrelsome is addressed. Finally, the third main theme discusses the changes in piloting and lighthouse keeping that took place increasingly numerous towards the end of the 20th century. How did individuals react to the central management s technocratic strivings and rationalisations, such as the automation of lighthouses and the intense downsizing of the network of pilot stations? How was piloting, previously very comprehensive work, splintered into specialisations, and how did the entire occupation of lighthouse keeping lose its status before completely disappearing, as the new technology took over?

Analysis of edge delaminations in laminates through combined use of quasi-three-dimensional, eight-noded, two-noded and transition elements

The use of appropriate finite elements in different regions of a stressed solid can be expected to be economical in computing its stress response. This concept is exploited here in studying stresses near free edges in laminated coupons. The well known free edge problem of [0/90], symmetric laminate is considered to illustrate the application of the concept. The laminate is modelled as a combination of three distinct regions. Quasi-three-dimensional eight-noded quadrilateral isoparametric elements (Q3D8) are used at and near the free edge of the laminate and two-noded line elements (Q3D2) are used in the region away from the free edge. A transition element (Q3DT) provides a smooth inter-phase zone between the two regions. Significant reduction in the problem size and hence in the computational time and cost have been achieved at almost no loss of accuracy.

A note on transient photocurrents at semiconductor electrodes

The imprint of the changing surface concentration of minority carriers in photocurrent transients is marginalized in “switch off” transients as compared to “switch on” transients. When the surface level is situated close to either one of the band edges, it is shown that in principle it must be possible to obtain the energy of the surface level from “switch off” transients.The time constants for the “switch on” and “switch off” cases behave differently with potential. While in “switch off”, transient plots, the magnitude of the slope decreases monotonically with increasing band bending potentials; for the “switch on” however, though it decreases and is identical to “switch off” initially, beyond a certain increase in potential the magnitude of the slope shows an increase.

Structure of bovine prothrombin fragment 1 refined at 2.25 Å resolution

The structure of bovine prothrombin fragment 1 has been refined at 2.25 Å resolution using high resolution measurements made with the synchrotron beam at CHESS. The synchrotron data were collected photographically by oscillation methods (R-merge = 0.08). These were combined with lower order diffractometer data for refinement purposes. The structure was refined using restrained least-squares methods with the program PROLSQ to a crystallographic R-value of 0.175. The structure includes 105 water molecules with occupancies of >0·6. The first 35 residues (Ala1-Leu35) of the N-terminal ?-carboxy glutamic acid-domain (Ala1-Cys48) of fragment 1 are disordered as are two carbohydrate chains of Mr ? 5000; the latter two combine to render 40% of the structure disordered. The folding of the kringle of fragment 1 is related to the close intramolecular contact between the inner loop disulfide groups. Half of the conserved sequence of the kringle forms an inner core surrounding these disulfide groups. The remainder of the sequence conservation is associated with the many turns of the main chain. The Pro95 residue of the kringle has a cis conformation and Tyr74 is ordered in fragment 1, although nuclear magnetic resonance studies indicate that the comparable residue of plasminogen kringle 4 has two positions. Surface accessibility calculations indicate that none of the disulfide groups of fragment 1 is accessible to solvent.

Surface recombination at semiconductor electrodes: a single level study

The recombination and the faradaic fluxes are shown to be sensitive to the location of a single level recombination center, when it is located near the band edges. As the surface level is shifted deeper into the band gap from either of the band edges, the back emission terms are dominated by electron capture and hole capture terms, and the occupancy of the surface level is no longer determined by its location in the band gap. However, when one of the back emission terms determines the surface state occupancy, it is shown that there exists a simple relation between the value of the surface level and the recombination and the faradaic fluxes respectively. Expressions to this effect are derived and verified in the case of the recombination flux, which characterized by the potential at which it attains its maximum value. For the faradaic flux the results are qualitative.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

A Smooth Finite Element Method Based on Reproducing Kernel DMS-Splines

The element-based piecewise smooth functional approximation in the conventional finite element method (FEM) results in discontinuous first and higher order derivatives across element boundaries Despite the significant advantages of the FEM in modelling complicated geometries, a motivation in developing mesh-free methods has been the ease with which higher order globally smooth shape functions can be derived via the reproduction of polynomials There is thus a case for combining these advantages in a so-called hybrid scheme or a `smooth FEM' that, whilst retaining the popular mesh-based discretization, obtains shape functions with uniform C-p (p >= 1) continuity One such recent attempt, a NURBS based parametric bridging method (Shaw et al 2008b), uses polynomial reproducing, tensor-product non-uniform rational B-splines (NURBS) over a typical FE mesh and relies upon a (possibly piecewise) bijective geometric map between the physical domain and a rectangular (cuboidal) parametric domain The present work aims at a significant extension and improvement of this concept by replacing NURBS with DMS-splines (say, of degree n > 0) that are defined over triangles and provide Cn-1 continuity across the triangle edges This relieves the need for a geometric map that could precipitate ill-conditioning of the discretized equations Delaunay triangulation is used to discretize the physical domain and shape functions are constructed via the polynomial reproduction condition, which quite remarkably relieves the solution of its sensitive dependence on the selected knotsets Derivatives of shape functions are also constructed based on the principle of reproduction of derivatives of polynomials (Shaw and Roy 2008a) Within the present scheme, the triangles also serve as background integration cells in weak formulations thereby overcoming non-conformability issues Numerical examples involving the evaluation of derivatives of targeted functions up to the fourth order and applications of the method to a few boundary value problems of general interest in solid mechanics over (non-simply connected) bounded domains in 2D are presented towards the end of the paper

Five-fold quasiperiodic tilings generated by inflated rhombuses with identical boundaries: possible application to the growth of quasicrystals

In order to generate normal Penrose tilings by inflation/deflation, decisions have to be made regarding the matching of the rhombuses/tilings with their neighbours. We show here that this decision-making problem can be avoided by adopting a deflation/inflation procedure which uses the decorated rhombuses with identical boundaries. The procedure enables both kinds of inflated rhombuses to match in any orientation along their edges. The tilings so generated are quasiperiodic. These structures appear to have a close relationship with the growth mechanism of quasicrystals.