Orientador: Itala Maria Loffredo D'Ottaviano / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas / Made available in DSpace on 2018-08-22T15:04:13Z (GMT). No. of bitstreams: 1 Almeida_EdgarLuisBezerrade_M.pdf: 946200 bytes, checksum: e8e316a3ee7420c8d7f45a751651a436 (MD5) Previous issue date: 2013 / Resumo: Esta Dissertação apresenta uma definição de lógica abstrata e caracteriza alguns sistemas lógicos bastante conhecidos na literatura como casos particulares desta. Em especial, mostramos que a lógica de primeira ordem, lógica de segunda ordem, lógica com o operador Q1 de Mostowski e a lógica infinitária L!1! são casos particulares de lógicas abstratas. Mais que isso, mostramos que tais lógicas são regulares. Na análise de cada uma das lógicas acima citadas, mostramos o comportamento das mesmas com relação às propriedades de Löwenheim-Skolem e compacidade enumerável, resultados estes centrais à teoria de modelos. Nossa análise permite-nos constatar que, dentre os quatro casos apresentados, o único que goza de ambas as propriedades é a lógica de primeira ordem; as demais falham em uma, na outra ou em ambas as propriedades. Mostramos que isso não é mera coincidência, mas sim um resultado profundo, que estabelece fronteiras bem delimitadas à lógica de primeira ordem, conhecido como primeiro teorema de Lindström: se uma lógica é regular, ao menos tão expressiva quanto à lógica de primeira ordem e satisfaz ambas as propriedades citadas, então esta é equivalente a lógica de primeira ordem. Realizamos uma prova cuidadosa do teorema, em que cada ideia e cada estratégia de prova é estabelecida criteriosamente. Com seu trabalho, Lindström inaugurou um novo e profícuo campo de estudo, a teoria abstrata de modelos que estabelece, com relação a diversas combinações de propriedades de sistemas lógicos, uma estratificação entre lógicas. Apresentamos um outro exemplo de tal estratificação através de uma versão modal do teorema de Lindström, versão esta que caracteriza a lógica modal básica como maximal quanto a bissimilaridade e compacidade. Encerramos esta Dissertação com algumas considerações acerca da influência do primeiro teorema de Lindström / Abstract: This thesis presents the definition of abstract logic and features some quite logical systems presented in the literature as particular cases of this. In particular, we show that first-order logic, second-order logic, the logic with Mostowski's operator Q1 and the infinitary logic L!1! are specific systems of abstract logic. Moreover, we show that such logics are regular. In the analysis of each above mentioned logical systems we analyses his performance with regard to the properties of compactness and Löwenheim-Skolem, results that have important role in model theory. Our analysis allows us to conclude that among the four cases, the only one who enjoys both properties is the first-order logic, and all others fail in one, other or both properties. We show that this is not mere coincidence, but rather a deep, well-defined boundaries establishing the first-order logic, known as first Lindström's theorem: a regular logic that is at least as expressive as first-order logic and satisfies both properties mentioned, then this is equivalent to first-order logic. We conducted a thorough proof of the theorem, in which each idea and each proof strategy is carefully established. With his work Lindström inaugurated a new and fruitful field of study, the abstract model theory, which establishes with respect to different combinations of properties of logical systems, stratification between logical. Here is another example of such stratification through one of the theorem of modal version Lindström, which characterizes this version of the logic basic modal such as maximal bissimimulation and compactness. We conclude the thesis with some considerations about the influence of the Lindström's theorem / Mestrado / Filosofia / Mestre em Filosofia

L'approche de la biologie des systèmes vise à intégrer les méthodologies appliquées dans la conception et l'analyse des systèmes technologiques complexes, au sein de la biologie afin de comprendre les principes de fonctionnement globaux des systèmes biologiques. La thèse s'inscrit dans le cadre de la biologie des systèmes et en particulier dans la prolongation d'une méthode issue de ce cadre : la méthode Resource Blance Analysis (RBA). Nous visons dans cette thèse à augmenter le pouvoir prédictif de la méthode via un travail de modélisation tout en gardant un bon compromis entre représentativité des modèles issus de ce cadre et leur résolution numérique efficace. La thèse se décompose en deux grandes parties : la première vise à intégrer les aspects thermodynamiques et cinétiques inhérents aux réseaux métaboliques. La deuxième vise à comprendre l'impact de l'aspect stochastique de la production des enzymes sur le croissance de la bactérie. Des méthodes numériques ont été élaborées pour la résolution des modèles ainsi établis dans les deux cas déterministe et stochastique. / In order to understand the global functioning principals of biological systems, system bio- logy approach aims to integrate the methodologies used in the conception and the analysis of complex technological systems, within the biology. This PhD thesis fits into the system biology framework and in particular the extension of the already existing method Resource Balance Analysis (RBA). We aim in this PhD thesis to improve the predictive power of this method by introducing more complex model. However, this new model should respect a good trade-off between the representativity of the model and its efficient numerical computation. This PhD thesis is decomposed into two major parts. The first part aims the integration of the metabolic network inherent thermodynamical and kinetic aspects. The second part aims the comprehension of the impact of enzyme production stochastic aspect on the bacteria growth. Numerical methods are elaborated to solve the obtained models in both deterministic and stochastic cases.

The increasing use of model-driven software development has renewed emphasis on using domain-specific models during application development. More specifically, there has been emphasis on using domain-specific modeling languages (DSMLs) to capture user-specified requirements when creating applications. The current approach to realizing these applications is to translate DSML models into source code using several model-to-model and model-to-code transformations. This approach is still dependent on the underlying source code representation and only raises the level of abstraction during development. Experience has shown that developers will many times be required to manually modify the generated source code, which can be error-prone and time consuming. An alternative to the aforementioned approach involves using an interpreted domain-specific modeling language (i-DSML) whose models can be directly executed using a Domain Specific Virtual Machine (DSVM). Direct execution of i-DSML models require a semantically rich platform that reduces the gap between the application models and the underlying services required to realize the application. One layer in this platform is the domain-specific middleware that is responsible for the management and delivery of services in the specific domain. In this dissertation, we investigated the problem of designing the domain-specific middleware of the DSVM to facilitate the bifurcation of the semantics of the domain and the model of execution (MoE) while supporting runtime adaptation and validation. We approached our investigation by seeking solutions to the following sub-problems: (1) How can the domain-specific knowledge (DSK) semantics be separated from the MoE for a given domain? (2) How do we define a generic model of execution (GMoE) of the middleware so that it is adaptable and realizes DSK operations to support delivery of services? (3) How do we validate the realization of DSK operations at runtime? Our research into the domain-specific middleware was done using an i-DSML for the user-centric communication domain, Communication Modeling Language (CML), and for microgrid energy management domain, Microgrid Modeling Language (MGridML). We have successfully developed a methodology to separate the DSK and GMoE of the middleware of a DSVM that supports specialization for a given domain, and is able to perform adaptation and validation at runtime.

Superelastic Shape Memory Alloys (SMAs) are being explored as alternative reinforcing materials to traditional deformed steel reinforcement for seismic applications. The main advantage is the ability of the SMA to recover large nonlinear strains, which promotes the self-centering phenomenon. The primary objective of this research is to present the performance, before and after repair, of slender reinforced concrete shear walls, one reinforced internally with SMAs in the boundary zones within the plastic hinge region and other control wall reinforced with conventional steel only. The repair procedure included removal of damaged concrete within the plastic hinge region, replacing fractured and buckled reinforcement, followed by shortening of the SMA reinforcement in the boundary zones of SMA wall. The removed concrete was replaced with self-consolidating concrete, while the concrete above the plastic hinge region remained intact. The SMA reinforced concrete shear wall (before and after repair) exhibited stable hysteretic response with significant strength, and displacement and energy dissipation capacities. In addition, the walls exhibited pinching in the hysteretic response as a result of minimizing the residual displacements due to the restoring capacity of the SMA reinforcement. The results demonstrate that SMA reinforced components are self-centering, permitting repairing of damaged areas. Furthermore, the SMA reinforcement is re-usable given its capacity to reset to its original state. The length of the SMA bars in the original and repaired wall, in addition to the presence of starter bars in the original wall, were significant factors in the location of failure of the walls. The conventional steel wall prior to repair was unstable due to large residual displacements experienced during the original test. After repair the wall exhibited ratcheting in hysteretic response but with significant strength. The conventional wall, before and after repair, dissipated more energy than the SMA wall. This was the result of the wider hysteretic loops with reduced punching, but at the cost of large residual displacements. The starter bars in the conventional wall before repair controlled the location of failure, while the presence of couplers in the plastic hinge region was the main factor in determining the failure location in the repaired conventional wall.

In the last two decades, qualitative spatial representation and reasoning, and in particular spatial logics, have been the subject of an increased interest from the Artificial Intelligence community. By a spatial logic, we understand a formal language whose variables range over subsets of a fixed topological space, called regions, and whose non-logical primitives have fixed geometric meanings. A spatial logic for reasoning about regions in a Euclidean space is called a Euclidean spatial logic. We consider first-order and quantifier-free Euclidean spatial logics with primitives for topological relations and operations, the property of convexity and the ternary relation of being closer-than. We mainly focus on the computational properties of such logics, but we also obtain interesting model-theoretic results. We provide a systematic overview of the computational properties of firstorder Euclidean spatial logics and fill in some of the gaps left by the literature. We establish upper complexity bounds for the (undecidable) theories of logics based on Euclidean spaces of dimension greater than one, which yields tight complexity bounds for all but two of these theories. In contrast with these undecidability results, we show that the topological theories based on one-dimensional Euclidean space are decidable, but non-elementary. We also study the computational properties of quantifier-free Euclidean spatial logics, and in particular those able to express the property of connectedness. It is known that when variables range over regions in the Euclidean plane, one can find formulas in these languages satisfiable only by regions with infinitely many connected components. Using this result, we show that the corresponding logics are undecidable. Further, we show that there exist formulas that are satisfiable in higher-dimensional Euclidean space, but only by regions with infinitely many connected components. We finish by outlining how the insights gained from this result were used (by another author) to show the undecidability of certain quantifier-free Euclidean spatial logics in higher dimensions.

New magnetocaloric Heusler alloys with larger magnetocaloric effects need to function in relatively low applied magnetic fields ≤ 1 T. Therefore, the emphasis of this Ph.D. thesis was to understand how the first order magnetostructural transformation in Mn-rich Ni-based rare-earth free magnetocaloric Heusler alloys works and to use this understanding for the design of new Mn-rich Ni-based rare-earth free magnetocaloric Heusler alloys. In this context, the rare-earth free, non-toxic, and environmentally friendly Heusler series: Ni2−xMn1+xSn, Mn50Ni50−ySny, and Ni-(Co-)Mn-In were systematically studied. In detail, it pointed out that in the Heusler series Ni2−xMn1+xSn, the structure and the disorder character can be predicted by using simple rules. On the other hand, an isoplethal section of the Heusler series Mn50Ni50−ySny was derived, which is very useful for the design of new magnetocaloric materials. In addition to it, in the Heusler alloy Ni49.9Mn34.5In15.6 a large saturated magnetic moment and a reversible magnetocaloric effect at its purely second order magnetic phase transition was present, which is in reasonable agreement with ab initio calculations. Finally, the effect of post-annealing on the Heusler alloy Ni45.2Co5.1Mn36.7In13 revealed that the magnetocaloric effect could be tuned and improved significantly. Consequently, this work shows that the Heusler alloys are promising candidates for magnetocaloric applications.

Orientadores: Kleber Roberto Pirota, Fanny Béron / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Física Gleb Wataghin / Made available in DSpace on 2018-08-31T01:32:45Z (GMT). No. of bitstreams: 1 CostaArzuza_LuisCarlos_D.pdf: 5838350 bytes, checksum: f92268a1c7835ed7d3d7f0a83abe2e63 (MD5) Previous issue date: 2016 / Resumo: Este trabalho visa estudar a inversão da magnetização de redes de nanofios de níquel modulados, incorporados em membranas porosas de alumina. A modulação do nanofio foi obtida a partir da variação do diâmetro, resultando em nanofios com dois segmentos. O diâmetro de cada segmento está ao redor do diâmetro crítico do Ni (40 nm), onde, abaixo e acima do mesmo, a inversão da magnetização acontece por meio de diferentes estruturas da parede de domínio; transversais e vórtex. A caracterização magnética das redes de nanofios foi feita usando simulações micromagnéticas e curvas de histerese magnética e de reversão de primeira ordem (método FORC). As medidas foram realizadas em vários arranjos de nanofios ordenados com diferentes razões de comprimento e diâmetros de segmentos, e estas foram comparadas com o arranjo de nanofios sem variação do diâmetro. Simulações micromagnéticas em nanofios isolados e arranjo de nanofios de primeiros vizinhos, mostram que a estrutura da parede de domínio, a qual depende do diâmetro do segmento, sofre uma transformação ao cruzar a região da modulação do diâmetro, porém a dinâmica da transformação depende das dimensões de cada segmento do nanofio. O comportamento magnético experimental do arranjo é atribuído a um campo de interação não homogêneo entre os nanofios, o qual surge devido a modulação do diâmetro. Este campo dá origem a uma interação mais forte na extremidade com diâmetro maior em relação à extremidade com diâmetro menor, resultando em um comportamento da susceptibilidade bastante complexo. Consideramos como principal resultado deste trabalho à possibilidade de controlar o mecanismo de inversão da magnetização em rede de nanofios modulados através da modulação do diâmetro. Os resultados obtidos foram interpretados através dos diagramas FORC, onde o processo dinâmico da inversão da magnetização é evidenciado por meio de diagramas estáticos (diagramas FORC), similar a uma foto estroboscópica / Abstract: We studied the magnetization reversal in modulated nickel nanowire arrays, embedded in porous alumina membranes. The modulation of the nanowire was obtained from the variation in diameter, resulting in nanowires with two segments. The diameter of each segment is below and above the critical diameter for Ni (40 nm), for which the reversal of magnetization changes from transversal to vortex domain wall structure. Magnetic characterization of nanowire networks was made using micromagnetic simulations, magnetic hysteresis and First-order reversal curves (FORC method). The measurements were performed in nanowire arrays with different ratios of length and diameter. The results were compared with the arrangement of nanowires without diameter variation. Micromagnetic simulations for isolated nanowires and nanowire array with few magnetic entities show that the structure of domain wall, which depends on the segment diameter, changes when it crosses the separation region of the diameter modulation and the dynamics of transformation depends on the dimensions of each nanowire¿s segment. The experimental magnetic behavior of the nanowire array is attributed to an inhomogeneous interaction field among the nanowires due to diameter modulation. This effect gives rise to a stronger interaction in the larger diameter segment resulting in a very complex susceptibility behavior. We consider the possibility to control the reversal magnetization mechanism in nanowire array through diameter modulation as the main result of this work. The results were interpreted using the FORC diagrams where the dynamic process of magnetization reversal is evidenced by static diagrams (FORC diagrams), similar to a stroboscopic picture / Doutorado / Física / Doutor em Ciências / 1060136/2011 / CAPES

Artificial agents are usually designed to achieve specific goals. An agent's competency can be defined as its ability to accomplish its goals under different conditions. This thesis restricts attention to a specific type of goal, namely reaching a desired state without exceeding a tolerance threshold of undesirable events in a first-order Markov process. For such goals, the state-dependent competency for an agent can be defined as the probability of reaching the desired state without exceeding the threshold and within a time limit given an initial state. The thesis further defines total competency as the set of state-dependent competency relationships over all possible initial states. The thesis uses a Monte Carlo approach to establish a baseline for estimating state-dependent competency. The Monte Carlo approach (a) uses trajectories sampled from an agent behaving in the environment, and then (b) uses nonlinear regression over the trajectory samples to estimate the competency curve. The thesis further presents an equation demonstrating recurrent relations for total competency and an algorithm based on that equation for computing total competency whose worst case computation time grows quadratically with the size of the state space. Simple maze-based Markov chains show that the Monte Carlo approach to estimating the competency agrees with the results computed by the proposed algorithm. Lastly, the thesis explores a special case where there are multiple sequential atomic goals that make up a complex goal. The thesis models a set of sequential goals as a Bayesian network and presents an equation based on the chain rule for deriving the competency for the complex goal from the competency for atomic goals. Experiments for the canonical taxi problem with sequential goals show the correctness of the Bayesian network-based decomposition approach.

Low-income students and blacks make up nearly half of public school students, and on nearly every indicator of educational access, particularly technology, these students have less access than white affluent students (Darling-Hammond, Zielezinski, and Goldman, 2014). The National Center for Education Statistics (2005) reported that teacher quality and missed opportunities to learn accounted for 93% of African Americans, and 87% of Hispanics performing below proficiency in mathematics. Students that do not master mathematics standards by the end of compulsory education are less likely to complete general mathematics courses in upper secondary school and beyond successfully (Levpušček, Zupančič, & Sočan, 2013). Interactive whiteboards (IWBs) can support student engagement, interest and possibly increased achievement in mathematics if used effectively. The purposes of this study were to (a) examine the perspectives of secondary mathematics teachers with regard to the use of IWBs for teaching, (b) determine how secondary mathematics teachers in one school district use the IWB to guide students toward mathematical proficiency, and (c) consider how secondary mathematics teachers’ perspectives in one school district were influenced by 1st order and 2nd order barriers to technology integration. The following factors were considered when examining the context needed to better understand the complexities using IWBs effectively in mathematics: (a) Niess et al. (2009) Mathematics Teachers’ TPACK Development Model, (b) Miller and Glover (2005) stages of IWB use, and (c) Ertmer (1999) first-order and second-order barriers to technology integration. The data revealed that at each stage of IWB use (a) supported didactic, (b)interactive, and (c) enhanced interactivity, teachers faced a unique combination of first-order and second-order barriers to IWB integration that affected how IWBs were used for teaching mathematics. The results of the data suggest that as barriers are resolved at each stage of IWB use, the likelihood mathematics teachers will effectively use IWBs to teach mathematics will increase. Suggestions including administrator support and modifying professional development practices are included to provide educators and policy makers the practical knowledge needed to inform sustainable plans for integrating IWBs effectively.

Technological developments in devices and storages have made large volumes of data collections more accessible than ever. This transformation leads to optimization problems with massive data in both volume and dimension. In response to this trend, the popularity of optimization on high performance computing architectures has increased unprecedentedly. These scalable optimization solvers can achieve high efficiency by splitting computational loads among multiple machines. However, these methods also incur large communication overhead. To solve optimization problems with millions of parameters, communication between machines has been reported to consume up to 80% of the training time. To alleviate this communication bottleneck, many optimization algorithms with data compression techniques have been studied. In practice, they have been reported to significantly save communication costs while exhibiting almost comparable convergence as the full-precision algorithms. To understand this intuition, we develop theory and techniques in this thesis to design communication-efficient optimization algorithms. In the first part, we analyze the convergence of optimization algorithms with direct compression. First, we outline definitions of compression techniques which cover many compressors of practical interest. Then, we provide the unified analysis framework of optimization algorithms with compressors which can be either deterministic or randomized. In particular, we show how the tuning parameters of compressed optimization algorithms must be chosen to guarantee performance. Our results show explicit dependency on compression accuracy and delay effect due to asynchrony of algorithms. This allows us to characterize the trade-off between iteration and communication complexity under gradient compression. In the second part, we study how error compensation schemes can improve the performance of compressed optimization algorithms. Even though convergence guarantees of optimization algorithms with error compensation have been established, there is very limited theoretical support which guarantees improved solution accuracy. We therefore develop theoretical explanations, which show that error compensation guarantees arbitrarily high solution accuracy from compressed information. In particular, error compensation helps remove accumulated compression errors, thus improving solution accuracy especially for ill-conditioned problems. We also provide strong convergence analysis of error compensation on parallel stochastic gradient descent across multiple machines. In particular, the error-compensated algorithms, unlike direct compression, result in significant reduction in the compression error. Applications of the algorithms in this thesis to real-world problems with benchmark data sets validate our theoretical results. / Utvecklandet av kommunikationsteknologi och datalagring har gjort stora mängder av datasamlingar mer tillgängliga än någonsin. Denna förändring leder till numeriska optimeringsproblem med datamängder med stor skala i volym och dimension. Som svar på denna trend har populariteten för högpresterande beräkningsarkitekturer ökat mer än någonsin tidigare. Skalbara optimeringsverktyg kan uppnå hög effektivitet genom att fördela beräkningsbördan mellan ett flertal maskiner. De kommer dock i praktiken med ett pris som utgörs av betydande kommunikationsomkostnader. Detta orsakar ett skifte i flaskhalsen för prestandan från beräkningar till kommunikation. När lösning av verkliga optimeringsproblem sker med ett stort antal parametrar, dominerar kommunikationen mellan maskiner nästan 80% av träningstiden. För att minska kommunikationsbelastningen, har ett flertal kompressionstekniker föreslagits i litteraturen. Även om optimeringsalgoritmer som använder dessa kompressorer rapporteras vara lika konkurrenskraftiga som sina motsvarigheter med full precision, dras de med en förlust av noggrannhet. För att ge en uppfattning om detta, utvecklar vi i denna avhandling teori och tekniker för att designa kommunikations-effektiva optimeringsalgoritmer som endast använder information med låg precision. I den första delen analyserar vi konvergensen hos optimeringsalgoritmer med direkt kompression. Först ger vi en översikt av kompressionstekniker som täcker in många kompressorer av praktiskt intresse. Sedan presenterar vi ett enhetligt analysramverk för optimeringsalgoritmer med kompressorer, som kan vara antingen deterministiska eller randomiserade. I synnerhet visas val av parametrar i komprimerade optimeringsalgoritmer som avgörs av kompressorns parametrar som garanterar konvergens. Våra konvergensgarantier visar beroende av kompressorns noggrannhet och fördröjningseffekter på grund av asynkronicitet hos algoritmer. Detta låter oss karakterisera avvägningen mellan iterations- och kommunikations-komplexitet när kompression används. I den andra delen studerarvi hög prestanda hos felkompenseringsmetoder för komprimerade optimeringsalgoritmer. Även om konvergensgarantier med felkompensering har etablerats finns det väldigt begränsat teoretiskt stöd för konkurrenskraftiga konvergensgarantier med felkompensering. Vi utvecklar därför teoretiska förklaringar, som visar att användande av felkompensering garanterar godtyckligt hög lösningsnoggrannhet från komprimerad information. I synnerhet bidrar felkompensering till att ta bort ackumulerade kompressionsfel och förbättrar därmed lösningsnoggrannheten speciellt för illa konditionerade kvadratiska optimeringsproblem. Vi presenterar också stark konvergensanalys för felkompensering tillämpat på stokastiska gradientmetoder med ett kommunikationsnätverk innehållande ett flertal maskiner. De felkompenserade algoritmerna resulterar, i motsats till direkt kompression, i betydande reducering av kompressionsfelet. Simuleringar av algoritmer i denna avhandling på verkligaproblem med referensdatamängder validerar våra teoretiska resultat. / <p>QC20191120</p>