Language universals and linguistic complexity : Three case studies in core argument marking

In this dissertation I study language complexity from a typological perspective. Since the structuralist era, it has been assumed that local complexity differences in languages are balanced out in cross-linguistic comparisons and that complexity is not affected by the geopolitical or sociocultural aspects of the speech community. However, these assumptions have seldom been studied systematically from a typological point of view. My objective is to define complexity so that it is possible to compare it across languages and to approach its variation with the methods of quantitative typology. My main empirical research questions are: i) does language complexity vary in any systematic way in local domains, and ii) can language complexity be affected by the geographical or social environment? These questions are studied in three articles, whose findings are summarized in the introduction to the dissertation. In order to enable cross-language comparison, I measure complexity as the description length of the regularities in an entity; I separate it from difficulty, focus on local instead of global complexity, and break it up into different types. This approach helps avoid the problems that plagued earlier metrics of language complexity. My approach to grammar is functional-typological in nature, and the theoretical framework is basic linguistic theory. I delimit the empirical research functionally to the marking of core arguments (the basic participants in the sentence). I assess the distributions of complexity in this domain with multifactorial statistical methods and use different sampling strategies, implementing, for instance, the Greenbergian view of universals as diachronic laws of type preference. My data come from large and balanced samples (up to approximately 850 languages), drawn mainly from reference grammars. The results suggest that various significant trends occur in the marking of core arguments in regard to complexity and that complexity in this domain correlates with population size. These results provide evidence that linguistic patterns interact among themselves in terms of complexity, that language structure adapts to the social environment, and that there may be cognitive mechanisms that limit complexity locally. My approach to complexity and language universals can therefore be successfully applied to empirical data and may serve as a model for further research in these areas.

Rauhan atomi, sodan koodi : Suomalaisen atomivoimaratkaisun teknopolitiikka 1955-1970

This dissertation investigates the atomic power solution in Finland between 1955 - 1970. During these years a national arrangement for atomic energy technology evolved. The foundations of the Finnish atomic energy policy; the creation of basic legislation and the first governmental bodies, were laid between 1955 - 1965. In the late 1960's, the necessary technological and political decisions were made in order to purchase the first commercial nuclear reactor. A historical narration of this process is seen in the international context of "atoms for peace" policies and Cold War history in general. The geopolitical position of Finland made it necessary to become involved in the balanced participation in international scientific-technical exchange and assistive nuclear programs. The Paris Peace Treaty of 1947 categorically denied Finland acquisition of nuclear weapons. Accordingly, from the "Geneva year" of 1955, the emphasis was placed on peaceful purposes for atomic energy as well as on the education of national professionals in Finland. An initiative for the governmental atomic energy commission came from academia but the ultimate motive behind it was an anticipated structural change in the supply of national energy. Economically exploitable hydro power resources were expected to be built within ten years and atomic power was seen as a promising and complementing new energy technology. While importing fuels like coal was out of the question, because of scarce foreign currency, domestic uranium mineral deposits were considered as a potential source of nuclear fuel. Nevertheless, even then nuclear energy was regarded as just one of the possible future energy options. In the mid-1960 s a bandwagon effect of light water reactor orders was witnessed in the United States and soon elsewhere in the world. In Finland, two separate invitations for bids for nuclear reactors were initiated. This study explores at length both their preceding grounds and later phases. An explanation is given that the parallel, independent and nearly identical tenders reflected a post-war ideological rivalry between the state-owned utility Imatran Voima and private energy utilities. A private sector nuclear power association Voimayhdistys Ydin represented energy intensive paper and pulp industries and wanted to have free choice instead of being associated themselves with "the state monopoly" in energy pricing. As a background to this, a decisive change had started to happen within Finnish energy policy: private and municipal big thermal power plants became incorporated into the national hydro power production system. A characteristic phenomenon in the later history is the Soviet Union s effort to bid for the tender of Imatran Voima. A nuclear superpower was willing to take part in competition but not on a turnkey basis as Imatran Voima had presumed. As a result of many political turns and four years of negotiations the first Finnish commercial light water reactor was ordered from the East. Soon after this the private nuclear power group ordered its reactors from Sweden. This work interprets this as a reasonable geopolitical balance in choosing politically sensitive technology. Conceptually, social and political dimensions of new technology are emphasised. Negotiations on the Finnish atomic energy program are viewed as a cooperation and a struggle, where state-oriented and private-oriented regimes pose their own macro level views and goals (technopolitical imaginaries) and defend and advance their plans and practical modes of action (schemata). Here, not only technologists but even political actors are seen to contribute to technopolitical realisations.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.

Dokumentation och beskrivning som språkplanering : perspektiv från arbete med tre tecknade minoritetsspråk

Language Documentation and Description as Language Planning Working with Three Signed Minority Languages Sign languages are minority languages that typically have a low status in society. Language planning has traditionally been controlled from outside the sign-language community. Even though signed languages lack a written form, dictionaries have played an important role in language description and as tools in foreign language learning. The background to the present study on sign language documentation and description as language planning is empirical research in three dictionary projects in Finland-Swedish Sign Language, Albanian Sign Language, and Kosovar Sign Language. The study consists of an introductory article and five detailed studies which address language planning from different perspectives. The theoretical basis of the study is sociocultural linguistics. The research methods used were participant observation, interviews, focus group discussions, and document analysis. The primary research questions are the following: (1) What is the role of dictionary and lexicographic work in language planning, in research on undocumented signed language, and in relation to the language community as such? (2) What factors are particular challenges in the documentation of a sign language and should therefore be given special attention during lexicographic work? (3) Is a conventional dictionary a valid tool for describing an undocumented sign language? The results indicate that lexicographic work has a central part to play in language documentation, both as part of basic research on undocumented sign languages and for status planning. Existing dictionary work has contributed new knowledge about the languages and the language communities. The lexicographic work adds to the linguistic advocacy work done by the community itself with the aim of vitalizing the language, empowering the community, receiving governmental recognition for the language, and improving the linguistic (human) rights of the language users. The history of signed languages as low status languages has consequences for language planning and lexicography. One challenge that the study discusses is the relationship between the sign-language community and the hearing sign linguist. In order to make it possible for the community itself to take the lead in a language planning process, raising linguistic awareness within the community is crucial. The results give rise to questions of whether lexicographic work is of more importance for status planning than for corpus planning. A conventional dictionary as a tool for describing an undocumented sign language is criticised. The study discusses differences between signed and spoken/written languages that are challenging for lexicographic presentations. Alternative electronic lexicographic approaches including both lexicon and grammar are also discussed. Keywords: sign language, Finland-Swedish Sign Language, Albanian Sign Language, Kosovar Sign Language, language documentation and description, language planning, lexicography

Women, Management and Leadership - Naiset ja johtajuus : NASTA Women's Leadership Project Final Report

Leadership without the full participation of women not only excludes women individually and collectively, but is also a huge waste of talent, knowledge and expertise. And crucially, given the current state of society and the world, this aspect of gender inequality is likely to become even more important in the future. NASTA - Women’s Leadership: A Research and Education Development Project was established in 2005 as a national multi-university project mainly and generously funded by Finnish Ministry of Education. The project aims at producing new knowledge and increasing understanding about women’s leadership, as well as promoting women’s leadership through research, development of teaching, and public outreach. NASTA is a joint effort of three Finnish universities – Hanken School of Economics, University of Jyväskylä School of Business and Economics, and the Helsinki School of Economics (now part of Aalto University) – and has been coordinated by Hanken. This report presents research and activities conducted within and around the project. NASTA activities have been many and various. They have examined the position and experiences of women in relation to leadership, management, organisation and work more generally. They have sought new knowledge about gender and leadership, on women leaders’ values, attitudes and behaviour, as well as about values, attitudes and behaviour in relation to women’s leadership. NASTA activities have included teaching, student supervision, research theses, research projects, publishing, networking, seminars, meetings, an international conference, and knowledge transfer into other sectors of society. The first section of the book introduces NASTA joint projects, including web-based teaching material, a survey of gender staffing and teaching on gender in business schools, critical review of previous research literature, and new empirical research. The next section includes research articles on different aspects of gender, leadership and manage¬¬ment from more individual projects conducted by participating researchers and research groups linked to NASTA across the three universities. The final section includes short presentations of other research in progress. The appendix lists publications by NASTA members – journal articles, research reports, books, chapters, journal special issues, popular journal articles, magazine articles - and masters, licentiate and doctoral theses that have been produced. These matters of women, leadership and management are not simply academic concerns but urgent matters for practice, organisations, management, policy, and society more generally.

Toward Effective Scalar Hardware for Highly Vectorizable Applications

The performance of a program will ultimately be limited by its serial (scalar) portion, as pointed out by Amdahl′s Law. Reported studies thus far of instruction-level parallelism have mixed data-parallel program portions with scalar program portions, often leading to contradictory and controversial results. We report an instruction-level behavioral characterization of scalar code containing minimal data-parallelism, extracted from highly vectorized programs of the PERFECT benchmark suite running on a Cray Y-MP system. We classify scalar basic blocks according to their instruction mix, characterize the data dependencies seen in each class, and, as a first step, measure the maximum intrablock instruction-level parallelism available. We observe skewed rather than balanced instruction distributions in scalar code and in individual basic block classes of scalar code; nonuniform distribution of parallelism across instruction classes; and, as expected, limited available intrablock parallelism. We identify frequently occurring data-dependence patterns and discuss new instructions to reduce latency. Toward effective scalar hardware, we study latency-pipelining trade-offs and restricted multiple instruction issue mechanisms.

Dynamic scheduling in manufacturing systems using brownian approximations

Recently, Brownian networks have emerged as an effective stochastic model to approximate multiclass queueing networks with dynamic scheduling capability, under conditions of balanced heavy loading. This paper is a tutorial introduction to dynamic scheduling in manufacturing systems using Brownian networks. The article starts with motivational examples. It then provides a review of relevant weak convergence concepts, followed by a description of the limiting behaviour of queueing systems under heavy traffic. The Brownian approximation procedure is discussed in detail and generic case studies are provided to illustrate the procedure and demonstrate its effectiveness. This paper places emphasis only on the results and aspires to provide the reader with an up-to-date understanding of dynamic scheduling based on Brownian approximations.

CM defect and Hilbert functions of monomial curves

In this article we consider a semigroup ring R = KGamma] of a numerical semigroup Gamma and study the Cohen- Macaulayness of the associated graded ring G(Gamma) := gr(m), (R) := circle plus(n is an element of N) m(n)/m(n+1) and the behaviour of the Hilbert function H-R of R. We define a certain (finite) subset B(Gamma) subset of F and prove that G(Gamma) is Cohen-Macaulay if and only if B(Gamma) = empty set. Therefore the subset B(Gamma) is called the Cohen-Macaulay defect of G(Gamma). Further, we prove that if the degree sequence of elements of the standard basis of is non-decreasing, then B(F) = empty set and hence G(Gamma) is Cohen-Macaulay. We consider a class of numerical semigroups Gamma = Sigma(3)(i=0) Nm(i) generated by 4 elements m(0), m(1), m(2), m(3) such that m(1) + m(2) = mo m3-so called ``balanced semigroups''. We study the structure of the Cohen-Macaulay defect B(Gamma) of Gamma and particularly we give an estimate on the cardinality |B(Gamma, r)| for every r is an element of N. We use these estimates to prove that the Hilbert function of R is non-decreasing. Further, we prove that every balanced ``unitary'' semigroup Gamma is ``2-good'' and is not ``1-good'', in particular, in this case, c(r) is not Cohen-Macaulay. We consider a certain special subclass of balanced semigroups Gamma. For this subclass we try to determine the Cohen-Macaulay defect B(Gamma) using the explicit description of the standard basis of Gamma; in particular, we prove that these balanced semigroups are 2-good and determine when exactly G(Gamma) is Cohen-Macaulay. (C) 2011 Published by Elsevier B.V.

Genetic search: Analysis using fitness moments

Genetic Algorithms are efficient and robust search methods that are being employed in a plethora of applications with extremely large search spaces. The directed search mechanism employed in Genetic Algorithms performs a simultaneous and balanced, exploration of new regions in the search space and exploitation of already discovered regions.This paper introduces the notion of fitness moments for analyzing the working of Genetic Algorithms (GAs). We show that the fitness moments in any generation may be predicted from those of the initial population. Since a knowledge of the fitness moments allows us to estimate the fitness distribution of strings, this approach provides for a method of characterizing the dynamics of GAs. In particular the average fitness and fitness variance of the population in any generation may be predicted. We introduce the technique of fitness-based disruption of solutions for improving the performance of GAs. Using fitness moments, we demonstrate the advantages of using fitness-based disruption. We also present experimental results comparing the performance of a standard GA and GAs (CDGA and AGA) that incorporate the principle of fitness-based disruption. The experimental evidence clearly demonstrates the power of fitness based disruption.

S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

A new approach to the design of electronic exchanges

Electronic Exchanges are double-sided marketplaces that allows multiple buyers to trade with multiple sellers, with aggregation of demand and supply across the bids to maximize the revenue in the market. In this paper, we propose a new design approach for an one-shot exchange that collects bids from buyers and sellers and clears the market at the end of the bidding period. The main principle of the approach is to decouple the allocation from pricing. It is well known that it is impossible for an exchange with voluntary participation to be efficient and budget-balanced. Budget-balance is a mandatory requirement for an exchange to operate in profit. Our approach is to allocate the trade to maximize the reported values of the agents. The pricing is posed as payoff determination problem that distributes the total payoff fairly to all agents with budget-balance imposed as a constraint. We devise an arbitration scheme by axiomatic approach to solve the payoff determination problem using the added-value concept of game theory.

Static Balancing of Spring-loaded Planar Revolute-joint Linkages without Auxiliary Links

We present a method to statically balance a general treestructured,planar revolute-joint linkage loaded with linear springs or constant forces without using auxiliary links. The balancing methods currently documented in the literature use extra links; some do not apply when there are spring loads and some are restricted to only two-link serial chains. In our method, we suitably combine any non-zero-free-length load spring with another spring to result in an effective zero-free-length spring load. If a link has a single joint (with the parent link), we give a procedure to attach extra zero-free-length springs to it so that forces and moments are balanced for the link. Another consequence of this attachment is that the constraint force of the joint on the parent link becomes equivalent to a zero-free-length spring load. Hence, conceptually,for the parent link, the joint with its child is removed and replaced with the zero-free-length spring. This feature allows recursive application of this procedure from the end-branches of the tree down to the root, satisfying force and moment balance of all the links in the process. Furthermore, this method can easily be extended to the closed-loop revolute-joint linkages, which is also illustrated in the paper.

Network Rhythms Influence the Relationship between Spike-Triggered Local Field Potential and Functional Connectivity

Characterizing the functional connectivity between neurons is key for understanding brain function. We recorded spikes and local field potentials (LFPs) from multielectrode arrays implanted in monkey visual cortex to test the hypotheses that spikes generated outward-traveling LFP waves and the strength of functional connectivity depended on stimulus contrast, as described recently. These hypotheses were proposed based on the observation that the latency of the peak negativity of the spike-triggered LFP average (STA) increased with distance between the spike and LFP electrodes, and the magnitude of the STA negativity and the distance over which it was observed decreased with increasing stimulus contrast. Detailed analysis of the shape of the STA, however, revealed contributions from two distinct sources-a transient negativity in the LFP locked to the spike (similar to 0 ms) that attenuated rapidly with distance, and a low-frequency rhythm with peak negativity similar to 25 ms after the spike that attenuated slowly with distance. The overall negative peak of the LFP, which combined both these components, shifted from similar to 0 to similar to 25 ms going from electrodes near the spike to electrodes far from the spike, giving an impression of a traveling wave, although the shift was fully explained by changing contributions from the two fixed components. The low-frequency rhythm was attenuated during stimulus presentations, decreasing the overall magnitude of the STA. These results highlight the importance of accounting for the network activity while using STAs to determine functional connectivity.

Micro stepping of Shape Memory Alloy based Poly Phase motor

In literature we find broadly two types of shape memory alloy based motors namely limited rotation motor and unlimited rotation motor. The unlimited rotation type SMA based motor reported in literature uses SMA springs for actuation. An attempt has been made in this paper to develop an unlimited rotation type balanced poly phase motor based on SMA wire in series with a spring in each phase. By isolating SMA actuation and spring action we are able achieve a constant force by the SMA wire through out its range of operation. The Poly phase motor can be used in stepping mode for generating incremental motion and servo mode for generating continuous motion. A method of achieving servo motion by micro stepping is presented. Micro stepping consists of controlling single-phase temperature with a position feedback. The motor has been modeled with a new approach to the SMA wire Hysterysis model. Motor is simulated for different responses and the results are compared with the experimental data.