Dissertations / Theses on the topic 'SMTr'

La sitmulation magnétique transcrânienne répétitive (SMTr) est une technique de stimulation cérébrale non-invasive. Notre travail a porté sur les effets analgésiques de la SMTr. Nos travaux chez le volontaire sain, nous ont permis de montrer que les stimulations unilatérales du cortex moteur primaire ou du cortex préfrontal dorsolatéral induisaient des effets analgésiques diffus (réduction de l’intensité d’une douleur thermique). Ces effets n’étaient pas associés à des modifications du réflexe nociceptif RIII, suggérant qu’ils ne dépendent pas de l’activation des contôles descendants inhibiteurs. Dans une autre étude chez le volontaire sain, nous avons montré que les effets analgésiques des stimulations de M1 dépendent de la mise en jeu des systèmes opioïdes endogènes. Nos études dans la fibromyalgie, nous ont d’abord permis de mettre en évidence chez ces patients des altérations significatives de la modulation intracorticale corrélées à certains symptômes cliniques majeures de cette affection. Dans une seconde étude, nous avons montré, pour la première fois, qu’il est possible de maintenir des effets analgésiques au long cours. Ces effets analgésiques étaients associés à une amélioration globale de la qualité de vie des patientes. Nous avons montré que les effets cliniques de la SMTr étaient corrélés à une augmentation de la modulation intracorticale, suggérant qu’il est possible d’identifer des critères de réponse à ce type de traitement. Au total, nos études ont apporté des informations nouvelles concernant les mécanismes de l’action analgésique de la SMTr et ses indications cliniques potentielles chez les patients souffrant de douleurs chroniques

Les Troubles Obsessionnels Compulsifs (TOC) sont composés de compulsions, qui sont des comportements répétés, et d'obsessions, qui sont des pensées intrusives. Leurs impacts sur le fonctionnement socio-professionnel handicapent et isolent considérablement les patients. Les traitements efficaces pour ces patients sont médicamenteux ou les thérapies cognitives et comportementales. Néanmoins, un nombre élevé de patients ne voient pas leurs symptômes diminuer suffisamment avec l'un ou l'autre des traitements ou en les combinant. Il est donc nécessaire de développer des traitements intermédiaires afin d'améliorer la palette de traitements des TOC. Une alternative thérapeutique utilisée en psychiatrie pour la dépression est la Stimulation Magnétique Transcrânienne répétée (TMS). Néanmoins, son efficacité reste difficile à démontrer dans le TOC, dû à une multitude de facteurs à prendre en compte, et peut nécessiter d'étudier le fonctionnement de la rTMS sur une population de sujets sains. Lors de notre première étude, nous avons évalué l'impact d'un protocole de rTMS sur les fonctions cognitives de sujets sains. Nous avons donc pu observer, indépendamment de la pathologie, l'effet de deux semaines de TMS sur les performances cognitives et sur l'activité cérébrale. Malgré une absence d'effet comportemental, une modification du réseau cortico-sous-cortical lié à une tâche de mémoire de travail a pu être montrée. Ces résultats orientent les recherches futures à modifier l'approche méthodologique, améliorer l'approche clinique des TOC, et changer l'approche neurophysiologique de la TMS dans le but de proposer un traitement complémentaire pour améliorer l'état clinique des patients
Obsessive Compulsive Disorder (OCD) is a mental illness defined by the presence of compulsions which are repetitive behaviors and obsessions which are intrusive thoughts. OCD may have a dramatic impact on the social and professional lifes of patients. The treatments for OCD are medication and cognitive-behavioral therapy. Nevertheless, symptoms remain in 25 to 40% of patients. Repeated Transcranial Magnetic Stimulation (rTMS) represent a novel therapeutic option for OCD patients however its effectiveness has been difficult to prove partly due to a multitude of factors involving the rTMS technique itself. The first study evaluated the impact of a two-week rTMS protocol on cognitive functions in healthy subjects using fMRI during a working-memory task. In the absence of behavioral modification, we observed that compared to sham, rTMS induced changes at multiple nodes of the cerebral network activated by the task beyond the stimulation site. This result represents an encouraging perspective for rTMS intervention on pathological brain network in OCD because hyperactive regions in this disorder (orbitofrontal cortex and anterior cingulate cortex) are too deep to be directly stimulated by rTMS. Our second study targeted the supplementary motor area (SMA), which had been suggested as candidate target region lying near the anterior cingulate cortex. We used for four week rTMS in a group of OCD patients while pre- and post-treatment fMRI was acquired during performance of a cognitive inhibition task. Stimulation of the SMA did not result in significant clinical improvement. These results shall guide future research to address the methodological challenges and the neurophysiological mechanisms of rTMS to improve its clinical efficacy for OCD

Målet med mitt examensarbete har varit att formge en smörförpackning åt Emåmejeriet, där huvudanvändarna är restaurangpersonal och restauranggäster, som jobbar respektive besöker de mest exklusiva krogarna i Sverige. Syftet med uppsatsen är att beskriva ett uppdrag som har genomförts i samarbete med Emåmejeriet samt att återge min designprocess och mina ställnings-taganden under denna process.

Observationer, användarstudier, intervjuer och studier av tidigare forskning inom produktdesign samt marknadsföring har legat till grund för detta arbete. Ingående litteraturstudier inom förpackningsdesign samt min tidigare erfarenhet inom grafisk design har funnits med som ett komplement.

Kvalitativa intervjuer och användarstudier har genomförts med restaurangpersonal och restauranggäster under designprocessen. Jag har även genomfört observationer av restauranggästers beteende under intag av måltid.

Ett flertal mock-ups på olika varianter av produkten togs fram och användes till användartester på restaurangpersonal och presumtiva restauranggäster. Efter utvärdering av användartesterna justerades formen och mer genom-arbetade mock-ups togs fram för ytterligare tester.

Resultatet är en smörförpackning i etsat glas, som är tänkt att ingå i varje kuvert på restaurangbordet. Produkten utmärker sig med funktioner för att underlätta för restauranger att servera ett smör vid de optimala förhållanden som behövs för en komplett smakupplevelse.

Essän består av berättelser och fakta som berör restaurangbranschens olika yrkeskategorier och deras arbete. Den beskriver yrkeskunnande, språket på restaurang samt värdet av manualer och riktlinjer. Språket som används på restaurang belyses även i en del av arbetet.

The thesis focuses on a field of museum marketing, particularly on a marketing mix issue. The marketing mix is described on an example of an exhibition cycle named DEATH which took place in five object of the National museum during a period from 18 June 2014 until 31 March 2016. The DEATH was the last from a row of exhibition cycles which prevailed during the closing of the Historical building for the reason of its complex reconstruction. A descriptive analysis of the marketing mix of the DEATH exhibition cycle is conducted in the thesis. Application of marketing tools is subsequently evaluated through detailed analyses which will identify weaknesses. At the same time recommendations are developed to improve the National museums marketing mix and make it more efficient.

In this study, 24 adults without any psychological or neurological disorders participated either in 10 neurofeedback training sessions to increase the amplitude of a frequency band between 12 and 15 Hz (sensorimotor rhythm - SMR) or in ten mock neurofeedback sessions. Pre and post training measures of memory and executive functions were completed, along with quantitative electroencephalography (QEEG) measurements in order to detect changes after the training course. Furthermore, measures of SMR amplitude were taken within and across sessions to determine whether self-regulation of SMR had been achieved. The data analysis performed shows no significant differences in cognitive performance between the group who underwent neurofeedback training and the group who underwent mock neurofeedback training. The groups did not show electrophysiological changes after the training. Additionally, no significant changes in SMR amplitude or percent time above threshold across or within the 10 sessions were found in the experimental group. Moreover, the data showed a tendency, which indicates that the higher the baseline amplitude and absolute power of SMR the less time was spent above threshold during the training and the less increase in SMR amplitude between baseline and training periods. The findings obtained indicate that neurofeedback training did not affect memory, executive functions or the QEEG. The absence of significant changes in SMR amplitude across sessions might reflect failure in learning the neurofeedback task and may account for the lack of cognitive improvement and QEEG changes. The fact that the ability to self-regulate SMR might be dependent on baseline amplitude has important implications in setting thresholds. Setting thresholds according to baseline levels might increase the difficulty in maintaining SMR above threshold when the baseline is higher. Future research should also address whether baseline amplitude has a predictive value in determining successful self-regulation of brain activity.

Submitted by repositorio repositorio (repositorio@unifei.edu.br) on 2015-10-08T12:47:01Z No. of bitstreams: 1 dissertacao_oliveira_2014.pdf: 2724042 bytes, checksum: 2fdf9db584836bc5c5cab68f90577e69 (MD5)
Made available in DSpace on 2015-10-08T12:47:01Z (GMT). No. of bitstreams: 1 dissertacao_oliveira_2014.pdf: 2724042 bytes, checksum: 2fdf9db584836bc5c5cab68f90577e69 (MD5) Previous issue date: 2014-12
Um dos principais problemas encontrados no serviço de correio eletrônico (e-mail) é o recebimento de mensagens não solicitadas, conhecidas como spam. O Spam causa sérios prejuízos às instituições, sobrecarregando servidores, links de comunicação e ativos de rede. Esta dissertação propõe uma modificação no Simple Mail Transfer Protocol (SMTP) para redução de spam. A modificação no protocolo produz três consequências vantajosas. A primeira, consiste na rejeição de e-mails indesejados, assim definidos pelo destinatário, evitando-se o desperdício de seus recursos computacionais e de rede. A segunda, consiste no retorno do e-mail indesejado ao spammer, causando-lhe custos, uma vez que seu servidor efetuará processamentos e armazenamentos extras para tratar o spam recusado. A terceira consequência consiste no fato de que, em virtude da recusa, o spammer remove o endereço do destinatário de suas listas de distribuição. A modificação do SMTP foi implementada em um servidor de e-mail Zimbra e avaliada exaustivamente. Os resultados são promissores. O servidor Zimbra modificado demonstrou desempenho e custo computacionais equivalentes ao do servidor Zimbra original quando recebe e-mails legítimos. Quando recebe spam porém, ele apresenta melhor desempenho e custo computacionais que os do servidor Zimbra original.

Automated planning is a discipline in the field of Artificial Intelligence that can be described as the process of finding a course of action that achieves a specified task. In other words, it focuses on reasoning about causal structures and identifying the necessary actions for achieving a given goal. Although classical planning approaches have been widely successful, the needs of real-world applications go way beyond its potential. In the area of automated planning many formalisms exist in order to express all the needs these problems encompass. This huge variety of problems range from classical planning to reasoning about partially observable Markov decision processes, multi-agent planning, real-time perceiving and acting or temporal and numeric reasoning. There exist a wide range of techniques to confront each of the aforementioned formalisms, each one having its own advantages and weaknesses. In this thesis we restrict ourselves to the setting of hybrid planning. That is, the combination of the propositional planning with extensions to be able to reason about different theories, such as integer or real arithmetic. This thesis presents a set of techniques to efficiently encode planning problems that involve reasoning at propositional level as well as to deal with background theories. To address reasoning about the different theories, we use SAT Modulo Theories (SMT), an extension to SAT that allows the solver to, in a modular way, reason about non-propositional symbols belonging to background theories. This framework is interesting because it is expressive enough to translate many real-world planning problems. The main objective of the thesis is to push forward the state of the art of planning as SMT, by devising encodings of planning problems to SMT. The focus is especially on numeric planning, combining classical planning with the ability to reason about integer or floating point numbers. In this setting, many real-world resource-based problems can be encoded. Our implementation of the encodings resulted in a new planner called Rantanplan, which preprocesses and translates numeric planning problems into SMT formulas, to solve them using a SMT solver of choice. We also provide detailed experimental results on new and well-known domains, to show that our approach is competitive with the existing exact numeric planners
La planificació automàtica és una disciplina dins de la intel·ligència artificial que pot ser descrita com el procés de trobar un seguit d’accions que assoleixen una tasca específica. En altres paraules, es focalitza en raonar sobre estructures causals i identificar les accions necessàries per assolir un objectiu donat. Encara que les aproximacions a la planificació automàtica clàssica han tingut un gran èxit, les necessitats que tenen moltes aplicacions al món real estan per sobre de les seves possibilitats. Existeixen molts formalismes a l’àrea de la planificació automàtica que poden expressar totes les necessitats que tenen aquest tipus de problemes. Aquesta enorme varietat de problemes van des de la planificació clàssica, passant per problemes expressats amb processos de decisió de Markov parcialment observables, problemes de percepció i decisió en temps real o problemes que incorporen raonament temporal i numèric. Existeixen un ampli ventall de tècniques per a afrontar cada un dels formalismes esmentats, cada una amb els seus avantatges i inconvenients. En aquesta tesi ens restringim en el marc de la planificació híbrida. Exactament, la combinació de la planificació proposicional amb extensions per a poder raonar sobre diferents teories, tals com l’aritmètica real o entera. Aquesta tesi presenta un conjunt de tècniques per a codificar de manera eficient problemes de planificació que involucren raonament a nivell proposicional així com raonament amb teories de fons. Per abordar el raonament sobre les diferents teories, farem anar SAT Modulo Teories (SMT), una extensió de SAT que permet al resoledor, de manera modular, raonar sobre símbols no proposicionals pertanyents a teories de fons. Aquest marc és interessant perquè és prou expressiu per a poder traduir molts problemes provinents del món real. L’objectiu principal és millorar l’estat de l’art de la planificació automàtica mitjançant SMT, a través de la codificació dels problemes de planificació a SMT. El focus de la tesi és especialment en la planificació numèrica, on es combina la planificació clàssica amb l’habilitat de raonar sobre nombres enters o reals. En aquest context es poden codificar molts problemes reals amb restriccions sobre recursos. La nostra implementació de les codificacions ha donat fruit a un planificador anomenat Rantanplan, el qual preprocessa i tradueix problemes de planificació numèrics cap a fòrmules SMT, finalment resolent-los amb el resoledor SMT que l’usuari triï. També s’inclouen resultats detallats d’alguns dominis ben coneguts i alguns de nous, per a demostrar que el nostre enfocament és competitiu amb els planificadors numèrics exactes existents

Satisfiability modulo theories (SMT) is about determining the satisfiability of logical formulas over a range of one or more theories. SMT solvers are programs that are designed to determine the satisfiability of logical formulas and to find a satisfying model. Since the SMT problem is known to be NP-complete, the SMT initiative holds annual competitions to further advance and stimulate the techniques and tools used by the SMT community. To prevent unfair entries to the competition, a benchmark scrambler with a random seed is used to rename variables, randomly permutes arguments and hides benchmark names for each of the formulas. This paper is about researching the possibility of proving satisfiability of expressions that are semantically equal but not necessarily syntactical. The purpose of this project was to develop a computer program that is able to normalize benchmark scripts to a standard defined format such that by scrambling syntactically equal scripts would result in the same result when normalized. The implementation that was conceived is incomplete and inefficient for larger SMT scripts in terms of computational complexity due to time constraints however, the research of that was conceived during this thesis provides an interesting insight in the complexity of normalizing benchmark scripts and its relation to graph isomorphism.

This thesis is an evaluation of the 2015 SMT Competition (SMT-COMP), acompetition for Satisfiability Modulo Theories solvers. SMT-COMP has, since itsinception in 2005, been key for standardising and evaluating the state of SMT. Thethesis attempts to give a complementary view to the results of the competition withalternative measurements and viewpoints by examining the raw results of thecompetition. One of main focuses of the thesis was the impact of the benchmarks used in thecompetition. It is concluded that the majority of the benchmarks in the competitionare trivial. In under a second, some solver solved 95.7 % of the benchmarks andall solvers solved 67.2% of the benchmarks. These easy benchmarks impactsthe main results of the competition. Another noteworthy conclusion is that there isa statistically significant difference between the difficulty of solving the satisfiableand unsatisfiable benchmarks in the competition, with unsatisfiable being easier in general. The other main focus of the thesis was the performance of the solvers, where theconclusion is that that most participating solvers were better than all others onsome benchmarks, either speed-wise or by being the only one solving it. Two solvers stand out in particular, Yices2 for its excellency in speed and Z3 for itsbreadth. The thesis also concludes that for SMT-COMP 2015, parallelism has little to none impact on the results.

Metallothioneins are characterized as a group of small proteins with low molecular weight and high content of cysteinyl residues and their synthesis is induced by metal ions (e.g., Zn or Cd). The physicochemical properties of Zn-, Cd-, and Cu-containing MTs have been studied. However, copper metallothioneins (CuOMTs) have been examined less intensively, with only two MTs containing Cu(I) having been structurally characterized to date i.e., yeast MT and Neurospora crassa MT. The present study focuses on the stoichiometry and structural effects of binding of Cu(I) to the natively zinc binding MT (SmtA) from the cyanobacterium Synechococcus elongatus PCC7942. For this purpose, a Cu(I) titration study of Zn4SmtA was anaerobically performed utilizing the collective detection of ESIOMS, UV-Vis absorbance and 1H-15N NMR spectroscopy, and fully exchanged Cu(I)-SmtA was also generated from the apoOprotein. ESIOMS data confirmed the presence of predominantly monomeric Cu7SmtA. UV-vis titrations of Zn4SmtA showed that up to 7 Cu(I) displace Zn(II) from the protein, which was further studied in more detail by Cu(I) titrations of Zn4SmtA monitored with 1H-15N and 111Cd-15H NMR spectroscopy. The extensive NMR analysis showed the unfolding of protein on Cu(I) addition with absence of inertness towards Cu(I) exchange and that the protein undergoes significant conformational changes on Cu(I) addition. Preliminary characterization of MymT from Mycobacterium tuberculosis was also done and the composition of the metal cluster in the dominant Cu5MymT species was proposed and cooperativity was established by ESIOMS analyses, although structural characterisation was impeded by the highly dynamic nature of the protein.

In this thesis we focus on reformulate constraint satisfaction problems (CSP) into SAT Modulo Theories (SMT). SMT is an extension of SAT where the literals appearing in the formulas are not restricted to contain only propositional variables, instead they can have predicates from other theories, e.g., linear integer arithmetic. We present two systems developed to reformulate CSPs into SMT (fzn2smt and WSimply). The first one, reads instances written in FlatZinc and solved using an external SMT solver, and it has been extended to also solve optimization problems (COP) which are not supported by SMT solvers. The second one reads CSP, COP and weighted CSPs (WCSP) written in its own high level declarative language, which in addition to reformulate into SMT also reformulates into pseudo-Boolean and linear programming formats. We also present an incremental optimization algorithm based on using Binary Decision Diagrams (BDD) to solve WCSPs.
La tesi es centra en la reformulació de problemes de satisfacció de restriccions (CSP) a SAT Mòdul Teories (SMT). SMT és una extensió de SAT on els literals que apareixen a la fórmula no estan limitats a contenir només variables Booleanes, sinó que poden tenir-hi predicats d’altres teories, e.g., aritmètica lineal entera. Presenta dos sistemes desenvolupats per reformular CSPs a SMT (fzn2smt i WSimply). El primer llegeix instàncies CSPs escrites en FlatZinc que són resoltes mitjançant un resoledor SMT extern, i s’ha estès per resoldre problemes d'optimització (COP) que per defecte no són suportats pels resoledors SMT. El segon llegeix instàncies CSPs, COP i CSP amb pesos (WCSP) escrites en el seu propi llenguatge declaratiu d'alt nivell, que a més a més de reformular-les a SMT es poden reformular a format pseudo-Booleà i programació lineal. Presenta un algorisme d'optimització incremental basat en diagrames de decisió binaris per a resoldre WCSPs.

This thesis addresses the development of techniques to build fully-automatic tools for analyzing sequential programs written in imperative languages like C or C++. In order to do the reasoning about programs, the approach taken in this thesis follows the constraint-based method used in program analysis. The idea of the constraint-based method is to consider a template for candidate invariant properties, e.g., linear conjunctions of inequalities. These templates involve both program variables as well as parameters whose values are initially unknown and have to be determined so as to ensure invariance. To this end, the conditions on inductive invariants are expressed by means of constraints (hence the name of the approach) on the unknowns. Any solution to these constraints then yields an invariant. In particular, if linear inequalities are taken as target invariants, conditions can be transformed into arithmetic constraints over the unknowns by means of Farkas' Lemma. In the general case, a Satisfiability Modulo Theories (SMT) problem over non-linear arithmetic is obtained, for which effective SMT solvers exist. One of the novelties of this thesis is the presentation of an optimization version of the SMT problems generated by the constraint-based method in such a way that, even when they turn out to be unsatisfiable, some useful information can be obtained for refining the program analysis. In particular, we show in this work how our approach can be exploited for proving termination of sequential programs, disproving termination of non-deterministic programs, and do compositional safety verification. Besides, an extension of the constraint-based method to generate universally quantified array invariants is also presented. Since the development of practical methods is a priority in this thesis, all the techniques have been implemented and tested with examples coming from academic and industrial environments. The main contributions of this thesis are summarized as follows: 1. A new constraint-based method for the generation of universally quantified invariants of array programs. We also provide extensions of the approach for sorted arrays. 2. A novel Max-SMT-based technique for proving termination. Thanks to expressing the generation of a ranking function as a Max-SMT optimization problem where constraints are assigned different weights, quasi-ranking functions -functions that almost satisfy all conditions for ensuring well-foundedness- are produced in a lack of ranking functions. Moreover, Max-SMT makes it easy to combine the process of building the termination argument with the usually necessary task of generating supporting invariants. 3. A Max-SMT constraint-based approach for proving that programs do not terminate. The key notion of the approach is that of a quasi-invariant, which is a property such that if it holds at a location during execution once, then it continues to hold at that location from then onwards. Our technique considers for analysis strongly connected subgraphs of a program's control flow graph and thus produces more generic witnesses of non-termination than existing methods. Furthermore, it can handle programs with unbounded non-determinism. 4. An automated compositional program verification technique for safety properties based on quasi-invariants. For a given program part (e.g., a single loop) and a postcondition, we show how to, using a Max-SMT solver, an inductive invariant together with a precondition can be synthesized so that the precondition ensures the validity of the invariant and that the invariant implies the postcondition. From this, we build a bottom-up program verification framework that propagates preconditions of small program parts as postconditions for preceding program parts. The method recovers from failures to prove validity of a precondition, using the obtained intermediate results to restrict the search space for further proof attempts.
Esta tesis se centra en el desarrollo de técnicas para construir herramientas altamente automatizadas que analicen programas secuenciales escritos en lenguajes imperativos como C o C++. Para realizar el razonamiento sobre los programas, la aproximación tomada en esta tesis se basa en un conocido método basado en restricciones utilizado en análisis de progamas. La idea de dicho método consiste en considerar plantillas que expresen propiedades invariantes candidatas, p.e., conjunciones de desigualdades lineales. Estas plantillas contienen tanto variables del programa como parámetros cuyos valores son inicialmente desconocidos y tienen que ser determinados para garantizar la invariancia. Para este fin, las condiciones sobre invariantes inductivos son expresadas mediante restricciones sobre los valores desconocidos. Cualquier solución a estas restricciones llevan a un invariante. En particular, si desigualdades lineales son los invariantes objetivo, las condiciones pueden ser transformadas en restricciones aritméticas sobre los valores desconocidos mediante el lema de Farkas. En el caso general, un problema de Satisfactibilidad Modulo Teorías (SMT) sobre aritmética no-lineal es obtenido, para el cual existen resolvedores eficientes. Una de las novedades de esta tesis es la presentación de una versión de optimización de los problemas SMT generados por el método tal que, incluso cuando son insatisfactibles, se puede obtener cierta información útil para refinar el análisis del programa. En particular, en este trabajo se muestra como la aproximación tomada puede usarse para probar terminación de programas, probar la no terminación de programas y realizar verificación por partes de la corrección de programas. Además, también se describe una extensión del método basado en restricciones para generar invariantes universalmente cuantificados sobre arrays. Debido a que el desarrollo de métodos prácticos es una prioridad en esta tesis, todas las técnicas han sido implementadas y probadas con ejemplos extraídos del entorno académico e industrial. Las principales contribuciones de esta tesis pueden resumirse en: 1. Un nuevo método basado en restricciones para la generación de invariantes universalmente cuantificados sobre arrays. También se explica extensiones del método para aplicarlo a arrays ordenados. 2. Un técnica novedosa basada en Max-SMT para probar terminación. Gracias a expresar la generación de funciones de ranking como problemas de optimización Max-SMT, donde a las restricciones se les asigna diferentes pesos, se generan cuasi-funciones de ranking, funciones que casi satisfacen todas las condiciones que garantizan la existencia de una relación bien fundada, en ausencia de funciones de ranking. Además, Max-SMT facilita la combinación del proceso de construcción de un argumento de terminación con la tarea habitualmente necesaria de generar invariantes de apoyo. 3. Un método basado en restricciones y Max-SMT para probar que un programa no termina. El concepto clave del método es el de cuasi-invariante, que es una propiedad tal que si se cumple una vez en un punto del programa durante la ejecución, entonces continúa cumpliendose en ese punto desde entonces en adelante. Nuestra técnica considera en su análisis subgrafos fuertemente conexos del grafo de control de flujo del programa y produce testigos de no terminación más genéricos que otros métodos existentes. Además, es capaz de tratar programas con no determinismo. 4. Una técnica automatizada de verificación por partes de propiedades de corrección de un programa basada en cuasi-invariantes. Dado una parte de un programa (p.e., un único bucle) con una postcondición, se muestra como, usando Max-SMT, puede sintetizarse un invariante inductivo junto a una precondición que garantiza la validez del invariante y que el invariante implica la postcondición. Apartir de esto, se describe una infraestructura de verificación de programas de abajo a arriba que propaga precondiciones.

Thesis (Ph. D.) -- University of Maryland, College Park, 2006.
Thesis research directed by: Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

One way of solving complex satisfiability problems is by using the method of SMT(Satisfiability Modulo Theories). For satisfiability problems that are harder to solve than trivial ones, we could very well save ourselves a lot of time if we choose the most suitable solver immediately. These problems tend to take some time to solve, in accordance to their complexities, and different solvers specialise in different types of satisfiability problems. SMT is similar to the SAT modeling language but it is at a higher level, and allows further abstraction by including theories. In comparison to SAT problems, SMTproblems are more information-dense. In addition, SMT solvers often come with complementary performance profiles. In this paper we entertain the idea that we could indeed find a similarity between problems by collecting metadata from them. As a result of this, a feature extractor to count a manually defined set of features over SMT-LIB problems has been implemented. The idea is that if we have a problem, then these characteristics, if chosen carefully, could help us recognise problems with similar feature counts that has already been successfully solved within a portfolio solver system. The most successful solver for those problems may then be the most suitable solver for our problem as well, or at least we can use similar solving methods. Examples of these features are the number of uses of certain functions, or the total number of symbols.These test runs have in addition to collecting the metadata shown some variation between the benchmark groups whose results are presented and analysed grouped bylogics in the result section of this paper.

This thesis examines factors that influence a male, first-term enlisted reservist's decision to remain in the Selected Marine Corps Reserve (SMCR). Specifically, the logistic regression model was used to determine the relative impact of bio-demographic and both pecuniary and nonpecuniary job factors on retention. Models were developed for both nonprior (NPS) and prior active service (PS) reservists. The database was a combination of the responses of participants in the 1986 Reserve Components Surveys and their personnel records from the Reserve Components Common Personnel Data System. The thesis concludes with reserve policy implications and recommendations for further research. Important findings of this thesis were: Reserve income has a statistically significant and positive impact on SMCR retention. Civilian income was not found to be a factor. Educational benefits, civilian job-related training, and retirement benefits were found to be significant factors in retaining prior service reservists. Keywords: Marine corps personnel, Job training, Personnel retention, Theses

Biomassa är en växande energikälla i samhället. Biomassa så som sågspån behöver ofta torkas och pelleteras innan det kan användas som energikälla vid förbränning. Sågspån torkas innan pelleteringen för att kunna ge ett bra värmevärde och för att kunna förbrännas utan ökade halter av utsläpp. I takt med ökad användning av detta bränsle finns det en ökad efterfrågan på energieffektiva torkningsmetoder. På Karlstad Universitet har det därför byggts en pilotanläggning av en pneumatisk tork med syfte att fungera som ett steg i en energieffektiv torkningsmetod kallad ”Two Step Drying Technique” eller TSDT. Det här arbetet har handlat om att utvärdera effektivitetsmått och driftinformation för torken på Karlstads Universitet. Torken har fått namnet PD-KaU som står för ”Pneumatic Dryer at Karlstad University”. Genom praktiska mätningar av PD-KaU:s prestanda vid torkning av sågspån med uppvärmd luft har effektivitetsmåtten  och  beräknats vid olika driftfall. Även skillnader i torr- och våttemperaturer i olika delar av torken har utvärderats. En effektbalans har använts för att kontrollera mätningarnas stabilitet. De olika driftfallen fås genom variation av torkningsparametrar så som mängden sågspån som torkas, ca 1 och 2 kg torrsubstans per minut, och variation av luftens temperatur, 80, 100 och 120 °C, samt hastighet genom torken, 6, 8 och 10 m/s. Även 12 och 14 m/s testades vid 80 °C. Torkens minimala fluidiseringshastighet för sågspån har beräknats och minimala hastigheten som krävs för att sågspånet ska transporteras genom torkens rörsystem har mätts. Mätningar på sågspånets fukthalter före och efter torken tillsammans med massflöden sågspån genom torken har gjorts för alla driftfall. Använd effekt från överhettare och fläkt som finns i anslutning till torken har också mätts och dessa mätningar ligger till grund för beräkningarna av  och . Med hjälp av elektronisk mätning av torra temperaturer och tryckfall över systemet har också våttemperaturer i olika delar av systemet kunnat beräknas. All data från dessa mätningar har också använts till effektbalansen. Vid massflöden på ca 1 kg/min TS sågspån genom torken är  som högst om hastigheten på luften är låg. Högsta  för de driftfall som testats vid detta massflöde fås när lufttemperaturen är 120 °C och lufthastigheten är kring 8,6 m/s. Genom öka på rörsystemets längd i torken skulle ett högre  kunna uppnås vid högre hastigheter. Vid ett massflöde på ca 2 kg/min fås högsta  vid lufttemperaturen 100 °C och lufthastighet kring 8,3 m/s. Om höga massflöden sågspån används kommer sågspånet i större grad i kontakt med luften och  är högt oberoende av lufthastigheten i de intervall som testats. Optimala lufttemperaturen visade sig vara vid 100 °C.  är som lägst vid låga hastigheter och höga massflöden. Lägsta värdet på  för båda massflödena fås när lufttemperaturen var 120 °C och lufthastigheten 7,0 m/s. Genom att minska på rörsystemets längd skulle  kunna minska. Utvärderingen av våttemperaturen visar att det mesta av torkningen sker i början av systemet.
Biomass is a growing source of energy in our society. Biomass such as sawdust often needs to be dried and pelletized before it can be burnt to produce energy. Sawdust is dried before pelleting in order to give a good calorific heat value and to be able to be incinerated without increased levels of emissions. With increased use of this fuel there is an increasing demand for energy efficient drying methods. A pilot plant of a pneumatic dryer has therefore been built at Karlstad University with a purpose to serve as a step in an energy efficient drying method called “Two Step Drying Technique” or TSDT. This thesis aimed to evaluate performance and operating information for the dryer at Karlstad University. The dryer has been named PD-KaU which stands for "Pneumatic Dryer at Karlstad University." Through practical measurements of the PD-KaU's performance when drying sawdust with heated air, efficiency indices  and  has been calculated at various operating conditions. Differences in the dry and wet-bulb temperature in different parts of the dryer have also been evaluated. An energy balance, or more correctly a power balance has been used to evaluate the stability of the measurements. The various operating conditions is obtained by variation of different drying parameters such as the amount of sawdust dried, about 1 and 2 kg solids per minute, and the variation of air temperature, 80, 100 and 120 ° C, and the speed through the dryer, 6, 8 and 10 m/s. Also, 12 and 14 m/s were tested at 80 ° C. The minimum fluidizing velocity for the dryer when using sawdust has been calculated and the minimum speed required for the transportation of sawdust through the dryer tubes have been measured. Measurements on the sawdust moisture levels before and after the dryer along with the mass flow of sawdust through the dryer have been made for all operating conditions. The power from the super heater and fan that is used with the dryer has also been measured and these measurements together with the moisture levels and mass flows are used for calculating  and. By using electronic equipment measurements of dry temperatures and pressure drop across the system has also been possible and they have been used to calculate the wet-bulb temperature in different parts of the system. All data from these measurements were also used for the power balance. At mass flow rates of about 1 kg/min solids of sawdust through the dryer  is highest if the speed of the air is low. The highest value on  for the various operating conditions at this mass flow rate was found to be at an air temperature of 120 °C and air speed of 8,6 m/s. By increasing the length of tubing in the dryer, a higher  be achieved at higher speeds. If 2 kg/min of solids are put into the system the sawdust comes in contact with the air to a greater extent and  is highly independent of the air velocity in the ranges tested. At this higher mass flow rate the highest value of  was found to be at an air temperature of 100 °C and an air speed of 8,3 m/s Optimum air temperature was found to be at 100° C.  is lowest at low speeds and high mass flows. The lowest value for  for both tested mass flow rates was found to be when the air temperature was 120 °C and the air speed was 7,0 m/s. By reducing the tubing length SPC could be reduced. The evaluation of the wet-bulb temperature shows that most of the drying takes place in the beginning of the system.

Automated planning as a satisfiability problem is a method developed in theearly nineties. It has some known disadvantages, such as its inefficient encod-ing of numbers. The field of Satisfiability Modulo Teories tries to connectalready established solvers for e.g. linear constraints into SAT-solvers in orderto make reasoning about numerical values more efficient. This thesis combines planning as satisfiability and SMT to perform efficientreasoning about actions that occupy realistic time in Temporal Action Logic,a formalism developed at Linköping University for reasoning about action andchange.

Many problems in nature can be represented as some kind of a satisfiability problem. Several SAT solvers and SMT solvers have been developed in the last decade with the goal of checking the satisfiability of different SAT problems. An all-solution satisfiability modulo theories on top of the Z3 SMT solver is presented that uses the clause blocking algorithm to find all the solution sets of a SAT problem. Then, an incremental All-SMT solver has been presented based on the all-SMT solver which is able to find the satisfiable answers of an incremental SMT problem based on the solution set of the original problem.

Cette thèse doctorale présente ArchSAT, un théorème prouveur capable de générer des preuves formelles, qui est utilisé pour étudier l’intégration à l’algorithme SMT de techniques de raisonnements dits "du premier ordre". ArchSAT intègre la réecriture grâce à une théorie SMT standard,qui permet d’accélérer la vitesse du raisonnement sur les problèmes dont certains axiomes peu-vent être vus comme des règles de réécriture. De plus, une extension de cette théorie adaptée à l’algorithme McSAT (plutôt que SMT), permet aussi de gérer les règles de réécriture conditionnelles. ArchSAT intègres aussi la méthode des tableaux au travers d’une théorie SMT traditionnelle, afin de raisonner de manière générique sur tout le premier ordre, ce qui permet de remplacer la transformation en forme normal conjonctive et le mécanisme des triggers habituellement utilisés dans les prouveurs SMT. Cette théorie SMT pour la méthode des tableaux utilise par ailleurs une variante de la superposition afin d’unifier des termes modulo égalités et règles de réécriture.Finalement, ArchSAT est capable de générer des preuves formelles à la fois pour l’assistant de preuve Coq, et le framework logique dedukti, ce qui permet d’assurer la correction des résultats
This PhD thesis presents ArchSAT, an automated theorem prover with formal proof outputs, which is used to study the integration of some first-order reasoning methods into SMT solvers. ArchSAT integrates the notion of rewriting as a regular SMT theory, which allows us to speed up reasoning on problems whose axioms can be turned into rewrite rules. Additionally, an extension of the rewriting theory for the underlying McSAT architecture enables ArchSAT to consider conditional rewrite systems as well. ArchSAT also integrates a tableau method presented as a SMT theory able to handle generic first-order reasoning, replacing the conjunctive normal form transformation and trigger mechanism traditionally used in SMT solvers. This tableau theory uses a variant of superposition in order to perform unification modulo equalities and modulo rewrite rules. Finally, ArchSAT is able to generate formal proofs for the Coq proof assistant and the Dedukti logical framework, ensuring the correctness of its results

Nous décrivons l'environnement et la méthode Symsched dédiée à la conception conjointe dite AAA (adéquation algorithme architecture) prenant en compte les différents compromis performance énergie admissibles pour un système embarqué. Nous traduisons les descriptions des différents composants (exigences de l'application et capacités de l'architecture) en un système d'équations et inéquations composé de variables entières qui modélisent les aspects temporels et de variables booléennes qui modélisent les différentes alternatives de placement des tâches. Ce problème est ensuite soumis à un outil de résolution automatique de type SMT (SAT Modulo Theories). Notre objectif est d'étudier le passage à l'échelle de telles méthodes et donc le compromis entre le niveau de description et l'expressivité portant sur les différents aspects nécessaires à la modélisation. Nous appliquons ensuite cette technique à des problèmes d'ordonnancement abstraits, réalistes et réels
We describe the Symsched methodology and environment for AAA design (Application Architecture Adequation). It allows to evaluate the energy/performance balance for a given embedded system. We translate the different components of the problem (application requirements et architecture provisions) in a system of equations and inequations made of integer variables for the modeling of temporal aspects and boolean variables for the modeling of admissible task mapping and resource states. We then submit this problem to an automatic search engine SMT solver (SAT Modulo Theories). We study the scalability of this methodology and its compromises with models expressiveness. We then study synthetic, realistic and real scheduling problems using this approach

The recent multicore era and the incoming manycore/manythread era generate a lot of challenges for computer scientists going from productive parallel programming, over network congestion avoidance and intelligent power management, to circuit design issues. The ultimate goal is to squeeze out as much performance as possible while limiting power and energy consumption and guaranteeing a reliable execution. The increasing number of hardware contexts of current and future systems makes the scheduler an important component to achieve this goal, as there is often a combinatorial amount of different ways to schedule the distinct threads or applications, each with a different performance due to the inter-application interference. Picking an optimal schedule can result in substantial performance gains. This thesis deals with inter-application interference, covering the problems this fact causes on performance and fairness on actual machines. The study starts with single-threaded multicore processors (Intel Xeon X3320), follows with simultaneous multithreading (SMT) multicores supporting up to two threads per core (Intel Xeon E5645), and goes to the most highly threaded per-core processor that has ever been built (IBM POWER8). The dissertation analyzes the main contention points of each experimental platform and proposes scheduling algorithms that tackle the interference arising at each contention point to improve the system throughput and fairness. First we analyze contention through the memory hierarchy of current multicore processors. The performed studies reveal high performance degradation due to contention on main memory and any shared cache the processors implement. To mitigate such contention, we propose different bandwidth-aware scheduling algorithms with the key idea of balancing the memory accesses through the workload execution time and the cache requests among the different caches at each cache level. The high interference that different applications suffer when running simultaneously on the same SMT core, however, does not only affect performance, but can also compromise system fairness. In this dissertation, we also analyze fairness in current SMT multicores. To improve system fairness, we design progress-aware scheduling algorithms that estimate, at runtime, how the processes progress, which allows to improve system fairness by prioritizing the processes with lower accumulated progress. Finally, this dissertation tackles inter-application contention in the IBM POWER8 system with a symbiotic scheduler that addresses overall SMT interference. The symbiotic scheduler uses an SMT interference model, based on CPI stacks, that estimates the slowdown of any combination of applications if they are scheduled on the same SMT core. The number of possible schedules, however, grows too fast with the number of applications and makes unfeasible to explore all possible combinations. To overcome this issue, the symbiotic scheduler models the scheduling problem as a graph problem, which allows finding the optimal schedule in reasonable time. In summary, this thesis addresses contention in the shared resources of the memory hierarchy and SMT cores of multicore processors. We identify the main contention points of three systems with different architectures and propose scheduling algorithms to tackle contention at these points. The evaluation on the real systems shows the benefits of the proposed algorithms. The symbiotic scheduler improves system throughput by 6.7\% over Linux. Regarding fairness, the proposed progress-aware scheduler reduces Linux unfairness to a third. Besides, since the proposed algorithm are completely software-based, they could be incorporated as scheduling policies in Linux and used in small-scale servers to achieve the mentioned benefits.
La actual era multinúcleo y la futura era manycore/manythread generan grandes retos en el área de la computación incluyendo, entre otros, la programación paralela productiva o la gestión eficiente de la energía. El último objetivo es alcanzar las mayores prestaciones limitando el consumo energético y garantizando una ejecución confiable. El incremento del número de contextos hardware de los sistemas hace que el planificador se convierta en un componente importante para lograr este objetivo debido a que existen múltiples formas diferentes de planificar las aplicaciones, cada una con distintas prestaciones debido a las interferencias que se producen entre las aplicaciones. Seleccionar la planificación óptima puede proporcionar importantes mejoras de prestaciones. Esta tesis se ocupa de las interferencias entre aplicaciones, cubriendo los problemas que causan en las prestaciones y equidad de los sistemas actuales. El estudio empieza con procesadores multinúcleo monohilo (Intel Xeon X3320), sigue con multinúcleos con soporte para la ejecución simultanea (SMT) de dos hilos (Intel Xeon E5645), y llega al procesador que actualmente soporta un mayor número de hilos por núcleo (IBM POWER8). La disertación analiza los principales puntos de contención en cada plataforma y propone algoritmos de planificación que mitigan las interferencias que se generan en cada uno de ellos para mejorar la productividad y equidad de los sistemas. En primer lugar, analizamos la contención a lo largo de la jerarquía de memoria. Los estudios realizados revelan la alta degradación de prestaciones provocada por la contención en memoria principal y en cualquier cache compartida. Para mitigar esta contención, proponemos diversos algoritmos de planificación cuya idea principal es distribuir los accesos a memoria a lo largo del tiempo de ejecución de la carga y las peticiones a las caches entre las diferentes caches compartidas en cada nivel. Las altas interferencias que sufren las aplicaciones que se ejecutan simultáneamente en un núcleo SMT, sin embargo, no solo afectan a las prestaciones, sino que también pueden comprometer la equidad del sistema. En esta tesis, también abordamos la equidad en los actuales multinúcleos SMT. Para mejorarla, diseñamos algoritmos de planificación que estiman el progreso de las aplicaciones en tiempo de ejecución, lo que permite priorizar los procesos con menor progreso acumulado para reducir la inequidad. Finalmente, la tesis se centra en la contención entre aplicaciones en el sistema IBM POWER8 con un planificador simbiótico que aborda la contención en todo el núcleo SMT. El planificador simbiótico utiliza un modelo de interferencia basado en pilas de CPI que predice las prestaciones para la ejecución de cualquier combinación de aplicaciones en un núcleo SMT. El número de posibles planificaciones, no obstante, crece muy rápido y hace inviable explorar todas las posibles combinaciones. Por ello, el problema de planificación se modela como un problema de teoría de grafos, lo que permite obtener la planificación óptima en un tiempo razonable. En resumen, esta tesis aborda la contención en los recursos compartidos en la jerarquía de memoria y el núcleo SMT de los procesadores multinúcleo. Identificamos los principales puntos de contención de tres sistemas con diferentes arquitecturas y proponemos algoritmos de planificación para mitigar esta contención. La evaluación en sistemas reales muestra las mejoras proporcionados por los algoritmos propuestos. Así, el planificador simbiótico mejora la productividad, en promedio, un 6.7% con respecto a Linux. En cuanto a la equidad, el planificador que considera el progreso consigue reducir la inequidad de Linux a una tercera parte. Además, dado que los algoritmos propuestos son completamente software, podrían incorporarse como políticas de planificación en Linux y usarse en servidores a pequeña escala para obtener los benefi
L'actual era multinucli i la futura era manycore/manythread generen grans reptes en l'àrea de la computació incloent, entre d'altres, la programació paral·lela productiva o la gestió eficient de l'energia. L'últim objectiu és assolir les majors prestacions limitant el consum energètic i garantint una execució confiable. L'increment del número de contextos hardware dels sistemes fa que el planificador es convertisca en un component important per assolir aquest objectiu donat que existeixen múltiples formes distintes de planificar les aplicacions, cadascuna amb unes prestacions diferents degut a les interferències que es produeixen entre les aplicacions. Seleccionar la planificació òptima pot donar lloc a millores importants de les prestacions. Aquesta tesi s'ocupa de les interferències entre aplicacions, cobrint els problemes que provoquen en les prestacions i l'equitat dels sistemes actuals. L'estudi comença amb processadors multinucli monofil (Intel Xeon X3320), segueix amb multinuclis amb suport per a l'execució simultània (SMT) de dos fils (Intel Xeon E5645), i arriba al processador que actualment suporta un major nombre de fils per nucli (IBM POWER8). Aquesta dissertació analitza els principals punts de contenció en cada plataforma i proposa algoritmes de planificació que aborden les interferències que es generen en cadascun d'ells per a millorar la productivitat i l'equitat dels sistemes. En primer lloc, estudiem la contenció al llarg de la jerarquia de memòria en els processadors multinucli. Els estudis realitzats revelen l'alta degradació de prestacions provocada per la contenció en memòria principal i en qualsevol cache compartida. Per a mitigar la contenció, proposem diversos algoritmes de planificació amb la idea principal de distribuir els accessos a memòria al llarg del temps d'execució de la càrrega i les peticions a les caches entre les diferents caches compartides en cada nivell. Les altes interferències que sofreixen las aplicacions que s'executen simultàniament en un nucli SMT, no obstant, no sols afecten a las prestacions, sinó que també poden comprometre l'equitat del sistema. En aquesta tesi, també abordem l'equitat en els actuals multinuclis SMT. Per a millorar-la, dissenyem algoritmes de planificació que estimen el progrés de les aplicacions en temps d'execució, el que permet prioritzar els processos amb menor progrés acumulat para a reduir la inequitat. Finalment, la tesi es centra en la contenció entre aplicacions en el sistema IBM POWER8 amb un planificador simbiòtic que aborda la contenció en tot el nucli SMT. El planificador simbiòtic utilitza un model d'interferència basat en piles de CPI que prediu les prestacions per a l'execució de qualsevol combinació d'aplicacions en un nucli SMT. El nombre de possibles planificacions, no obstant, creix molt ràpid i fa inviable explorar totes les possibles combinacions. Per resoldre aquest contratemps, el problema de planificació es modela com un problema de teoria de grafs, la qual cosa permet obtenir la planificació òptima en un temps raonable. En resum, aquesta tesi aborda la contenció en els recursos compartits en la jerarquia de memòria i el nucli SMT dels processadors multinucli. Identifiquem els principals punts de contenció de tres sistemes amb diferents arquitectures i proposem algoritmes de planificació per a mitigar aquesta contenció. L'avaluació en sistemes reals mostra les millores proporcionades pels algoritmes proposats. Així, el planificador simbiòtic millora la productivitat una mitjana del 6.7% respecte a Linux. Pel que fa a l'equitat, el planificador que considera el progrés aconsegueix reduir la inequitat de Linux a una tercera part. A més, donat que els algoritmes proposats son completament software, podrien incorporar-se com a polítiques de planificació en Linux i emprar-se en servidors a petita escala per obtenir els avantatges mencionats.
Feliu Pérez, J. (2017). Contention-Aware Scheduling for SMT Multicore Processors [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/79081
TESIS
Premiado

Production planning is an important part for basic management in manufacturing industries and an effective tool to optimize production and to maintain profit despite increased competition. Costs for raw materials, energy consumption and maintenance of the production line often amounts to large sums. Production planning is a good tool to minimize these costs, but also to achieve the objectives of the production process.There is little conducted and published studies on the use of planning techniques in manufacturing industries. Therefore, the authors chose to focus on this part for the paper. The purpose of the study is to compare the methods of production with regard to different production situations and to develop an analytical model for the choice of production. Subsequently, the aim has been broken down into three theoretical research issues and one practical issue. The practical question is whether it is possible to develop a practical model of the production flow of Sandvik (SMT) Drill steel production to streamline production flow?To answer the purpose of the study and research questions, a literature review is conducted as well as observation and interviews at Sandvik SMT Drill steel. Based on the literature review, a number of methods have been developed which are considered to be good for production, as well as a number of important factors, and finally, a model has been created to SMTS production section “Appretering”.The conclusion of the study is that the choice of planning method is dependent on the production environment as lead time, demand, product mix and lot size. It is also advisable to follow a certain structure in the choice of planning method.
Produktionsplaneringen är en viktig del i tillverkande industrier och är ett bra hjälpmedel för att effektivisera produktionen och bevara lönsamhet trots ökad konkurrens. Kostnader för råmaterial, energiförbrukning och underhåll i produktionslinan uppgår ofta till stora summor. Produktionsplanering är ett bra verktyg för att minimera dessa kostnader men även för att uppnå målen med produktionsprocessen. I dagsläget finns det få genomförda och publicerade undersökningar om användning av planeringsmetoder i tillverkande industrier. Därför valde författarna att fokusera på denna del i studien. Syftet med studien är att jämföra metoder för produktionsplanering med avseende på olika produktionssituationer samt att utforma en analysmodell för effektivisering av produktionsplanering. Därefter har syftet brutits ner i tre teoretiska forskningsfrågor samt en praktisk frågeställning. Den praktiska frågeställningen är om det är möjligt att utveckla ett stöd för produktionsplanering hos Sandvik (SMT) produktionsenhet Borrstål som effektiviserar produktionsflödet? För att besvara studiens syfte och forskningsfrågor har en litteraturstudie genomförts samt ostrukturerade observationer och intervjuer vid Sandvik SMT Borrstål. Utifrån litteraturstudien har ett antal metoder tagits fram som anses vara bra för produktionsplanering samt en del viktiga faktorer och slutligen har ett planeringsstöd skapats till SMTs produktionsavsnitt Appretering. Slutsatsen av studien är att val av planeringsmetod är beroende av produktionsmiljön som ledtid, efterfrågan, produktmix och partistorlek. Det är också lämpligt att följa en viss struktur vid val av planeringsmetod.

The topic of this thesis is a relation between two constitutive aspects of out existence: death and intersubjectivity. The way how to research these issues is an interpretation of main concepts and notions contained in these texts. On the basis of the comparison of these concepts, notions and whole philosophical stands offers this thesis a perspective of comprehension to the topic of death and intersubjectivity.

Sudden death in sport is a tragic event mediated primarily through the media. This thesis deals with sudden cardiac death from non-traumatic causes. The first section provides the overview of the issue, I mentioned specific cases of sudden death and the most common cause of sudden cardiac death among young and old athletes. The thesis focuses on the possibilities of preventive measures. In the second part, as part of my research, preparedness of Czech stadiums is evaluated situations of sudden cardiac death. In the conclusion section, I present the results of a questionnaire survey among representatives of clubs and stadiums and change proposals. The aim of the research is to find out how hockey and football stadiums are prepared for unpredictable situations of sudden cardiac death of athletes. Keywords: Sudden death, sport, sports stadiums, circulation disorder, hypertrophic cardiomyopathy, AED, resuscitation, EKG, prevention

The Puritan attitude toward death in seventeenth- and early eighteenth-century New England was ambivalent and contained both terror at the possibility of eternal damnation and hope for deliverance. The joyful theme of the migratio ad Dominum resonated with the Saints only at times when they were convinced divine grace was actively working in their lives, but when they saw they were backsliding, the horror of death prevailed. Puritan anxiety about death was caused by tensions inherent in the doctrine of predestination, which implied man's dependence on God's inscrutability, and in the doctrine of assurance, which implied that self-doubt was more desirable than full assurance of salvation. What complicated any verification of the presence of grace was man's endless potential for self-deception. Memento mori gave urgency to the Puritan work ethic and the effective use of time. The anxiety about one's destiny began in early childhood when death and its ensuing horrors for the depraved were used as a means of religious instruction to provoke spiritual precocity and conversion. This early immersion into the discourse about death has been erroneously interpreted as a proof of the non-existence of childhood in Puritan New England. Deathbed scenes depicted in Puritan spiritual biographies were designed as examples...

Název: Člověk, duše a smrt The human, the psyche and the death Cíle práce: Cílem diplomové práce bylo předložit ucelený pohled na problematiku osobnosti člověka, smrti a s ní souvisejících témat. Snahou bylo předložit názory jednotlivých filozofů, odborníků a náboženství na člověka jako jedinečnou bytost. Práce se zaměřuje především na období stáří, které se nejvíce dotýká problematiky smrti. Druhým cílem této práce je porovnat vnímání vlastního stáří u seniorů, kteří již nejsou schopni samostatného života bez pomoci ostatních, lidí, kteří žijí společně v domově, který jim nabízí možnost aktivního života, vnímání stáří také jako pozitivní části života a možnost rozvoje v každém věku i v nemoci. Součástí této práce je také názor na život, stáří a smrt velké herecké osobnosti, paní Květy Fialové, která je nádherným příkladem člověka, který přijímá kterýkoli věk jako dar a obohacení a snaží se v něm nalézt krásu a radost. Metoda: Průzkum byl proveden ve 3 domovech důchodců v Praze v celkovém objemu 102 dotázaných respondentů. Průzkum byl proveden konkrétně v těchto zařízeních: Domov důchodců Praha 1O, Sněženková 8/2973, Zahradní město Domov důchodců Praha 10, Rektorská 577, Malešice Domov důchodců Praha 4, Donovalská 2222, Chodov Výběr těchto zařízení byl proveden podle počtu klientů v jednotlivých...

Název práce: Smrt jako fenomén života Death as a Phenomenon of Live Cíl práce: Tato práce popisuje smrt jako přirozenou součást života, její podoby a naši schopnost či neschopnost smrt přijmout a pochopit nebo se s ní smířit. Prostřednictvím zážitkft lidí, kteří smrt intenzivně prožívají v dftsledku ztráty nebo vidiny ztráty blízkého člověka, zkoumám a zachycuji pocity, které smrt vyvolává. Formou studia faktO a především výzkumem mezi lidmi mapuji povědomí lidí rOzných věkových skupin o smrti, vlastní smrtelnosti a souvisejících rituálech. Metody: Hlavním nástrojem získávání informací byli řízené rozhovory s lidmi, které jsem si vytipovala a rozdělila podle věku do pěti skupin. Na rozdílech v odpovědích chci ukázat vývoj představ smrti v jednotlivých fázích života. Výsledky: Předkládám práci, v jejíž piVní části pomocí sugestivních příběhO lidí, se kterými jsem se setkala, popisuji podoby smrti a zpOsoby, jakými se ztrátou bojují pozOstalí. V druhé části pak odpověďmi na dotazy pokládané formou ankety specifikuji chápání smrti a věcí souvisejících pěti rOznými věkovými kategoriemi, přičemž každou ze zmíněných oblastí i teoreticky popisuji. Klíčová slova: umírání, smrt, smrtelnost, paliativní péče, hospic, eutanázie, nehoda, ztráta, emoce, smíření, rituál 5

This work deals with the phenomenon of the death of God and with possible approaches how this issue was treated at ancient communities, in Judaism, Christianity and philosophy. Result of the work doesn't tell if God is dead or not, just gives brief description of this phenomenon in the history and context. The work aims to provide entrance to the problematic, to give inputs to think and let the reader to feel the problem, which is current just for the period of postCmodernism. This work enables reader to take a certain point of view about the matter. Powered by TCPDF (www.tcpdf.org)

Thesis deals with death and dying on intensive care wards from the perspective of nurses. In the theoretical part are concepts such as death, dying, Thanatology etc. explained. The work also highlights the status of nurses in palliative care. In the last chapter of the theoretical part is briefly described the type of workplace of ICU, care of patient in this ward and patients needs . Empirical part of this work is focused on finding out problems and feelings eventually knowledge of nurses working on the ICU for the care of dying and dead. To obtain data for research part was chosen quantitative research, data collection techniques structured questionnaire. There were chosen 4 goals of this thesis. Objective 1: Identify the most common feelings of nurses working on the ICU during the care of dying and death. The second goal: Identify what is most frustrating for nurses during the care of dying and death on the ICU. The goal 3: Investigate hierarchy of dying patients needs from the perspective of nurses working on the ICU. Goal 4: Identify interest of nurses working on the ICU in further education in the sphere of care of the dying and the provision of palliative care at the ICU.

Námět smrti může někomu připadat morbidní a zbytečné, rozebírat smrt ze všech možných úhlů a do detailů, ale těžko může popřít, že právě smrt a umírání je jedním ze stěžejních témat lidského života. Vždyť právě vědomí smrtelnosti a schopnost nahlížet na vlastní pomíjivost je jednou z charakteristik lidské bytosti. Neodvratnost konce dělá člověka tím, čím je - křehkým a zranitelným stvořením, které však dokáže žít a tvořit navzdory svým omezením. Při kompilaci textu předkládané práce jsme se potýkali především s koncepčními problémy a se souvisejícími problémy metodologickými, neboť téma smrti je v odborné literatuře nahlíženo spíše partikulárně, z pohledu jednotlivých vědních oborů. Podíváme-li se na literaturu o smrti, převažují spíše umělecká zpracování v krásné literatuře než vědecké práce. Možná je to tím, že smrt je téma spíše emotivní, prožívané, než promýšlené. Snad jen umění dokáže postihnout její mnohoznačnost a tajemství, které není racionálně přístupné. My se přesto pokusíme postihnout smrt nejen jako psychologický, nebo metafyzický fenomén, ale především jako fenomén kulturní a společenský. A proč antická řecká kultura? Evropská (potažmo euroamerická) kultura stojí na základech, které vybudovaly staří Řekové. Starověkému Řecku je tradičně připisováno "racionální" pojetí člověka se všemi...

The topic of this thesis is virtual death in video games. In theoretical part, the concept of avatar (player's agent in the game world) is defined, concerning the relationship between player and avatar as well as the main characteristics of the avatar. The aim of the theoretical core of this thesis is to introduce virtual death; because of various expressions of death in many games, it is difficult to describe virtual death generally. Virtual death, which is compared also to the real death, is revealed as a communication of player's failure. What can not be separated from virtual death is the instant resurrection of the avatar, and also the means how to avoid virtual death. The practical part of the thesis offers a close reading of the computer role-playing game Planescape: Torment, focusing on the theme of death. Unlike most mainstream games, Torment presents the player with sophisticated perspectives on the matters of life, death, immortality and responsibility. Even the high-order goal of the main character (which becomes the goal of the player as well) is to gain knowledge about himself and then willingly die. This stands in a sharp contrast to usual narratives, forcing the player to suppress the life-saving reflex and let his avatar die in the end. The comparative method is used to identify...

MA thesis Danube: Journey, Memory, City and Death is, to a certain extent, a personal search for today's meaning of the river Danube in literature and culture. Practically, it contains texts from the antiquity until today, not chronologically, but in motivic spirals of journey, memory, city and death. It is geographically linked especially to German-Austrian, Slovak and Hungarian space. The chapters are buoy-like, because together they form the characteristics of Danubian culture, which are border, appropriation, palimpsest quality, and pleasure seeking. The chapter about journey deals predominantly with searching for Danube's identity and the character of traveler. The chapter about memory analyses chosen places of memory and certain historical figures. The third chapter, dedicated to Danubian metropoli (Vienna, Bratislava and Budapest), searches for common traits of their soul, which are realized through the concepts of border, pleasure and bridge. The last chapter about death in Danube deals with both images of death and river beings - fairies and nymphs. The whole text represents certain literary-cultural anthropology of Danube.