Dissertations / Theses on the topic 'FASTM'

Según expertos, se ha analizado que en la última década la gente injiere alimentos poco saludables por el estilo de vida y el tiempo reducido que tienen para llevar, comer o disfrutar de productos nutritivos como lo es un jugo de frutas. Sin embargo existe la tendencia hacia el consumo saludable en el Perú en los últimos años. La empresa Fast Juice, se encarga de brindar jugos naturales que conservan el valor nutricional de la fruta, todo esto a través de las máquinas expendedoras que permiten la venta de manera rápida, sencilla e innovadora. El negocio ubicará una máquina expendedora en las principales universidades privadas de Lima, como son: Universidad de Lima, UPC, ESAN, Ricardo Palma, Pacifico y PUCP. Estas universidades han sido elegidas a través de un estudio de mercado y cuentan con consumidores del segmento A y B. La inversión inicial es 67,658.74 soles para la creación del negocio, de los cuales, el 70% o 47,361.12 soles serán proporcionados por el prestamista, y el 30% o 20,297.62 soles será aporte de los emprendedores. Se proyecta un crecimiento en ventas del 2% anual. Finalmente después de un análisis financiero se concluye que el proyecto es rentable con una VAN de 25 384.93 soles y un TIR del 48.72%.<br>According to experts, it has been analyzed that in the last decade people ingest unhealthy foods because of the lifestyle and the reduced time they have to carry, eat or enjoy nutritious products such as fruit juice. Nevertheless, there is a trend towards healthy consumption in Peru in the recent years. The company Fast Juice is responsible for providing natural juices that preserve the nutritional value of the fruit, all this through vending machines that allow the sale quickly, easily and innovatively. The business will locate a vending machine in the main private universities of Lima, such as: University of Lima, UPC, ESAN, Ricardo Palma, Pacífico and PUCP. These universities have been chosen through a market study and have consumers of segments A and B. The initial investment is 67,658.74 soles for creating business, of which 70% or 47361.12 soles be provided by the lender, and 30% or 20297.62 soles be input by entrepreneurs. A 2% annual sales growth is projected. Finally, after a financial analysis, it is concluded that the project is profitable with an NPV of 25,384.93 soles and an IRR of 48.72%.<br>Trabajo de investigación

This thesis concerns the implementation of an pre-analysis tool in orienteering for the problem of finding the optimal route choice on a leg in orienteering. The problem is modelled by the framework of level sets and an anisotropic travel time equation is proposed. The analysis tool designed in this thesis is based on solving an anisotropic travel time equation, based on a digital elevation model and symbols imported from an orienteering map, using the fast sweeping method.<br>Exjobbet som presenteras implementerar et analysverktyg för att hitta det optimala vägvalet på en sträcka mellan två kontroller i orientering. Problemet med att hitta det optimala vägvalet modelleras av Level-Set metoder och ett förslag till en anisotropisk resetidsekvation presenteras. Analysverktyget som är konstruerat i detta exjobb löser en anisotropisk resetidsekvation, som baserar sig på en digital höjdmodell och symboler som är importerat ifrån en orienteringskarta, med hjälp av fast sweeping method.

[EN] The work done for this doctorate thesis focuses on error correction of Next Generation Sequencing (NGS) data in the context of High Performance Computing (HPC). Due to the reduction in sequencing cost, the increasing output of the sequencers and the advancements in the biological and medical sciences, the amount of NGS data has increased tremendously. Humans alone are not able to keep pace with this explosion of information, therefore computers must assist them to ease the handle of the deluge of information generated by the sequencing machines. Since NGS is no longer just a research topic (used in clinical routine to detect cancer mutations, for instance), requirements in performance and accuracy are more stringent. For sequencing to be useful outside research, the analysis software must work accurately and fast. This is where HPC comes into play. NGS processing tools should leverage the full potential of multi-core and even distributed computing, as those platforms are extensively available. Moreover, as the performance of the individual core has hit a barrier, current computing tendencies focus on adding more cores and explicitly split the computation to take advantage of them. This thesis starts with a deep analysis of all these problems in a general and comprehensive way (to reach out to a very wide audience), in the form of an exhaustive and objective review of the NGS error correction field. We dedicate a chapter to this topic to introduce the reader gradually and gently into the world of sequencing. It presents real problems and applications of NGS that demonstrate the impact this technology has on science. The review results in the following conclusions: the need of understanding of the specificities of NGS data samples (given the high variety of technologies and features) and the need of flexible, efficient and accurate tools for error correction as a preliminary step of any NGS postprocessing. As a result of the explosion of NGS data, we introduce MuffinInfo. It is a piece of software capable of extracting information from the raw data produced by the sequencer to help the user understand the data. MuffinInfo uses HTML5, therefore it runs in almost any software and hardware environment. It supports custom statistics to mould itself to specific requirements. MuffinInfo can reload the results of a run which are stored in JSON format for easier integration with third party applications. Finally, our application uses threads to perform the calculations, to load the data from the disk and to handle the UI. In continuation to our research and as a result of the single core performance limitation, we leverage the power of multi-core computers to develop a new error correction tool. The error correction of the NGS data is normally the first step of any analysis targeting NGS. As we conclude from the review performed within the frame of this thesis, many projects in different real-life applications have opted for this step before further analysis. In this sense, we propose MuffinEC, a multi-technology (Illumina, Roche 454, Ion Torrent and PacBio -experimental), any-type-of-error handling (mismatches, deletions insertions and unknown values) corrector. It surpasses other similar software by providing higher accuracy (demonstrated by three type of tests) and using less computational resources. It follows a multi-steps approach that starts by grouping all the reads using a k-mers based metric. Next, it employs the powerful Smith-Waterman algorithm to refine the groups and generate Multiple Sequence Alignments (MSAs). These MSAs are corrected by taking each column and looking for the correct base, determined by a user-adjustable percentage. This manuscript is structured in chapters based on material that has been previously published in prestigious journals indexed by the Journal of Citation Reports (on outstanding positions) and relevant congresses.<br>[ES] El trabajo realizado en el marco de esta tesis doctoral se centra en la corrección de errores en datos provenientes de técnicas NGS utilizando técnicas de computación intensiva. Debido a la reducción de costes y el incremento en las prestaciones de los secuenciadores, la cantidad de datos disponibles en NGS se ha incrementado notablemente. La utilización de computadores en el análisis de estas muestras se hace imprescindible para poder dar respuesta a la avalancha de información generada por estas técnicas. El uso de NGS transciende la investigación con numerosos ejemplos de uso clínico y agronómico, por lo que aparecen nuevas necesidades en cuanto al tiempo de proceso y la fiabilidad de los resultados. Para maximizar su aplicabilidad clínica, las técnicas de proceso de datos de NGS deben acelerarse y producir datos más precisos. En este contexto es en el que las técnicas de comptuación intensiva juegan un papel relevante. En la actualidad, es común disponer de computadores con varios núcleos de proceso e incluso utilizar múltiples computadores mediante técnicas de computación paralela distribuida. Las tendencias actuales hacia arquitecturas con un mayor número de núcleos ponen de manifiesto que es ésta una aproximación relevante. Esta tesis comienza con un análisis de los problemas fundamentales del proceso de datos en NGS de forma general y adaptado para su comprensión por una amplia audiencia, a través de una exhaustiva revisión del estado del arte en la corrección de datos de NGS. Esta revisión introduce gradualmente al lector en las técnicas de secuenciación masiva, presentando problemas y aplicaciones reales de las técnicas de NGS, destacando el impacto de esta tecnología en ciencia. De este estudio se concluyen dos ideas principales: La necesidad de analizar de forma adecuada las características de los datos de NGS, atendiendo a la enorme variedad intrínseca que tienen las diferentes técnicas de NGS; y la necesidad de disponer de una herramienta versátil, eficiente y precisa para la corrección de errores. En el contexto del análisis de datos, la tesis presenta MuffinInfo. La herramienta MuffinInfo es una aplicación software implementada mediante HTML5. MuffinInfo obtiene información relevante de datos crudos de NGS para favorecer el entendimiento de sus características y la aplicación de técnicas de corrección de errores, soportando además la extensión mediante funciones que implementen estadísticos definidos por el usuario. MuffinInfo almacena los resultados del proceso en ficheros JSON. Al usar HTML5, MuffinInfo puede funcionar en casi cualquier entorno hardware y software. La herramienta está implementada aprovechando múltiples hilos de ejecución por la gestión del interfaz. La segunda conclusión del análisis del estado del arte nos lleva a la oportunidad de aplicar de forma extensiva técnicas de computación de altas prestaciones en la corrección de errores para desarrollar una herramienta que soporte múltiples tecnologías (Illumina, Roche 454, Ion Torrent y experimentalmente PacBio). La herramienta propuesta (MuffinEC), soporta diferentes tipos de errores (sustituciones, indels y valores desconocidos). MuffinEC supera los resultados obtenidos por las herramientas existentes en este ámbito. Ofrece una mejor tasa de corrección, en un tiempo muy inferior y utilizando menos recursos, lo que facilita además su aplicación en muestras de mayor tamaño en computadores convencionales. MuffinEC utiliza una aproximación basada en etapas multiples. Primero agrupa todas las secuencias utilizando la métrica de los k-mers. En segundo lugar realiza un refinamiento de los grupos mediante el alineamiento con Smith-Waterman, generando contigs. Estos contigs resultan de la corrección por columnas de atendiendo a la frecuencia individual de cada base. La tesis se estructura por capítulos cuya base ha sido previamente publicada en revistas indexadas en posiciones dest<br>[CAT] El treball realitzat en el marc d'aquesta tesi doctoral se centra en la correcció d'errors en dades provinents de tècniques de NGS utilitzant tècniques de computació intensiva. A causa de la reducció de costos i l'increment en les prestacions dels seqüenciadors, la quantitat de dades disponibles a NGS s'ha incrementat notablement. La utilització de computadors en l'anàlisi d'aquestes mostres es fa imprescindible per poder donar resposta a l'allau d'informació generada per aquestes tècniques. L'ús de NGS transcendeix la investigació amb nombrosos exemples d'ús clínic i agronòmic, per la qual cosa apareixen noves necessitats quant al temps de procés i la fiabilitat dels resultats. Per a maximitzar la seua aplicabilitat clínica, les tècniques de procés de dades de NGS han d'accelerar-se i produir dades més precises. En este context és en el que les tècniques de comptuación intensiva juguen un paper rellevant. En l'actualitat, és comú disposar de computadors amb diversos nuclis de procés i inclús utilitzar múltiples computadors per mitjà de tècniques de computació paral·lela distribuïda. Les tendències actuals cap a arquitectures amb un nombre més gran de nuclis posen de manifest que és esta una aproximació rellevant. Aquesta tesi comença amb una anàlisi dels problemes fonamentals del procés de dades en NGS de forma general i adaptat per a la seua comprensió per una àmplia audiència, a través d'una exhaustiva revisió de l'estat de l'art en la correcció de dades de NGS. Esta revisió introduïx gradualment al lector en les tècniques de seqüenciació massiva, presentant problemes i aplicacions reals de les tècniques de NGS, destacant l'impacte d'esta tecnologia en ciència. D'este estudi es conclouen dos idees principals: La necessitat d'analitzar de forma adequada les característiques de les dades de NGS, atenent a l'enorme varietat intrínseca que tenen les diferents tècniques de NGS; i la necessitat de disposar d'una ferramenta versàtil, eficient i precisa per a la correcció d'errors. En el context de l'anàlisi de dades, la tesi presenta MuffinInfo. La ferramenta MuffinInfo és una aplicació programari implementada per mitjà de HTML5. MuffinInfo obté informació rellevant de dades crues de NGS per a afavorir l'enteniment de les seues característiques i l'aplicació de tècniques de correcció d'errors, suportant a més l'extensió per mitjà de funcions que implementen estadístics definits per l'usuari. MuffinInfo emmagatzema els resultats del procés en fitxers JSON. A l'usar HTML5, MuffinInfo pot funcionar en gairebé qualsevol entorn maquinari i programari. La ferramenta està implementada aprofitant múltiples fils d'execució per la gestió de l'interfície. La segona conclusió de l'anàlisi de l'estat de l'art ens porta a l'oportunitat d'aplicar de forma extensiva tècniques de computació d'altes prestacions en la correcció d'errors per a desenrotllar una ferramenta que suport múltiples tecnologies (Illumina, Roche 454, Ió Torrent i experimentalment PacBio). La ferramenta proposada (MuffinEC), suporta diferents tipus d'errors (substitucions, indels i valors desconeguts). MuffinEC supera els resultats obtinguts per les ferramentes existents en este àmbit. Oferix una millor taxa de correcció, en un temps molt inferior i utilitzant menys recursos, la qual cosa facilita a més la seua aplicació en mostres més gran en computadors convencionals. MuffinEC utilitza una aproximació basada en etapes multiples. Primer agrupa totes les seqüències utilitzant la mètrica dels k-mers. En segon lloc realitza un refinament dels grups per mitjà de l'alineament amb Smith-Waterman, generant contigs. Estos contigs resulten de la correcció per columnes d'atenent a la freqüència individual de cada base. La tesi s'estructura per capítols la base de la qual ha sigut prèviament publicada en revistes indexades en posicions destacades de l'índex del Journal of Citation Repor<br>Alic, AS. (2016). Improved Error Correction of NGS Data [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/67630<br>TESIS

This thesis presents research that has addressed various design issues related to an adapted orthogonal frequency division multiplexing scheme, namely Fast-OFDM. A comparative study of the system with conventional OFDM in various signal mapping conditions has been investigated. The thesis reports on performance assessment in terms of bit-error-rate (BER) performance, spectral efficiency, peak-to-average-power ratio (PAPR), nonlinear effects and adjacent channel interference (ACI) analysis. The results show that the performance of Fast-OFDM is comparable to OFDM for single dimensional modulation scheme, whereas for complex modulation schemes, the performance of Fast-OFDM degrades severely due to the loss of orthogonality between subcarriers. Two multi-carrier CDMA schemes, multi-carrier direct sequence CDMA (MC DS-CDMA) and multi-tone CDMA (MT-CDMA), have been studied in different modulation scenarios. The performance of the overlapping multi-carrier CDMA schemes compared to OFDM and Fast-OFDM has been evaluated in terms of BER, spectral efficiency, PAPR and ACI analysis. The results reveal that the overlapping multi-carrier CDMA systems are comparable to the Fast-OFDM system under single user condition. It is thus feasible to apply multi-carrier CDMA detection techniques in Fast-OFOM systems. Therefore, two different types of linear detectors, zero-forcing (ZF) and minimum mean square error (MMSE) have been employed in complex modulated Fast-OFDM, leading to improvement of system performance. Overall, the theoretical design and performance assessment issues addressed in this thesis provide an insight into the performance of Fast-OFDM in the presence of additive white Gaussian noise (AWGN). The results obtained can be used by receiver designers for improving signal recovery of complex modulated Fast-OFDM in future wireless communication systems.

Abstrakt Bakgrund: Preoperativ fasta syftar till att minska innehållet- och sänka pH värdet i magsäcken och i sin tur reducera risken för aspiration i samband med induktion. Rekommendationerna som råder idag för preoperativ fasta är sex timmar från fast föda och två timmar från klar vätska.  Trots dessa rekommendationer har patienter tendens till att överskrida tiden för fasta från föda respektive vätska vilket kan leda till fysiologiska konsekvenser och postoperativa obehag. Anledningen till detta har bland annat beskrivits bero på bristande information från sjukhus och vårdpersonal. Syfte: Syftet med denna studie var att undersöka patienters följsamhet till preoperativ fasta. Metod: Designen som användes var en kvantitativ ansats med en icke-experimentell retrospektiv design. Urvalet bestod av ett bekvämlighetsurval och sammanlagt deltog 186 personer från arton regioner i Sverige. Deltagarna besvarade en egenkonstruerad webbaserad enkät som var distribuerad via sociala medier och e-post. Elva frågor analyserades i programmet SPSS version 26 och tre öppna frågor analyserades med en kvantitativ innehållsanalys. Resultat: Resultatet visade att deltagarna i snitt fastade från fast föda i tretton timmar respektive vätska i sex timmar och fyrtiotvå minuter. Majoriteten av deltagarna erhöll information om preoperativ fasta från ett informationsblad från sjukhuset eller från vårdpersonal och de flesta av deltagarna upplevde informationen som tydlig eller mycket tydlig. En vanlig känsla hos deltagarna som upplevdes inför operation var oro. Den främsta orsaken och konsekvensen till varför man ska fasta inför operation beskrev deltagarna bero på aspiration eller kräkning. De främsta riskerna med lång fasta beskrevs av deltagarna vara fysiologiska konsekvenser men en del av deltagarna mindes inte eller visste inte några risker förenat med en lång fasta. Slutsats: Deltagarna i detta examensarbete upplevde att informationen de erhållit om fasta var tydlig eller mycket tydlig, dock visade resultatet att deltagarnas medeltid för fasta överskred nuvarande rekommendationer. Detta indikerar att informationen som patienter erhåller för preoperativ fasta behöver förbättras.       Nyckelord: Följsamhet, Preoperativ, Fasta, Information, Kunskap, Anestesi Keywords: Adherence, Preoperative, Fast, Information, Knowledge, Anesthesia

As the continuous trend of Very Large Scale Integration (VLSI) circuits technology scaling and frequency increases, delay optimization techniques for interconnect are increasingly important for achieving timing closure of high performance designs. For the gigahertz microprocessor and multi-million gate ASIC designs it is crucial to have fast algorithms in the design automation tools for many classical problems in the field to shorten time to market of the VLSI chip. This research presents algorithmic techniques and constructive models for two such problems: (1) Fast buffer insertion for delay optimization, (2) Wire sizing for delay optimization and variation minimization on non-tree networks. For the buffer insertion problem, this dissertation proposes several innovative speedup techniques for different problem formulations and the realistic requirement. For the basic buffer insertion problem, an O(n log2 n) optimal algorithm that runs much faster than the previous classical van Ginneken’s O(n2) algorithm is proposed, where n is the number of buffer positions. For modern design libraries that contain hundreds of buffers, this research also proposes an optimal algorithm in O(bn2) time for b buffer types, a significant improvement over the previous O(b2n2) algorithm by Lillis, Cheng and Lin. For nets with small numbers of sinks and large numbers of buffer positions, a simple O(mn) optimal algorithm is proposed, where m is the number of sinks. For the buffer insertion with minimum cost problem, the problem is first proved to be NP-complete. Then several optimal and approximation techniques are proposed to further speed up the buffer insertion algorithm with resource control for big industrial designs. For the wire sizing problem, we propose a systematic method to size the wires of general non-tree RC networks. The new method can be used for delay optimization and variation reduction.

<p>Face detection is a classical application of object detection. There are many practical applications in which face detection is the first step; face recognition, video surveillance, image database management, video coding. </p><p>This report presents the results of an implementation of the AdaBoost algorithm to train a Strong Classifier to be used for face detection. The AdaBoost algorithm is fast and shows a low false detection rate, two characteristics which are important for face detection algorithms. </p><p>The application is an implementation of the AdaBoost algorithm with several command-line executables that support testing of the algorithm. The training and detection algorithms are separated from the rest of the application by a well defined interface to allow reuse as a software library. </p><p>The source code is documented using the JavaDoc-standard, and CppDoc is then used to produce detailed information on classes and relationships in html format. </p><p>The implemented algorithm is found to produce relatively high detection rate and low false alarm rate, considering the badly suited training data used.</p>

Bakgrund Forskning visar att utomhuspedagogik är positiv i många bemärkelser. En möjlig teori att koppla samman med utomhuspedagogik är den sociokulturella, utifrån ett grupperspektiv. Studien har bedrivits genom ett utvecklingsarbete där de didaktiska för- och nackdelarna med undervisning i ett uteklassrum varit i fokus. Syfte Syftet med studien är att undersöka de didaktiska för- och nackdelarna med undervisning i ett uteklassrum. Metod Studien har bedrivits i form av ett utvecklingsarbete, inspirerat av aktionsforskning. Som grund, inför lektionerna, har halvstrukturerade lärar- och elevintervjuer genomförts. Fjorton elever och 5 lärare har intervjuats. Utifrån svaren som framkom under intervjuerna har tre tillfällen i uteklassrummet planerats, genomförts och observerats. Resultat Studien resulterade i ett möjligt förslag till hur undervisning i ett uteklassrum kan bedrivas. Didaktiska tankar och aspekter som är viktiga att ta hänsyn till vid undervisning utomhus har synliggjorts i studien. Det är mycket man inte kan styra över när man som lärare arbetar utomhus. Tre viktiga faktorer är kläder, väder och mod att pröva sig fram. Uteklassrummet kan skapa en nyfikenhet och en lust till lärande hos eleverna.

Det finns idag ett växande behov av mobilitet samt en fortsatt urbanisering i världen vilket leder till vissa utmaningar för framtidens logistik och transporter. Utmaningarna handlar om att möta det ökande behovet av att transportera människor och paket utan att bidra till mer trängsel på vägarna. Det finns ett visat intresse för Urban Air Mobility samt luftburna leveranser med drönare, och användandet av dessa tjänster skulle kunna vara en del av lösningen på de framtida problemen. För att detta skall vara möjligt behöver många olika aktörer involveras, men det behöver även finnas ett visat intresse samt en vilja till att ersätta vissa nuvarande leveranser med drönare. Examensarbetets syfte var därför att undersöka intresset för drönarleveranser i Östergötland med utgångspunkt från Norrköping Airport. Syftet inkluderade även en undersökning av hur drönarbaserade leveranser skulle kunna gynna olika organisationer. Detta för att utreda den framtida efterfrågan på drönarleveranser i regionen. Under examensarbetets gång har teori kring bland annat leveranser, drönare, luftrum, regler samt drönares kapacitet samlats in. De metoder som använts i examensarbetet är en litteraturstudie, intervjuer samt en fallstudie. Intresset för drönarleveranser har identifierats genom ett antal semistrukturerade intervjuer med tre olika industriföretag samt Region Östergötland. Möjligheten till att koppla samman drönartrafik med Norrköping Airport har även undersökts genom en intervju med flygplatsens VD. För att djupare svara till hur drönarbaserade leveranser skulle kunna gynna olika organisationer har en fallstudie bestående av två olika fall genomförts. Med hjälp av teori och tidigare forskning funnen genom litteraturstudien har det empiriska materialet analyserats. Utifrån intervjuerna kunde ett intresse identifieras, men med vissa tveksamheter kring drönares kapacitet och säkerhet. Det visade intresset handlade främst om drönares förmåga till snabba leveranser, men varierade i det avseendet att vissa organisationer var intresserade av inkommande gods och andra av utgående gods. Fallstudiens resultat visade att företagen, till viss del, kan gynnas genom tids- och ekonomiska besparingar av att byta ut vissa nuvarande leveranser mot drönarbaserade leveranser. De slutsatser som gjorts i examensarbetet är att drönare lämpar sig för leverans av små och lätta produkter förpackade i paket, att det finns ett visat intresse för drönarleveranser i Östergötland samt att organisationerna framför allt kan gynnas av drönarleveranser utifrån tidsaspekten genom att få eller leverera produkter snabbare än andra transportmedel.<br><p>Examensarbetet är utfört vid Institutionen för teknik och naturvetenskap (ITN) vid Tekniska fakulteten, Linköpings universitet</p>

Purpose:The purpose of this thesis has been to study, describe and analyze how luxury fashion brands have responded to fast fashion. Background:It has been stated that the life of luxury fashion brands has become more difficult since the proliferation of fast fashion brands. The Italian luxury fashion designer Giorgio Armani has said that &quot;Fast fashion is a growing reality in our sector&quot;. Anna Wintour, the editor-in-chief of American Vogue has credited Zara for creating a ‘seasonless cycle for fashion’. Fast fashion brands such as H&amp;M, Zara, Mango and Topshop have through interpreting catwalk trends with a speedy time-to-market been extremely successful at attracting the fashion conscious consumer. Even loyal high-end customers have started to mix their luxury fashion with fast fashion. Luxury fashion brands once dismissed the fast fashion brands as irrelevant to their high-end business, which however have started to drain away sales from the luxury fashion brands.Method:A qualitative research approach was taken to meet the purpose of collecting the relevant data. An interview was made with PR and Marketing Manager at Group 88, Robert Meeder who manages brands such as Gucci, Burberry and Bottega Veneta in Copenhagen. We also did a content analysis on articles collected that address the issue of how different luxury fashion brands have responded to fast fashion for the empirical study.Conclusion:Luxury fashion brands have responded to fast fashion by inclining towards the fast fashion model or reacting against it. Some of the reactions have been to offer lower priced lines under their own sub-brands. They have also allowed their customers to buy products during online webcasts in order to ensure early deliveries. Improvements have been made within logistics in order to speed up the time-to-market. The luxury fashion brands are also working more ‘seasonless’ than before and focusing on their heritage to portray a slower and more indulgent image to the consumer.<br>Program: Magisterutbildning i Fashion Management

Under 1990-talet accelererade avvecklingen av det fasta kustartilleriet. Det skedde samtidigt med implementeringen av Revolution in Military Affairs(RMA)-konceptet i Sverige, snabb militärteknisk utvecklingen och Försvarsmaktens omställning från en stor organisation med lång mobilisering till insatsförsvar med hög beredskap. Syftet med studien är att med hjälp av argumentationsanalys och kvalitativ textanalys, studera relationen mellan RMA och avvecklingen av fasta kustartilleriet, genom analys av Kungliga Krigsvetenskaps Akademiens Handlingar och Tidskrifter. Resultatet visar att fast kustartilleri spelar en viktig roll även i en värld präglad av RMA och modern teknologi. Det fasta kustartilleriet ersattes av rörligt. Även detta avvecklades i förtid.<br>During the 1990´s the liquidation of coastal fortifications accelerated. During the same period of time the concept of Revolution in Military Affairs is being implemented in Sweden, military technology is rapidly evolving and Swedish Armed Forces is transforming its organization from a large quantity - long mobilization, to a small mission-based armed force with high response. The purpose of the study is to analyze the relation between RMA and the liquidation of the coastal fortifications, through argumentative analysis and qualitative text analysis, by studying the publications of the Royal Swedish Academy of War Sciences. The result shows that costal fortifications are important even in a world characterized by RMA and modern technology. The costal fortifications were replaced by mobile units. They got liquidated before there time as well.

Diese Arbeit untersucht die Dauer von Bootvorgängen auf Linux-Systemen vom Einschalten des Rechners bis zur Benutzeranmeldung. Zeitintensive Abschnitte des Bootvorganges werden untersucht und Methoden zur Beschleunigung diskutiert. Dies beinhaltet eine Analyse verschiedener BIOS Versionen, der Kernel-Initialisierung und unterschiedliche Ansätze, Dienste zu starten. Es werden Startvorgänge eines gewöhnlichen Desktop-Systems mit einem eingebetteten VIA EPIA-ML-6000EA Mini-ITX System verglichen<br>This research project evaluates startup times of the linux boot process from power-on until user login. Time consuming parts of the boot process are investigated and methods how to speed up the whole process are discussed. It includes an analysis and comparison of different BIOSes, the kernel startup sequence and different approaches to start user space services. This project also compares the startup times of everyday desktop systems with the EPIA-ML6000EA Mini-ITX board, an embedded x86-compatible system

Just graduated, Livy McHaney moves into a loft owned by father and daughter Wallace and Keegan Sammler. As Livy gets to know the Sammlers, he becomes fascinated by the sense Wallace makes out the world, a skill difficult for Livy. At the same time, Livy starts working at Zoo Dunn conducting its Tournado Train. Wallace explains to Livy his reflections on animals, enthralling Livy with his big ideas about freedom and questioning when one is supposed to not. In an attempt to make his grand pronouncements concrete, Wallace recruits Livy into a secret plan to kidnap and set free a popular young elephant from Zoo Dunn. Once in motion, much of their plan fails and everything appears less certain. Livy is forced to rethink the kidnapping's meaning, the possibility of changing the way people view animals, and ultimately the allure of Wallace's "truth" in forging his own ideas about life.

The authoring of realistic terrain models is necessary to generate immersive virtual environments for computer games and film visual effects. However, creating these landscapes is difficult – it usually involves an artist spending many hours sculpting a model in a 3D design program. Specialised terrain generation programs exist to rapidly create artificial terrains, such as Bryce (2013) and Terragen (2013). These make use of complex algorithms to pseudo-randomly generate the terrains, which can then be exported into a 3D editing program for fine tuning. Height-maps are a 2D data-structure, which stores elevation values, and can be used to represent terrain data. They are also a common format used with terrain generation and editing systems. Height-maps share the same storage design as image files, as such they can be viewed like any picture and image transformation algorithms can be applied to them. Early techniques for generating terrains include fractal generation and physical simulation. These methods proved difficult to use as the algorithms were manipulated with a set of parameters. However, the outcome from changing the values is not known, which results in the user changing values over several iterations to produce their desired terrain. An improved technique brings in a higher degree of user control as well as improved realism, known as texture-based terrain synthesis. This borrows techniques from texture synthesis, which is the process of algorithmically generating a larger image from a smaller sample image. Texture-based terrain synthesis makes use or real-world terrain data to produce highly realistic landscapes, which improves upon previous techniques. Recent work in texture-based synthesis has focused on improving both the realism and user control, through the use of sketching interfaces. We present a patch-based terrain synthesis system that utilises a user sketch to control the location of desired terrain features, such as ridges and valleys. Digital Elevation Models (DEMs) of real landscapes are used as exemplars, from which candidate patches of data are extracted and matched against the user’s sketch. The best candidates are merged seamlessly into the final terrain. Because real landscapes are used the resulting terrain appears highly realistic. Our research contributes a new version of this approach that employs multiple input terrains and acceleration using a modern Graphics Processing Unit (GPU). The use of multiple inputs increases the candidate pool of patches and thus the system is capable of producing more varied terrains. This addresses the limitation where supplying the wrong type of input terrain would fail to synthesise anything useful, for example supplying the system with a mountainous DEM and expecting deep valleys in the output. We developed a hybrid multithreaded CPU and GPU implementation that achieves a 45 times speedup.

The work presented in this thesis was carried out in the Physics Department at the University of Nottingham between October 1988 and October 1991. It is the original work of the author except where indicated by reference. This thesis describes the continuation of the development of Echo Volumar Imaging (EVI) to facilitate snapshot imaging of a volume within the human body. Variants of the technique which have also been investigated include a spin echo version, SE-EVI, and a zoomed version ZEVI. All formats acquired data in a modulus fashion in times ranging from 64 ms to 120 ms. Hardware limitations have restricted the image matrix size to 64 x 32 x 8 voxels and prompted the employment of more efficient gradient driver circuitry. A multi-mode resonant gradient circuit is described for use in both Echo Planar Imaging (EPI) and EVI. The circuit behaves in an overall resonant manner but at a fixed number of discrete frequencies. By choosing the number of resonant modes, the circuit can be used to generate approximations to a square wave or trapezoidal waveform. Because of the energy conserving nature of the circuit design much faster current rise times can be achieved with a given amplifier and gradient coil. The multi-mode gradient driver circuit was utilized both for planar imaging and to investigate the effect of rapidly modulated magnetic fields on the human body. A simple neural stimulation model is used to evaluate the stimulation threshold current density for a variety of magnetically induced waveforms and for sinusoidal stimulation as a function of frequency. Experimental results correlate well with the model showing that for short times, contrary to the widely held view, neural stimulation is independent of the magnetic field switching rate dB / dt, but depends on the final magnetic field value.

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Mesmo com a evolução dos dispositivos de armazenamento e comunicação, mantém-se crescente a demanda por mecanismos de compressão de dados mais eficientes. Entre os compressores baseados na freqüência de símbolos, destacam - se os códigos livres de prefixo, que são executados por vários métodos compostos de diferentes algoritmos e também apresentam bom desempenho em uso isolado. Muitas pesquisas trouxeram maior eficiência aos códigos de prefixo, centradas, sobretudo, na redução do espaço de memória necessário e tempo gasto durante a descompressão. O presente trabalho abrange códigos de prefixos e respectivas técnicas de descompressão visando propor um novo codificador, o compressor LTL, que utiliza códigos com restrição de comprimento para reduzir o espaço de memória da tabela Look-up, eficiente método de decodificação. Devido ao uso de códigos restritos, é admitido um pequeno decréscimo nas taxas de compressão para possibilitar uma decodificação mais rápida. Os resultados obtidos indicam perda de compressão inferior a 11 por cento para um modelo baseado em caracteres, com velocidade média de decodificação cinco vezes maior que a de um decodificador canônico. Embora, para um modelo de palavras, o ganho médio de velocidade seja de 3,5, constata-se que, quando o número de símbolos é muito grande, o tamanho da tabela look-up impossibilita uma utilização eficiente da memória cache. Assim, o LTL é indicado para substituir quaisquer códigos de prefixo baseados em caracteres cuja aplicação requer agilidade no processo de descompressão.<br>Even with the evolution of communication and storage devices, the use of complex data structures, like video and hypermedia documents, keeps increasing the demand for efficient data compression mechanisms. Prefix codes are one of the most known compressors, since they are executed by some compression methods that group different algorithms, besides presenting a good performance when used separately. A lot of approaches have been tried to improve the decoding speed of these codes. One major reason is that files are compressed and updated just a few times, whereas they have to be decompressed each time they are accessed. This work presents prefix codes and their decoding techniques in order to introduce a new coding scheme. In this scheme length-restricted codes are used to control the space requirements of the Look-up table, an efficient and fast prefix codes decoding method. Since restricted codewords are used, a small loss of compression efficiency is admitted. Empirical experiments indicate that this loss in the coded text is smaller than 11 percent if a character based model is used, and the observed average decoding speed is five times faster than the one for canonical codes. For a word based model, the average decoding speed is 3,5 times faster than a canonical decoder, but it decreases when a large number of symbols is used. Hence, this method is very suitable for applications where a character based model is used and extremely fast decoding is mandatory.

In this study we have examined young consumers thoughts and opinions regarding how green marketing is used in the fast fashion industry. Previous studies in the topics of fast fashion shows that the concept is increasing at the same time as the demand for sustainable products are greater than ever before. Companies uses green marketing in order to meet the demand for sustainable products, but green marketing is often used in a wrong way and products are marketed as more green than they are. We wanted to see consumers understanding of green marketing campaigns from fast fashion companies and how they perceive &quot;green&quot; in messages. Also thoughts and opinions about sustainability strategies and green products have been discussed in order to meet our purpose to see how young consumers perceive green marketing in the fast fashion context? Our study is based on a qualitative research and two focus groups were used for the collecting of empirical data. A previous field study about consumers responsibility toward fast fashion has additionally has been used as both inspiration to the chosen topic and the results has been used for problem discussion and in the discussion chapter in this study. The theoretical framework contains of the parts fast fashion, consumer behaviour, sustainability, green marketing and green campaigns. All parts are chosen to its relevance to the issue and are discussed from a fashion perspective. Results from our study shows that young consumers in age of 20 to 30 years old don&apos;t perceive green marketing. The connection between fast fashion and green marketing is unclear and consumers don&apos;t relate fast fashion with sustainability. Young consumers low knowledge about green marketing and sustainability in the fast fashion context is a reason why they don&apos;t care about the environment when buying clothes. Our study further shows that consumers associates sustainable collections with limited assortments, unattractive and expensive products and therefore prefer other products. Finally this study shows that consumers want green marketing to communicate a clearer message to understand the advantages of buying green.<br>Program: Master Programme in Fashion Management

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Chemistry, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 125-129).<br>This thesis describes the development and application of fast flow solid phase synthesis for the preparation of peptides and phosphorodiamidate morpholino oligomers (PMOs), as well as the application of fast, reliable peptide synthesis to study non-natural protein folding and function. In the first chapter, solid supported peptide synthesis was accelerated using flow by continuously delivering preheated solvents and reagents to the solid support at high flow rate, thereby maintaining maximal concentrations, quickly exchanging reagents, and eliminating the need to heat reagents after they were added to the vessel. In the second chapter, these chemical principles were expanded upon and mechanical challenges particular to accelerated solid phase synthesis were overcome to build a fully automated fast flow peptide synthesizer than incorporates amino acids in as little as 40 seconds each. First, mechanical systems were developed to rapidly switch between the many reagents needed for peptide synthesis while maintaining the proper stoichiometry of all reaction components at all times. Second, conditions under which reagents did not appreciably degrade during storage or synthesis were found. Finally, synthetic outcomes were substantially improved by increasing temperature without degrading the protected, resin bound peptide. The third chapter describes the expansion of fast flow synthesis to PMOs. A 10-fold acceleration of PMO synthesis was realized using mechanical systems adapted from chapter 1, increasing the reaction temperature to 90°C, and introducing a Lewis acid catalyst. The acidity of the deprotection reagent was reduced to prevent cleavage of the backbone during 3' detritylation. In the final chapter, a "D-scan" of two small proteins, the disulfide-rich Ecballium elaterium trypsin inhibitor II (EETI-II) and a minimized Z domain of protein A (Z33), is reported. For each protein, the chirality of one amino acid at a time was inverted to generate a series of diastereomers, and study the critical stereocenters of EETI-I and Z33. Twelve out of 30 EETI-II analogs folded and were high-affinity trypsin inhibitors, but most active analogs were less stable to reduction than EETI-II. Similarly, twelve Z33 analogs retained high binding affinity to IgG, but most were substantially less stable than WT-Z33.<br>by Mark David Simon.<br>Ph. D.

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.<br>Includes bibliographical references (p. 252-254).<br>by Valentin I. Spitkovsky.<br>S.B.and M.Eng.

Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>27<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 41-43).<br>The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations scan the set of currently registered threads. Instances of this problem show up in concurrent implementations of transactional memory, flat combining, thread barriers, and memory reclamation schemes for lock-free data structures. In this thesis, we analyze a randomized solution for long-lived renaming. The algorithmic technique we consider, called the LevelArray, has previously been used for hashing and one-shot (single-use) renaming. Our main contribution is to prove that, in long-lived executions, where processes may register and deregister polynomially many times, the technique guarantees constant steps on average and O(log log n) steps with high probability for registering, unit cost for deregistering, and 0(n) steps for collect queries, where n is an upper bound on the number of processes that may be active at any point in time. We also show that the algorithm has the surprising property that it is self-healing: under reasonable assumptions on the schedule, operations running while the data structure is in a degraded state implicitly help the data structure re-balance itself. This subtle mechanism obviates the need for expensive periodic rebuilding procedures. Our benchmarks validate this approach, showing that, for typical use parameters, the average number of steps a process takes to register is less than two and the worst-case number of steps is bounded by six, even in executions with billions of operations. We contrast this with other randomized implementations, whose worst-case behavior we show to be unreliable, and with deterministic implementations, whose cost is linear in n.<br>by Justin Kopinsky.<br>S.M. in Computer Science and Engineering

This thesis develops efficient optimization methods for Model Predictive Control (MPC) to enable its application to constrained systems with fast and uncertain dynamics. The key contribution is an active set method which exploits the parametric nature of the sequential optimization problem and is obtained from a dynamic programming formulation of the MPC problem. This method is first applied to the nominal linear MPC problem and is successively extended to linear systems with additive uncertainty and input constraints or state/input constraints. The thesis discusses both offline (projection-based) and online (active set) methods for the solution of controllability problems for linear systems with additive uncertainty. The active set method uses first-order necessary conditions for optimality to construct parametric programming regions for a particular given active set locally along a line of search in the space of feasible initial conditions. Along this line of search the homotopy of optimal solutions is exploited: a known solution at some given plant state is continuously deformed into the solution at the actual measured current plant state by performing the required active set changes whenever a boundary of a parametric programming region is crossed during the line search operation. The sequence of solutions for the finite horizon optimal control problem is therefore obtained locally for the given plant state. This method overcomes the main limitation of parametric programming methods that have been applied in the MPC context which usually require the offline precomputation of all possible regions. In contrast to this the proposed approach is an online method with very low computational demands which efficiently exploits the parametric nature of the solution and returns exact local DP solutions. The final chapter of this thesis discusses an application of robust tube-based MPC to the nonlinear MPC problem based on successive linearization.

In the present work we develop an approach to the classical kinematic fast dynamo problem for flows [32] in the real 3-dimensional space. We suggest a fluid flow that may possibly generate a magnetic field which energy grows exponentially fast with time in the present of slow diffusivity. In order to verify the construction we study a discrete system and prove that an analogous statement holds true for the Poincaré map of the provisional flow and vector fields in the plane. This problem falls into the framework of open dynamical systems with random holes.

This thesis describes an experimental and theoretical study into the nonlinear optical properties of novel photorefractive materials and devices. The focus of the work is centred on bringing together the attractive attributes of inorganic and organic materials in a single hybrid device and to increase the photorefractive effect that is available from either material alone. Consequently three novel photorefractive devices have been developed that are suitable for use as frequency agile optical filters and exhibit greater contrast ratios than previous passive photorefractive materials. Small signal gain co-efficients of up to 1600cm-1 are demonstrated in these hybrid devices, compared to less than 20cm-1 in a single photorefractive window without any inorganic-organic hybridisation. The fundamental understanding in an inorganic photorefractive hybrid has also been advanced.

Bibliography: pages 217-225.<br>The scattering of a beam of fast monoenergetic neutrons is used to determine elemental compositions of small (0.2-1 kg) samples of materials. Particular emphasis is placed on the measurement of concentrations of the elements H, C, N and O, which are the principal constituents of contraband materials, such as explosives and narcotics. Scattered neutrons are detected by liquid scintillators located at forward and at backward angles, and different elements are identified by their characteristic scattering signatures derived either from a combination of time-of-flight and pulse height measurements or from pulse height measurements alone. Atom fractions for H, C, N, O and other elements are derived from unfolding analyses based on these scattering signatures and used to identify materials. Effects of neutron interactions in surrounding materials, either in the neutron beam or between the scatterer and the detectors, can be detected and allowed for in such a way as not to interfere significantly in the identification of the scatterer. The Fast Neutron Scattering Analysis technique provides a non- intrusive method for detecting and identifying sub-kilogram quantities of contraband materials. Methods for locating the positions of small contraband items in packages of volume up to about 0.5m³ are described and a two-stage screening system for detecting contraband hidden in small packages is proposed.