57 resultados para Quantified real constraint


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Due to usage conditions, hazardous environments or intentional causes, physical and virtual systems are subject to faults in their components, which may affect their overall behaviour. In a ‘black-box’ agent modelled by a set of propositional logic rules, in which just a subset of components is externally visible, such faults may only be recognised by examining some output function of the agent. A (fault-free) model of the agent’s system provides the expected output given some input. If the real output differs from that predicted output, then the system is faulty. However, some faults may only become apparent in the system output when appropriate inputs are given. A number of problems regarding both testing and diagnosis thus arise, such as testing a fault, testing the whole system, finding possible faults and differentiating them to locate the correct one. The corresponding optimisation problems of finding solutions that require minimum resources are also very relevant in industry, as is minimal diagnosis. In this dissertation we use a well established set of benchmark circuits to address such diagnostic related problems and propose and develop models with different logics that we formalise and generalise as much as possible. We also prove that all techniques generalise to agents and to multiple faults. The developed multi-valued logics extend the usual Boolean logic (suitable for faultfree models) by encoding values with some dependency (usually on faults). Such logics thus allow modelling an arbitrary number of diagnostic theories. Each problem is subsequently solved with CLP solvers that we implement and discuss, together with a new efficient search technique that we present. We compare our results with other approaches such as SAT (that require substantial duplication of circuits), showing the effectiveness of constraints over multi-valued logics, and also the adequacy of a general set constraint solver (with special inferences over set functions such as cardinality) on other problems. In addition, for an optimisation problem, we integrate local search with a constructive approach (branch-and-bound) using a variety of logics to improve an existing efficient tool based on SAT and ILP.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This work studies the combination of safe and probabilistic reasoning through the hybridization of Monte Carlo integration techniques with continuous constraint programming. In continuous constraint programming there are variables ranging over continuous domains (represented as intervals) together with constraints over them (relations between variables) and the goal is to find values for those variables that satisfy all the constraints (consistent scenarios). Constraint programming “branch-and-prune” algorithms produce safe enclosures of all consistent scenarios. Special proposed algorithms for probabilistic constraint reasoning compute the probability of sets of consistent scenarios which imply the calculation of an integral over these sets (quadrature). In this work we propose to extend the “branch-and-prune” algorithms with Monte Carlo integration techniques to compute such probabilities. This approach can be useful in robotics for localization problems. Traditional approaches are based on probabilistic techniques that search the most likely scenario, which may not satisfy the model constraints. We show how to apply our approach in order to cope with this problem and provide functionality in real time.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The basic motivation of this work was the integration of biophysical models within the interval constraints framework for decision support. Comparing the major features of biophysical models with the expressive power of the existing interval constraints framework, it was clear that the most important inadequacy was related with the representation of differential equations. System dynamics is often modelled through differential equations but there was no way of expressing a differential equation as a constraint and integrate it within the constraints framework. Consequently, the goal of this work is focussed on the integration of ordinary differential equations within the interval constraints framework, which for this purpose is extended with the new formalism of Constraint Satisfaction Differential Problems. Such framework allows the specification of ordinary differential equations, together with related information, by means of constraints, and provides efficient propagation techniques for pruning the domains of their variables. This enabled the integration of all such information in a single constraint whose variables may subsequently be used in other constraints of the model. The specific method used for pruning its variable domains can then be combined with the pruning methods associated with the other constraints in an overall propagation algorithm for reducing the bounds of all model variables. The application of the constraint propagation algorithm for pruning the variable domains, that is, the enforcement of local-consistency, turned out to be insufficient to support decision in practical problems that include differential equations. The domain pruning achieved is not, in general, sufficient to allow safe decisions and the main reason derives from the non-linearity of the differential equations. Consequently, a complementary goal of this work proposes a new strong consistency criterion, Global Hull-consistency, particularly suited to decision support with differential models, by presenting an adequate trade-of between domain pruning and computational effort. Several alternative algorithms are proposed for enforcing Global Hull-consistency and, due to their complexity, an effort was made to provide implementations able to supply any-time pruning results. Since the consistency criterion is dependent on the existence of canonical solutions, it is proposed a local search approach that can be integrated with constraint propagation in continuous domains and, in particular, with the enforcing algorithms for anticipating the finding of canonical solutions. The last goal of this work is the validation of the approach as an important contribution for the integration of biophysical models within decision support. Consequently, a prototype application that integrated all the proposed extensions to the interval constraints framework is developed and used for solving problems in different biophysical domains.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada para obtenção do grau de Doutor em Engenharia Electrotécnica, especialidade de Sistemas Digitais, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As alterações sociais, culturais, tecnológicas ou puramente virtuais a que se assiste são indiscutíveis e, porventura, irreversíveis. O ritmo da evolução tecnológica não permite pausas. A crescente densidade das redes e a velocidade dos fluxos de informação fazem aumentar a complexidade da análise, contrastando com uma diminuição dos tempos de resposta. Observa-se uma dinâmica cada vez mais acentuada no processo de transição entre a informação e o conhecimento, acelerando os inputs que influenciam ou dominam as práticas sociais, políticas e simbólicas da vida. Este artigo analisa conceitos como “informação” e “conhecimento” e outros, mais geográficos, como “lugar” e “espaço”; e de que forma pode a sua dinâmica influenciar o território, que deixa de ser (apenas) real para passar a ser, também, virtual. A Sociedade do Conhecimento surge a partir da Sociedade da Informação, num contexto evolucional da cadeia de valor “dado-informação-conhecimento-sabedoria” e onde o elevado potencial tecnológico extravasa as noções tradicionais da Geografia. Para ajudar a compreender as mutações observadas no território, explicando as suas causas e consequências surge a Geografia da Sociedade do Conhecimento, um ramo da Geografia vocacionado para a análise do desenvolvimento sócio-económico da sociedade moderna.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Resumo: A decisão da terapêutica hormonal no tratamento do cancro da mama baseiase na determinação do receptor de estrogénio alfa por imunohistoquímica (IHC). Contudo, a presença deste receptor não prediz a resposta em todas as situações, em parte devido a limitações do método IHC. Investigámos se a expressão dos genes ESR1 e ESR2, bem como a metilação dos respectivos promotores, pode estar relacionada com a evolução desfavorável de uma proporção de doentes tratados com tamoxifeno assim como com a perda dos receptores de estrogénio alfa (ERα) e beta (ERß). Amostras de 211 doentes com cancro da mama diagnosticado entre 1988 e 2004, fixadas em formalina e preservadas em parafina, foram utilizadas para a determinação por IHC da presença dos receptores ERα e ERß. O mRNA total do gene ESR1 e os níveis específicos do transcrito derivado do promotor C (ESR1_C), bem como dos transcritos ESR2_ß1, ESR2_ß2/cx, and ESR2_ß5 foram avaliados por Real-time PCR. Os promotores A e C do gene ESR1 e os promotores 0K e 0N do gene ESR2 foram investigados por análise de metilação dos dinucleotidos CpG usando bisulfite-PCR para análise com enzimas de restrição, ou para methylation specific PCR. Atendendo aos resultados promissores relacionados com a metilação do promotor do gene ESR1, complementamos o estudo com um método quantitativo por matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) suportado pelo software Epityper para a medição da metilação nos promotores A e C. Fez-se a avaliação da estabilidade do mRNA nas linhas celulares de cancro da mama MCF-7 e MDA-MB-231 tratadas com actinomicina D. Baixos níveis do transcrito ESR1_C associaram-se a uma melhor sobrevivência global (p = 0.017). Níveis elevados do transcrito ESR1_C associaram-se a uma resposta inferior ao tamoxifeno (HR = 2.48; CI 95% 1.24-4.99), um efeito mais pronunciado em doentes com tumores de fenótipo ERα/PgR duplamente positivo (HR = 3.41; CI 95% 1.45-8.04). A isoforma ESR1_C mostrou ter uma semi-vida prolongada, bem como uma estrutura secundária da região 5’UTR muito mais relaxada em comparação com a isoforma ESR1_A. A análise por Western-blot mostrou que ao nível da 21 proteína, a selectividade de promotores é indistinguivel. Não se detectou qualquer correlação entre os níveis das isoformas do gene ESR2 ou entre a metilação dos promotores do gene ESR2, e a detecção da proteína ERß. A metilação do promotor C do gene ESR1, e não do promotor A, foi responsável pela perda do receptor ERα. Estes resultados sugerem que os níveis do transcrito ESR1_C sejam usados como um novo potencial marcador para o prognóstico e predição de resposta ao tratamento com tamoxifeno em doentes com cancro da mama. Abstract: The decision of endocrine breast cancer treatment relies on ERα IHC-based assessment. However, ER positivity does not predict response in all cases in part due to IHC methodological limitations. We investigated whether ESR1 and ESR2 gene expression and respective promoter methylation may be related to non-favorable outcome of a proportion of tamoxifen treated patients as well as to ERα and ERß loss. Formalin-fixed paraffin-embedded breast cancer samples from 211 patients diagnosed between 1988 and 2004 were submitted to IHC-based ERα and ERß protein determination. ESR1 whole mRNA and promoter C specific transcript levels, as well as ESR2_ß1, ESR2_ß2/cx, and ESR2_ß5 transcripts were assessed by real-time PCR. ESR1 promoters A and C, and ESR2 promoters 0N and 0K were investigated by CpG methylation analysis using bisulfite-PCR for restriction analysis, or methylation specific PCR. Due to the promising results related to ESR1 promoter methylation, we have used a quantification method by matrixassisted laser desorption/ionization time-of-flight mass spectrometry (MALDITOF MS) together with Epityper software to measure methylation at promoters A and C. mRNA stability was assessed in actinomycin D treated MCF-7 and MDA-MB-231 cells. ERα protein was quantified using transiently transfected breast cancer cells. Low ESR1_C transcript levels were associated with better overall survival (p = 0.017). High levels of ESR1_C transcript were associated with non-favorable response in tamoxifen treated patients (HR = 2.48; CI 95% 1.24-4.99), an effect that was more pronounced in patients with ERα/PgR double-positive tumors (HR = 3.41; CI 95% 1.45-8.04). The ESR1_C isoform had a prolonged mRNA half-life and a more relaxed 5’UTR structure compared to ESR1_A isoform. Western-blot analysis showed that at protein level, the promoter selectivity is undistinguishable. There was no correlation between levels of ESR2 isoforms or ESR2 promoter methylation and ERß protein staining. ESR1 promoter C CpG methylation and not promoter A was responsible for ERα loss. We propose ESR1_C levels as a putative novel marker for breast cancer prognosis and prediction of tamoxifen response.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Actas do 17º Congresso da Associação Internacional para a História do Vidro

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada para obtenção do Grau de Doutor em Conservação e Restauro, especialidade de Ciências da Conservação, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Informática, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Ciência Política e Relações Internacionais

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau Mestre em Engenharia Civil,Perfil de Construção

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Trabalho de Projecto apresentado para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Práticas Culturais para Municípios