Koti keskellä kaupunkia : Keskusta lapsiperheen asuinalueena, esimerkkeinä Tukholma ja Helsinki

Families with children have traditionally moved to suburbs. In the last 20 years a modest counter process has however been recognized. Families with an urban lifestyle stay in the city centres. This study looks at the phenomenon through two cases, Stockholm and Helsinki. In the first case it has already been observed that the city centre has grown in popularity among families with children. Therefore it serves as a basis for the study and as well as a point of comparison. Stockholm’s city centre is expanding as new neighbourhoods have been built and are being planned. In the city centre of Helsinki the building of two large neighbourhoods for 30 000 inhabitants will start in a few years. The first aim of the study is to look closer at what has really happened in the city centre of Stockholm, why families choose to live there with their children and how the City of Stockholm has reacted to the change. The main sources of information are secondary sources, statistics and interviews with planners, politicians and experts in the field. The main object is to look at the situation in the city centre of Helsinki. Can a preference for urban residential environments be observed in Helsinki? What are the reasons for a family to choose the city centre as a living place? How does the everyday life of a family in the city centre appear? How are these families taken into account in the planning of the city? The main sources of information here are statistics, interviews with dwellers in the neighbourhood Kruununhaka and interviews with planners. In Stockholm the birth rate has grown constantly during the 2000s and is highest in the city centre. Some of the families still move elsewhere, but many of them do not. One of the most important reasons for living in the city centre is short working distances which give working parents more time with their children. Another reason is a preference of an urban, active lifestyle. Families prefer to live close to everything, childcare, schools, shops and entertainments. The popularity of the city centre among families with children has taken politicians and planners by surprise. Helsinki has not experienced a baby boom like Stockholm. However the negative changes in the birth rate have been more modest in the central areas than in the suburbs. Statistics show, that many families move away from the city centre as the children grow. Families who stay in the city centre especially appreciate closeness to public and private services and good public transportation which means that they are not dependent on using the car. Further they find that the city centre has a tolerant climate and is a safe and beautiful place to live in. The families enjoy the social life of the neighbourhood and feel that it makes a good climate to raise children in. However they are concerned with traffic safety and the lack of stimulus in the playgrounds of the neighbourhood parks. Two large neighbourhoods with homes for about 30 000 inhabitants are now planned in the former Port Districts in the city centre of Helsinki. The other one, Jätkäsaari has been planned to become an attractive alternative for families with children. Traffic safety has been one of the main objects for the planning. The other, Kalasatama, has been planned to attract all groups in society.

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.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.

Trends in consanguineous marriage in Karnataka, South India, 1980–89

Analysis of data on 106,848 marriages in the cities of Bangalore and Mysore, South India, between 1980 and 1989 showed that levels of consanguineous marriage varied between cities through time and by religion. The average coefficient of inbreeding was higher in Bangalore (F = 0·0339) than in Mysore (F = 0·0203), principally reflecting large-scale, post-Independence rural migration into Bangalore. Although there was some evidence of a decline in consanguineous marriages in Mysore, there was no convincing support in either city for earlier projections of a rapid reduction in the popularity of unions between close biological relatives.

Bounded Unpopularity Matchings

We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of popularity. A matching M is popular if there is no matching M' such that more people prefer M' to M than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied by Abraham et al. (SIAM J. Comput. 37(4):1030-1045, 2007). If there is no popular matching, a reasonable substitute is a matching whose unpopularity is bounded. We consider two measures of unpopularity-unpopularity factor denoted by u(M) and unpopularity margin denoted by g(M). McCutchen recently showed that computing a matching M with the minimum value of u(M) or g(M) is NP-hard, and that if G does not admit a popular matching, then we have u(M) >= 2 for all matchings M in G. Here we show that a matching M that achieves u(M) = 2 can be computed in O(m root n) time (where m is the number of edges in G and n is the number of nodes) provided a certain graph H admits a matching that matches all people. We also describe a sequence of graphs: H = H(2), H(3), ... , H(k) such that if H(k) admits a matching that matches all people, then we can compute in O(km root n) time a matching M such that u(M) <= k - 1 and g(M) <= n(1 - 2/k). Simulation results suggest that our algorithm finds a matching with low unpopularity in random instances.

Fault-tolerant Video on Demand in RSerPool Architecture

With the advent of Internet, video over IP is gaining popularity. In such an environment, scalability and fault tolerance will be the key issues. Existing video on demand (VoD) service systems are usually neither scalable nor tolerant to server faults and hence fail to comply to multi-user, failure-prone networks such as the Internet. Current research areas concerning VoD often focus on increasing the throughput and reliability of single server, but rarely addresses the smooth provision of service during server as well as network failures. Reliable Server Pooling (RSerPool), being capable of providing high availability by using multiple redundant servers as single source point, can be a solution to overcome the above failures. During a possible server failure, the continuity of service is retained by another server. In order to achieve transparent failover, efficient state sharing is an important requirement. In this paper, we present an elegant, simple, efficient and scalable approach which has been developed to facilitate the transfer of state by the client itself, using extended cookie mechanism, which ensures that there is no noticeable change in disruption or the video quality.

Efficient Key Management and Distribution for MANET

Ad hoc networks are being used in applications ranging from disaster recovery to distributed collaborative entertainment applications. Ad hoc networks have become one of the most attractive solution for rapid deployment of interconnecting large number of mobile personal devices. The user community of mobile personal devices are demanding a variety of value added multimedia entertainment services. The popularity of peer group is increasing and one or some members of the peer group need to send data to some or all members of the peer group. The increasing demand for group oriented value added services is driving for efficient multicast service over ad hoc networks. Access control mechanisms need to be deployed to provide guarantee that the unauthorized users cannot access the multicast content. In this paper, we present a topology aware key management and distribution scheme for secure overlay multicast over MANET to address node mobility related issues for multicast key management. We use overlay approach for key distribution and our objective is to keep communication overhead low for key management and distribution. We also incorporate reliability using explicit acknowledgments with the key distribution scheme. Through simulations we show that the proposed key management scheme has low communication overhead for rekeying and improves the reliability of key distribution.

Computational algorithms inspired by biological processes and evolution

In recent times computational algorithms inspired by biological processes and evolution are gaining much popularity for solving science and engineering problems. These algorithms are broadly classified into evolutionary computation and swarm intelligence algorithms, which are derived based on the analogy of natural evolution and biological activities. These include genetic algorithms, genetic programming, differential evolution, particle swarm optimization, ant colony optimization, artificial neural networks, etc. The algorithms being random-search techniques, use some heuristics to guide the search towards optimal solution and speed-up the convergence to obtain the global optimal solutions. The bio-inspired methods have several attractive features and advantages compared to conventional optimization solvers. They also facilitate the advantage of simulation and optimization environment simultaneously to solve hard-to-define (in simple expressions), real-world problems. These biologically inspired methods have provided novel ways of problem-solving for practical problems in traffic routing, networking, games, industry, robotics, economics, mechanical, chemical, electrical, civil, water resources and others fields. This article discusses the key features and development of bio-inspired computational algorithms, and their scope for application in science and engineering fields.

Information capacity of energy harvesting sensor nodes

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related to the throughput optimal policies. We also obtain the capacity when energy conserving sleep-wake modes are supported and an achievable rate for the system with inefficiencies in energy storage.

An insight into real-time performance assessment of a building integrated photovoltaic (BIPV) installation in Bangalore (India)

Building integrated photovoltaic (BIPV) applications are gaining widespread popularity. The performance of any given BIPV system is dependent on prevalent meteorological factors, site conditions and system characteristics. Investigations pertaining to the performance assessment of photovoltaic (PV) systems are generally confined to either controlled environment-chambers or computer-based simulation studies. Such investigations fall short of providing a realistic insight into how a PV system actually performs real-time. Solar radiation and the PV cell temperature are amongst the most crucial parameters affecting PV output. The current paper deals with the real-time performance assessment of a recently commissioned 5.25 kW, BIPV system installed at the Center for Sustainable Technologies, Indian Institute of Science, Bangalore. The overall average system efficiency was found to be 6% for the period May 2011-April 2012. This paper provides a critical appraisal of PV system performance based on ground realities, particularly characteristic to tropical (moderate) regions such as Bangalore, India. (C) 2013 International Energy Initiative. Published by Elsevier Inc. All rights reserved.

CUDA-for-clusters: a system for efficient execution of CUDA kernels on multi-core clusters

Rapid advancements in multi-core processor architectures coupled with low-cost, low-latency, high-bandwidth interconnects have made clusters of multi-core machines a common computing resource. Unfortunately, writing good parallel programs that efficiently utilize all the resources in such a cluster is still a major challenge. Various programming languages have been proposed as a solution to this problem, but are yet to be adopted widely to run performance-critical code mainly due to the relatively immature software framework and the effort involved in re-writing existing code in the new language. In this paper, we motivate and describe our initial study in exploring CUDA as a programming language for a cluster of multi-cores. We develop CUDA-For-Clusters (CFC), a framework that transparently orchestrates execution of CUDA kernels on a cluster of multi-core machines. The well-structured nature of a CUDA kernel, the growing popularity, support and stability of the CUDA software stack collectively make CUDA a good candidate to be considered as a programming language for a cluster. CFC uses a mixture of source-to-source compiler transformations, a work distribution runtime and a light-weight software distributed shared memory to manage parallel executions. Initial results on running several standard CUDA benchmark programs achieve impressive speedups of up to 7.5X on a cluster with 8 nodes, thereby opening up an interesting direction of research for further investigation.

Turbine emulator for development of variable speed microhydro power generation systems

Variable speed operation of microhydro power plants is gaining popularity due to the benefits that accrue from their use and the development of suitable generator control systems. This paper highlights the benefits of variable speed systems over conventional systems and also proposes a simple emulator for hydraulic turbines that operate in variable speed fixed flow rate mode. The emulator consists of an uncontrolled separately excited DC motor with additional resistors and has performance characteristics similar to that of the hydraulic turbine.

Capacity of Gaussian Channels With Energy Harvesting and Processing Cost

Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting green communication. In this paper, we focus on communicating reliably over an additive white Gaussian noise channel using such an energy harvesting sensor node. An important part of this paper involves appropriate modeling of energy harvesting, as done via various practical architectures. Our main result is the characterization of the Shannon capacity of the communication system. The key technical challenge involves dealing with the dynamic (and stochastic) nature of the (quadratic) cost of the input to the channel. As a corollary, we find close connections between the capacity achieving energy management policies and the queueing theoretic throughput optimal policies.

Smoothed Functional Algorithms for Stochastic Optimization Using q-Gaussian Distributions

Smoothed functional (SF) schemes for gradient estimation are known to be efficient in stochastic optimization algorithms, especially when the objective is to improve the performance of a stochastic system However, the performance of these methods depends on several parameters, such as the choice of a suitable smoothing kernel. Different kernels have been studied in the literature, which include Gaussian, Cauchy, and uniform distributions, among others. This article studies a new class of kernels based on the q-Gaussian distribution, which has gained popularity in statistical physics over the last decade. Though the importance of this family of distributions is attributed to its ability to generalize the Gaussian distribution, we observe that this class encompasses almost all existing smoothing kernels. This motivates us to study SF schemes for gradient estimation using the q-Gaussian distribution. Using the derived gradient estimates, we propose two-timescale algorithms for optimization of a stochastic objective function in a constrained setting with a projected gradient search approach. We prove the convergence of our algorithms to the set of stationary points of an associated ODE. We also demonstrate their performance numerically through simulations on a queuing model.