Homogenization of elliptic problems in thin domains with oscillatory boundaries

Los dominios finos, es decir, dominios sustancialmente más pequeños en alguna o varias de sus direcciones que en el resto, aparecen en muchos campos de la ciencia. Por ejemplo, dinámica de fluídos (lubricación, conducción de fluídos en tubos delgados, dinámica de oceanos...), mecánica de sólidos (barras delgadas, placas o cáscaras) o incluso en fisiología (circulación de la sangre). Así, el amplio número de posibles aplicaciones a situaciones reales ha hecho que la investigación de modelos de ecuaciones en derivadas parciales en dominios finos se convierta en un tema muy estudiado en los últimos años. Desde un punto de vista matemático, el estudio de las soluciones de una EDP en un dominio fino es un caso particular de la cuestión general relativa a cómo la variación de los dominios afecta al comportamiento de las soluciones de la EDP. En este marco, obtener la ecuación límite del modelo considerado, comparar la solución de la ecuación límite y las soluciones del problema en el dominio fino, analizar los coeficientes de la ecuación límite y comprender cómo la geometría del dominio afecta a la ecuación límite son algunos de los objetivos que deberían ser alcanzados. De hecho, es importante señalar que este tipo de cuestiones no sólo proporcionan importantes resultados teóricos sino que son muy relevantes desde el punto de vista de las aplicaciones. Por ejemplo, ser capaz de reducir el problema original a un problema mucho más sencillo, problema límite, que refleje las principales características del problema de partida puede ser muy útil para ingenieros y físicos...

The importance of subclasses of chitin synthase enzymes with myosin-like domains for the fitness of fungi

TG and CF are funded by FEDER funds through the Operational Programme Competitiveness Factors e COMPETE and national funds by FCT e Foundation for Science and Technology under the strategic project UID/NEU/04539/2013. C.F. is a recipient of a postdoctoral fellowship from FCT-Fundac¸ ~ao para a Ci^encia e Tecnologia (SFRH/BPD/63733/2009). NG is funded by The Wellcome Trust (080088, 086827, 075470, 099215 & 097377), the FungiBrain Marie Curie Network and the Medical Research Council (UK).

Effects of alternating current voltage amplitude and oxide capacitance on mid-gap interface state defect density extractions in In0.53Ga 0.47As capacitors

This work looks at the effect on mid-gap interface state defect density estimates for In0.53Ga0.47As semiconductor capacitors when different AC voltage amplitudes are selected for a fixed voltage bias step size (100 mV) during room temperature only electrical characterization. Results are presented for Au/Ni/Al2O3/In0.53Ga0.47As/InP metal–oxide–semiconductor capacitors with (1) n-type and p-type semiconductors, (2) different Al2O3 thicknesses, (3) different In0.53Ga0.47As surface passivation concentrations of ammonium sulphide, and (4) different transfer times to the atomic layer deposition chamber after passivation treatment on the semiconductor surface—thereby demonstrating a cross-section of device characteristics. The authors set out to determine the importance of the AC voltage amplitude selection on the interface state defect density extractions and whether this selection has a combined effect with the oxide capacitance. These capacitors are prototypical of the type of gate oxide material stacks that could form equivalent metal–oxide–semiconductor field-effect transistors beyond the 32 nm technology node. The authors do not attempt to achieve the best scaled equivalent oxide thickness in this work, as our focus is on accurately extracting device properties that will allow the investigation and reduction of interface state defect densities at the high-k/III–V semiconductor interface. The operating voltage for future devices will be reduced, potentially leading to an associated reduction in the AC voltage amplitude, which will force a decrease in the signal-to-noise ratio of electrical responses and could therefore result in less accurate impedance measurements. A concern thus arises regarding the accuracy of the electrical property extractions using such impedance measurements for future devices, particularly in relation to the mid-gap interface state defect density estimated from the conductance method and from the combined high–low frequency capacitance–voltage method. The authors apply a fixed voltage step of 100 mV for all voltage sweep measurements at each AC frequency. Each of these measurements is repeated 15 times for the equidistant AC voltage amplitudes between 10 mV and 150 mV. This provides the desired AC voltage amplitude to step size ratios from 1:10 to 3:2. Our results indicate that, although the selection of the oxide capacitance is important both to the success and accuracy of the extraction method, the mid-gap interface state defect density extractions are not overly sensitive to the AC voltage amplitude employed regardless of what oxide capacitance is used in the extractions, particularly in the range from 50% below the voltage sweep step size to 50% above it. Therefore, the use of larger AC voltage amplitudes in this range to achieve a better signal-to-noise ratio during impedance measurements for future low operating voltage devices will not distort the extracted interface state defect density.

Structural and Functional Analysis of the Caspase –dependent and –independent Domains of the X-linked Inhibitor of Apoptosis Protein in Inflammatory Breast Cancer Tumor Biology

Inflammatory breast cancer (IBC) is an extremely rare but highly aggressive form of breast cancer characterized by the rapid development of therapeutic resistance leading to particularly poor survival. Our previous work focused on the elucidation of factors that mediate therapeutic resistance in IBC and identified increased expression of the anti-apoptotic protein, X-linked inhibitor of apoptosis protein (XIAP), to correlate with the development of resistance to chemotherapeutics. Although XIAP is classically thought of as an inhibitor of caspase activation, multiple studies have revealed that XIAP can also function as a signaling intermediate in numerous pathways. Based on preliminary evidence revealing high expression of XIAP in pre-treatment IBC cells rather than only subsequent to the development of resistance, we hypothesized that XIAP could play an important signaling role in IBC pathobiology outside of its heavily published apoptotic inhibition function. Further, based on our discovery of inhibition of chemotherapeutic efficacy, we postulated that XIAP overexpression might also play a role in resistance to other forms of therapy, such as immunotherapy. Finally, we posited that targeting of specific redox adaptive mechanisms, which are observed to be a significant barrier to successful treatment of IBC, could overcome therapeutic resistance and enhance the efficacy of chemo-, radio-, and immuno- therapies. To address these hypotheses our objectives were: 1. to determine a role for XIAP in IBC pathobiology and to elucidate the upstream regulators and downstream effectors of XIAP; 2. to evaluate and describe a role for XIAP in the inhibition of immunotherapy; and 3. to develop and characterize novel redox modulatory strategies that target identified mechanisms to prevent or reverse therapeutic resistance.

Using various genomic and proteomic approaches, combined with analysis of cellular viability, proliferation, and growth parameters both in vitro and in vivo, we demonstrate that XIAP plays a central role in both IBC pathobiology in a manner mostly independent of its role as a caspase-binding protein. Modulation of XIAP expression in cells derived from patients prior to any therapeutic intervention significantly altered key aspects IBC biology including, but not limited to: IBC-specific gene signatures; the tumorigenic capacity of tumor cells; and the metastatic phenotype of IBC, all of which are revealed to functionally hinge on XIAP-mediated NFκB activation, a robust molecular determinant of IBC. Identification of the mechanism of XIAP-mediated NFκB activation led to the characterization of novel peptide-based antagonist which was further used to identify that increased NFκB activation was responsible for redox adaptation previously observed in therapy-resistant IBC cells. Lastly, we describe the targeting of this XIAP-NFκB-ROS axis using a novel redox modulatory strategy both in vitro and in vivo. Together, the data presented here characterize a novel and crucial role for XIAP both in therapeutic resistance and the pathobiology of IBC; these results confirm our previous work in acquired therapeutic resistance and establish the feasibility of targeting XIAP-NFκB and the redox adaptive phenotype of IBC as a means to enhance survival of patients.

Spontaneous Unfolding and Refolding of FNIII Domains Assayed by Thiol Exchange

Fibronectin (FN) is a large extracellular matrix (ECM) protein that is made up of

type I (FNI), type II (FNII), & type III (FNIII) domains. It assembles into an insoluble

supra-­‐‑molecular structure: the fibrillar FN matrix. FN fibrillogenesis is a cell‐‑mediated process, which is initiated when FN binds to integrins on the cell surface. The FN matrix plays an important role in cell migration, proliferation, signaling & adhesion. Despite decades of research, the FN matrix is one of the least understood supra-­‐‑molecular protein assemblies. There have been several attempts to elucidate the exact mechanism of matrix assembly resulting in significant progress in the field but it is still unclear as to what are FN-­‐‑FN interactions, the nature of these interactions and the domains of FN that

are in contact with each other. FN matrix fibrils are elastic in nature. Two models have been proposed to explain the elasticity of the fibrils. The first model: the ‘domain unfolding’ model postulates that the unraveling of FNIII domains under tension explains fibril elasticity.

The second model relies on the conformational change of FN from compact to extended to explain fibril elasticity. FN contain 15 FNIII domains, each a 7-­‐‑strand beta sandwich. Earlier work from our lab used the technique of labeling a buried Cys to study the ‘domain unfolding’ model. They used mutant FNs containing a buried Cys in a single FNIII domain and found that 6 of the 15 FNIII domains label in matrix fibrils. Domain unfolding due to tension, matrix associated conformational changes or spontaneous folding and unfolding are all possible explanation for labeling of the buried Cys. The present study also uses the technique of labeling a buried Cys to address whether it is spontaneous folding and unfolding that labels FNIII domains in cell culture. We used thiol reactive DTNB to measure the kinetics of labeling of buried Cys in eleven FN III domains over a wide range of urea concentrations (0-­‐‑9M). The kinetics data were globally fit using Mathematica. The results are equivalent to those of H-­‐‑D exchange, and

provide a comprehensive analysis of stability and unfolding/folding kinetics of each

domain. For two of the six domains spontaneous folding and unfolding is possibly the reason for labeling in cell culture. For the rest of the four domains it is probably matrix associated conformational changes or tension induced unfolding.

A long-­‐‑standing debate in the protein-­‐‑folding field is whether unfolding rate

constants or folding rate constants correlate to the stability of a protein. FNIII domains all have the same ß sandwich structure but very different stabilities and amino acid sequences. Our study analyzed the kinetics of unfolding and folding and stabilities of eleven FNIII domains and our results show that folding rate constants for FNIII domains are relatively similar and the unfolding rates vary widely and correlate to stability. FN forms a fibrillar matrix and the FN-­‐‑FN interactions during matrix fibril formation are not known. FNI 1-­‐‑9 or the N-­‐‑ terminal region is indispensible for matrix formation and its major binding partner has been shown to be FNIII 2. Earlier work from our lab, using FRET analysis showed that the interaction of FNI 1-­‐‑9 with a destabilized FNIII 2 (missing the G strand, FNIII 2ΔG) reduces the FRET efficiency. This efficiency is restored in the presence of FUD (bacterial adhesion from S. pyogenes) that has been known to interact with FNI 1-­‐‑9 via a tandem ß zipper. In the present study we

use FRET analysis and a series of deletion mutants of FNIII 2ΔG to study the shortest fragment of FNIII 2ΔG that is required to bind FNI 1-­‐‑9. Our results presented here are qualitative and show that FNIII 2ΔC’EFG is the shortest fragment required to bind FNI 1-­‐‑9. Deletion of one more strand abolishes the interaction with FNI 1-­‐‑9.

Different domains in abstract concepts

This study is a first attempt to unravel the almost unexplored domain of abstract conceptual knowledge. Four kinds of abstract concepts (nominal kinds, states of the self, cognitive processes, and emotion concepts) were investigated in two experiments. Emotion concepts displayed a specific pattern in both concreteness/abstractness and imagery ratings (cf. Altarriba et al., 1999), as did the other considered domains of abstract knowledge (Experiment 1). In Experiment 2 we highlighted the specific pattern of information (taxonomic, thematic, attributive, etc) these different abstract domains elicited in a definition production task.

Human behaviour recognition in data-scarce domains

This paper presents the novel theory for performing multi-agent activity recognition without requiring large training corpora. The reduced need for data means that robust probabilistic recognition can be performed within domains where annotated datasets are traditionally unavailable. Complex human activities are composed from sequences of underlying primitive activities. We do not assume that the exact temporal ordering of primitives is necessary, so can represent complex activity using an unordered bag. Our three-tier architecture comprises low-level video tracking, event analysis and high-level inference. High-level inference is performed using a new, cascading extension of the Rao–Blackwellised Particle Filter. Simulated annealing is used to identify pairs of agents involved in multi-agent activity. We validate our framework using the benchmarked PETS 2006 video surveillance dataset and our own sequences, and achieve a mean recognition F-Score of 0.82. Our approach achieves a mean improvement of 17% over a Hidden Markov Model baseline.

The concept of transport capacity and its use in different geomorphic process domains

The notion of sediment-transport capacity has been engrained in geomorphological and related literature for over 50 years, although its earliest roots date back explicitly to Gilbert in fluvial geomorphology in the 1870s and implicitly to eighteenth to nineteenth century developments in engineering. Despite cross fertilization between different process domains, there seem to have been independent inventions of the idea in aeolian geomorphology by Bagnold in the 1930s and in hillslope studies by Ellison in the 1940s. Here we review the invention and development of the idea of transport capacity in the fluvial, aeolian, coastal, hillslope, débris flow, and glacial process domains. As these various developments have occurred, different definitions have been used, which makes it both a difficult concept to test, and one that may lead to poor communications between those working in different domains of geomorphology. We argue that the original relation between the power of a flow and its ability to transport sediment can be challenged for three reasons. First, as sediment becomes entrained in a flow, the nature of the flow changes and so it is unreasonable to link the capacity of the water or wind only to the ability of the fluid to move sediment. Secondly, environmental sediment transport is complicated, and the range of processes involved in most movements means that simple relationships are unlikely to hold, not least because the movement of sediment often changes the substrate, which in turn affects the flow conditions. Thirdly, the inherently stochastic nature of sediment transport means that any capacity relationships do not scale either in time or in space. Consequently, new theories of sediment transport are needed to improve understanding and prediction and to guide measurement and management of all geomorphic systems.

Living conditions in old age: Coexisting disadvantages across life domains

The aim of this thesis was to analyse coexisting disadvantages in the older Swedish population. Coexisting disadvantages are those that occur simultaneously in various life domains. A person who simultaneously experiences several disadvantages may be particularly vulnerable and less well-equipped to manage daily life and may also need support from several different welfare service providers. Concerted actions may be needed for older people who experience not only physical health problems and functional limitations, but also other problems. Research that encompasses a wide range of living conditions provides a basis for setting political priorities and making political decisions. The studies in this thesis used data from two Swedish nationally representative surveys: the Level of Living Survey, which includes people aged 18 through 75, and the Swedish Panel Study of Living Conditions of the Oldest Old, which includes people aged 77 and older. Study I showed that the probability of experiencing coexisting disadvantages was higher in people 77 and older than in those aged 18 through 76. These age differences were partly driven by a high prevalence of physical health problems in older people. In all age groups, coexisting disadvantages were more common in women than men. The longitudinal analyses in Study II indicated that coexisting disadvantages in old age persist in some people but are temporary in others. Moreover, the results suggested a pattern of accumulating disadvantages: reporting one disadvantage in young old age (in particular, psychological health problems) increased the probability of reporting coexisting disadvantages in late old age.   Study III showed that physical health problems were a central component of coexisting disadvantages. The results also showed that being older; female; previously employed as a manual labourer; and divorced/separated, widowed or never married were associated with an increased probability of experiencing coexisting disadvantages. However, the experience of coexisting disadvantages differed: the groups associated with coexisting disadvantages tended to report different combinations of disadvantage. Study IV showed that the prevalence of coexisting disadvantages in those 77 and older increased slightly between 1992 and 2011. Physical health problems became more common over time, whereas limited ability to manage daily activities (ADL limitations), limited financial resources and limited political resources became less common. Associations between different disadvantages were found in all survey years, but certain associations changed over time. The results suggest that in general, the composition of coexisting disadvantages in the older population may have altered over time. In sum, results showed that coexisting disadvantages were associated with specific demographic and socio-economic groups. Physical health problems and psychological health problems were of particular importance to the accumulation and coexistence of disadvantages in old age.

Dynamic Resource Allocation in Wireless Heterogeneous Networks

Deployment of low power basestations within cellular networks can potentially increase both capacity and coverage. However, such deployments require efficient resource allocation schemes for managing interference from the low power and macro basestations that are located within each other’s transmission range. In this dissertation, we propose novel and efficient dynamic resource allocation algorithms in the frequency, time and space domains. We show that the proposed algorithms perform better than the current state-of-art resource management algorithms. In the first part of the dissertation, we propose an interference management solution in the frequency domain. We introduce a distributed frequency allocation scheme that shares frequencies between macro and low power pico basestations, and guarantees a minimum average throughput to users. The scheme seeks to minimize the total number of frequencies needed to honor the minimum throughput requirements. We evaluate our scheme using detailed simulations and show that it performs on par with the centralized optimum allocation. Moreover, our proposed scheme outperforms a static frequency reuse scheme and the centralized optimal partitioning between the macro and picos. In the second part of the dissertation, we propose a time domain solution to the interference problem. We consider the problem of maximizing the alpha-fairness utility over heterogeneous wireless networks (HetNets) by jointly optimizing user association, wherein each user is associated to any one transmission point (TP) in the network, and activation fractions of all TPs. Activation fraction of a TP is the fraction of the frame duration for which it is active, and together these fractions influence the interference seen in the network. To address this joint optimization problem which we show is NP-hard, we propose an alternating optimization based approach wherein the activation fractions and the user association are optimized in an alternating manner. The subproblem of determining the optimal activation fractions is solved using a provably convergent auxiliary function method. On the other hand, the subproblem of determining the user association is solved via a simple combinatorial algorithm. Meaningful performance guarantees are derived in either case. Simulation results over a practical HetNet topology reveal the superior performance of the proposed algorithms and underscore the significant benefits of the joint optimization. In the final part of the dissertation, we propose a space domain solution to the interference problem. We consider the problem of maximizing system utility by optimizing over the set of user and TP pairs in each subframe, where each user can be served by multiple TPs. To address this optimization problem which is NP-hard, we propose a solution scheme based on difference of submodular function optimization approach. We evaluate our scheme using detailed simulations and show that it performs on par with a much more computationally demanding difference of convex function optimization scheme. Moreover, the proposed scheme performs within a reasonable percentage of the optimal solution. We further demonstrate the advantage of the proposed scheme by studying its performance with variation in different network topology parameters.

Hexagonal patterns in finite domains

In many mathematical models for pattern formation, a regular hexagonal pattern is stable in an infinite region. However, laboratory and numerical experiments are carried out in finite domains, and this imposes certain constraints on the possible patterns. In finite rectangular domains, it is shown that a regular hexagonal pattern cannot occur if the aspect ratio is rational. In practice, it is found experimentally that in a rectangular region, patterns of irregular hexagons are often observed. This work analyses the geometry and dynamics of irregular hexagonal patterns. These patterns occur in two different symmetry types, either with a reflection symmetry, involving two wavenumbers, or without symmetry, involving three different wavenumbers. The relevant amplitude equations are studied to investigate the detailed bifurcation structure in each case. It is shown that hexagonal patterns can bifurcate subcritically either from the trivial solution or from a pattern of rolls. Numerical simulations of a model partial differential equation are also presented to illustrate the behaviour.

Security and Trust in Distributed Computation

We propose three research problems to explore the relations between trust and security in the setting of distributed computation. In the first problem, we study trust-based adversary detection in distributed consensus computation. The adversaries we consider behave arbitrarily disobeying the consensus protocol. We propose a trust-based consensus algorithm with local and global trust evaluations. The algorithm can be abstracted using a two-layer structure with the top layer running a trust-based consensus algorithm and the bottom layer as a subroutine executing a global trust update scheme. We utilize a set of pre-trusted nodes, headers, to propagate local trust opinions throughout the network. This two-layer framework is flexible in that it can be easily extensible to contain more complicated decision rules, and global trust schemes. The first problem assumes that normal nodes are homogeneous, i.e. it is guaranteed that a normal node always behaves as it is programmed. In the second and third problems however, we assume that nodes are heterogeneous, i.e, given a task, the probability that a node generates a correct answer varies from node to node. The adversaries considered in these two problems are workers from the open crowd who are either investing little efforts in the tasks assigned to them or intentionally give wrong answers to questions. In the second part of the thesis, we consider a typical crowdsourcing task that aggregates input from multiple workers as a problem in information fusion. To cope with the issue of noisy and sometimes malicious input from workers, trust is used to model workers' expertise. In a multi-domain knowledge learning task, however, using scalar-valued trust to model a worker's performance is not sufficient to reflect the worker's trustworthiness in each of the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, we further propose two extended models, one of which handles input tasks with real-valued features and the other handles tasks with text features by incorporating topic models. Our models can effectively recover trust vectors of workers, which can be very useful in task assignment adaptive to workers' trust in the future. These results can be applied for fusion of information from multiple data sources like sensors, human input, machine learning results, or a hybrid of them. In the second subproblem, we address crowdsourcing with adversaries under logical constraints. We observe that questions are often not independent in real life applications. Instead, there are logical relations between them. Similarly, workers that provide answers are not independent of each other either. Answers given by workers with similar attributes tend to be correlated. Therefore, we propose a novel unified graphical model consisting of two layers. The top layer encodes domain knowledge which allows users to express logical relations using first-order logic rules and the bottom layer encodes a traditional crowdsourcing graphical model. Our model can be seen as a generalized probabilistic soft logic framework that encodes both logical relations and probabilistic dependencies. To solve the collective inference problem efficiently, we have devised a scalable joint inference algorithm based on the alternating direction method of multipliers. The third part of the thesis considers the problem of optimal assignment under budget constraints when workers are unreliable and sometimes malicious. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this problem, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraints. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget, and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in a lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms.