Pulse mixing by Fibonacci and Thue-Morse ordered semiconductor layers

The properties of combinatorial frequency generation by two-tone Gaussian pulses incident at oblique angles on quasiperiodic (Fibonacci and Thue-Morse) stacks of binary semiconductor layers are discussed. The analysis has been performed using the self-consistent model taking into account the nonlinear dynamics of mobile charges in the layers. The effects of the stack arrangements and constituent layer parameters on the combinatorial frequency waveforms are presented for the specific structures of both types

Nonreciprocal nonlinear scattering by stacked magnetoactive semiconductor layers

The combinatorial frequency generation by the periodic stacks of magnetically biased semiconductor layers has been modelled in the self-consistent problem formulation, taking into account the nonlinear dynamics of carriers. It has been shown that the nonlinear response of the magnetoactive semiconductor periodic structure is strongly enhanced by magnetic bias and combinations of the layer physical and geometrical parameters. The effects of the pump wave nonreciprocal reflectance and field displacement on the efficiency of three-wave mixing process is illustrated by the simulation results

Abstract 1905: Defining a therapeutic classification of breast cancer by actionable targets

Breast cancer remains a frequent cause of female cancer death despite the great strides in elucidation of biological subtypes and their reported clinical and prognostic significance. We have defined a general cohort of breast cancers in terms of putative actionable targets, involving growth and proliferative factors, the cell cycle, and apoptotic pathways, both as single biomarkers across a general cohort and within intrinsic molecular subtypes.

We identified 293 patients treated with adjuvant chemotherapy. Additional hormonal therapy and trastuzumab was administered depending on hormonal and HER2 status respectively. We performed immunohistochemistry for ER, PR, HER2, MM1, CK5/6, p53, TOP2A, EGFR, IGF1R, PTEN, p-mTOR and e-cadherin. The cohort was classified into luminal (62%) and non-luminal (38%) tumors as well as luminal A (27%), luminal B HER2 negative (22%) and positive (12%), HER2 enriched (14%) and triple negative (25%). Patients with luminal tumors and co-overexpression of TOP2A or IGF1R loss displayed worse overall survival (p=0.0251 and p=0.0008 respectively). Non-luminal tumors had much greater heterogeneous expression profiles with no individual markers of prognostic significance. Non-luminal tumors were characterised by EGFR and TOP2A overexpression, IGF1R, PTEN and p-mTOR negativity and extreme p53 expression.

Our results indicate that only a minority of intrinsic subtype tumors purely express single novel actionable targets. This lack of pure biomarker expression is particular prevalent in the triple negative subgroup and may allude to the mechanism of targeted therapy inaction and myriad disappointing trial results. Utilising a combinatorial biomarker approach may enhance studies of targeted therapies providing additional information during design and patient selection while also helping decipher negative trial results.

Microneedle applications in improving skin appearance

Microneedles (MNs) are micron-sized, minimally invasive devices that breach the outermost layer of the skin, the stratum corneum (SC), creating transient, aqueous pores in the skin and facilitating the transport of therapeutic molecules into the epidermis. Following many years of extensive research in the area of MN-mediated trans- and intra-dermal drug delivery, MNs are now being exploited in the cosmeceutical industry as a means of disrupting skin cell architecture, inducing elastin and collagen expression and deposition. They are also being used as vehicles to deliver cosmeceutic molecules across the skin, in addition to their use in combinatorial treatments with topical agents or light sources. This review explores the chronology of microneedling methodologies, which has led to the emergence of MN devices, now extensively used in cosmeceutical applications. Recent developments in therapeutic molecule and peptide delivery to the skin via MN platforms are addressed and some commercially available MN devices are described. Important safety and regulatory considerations relating to MN usage are addressed, as are studies relating to public perception of MN, as these will undoubtedly influence the acceptance of MN products as they progress towards commercialisation.

Marine-derived quorum-sensing inhibitory activities enhance the antibacterial efficacy of tobramycin against Pseudomonas aeruginosa

Bacterial epiphytes isolated from marine eukaryotes were screened for the production of quorum sensing inhibitory compounds (QSIs). Marine isolate KS8, identified as a Pseudoalteromonas sp., was found to display strong quorum sensing inhibitory (QSI) activity against acyl homoserine lactone (AHL)-based reporter strains Chromobacterium violaceum ATCC 12472 and CV026. KS8 supernatant significantly reduced biofilm biomass during biofilm formation (−63%) and in pre-established, mature P. aeruginosa PAO1 biofilms (−33%). KS8 supernatant also caused a 0.97-log reduction (−89%) and a 2-log reduction (−99%) in PAO1 biofilm viable counts in the biofilm formation assay and the biofilm eradication assay respectively. The crude organic extract of KS8 had a minimum inhibitory concentration (MIC) of 2 mg/mL against PAO1 but no minimum bactericidal concentration (MBC) was observed over the concentration range tested (MBC > 16 mg/mL). Sub-MIC concentrations (1 mg/mL) of KS8 crude organic extract significantly reduced the quorum sensing (QS)-dependent production of both pyoverdin and pyocyanin in P. aeruginosa PAO1 without affecting growth. A combinatorial approach using tobramycin and the crude organic extract at 1 mg/mL against planktonic P. aeruginosa PAO1 was found to increase the efficacy of tobramycin ten-fold, decreasing the MIC from 0.75 to 0.075 µg/mL. These data support the validity of approaches combining conventional antibiotic therapy with non-antibiotic compounds to improve the efficacy of current treatments.

The molecular signature of the stroma response in prostate cancer-induced osteoblastic bone metastasis highlights expansion of hematopoietic and prostate epithelial stem cell niches

The reciprocal interaction between cancer cells and the tissue-specific stroma is critical for primary and metastatic tumor growth progression. Prostate cancer cells colonize preferentially bone (osteotropism), where they alter the physiological balance between osteoblast-mediated bone formation and osteoclast-mediated bone resorption, and elicit prevalently an osteoblastic response (osteoinduction). The molecular cues provided by osteoblasts for the survival and growth of bone metastatic prostate cancer cells are largely unknown. We exploited the sufficient divergence between human and mouse RNA sequences together with redefinition of highly species-specific gene arrays by computer-aided and experimental exclusion of cross-hybridizing oligonucleotide probes. This strategy allowed the dissection of the stroma (mouse) from the cancer cell (human) transcriptome in bone metastasis xenograft models of human osteoinductive prostate cancer cells (VCaP and C4-2B). As a result, we generated the osteoblastic bone metastasis-associated stroma transcriptome (OB-BMST). Subtraction of genes shared by inflammation, wound healing and desmoplastic responses, and by the tissue type-independent stroma responses to a variety of non-osteotropic and osteotropic primary cancers generated a curated gene signature ("Core" OB-BMST) putatively representing the bone marrow/bone-specific stroma response to prostate cancer-induced, osteoblastic bone metastasis. The expression pattern of three representative Core OB-BMST genes (PTN, EPHA3 and FSCN1) seems to confirm the bone specificity of this response. A robust induction of genes involved in osteogenesis and angiogenesis dominates both the OB-BMST and Core OB-BMST. This translates in an amplification of hematopoietic and, remarkably, prostate epithelial stem cell niche components that may function as a self-reinforcing bone metastatic niche providing a growth support specific for osteoinductive prostate cancer cells. The induction of this combinatorial stem cell niche is a novel mechanism that may also explain cancer cell osteotropism and local interference with hematopoiesis (myelophthisis). Accordingly, these stem cell niche components may represent innovative therapeutic targets and/or serum biomarkers in osteoblastic bone metastasis.

Characterizing and Extending Answer Set Semantics using Possibility Theory

Answer Set Programming (ASP) is a popular framework for modelling combinatorial problems. However, ASP cannot be used easily for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, whereas this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.

Inhibition of O-GlcNAc transferase activity reprograms prostate cancer cell metabolism

Metabolic networks are highly connected and complex, but a single enzyme, O-GlcNAc transferase (OGT) can sense the availability of metabolites and also modify target proteins. We show that inhibition of OGT activity inhibits the proliferation of prostate cancer cells, leads to sustained loss of c-MYC and suppresses the expression of CDK1, elevated expression of which predicts prostate cancer recurrence (p=0.00179). Metabolic profiling revealed decreased glucose consumption and lactate production after OGT inhibition. This decreased glycolytic activity specifically sensitized prostate cancer cells, but not cells representing normal prostate epithelium, to inhibitors of oxidative phosphorylation (rotenone and metformin). Intra-cellular alanine was depleted upon OGT inhibitor treatment. OGT inhibitor increased the expression and activity of alanine aminotransferase (GPT2), an enzyme that can be targeted with a clinically approved drug, cycloserine. Simultaneous inhibition of OGT and GPT2 inhibited cell viability and growth rate, and additionally activated a cell death response. These combinatorial effects were predominantly seen in prostate cancer cells, but not in a cell-line derived from normal prostate epithelium. Combinatorial treatments were confirmed with two inhibitors against both OGT and GPT2. Taken together, here we report the reprogramming of energy metabolism upon inhibition of OGT activity, and identify synergistically lethal combinations that are prostate cancer cell specific.

Microneedles: A New Frontier in Nanomedicine Delivery

This review aims to concisely chart the development of two individual research fields, namely nanomedicines, with specific emphasis on nanoparticles (NP) and microparticles (MP), and microneedle (MN) technologies, which have, in the recent past, been exploited in combinatorial approaches for the efficient delivery of a variety of medicinal agents across the skin. This is an emerging and exciting area of pharmaceutical sciences research within the remit of transdermal drug delivery and as such will undoubtedly continue to grow with the emergence of new formulation and fabrication methodologies for particles and MN. Firstly, the fundamental aspects of skin architecture and structure are outlined, with particular reference to their influence on NP and MP penetration. Following on from this, a variety of different particles are described, as are the diverse range of MN modalities currently under development. The review concludes by highlighting some of the novel delivery systems which have been described in the literature exploiting these two approaches and directs the reader towards emerging uses for nanomedicines in combination with MN.

Synthesis of FPGA-based accelerators implementing recursive algorithms

O desenvolvimento de sistemas computacionais é um processo complexo, com múltiplas etapas, que requer uma análise profunda do problema, levando em consideração as limitações e os requisitos aplicáveis. Tal tarefa envolve a exploração de técnicas alternativas e de algoritmos computacionais para optimizar o sistema e satisfazer os requisitos estabelecidos. Neste contexto, uma das mais importantes etapas é a análise e implementação de algoritmos computacionais. Enormes avanços tecnológicos no âmbito das FPGAs (Field-Programmable Gate Arrays) tornaram possível o desenvolvimento de sistemas de engenharia extremamente complexos. Contudo, o número de transístores disponíveis por chip está a crescer mais rapidamente do que a capacidade que temos para desenvolver sistemas que tirem proveito desse crescimento. Esta limitação já bem conhecida, antes de se revelar com FPGAs, já se verificava com ASICs (Application-Specific Integrated Circuits) e tem vindo a aumentar continuamente. O desenvolvimento de sistemas com base em FPGAs de alta capacidade envolve uma grande variedade de ferramentas, incluindo métodos para a implementação eficiente de algoritmos computacionais. Esta tese pretende proporcionar uma contribuição nesta área, tirando partido da reutilização, do aumento do nível de abstracção e de especificações algorítmicas mais automatizadas e claras. Mais especificamente, é apresentado um estudo que foi levado a cabo no sentido de obter critérios relativos à implementação em hardware de algoritmos recursivos versus iterativos. Depois de serem apresentadas algumas das estratégias para implementar recursividade em hardware mais significativas, descreve-se, em pormenor, um conjunto de algoritmos para resolver problemas de pesquisa combinatória (considerados enquanto exemplos de aplicação). Versões recursivas e iterativas destes algoritmos foram implementados e testados em FPGA. Com base nos resultados obtidos, é feita uma cuidada análise comparativa. Novas ferramentas e técnicas de investigação que foram desenvolvidas no âmbito desta tese são também discutidas e demonstradas.

Geometric optimization on visibility problems: metaheuristic and exact solutions

Os problemas de visibilidade têm diversas aplicações a situações reais. Entre os mais conhecidos, e exaustivamente estudados, estão os que envolvem os conceitos de vigilância e ocultação em estruturas geométricas (problemas de vigilância e ocultação). Neste trabalho são estudados problemas de visibilidade em estruturas geométricas conhecidas como polígonos, uma vez que estes podem representar, de forma apropriada, muitos dos objectos reais e são de fácil manipulação computacional. O objectivo dos problemas de vigilância é a determinação do número mínimo de posições para a colocação de dispositivos num dado polígono, de modo a que estes dispositivos consigam “ver” a totalidade do polígono. Por outro lado, o objectivo dos problemas de ocultação é a determinação do número máximo de posições num dado polígono, de modo a que quaisquer duas posições não se consigam “ver”. Infelizmente, a maior parte dos problemas de visibilidade em polígonos são NP-difíceis, o que dá origem a duas linhas de investigação: o desenvolvimento de algoritmos que estabelecem soluções aproximadas e a determinação de soluções exactas para classes especiais de polígonos. Atendendo a estas duas linhas de investigação, o trabalho é dividido em duas partes. Na primeira parte são propostos algoritmos aproximados, baseados essencialmente em metaheurísticas e metaheurísticas híbridas, para resolver alguns problemas de visibilidade, tanto em polígonos arbitrários como ortogonais. Os problemas estudados são os seguintes: “Maximum Hidden Vertex Set problem”, “Minimum Vertex Guard Set problem”, “Minimum Vertex Floodlight Set problem” e “Minimum Vertex k-Modem Set problem”. São também desenvolvidos métodos que permitem determinar a razão de aproximação dos algoritmos propostos. Para cada problema são implementados os algoritmos apresentados e é realizado um estudo estatístico para estabelecer qual o algoritmo que obtém as melhores soluções num tempo razoável. Este estudo permite concluir que as metaheurísticas híbridas são, em geral, as melhores estratégias para resolver os problemas de visibilidade estudados. Na segunda parte desta dissertação são abordados os problemas “Minimum Vertex Guard Set”, “Maximum Hidden Set” e “Maximum Hidden Vertex Set”, onde são identificadas e estudadas algumas classes de polígonos para as quais são determinadas soluções exactas e/ou limites combinatórios.

A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph

A family of quadratic programming problems whose optimal values are upper bounds on the independence number of a graph is introduced. Among this family, the quadratic programming problem which gives the best upper bound is identified. Also the proof that the upper bound introduced by Hoffman and Lovász for regular graphs is a particular case of this family is given. In addition, some new results characterizing the class of graphs for which the independence number attains the optimal value of the above best upper bound are given. Finally a polynomial-time algorithm for approximating the size of the maximum independent set of an arbitrary graph is described and the computational experiments carried out on 36 DIMACS clique benchmark instances are reported.

O problema da árvore de suporte de custo mínimo com restrições de peso

Nesta tese abordam-se várias formulações e diferentes métodos para resolver o Problema da Árvore de Suporte de Custo Mínimo com Restrições de Peso (WMST – Weight-constrained Minimum Spanning Tree Problem). Este problema, com aplicações no desenho de redes de comunicações e telecomunicações, é um problema de Otimização Combinatória NP-difícil. O Problema WMST consiste em determinar, numa rede com custos e pesos associados às arestas, uma árvore de suporte de custo mínimo de tal forma que o seu peso total não exceda um dado limite especificado. Apresentam-se e comparam-se várias formulações para o problema. Uma delas é usada para desenvolver um procedimento com introdução de cortes baseado em separação e que se tornou bastante útil na obtenção de soluções para o problema. Tendo como propósito fortalecer as formulações apresentadas, introduzem-se novas classes de desigualdades válidas que foram adaptadas das conhecidas desigualdades de cobertura, desigualdades de cobertura estendida e desigualdades de cobertura levantada. As novas desigualdades incorporam a informação de dois conjuntos de soluções: o conjunto das árvores de suporte e o conjunto saco-mochila. Apresentam-se diversos algoritmos heurísticos de separação que nos permitem usar as desigualdades válidas propostas de forma eficiente. Com base na decomposição Lagrangeana, apresentam-se e comparam-se algoritmos simples, mas eficientes, que podem ser usados para calcular limites inferiores e superiores para o valor ótimo do WMST. Entre eles encontram-se dois novos algoritmos: um baseado na convexidade da função Lagrangeana e outro que faz uso da inclusão de desigualdades válidas. Com o objetivo de obter soluções aproximadas para o Problema WMST usam-se métodos heurísticos para encontrar uma solução inteira admissível. Os métodos heurísticos apresentados são baseados nas estratégias Feasibility Pump e Local Branching. Apresentam-se resultados computacionais usando todos os métodos apresentados. Os resultados mostram que os diferentes métodos apresentados são bastante eficientes para encontrar soluções para o Problema WMST.

Determination of (0,2)-regular sets in graphs and applications

In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is applied to the determination of maximum matchings in arbitrary graphs.