Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Soave.
Дисертації з теми "Soave"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Soave".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Tessari, Alessandra <1988>. "Marketing Strategy of Italian Wine in Japan: Case of Soave DOC." Master's Degree Thesis, Università Ca' Foscari Venezia, 2015. http://hdl.handle.net/10579/7002.
Повний текст джерелаАнотація:
This study argues how Italian wine is accepted by consumers’ in Japan. In specific, this study chooses Soave DOC wine in Veneto Region. The reasons why Soave wine was accepted by the Japanese consumers has two
characteristics: exotic image by Country of Origin effect of Italy and also its familiarity for them.
The structure of this study is the following.
Chapter I explains the Background, Research Question and Paper configuration.
Chapter II reviews the existing literatures in order to form hypotesis of this study. First, it explains the concept of Country of Origin effect: define Product Country Image (PCI) and Territory of Origin (TOO) concept. These concepts underline the country tradition, the feature that are capable of influence consumers choice when they approach to purchase a product with a “made in” label. Image of Italy for consumers’ in Japan have two different aspects: fashionable and also traditional. The study focuses to Made in Italy features and Japanese consumers’ opinion toward it. Secondly, consumers need are argued about wine. Third, after describing the history of wine also in Japanese wine market focusing on Italian wines, the study practices Marketing strategies in Japan. Fourth using the framework of Brannen (1992), the study argues that when foreign products are accepted by the Japanese market, they have binomial characteristics: exotic and familiar. Based on these literatures, the study constructs its hypothesis as follows: Soave wine was accepted by the consumers in Japan because it has two characteristics of exotic and familiar.
Chapter III is devoted to explain the methodology of the research. Three different researches are conducted. A survey has been sent trough internet to consumers in Japan, both female and male between the ages of 20 up to more
than 50 years old. Therefore, the survey has been made to gather answers able to confirm hypothesis and understand what kind of feeling have Japanese consumers toward Italian wines and Soave wine. Moreover, to confirm my hypothesis this study based to interviews with Mr. Shigeru Hayashi, a famous first sommelier in Japan, and Mr. Aldo Lorenzoni, director of Soave wine Consortium.
Chapter IV analyses the data gathered and verifies the hypothesis. The survey and interviews were focused to notorious image of Italy and familiarity approach with it.
Chapter V argues the findings of the research, gives theoretical and practical implications and describes limitations of this study.
2
Pernumian, Elisa <1997>. "Riflessioni intorno all'istituzione d'una lingua universale di Francesco Soave: analisi e commento." Master's Degree Thesis, Università Ca' Foscari Venezia, 2021. http://hdl.handle.net/10579/20290.
Повний текст джерелаАнотація:
L'elaborato consiste in un'edizione commentata delle "Riflessioni intorno all'istituzione d'una lingua universale" di Gian Francesco Soave (1743-1806) che, nativo di Lugano ma legato per tutta la vita agli ambienti culturali della nostra penisola, è stato uno dei principali rappresentanti del sensismo in Italia. Ricordato in particolare per la propria attività di grammatico e pedagogo durante la riforma scolastica asburgica in Lombardia, nel 1774 pubblica le "Riflessioni" inserendosi tra i numerosi filosofi e intellettuali che, soprattutto nel corso del XVII e XVIII secolo, si sono dedicati alla realizzazione di un linguaggio filosofico perfetto con valore universale.
La tesi tratta in principio il tema della ricerca di una lingua universale, con un excursus diacronico sui principali progetti dal Medioevo fino al secondo Settecento in relazione alla realtà europea e italiana; successivamente l'attenzione si sposta sulla figura di padre Soave, considerandone la vita, le opere e il pensiero; infine si entra nel vivo dell'analisi e commento delle "Riflessioni", con considerazioni linguistiche e stilistiche rapportate alla prosa saggistica settecentesca.
3
Corato, Valentina <1991>. "Trasformazione del paesaggio e crisi ambientale: il caso dell'alluvione a Monteforte d'Alpone e Soave." Master's Degree Thesis, Università Ca' Foscari Venezia, 2016. http://hdl.handle.net/10579/8036.
Повний текст джерелаАнотація:
Partendo da un evento in particolare sarà analizzato il rapporto tra uomo e ambiente in prospettiva sincronica e diacronica. L’alluvione che ha colpito molte zone del Veneto nel novembre 2010 sarà il punto di partenza per analizzare una specifica zona dell’est veronese in prospettiva geografica, storica nonché antropologica. Saranno descritti i mutamenti che hanno portato alla situazione attuale cercando di comprendere come è cambiato il modo di modificare il paesaggio da parte dell’uomo. Quando un evento naturale disastroso si abbatte sulla popolazione l’equilibrio uomo-ambiente viene messo in crisi e ci si interroga sulle responsabilità umane dell’evento, sulla prevedibilità dello stesso e sui modi di ripristinare un equilibrio che permetta di sentirsi sicuri. Per comprendere in che modo queste riflessioni abbiano preso forma nella popolazione è stata condotta un'analisi raccogliendo dati attraverso un questionario su due comuni in provincia di Verona: Monteforte d’Alpone e Soave. L’obiettivo, inoltre, è stato quello di comprendere la percezione del rischio idraulico prima e dopo l’alluvione del 2010, la reazione della popolazione all’evento calamitoso, nonché la sua percezione della crisi ambientale che va al di là del singolo caso analizzato.
4
Pessoa, Filho Pedro de Alcantara. "Equações de estado para compostos auto-associativos : modificação da equação de Redlich-Kwong-Soave por meio da abordagem quimica." [s.n.], 1998. http://repositorio.unicamp.br/jspui/handle/REPOSIP/266370.
Повний текст джерелаАнотація:
Orientador: Rahoma Sadeg Mohamed.Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Quimica
Made available in DSpace on 2018-07-23T11:06:27Z (GMT). No. of bitstreams: 1 PessoaFilho_PedrodeAlcantara_M.pdf: 4377525 bytes, checksum: 4d5c88b6b6ce77ea5708ab3190d7a795 (MD5) Previous issue date: 1998
Resumo: Neste trabalho é apresentada uma modificação da equação de Soave, feita de modo a levar em conta o efeito da auto-associação que ocorre por meio de ligações de hidrogênio; tal modificação é feita considerando-se que o composto auto-associativo seja uma mistura de agregados em equilíbrio químico. O critério de equilíbrio de fases foi estabelecido como a igualdade da fugacidade do monômero em todas as fases coexistentes, não requerendo a obtenção de potenciais, ou fugacidades, que já não houvessem sido obtidos na resolução do equilíbrio químico. O modelo foi aplicado a álcoois puros, utilizando-se dados de hidrocarbonetos para aproximar os do homomorfo e obtendo-se as constantes de equilíbrio por meio do ajuste de dados de pressão de saturação. Os resultados obtidos mostraram uma melhora no cálculo da pressão de saturação, especialmente a baixas temperaturas, de 14 alcanóis e do fenol. O tratamento foi posteriormente estendido a misturas binárias que contenham um álcool e um composto inerte, e utilizado no ajuste de dados de pressão de bolha de 46 sistemas binários álcool / hidrocarboneto, totalizando 133 isotermas. A aplicação do modelo mostrou uma melhora em todos os aspectos, diminuindo sensivelmente os desvios no cálculo do ponto de bolha e composição da fase vapor saturada e correlacionando corretamente os azeótropos presentes. O desenvolvimento de um modelo para compostos que se dimerizam foi feito alterando-se minimamente as hipóteses que fundamentavam o desenvolvimento para álcoois. Dados de pressão de saturação foram bem ajustados, obtendo-se valores coerentes para a entalpia de associação, e houve um acréscimo considerável na qualidade da correlação dos 8 sistemas binários estudados (totalizando 19 isotermas) pela incorporação do efeito da associação, embora ainda haja uma clara possibilidade de melhora
Abstract: In this work, a modification of the Soave equation of state that accounts for self association occurring through hydrogen bonding is presented. The modified equation considers the self-associating fluid as a mixture of linear clusters in chemical equilibrium. The phase equilibrium criterion used was the equality of monomer fugacities in all coexisting phases. No other expressions for the chemical potentialor fugacity coefficients of multimers are required in these calculations. Using hydrocarbons as homomorphs, the model was successfully applied to pure alcohols. Equilibrium constants were obtained through fitting vapor pressure data. Results obtained revealed significant improvements in calculated vapor pressures, particularly at low temperatures, of 14 alkanols and phenol. The. model was subsequently extended to mixtures composed of a self-associating compound and inert ones, and used to correlate Pxy envelops of 46 alcoholl hydrocarbon binary systems at 133 temperatures. Bubble point pressures and vapor phase compositions obtained by the model were found in excellent quantitative agreement with experimental data. ExcelIent qualitative and quantitative description of azeotropic systems was also obtained. For systems where only dimerization occurs, a new model was developed and applied to two pure carboxilic acids and binary systems composed of those acids and inert components. The model was able to correlate pure component vapor pressures as welI as bubble points for 8 binary systems at 19 temperatures fairly well. The predictions, however, were not as accurate as those obtained in infmite linear association systems
Mestrado
Engenharia de Processos
Mestre em Engenharia Química
5
Löchelt, Birte [Verfasser], and Armin [Akademischer Betreuer] Soave. "Verschluss versus Nicht-Verschluss der Entnahmestelle der Mundschleimhaut bei der Urethroplastik : Eine randomisierte, prospektive Studie zu Schmerzen und Komplikationen im Bereich der Mundhöhle / Birte Löchelt ; Betreuer: Armin Soave." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2020. http://d-nb.info/120800283X/34.
Повний текст джерела
6
Santos, Francisleo Luis Silva. "Determinação do comportamento volumetrico e do equilibrio de fases de sistemas contendo compostos associativos usando as equações de estado de redlich-kwong-soave e peng-robinson modificadas por meio da abordagem quimica." [s.n.], 2003. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267660.
Повний текст джерелаАнотація:
Orientador : Rahoma Sadeg Mohamed.Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Quimica
Made available in DSpace on 2018-08-04T00:06:10Z (GMT). No. of bitstreams: 1 Santos_FrancisleoLuisSilva_M.pdf: 5376861 bytes, checksum: d186f96fac9003e2c294ec6e9dd7c7af (MD5) Previous issue date: 2003
Resumo: O conhecimento de propriedades físico-químicas e do comportamento das fases é fundamental no projeto, operação e otimização de processos industriais. Em virtude da dificuldade e do alto custo de obtenção de dados experimentais em grandes faixas de temperatura, pressão e composição, são utilizados modelos para correlacionar ou eventualmente predizer esses dados. Um grupo de substâncias para o qual os modelos tradicionais, como as equações de estado, não conseguem uma boa precisão são os compostos auto-associativos. Definemse compostos auto-associativos como aqueles cujas moléculas são capazes de se associar em agregados por meios de ligações (ou pontes) de hidrogênio, como os álcoois, os ácidos carboxílicos e a água. O objetivo deste trabalho é apresentar uma incorporação dos efeitos da auto-associação na modelagem termodinâmica, permitindo que se obtenha um modelo mais realístico e flexível, que correlaciona bem dados experimentais. Para isso é utilizada a abordagem química em conjunto com equações de estado do tipo van der Waals. Conforme o modelo desenvolvido, o fluido associativo puro é considerado uma mistura do seu monômero com um multímero mais representativo, existindo apenas uma reação de associação para o composto puro. Os parâmetros a e b da equação de estado são relacionados ao numero de moléculas deste multímero e são utilizadas as constantes críticas de hidrocarbonetos para a determinação do valor destes parâmetros para o monômero. A regra de mistura utilizada é quadrática para o parâmetro atrativo e linear para o repulsivo. O numero de moléculas no multímero mais representativo foi determinado a partir de regressão de dados de pressão de vapor do componente puro. A partir das considerações acima, obtém-se uma modificação das equações de estado de Redlich-Kwong-Soave e Peng-Robinson. Esta modificação é facilmente estendida para misturas contendo compostos inertes, isto é, aqueles que não tem a capacidade de associar-se e também para misturas em que ocorre solvatação (associação cruzada) ou em que existem dois ou mais compostos associativos, sendo a facilidade no cálculo que envolva esses tipos de misturas a grande contribuição deste trabalho. A aplicação do modelo a misturas mostra uma melhora sensível na correlação de dados de equilíbrio líquido-vapor e na predição dos azeótropos existentes nestas misturas, assim como a obtenção de parâmetros de interação binária próximos a zero
Abstract: The Knowledge about Physical-Chemical properties and about the behavior of each stage is very important to the design, operation and optimization of the industrial processes. Due to difficulties and high cost in obtaining experimental data at high temperature, pressure and composition gaps, models are used to correlate and eventually predict these data. One group of substance, which traditional models, as the state equation, can not get a good precision, is the self-association compounds. Self-association compounds are defined as those whose molecules undergo hydrogen bonding among, such alcohol, organics acid and water. The purpose of this work is to present the effects of self-association on the thermodynamic modeling, allowing the obtaining of a more flexible and realistic model that can get a good correlation with the experimental data. For this is applied a chemical theory in the Redlich-Kwong-Soave and Peng-Robinson equations of state. According to the developed model, the pure associative models fluid is considered moisture of monomer with a representative multimer. The parameters a and b of the equation of state are related to the number of molecules of the multimer. The classical mixing rule is used. The modified model allowed excellent correlation of phase equilibrium data for alcohols and alcoholhydrocarbon mixtures. The validity of the model is further demonstrated by the small values obtained for the adjustable interaction parameters when correlating experimental data. This modification can be easily extended for cross-associating
Mestrado
Mestre em Engenharia Química
7
Schumann-Bacia, Eva-Maria. "John Soane und die Bank of England 1788 bis 1833 /." Hildesheim : Georg Olms, 1990. http://catalogue.bnf.fr/ark:/12148/cb389861201.
Повний текст джерела
8
Menna, Luigi. "HOW TO SOLVE IT." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80655.
Повний текст джерелаАнотація:
This work is a reflection on the results of an experimentation carried out on secondary school students of between 16 and 18 from various classes. The experimentation aims at identifying the implicit ideas they use when asked to solve a certain mathematical problem. In particular, in giving them these problems an heuristic approach was suggested, and the differences between this and a purely deductive approach were measured. Analyzing the different approaches used by the students and the difficulties they had in distinguishing between argumentative and demonstrative operations has given rise to a reflection on the use of software such as Geogebra and Excel.
9
Marsden, Graeme. "Reading the family houses of an architect." Thesis, University of East London, 1998. http://roar.uel.ac.uk/1244/.
Повний текст джерелаАнотація:
This thesis considers relationships between occupants and their places of occupation. Of relationships between the bodies of occupation and the stones occupied in the speck instance where the places of occupation have been designed by one of the occupants. The late eighteenth/early nineteenth century architect Sir John Soane has been selected as the architect/occupant. This selection was made because of his gift to the nation of a house in Lincoln 's Inn Field designed for his family, offered complete with an extensive collection of representations of occupation. This archive material, contained in letters, journals, account books, home made books, descriptions of the places of occupation, watercolours and architectural drawings, has been used extensively in the fabric of the thesis. It is this material, contained within the house, that is under consideration: the project uses the matter collected/contained both as a means of considering the logic of the house/home and as matter to be analysed, or subjected to that logic. As the material under examination includes textual matter, interrelationships between this form of material, the bodies of writing and the stones of the places of writing are analysed. The houses/villas under examination are Pitzhanger Manor House, a villa at Ealing; No. 12 & 13 Lincoln's Inn Fields, two adjoining London town houses and the Clerk of the Works' official residence at Chelsea. They are considered exclusively in terms of representation, not as built or physical form. Views of the houses/villas from contexts beyond the framework of the archive are not engaged with; they are not located within a street, city, or world perspective. The material contained within the archive is used to consider the construction and destruction of the houses/villas designed by the architect/owner. It is also used to examine what might be deemed the construction and destruction of the family of 3 occupation and the formation of another form of family of occupation. In so doing, the thesis does not attempt to build a portrait of the occupiers, or a history of'the place off occupation. It is neither a biography nor an architectural history but something in between; akin to an analysis of the place of occupation from the logic of the material collected and contained.
10
Morris, Bruce E. "The manifestation of character as a design goal in the work of Sir John Soane." Thesis, Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/21597.
Повний текст джерела
11
Ayala, Guerrero Jorge Patricio. "Modelación DNS bidimensional de intercambio de calor entre agua y sedimento en sistema acuáticos someros." Tesis, Universidad de Chile, 2017. http://repositorio.uchile.cl/handle/2250/146696.
Повний текст джерелаАнотація:
Ingeniero CivilEn la región altiplánica de la Cordillera de los Andes existen lagunas someras de algunos centímetros de profundidad denominadas salares; grandes extensiones de agua salada acotadas por una cáscara de sal en sus extremos como resultado de las altas tasas de evaporación. Diversas investigaciones han demostrado que la temperatura del agua puede variar en 20-30 °C en el día y que los sedimentos cumplen la función de reservorios, reteniendo calor durante el día y liberándolo en la noche, reduciendo de esta manera la oscilación termal diaria. La situación es determinada por procesos ocurrentes a ambos lados de la interfaz agua-sedimento (IAS), perspectiva que debe usarse al proponer modelos conceptuales. Sin embargo, raramente se considera en estudios y, de hacerlo, el calentamiento de los sedimentos por absorción de radiación solar no se analiza. La presente memoria toma como base Flow Solve , un modelo numérico del académico Kraig Winters (U. de California, San Diego) que utiliza el método espectral. El modelo se aplica a un sistema agua sedimento en que la capa superior de los sedimentos es calentada de manera periódica. Además, se estudia el orden de discretización espacial y temporal, así como la relación entre los números de Nusselt y Rayleigh. A partir de los resultados se concluye que existe una relación empírica exponencial entre el calor absorbido en la capa superior de los sedimentos (𝐻�����𝑠�����), la altura del cuerpo de agua (ℎ𝑤�����) y la frecuencia asociada a los periodos de evaluación (𝜔�����) y el número adimensional Π1 (que cuantifica el rol de los sedimentos en el balance de calor). La amplitud térmica es directamente proporcional al calor absorbido en los sedimentos elevado a un coeficiente de orden 0,6 , es decir, Δ𝑇�����𝑤����� crece sin cota a medida que aumenta el calor absorbido. En el caso de la curva Δ𝑇�����𝑤����� como función del periodo, la pendiente disminuye a medida que aumenta la duración de los ciclos, hasta estabilizarse. No se puede estimar la amplitud térmica para periodos superiores a los simulados. Para el caso de la altura de agua se aprecia una curva con pendiente decreciente. A medida que aumenta la altura del cuerpo de agua, la amplitud térmica tiende a 0°C, mientras que al disminuir ℎ𝑤�����, Δ𝑇�����𝑤����� crece sin cota. A partir de los 50 cm, Δ𝑇�����𝑤����� toma valores inferiores a 0,1 °C. La escala de longitud de Kolmogorov entrega resultados que permiten estimar satisfactoriamente la distancia vertical a definir entre puntos de la grilla. Sin embargo, en el caso del paso temporal, el usar un Δt del orden de la escala de tiempo de Kolmogorov puede asegurar que se consideren todas las escalas físicas del proceso, pero no implica que se cumplan las condiciones matemáticas necesarias para que el programa funcione correctamente. De este modo, el requisito dominante en el caso del tiempo viene dado por una expresión empírica. La relación entre los números de Nusselt y Rayleigh revela que el fenómeno de intercambio de calor en la IAS queda descrito por convección natural en una placa horizontal caliente a temperatura uniforme en régimen turbulento.
Este trabajo ha sido parcialmente financiado por Fondecyt 1140821
12
Nemani, Ashish Kumar. "Combinational approaches to solve scheduling problems." [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0041090.
Повний текст джерела
13
Ilyes, Amy Louise. "Using linear programming to solve convex quadratic programming problems." Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216.
Повний текст джерела
14
Grau, Gotés Ma Àngela (Maria Àngela). "On iterative methods to solve nonlinear equations." Doctoral thesis, Universitat Politècnica de Catalunya, 2015. http://hdl.handle.net/10803/396684.
Повний текст джерелаАнотація:
Many of the problems in experimental sciences and other disciplines can be expressed in the form of nonlinear equations. The solution of these equations is rarely obtained in closed form. With the development of computers, these problems can be addressed by numerical algorithms that approximate the solution. Specifically, fixed point iterative methods are used, which generate a convergent sequence presumably to the solution of the equation or system of equations. Since J.F. Traub (Iterative methods for the solution of equations, Prentice-Hall, N.J. 1964) initiated the qualitative as well the quantitative analysis of iterative methods in the 1960s, iterative methods for nonlinear systems has been a constantly interesting field of study for numerical analysts.
Our contribution to this field is the analysis and construction of new iterative methods, by improving the order of convergence and computational efficiency either of these or other known methods. To study the new iterative methods that we have proposed, we reviewed analyzed and improved classic concepts of computational order of convergence, the error equation, and the computational cost of an iterative method for both an equation and a system of nonlinear equations. Specifically, we have worked on the following points:
- We computed the local order of convergence for known two-step and new multi-step iterative methods by means of expansions in formal developments in power series of the function F, the Jacobian operator, the inverse Jacobian operator and the divided difference operator and its inverse operator.
- We generated some measures that approximate the order of convergence. Four new variants for computing the computational order of convergence (COC) are given: one requires the value of the root, whilst the other three do not.
- We constructed families of iterative schemes that are variants of Newton’s method and Chebyshev’s method and improve the order and the efficiency.
- We studied several families of the modified Secant method (Secant, Kurchatov and Steffensen), evaluated variants of these methods and chose the most efficient.
- We generalized the concepts of efficiency index and computational efficiency for nonlinear equations to systems of nonlinear equations. This has been termed the computational efficiency index (CEI).
- We considered that in iterative process using variable precision, the accuracy will increase as the computation proceeds. The final result will be obtained as precisely as possible, depending on the computer and the software.
- We expressed the cost of evaluating elementary functions in terms of products. This cost depends on the computer, the software and the arithmetic that we used. The above numerical calculations were performed in the algebraic system called MAPLE.
- We presented a new way of comparing elapsed time for different iterative schemes. This consists of estimating the time required to achieve a correct decimal of the solution by the method selected. That is, we measured the relationship between the time to fulfill the stop criterion and the total number of correct decimals obtained by method. The five papers selected for this compendium were published in scientific journals in the area of applied mathematics. The impact factor of these journals is, in all cases, in the first third according to the classification of the Journal of Citation Reports. There are four preceding papers that no are part of this report by its publication date.Gran parte de los problemas en ciencias experimentales y otras disciplinas se pueden expresar en forma de ecuaciones no lineales. La solución de estas ecuaciones rara vez se obtiene en forma cerrada; con el desarrollo de los ordenadores, estos problemas pueden ser abordados por algoritmos numéricos que aproximan la solución. Concretamente, se utilizan métodos iterativos de punto fijo, que generan una secuencia convergente presumiblemente a la solución de la ecuación o sistema de ecuaciones. Desde J.F. Traub, (Iterative methods for the solution of equations, Prentice-Hall, N.J. 1964) inició el estudio cualitativo y el análisis cuantitativo de éstos métodos iterativos en la década de los sesenta, los métodos iterativos para sistemas no lineales ha sido un área de constante estudio para los analistas numéricos. La contribución que presenta este compendio en este campo es el análisis y la construcción de nuevos métodos iterativos mejorando ya sea el orden de convergencia o ya sea la eficiencia computacional de éstos o de otros ya conocidos. Para el estudio de nuevos métodos iterativos, se ha revisado, analizado y en algun caso redefinido los conceptos clásicos de orden de convergencia computacional, de ecuación del error y de coste computacional de un método iterativo, tanto para una ecuación como para un sistema de ecuaciones no linealesEn concreto, se ha trabajado en los siguientes puntos: - El cálculo del orden local de convergencia para métodos conocidos de dos pasos y para nuevos métodos iterativos multipaso se realiza haciendo uso de desarrollos formales en serie de potencias del error. Se ha desarrollado la función F, el operador Jacobiano, el operador Jacobiano inverso, el operador diferencia dividida y su operador inverso. -Se generan algunas medidas que aproximan el orden local de convergencia del método iterativo. Se presentan cuatro nuevas variantes para el cálculo del orden de convergencia computacional (COC, computational order of convergence); un parámetro que necesita el valor de la solución o raíz, y tres parámetros que no requieren de éste valor. - Construcción de familias, los esquemas iterativos de las cuáles son variantes del método de Newton y del método de Chebyshev, mejorando el orden y la eficiencia de éstos. - Estudio de diversas familias, derivadas del método de la Secante (Secante, Kurchatov y Steffensen), variantes de estos métodos y elección de los más eficientes. - Generalización de los conceptos de índice de eficiencia y de eficiencia computacional para ecuaciones a sistemas de ecuaciones no lineales. Se ha denominado índice de eficiencia computacional (CEI, Computational Efficiency Index). - Análisis y construcción de procesos iterativos de precisión variable. La precisión aumenta a medida que la computación avanza, y el resultado final se obtiene con la máxima precisión posible, dependiendo del ordenador y el software disponibles. - Expresión del coste de la evaluación de las funciones elementales en términos de productos. Este coste depende del ordinador, el software y la aritmética que se utiliza. Los cálculos numéricos mencionados se ha realizado con el sistema algebraico MAPLE. - Una nueva forma de comparar el tiempo de ejecución dedicado al cálculo por los diferentes esquemas iterativos. Consiste en calcular el tiempo necesario para conseguir un decimal correcto de la solución por el método escogido. Concretamente, se mide la relación entre el tiempo transcurrido para cumplir el criterio de parada y el número total de decimales correctos obtenidos por el algoritmo. Los cinco trabajos seleccionados para constituir este compendio fueron publicados en revistas científicas del área de matemática aplicada. El factor de impacto de éstas se encuentra en el primer tercio de acuerdo con la clasificación del Journal of Citation Reports. Además, he publicado cuatro artículos previos, que no forman parte de esta memoria por fecha de publicación, válidos para un sexenio el año 2011.
15
Delphin, Simone de Almeida. "Numerical Methods to Solve Dynamic Population Problems." Laboratório Nacional de Computação Científica, 2005. http://www.lncc.br/tdmc/tde_busca/arquivo.php?codArquivo=79.
Повний текст джерелаАнотація:
A numerical method is presented to solve single species population dynamics problems, with focus on the spread if invading organisms. This problem is mathematically modeled by a non-linear advection-diffusion-reaction transport equation, which is numerically solved by a finite element methodology. Some examples are conducted, showing the stability and accuracy of the proposed methodology.
The role of the weak and strong Alee effects is analyzed on the spread of a single species invading organism in a one-dimensional domain. In this case the population dynamics describes propagation of traveling population fronts that represent either single-species invasion or single-species retreat. Some scenarios are investigated so as to evaluate the interaction of traveling population fronts under different parameter values, allowing to derive numerically whether they can reverse or block the species invasion.Uma solução numérica é presentada para resolver problemas da dinâmica populacional de uma única espécie, com ênfase na dispersão de um organismo invasor. Este problema é matematicamente modelado por uma equação de transporte não linear de advecção-difusão-reação e resolvido numericamente usando o método de elementos finitos. Os exemplos apresentados demonstram a estabilidade e precisão da metodologia proposta. A influência do efeito Allee forte e fraco é analisada na dispersão de uma espécie de organismo invasor em um domínio uni-dimensional. Neste caso a dinâmica populacional descreve a propagação de frentes populacionais que representam a invasão ou o recuo da espécie. Alguns cenários são investigados para avaliar a interação da frente de ondas populacionais para diferentes valores de parâmetros indicando numéricamente quando é possível reverter ou bloquear a invasão de espécies.
16
Foadi, James. "Real-space methods to solve protein structures." Thesis, University of York, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325560.
Повний текст джерела
17
Utamima, Amalia. "Evolutionary Algorithms to Solve Agricultural Routing Planning." Thesis, Curtin University, 2020. http://hdl.handle.net/20.500.11937/82468.
Повний текст джерелаАнотація:
This doctoral thesis aims to develop effective Evolutionary Algorithms that can be competitively applied to Agricultural Routing Planning (ARP) and to formulate an extension of the ARP. The outcomes of this research will impact on the research community with the development of new algorithms as well as the dissemination of findings. This study is significant as it is expected to improve the management of agricultural machinery, to minimise the total cost and the settling time for completing field operations, and to produce better routing plans.
18
Trotti, Manuela. "Applications of elliptic functions to solve differential equations." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/10135/.
Повний текст джерелаАнотація:
In questa tesi si mostrano alcune applicazioni degli integrali ellittici nella meccanica Hamiltoniana, allo scopo di risolvere i sistemi integrabili. Vengono descritte le funzioni ellittiche, in particolare la funzione ellittica di Weierstrass, ed elenchiamo i tipi di integrali ellittici costruendoli dalle funzioni di Weierstrass. Dopo aver considerato le basi della meccanica Hamiltoniana ed il teorema di Arnold Liouville, studiamo un esempio preso dal libro di Moser-Integrable Hamiltonian Systems and Spectral Theory, dove si prendono in considerazione i sistemi integrabili lungo la geodetica di un'ellissoide, e il sistema di Von Neumann. In particolare vediamo che nel caso n=2 abbiamo un integrale ellittico.
19
Cui, Xinwei. "Using genetic algorithms to solve combinatorial optimization problems." FIU Digital Commons, 1991. http://digitalcommons.fiu.edu/etd/2684.
Повний текст джерелаАнотація:
Genetic algorithms are stochastic search techniques based on the mechanics of natural selection and natural genetics. Genetic algorithms differ from traditional analytical methods by using genetic operators and historic cumulative information to prune the search space and generate plausible solutions. Recent research has shown that genetic algorithms have a large range and growing number of applications.
The research presented in this thesis is that of using genetic algorithms to solve some typical combinatorial optimization problems, namely the Clique, Vertex Cover and Max Cut problems. All of these are NP-Complete problems. The empirical results show that genetic algorithms can provide efficient search heuristics for solving these combinatorial optimization problems.
Genetic algorithms are inherently parallel. The Connection Machine system makes parallel implementation of these inherently parallel algorithms possible. Both sequential genetic algorithms and parallel genetic algorithms for Clique, Vertex Cover and Max Cut problems have been developed and implemented on the SUN4 and the Connection Machine systems respectively.
20
Lakshmanan, Muthukumar S. "Using effective information searching skills to solve problems." Phd thesis, Australia : Macquarie University, 2009. http://hdl.handle.net/1959.14/42606.
Повний текст джерелаАнотація:
"2008".Thesis (PhD)--Macquarie University, Australian Centre for Educational Studies, School of Education, 2009.
Bibliography: p. 268-283.
Introduction -- Review of the literature -- Methods and procedures -- Pre-intervention qualitative data analysis & discussion of findings -- Intervention -- Post-intervention qualitative data analysis & discussions of findings -- Post-intervention quantitative data analysis & discussions of findings -- Conclusions.
Problem-based learning (PBL) is an instructional approach that is organized around the investigation and resolution of problems. Problems are neither uniform nor similar. Jonassen (1998, 2000) in his design theory of problem solving has categorized problems into two broad types - well-structured and ill-structured. He has also described a host of mediating skills that impact problem solving outcomes. However, this list of skills is not exhaustive and in view of the utility of the Internet as an informational repository, this study examined the need for effective information searching skills to be included in this list. -- This study was aimed at studying how students solve well and ill structured problems and how different Internet information seeking strategies can be used to engage in problem solving. This study devised and empirically tested the efficacy of an interventionist conceptual model that maps the application of different information seeking techniques to successfully resolving well and ill structured problem types. The intervention helps to better understand the influence of information searching skills on problem solving performance and the various problem solving strategies students can adopt in approaching problem solving. The contrasting patterns of navigational path movements taken by students in seeking information to resolve ill and well structured problems were also investigated. -- A mixed methodology research design, involving a mix of quantitative and qualitative approaches was used in this study. The research site was a polytechnic in Singapore that has implemented problem-based learning in its curriculum design. A first year class of 25 students were the sample population who participated in this study. Six problems from the curriculum were chosen for this study - three well-structured and another three ill-structured problems. -- The research findings of this study inform that information searching skills indeed play an important role in problem solving. The findings affirm the need for students to be systematically instructed in the skills of information searching to be aware of the complexities involved in information seeking and accomplish desired problem solving goals. This study has also shown that well and ill structured problems demand different cognitive and information seeking capabilities. Well-structured problems are easily solved and come with singular correct answers. The information searching necessary for solving well-structured problems is constrained and readily manageable. Thus, students only have to be acquainted with fundamental information searching skills to solve well-structured problems. On the other hand, ill-structured problems are messy and contain a number of unknown elements. There are no easy prototypic solutions. Subsequently, the information needs of ill-structured problems are usually complex, multi-disciplinary and expansive. Hence, students have to be trained to apply a more advanced set of information searching skills in resolving ill-structured problems.
Mode of access: World Wide Web.
xiv, 283 p. ill
21
Chen, Mingjun, and 陈明君. "Strategy to solve cognitive overload in listening comprehension." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B48365622.
Повний текст джерелаАнотація:
本研究通過對深圳大學初級漢語水平留學生的晤談以及測試，發現初級水平階段的漢語學生在聆聽過程中常出現以下困難：
1. 未能準確辨識出語音。
2. 雖然能夠識別單個辭彙或者短語，但是無法獲取整個句子的含義。
3. 未能及時進入聆聽狀態，以至於錯過了錄音的開始部分。
4. 遇到障礙往往會卡在困難之處，導致錯過了後續的錄音內容。
5. 無法概括出語段大意。
由於語言知識的不足，留學生在聆聽過程中往往受挫。從認知負荷理論的角度看，無論是語音、辭彙、語法結構，乃至於句子的深層含義和文本大意，不同的層面都對工作記憶施加了負荷。降低認知負荷的有效方法便是激活學生的圖式，對所聽材料進行預測、補充以及選擇性加工，使工作記憶留存更多資源處理不熟悉的任務。適當的聆聽策略可以幫助學生激活長時記憶中的圖式，跳躍障礙，提升理解。
基於此，本研究以深圳大學初級漢語班的外國學生為研究對象，以其中一班（共13 名學生）為實驗組，另一個班（共11 名學生）為控制組，進行准實驗研究。考慮到學生已初步具備預估、猜想的意識，且大部分聆聽困難可透過此方法得以解決，所以在實驗過程中，實驗組學生將接受“猜一猜”的聽力策略教學法。此聽力策略的實施階段包括聆聽以前和聆聽過程。控制組學生接受教師原有的教學方法，即聆聽前教師講解生詞，學生流覽問題，而後聽錄音做練習。
准實驗研究結果顯示，實驗組學生“詞義推斷”一項成效明顯，而“句子深層含義”以及“概括大意”兩項雖然有所改善，但和控制組相比，差異仍未達到顯著水平。“猜一猜”的聆聽策略能在一定程度上幫助學生激活長時記憶中的圖式，在聆聽前根據話題、背景知識等預估錄音大意，在聆聽過程中，利用上下文來跳躍障礙，達成順暢理解。圖式的激活降低了學習者工作記憶的負荷，為工作記憶釋放了大量空間。
從學生調查問卷的結果看，聽力策略“猜一猜”得到了師生的普遍認同，具有教學意義。
最後，本研究對聆聽教學以及未來研究提出了一些建議，以期有更深入的探討。published_or_final_version
Education
Master
Master of Education
22
Whitford, Angela Tracy. "Heuristic approaches to solve the frequency assignment problem." Thesis, Goldsmiths College (University of London), 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321956.
Повний текст джерела
23
Vazquez, ortiz Karla Esmeralda. "Advanced methods to solve the maximum parsimony problem." Thesis, Angers, 2016. http://www.theses.fr/2016ANGE0015/document.
Повний текст джерелаАнотація:
La reconstruction phylogénétique est considérée comme un élément central de divers domaines comme l’écologie, la biologie et la physiologie moléculaire pour lesquels les relations généalogiques entre séquences d’espèces ou de gènes, représentées sous forme d’arbres, peuvent apporter des éclairages significatifs à la compréhension de phénomènes biologiques. Le problème de Maximum de Parcimonie est une approche importante pour résoudre la reconstruction phylogénétique en se basant sur un critère d’optimalité pour lequel l’arbre comprenant le moins de mutations est préféré. Dans cette thèse nous proposons différentes méthodes pour s’attaquer à la nature combinatoire de ce problème NP-complet. Premièrement, nous présentons un algorithme de Recuit Simulé compétitif qui nous a permis de trouver des solutions de meilleure qualité pour un ensemble de problèmes. Deuxièmement, nous proposons une nouvelle technique de Path-Relinking qui semble intéressante pour comparer des arbres mais pas pour trouver des solutions de meilleure qualité. Troisièmement, nous donnons le code d’une implantation sur GPU de la fonction objectif dont l’intérêt est de réduire le temps d’exécution de la recherche pour des instances dont la longueur des séquences est importante. Finalement, nous introduisons un prédicteur capable d’estimer le score optimum pour un vaste ensemble d’instances avec une très grande précisionPhylogenetic reconstruction is considered a central underpinning of diverse fields like ecology, molecular biology and physiology where genealogical relationships of species or gene sequences represented as trees can provide the most meaningful insights into biology. Maximum Parsimony (MP) is an important approach to solve the phylogenetic reconstruction based on an optimality criterion under which the tree that minimizes the total number of genetic transformations is preferred. In this thesis we propose different methods to cope with the combinatorial nature of this NP-complete problem. First we present a competitive Simulated Annealing algorithm which helped us find trees of better parsimony score than the ones that were known for a set of instances. Second, we propose a Path-Relinking technique that appears to be suitable for tree comparison but not for finding trees of better quality. Third, we give a GPU implementation of the objective function of the problem that can reduce the runtime for instances that have an important number of residues per taxon. Finally, we introduce a predictor that is able to estimate the best parsimony score of a huge set of instances with a high accuracy
24
Idalino, Thaís Bardini. "Using combinatorial group testing to solve integrity issues." reponame:Repositório Institucional da UFSC, 2015. https://repositorio.ufsc.br/xmlui/handle/123456789/169646.
Повний текст джерелаАнотація:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Ciência da Computação, Florianópolis, 2015Made available in DSpace on 2016-10-19T13:20:16Z (GMT). No. of bitstreams: 1 336415.pdf: 822253 bytes, checksum: 9704a2d81140ede18af8530f9cbebddd (MD5) Previous issue date: 2015
O uso de documentos eletrônicos para compartilhar informações é de fundamental importância, assim como a garantia de integridade e autenticidade dos mesmos. Para provar que alguém é dono ou concorda com o conteúdo de um documento em papel, essa pessoa precisa assiná-lo. Se o documento foi modificado após a assinatura, geralmente é possível localizar essas modificações através de rasuras. Existem técnicas similares em documentos digitais, conhecidas como assinaturas digitais, porém, propriedades como as de identificar as modificações são perdidas.Ao determinar quais partes de um documento foram modificadas, o receptor da mensagem seria capaz de verificar se essas modificações ocorreram em partes importantes, irrelevantes ou até esperadas do documento. Em algumas aplicações, uma quantidade limitada de modificações são permitidas mas é necessário manter o controle do local em que elas ocorreram, como em formulários eletrônicos. Em outras aplicações modificações não são permitidas, mas é importante poder acessar partes das informações que tem integridade garantida ou até mesmo utilizar a localização das modificações para investigação.Neste trabalho é considerado o problema de garantia parcial de integridade e autenticidade de dados assinados. Dois cenários são estudados: o primeiro está relacionado com a localização de modificações em um documento assinado e o segundo está relacionado com a localização de assinaturas inválidas em um conjunto de dados assinados individualmente. No primeiro cenário é proposto um esquema de assinatura digital capaz de detectar e localizar modificações num documento. O documento a ser assinado é primeiramente dividido em n blocos, tendo em conta um limite d para a quantidade máxima de blocos modificados que o esquema de assinatura consegue localizar. São propostos algoritmos eficientes para as etapas de assinatura e verificação, resultando em uma assinatura de tamanho razoavelmente compacto. Por exemplo, para d fixo, são adicionados O(log n) hashes ao tamanho de uma assinatura tradicional, ao mesmo tempo permitindo a identificação de até d blocos modificados.No cenário de localização de assinaturas inválidas em um conjunto de dados assinados individualmente é introduzido o conceito de níveis de agregação de assinatura. Com esse método o verificador pode distinguir os dados válidos dos inválidos, em contraste com a agregação de assinaturas tradicional, na qual até mesmo um único dado modificado invalidaria todo o conjunto de dados. Além disso, o número de assinaturas transmitidas é muito menor que num método de verificação em lotes, que requer o envio de todas as assinaturas individualmente. Nesse cenário é estudada uma aplicação em bancos de dados terceirizados, onde cada tupla armazenada é individualmente assinada. Como resultado de uma consulta ao banco de dados, são retornadas n tuplas e um conjunto de t assinaturas agregadas pelo servidor (com t muito menor que n). Quem realizou a consulta executa até t verificações de assinatura de maneira a verificar a integridade das n tuplas. Mesmo que algumas dessas tuplas sejam inválidas, pode-se identificar exatamente quais são as tuplas válidas. São propostos algoritmos eficientes para agregar, verificar as assinaturas e identificar as tuplas modificadas.Os dois esquemas propostos são baseados em testes combinatórios de grupo e matrizes cover-free. Nesse contexto são apresentadas construções detalhadas de matrizes cover-free presentes na literatura e a aplicação das mesmas nos esquemas propostos. Finalmente, são apresentadas análises de complexidade e resultados experimentais desses esquemas, comprovando a sua eficiência.
Abstract : We consider the problem of partially ensuring the integrity and authenticity of signed data. Two scenarios are considered: the first is related to locating modifications in a signed document, and the second is related to locating invalid signatures in a set of individually signed data. In the first scenario we propose a digital signature scheme capable of locating modifications in a document. We divide the document to be signed into n blocks and assume a threshold d for the maximum amount of modified blocks that the signature scheme can locate. We propose efficient algorithms for signature and verification steps which provide a reasonably compact signature size. For instance, for fixed d we increase the size of a traditional signature by adding a factor of O(log n) hashes, while providing the identification of up to d modified blocks. In the scenario of locating invalid signatures in a set of individually signed data we introduce the concept of levels of signature aggregation. With this method the verifier can distinguish the valid data from the invalid ones, in contrast to traditional aggregation, where even a single invalid piece of data would invalidate the whole set. Moreover, the number of signatures transmitted is much smaller than in a batch verification method, which requires sending all the signatures individually. We consider an application in outsourced databases in which every tuple stored is individually signed. As a result from a query in the database, we return n tuples and a set of t signatures aggregated by the database server (with t much smaller than n). The querier performs t signature verifications in order to verify the integrity of all n tuples. Even if some of the tuples were modified, we can identify exactly which ones are valid. We provide efficient algorithms to aggregate, verify and identify the modified tuples. Both schemes are based on nonadaptive combinatorial group testing and cover-free matrices.
25
PEZZETTI, LAURA ANNA. "Stanze architettoniche : Bank of England di John Soane." Doctoral thesis, Università IUAV di Venezia, 2005. http://hdl.handle.net/11578/278501.
Повний текст джерела
26
Tafuro, Alessandra. "Tracking Cognitive Control: How do we solve interference?" Doctoral thesis, Università degli studi di Padova, 2019. http://hdl.handle.net/11577/3422347.
Повний текст джерелаАнотація:
Selecting relevant information in the presence of distracting one is a core component of cognitive control, referred as interference resolution. This process has been often investigated through the Stroop task, where responses are longer when two stimulus features are incongruent, compared to when they are congruent (Stroop effect). Despite a large body of literature about this process, the mechanisms of interference resolution are still matter of debate. The present PhD project aimed at shedding light on the temporal dynamics of interference resolution and the related neural underpinnings. In Study 1 we focused on investigating the brain oscillations involved in this process during a spatial Stroop task, aiming at understanding if these correlates and their temporal course change across the lifespan by recruiting younger and older adults. We found age-related differences in theta and beta bands. Theta may represent an early mechanism signalling the need to exert control, which seems to be impaired with aging. Beta may correspond to the process of relevant information selection and older adults showed an over-recruitment of these frequencies. Previous evidence suggested that these results may be attributed to age-related differences in the use of proactive and reactive control, in line with the DMC (Dual Mode of Control) model. Proactive control is defined as an anticipatory attentional bias, whereas reactive control as a late correction mechanism. To study more in depth the different contribution of these control modes, we developed Study 2. We used the same task, manipulating the percentage of congruency (PC) at different levels, list or item, to elicit proactive and reactive control respectively. We also recorded computer mouse trajectories because the high temporal resolution of this tool can shed light on the underlying temporal dynamics of these control modes. Analysis of mouse-derived measures showed that the Stroop effect was present as costs in responding to incongruent trials, reflected in a greater attraction toward the irrelevant information, less smooth trajectories, and longer time to respond due to the updating and adjustments of the trajectories. We found that the magnitude of the interference varied as a function of the PC manipulations, with smaller Stroop interference for low-PC manipulations. Our results suggested also that reactive control may work faster than previously thought, possibly triggering a rapid attentional bias toward the relevant information similar to the one predicted for proactive control. To investigate further the role of proactive control it was necessary to study the time preceding stimulus appearance. Hence, we developed Study 3 in which we used the same mouse-tracking task, manipulating the PC at the list level to mainly elicit proactive control, and we recorded EEG signal to have a window on the brain dynamics before stimulus presentation. We found clear PC-dependent modulations of the interference, both at the behavioural and the neural level, for which we found smaller Stroop effect for blocks with low PC. Behavioural results generally replicated those of Study 2. EEG results showed PC-related modulations of interference, which mirrored the same pattern observed in mouse-derived measures and mainly involved theta and beta bands. This project provides confirmations and new suggestions in the study of interference resolution. We confirmed the involvement of theta in this process, interpreted as an early mechanism of interference detection that signals the need to exert control. We also found a main involvement of beta that may represent the imposition of early attentional biases toward the relevant information. We interpreted these results in line with the Cascade of Control and the DMC models. This project represents a first attempt to evaluate more deeply the temporal course of proactive and reactive control, taking advantages of two techniques with high temporal resolution.
27
Martin, Cécile. "Embodiments of art, narratives of architecture : in the Sir John Soane Museum." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=30777.
Повний текст джерелаАнотація:
Sir John Soane (1753--1837) is an intriguing character. This architect has transformed his London House into a Museum. The only thing we have left of him is the House and three Descriptions of it. I will not try to put apart what Sir John Soane has done in his House but see what he has done. Soane invites us in the House, lets you visit it and be lost. Once you have dived, accepted the invitation, you have found a house full of art objects gathered to teach architecture. Art and architecture meet. The experience is haunting. Through it the architect rediscovers the story of objects to identify, the everyday story he builds. The experience of the House is a mirroring of Soane's mind. The House which makes the architect understand his projection upon others. The amplitude and generosity of his vision becomes history.
28
Federico, Gina. "THE EFFECTS OF AGE AND AGGRESSIVE TENDENCY ON SOCIAL PROBLEM SOLVING." Miami University / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=miami1087401114.
Повний текст джерела
29
Chio, Chou Hei. "Apply algorithm of changes to solve traveling salesman problem." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550556.
Повний текст джерела
30
Isaacs, Amitay Engineering & Information Technology Australian Defence Force Academy UNSW. "Development of optimization methods to solve computationally expensive problems." Awarded by:University of New South Wales - Australian Defence Force Academy. Engineering & Information Technology, 2009. http://handle.unsw.edu.au/1959.4/43758.
Повний текст джерелаАнотація:
Evolutionary algorithms (EAs) are population based heuristic optimization methods used to solve single and multi-objective optimization problems. They can simultaneously search multiple regions to find global optimum solutions. As EAs do not require gradient information for the search, they can be applied to optimization problems involving functions of real, integer, or discrete variables. One of the drawbacks of EAs is that they require evaluations of numerous candidate solutions for convergence. Most real life engineering design optimization problems involve highly nonlinear objective and constraint functions arising out of computationally expensive simulations. For such problems, the computation cost of optimization using EAs can become quite prohibitive. This has stimulated the research into improving the efficiency of EAs reported herein. In this thesis, two major improvements are suggested for EAs. The first improvement is the use of spatial surrogate models to replace the expensive simulations for the evaluation of candidate solutions, and other is a novel constraint handling technique. These modifications to EAs are tested on a number of numerical benchmarks and engineering examples using a fixed number of evaluations and the results are compared with basic EA. addition, the spatial surrogates are used in the truss design application. A generic framework for using spatial surrogate modeling, is proposed. Multiple types of surrogate models are used for better approximation performance and a prediction accuracy based validation is used to ensure that the approximations do not misguide the evolutionary search. Two EAs are proposed using spatial surrogate models for evaluation and evolution. For numerical benchmarks, the spatial surrogate assisted EAs obtain significantly better (even orders of magnitude better) results than EA and on an average 5-20% improvements in the objective value are observed for engineering examples. Most EAs use constraint handling schemes that prefer feasible solutions over infeasible solutions. In the proposed infeasibility driven evolutionary algorithm (IDEA), a few infeasible solutions are maintained in the population to augment the evolutionary search through the infeasible regions along with the feasible regions to accelerate convergence. The studies on single and multi-objective test problems demonstrate the faster convergence of IDEA over EA. In addition, the infeasible solutions in the population can be used for trade-off studies. Finally, discrete structures optimization (DSO) algorithm is proposed for sizing and topology optimization of trusses. In DSO, topology optimization and sizing optimization are separated to speed up the search for the optimum design. The optimum topology is identified using strain energy based material removal procedure. The topology optimization process correctly identifies the optimum topology for 2-D and 3-D trusses using less than 200 function evaluations. The sizing optimization is performed later to find the optimum cross-sectional areas of structural elements. In surrogate assisted DSO (SDSO), spatial surrogates are used to accelerate the sizing optimization. The truss designs obtained using SDSO are very close (within 7% of the weight) to the best reported in the literature using only a fraction of the function evaluations (less than 7%).
31
Rowley, Joel. "Using constraint programming to solve a sports scheduling problem /." Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Rowley.pdf.
Повний текст джерела
32
Farivar, Saeid. "An algorithm-independent platform to solve university timetabling problems." Thesis, California State University, Long Beach, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=1522628.
Повний текст джерелаАнотація:
Finding optimal solutions for large scale university timetabling problems that satisfy all operational needs and rules in an academic institution, while at the same time fulfill as many of the wishes and requirements of the lecturers and the students as possible, is an important but extremely difficult task for the staff involved. Hence, automating this entire process seems to be inevitable. As timetabling problems are in general NP-complete, several heuristic algorithms have been proposed and applied to solve the problem in the literature. But prior to implementation, it is not clear which would perform better for any specific timetabling problem. This triggers the need for developing an algorithm independent platform that could interface with all solver engines. The main objectives of this work are the following: i) Providing an algorithm-independent tool that can be used to define the resources needed to create and modify an academic schedule, ii) Automatically generate schedules that better fit the needs of both lecturers and students, and iii) Reduce the labor cost involved in the university timetabling problem process.
33
Hamlin, John D. "Novel auxiliaries with reactive dyes to solve environmental problems." Thesis, University of Manchester, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.488205.
Повний текст джерела
34
Archibald, Garry Alexander. "Gibraltar : attempts to solve an international problem, 1964-2002." Thesis, University of Ulster, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445229.
Повний текст джерела
35
SILVA, VICTOR LOPES DA. "A PROJECTOR OPERATOR FORMALISM TO SOLVE THE ANDERSON HAMILTONIAN." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2013. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23245@1.
Повний текст джерелаАнотація:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO
Nesta dissertação propomos um formalismo de operadores de projeção para obter a energia do estado fundamental do Hamiltoniano da Impureza de Anderson com repulsão Coulombiana U infinita. Este formalismo consiste em projetar o espaço de Hilbert em um subespaço de uma unica função correspondente ao estado fundamental do mar de Fermi, onde uma versão renormalizada do Hamiltoniano opera. A energia do estado fundamental pode ser obtida através de um processo autoconsistente. conhecendo a energia e possível calcular as propriedades fundamentais do sistema como a magnetização em função do campo magnético externo, a susceptibilidade magnética, a dependência da ocupação eletrônica como função da energia local da impureza e a temperatura Kondo, a qual caracteriza o comportamento universal do problema Kondo.
In this dissertation we propose a projector operator formalism to obtain the ground state energy of the Impurity Anderson Hamiltonian with innite Coulomb repulsion U. This formalism consists in projecting the Hilbert space into a sub-space of one function corresponding to the ground state of the free Fermi sea where a renormalized version of the Hamiltonian operates. The ground state energy can be obtained through a self-consistent process. From the knowledge of the energy, it is possible to calculate the fundamental properties of the system as it is the magnetization as a function of an external magnetic field, the magnetic susceptibility, the dependence of the electronic occupation as a function of the local energy of the impurity and the Kondo temperature, which characterizes the universal behavior of a Kondo problem.
36
Ghaderi, Reza. "Arranging simple neural networks to solve complex classification problems." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/844428/.
Повний текст джерелаАнотація:
In "decomposition/reconstruction" strategy, we can solve a complex problem by 1) decomposing the problem into simpler sub-problems, 2) solving sub-problems with simpler systems (sub-systems) and 3) combining the results of sub-systems to solve the original problem. In a classification task we may have "label complexity" which is due to high number of possible classes, "function complexity" which means the existence of complex input-output relationship, and "input complexity" which is due to requirement of a huge feature set to represent patterns. Error Correcting Output Code (ECOC) is a technique to reduce the label complexity in which a multi-class problem will be decomposed into a set of binary sub-problems, based oil the sequence of "0"s and "1"s of the columns of a decomposition (code) matrix. Then a given pattern can be assigned to the class having minimum distance to the results of sub-problems. The lack of knowledge about the relationship between distance measurement and class score (like posterior probabilities) has caused some essential shortcomings to answering questions about "source of effectiveness", "error analysis", " code selecting ", and " alternative reconstruction methods" in previous works. Proposing a theoretical framework in this thesis to specify this relationship, our main contributions in this subject are to: 1) explain the theoretical reasons for code selection conditions 2) suggest new conditions for code generation (equidistance code)which minimise reconstruction error and address a search technique for code selection 3) provide an analysis to show the effect of different kinds of error on final performance 4) suggest a novel combining method to reduce the effect of code word selection in non-optimum codes 5) suggest novel reconstruction frameworks to combine the component outputs. Some experiments on artificial and real benchmarks demonstrate significant improvement achieved in multi-class problems when simple feed forward neural networks are arranged based on suggested framework To solve the problem of function complexity we considered AdaBoost, as a technique which can be fused with ECOC to overcome its shortcoming for binary problems. And to handle the problems of huge feature sets, we have suggested a multi-net structure with local back propagation. To demonstrate these improvements on realistic problems a face recognition application is considered. Key words: decomposition/ reconstruction, reconstruction error, error correcting output codes, bias-variance decomposition.
37
Balavendran, Joseph Rani Deepika. "Gamification to Solve a Mapping Problem in Electrical Engineering." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1703330/.
Повний текст джерелаАнотація:
Coarse-Grained Reconfigurable Architectures (CGRAs) are promising in developing high performance low-power portable applications. In this research, we crowdsource a mapping problem using gamification to harnass human intelligence. A scientific puzzle game, Untangled, was developed to solve a mapping problem by encapsulating architectural characteristics. The primary motive of this research is to draw insights from the mapping solutions of players who possess innate abilities like decision-making, creative problem-solving, recognizing patterns, and learning from experience. In this dissertation, an extensive analysis was conducted to investigate how players' computational skills help to solve an open-ended problem with different constraints. From this analysis, we discovered a few common strategies among players, and subsequently, a library of dictionaries containing identified patterns from players' solutions was developed. The findings help to propose a better version of the game that incorporates these techniques recognized from the experience of players. In the future, an updated version of the game that can be developed may help low-performance players to provide better solutions for a mapping problem. Eventually, these solutions may help to develop efficient mapping algorithms, In addition, this research can be an exemplar for future researchers who want to crowdsource such electrical engineering problems and this approach can also be applied to other domains.
38
Mbayi, Charles K. "Efficient Variable Mesh Techniques to solve Interior Layer Problems." University of Western Cape, 2020. http://hdl.handle.net/11394/7324.
Повний текст джерелаАнотація:
Philosophiae Doctor - PhDSingularly perturbed problems have been studied extensively over the past few years from different perspectives. The recent research has focussed on the problems whose solutions possess interior layers. These interior layers appear in the interior of the domain, location of which is difficult to determine a-priori and hence making it difficult to investigate these problems analytically. This explains the need for approximation methods to gain some insight into the behaviour of the solution of such problems. Keeping this in mind, in this thesis we would like to explore a special class of numerical methods, namely, fitted finite difference methods to determine reliable solutions. As far as the fitted finite difference methods are concerned, they are grouped into two categories: fitted mesh finite difference methods (FMFDMs) and the fitted operator finite difference methods (FOFDMs). The aim of this thesis is to focus on the former. To this end, we note that FMFDMs have extensively been used for singularly perturbed two-point boundary value problems (TPBVPs) whose solutions possess boundary layers. However, they are not fully explored for problems whose solutions have interior layers. Hence, in this thesis, we intend firstly to design robust FMFDMs for singularly perturbed TPBVPs whose solutions possess interior layers and to improve accuracy of these approximation methods via methods like Richardson extrapolation. Then we extend these two ideas to solve such singularly perturbed TPBVPs with variable diffusion coefficients. The overall approach is further extended to parabolic singularly perturbed problems having constant as well as variable diffusion coefficients.
2023-08-31
39
Chavan, Harish Dnyandeo. "A Heuristic Approach to Solve Air Taxi Scheduling Problem." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9840.
Повний текст джерелаАнотація:
All passengers travel at the hour most convenient to them. But it is not always possible to find a flight at the right time to fly them to their destination. In the case where service in any one time period is insufficient to meet air travel demanded, it may be expected that some unfilled demand passengers will either delay their flight or will advance it, thus adding to the effective demand of the adjoining time periods.The obvious alternate means of travel is a rental car. It takes a lot more time than flight, but it is readily available at any given time. This brings us to think of an airline system that will work in a similar fashion; A system that can be named an "Air Taxi System."
This would mean a virtual highway in air space leading to a vast network. The network would be served by small aircraft flying from one city to another loading and unloading passengers. Such a large network having dynamic demand will have many issues to resolve before successfully launching a Small Aircraft Transportation System. One of the most important problems to solve is scheduling of aircraft for such a stochastic demand flow.
The objective of the research is to study a given set of airports with dynamic demand and known aircraft type. The major task will be to analyze the flow of passengers between each origin-destination pair and then schedule flights. The research will be to develop a schedule for a fixed set of airports with dynamic demand and known type of aircraft. The main objective is to maximize demand satisfaction. The study will also analyze the number of aircraft required for a given set of airports and find a method to schedule them.Master of Science
40
Paiva, Jonas Alves de. "Application of decision theory to solve game theory problems." Universidade Federal de Pernambuco, 2012. https://repositorio.ufpe.br/handle/123456789/10817.
Повний текст джерелаАнотація:
Submitted by João Arthur Martins (joao.arthur@ufpe.br) on 2015-03-05T17:29:44Z
No. of bitstreams: 2
license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5)
jap.pdf: 1375239 bytes, checksum: 91cf6bfce74a9d8f6396af2256a135af (MD5)Made available in DSpace on 2015-03-05T17:29:44Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) jap.pdf: 1375239 bytes, checksum: 91cf6bfce74a9d8f6396af2256a135af (MD5) Previous issue date: 2012
Os problemas de decisão enfrentados atualmente são bastante complexos devido ao grande número de variáveis que devem consideradas na construção dos modelos. Atualmente os tomadores de decisão se utilizam de duas teorias diretamente interligadas conceitualmente, a Teoria da Decisão e a Teoria dos Jogos que o ajudam a escolher uma ação ou conjunto de ações disponíveis, no intuito de maximizar sua utilidade esperada. A primeira teoria usa uma caraterização profunda dos elementos estatísticos os que atuam em um problema de decisão, enquanto que a Teoria dos Jogos analisa as interações entre os agentes, quando a ação de um afeta diretamente o resultado dos demais. Analisar a metodologia de tomada de decisão na Teoria dos Jogos como uma aplicação da Teoria da Decisão foi o principal propósito deste trabalho. Este propósito foi alcançado pelo estabelecimento das relações entre os elementos que compõem a estrutura das duas teorias e da definição de um algoritmo de resolução sando Teoria da Decisão para resolver problemas de Teoria dos Jogos. Depois partiu-se para a aplicação deste algoritmo para resolução de problemas de jogos simultâneos e sequenciais de dois jogadores, om estratégias puras, mistas e jogos de informação in completa. P de-se constatar que a metodologia da Teoria da De são alcançados mesmos resultados da análise feita pela Teoria dos Jogos. Este resultado reforça o fato de que estas duas teorias trabalham sobre os mesmos princípios e que a relação entre estas é mais imbricada do que se imagina. No aso usando Teoria da Decisão deve-se fazer ajustes na forma de analise para considerar a racionalidade e a interação entre os agentes.
41
Alam, Md Shafiful. "Iterative Methods to Solve Systems of Nonlinear Algebraic Equations." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2305.
Повний текст джерелаАнотація:
Iterative methods have been a very important area of study in numerical analysis since the inception of computational science. Their use ranges from solving algebraic equations to systems of differential equations and many more. In this thesis, we discuss several iterative methods, however our main focus is Newton's method. We present a detailed study of Newton's method, its order of convergence and the asymptotic error constant when solving problems of various types as well as analyze several pitfalls, which can affect convergence. We also pose some necessary and sufficient conditions on the function f for higher order of convergence. Different acceleration techniques are discussed with analysis of the asymptotic behavior of the iterates. Analogies between single variable and multivariable problems are detailed. We also explore some interesting phenomena while analyzing Newton's method for complex variables.
42
Lokombe, Okese Ngoie Sonia <1986>. "The UN role: peacemaker or unable to solve conflicts?" Master's Degree Thesis, Università Ca' Foscari Venezia, 2013. http://hdl.handle.net/10579/2670.
Повний текст джерелаАнотація:
La tesi analizza in che modo le Nazioni Unite sono intervenute nei conflitti e se i risultati sono stati positivi o negativi. In particolare, concentrerò la mia attenzione su alcuni eventi storici importanti cominciando dal passato 1950 fino ai giorni nostri. Ma prima d’entrare nel vivo dell’argomento farò una “panoramica storica” che partirà dalle origini delle Nazioni Unite e spiegherò la struttura dell’organizzazione internazionale, la quale è composta da cinque settori e diversi dipartimenti, ciascuno dei quali ha un specifico compito che mira al raggiungimento di un unico obbiettivo: “creare un futuro migliore per il mondo.” Il secondo capitolo, invece, esamina come le Nazioni Unite abbiano rivendicato i diritti umani attraverso una serie di iniziative, tra le quali: La Dichiarazione Universale dei Diritti Umani, L’Anno Internazionale della Donna, L’Anno Internazionale del Bambino, La Dichiarazione del Diritto allo Sviluppo, la creazione dell’Ufficio delle Nazioni Unite per i Diritti Umani (OHCHR) e l'ideazione del principio della Responsabilità di Proteggere (R2P). Inoltre, parlerò dei “Millenium Development Goals” concordati da tutti gli Stati Membri nel Settembre 2000, raggiunti però solo in parte fin’ora. Infine, il terzo capitolo darà degli esempi dettagliati riguardo al vero ruolo delle Nazioni Unite durante alcuni conflitti, ad esempio durante : La Crisi Missilistica di Cuba o la Guerra del Congo. Ancora una volta, le Nazioni Unite pare che seguano più la teoria e meno la pratica venendo meno agli obbiettivi portanti da loro preposti.
43
Jacobs, John Clinton. "Ad hoc regions : applying regional concepts to solve local problems /." Search for this dissertation online, 2005. http://wwwlib.umi.com/cr/ksu/main.
Повний текст джерела
44
Brown, Anna. "How Item Response Theory can solve problems of ipsative data." Doctoral thesis, Universitat de Barcelona, 2010. http://hdl.handle.net/10803/80006.
Повний текст джерелаАнотація:
Multidimensional forced-choice questionnaires can reduce the impact of numerous response biases typically associated with Likert scales. However, if scored with traditional methodology these instruments produce ipsative data, which has psychometric problems, such as constrained total test score and negative average scale inter-correlation. Ipsative scores distort scale relationships and reliability estimates, and make interpretation of scores problematic. This research demonstrates how Item Response Theory (IRT) modeling may be applied to overcome these problems. A multidimensional IRT model for forced-choice questionnaires is introduced, which is suitable for use with any forced-choice instrument composed of items fitting the dominance response model, with any number of measured traits, and any block sizes (i.e. pairs, triplets, quads etc.). The proposed model is based on Thurstone's framework for comparative data. Thurstonian IRT models are normal ogive models with structured factor loadings, structured uniquenesses, and structured local dependencies. These models can be straightforwardly estimated using structural equation modeling (SEM) software Mplus. Simulation studies show how the latent traits are recovered from the comparative binary data under different conditions. The Thurstonian IRT model is also tested with real participants in both research and occupational assessment settings. It is concluded that when the recommended design guidelines are met, scores estimated from forced-choice questionnaires with the proposed methodology reproduce the latent traits well.
45
Bremang, Appah. "Using ant colonies for solve the multiprocessor task graph scheduling." Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381.
Повний текст джерелаАнотація:
The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.
46
KHAN, Muhammad Umair. "Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem." Thesis, Högskolan Dalarna, Datateknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4910.
Повний текст джерелаАнотація:
The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.
47
Christoph, Leonore Hildegonde. "The role of metacognitive skills in learning to solve problems." [S.l. : Amsterdam : SIKS] ; Universiteit van Amsterdam [Host], 2006. http://dare.uva.nl/document/22568.
Повний текст джерела
48
PAPAVERO, Luca. "Dinamiche economiche e mutamento sociale in due comunità del territorio veronese. Cerea e Soave tra Sei e Settecento." Doctoral thesis, 2011. http://hdl.handle.net/11562/348971.
Повний текст джерелаАнотація:
Le questioni che la presente ricerca intende approfondire appartengono prevalentemente al settore della storia economica e sociale che si occupa delle società rurali. Il contesto di riferimento è costituito da due comunità del territorio veronese, Cerea e Soave, scelte in base alla loro collocazione geografica (pianura e collina), alle loro peculiarità economiche, nonché alla disponibilità del materiale archivistico. Le tematiche che questo studio pone in risalto riguardano soprattutto i processi di formazione e trasformazione di quella ‘borghesia rurale’ che, tra Sei e Settecento, in un ambiente caratterizzato da piccoli e piccolissimi possidenti, è formata da soggetti che dispongono nella maggior parte dei casi di risorse limitate. Tuttavia non mancano individui dotati di una discreta porzione di terre e di disponibilità monetarie tali da poter esercitare attività finanziarie come il prestito ad interesse. L’arricchimento di questi gruppi sociali consente loro di ritagliarsi una posizione di vertice all’interno delle comunità, come dimostra il ritrovamento di alcuni di loro all’interno dei consigli comunali o legati ad incarichi di pubblica amministrazione. In un quadro connotato da attività legate prevalentemente al settore primario, in cui l’elemento fondamentale non solo per la quotidiana sussistenza, ma anche per l’arricchimento e la promozione sociale, è la terra, abbiamo voluto dedicare particolare attenzione all’individuazione e all’osservazione di alcune famiglie, ma anche di alcune singole figure, che si distinguono sia per la loro vivacità ed intraprendenza economica, ma anche per il loro ruolo sociale e istituzionale all’interno della comunità.The questions that this research will deepen mainly belong to the field of economic and social history that deals with rural society. The framework consists of two communities in the Verona area, Cerea and Soave, chosen according to their geographical location (lowland and hill), economic characteristics and availability of archival records. The issues that this study highlights concern especially the processes of economic development and social changing of the 'rural bourgeoisie' that between the seventeenth and eighteenth century, in an environment characterized by small and smallest landowners, is made up of individuals who have in most cases limited resources. However there are individuals with a good portion of land and cash equivalents such as to conduct financial activities as giving loans on pawn. The enrichment of these groups allows them to carve out a leading position within the community, as evidenced by the discovery of some of them inside the town councils or commissions related to public administration. In a context characterized by activities related mainly to the primary sector, in which the key not only for daily subsistence, but also for the enrichment and social advancement, is the landed property, we wanted to pay particular attention to identifying and watching of some families, but also some individual figures, which stand out both for their economic vitality and initiative, but also for their social and institutional role within the community.
49
Soave, Armin Maximilian Peter [Verfasser]. "Herstellung und Charakterisierung von zellpermeablem Interferon-α [Interferon-alpha] des Waldmurmeltieres (Marmota monax) / vorgelegt von Armin Maximilian Peter Soave". 2009. http://d-nb.info/99851604X/34.
Повний текст джерела
50
"Determinação do comportamento volumetrico e do equilibrio de fases de sistemas contendo compostos associativos usando as equações de estado de redlich-kwong-soave e peng-robinson modificadas por meio da abordagem quimica." Tese, Biblioteca Digital da Unicamp, 2003. http://libdigi.unicamp.br/document/?code=vtls000334638.
Повний текст джерела