Design and analysis of rate aware ad hoc 802.11 networks

802.11 WLANs are characterized by high bit error rate and frequent changes in network topology. The key feature that distinguishes WLANs from wired networks is the multi-rate transmission capability, which helps to accommodate a wide range of channel conditions. This has a significant impact on higher layers such as routing and transport levels. While many WLAN products provide rate control at the hardware level to adapt to the channel conditions, some chipsets like Atheros do not have support for automatic rate control. We first present a design and implementation of an FER-based automatic rate control state machine, which utilizes the statistics available at the device driver to find the optimal rate. The results show that the proposed rate switching mechanism adapts quite fast to the channel conditions. The hop count metric used by current routing protocols has proven itself for single rate networks. But it fails to take into account other important factors in a multi-rate network environment. We propose transmission time as a better path quality metric to guide routing decisions. It incorporates the effects of contention for the channel, the air time to send the data and the asymmetry of links. In this paper, we present a new design for a multi-rate mechanism as well as a new routing metric that is responsive to the rate. We address the issues involved in using transmission time as a metric and presents a comparison of the performance of different metrics for dynamic routing.

A hitchhiker's guide to a crowded syconium: how do fig nematodes find the right ride?

P>1Organisms with low mobility, living within ephemeral environments,need to find vehicles that can disperse them reliably to new environments. The requirement for specificity in this passenger-vehicle relationship is enhanced within a tritrophic interaction when the environment of passenger and vehicle is provided by a third organism. Such relationships pose many interesting questions about specificity within a tritrophic framework. 2. Central to understanding how these tritrophic systems have evolved, is knowing how they function now. Determining the proximal cues and sensory modalities used by passengers to find vehicles and to discriminate between reliable and non-reliable vehicles is, therefore, essential to this investigation. 3. The ancient, co-evolved and highly species-specific nursery pollination mutualism between figs and fig wasps is host to species-specific plant-parasitic nematodes which use fig wasps to travel between figs. Since individual globular fig inflorescences, i.e. syconia, serve as incubators for hundreds of developing pollinating and parasitic wasps, a dispersal-stage nematode within such a chemically,complex and physically crowded environment is faced with the dilemma of choosing the right vehicle for dispersal into a new fig. Such a system therefore affords excellent opportunities to investigate mechanisms that contribute to the evolution of specificity between the passenger and the vehicle. 4. In this study of fig-wasp-nematode tritrophic interactions in Ficus racemosa within which seven wasp species can breed, we demonstrate using two-choice as well as cafeteria assays that plant-parasitic nematodes (Schistonchus racemosa) do not hitch rides randomly on available eclosing wasps within the fig syconium, but are specifically attracted, at close range, i.e. 3 mm distance, to only that vehicle which can quickly, within a few hours, reliably transfer it to another fig. This vehicle is the female pollinating wasp. Male wasps and female parasitic wasps are inappropriate vehicles since the former are wingless and die within the fig, while the latter never enter another fig. Nematodes distinguished between female pollinating wasps and other female parasitic wasps using volatiles and cuticular hydrocarbons. Nematodes could not distinguish between cuticular hydrocarbons of male and female pollinators but used other cues, such as volatiles, at close range, to find female pollinating wasps with which they have probably had a long history of chemical adaptation. 5. This study opens up new questions and hypotheses about the evolution and maintenance of specificity in fig-wasp-nematode tritrophic interactions.

Svekofennialaisen orogenian ylityönnön terminen mallinnus Itä-Suomen arkeeisella kratonilla

This study reviews the thermophysical properties of rocks and the lithosphere and describes a one dimensional thermal numeric model of hypothetical 20 km thick overthrust plate obtruded on to the Archeaen craton in the Svecofennian orogeny (1.92-1.77 Ga). The objective is to find out if the overthrust plate and its radiogenic heat sources were able to produce the thermal effects observed on the current erosion level of the Archaean craton. Heat transfer in lithosphere is assumed conductive, and advective heat transfer due to melting and melt transfer is supposed negligible. The study area is located in the Eastern Finland, approximately current Kainuu and Northern Karelia regions, east from the most active orogenic belt (Raahe-Ladoga zone), so that orogenic magmatism can be neglected. Physical parameters and boundary conditions for the model are from different earlier published sources: deep seismic profiles (rock variation in depth), laboratory measurements (heat production and conductivity of rocks), field measurements (heat flow densities), and pT(t) estimations from the Finnish precambrian to estimate the size and thickness of the sheet. Comparison of the modelling results to previous K-Ar datings and other pTt estimations show, that the effect of the overthrust sheet has been adequate (max. T 450°C at 4 kbar) to produce the K-Ar resetting ages measured from the Archaean bedrock at current erosion level. No other kind of thermal activation in lithosphere is required. Results show possibly very minor partial melting in upper middle crust underneath the overthrust sheet.

Fast- and drift-ice communities in the Bothnian Bay and the impact of UVA radiation on the Baltic Sea ice ecology

The aim of this thesis was to study ecology of Baltic Sea ice from two perspectives. In the first two studies, sea-ice ecology from riverine-influenced fast ice to drift ice in the Bothnian Bay was investigated, whereas the last two studies focus on the sensitivity of sea-ice bacteria and algae to UVA examined in situ. The seasonal sea ice cover is one of the main characteristics of the Baltic Sea, and despite the brackish parental water, the ice structure is similar to polar ice with saline brine inclusions, the sea ice habitat. The decreasing seawater salinity from the northern Baltic Sea to the Bothnian Bay translates to decreasing brine volumes along the gradient, governing the size and community structure of the food webs in ice. However, the drift and fast ice in the Bothnian Bay may differ greatly in this sense, as drift ice may have been formed at more southern locations. Rafting and the formation of snow ice are common processes in the ice field of the Bothnian Bay. As evidenced in this thesis, rafting altered the vertical distribution of organisms and snow-ice formation provided habitable space in the better-illuminated, nitrogen-rich surface layer. The divergence between fast and drift ice became apparent at the more advanced stages, and chlorophyte biomass decreased from fast to drift ice, while the opposite held true for protozoan and metazoan biomass. The brine volumes affected the communities somewhat, and a higher percentage of flagellate species was generally linked to lower brine volumes, whereas chain-forming diatoms were mostly concentrated in layers with larger brine volumes. These results add to knowledge of the ecological significance of the ice cover lasting up to 7 months per year in this area. Sea-ice food webs are generally light-limited, but while increasing light irradiances typically enhance the primary production and further, the secondary production in sea ice, any increase in solar radiation also includes an increase in harmful UVA radiation. The Baltic Sea ice microbial communities were clearly sensitive to UVA and the responses were strongly linked to the earlier light history, as well as to the solar irradiances they were exposed to. The increased biomass of chlorophytes and pennate diatoms, when UVA was excluded, indicates that their normally minor contribution to the biomass in the upper layers of sea ice might be partly dictated by UVA. The effects of UVA on bacterial production in Baltic Sea ice mostly followed the responses in algal growth, but occasionally the exposure to UVA even enhanced the bacterial production. The dominant bacterial class, Flavobacteria, seemed to be UVA-tolerant, whereas all the Alpha-, Beta- and Gammaproteobacteria present in the surface layer showed UVA sensitivity. These results indicate that changes in the light field of ice may alter the community structure and affect the functioning of ice food webs, and are of importance when the effects of thinning of the ice cover are assessed.

Internet- karttapalveluiden arviointi ja kehitys strategisessa maankäytön suunnittelussa, tapaustutkimuksena Esikaupunkien renessanssi -hanke

Participation is located in a living and complex environment. Traditional means of participation are only partially able to meet the new environmental requirements. In need are forms of participation which take into account the new opportunities of the environment and residents expertise. Internet map applications are an important channel of participation which potential is in many respects as unexplored and unutilized. They are commonly in inventory the perspectives, bringing out the concerns of the area, and only little for discussing about solutions. Interpretation is usually made by designer. This study focuses on evaluation and development of Internet map applications in strategic land use planning. Subject matter is dealt from designer and the inhabitants point of view. City Planning Department of Helsinki s Esikau-punkien Renessanssi -project and the associated SoftGIS survey acts as the case study. In the beginning of the study I tried to recognize the new environment in which the Internet map applications are placed. The research question is, what kind of challenges and opportunities the e-participation confronts in information society, and what kind of requirements the environmental creates for development of an application. In chapter three I evaluate how successfully these requirements are met in Esikau-punkien Renessanssi -project. I m trying to examine how the application would look like if the environment and the characteristics of the project are met better. The approach is experimental and I try to find new ways to take advantage of Internet maps. I try not to be too limited to current projects and studies. For example, I try to examine how social media and Web 2.0 opportunities can be utilized, and how the learning and shaping nature of planning may be reached in Internet map environment. In chapter four I have developed a new concept for the Esikaupunkien Renessanssi map application, and made images to visualize its operation in practice. I collect all the data in the research and gather it into a new service. The aim is to create a better application for Esikaupunkien Renessanssi -project, which takes into account the living and complex environment of participation and responds to threats and opportunities arising from it. The presented outcome is in many respects different from the current query. In the new service the role of residents is to interact and learn. The traditional standing of the Internet maps and the position of resident as one-sided information donor are questioned. In the concept, the residents innovate and make interpretations too. Influences are taken from a number of modern applications and for example services that make use of social media. The user experience is intended to be interactive, fast and easy. The idea is that the service keeps you up to date with planning matters, not the other way around. Service guides inhabitants, striving to achieve a deeper knowledge of the project's objectives as well as the dynamics and realities that different individuals experience.

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Pelastustoimi alueellisessa kehittämisessä : Länsi-Uudenmaan pelastuslaitoksen saavutettavuus

By law, rescue services must anticipate and plan future rescue situations so that the emergency measures taken in the event of an accident can be accomplished quickly and effectively. To reach this goal, rescue services planning must be up to date. The development of rescue services is di-rected by the Rescue Act, and guidelines such as the readiness program, based on that law. The guidelines give the basic principles for organizing rescue services. This paper studies the ability of rescuers to reach different locations now, and in the future, and whether this happens within the time constraints required by the readiness program. The time per-spective of the study includes both the current time and the future. Predictions of possible future situations are based on zoning information. The goal of the study is to find out whether there are any gaps in the network of fire stations or if gaps will develop in the near future. The strong growth and increase in the population of the greater Helsinki area, and of surrounding towns, creates many challenges for city planning, including rescue services. This study targets the two towns of Espoo and Kirkkonummi, where fast growth specifically into new housing areas, makes planning of rescue services challenging. Many new options are available for planning due to technological developments. The combined methods of planning and geo-informatics used in this study help to determine the need for new resources in rescue services. By using these methods, the planning of rescue services could be done at least 10 years into the future.

Propagating intensity disturbances in polar corona as seen from AIA/SDO

Context. Polar corona is often explored to find the energy source for the acceleration of the fast solar wind. Earlier observations show omni-presence of quasi-periodic disturbances, traveling outward, which is believed to be caused by the ubiquitous presence of outward propagating waves. These waves, mostly of compressional type, might provide the additional momentum and heat required for the fast solar wind acceleration. It has been conjectured that these disturbances are not due to waves but high speed plasma outflows, which are difficult to distinguish using the current available techniques. Aims. With the unprecedented high spatial and temporal resolution of AIA/SDO, we search for these quasi-periodic disturbances in both plume and interplume regions of the polar corona. We investigate their nature of propagation and search for a plausible interpretation. We also aim to study their multi-thermal nature by using three different coronal passbands of AIA. Methods. We chose several clean plume and interplume structures and studied the time evolution of specific channels by making artificial slits along them. Taking the average across the slits, space-time maps are constructed and then filtration techniques are applied to amplify the low-amplitude oscillations. To suppress the effect of fainter jets, we chose wider slits than usual. Results. In almost all the locations chosen, in both plume and interplume regions we find the presence of propagating quasi-periodic disturbances, of periodicities ranging from 10-30 min. These are clearly seen in two channels and in a few cases out to very large distances (approximate to 250 `') off-limb, almost to the edge of the AIA field of view. The propagation speeds are in the range of 100-170 km s(-1). The average speeds are different for different passbands and higher in interplume regions. Conclusions. Propagating disturbances are observed, even after removing the effects of jets and are insensitive to changes in slit width. This indicates that a coherent mechanism is involved. In addition, the observed propagation speed varies between the different passpands, implying that these quasi-periodic intensity disturbances are possibly due to magneto-acoustic waves. The propagation speeds in interplume region are higher than in the plume region.

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

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.

A fast quasi-Newton method for semi-supervised SVM

Due to its wide applicability, semi-supervised learning is an attractive method for using unlabeled data in classification. In this work, we present a semi-supervised support vector classifier that is designed using quasi-Newton method for nonsmooth convex functions. The proposed algorithm is suitable in dealing with very large number of examples and features. Numerical experiments on various benchmark datasets showed that the proposed algorithm is fast and gives improved generalization performance over the existing methods. Further, a non-linear semi-supervised SVM has been proposed based on a multiple label switching scheme. This non-linear semi-supervised SVM is found to converge faster and it is found to improve generalization performance on several benchmark datasets. (C) 2010 Elsevier Ltd. All rights reserved.

Best Node Selection Through Distributed Fast Variable Power Multiple Access

In many wireless applications, it is highly desirable to have a fast mechanism to resolve or select the packet from the user with the highest priority. Furthermore, individual priorities are often known only locally at the users. In this paper we introduce an extremely fast, local-information-based multiple access algorithm that selects the best node in 1.8 to 2.1 slots,which is much lower than the 2.43 slot average achieved by the best algorithm known to date. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities into the receive power.It is inherently distributed and scales well with the number of users. We show that mapping onto a discrete set of receive power levels is optimal, and provide a complete characterization for it. The power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture,idle channel, or collision.

Stream-Close: Fast mining of Closed Frequent Itemsets in high speed data streams

With the emergence of large-volume and high-speed streaming data, the recent techniques for stream mining of CFIpsilas (closed frequent itemsets) will become inefficient. When concept drift occurs at a slow rate in high speed data streams, the rate of change of information across different sliding windows will be negligible. So, the user wonpsilat be devoid of change in information if we slide window by multiple transactions at a time. Therefore, we propose a novel approach for mining CFIpsilas cumulatively by making sliding width(ges1) over high speed data streams. However, it is nontrivial to mine CFIpsilas cumulatively over stream, because such growth may lead to the generation of exponential number of candidates for closure checking. In this study, we develop an efficient algorithm, stream-close, for mining CFIpsilas over stream by exploring some interesting properties. Our performance study reveals that stream-close achieves good scalability and has promising results.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.