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

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

Detrimental Effects of Hypoxia-Specific Expression of Uracil DNA Glycosylase (Ung) in Mycobacterium smegmatis

Mycobacterium tuberculosis is known to reside latently in a significant fraction of the human population. Although the bacterium possesses an aerobic mode of metabolism, it adapts to persistence under hypoxic conditions such as those encountered in granulomas. While in mammalian systems hypoxia is a recognized DNA-damaging stress, aspects of DNA repair in mycobacteria under such conditions have not been studied. We subjected Mycobacterium smegmatis, a model organism, to the Wayne's protocol of hypoxia. Analysis of the mRNA of a key DNA repair enzyme, uracil DNA glycosylase (Ung), by real-time reverse transcriptase PCR (RT-PCR) revealed its downregulation during hypoxia. However, within an hour of recovery of the culture under normal oxygen levels, the Ung mRNA was restored. Analysis of Ung by immunoblotting and enzyme assays supported the RNA analysis results. To understand its physiological significance, we misexpressed Ung in M. smegmatis by using a hypoxia-responsive promoter of narK2 from M. tuberculosis. Although the misexpression of Ung during hypoxia decreased C-to-T mutations, it compromised bacterial survival upon recovery at normal oxygen levels. RT-PCR analysis of other base excision repair gene transcripts (UdgB and Fpg) suggested that these DNA repair functions also share with Ung the phenomenon of downregulation during hypoxia and recovery with return to normal oxygen conditions. We discuss the potential utility of this phenomenon in developing attenuated strains of mycobacteria.

Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs

We consider a problem of providing mean delay and average throughput guarantees in random access fading wireless channels using CSMA/CA algorithm. This problem becomes much more challenging when the scheduling is distributed as is the case in a typical local area wireless network. We model the CSMA network using a novel queueing network based approach. The optimal throughput per device and throughput optimal policy in an M device network is obtained. We provide a simple contention control algorithm that adapts the attempt probability based on the network load and obtain bounds for the packet transmission delay. The information we make use of is the number of devices in the network and the queue length (delayed) at each device. The proposed algorithms stay within the requirements of the IEEE 802.11 standard.

Generalizing the Amplify-and-Forward Relay Gain Model: An Optimal SEP Perspective

Two models for AF relaying, namely, fixed gain and fixed power relaying, have been extensively studied in the literature given their ability to harness spatial diversity. In fixed gain relaying, the relay gain is fixed but its transmit power varies as a function of the source-relay channel gain. In fixed power relaying, the relay transmit power is fixed, but its gain varies. We revisit and generalize the fundamental two-hop AF relaying model. We present an optimal scheme in which an average power constrained AF relay adapts its gain and transmit power to minimize the symbol error probability (SEP) at the destination. Also derived are insightful and practically amenable closed-form bounds for the optimal relay gain. We then analyze the SEP of MPSK, derive tight bounds for it, and characterize the diversity order for Rayleigh fading. Also derived is an SEP approximation that is accurate to within 0.1 dB. Extensive results show that the scheme yields significant energy savings of 2.0-7.7 dB at the source and relay. Optimal relay placement for the proposed scheme is also characterized, and is different from fixed gain or power relaying. Generalizations to MQAM and other fading distributions are also discussed.

A weight based context analysis system to provide a required UMM service

Ubiquitous Computing is an emerging paradigm which facilitates user to access preferred services, wherever they are, whenever they want, and the way they need, with zero administration. While moving from one place to another the user does not need to specify and configure their surrounding environment, the system initiates necessary adaptation by itself to cope up with the changing environment. In this paper we propose a system to provide context-aware ubiquitous multimedia services, without user’s intervention. We analyze the context of the user based on weights, identify the UMMS (Ubiquitous Multimedia Service) based on the collected context information and user profile, search for the optimal server to provide the required service, then adapts the service according to user’s local environment and preferences, etc. The experiment conducted several times with different context parameters, their weights and various preferences for a user. The results are quite encouraging.

SEP-optimal adaptive gain and transmit power amplify-and-forward relaying

Amplify-and-forward (AF) relay based cooperation has been investigated in the literature given its simplicity and practicality. Two models for AF, namely, fixed gain and fixed power relaying, have been extensively studied. In fixed gain relaying, the relay gain is fixed but its transmit power varies as a function of the source-relay (SR) channel gain. In fixed power relaying, the relay's instantaneous transmit power is fixed, but its gain varies. We propose a general AF cooperation model in which an average transmit power constrained relay jointly adapts its gain and transmit power as a function of the channel gains. We derive the optimal AF gain policy that minimizes the fading- averaged symbol error probability (SEP) of MPSK and present insightful and tractable lower and upper bounds for it. We then analyze the SEP of the optimal policy. Our results show that the optimal scheme is up to 39.7% and 47.5% more energy-efficient than fixed power relaying and fixed gain relaying, respectively. Further, the weaker the direct source-destination link, the greater are the energy-efficiency gains.

Stochastic analysis of epidemics on adaptive time varying networks

Many studies investigating the effect of human social connectivity structures (networks) and human behavioral adaptations on the spread of infectious diseases have assumed either a static connectivity structure or a network which adapts itself in response to the epidemic (adaptive networks). However, human social connections are inherently dynamic or time varying. Furthermore, the spread of many infectious diseases occur on a time scale comparable to the time scale of the evolving network structure. Here we aim to quantify the effect of human behavioral adaptations on the spread of asymptomatic infectious diseases on time varying networks. We perform a full stochastic analysis using a continuous time Markov chain approach for calculating the outbreak probability, mean epidemic duration, epidemic reemergence probability, etc. Additionally, we use mean-field theory for calculating epidemic thresholds. Theoretical predictions are verified using extensive simulations. Our studies have uncovered the existence of an ``adaptive threshold,'' i.e., when the ratio of susceptibility (or infectivity) rate to recovery rate is below the threshold value, adaptive behavior can prevent the epidemic. However, if it is above the threshold, no amount of behavioral adaptations can prevent the epidemic. Our analyses suggest that the interaction patterns of the infected population play a major role in sustaining the epidemic. Our results have implications on epidemic containment policies, as awareness campaigns and human behavioral responses can be effective only if the interaction levels of the infected populace are kept in check.

BILATERAL EDGE DETECTORS

We propose to employ bilateral filters to solve the problem of edge detection. The proposed methodology presents an efficient and noise robust method for detecting edges. Classical bilateral filters smooth images without distorting edges. In this paper, we modify the bilateral filter to perform edge detection, which is the opposite of bilateral smoothing. The Gaussian domain kernel of the bilateral filter is replaced with an edge detection mask, and Gaussian range kernel is replaced with an inverted Gaussian kernel. The modified range kernel serves to emphasize dissimilar regions. The resulting approach effectively adapts the detection mask according as the pixel intensity differences. The results of the proposed algorithm are compared with those of standard edge detection masks. Comparisons of the bilateral edge detector with Canny edge detection algorithm, both after non-maximal suppression, are also provided. The results of our technique are observed to be better and noise-robust than those offered by methods employing masks alone, and are also comparable to the results from Canny edge detector, outperforming it in certain cases.

Single network adaptive critic aided dynamic inversion for optimal regulation and command tracking with online adaptation for enhanced robustness

To combine the advantages of both stability and optimality-based designs, a single network adaptive critic (SNAC) aided nonlinear dynamic inversion approach is presented in this paper. Here, the gains of a dynamic inversion controller are selected in such a way that the resulting controller behaves very close to a pre-synthesized SNAC controller in the output regulation sense. Because SNAC is based on optimal control theory, it makes the dynamic inversion controller operate nearly optimal. More important, it retains the two major benefits of dynamic inversion, namely (i) a closed-form expression of the controller and (ii) easy scalability to command tracking applications without knowing the reference commands a priori. An extended architecture is also presented in this paper that adapts online to system modeling and inversion errors, as well as reduced control effectiveness, thereby leading to enhanced robustness. The strengths of this hybrid method of applying SNAC to optimize an nonlinear dynamic inversion controller is demonstrated by considering a benchmark problem in robotics, that is, a two-link robotic manipulator system. Copyright (C) 2013 John Wiley & Sons, Ltd.

A questioning based method to automatically acquire expert assembly diagnostic knowledge

In the domain of manual mechanical assembly, expert knowledge is an important means of supporting assembly planning that leads to fewer issues during actual assembly. Knowledge based systems can be used to provide assembly planners with expert knowledge as advice. However, acquisition of knowledge remains a difficult task to automate, while manual acquisition is tedious, time-consuming, and requires engagement of knowledge engineers with specialist knowledge to understand and translate expert knowledge. This paper describes the development, implementation and preliminary evaluation of a method that asks a series of questions to an expert, so as to automatically acquire necessary diagnostic and remedial knowledge as rules for use in a knowledge based system for advising assembly planners diagnose and resolve issues. The method, called a questioning procedure, organizes its questions around an assembly situation which it presents to the expert as the context, and adapts its questions based on the answers it receives from the expert. (C) 2014 Elsevier Ltd. All rights reserved.

Interference-Constrained Optimal Power-Adaptive Amplify-and-Forward Relaying and Selection for Underlay Cognitive Radios

In an underlay cognitive radio (CR) system, a secondary user can transmit when the primary is transmitting but is subject to tight constraints on the interference it causes to the primary receiver. Amplify-and-forward (AF) relaying is an effective technique that significantly improves the performance of a CR by providing an alternate path for the secondary transmitter's signal to reach the secondary receiver. We present and analyze a novel optimal relay gain adaptation policy (ORGAP) in which the relay is interference aware and optimally adapts both its gain and transmit power as a function of its local channel gains. ORGAP minimizes the symbol error probability at the secondary receiver subject to constraints on the average relay transmit power and on the average interference caused to the primary. It is different from ad hoc AF relaying policies and serves as a new and fundamental theoretical benchmark for relaying in an underlay CR. We also develop a near-optimal and simpler relay gain adaptation policy that is easy to implement. An extension to a multirelay scenario with selection is also developed. Our extensive numerical results for single and multiple relay systems quantify the power savings achieved over several ad hoc policies for both MPSK and MQAM constellations.

Adaptive Flight-Control Design Using Neural-Network-Aided Optimal Nonlinear Dynamic Inversion

A neural-network-aided nonlinear dynamic inversion-based hybrid technique of model reference adaptive control flight-control system design is presented in this paper. Here, the gains of the nonlinear dynamic inversion-based flight-control system are dynamically selected in such a manner that the resulting controller mimics a single network, adaptive control, optimal nonlinear controller for state regulation. Traditional model reference adaptive control methods use a linearized reference model, and the presented control design method employs a nonlinear reference model to compute the nonlinear dynamic inversion gains. This innovation of designing the gain elements after synthesizing the single network adaptive controller maintains the advantages that an optimal controller offers, yet it retains a simple closed-form control expression in state feedback form, which can easily be modified for tracking problems without demanding any a priori knowledge of the reference signals. The strength of the technique is demonstrated by considering the longitudinal motion of a nonlinear aircraft system. An extended single network adaptive control/nonlinear dynamic inversion adaptive control design architecture is also presented, which adapts online to three failure conditions, namely, a thrust failure, an elevator failure, and an inaccuracy in the estimation of C-M alpha. Simulation results demonstrate that the presented adaptive flight controller generates a near-optimal response when compared to a traditional nonlinear dynamic inversion controller.

Influence of recombination on acquisition and reversion of immune escape and compensatory mutations in HIV-1

Following transmission, HIV-1 adapts in the new host by acquiring mutations that allow it to escape from the host immune response at multiple epitopes. It also reverts mutations associated with epitopes targeted in the transmitting host but not in the new host. Moreover, escape mutations are often associated with additional compensatory mutations that partially recover fitness costs. It is unclear whether recombination expedites this process of multi-locus adaptation. To elucidate the role of recombination, we constructed a detailed population dynamics model that integrates viral dynamics, host immune response at multiple epitopes through cytotoxic T lymphocytes, and viral evolution driven by mutation, recombination, and selection. Using this model, we compute the expected waiting time until the emergence of the strain that has gained escape and compensatory mutations against the new host's immune response, and reverted these mutations at epitopes no longer targeted. We find that depending on the underlying fitness landscape, shaped by both costs and benefits of mutations, adaptation proceeds via distinct dominant pathways with different effects of recombination, in particular distinguishing escape and reversion. When adaptation at a single epitope is involved, recombination can substantially accelerate immune escape but minimally affects reversion. When multiple epitopes are involved, recombination can accelerate or inhibit adaptation depending on the fitness landscape. Specifically, recombination tends to delay adaptation when a purely uphill fitness landscape is accessible at each epitope, and accelerate it when a fitness valley is associated with each epitope. Our study points to the importance of recombination in shaping the adaptation of HIV-1 following its transmission to new hosts, a process central to T cell-based vaccine strategies. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license.

The Structure and Evolution of a Two-Dimensional H2/O2/Ar Cellular Detonation

This paper reports on two-dimensional numerical simulation of cellular detonation wave in a / / mixture with low initial pressure using a detailed chemical reaction model and high order WENO scheme. Before the final equilibrium structure is produced, a fairly regular but still non-equilibrium mode is observed during the early stage of structure formation process. The numerically tracked detonation cells show that the cell size always adapts to the channel height such that the cell ratio is fairly independent of the grid sizes and initial and boundary conditions. During the structural evolution in a detonation cell, even as the simulated detonation wave characteristics suggest the presence of an ordinary detonation, the evolving instantaneous detonation state indicates a mainly underdriven state. As a considerable region of the gas mixture in a cell is observed to be ignited by the incident wave and transverse wave, it is further suggested that these two said waves play an essential role in the detonation propagation.

Enhanced virulence of Salmonella enterica serovar typhimurium after passage through mice.

The interaction between Salmonella enterica and the host immune system is complex. The outcome of an infection is the result of a balance between the in vivo environment where the bacteria survive and grow and the regulation of fitness genes at a level sufficient for the bacteria to retain their characteristic rate of growth in a given host. Using bacteriological counts from tissue homogenates and fluorescence microscopy to determine the spread, localization, and distribution of S. enterica in the tissues, we show that, during a systemic infection, S. enterica adapts to the in vivo environment. The adaptation becomes a measurable phenotype when bacteria that have resided in a donor animal are introduced into a recipient naïve animal. This adaptation does not confer increased resistance to early host killing mechanisms but can be detected as an enhancement in the bacterial net growth rate later in the infection. The enhanced growth rate is lost upon a single passage in vitro, and it is therefore transient and not due to selection of mutants. The adapted bacteria on average reach higher intracellular numbers in individual infected cells and therefore have patterns of organ spread different from those of nonadapted bacteria. These experiments help in developing an understanding of the influence of passage in a host on the fitness and virulence of S. enterica.