Observations of the solar wind-magnetosphere-ionosphere coupling

In this thesis, the solar wind-magnetosphere-ionosphere coupling is studied observationally, with the main focus on the ionospheric currents in the auroral region. The thesis consists of five research articles and an introductory part that summarises the most important results reached in the articles and places them in a wider context within the field of space physics. Ionospheric measurements are provided by the International Monitor for Auroral Geomagnetic Effects (IMAGE) magnetometer network, by the low-orbit CHAllenging Minisatellite Payload (CHAMP) satellite, by the European Incoherent SCATter (EISCAT) radar, and by the Imager for Magnetopause-to-Aurora Global Exploration (IMAGE) satellite. Magnetospheric observations, on the other hand, are acquired from the four spacecraft of the Cluster mission, and solar wind observations from the Advanced Composition Explorer (ACE) and Wind spacecraft. Within the framework of this study, a new method for determining the ionospheric currents from low-orbit satellite-based magnetic field data is developed. In contrast to previous techniques, all three current density components can be determined on a matching spatial scale, and the validity of the necessary one-dimensionality approximation, and thus, the quality of the results, can be estimated directly from the data. The new method is applied to derive an empirical model for estimating the Hall-to-Pedersen conductance ratio from ground-based magnetic field data, and to investigate the statistical dependence of the large-scale ionospheric currents on solar wind and geomagnetic parameters. Equations describing the amount of field-aligned current in the auroral region, as well as the location of the auroral electrojets, as a function of these parameters are derived. Moreover, the mesoscale (10-1000 km) ionospheric equivalent currents related to two magnetotail plasma sheet phenomena, bursty bulk flows and flux ropes, are studied. Based on the analysis of 22 events, the typical equivalent current pattern related to bursty bulk flows is established. For the flux ropes, on the other hand, only two conjugate events are found. As the equivalent current patterns during these two events are not similar, it is suggested that the ionospheric signatures of a flux rope depend on the orientation and the length of the structure, but analysis of additional events is required to determine the possible ionospheric connection of flux ropes.

Intrinsic limits of subthreshold slope in biased bilayer graphene transistor

In this work, we investigate the intrinsic limits of subthreshold slope in a dual gated bilayer graphene transistor using a coupled self-consistent Poisson-bandstructure solver. We benchmark the solver by matching the bias dependent band gap results obtained from the solver against published experimental data. We show that the intrinsic bias dependence of the electronic structure and the self-consistent electrostatics limit the subthreshold slope obtained in such a transistor well above the Boltzmann limit of 60 mV/decade at room temperature, but much below the results experimentally shown till date, indicating room for technological improvement of bilayer graphene.

Machine recognition of online handwritten Devanagari characters

In this paper, we describe a system for the automatic recognition of isolated handwritten Devanagari characters obtained by linearizing consonant conjuncts. Owing to the large number of characters and resulting demands on data acquisition, we use structural recognition techniques to reduce some characters to others. The residual characters are then classified using the subspace method. Finally the results of structural recognition and feature-based matching are mapped to give final output. The proposed system Ifs evaluated for the writer dependent scenario.

Sampled longest common prefix array

When augmented with the longest common prefix (LCP) array and some other structures, the suffix array can solve many string processing problems in optimal time and space. A compressed representation of the LCP array is also one of the main building blocks in many compressed suffix tree proposals. In this paper, we describe a new compressed LCP representation: the sampled LCP array. We show that when used with a compressed suffix array (CSA), the sampled LCP array often offers better time/space trade-offs than the existing alternatives. We also show how to construct the compressed representations of the LCP array directly from a CSA

Semi-supervised learning of WLAN radio maps

In this thesis a manifold learning method is applied to the problem of WLAN positioning and automatic radio map creation. Due to the nature of WLAN signal strength measurements, a signal map created from raw measurements results in non-linear distance relations between measurement points. These signal strength vectors reside in a high-dimensioned coordinate system. With the help of the so called Isomap-algorithm the dimensionality of this map can be reduced, and thus more easily processed. By embedding position-labeled strategic key points, we can automatically adjust the mapping to match the surveyed environment. The environment is thus learned in a semi-supervised way; gathering training points and embedding them in a two-dimensional manifold gives us a rough mapping of the measured environment. After a calibration phase, where the labeled key points in the training data are used to associate coordinates in the manifold representation with geographical locations, we can perform positioning using the adjusted map. This can be achieved through a traditional supervised learning process, which in our case is a simple nearest neighbors matching of a sampled signal strength vector. We deployed this system in two locations in the Kumpula campus in Helsinki, Finland. Results indicate that positioning based on the learned radio map can achieve good accuracy, especially in hallways or other areas in the environment where the WLAN signal is constrained by obstacles such as walls.

Moment-Matched Lognormal Modeling of Uplink Interference with Power Control and Cell Selection

We develop an alternate characterization of the statistical distribution of the inter-cell interference power observed in the uplink of CDMA systems. We show that the lognormal distribution better matches the cumulative distribution and complementary cumulative distribution functions of the uplink interference than the conventionally assumed Gaussian distribution and variants based on it. This is in spite of the fact that many users together contribute to uplink interference, with the number of users and their locations both being random. Our observations hold even in the presence of power control and cell selection, which have hitherto been used to justify the Gaussian distribution approximation. The parameters of the lognormal are obtained by matching moments, for which detailed analytical expressions that incorporate wireless propagation, cellular layout, power control, and cell selection parameters are developed. The moment-matched lognormal model, while not perfect, is an order of magnitude better in modeling the interference power distribution.

Voting Paths

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.

Leader - Follower Relations In An Intercultural Chinese Context - Personal, Interpersonal and Behavioural Influences and Impact on Work Contribution

The successful interaction between leaders and their followers is central to the overall functioning of a company. The increasingly multinational nature of modern business and the resulting multicultural and increasingly heterogeneous workforce imposes specific challenges to the development of high-quality work relationships. The Western multinational companies that have started operations in China are facing these challenges. This study examines the quality of leader-follower relationships between Western expatriate leaders and their Chinese followers as well as between Chinese leaders and their Chinese followers in Western-owned subsidiaries in China. The focus is on the influence of personal, interpersonal and behavioural factors (personality, values, cultural knowledge, perceived and actual similarity, interactional justice, and follower performance) and the work-related implications of these relationships (job attitudes and organisational citizenship behaviour). One interesting finding of this study is that Chinese followers have higher perceptions of their Western than their Chinese leaders. The results also indicate that Chinese and Western leaders’ perceptions of their followers are not influenced favourably by the same follower characteristics. In a similar vein, Chinese followers value different traits in Western versus Chinese leaders. These results, as well as the numerous more specific findings of the study, have practical implications for international human resource management and areas such as selection, placement and training. Due to the different effect of personal and interpersonal factors across groups, it is difficult to achieve the “perfect match” between leader and follower characteristics that simultaneously contribute to high-quality relationships for Chinese and Western leaders as well as for followers. However, the results indicate that the ability of organisations to enhance the quality of leader-follower relations by selecting and matching people with suitable characteristics may provide an effective means for organisations to increase positive job attitudes and hence influence work-related outcomes.

Prospects for wind energy utilisation in Karnataka State

An examination of the data available at 22 meteorological stations in Karnataka State shows that wind velocities in the State as a whole are neither spectacularly high nor negligibly low. The highest winds (annual mean of around 13 km/hr) are experienced in parts of the northern maidan region of the State (Gulbarga, Raichur and Bidar districts) and in Bangalore. The winds are strongly seasonal: typically, the five monsoon months May-September account for about 80% of the annual wind energy flux. Although the data available are inadequate to make precise estimates, they indicate that the total wind energy potential of the State is about an order of magnitude higher than the current electrical energy consumption. The possible exploitation of wind energy for applications in rural areas therefore requires serious consideration, but it is argued that to be successful it is essential to formulate an integrated and carefully planned programme. The output of current windpumps needs to be increased; a doubling should be feasible by the design of suitable load-matching devices. The first cost has to be reduced by careful design, by the use of local materials and skills and by employing a labour-intensive technology. A consideration of the agricultural factors in the northern maidan region of the State shows that there is likely to be a strong need for mechanical assistance in supplemental and life-saving irrigation for the dry crops characteristic of the area. A technological target for a windmill that could find applications in this area would be one with a rotor diameter of about 10 m that can lift about 10,000 litres of water per hour in winds of 10 km/hr (2.8 m/s) hourly average speed and costs less than about Rs 10,000. Although no such windmills exist as of today, the authors believe that achievement of this target is feasible. An examination of various possible scenarios for the use of windmills in this area suggests that with a windpump costing about Rs 12,000, a three hectare farm growing two dry crops a year can expect an annual return of about 150% from an initial investment of about Rs 15,000. It is concluded that it should be highly worthwhile to undertake a coordinated programme for wind energy development that will include more detailed wind surveys in the northern maidan area (as well as some others, such as the Western Ghats), the development of suitable windmill designs and a study of their applications to agriculture as well as to other fields.

The Evolving Roles of the Human Resource Function: Understanding Role Changes in the Context of Large-Scale Mergers

The human resource (HR) function is under pressure both to change roles and to play a large variety of roles. Questions of change and development in the HR function become particularly interesting in the context of mergers and acquisitions when two corporations are integrated. The purpose of the thesis is to examine the roles played by the HR function in the context of large-scale mergers and thus to understand what happens to the HR function in such change environments, and to shed light on the underlying factors that influence changes in the HR function. To achieve this goal, the study seeks first to identify the roles played by the HR function before and after the merger, and second, to identify the factors that affect the roles played by the HR function. It adopts a qualitative case study approach including ten focal case organisations (mergers) and four matching cases (non-mergers). The sample consists of large corporations originating from either Finland or Sweden. HR directors and members of the top management teams within the case organisations were interviewed. The study suggests that changes occur within the HR function, and that the trend is for the HR function to become increasingly strategic. However, the HR function was found to play strategic roles only when the HR administration ran smoothly. The study also suggests that the HR function has become more versatile. An HR function that was perceived to be mainly administrative before the merger is likely after the merger to perform some strategically important activities in addition to the administrative ones. Significant changes in the roles played by the HR function were observed in some of the case corporations. This finding suggests that the merger integration process is a window of opportunity for the HR function. HR functions that take a proactive and leading role during the integration process might expand the number of roles played and move from being an administrator before the merger to also being a business partner after integration. The majority of the HR functions studied remained mainly reactive during the organisational change process and although the evidence showed that they moved towards strategic tasks, the intra-functional changes remained comparatively small in these organisations. The study presents a new model that illustrates the impact of the relationship between the top management team and the HR function on the role of the HR function. The expectations held by the top management team for the HR function and the performance of the HR function were found to interact. On a dimension reaching from tactical to strategic, HR performance is likely to correspond to the expectations held by top management.

Tiering Effects in Third-party Logistics: A First-tier Buyer Perspective

This doctoral dissertation takes a buy side perspective to third-party logistics (3PL) providers’ service tiering by applying a linear serial dyadic view to transactions. It takes its point of departure not only from the unalterable focus on the dyad levels as units of analysis and how to manage them, but also the characteristics both creating and determining purposeful conditions for a longer duration. A conceptual framework is proposed and evaluated on its ability to capture logistics service buyers’ perceptions of service tiering. The problem discussed is in the theoretical context of logistics and reflects value appropriation, power dependencies, visibility in linear serial dyads, a movement towards the more market governed modes of transactions (i.e. service tiering) and buyers’ risk perception of broader utilisation of the logistics services market. Service tiering, in a supply chain setting, with the lack of multilateral agreements between supply chain members, is new. The deductive research approach applied, in which theoretically based propositions are empirically tested with quantitative and qualitative data, provides new insight into (contractual) transactions in 3PL. The study findings imply that the understanding of power dependencies and supply chain dynamics in a 3PL context is still in its infancy. The issues found include separation of service responsibilities, supply chain visibility, price-making behaviour and supply chain strategies under changing circumstances or influence of non-immediate supply chain actors. Understanding (or failing to understand) these issues may mean remarkable implications for the industry. Thus, the contingencies may trigger more open-book policies, larger liability scope of 3PL service providers or insourcing of critical logistics activities from the first-tier buyer core business and customer service perspectives. In addition, a sufficient understanding of the issues surrounding service tiering enables proactive responses to devise appropriate supply chain strategies. The author concludes that qualitative research designs, facilitating data collection on multiple supply chain actors, may capture and increase understanding of the impact of broader supply chain strategies. This would enable pattern-matching through an examination of two or more sides of exchange transactions to measure relational symmetries across linear serial dyads. Indeed, the performance of the firm depends not only on how efficiently it cooperates with its partners, but also on how well exchange partners cooperate with an organisation’s own business.

A neural network based CBIR system using STI features and relevance feedback

Multimedia mining primarily involves, information analysis and retrieval based on implicit knowledge. The ever increasing digital image databases on the Internet has created a need for using multimedia mining on these databases for effective and efficient retrieval of images. Contents of an image can be expressed in different features such as Shape, Texture and Intensity-distribution(STI). Content Based Image Retrieval(CBIR) is an efficient retrieval of relevant images from large databases based on features extracted from the image. Most of the existing systems either concentrate on a single representation of all features or linear combination of these features. The paper proposes a CBIR System named STIRF (Shape, Texture, Intensity-distribution with Relevance Feedback) that uses a neural network for nonlinear combination of the heterogenous STI features. Further the system is self-adaptable to different applications and users based upon relevance feedback. Prior to retrieval of relevant images, each feature is first clustered independent of the other in its own space and this helps in matching of similar images. Testing the system on a database of images with varied contents and intensive backgrounds showed good results with most relevant images being retrieved for a image query. The system showed better and more robust performance compared to existing CBIR systems

Memory-based reasoning approach for pattern recognition of binary images

Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. 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 adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each 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 is 1 or 2.