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 rnore 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 oil 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 distributions 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.

Automated inspection of aircraft parts using a modified ICP algorithm

The application of computer-aided inspection integrated with the coordinate measuring machine and laser scanners to inspect manufactured aircraft parts using robust registration of two-point datasets is a subject of active research in computational metrology. This paper presents a novel approach to automated inspection by matching shapes based on the modified iterative closest point (ICP) method to define a criterion for the acceptance or rejection of a part. This procedure improves upon existing methods by doing away with the following, viz., the need for constructing either a tessellated or smooth representation of the inspected part and requirements for an a priori knowledge of approximate registration and correspondence between the points representing the computer-aided design datasets and the part to be inspected. In addition, this procedure establishes a better measure for error between the two matched datasets. The use of localized region-based triangulation is proposed for tracking the error. The approach described improves the convergence of the ICP technique with a dramatic decrease in computational effort. Experimental results obtained by implementing this proposed approach using both synthetic and practical data show that the present method is efficient and robust. This method thereby validates the algorithm, and the examples demonstrate its potential to be used in engineering applications.

Isolation and visualization of active presynaptic filaments of recA protein and single-stranded DNA

In the presence of ATP, recA protein forms a presynaptic complex with single-stranded DNA that is an obligatory intermediate in homologous pairing. Presynaptic complexes of recA protein and circular single strands that are active in forming joint molecules can be isolated by gel filtration. These isolated active complexes are nucleoprotein filaments with the following characteristics: (i) a contour length that is at least 1.5 times that of the corresponding duplex DNA molecule, (ii) an ordered structure visualized by negative staining as a striated filament with a repeat distance of 9.0 nm and a width of 9.3 nm, (iii) approximately 8 molecules of recA protein and 20 nucleotide residues per striation. The widened spacing between bases in the nucleoprotein filament means that the initial matching of complementary sequences must involve intertwining of the filament and duplex DNA, unwinding of the latter, or some combination of both to equalize the spacing between nascent base pairs. These experiments support the concept that recA protein first forms a filament with single-stranded DNA, which in turn binds to duplex DNA to mediate both homologous pairing and subsequent strand exchange.

Deuterium-carbon correlation in static oriented systems using DAPT - A windowless multiple pulse sequence

We present a new method for establishing correlation between deuterium and its attached carbon in a deuterated liquid crystal. The method is based on transfer of polarization using the DAPT pulse sequence proposed originally for two spin half nuclei, now extended to a spin-1 and a spin-1/2 nuclei. DAPT utilizes the evolution of magnetization of the spin pair under two blocks of phase shifted BLEW-12 pulses on one of the spins separated by a 90 degree pulse on the other spin. The method is easy to implement and does not need to satisfy matching conditions unlike the Hartmann-Hahn cross-polarization. Experimental results presented demonstrate the efficacy of the method.

A Novel Bandwidth Enhancement Technique for Cascode Amplifier

In this paper, a new technique is presented to increase the bandwidth for a single stage amplifier. Usually, -3 dB bandwidth of single stage amplifier is in few MHz. High output impedance and subsequent capacitive loading decrease the bandwidth of amplifier. The presented technique uses a load which itself acts as bandwidth enhancer. This high speed amplifier is designed on 180 nm CMOS technology, operates at 2.5 V power supply. This amplifier is succeeded by an output buffer to achieve a better linearity, high output swing and required output impedance for matching.

Predictors of violent reconvictions and mortality among impulsive alcoholic violent offenders: A prospective study

Acts of violence lays a great burden on humankind. The negative effects of violence could be relieved by accurate prediction of violent recidivism. However, prediction of violence has been considered an inexact science hampered by scare knowledge of its causes. The study at hand examines risk factors of violent reconvictions and mortality among 242 Finnish male violent offenders exhibiting severe alcoholism and severe externalizing personality disorders. The violent offenders were recruited during a court-ordered 2-month inpatient mental status examination between 1990—1998. Controls were 1210 individuals matched by sex-, age-, and place of birth. After a 9-year non-incarcerated follow-up criminal register and mortality data were obtained from national registers. Risk analyses were applied to estimate odds and relative risk for recidivism and mortality. Risk variables that were included in the analyses were antisocial personality disorder (ASPD), borderline personality disorder (BPD), a comorbidity of ASPD and BPD, childhood adversities, alcohol consumption, age, and monoamine oxidase A (MAOA) genotype. In addition to risk analyses, temperament dimensions (Tridimensional Personality Questionnaire [TPQ]) were assessed. The prevalence of recidivistic acts of violence (32%) and mortality (16%) was high among the offenders. Severe personality disorders and childhood adversities increased the risk for recidivism and mortality both among offenders (OR 2.0–10.4) and in comparison between offenders and controls (RR 4.3–53.0). Offenders having BPD and a history of childhood maltreatment emerged as a group with a particularly poor prognosis. MAOA altered the effects of alcohol consumption and ageing. Alcohol consumption (+2.3%) and age (–7.3%) showed significant effects on the risk for violent reconvictions among the high activity MAOA (MAOA-H) offenders, but not among the low activity MAOA (MAOA-L) offenders. The offenders featured temperament dimensions of high novelty seeking, high harm avoidance, and low reward dependence matching Cloninger’s definition of explosive personality. The fact that the risk for recidivistic acts of violence and mortality accumulated into clearly defined subgroups supports future efforts to provide for evidence based violence prevention and risk assessments among violent offenders.

Frechet distance based approach for searching online handwritten documents

We propose a novel, language-neutral approach for searching online handwritten text using Frechet distance. Online handwritten data, which is available as a time series (x,y,t), is treated as representing a parameterized curve in two-dimensions and the problem of searching online handwritten text is posed as a problem of matching two curves in a two-dimensional Euclidean space. Frechet distance is a natural measure for matching curves. The main contribution of this paper is the formulation of a variant of Frechet distance that can be used for retrieving words even when only a prefix of the word is given as query. Extensive experiments on UNIPEN dataset(1) consisting of over 16,000 words written by 7 users show that our method outperforms the state-of-the-art DTW method. Experiments were also conducted on a Multilingual dataset, generated on a PDA, with encouraging results. Our approach can be used to implement useful, exciting features like auto-completion of handwriting in PDAs.

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.