A geração de testes para circuitos combinacionais com fan-outs recovergentes é um problema NP-completo. Com o rápido crescimento da complexidade dos circuitos fabricados, a geração de testes passou a ser um sério problema para a indústria de circuitos integrados. Muitos algoritmos de ATPG (Automatic Test Pattern Generation) baseados no algoritmo D, usam heurísticas para guiar o processo de tomada de decisão na propagação n e na justificação das constantes de forma a aumentar sua eficiencia. Existem heurísticas baseadas em medidas funcionais, estruturais e probabilísticas. Estas medidas são normalmente referidas como observabilidade e controlabilidade que fazem parte de um conceito mais geral, a testabilidade. As medidas que o algoritmo utiliza podem ser calculadas apenas uma vez, durante uma etapa de pré-processamento (medidas de testabilidade estáticas - STM's), ou dinamicamente, recalculando estas medidas durante o processamento sempre que elas forem necessárias (medidas de testabilidade dinâmicas — DTM's). Para alguns circuitos, o use de medidas dinâmicas ao invés de medidas estáticas diminui o número de backtrackings pcir vetor gerado. Apesar disto, o tempo total de CPU por vetor aumenta. Assim, as DTM's só devem ser utilizadas quando as STM's não apresentam uma boa performance. Isto pode ser feito utilizando-se as medidas estáticas ate um certo número de backtrackings. Se o padrão de teste não for encontrado, então medidas dinâmicas são utilizadas. Entretanto, a necessário ainda buscar formas de melhorar o processo dinâmico, diminuindo o custo computacional. A proposta original do calculo das DTM's apresenta algumas técnicas, baseadas em selective tracing, com o objetivo de reduzir o custo computacional. Este trabalho analisa o use combinado de heurísticas e propõe técnicas alternativas, na forma das heurísticas de recalculo parcial e recalculo de linhas não free, que visam minimizar o overhead do calculo das DTM's. E proposta ainda a técnica de Pré-implicação que transfere a complexidade do algoritmo para a memória. Isto é feito através de um preprocessamento que armazena informações necessárias para a geração de todos os vetores de teste. De outra forma estas informações teriam de ser calculadas na geração de cada um destes vetores. A implementação do algoritmo D com as várias heurísticas permitiu a realização de um experimento pratico. Isto possibilitou a análise quantitativa da performance do algoritmo D para vários tipos de circuitos e demonstrou a eficiência de uma das heurísticas propostas neste trabalho. / The test generation for combinational circuits that contain reconvergence is a NP-complete problem. With the rapid increase in the complexity of the fabricated circuits, the generation of test patterns poses a serious problem to the IC industry. A number of existing ATPG algorithms based on the D algorithm use heuristics to guide the decision process in the D-propagation and justification to improve the efficiency. The heuristics used by ATPG algorithm are based on structural, functional and probabilistics measures. These measures are commonly referred to as line controllability and observability and they are combined under the , more general notion of testability. The measures used by ATPG algorithms can be computed only once, during a preprocessing stage (static testability measures - STM's) or can be calculated dinamically, updating the testability measures during the test generation process (dymanic testability measures - DTM's). For some circuits, replacing STM's by DTM's decreases the average number of backtrackings per generated vector. Despite these decrease, the total CPU time per generated vector is greater when using DTM's instead of STM's. So, DTM's only must be used if the STM's don't present a good performance. This can be done by STM's until a certain number of backtrackings. If a test pattern has still not been found, then DTM's are used. Therefore, it is yet necessary to search for ways to improve the dynamic process and decrease the CPU time requirements. In the original approach some techniques for reducing the computational overhead of DTM's based on the well-know technique of selective path tracing are presented. In this work, the combined use of heuristics are analised and alternative techniques — the heuristics of partial recalculus and not free lines recalculus — are proposed. These alternative techniques were developed in order to minimize the overhead of the DTM's calculus. It is yet proposed the pre-implication technique which transfers to memory the algorithm complexity. It includes a preprocessing stage which storages all necesary informations to the generation of all test vectors. So, these informations don't need be computed in the generation of each test vector. The implementation of the D-Algorithm with diferent heuristics has possibilited a practical experiment. It was possible to analise the performance of the D-Algorithm on diferent circuit types and to demonstrate the efficiency of one of the proposed heuristics.

Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-01T15:56:45Z No. of bitstreams: 1 arquivototal.pdf: 632195 bytes, checksum: e51e34b7262c30c18127847ceb580629 (MD5) / Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2017-09-01T15:58:15Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 632195 bytes, checksum: e51e34b7262c30c18127847ceb580629 (MD5) / Made available in DSpace on 2017-09-01T15:58:15Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 632195 bytes, checksum: e51e34b7262c30c18127847ceb580629 (MD5) Previous issue date: 2017-04-24 / Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPq / In this work, we studied the controllability cost for the Stokes system. Using the transmutation method, we show that the cost of driving the Stokes system to equilibrium at time T, is of order eC/T as T → 0+, which is of the same order of controllability of heat equation. For this, we have proved a exact controllability for the hyperbolic system with resistence term, by considering a geometric hypothesis on the control region. / Neste trabalho nos dedicamos a estudar o custo de controlabilidade para o sistema de Stokes. Usando o m´etodo da transmuta¸c˜ao, mostraremos que o custo de dirigir o sistema de Stokes ao equil´ıbrio no tempo T ´e de ordem eC/T , quando T → 0+, isto ´e, da mesma ordem de controlabilidade da equa¸c˜ao do calor. Para tornar isso poss´ıvel, provaremos um resultado de controlabilidade exata para o sistema hiperb´olico com termo de resistˆencia, o que ser´a feito com base em hip´oteses sobre a regi˜ao de controle.

Submitted by JOÃO MANOEL SORIANO PITOT null (tribalista22@hotmail.com) on 2017-08-31T13:05:34Z No. of bitstreams: 1 Tese Ficha.pdf: 737367 bytes, checksum: e2b1a948e44236ba2cef5484c4761cd5 (MD5) / Approved for entry into archive by Luiz Galeffi (luizgaleffi@gmail.com) on 2017-09-01T13:38:31Z (GMT) No. of bitstreams: 1 pitot_jms_dr_sjrp.pdf: 737367 bytes, checksum: e2b1a948e44236ba2cef5484c4761cd5 (MD5) / Made available in DSpace on 2017-09-01T13:38:31Z (GMT). No. of bitstreams: 1 pitot_jms_dr_sjrp.pdf: 737367 bytes, checksum: e2b1a948e44236ba2cef5484c4761cd5 (MD5) Previous issue date: 2017-08-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho estudamos o problema de controlabilidade exata na fronteira para um sistema de equações de onda acopladas em paralelo, em domínios suave por partes do plano, sob ação de controle do tipo Neuman. Utilizando o método empregado por D. L. Russell em [33] obtemos controlabilidade em tempo suficientemente grande para dados iniciais de energia finita e controle de quadrado integrável. A fim de obter tempo de controle próximo a valores ótimos, procedemos como em [21]: estendemos a solução do problema de Cauchy para tempo complexo e provamos que o operador solução associado ao problema de Cauchy é compacto e depende analiticamente do tempo num setor adequado do plano complexo. Utilizando decaimento local de energia, analiticidade e compacidade do operador solução obtemos o resultado desejado. / In this work we study the problem of exact controllability on the boundary for a system of wave equations coupled in parallel, in piecewise smooth domains of the plane, under the action of control of Neuman type. Using the method employed by D. L. Russell in [33] we obtain controllability in time sufficiently large for initial data of finite energy and square integrable control. In order to obtain control time close to optimal values, we proceed as in [21]: we extend the solution of the Cauchy problem to complex time and we prove that the solution operator associated with the Cauchy problem is compact and depends analytically of the time in an appropriate sector of the complex plane. Using local decay of energy, analyticity and compactness of the solution operator we obtain the desired result.

Made available in DSpace on 2015-05-15T11:46:18Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 1803826 bytes, checksum: 7e6b888ce249e6a65e6ceb39484c36e5 (MD5) Previous issue date: 2010-08-31 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In the present work, we study controllability results for two problems on the theory of the partial differential equations. We use global Carleman inequalities to show the null controllability for the heat equation and for a PDE with complex principal part. We obtain the control of minimal norm solving a dual minimization problem. / No presente trabalho, estudaremos resultados de controlabilidade para dois problemas da teoria das equações diferenciais parciais. Por meio de estimativas globais de Carleman, mostraremos detalhadamente a controlabilidade nula para a equação do calor e para uma equação diferencial parcial com parte principal complexa. Obteremos o controle de norma mínima resolvendo um problema dual de minimização.

Este trabalho apresenta a formulação de um problema de otimização topológica para o posicionamento ótimo de atuadores baseado na teoria de controle. A estrutura é composta por dois materiais: um material passivo elástico e um material ativo piezelétrico, ambos lineares. Pretende-se obter um sistema de controle no qual todos os estados sejam controláveis. O processo de otimização topológica busca a distribuição de material piezelétrico que maximize o menor autovalor do Gramiano de controlabilidade garantindo, assim, sua não singularidade e, consequentemente, que o sistema seja completamente controlável. Programação linear sequencial (SLP) é utilizada para a solução do problema de otimização e as sensibilidades para o modelo de elementos finitos são deduzidas para a função objetivo e restrições. Análises modais das topologias ótimas são utilizadas para a definição de um controlador LQR e as respostas das estruturas controladas submetidas à uma carga impulsiva são analisadas. / This work presents a topology optimization formulation for the actuator placement based on the control theory. The structure is composed by two materials: a passive elastic material and an active piezoelectric material, both linear. The aim is to obtain a control system which all states are controllable. The topology optimization process searches the piezoelectric material distribution which maximizes the smallest eigenvalue of the controllability Gramian ensuring its non-singularity and, therefore, the system is completely controllable. Sequential linear programming (SLP) is used to solve the optimization problem. The sensitivities for the finite element model were derived for the objective function and constraints. Modal analysis from the optimal topologies were employed in an LQR controller and the responses for the controlled structures submitted to an impulsive load are analyzed.

CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior / Esta tese trata do controle nulo local de um problema de fronteira-livre para a equaÃÃo do calor semilinear 1D com controles distribuÃdos (apoiado localmente no espaÃo) ou controles de fronteira (atuando em x = 0). provamos que, se o tempo final T à fixado e o estado inicial à suficientemente pequeno, existe controles que dirigem o estado exatamente para descansar no tempo t = T. AlÃm disso, analisamos a controlabilidade nulo de um sistema nÃo-linear 1D que modela a interaÃÃo de um fluido e sua fronteira. O fluido à governado pela equaÃÃo de Burgers viscosa e os controles distribuÃdos. Por Ãltimo, vamos lidar com o sistema de Navier-Stokes e Boussinesq 3D, definido em um cubo. Neste contexto, provamos um resultado sobre a sua controlabilidade aproximada global por meio de controles de fronteira que atuam em alguma parte da faces do cubo. / This Thesis deals with the local null control of a free-boundary problem for the 1D semilinear heat equation with distributed controls (locally supported in space) or boundary controls (acting at x = 0). we prove that, if the final time T is fixed and the initial state is sufficiently small, there exists controls that drive the state exactly to rest at time t = T. Furthermore, we analyze the null controllability of a 1D nonlinear system which models the interaction of a fluid and its boundary. The fluid is governed by the viscous Burgers equation and the distributed controls. Lastly, we deal with the 3D Navier-Stokes and Boussinesq system, posed in a cube. In this context, we prove a result concerning its global approximate controllability by means of boundary controls which act in some part of cube faces.

A geração de testes para circuitos combinacionais com fan-outs recovergentes é um problema NP-completo. Com o rápido crescimento da complexidade dos circuitos fabricados, a geração de testes passou a ser um sério problema para a indústria de circuitos integrados. Muitos algoritmos de ATPG (Automatic Test Pattern Generation) baseados no algoritmo D, usam heurísticas para guiar o processo de tomada de decisão na propagação n e na justificação das constantes de forma a aumentar sua eficiencia. Existem heurísticas baseadas em medidas funcionais, estruturais e probabilísticas. Estas medidas são normalmente referidas como observabilidade e controlabilidade que fazem parte de um conceito mais geral, a testabilidade. As medidas que o algoritmo utiliza podem ser calculadas apenas uma vez, durante uma etapa de pré-processamento (medidas de testabilidade estáticas - STM's), ou dinamicamente, recalculando estas medidas durante o processamento sempre que elas forem necessárias (medidas de testabilidade dinâmicas — DTM's). Para alguns circuitos, o use de medidas dinâmicas ao invés de medidas estáticas diminui o número de backtrackings pcir vetor gerado. Apesar disto, o tempo total de CPU por vetor aumenta. Assim, as DTM's só devem ser utilizadas quando as STM's não apresentam uma boa performance. Isto pode ser feito utilizando-se as medidas estáticas ate um certo número de backtrackings. Se o padrão de teste não for encontrado, então medidas dinâmicas são utilizadas. Entretanto, a necessário ainda buscar formas de melhorar o processo dinâmico, diminuindo o custo computacional. A proposta original do calculo das DTM's apresenta algumas técnicas, baseadas em selective tracing, com o objetivo de reduzir o custo computacional. Este trabalho analisa o use combinado de heurísticas e propõe técnicas alternativas, na forma das heurísticas de recalculo parcial e recalculo de linhas não free, que visam minimizar o overhead do calculo das DTM's. E proposta ainda a técnica de Pré-implicação que transfere a complexidade do algoritmo para a memória. Isto é feito através de um preprocessamento que armazena informações necessárias para a geração de todos os vetores de teste. De outra forma estas informações teriam de ser calculadas na geração de cada um destes vetores. A implementação do algoritmo D com as várias heurísticas permitiu a realização de um experimento pratico. Isto possibilitou a análise quantitativa da performance do algoritmo D para vários tipos de circuitos e demonstrou a eficiência de uma das heurísticas propostas neste trabalho. / The test generation for combinational circuits that contain reconvergence is a NP-complete problem. With the rapid increase in the complexity of the fabricated circuits, the generation of test patterns poses a serious problem to the IC industry. A number of existing ATPG algorithms based on the D algorithm use heuristics to guide the decision process in the D-propagation and justification to improve the efficiency. The heuristics used by ATPG algorithm are based on structural, functional and probabilistics measures. These measures are commonly referred to as line controllability and observability and they are combined under the , more general notion of testability. The measures used by ATPG algorithms can be computed only once, during a preprocessing stage (static testability measures - STM's) or can be calculated dinamically, updating the testability measures during the test generation process (dymanic testability measures - DTM's). For some circuits, replacing STM's by DTM's decreases the average number of backtrackings per generated vector. Despite these decrease, the total CPU time per generated vector is greater when using DTM's instead of STM's. So, DTM's only must be used if the STM's don't present a good performance. This can be done by STM's until a certain number of backtrackings. If a test pattern has still not been found, then DTM's are used. Therefore, it is yet necessary to search for ways to improve the dynamic process and decrease the CPU time requirements. In the original approach some techniques for reducing the computational overhead of DTM's based on the well-know technique of selective path tracing are presented. In this work, the combined use of heuristics are analised and alternative techniques — the heuristics of partial recalculus and not free lines recalculus — are proposed. These alternative techniques were developed in order to minimize the overhead of the DTM's calculus. It is yet proposed the pre-implication technique which transfers to memory the algorithm complexity. It includes a preprocessing stage which storages all necesary informations to the generation of all test vectors. So, these informations don't need be computed in the generation of each test vector. The implementation of the D-Algorithm with diferent heuristics has possibilited a practical experiment. It was possible to analise the performance of the D-Algorithm on diferent circuit types and to demonstrate the efficiency of one of the proposed heuristics.

Este trabalho apresenta a formulação de um problema de otimização topológica para o posicionamento ótimo de atuadores baseado na teoria de controle. A estrutura é composta por dois materiais: um material passivo elástico e um material ativo piezelétrico, ambos lineares. Pretende-se obter um sistema de controle no qual todos os estados sejam controláveis. O processo de otimização topológica busca a distribuição de material piezelétrico que maximize o menor autovalor do Gramiano de controlabilidade garantindo, assim, sua não singularidade e, consequentemente, que o sistema seja completamente controlável. Programação linear sequencial (SLP) é utilizada para a solução do problema de otimização e as sensibilidades para o modelo de elementos finitos são deduzidas para a função objetivo e restrições. Análises modais das topologias ótimas são utilizadas para a definição de um controlador LQR e as respostas das estruturas controladas submetidas à uma carga impulsiva são analisadas. / This work presents a topology optimization formulation for the actuator placement based on the control theory. The structure is composed by two materials: a passive elastic material and an active piezoelectric material, both linear. The aim is to obtain a control system which all states are controllable. The topology optimization process searches the piezoelectric material distribution which maximizes the smallest eigenvalue of the controllability Gramian ensuring its non-singularity and, therefore, the system is completely controllable. Sequential linear programming (SLP) is used to solve the optimization problem. The sensitivities for the finite element model were derived for the objective function and constraints. Modal analysis from the optimal topologies were employed in an LQR controller and the responses for the controlled structures submitted to an impulsive load are analyzed.

La régulation de la concentration de glucose dans l'organisme est nécessaire au bon fonctionnement des globules rouges et de l'ensemble des cellules, dont celles des muscles et du cerveau. Cette régulation met en jeu plusieurs organes ainsi que le système hormonal dont une hormone en particulier, l’insuline. Le diabète de type 1 est une maladie où les cellules productrices d'insuline du pancréas sont détruites. Afin de compenser cette perte de production d'insuline, le traitement de cette maladie consiste, pour le patient, à déterminer une dose d'insuline à s'injecter en fonction de mesures de sa glycémie et de certaines caractéristiques intervenant dans la régulation de celle-ci (repas, activité physique, stress,...). Cette thèse s'inscrit dans une démarche d’automatisation du traitement en proposant un nouveau modèle non-linéaire du métabolisme glucidique pouvant être utilisé dans une solution de contrôle en boucle fermée. Nous avons prouvé que ce modèle possède une unique solution positive et bornée pour des conditions initiales fixées et sa commandabilité locale. Nous nous sommes ensuite intéressés à l’identification paramétrique de ce modèle. Nous avons montré son identifiabilité structurelle et pratique. Dans ce cadre, une nouvelle méthodologie permettant de qualifier l'identifiabilité pratique d'un modèle, basée sur une divergence de Kullback-Leibler, a été proposée. Une estimation des paramètres du modèle a été réalisée à partir de données de patients réels. Dans ce but, une méthodologie d'estimation robuste, basée sur un critère de Huber, a été utilisée. Les résultats obtenus ont montré la pertinence du nouveau modèle proposé. / The development of new control models to represent more accurately the plasma glucose-insulin dynamics in T1DM is needed for efficient closed-loop algorithms. In this PhD thesis, we proposed a new nonlinear model of five time-continuous state equations with the aim to identify its parameters from easily available real patients' data (i.e. data from the insulin pump and the glucose monitoring system. Its design is based on two assumptions. Firstly, two successive remote compartments, one for insulin and one for glucose issued from the meal, are introduced to account for the distribution of the insulin and the glucose in the organism. Secondly, the insulin action in glucose disappearance is modeled through an original nonlinear form. The mathematical properties of this model have been studied and we proved that a unique, positive and bounded solution exists for a fixed initial condition. It is also shown that the model is locally accessible. In this way, it can so be used as a control model. We proved the structural identifiability of this model and proposed a new method based on the Kullback-Leiber divergence in view to test its practical identifiability. The parameters of the model were estimated from real patients' data. The obtained mean fit indicates a good approximation of the glucose metabolism of real patients. The predictions of the model approximate accurately the glycemia of the studied patients during few hours. Finally, the obtained results let us validate the relevance of this new model as a control model in view to be applied to closed-loop algorithms.

Earlier studies in the context of windows and blinds selection have mostly tried to increase the awareness regarding various effects of windows and blinds selection on subjective well-being, including their effect on visual comfort, thermal comfort, energy consumption and life cycle cost. However, the main problem is the potential conflicts between visual comfort, thermal comfort, energy consumption and life cycle cost. Increased awareness about the contradictory effect of windows and blinds selection on subjective well-being on one hand and lack of a feasible method in managing the conflicts on the other hand may bind individuals, as decision-makers, in a situation where they follow the immediate economic benefits rather than the long-term visual and thermal benefits. To solve the mentioned problem, this study analysed first the degree of the conflicts between average daylight illuminance and total energy consumption in Sweden. This decision was made due to large variation in solar elevation angle and solar intensity between summer and winter in Sweden, which has significant effects on daylight illuminance and total energy consumption. Analysing the conflicts was accomplished by developing two multivariate linear regression models for calculating average daylight illuminance and total energy consumption. Comparison and analysis of the multivariate linear regression models showed the existence of a high degree of conflicts, which makes window and blind selection a rather complex multidimensional problem. Specifying the degree of the conflicts formed a hypothesis as: “A multi criteria decision-making method increases the controllability and manages the conflicts in selecting windows and blinds”. The developed hypothesis was later tested by employing analytical hierarchy process, as widely used multi criteria decisionmaking method. The analytical hierarchy process prioritizes decision-maker’ preferences and introduces a desired trade-off solution. The results of employing analytical hierarchy process showed the capability of it in managing the conflicts among visual comfort, thermal comfort, energy consumption and life cycle cost. Finally, the application of the analytical hierarchy process was expanded by integrating it with nondominated sorting genetic algorithm-II, as an optimization algorithm. Through this integration, optimization algorithm combines windows’ and blinds’ design variables and analyses a large number of solutions, while analytical hierarchy process ranks the solutions based on decision-makers’ preferences and introduces a desired trade-off solution. The integration between analytical hierarchy process and the nondominated sorting genetic algorithm-II was presented later as a conceptual framework. The developed conceptual framework can be used for selecting windows and blinds II in both residential and commercial buildings. In selecting windows and blinds, the conceptual framework is a novel solution to the lack of a feasible method for increasing the controllability for decision-makers and obtaining a desired trade-off solution. / Tidigare studier avseende val av fönster och solskydd har främst försökt fastställa olika effekter som valet av fönster och solskydd har på det subjektiva välbefinnandet. Detta inkluderar dessa föremåls effekt på den visuella komforten, den termiska komforten, energiförbrukningen och livscykelkostnaderna. Det huvudsakliga problemet är dock de potentiella konflikterna mellan visuell komfort, termisk komfort, energiförbrukning och livscykelkostnader. Avsaknaden av en metod för att hantera denna konflikt leder till att beslutfattaren fastnar i en situation där de snarare gör sitt val utifrån omedelbara ekonomiska fördelar än de långsiktiga visuella och termiska fördelarna. För att lösa ovan nämnda problem analyserades konflikterna mellan det genomsnittliga dagsljusinsläppet och den totala energiförbrukningen i Sverige. En av huvudanledningarna till konflikterna är att solens infallsvinkel och intensitet varierar kraftigt mellan sommar och vinter i Sverige. Detta har betydande effekter på dagsljusinfallet och den totala energiförbrukningen. Konflikterna analyserades genom att utveckla två multivariata linjära regressionsmodeller för att beräkna det genomsnittliga dagsljusinfallet och den totala energiförbrukningen. En jämförelse och analys av de multivariata linjära regressionsmodellerna påvisade en hög grad av konflikter, vilket gör valet av fönster och solskydd till ett komplext och flerdimensionellt problem. Bestämningen av graden av konflikt formade följande hypotes: ” En multikriterieanalysbaserat beslutsstöd ökar kontrollerbarheten och hanterar konflikter vid valet av fönster och solskydd”. Den utvecklade hypotesen testades senare med hjälp av Analytical Hierarchy Process (AHP), en ofta använd multikriterieanalys metod för beslutsfattande. Metoden tar fram lösningar genom att göra prioriteringar enligt beslutsfattarens preferenser. Resultaten av att tillämpa metoden visade metodens förmåga att lösa konflikterna kring visuell komfort, termisk komfort, energiförbrukning och livscykelkostnad. Slutligen utökades metoden genom att integrera AHP med optimeringsalgoritmen Non-dominated sorting genetic algorithm-II. Genom denna integrering kombinerar optimeringsalgoritmen fönstrens och solskyddens design variabler till ett stort antal lösningsförslag. Dessa lösningsförslag analyseras och till sist rangordnas lösningsförslagen med hjälp av AHP baserat på beslutsfattarnas preferenser. Integreringen av AHP och optimeringsalgoritmen presenterades som ett konceptuellt ramverk. I valet av fönster och solskydd är det konceptuella ramverket en ny lösning för att öka den upplevda kontrollen och därmed förstärka det subjektiva välbefinnandet. / ProWood