To see the other types of publications on this topic, follow the link: Stack.
Dissertations / Theses on the topic 'Stack'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Stack.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Davies, James. "stack : minimalist poetics." Thesis, University of Roehampton, 2018. https://pure.roehampton.ac.uk/portal/en/studentthesis/stack(aebfad17-9098-4c69-831d-3af98f9d48e4).html.
Full textAbstract:
stack: Minimalist Poetics consists of a portfolio of practice-led research — a volume-length minimalist poem entitled stack — and a critical essay. The poem applies and adapts several minimalist writing strategies, which are evaluated in the critical essay to create a text that is rich in imagery yet indeterminate in meaning. In addition, stack is innovative in its structural approach — through original use of enjambment, footnoting and repetition, lines may be treated as discrete entities and, also, as combinations. A key research question that the practice-led component and the critical essay interrogate is the applicability and development of the poetics of the “New Sentence”, and other formally innovative approaches in the field of minimalist writing. The first part of the critical essay contextualises the creative portfolio in relation to the field of minimalist poetics as a whole. It sets out how stack belongs to a strand of minimalist poetry that evolved out of imagism and objectivism, and whose key practitioners include Robert Grenier, Robert Lax and Aram Saroyan. Subsequently, the thesis outlines the methods that were used to generate the creative portfolio. Effectively these latter sections present a manual for making minimalist poetry. Aside from exploring the written elements of stack, the thesis also examines my practice of conducting what I refer to as ‘minimalist interventions’ (embodied, micro-actions). These interventions, which have taken place in a range of environments, generally function as stimuli for the written aspects of the poem.
2
Hightower, Jeffrey. "The location stack /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/6917.
Full text
3
Muradi, Saman. "Utvecklingstekniker för webben : En komparativ studie mellan MEAN-stack ochAMP-stack." Thesis, Karlstads universitet, Handelshögskolan, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-56682.
Full textAbstract:
Den ökande efterfrågan på prestanda och skalbarhet i en webb applikation har motiverat utvecklare att skapa nya utvecklingstekniker. Vilket har resulterat till att det i skrivande stund finns ett antal utvecklingstekniker att välja mellan, att välja rätt utvecklingsteknik är en av de viktigaste delarna när man utvecklar en webb applikation, väljer man fel teknik kan detta ge förödande konsekvenser. Detta kan undvikas genom att från början analysera det man vill utveckla och sedan välja en lämplig stack som uppfyller alla de krav som ett företag har. Denna undersökning har gjort en kvalitativ studie där författaren har samlat in data genom intervjuer. Det var totalt 6 respondenter som deltog i undersökningen och dessa har alla erfarenhet inom webbutveckling. Syftet med undersökningen är att jämföra MEAN-stack och AMP-stack för webbutveckling.Resultatet visar att de bakomliggande faktorer för att använda respektive stack var följande• Om man har en kund kan denna påverka valet av stack. Eftersom kunden kan vilja att man utvecklar, modifierar eller vidareutvecklar ett pågående projekt eller att kunden vill att du använder en specifik stack när du utvecklar ett nytt projekt.• Erfarenheten som ett företags utvecklare har kan påverka. Mer erfarenhet i en viss stack kan minska utvecklingstiden vilket gör en specifik stack mer intressant.• Vad som faktiskt ska utvecklas kan påverka vilken stack man väljer. Eftersom ett företag vill att en stack ska klara av alla krav de har.Fördelar med MEAN-stack var följande efter en jämförelse mellan teori och empiri.• NPM, Utrymmet som sparas med MongoDB, JavaScript i hela stacken, Hög prestanda, Hög tillgänglighet, routing som express.js erbjuder och skalbarheten.Det fanns inga likheter i nackdelar för MEAN-stack mellan empiri och teori. Teori pratade om tekniska nackdelar medans empiri pratade om att det var svårt att hitta rätt kompetens för att ta del av alla fördelar MEAN-stack har.Fördelar med AMP-stack var följande efter en jämförelse mellan teori och empiri• Skalbart, hög säkerhet samt att PHP kan användas för att skapa dynamiska webb applikationer.Det fanns en likhet mellan teori och empiri för nackdelar med AMP-stack och båda argumenterade om att PHP var ett svagt skrivet språk vilket gör det svårt att använda i komplexa webb applikationer eller webb applikationer med affärkritisk logik.Resultatet i denna undersökning kan användas av målgruppen organisationer och företag som jobbar med webbutveckling. Det kan förenkla för dem när de står inför ett val av stack och förhindra dem från att välja fel stack vilket kan få förödande konsekvenser.
4
Zhou, Jie. "Infrared emission comparison between half-stack and full-stack ZnS:REF3 ACTFEL devices." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000835.
Full text
5
Fredriksen, Steinar Lieng. "Priority Based Message Stack." Thesis, Norwegian University of Science and Technology, Department of Engineering Cybernetics, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8893.
Full textAbstract:
<p>To enable deterministic scheduling in a distributed embedded system an existing open source embedded TCP/IP stack has been modified to support strict priority queuing. The embedded target system has a fully switched closed Ethernet backplane used for internal communication. The problem is that high-volume configuration file downloads interfere with low-volume internal signaling, such as alarms, status reports, performance data and other statistics. The network was already designed using a type of switches which could support several Quality of Service schemes. An open source embedded TCP/IP stack, lightweight IP (lwIP) was evaluated, and found to be a suitable foundation for the developed application; the Priority Based Message Stack (PBMS). PBMS is a modification of lwIP with support for selective packet forwarding and reception based on the IPv4 Type-of-Service (TOS) field. Support for the BOOTP protocol, as well as a nonblocking send operation, was also implemented. PBMS is easily portable in the sense that it only requires a clearly defined basic set of generic OS functions in order to be ported to new systems. A generic interface to Ethernet drivers must also be developed. The implementation was desktop tested on a Linux platform for correct functionality in the IP, UDP and BSD Socket modules. The performance of the priority scheme compared to a best-effort strategy was also measured. These tests showed that stack-internal strict prioritization based on the IPv4 TOS precedence bits have a clear potential for offering deterministic transfer times in Neras distributed embedded system. Without prioritization, with contention for the network link, an average output time of 480 microseconds was measured from the time the socket sendto function was called until the IP output function had been executed. Using strict prioritization under the same conditions this sequence of functions executed in only 15 microseconds in 99 percent of the test runs. The proper prioritization within the TCP/IP stack is only one of several queuing points in the target network. The existing switches, along with the proper TOS marking of each packet, will ensure an unbroken chain of priority queueing all the way to the destination. Some network endpoints might have variable latencies, which will affect the round-trip time (RTT). A measurement methodology to determine this has been described. A test methodology for round-trip and one-way delay time measurement will be used to validate PBMS in the target system. These tests can also be used to estimate the latencies in those network endpoints mentioned above. With this data at hand a worst-case RTT for the entire system can be calculated. The target system integration and validation will be carried out immediately after the completion of this thesis.</p>
6
Nessler, F. Scott. "Comparison of a pin stack to a conventional stack in a thermoacoustic prime mover." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA294306.
Full text
7
Vellala, Manoj. "Stack Composition for SILO Architecture." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-03212008-153547/.
Full textAbstract:
SILO is a new internetworking architecture that represents a significant departure from current philosophy and practice. The architecture consists of building blocks of fine-grain functionality, explicit support for combining elemental blocks to accomplish highly configurable complex communication tasks, and control elements to facilitate (what is currently referred to as) cross-layer interactions. It takes a holistic view of network design, allowing applications to work synergistically with the network architecture and physical layers so as to meet the application's needs within resource availability constraints. The SILO research advocates a non-layered architecture based on silos of services assembled on demand and specific to an application and network environment. With the goal to facilitate what in today's layered architecture is referred to as ``cross-laye' interactions, in a manner that meets the exact user requirements and optimizes performance, the main focus of this research work is on developing mechanisms to optimize the construction of SILOs (stack of services) in a manner that takes into account service specific constraints, current network conditions and user policies.
8
Berezovsky, V. V. "Modern front-end development stack." Thesis, Київський національний університет технологій та дизайну, 2018. https://er.knutd.edu.ua/handle/123456789/10634.
Full text
9
Gibson, Rodney Jay. "An experimental comparison of a pin stack to a conventional stack in a thermoacoustic prime mover." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA316037.
Full textAbstract:
Thesis (M.S. in Applied Physics)--Naval Postgraduate School, June 1996.<br>Thesis advisor(s): Robert Keolian and Thomas J. Hofler. "June 1996." DTIC Descriptor(s): Heat Engines, Refrigeration Systems, Pressure Gradients, Computerized Simulation, Computer Aided Design, High Temperature, Acoustic Waves, Efficiency, Theses, Heat Exchangers, Temperature Gradients, Thermal Analysis, Acoustic Measurement, Liquid Nitrogen, Heat Flux, Sound Pressure, Thermocouples, Stacking, Heat Sinks, Acoustic Resonance. DTIC Identifier(s): Thermoacoustics, Prime Movers, Acoustic Energy, PE61153N. Bibliography: p. 55. Also available online.
10
Campbell, Brian. "Type-based amortized stack memory prediction." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/3176.
Full textAbstract:
Controlling resource usage is important for the reliability, efficiency and security of software systems. Automated analyses for bounding resource usage can be invaluable tools for ensuring these properties. Hofmann and Jost have developed an automated static analysis for finding linear heap space bounds in terms of the input size for programs in a simple functional programming language. Memory requirements are amortized by representing them as a requirement for an abstract quantity, potential, which is supplied by assigning potential to data structures in proportion to their size. This assignment is represented by annotations on their types. The type system then ensures that all potential requirements can be met from the original input’s potential if a set of linear constraints can be solved. Linear programming can optimise this amount of potential subject to the constraints, yielding a upper bound on the memory requirements. However, obtaining bounds on the heap space requirements does not detect a faulty or malicious program which uses excessive stack space. In this thesis, we investigate extending Hofmann and Jost’s techniques to infer bounds on stack space usage, first by examining two approaches: using the Hofmann- Jost analysis unchanged by applying a CPS transformation to the program being analysed, then showing that this predicts the stack space requirements of the original program; and directly adapting the analysis itself, which we will show is more practical. We then consider how to deal with the different allocation patterns stack space usage presents. In particular, the temporary nature of stack allocation leads us to a system where we calculate the total potential after evaluating an expression in terms of assignments of potential to the variables appearing in the expression as well as the result. We also show that this analysis subsumes our previous systems, and improves upon them. We further increase the precision of the bounds inferred by noting the importance of expressing stack memory bounds in terms of the depth of data structures and by taking the maximum of the usage bounds of subexpressions. We develop an analysis which uses richer definitions of the potential calculation to allow depth and maxima to be used, albeit with a more subtle inference process.
11
Heitmann, Bo-Lennart. "Full-stack musik : En studie om back-end, front-end och full-stack terminologi inom låtskapande och musikproduktion." Thesis, Kungl. Musikhögskolan, Institutionen för musik- och medieproduktion, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kmh:diva-4058.
Full textAbstract:
Syftet med det här examensarbetet är att presentera process och erfarenheter från mitt konstnärliga musikproduktionsprojekt som genomförts under mitt sista år av min masterutbildning. Genomförandet har bestått av att skapa ett svenskt popmusikalbum där låtar har skapats enskilt, genom samarbeten och tre verk har blivit slutförda och distribuerats på streamingtjänster så som Spotify och YouTube. Vidare är syfte att presentera en modell med hjälp av mitt konstnärliga arbete där det prövas potentiella omformuleringar för yrkesroller inom låtskapande. Dessa termer ska i sin tur underlätta rolldefinition inom låtskapande och även ge utrymme för att förtydliga den ideella rätten som medverkande i ett konstnärligt verk har. Med utgångspunkt till att musikproducenten ofta hamnar i en multikompetent position så har jag valt att låna begrepp från systemutvecklarens yrkesvärld för att skapa modellen. Begreppen jag valt att låna består av back-end, front-end och full-stack och avsikten är att bryta upp paraplybegrepp såsom ”låtskrivare, producent och performer” och även kunna bidra till tydligare rekryteringsprocesser för samarbeten inom låtskapande.<br>The purpose of this master’s thesis is to present the process and experiences of my music production project that was carried out during the last year of my masters’ studies. The project’s creative content is a Swedish pop album which created through collaborative and independent work. Three single releases and one music video have been released and distributed through the course of the project on streaming platforms such as Spotify and YouTube. In addition to the making of the album I have chosen to create a model to use as a frame for potential recruitment instances of creative collaborations, improve role definition and develop a more accurate method to credit rights holder’s moral credentials as a contributor to an artistic work. The root cause of this model is that a music producer often finds themselves as a multicompetent keyperson in creative collaborations where the lines between different professions overlap. The model is inspired of the software developers job terminology and aims to break up umbrella concept roles such as “songwriter, producer and performer” to facilitate the recruiting process of creative collaborations within the crafting of songs. The terminologies inspired out of the software developer’s professions are back-end, front-end and full-stack.
12
Kumar, Rajnish. "Adaptable Protocol Stack for Future Sensor Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/13931.
Full textAbstract:
The goal of this thesis is to provide an adaptable protocol stack
architecture for data fusion applications. Towards the goal, this
thesis presents the design of SensorStack, that addresses three key
issues. First, towards network-level adaptability, how to
dynamically adapt the placement of a fusion application task graph
on the network? We have designed a distributed role assignment
algorithm and implemented in the context of DFuse, a framework for
distributed data fusion. Second, towards node-level adaptability,
how to facilitate cross-layering on a node to foster agile
adaptation of a node's behavior commensurate with the network-level
changes? SensorStack provides information exchange service (IES) as
a framework for cross-module information exchange. Finally, towards
tying the network and node level adaptability together, control data
published in IES needs to be shared across the network. SensorStack
uses a probabilistic broadcast based dissemination service (IDS) for
control data. We implement SensorStack in TinyOS and Linux to
validate the SensorStack design, and use simulation experiments to
investigate its network performance. Experiments demonstrate the
utility of adaptability in SensorStack to increase application
longevity.
13
Eroglu, Muammer. "A New Stack Architecture For Sensor Networks." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607590/index.pdf.
Full textAbstract:
In this thesis, a new stack architecture for sensor networks is proposed. The stack consists of the following layers: application, query, aggregation, network, MAC and physical. Various algorithms are implemented using this stack and it is
shown that this stack is modular.
Following an overview of sensor networks, the previous protocol stack suggestions for sensor networks are examined. Sensor network algorithms that can be classified as sensor data management systems are surveyed and compared with each other. Four of the surveyed algorithms, namely, TAG, Synopsis Diffusion, Tributary-Delta and Directed Diffusion are implemented using the introduced stack. The implementation is performed using a sensor network model developed with OMNeT++ simulator. The simulation results are compared to the original results of these algorithms. Obtaining similar results, the stack and algorithm implementations are validated, moreover, it is shown that the stack does not induce any performance degradation.
Using the implementation details of the algorithms, the modularity of the suggested stack is demonstrated. Finally, additional benefits of the stack are discussed.
14
Katsigiannakis, Konstantinos. "Electricity price risk : modelling the supply stack." Thesis, Imperial College London, 2006. http://hdl.handle.net/10044/1/7429.
Full text
15
Kopp, Christoffer. "Designing a non-distractive center-stack interaction." Thesis, Umeå universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-38503.
Full textAbstract:
Car brands are today competing over having the most advanced technology in their cars. The drivers today control the stereo which include radio, CD, MP3 and satellite radio. They also control the climate, the GPS, surf the Internet and show a DVD for the kids in the backseat and so much more from the centerstack. All these functions have clattered the center-stack with buttons, "smart" interaction knobs as well as scroll wheels. The buttons feel the same and thereby force the driver to change focus from the main-task, which is driving, to the center-stack. The same attention demanding situation are with the interaction knobs. In order to see the feedback the interaction knob provides, the driver needs to look at a screen located somewhere in the center-stack. World wide driver inattention causes around 60.000 deaths each year. This master-thesis describes the process of designing a non-distractive center-stack interaction. The reader will be introduced to the background of the problem, the dierent design suggestions that were taken into consideration as well as a given full presentation of the nal result. The paper also presents an in-depth study that provides a few guidelines for designing a detached touchscreen input from output.
16
Alexandersson, Johan, and Olle Nordin. "Implementation of CAN Communication Stack in AUTOSAR." Thesis, Linköpings universitet, Datorteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119405.
Full textAbstract:
In the automotive industry today, embedded systems have reached a level of complexity which is not maintainable with the traditional approach of design- ing automotive embedded systems. For this purpose, many of the worlds leading automotive manufacturers have formed an alliance to apprehend this problem. This has resulted in AUTOSAR, an open standardized architecture for automotive embedded systems, which strives for increased flexibility and safety regulations. This thesis will explore the possibilities of implementing a CAN Communication stack using the AUTOSAR architecture and its corresponding methodology. As a result of this thesis, a complete AUTOSAR CAN communication stack has been implemented, as well has a simulator application with the purpose of testing its functionality.
17
Marinos, Ilias. "Network and storage stack specialisation for performance." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/288228.
Full textAbstract:
In order to serve hundreds of millions of users, contemporary content providers employ tens of thousands of servers to scale their systems. The system software in these environments, however, is struggling to keep up with the increase in demand: contemporary network and storage stacks, as well as related APIs (e.g., BSD socket API) follow a `one-size-fits-all' design, heavily emphasising generality and feature richness at the cost of performance, leaving crucial hardware resources unexploited. Despite considerable prior research in improving I/O performance for conventional stacks, substantial hardware potential still remains unexploited because most of these proposals are fundamentally limited in their scope and effectiveness, as they still have to fit in a general-purpose design. In this dissertation, I argue that specialisation and microarchitectural awareness are necessary in system software design to effectively exploit hardware capabilities, and scale I/O performance. In particular, I argue that trading off generality and compatibility, allows us to radically re-architect the stack emphasising application-specific optimisations and efficient data movement throughout the hardware to improve performance. I first demonstrate that conventional general-purpose stacks fail to effectively utilise contemporary hardware while serving critical Internet workloads, and show why modern microarchitectural properties play a critical role in scaling I/O performance. I then identify core decisions in Operating Systems design that, although they were originally introduced to optimise performance, are now proven redundant or even detrimental. I propose clean-slate, specialised architectures for network and storage stacks designed to exploit modern hardware properties, and application domain-specific knowledge in order to sidestep historical bottlenecks in systems I/O performance, and achieve great scalability. With thorough evaluation of my systems, I illustrate how specialisation and greater microarchitectural awareness could lead to dramatic performance improvements, which could ultimately translate to improved scalability and reduced capital expenditure simultaneously.
18
Jönsson, Marthina. "Automated regression test of a communication stack." Thesis, KTH, Maskinkonstruktion (Inst.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-180951.
Full textAbstract:
This thesis investigates possible solutions for testing a communication stack. The communication stack is a part of a communication module at Scania CV AB which is called SCOMM. This module handles diagnostic communication over CAN and shall conform to CAN-related ISO standards. We evaluate these solutions based on three aspects and how the stack is implemented. These three aspects are test coverage, ease of use and integration. Based on these evaluations, a test component has been implemented. We present models, resulting from the evaluation as well as test scripts examples. This test component performs black box testing which raised the question of how to define coverage for something that is hidden. It is hard to devise a decent mathematical model from something that is unknown. Therefore we make further investigations in existing tools that may increase test quality and help in finding reliable coverage metrics. E.g. we investigate learning based testing which allows automated test case generation. One outcome of LBT research is a tool called LBTest. LBTest is the first testing tool combining automata learning methods with model checker based test case generation. So far, research concerning the performance of LBTest, are positive. Therefore, this tool was worth looking into and we tried to answer these two questions. Could this tool improve SCOMMs testing and are there any improvements that would give the tool the right prerequisites, to be more useful? When evaluating the results from LBTest case studies, its ease of use and the system of SCOMM, we made the following conclusion: Yes it may be useful to test the communication stack. With these conclusions, LBTest has a bright future with a lot of areas of use and may be might be a solution for the famous test coverage problem that concerns black box testers.<br>Denna rapport undersöker möjliga lösningar för att testa en kommunikationsstack. Kommunikationsstacken är en del av Scanias kommunikationsmodul SCOMM. Modulen hanterar diagnostisk kommunikation över CAN och ska följa standarderna för detta. Lösningar utvärderas utifrån tre aspekter och hur kommunikationsstacken är implementerad. Dessa utvärderingsaspekter är testtäckning, användarvänlighet och integration. Baserat på resultatet från utvärderingen så har en testkomponent implementerats. Den här rapporten presenterar modeller, resultat från utvärderingen samt exempel på test skript. Testkomponenten utför endast funktionell testning vilket medför att det är svårt att härleda någon matematisk modell för att beräkna testtäckning. Därför görs en djupare undersökning i befintliga verktyg som kan förbättra testkvalitén och hjälpa till att beräkna täckning. Ett exempel är inlärningsbaserad testning som tillåter automatisk generering av testfall. Senare forskning inom området har lett till utvecklingen av ett verktyg, kallat LBTest. LBTest har använts i ett par fallstudier som visar att verktyget har stora potentialer. Frågan som ställts var huruvida SCOMM kan dra nytta av verktyget, vilket är möjligt i viss mån. I utvärderingen har vi tagit ställning till resultaten från fallstudierna, användarvänligheten samt hur SCOMM används. Vi föreslår även förbättringar som skulle kunna öka dess användning. Slutligen kan vi konstatera att LBTest haren ljus framtid och har potentialen att bana en ny väg inom mjukvarutestning.
19
Jaber, Nur, and Paria Moazzemi. "Simulating iNET's Protocol Stack with OPNET Modeler." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595785.
Full textAbstract:
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada<br>This paper discusses simulating iNET's protocol stack using OPNET Modeler. It shows an example of a custom protocol simulated in OPNET Modeler, and how to model the test article, and ground station as reusable components for future simulation. Network simulation is a critical tool for iNET as it enables design decisions that cannot be made analytically due to the complexity of the problem. This work addresses the incorporation of iNET's protocol stack into the OPNET Modeler tool set as this piece of iNET is unique and is not available in OPNET Modeler.
20
Reddy, Satischandra B. "Code optimization with stack oriented intermediate code." DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1985. http://digitalcommons.auctr.edu/dissertations/2629.
Full text
21
Westphal, Patrick, Garcia Javier David Fernandez, Sabrina Kirrane, and Jens Lehmann. "SPIRIT: A Semantic Transparency and Compliance Stack." CEUR Workshop Proceedings, 2018. http://epub.wu.ac.at/6491/1/SPIRIT.pdf.
Full textAbstract:
The European General Data Protection Regulation (GDPR) sets new precedents for the processing of personal data. In this paper, we propose an architecture that provides an automated means to enable transparency with respect to personal data processing and sharing transactions and compliance checking with respect to data subject usage policies and GDPR legislative obligations.
22
Servaites, Joseph Charles. "Computer Aided Analysis of Smoke Stack Designs." Thesis, Virginia Tech, 1996. http://hdl.handle.net/10919/36757.
Full textAbstract:
The purpose of this research is to analyze the statics and dynamics of steel smoke stacks subject to excitation by aerodynamic forces. The wind loads experienced by smoke stacks arise from various phenomenon, the most prominent of which are static drag load, vortex shedding, and atmospheric turbulence. The nature of these loading sources around a cylinder are studied in detail. Both static and dynamic loads are capable of producing large tip deflections, and are of the most prominent design criteria for stack designers. A computer program, STACK1, has been created by modifying an existing analysis code, BEAM8, to be used specifically for stack analysis. This analysis code utilizes the transfer matrix method to perform detailed bending and vibration analyses. This new software has been developed to check stack designs for compliance with appropriate steel stack standards, and provide the designer with information regarding the static and dynamic response of the structure. A detailed analysis is performed to demonstrate the validity of approximating a tapered Timoshenko beam with a series of continuous, constant cross-section beams.<br>Master of Science
23
You, Fenglong. "A Mirror Theorem for Toric Stack Bundles." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1494255385887568.
Full text
24
Yelle, Céline. "Stack Number, Track Number, and Layered Pathwidth." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40348.
Full textAbstract:
In this thesis, we consider three parameters associated with graphs : stack number, track number, and layered pathwidth. Our first result is to show that the stack number of any graph is at most 4 times its layered pathwidth. This result complements an existing result of Dujmovic et al. that showed that the queue number of a graph is at most 3 times its layered pathwidth minus one (Dujmovic, Morin, and Wood [SIAM J. Comput., 553–579, 2005]). Our second result is to show that graphs of track number at most 3 have layered pathwidth at most 4. This answers an open question posed by Banister et al. (Bannister, Devanny, Dujmovic, Eppstein, and Wood [GD 2016, 499–510, 2016, Algorithmica, 1–23, 2018]).
25
NOVARESIO, VALERIO. "Design and modelling an innovative SOEC stack." Doctoral thesis, Politecnico di Torino, 2015. http://hdl.handle.net/11583/2604774.
Full textAbstract:
The present work is focused on the design of a solid oxide cell stack that mainly works in electrolysis mode. The framework of the activity is the energetic issue related to the renewable sources management and storage capabilities. The analysis starts observing the energetic issue from an alternative standpoint that emphasizes the ethical aspects and instills in the reader the secondary importance of the efficiency respect to the feasibility and the robustness of the devices. In order to predict the stack performance, a new numerical solver has been developed based on open source tool. This multi-physic solver can handle complete SOC stack both in fuel cell mode and in electrolysis mode. As a part of this activity an insight concerning SOC Electrochemical Impedance Spectroscopy physical simulation has been done. This part of the solver can be coupled with additional plugins and provides the basis for the impedance analysis of the low frequency part of the SOC spectrum. Basing on pragmatic approach a new stack design was proposed and technical drawings have been released. The stack is based on tubular cells considering some peculiarity of the planar configuration especially concerning charge transfer between electrodes and external current takes. Some simulations have been run in order to validate the main assumptions of the design process.
26
Ciavatta, Emiliano. "Sviluppo di applicazioni distribuite con lo stack SMACK." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/16836/.
Full textAbstract:
SMACK è uno stack composto da un insieme di software open source che possono essere utilizzati per sviluppare applicazioni distribuite. I componenti dello stack sono: Spark, un framework per effettuare calcolo distribuito, Mesos, serve per gestire e coordinare le risorse del cluster, Akka, una libreria che implementa l'architettura basata sul modello ad attori, Cassandra, un gestore di database non relazionale e distribuito e Kafka, una piattaforma di stream processing. Ciascuno di questi componenti è indipendente: ognuno ha le proprie API, una propria configurazione e non interagiscono fra loro.
Lo scopo del progetto è quello di costruire una solida base di partenza su cui sarà possibile progettare e implementare applicazioni che lavorino utilizzando lo stack SMACK. Si vuole realizzare quindi un framework che non contenga logica applicativa, ma che permetta di costruire applicazioni distribuite utilizzando un'architettura già pronta, senza che sia necessario preoccuparsi di come i componenti dello stack interagiscano fra loro e senza dover ricorrere a tecniche di progettazione per lo sviluppo di sistemi distribuiti. Il framework dovrà semplificare al massimo la progettazione del sistema distribuito.
Tramite il framework dovrà essere possibile realizzare applicazioni web-based. L'applicazione potrà interagire con gli utenti attraverso l'architettura REST, un'architettura ideale per i sistemi distribuiti. Il framework dovrà permettere di sviluppare applicazioni elaborate mantenendo bassa la complessità del sistema. Dovranno essere garantite tutte le proprietà di un sistema distribuito, quali la scalabilità, la modularità, la tolleranza agli errori, l'alta affidabilità e la consistenza dei dati, l'efficienza nell'uso delle risorse e le migliori performance. L'applicazione inoltre dovrà essere necessariamente sicura.
27
O'Keefe, Daniel Brian. "Temperature control of a hydrogen fuel cell stack." Tallahassee, Fla. : Florida State University, 2010. http://purl.fcla.edu/fsu/lib/digcoll/undergraduate/honors-theses/2181959.
Full textAbstract:
Thesis (Honors paper)--Florida State University, 2010.<br>Advisor: Dr. John Telotte, Florida State University, College of Engineering, Dept. of Chemical and Biomedical Engineering. Includes bibliographical references.
28
Shilling, Richard Zethward. "A multi-stack framework in magnetic resonance imaging." Diss., Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/33807.
Full textAbstract:
Magnetic resonance imaging (MRI) is the preferred imaging modality for visualization
of intracranial soft tissues. Surgical planning, and increasingly surgical navigation, use
high resolution 3-D patient-specific structural maps of the brain. However, the process of
MRI is a multi-parameter tomographic technique where high resolution imagery competes
against high contrast and reasonable acquisition times.
Resolution enhancement techniques based on super-resolution are particularly well suited
in solving the problems of resolution when high contrast with reasonable times for
MRI acquisitions are needed. Super-resolution is the concept of reconstructing a high resolution
image from a set of low-resolution images taken at dierent viewpoints or foci. The
MRI encoding techniques that produce high resolution imagery are often sub-optimal for
the desired contrast needed for visualization of some structures in the brain.
A novel super-resolution reconstruction framework for MRI is proposed in this thesis.
Its purpose is to produce images of both high resolution and high contrast desirable for
image-guided minimally invasive brain surgery. The input data are multiple 2-D multi-slice
Inversion Recovery MRI scans acquired at orientations with regular angular spacing rotated
around a common axis. Inspired by the computed tomography domain, the reconstruction is
a 3-D volume of isotropic high resolution, where the inversion process resembles a projection
reconstruction problem. Iterative algorithms for reconstruction are based on the projection
onto convex sets formalism. Results demonstrate resolution enhancement in simulated
phantom studies, and in ex- and in-vivo human brain scans, carried out on clinical scanners.
In addition, a novel motion correction method is applied to volume registration using an
iterative technique in which super-resolution reconstruction is estimated in a given iteration
following motion correction in the preceding iteration. A comparison study of our method
with previously published methods in super-resolution shows favorable characteristics of the
proposed approach.
29
Jäger, Christoph. "Minimum aperture Kirchhoff migration with CRS stack attributes." Berlin Logos-Verl, 2005. http://deposit.ddb.de/cgi-bin/dokserv?id=2662763&prov=M&dok_var=1&dok_ext=htm.
Full text
30
Al, Nahas Beshr. "Multichannel Communication in Contiki's Low-power IPv6 Stack." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-201844.
Full textAbstract:
Vast majority of wireless appliances used in household, industry and medical field share the ISM frequency band. These devices need to coexist and thus are challenged to tolerate their mutual interference. One way of dealing with this is by using frequency hopping; where the device changes its radio channel periodically. Consequently, communications will not suffer from the same interference each time; instead, it should be fairer and more stable. This thesis investigates the aforementioned problem in the field of low power wireless sensor networks and Internet of Things where Contiki OS is used. We introduce a low-power pseudo-random frequency-hopping MAC protocol which is specifically characterized as a duty cycled asynchronous sender-initiated LPL style protocol. We illustrate two flavors of the protocol; one that does not use any dedicated channel and another which allows dedicated broadcast channels that can implement frequency-hopping as well. We implement the protocol in C for real hardware and extensively test and evaluate it in a simulated environment which runs Contiki. It proved to work with Contiki's IPv6 stack running RPL (the standardized routing protocol for low power and lossy wireless networks). We compare the performance of the implemented protocol to the singlechannel ContikiMAC with varying levels of interference. Results show a reduction down to 56% less radio-on time (1.50% vs. 3.4%) and 85% less latency (306 ms vs. 2050 ms) in the presence of noise, while keeping a good basecost in noise-free environments with 1.29% radio duty cycle when using 9 channels with no dedicated broadcast channels (vs. 0.80% for single channel) and 252 ms average latency(vs. 235 ms). Moreover, the results show that the multichannel protocol performance metrics converge to almost the same values regardless of the noise level. Therefore, it is recommended as a good alternative to single channel ContikiMAC in real worlddeployments where noise presence is anticipated.
31
Mazraeh, Mohsen. "The resistance of flare stack coatings to corrosion." Thesis, Imperial College London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251829.
Full text
32
Shallow, P. A. "Parallel implementation of an embedded run-time stack." Thesis, University of Sussex, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310237.
Full text
33
Kuo, Chun-Liang. "Drilling of Ti/CFRP/A1 multilayer stack materials." Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/5460/.
Full textAbstract:
Multilayer metallic/composite stacks are increasingly being used in wing and tail plane sections of modern commercial aircraft, with component assembly primarily through mechanical joining, hence the requirement for fixation holes. Currently, the individual material sections (titanium, aluminium and CFRP) are machined independently prior to assembly however; there is growing demand within the industry to produce holes through the stack in a single operation. The research detailed in the thesis involves evaluating the effect of operating parameters, drill geometry, tool materials/coatings and cutting strategy when single shot drilling three-layer Ti/CFRP/Al stacks. Performance was assessed against various process measures including thrust forces/torque, hole accuracy/quality, tool wear/life, burr formation and hole surface integrity (microhardness and microstructure). Statistical design of experiments and associated analysis techniques (main effects plots, ANOVA etc.) were employed to identify the significance of variable factors and preferred operating levels with respect to different responses. Based on the experimental results, a bespoke drill design was formulated, which was validated against current commercially available drills recommended for the drilling of multilayer stacks. Finally, the influence of cutting fluid pressure on temperature and hole quality was investigated.
34
West, Julian 1964. "Permutations with forbidden subsequences, and, stack-sortable permutations." Thesis, Massachusetts Institute of Technology, 1990. http://hdl.handle.net/1721.1/13641.
Full text
35
Lin, Keng-Fan. "Hybrid Analysis for Synthetic Aperture Radar Data Stack." Thesis, Purdue University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10267516.
Full textAbstract:
<p> Demand for the Earth observation has risen in the past few decades. As technology advanced, remote sensing techniques have become more and more essential in various applications, such as landslide recognition, land use monitoring, ecological observation. Among the existing techniques, synthetic aperture radar (SAR) has the advantage of making day-and-night acquisitions in any weather conditions. The characteristics of SAR secure the applicability of delivering reliable measurements over cloudy areas and performing measurement without any external energy source. However, SAR images suffer from lower spatial and spectral resolution compared to the optical ones. The coherent nature of radar signals also results in speckles which make the acquired images noisy. </p><p> To overcome the aforementioned issues, one can consider analyzing a long series of SAR-based observations over the same area. In that sense, spatial correlations of the image pixels can be studied based on similarity of temporal statistics. Adaptive image processing can thus be created. In the past, such an adaptive procedure was only applied for slow movement detection using SAR interferometry (InSAR). For the first time, we propose a full framework that allows processing the SAR images in an adaptive manner without losing the original resolution. This framework, namely Hybrid Analysis for Synthetic Aperture Radar (HASAR), exploits information in single-polarized/multi-temporal data stacks and focuses on two applications: change detection and image classification. Three techniques are developed in this study. First, we propose a new hypothesis testing procedure to identify pixels behaving similarly over time. Compared with conventional methods, the proposed test provides similarity measurements regardless of temporal variabilities and outliers. Its effectiveness paves the way for the following two techniques. Second, we develop an automatic change detection approach which utilizes spatiotemporal observations obtained by the first technique to locate abrupt changes in the imaged areas. Compared with existing methods, this approach does not require parameter-tuning procedures, giving a fully unsupervised solution for multi-temporal change analysis. Last, we deliver an efficient solution for classifying single-polarized datasets. A first-level classifier is implemented to analyze the spatiotemporal observations previously mentioned. Different from any other existing methods, the proposed method does not need polarimetric information for solving the multi-class problem. Its effectiveness greatly improves the added value of the single-polarization datasets. </p><p> Various experiments have been made to test the effectiveness of each proposed technique. First of all, the results from TerraSAR-X datasets in Los Angeles and Hong Kong signify that the proposed testing procedure is able to deliver effective extraction of statistically homogeneous pixels. Next, the detected changes from ERS-02 datasets in Taiwan show good matches with ground truth. Compared with conventional pairwise change analysis, the proposed multi-temporal change analysis provides much more observations that can be used for change analysis. The detected changes can be better located through the temporal statistics. Only historically significant changes will be considered as changes, which greatly reduces the false alarm rate. Finally, the results of multi-class classification from TanDEM-X and COSMO-SkyMed datasets in Los Angeles and Chicago, respectively, reveal high classification accuracies without complicated training procedures. It thus provides an entirely new solution for classifying the single-polarized datasets. By collectively utilizing different attributes (amplitude/coherence), dimensionalities (space/time), and processing approaches (pixel-based/object-based), the HASAR system augments the information content of the SAR data stacks. It, therefore, shows high potentials for continuous Earth monitoring.</p><p>
36
Shukla, Shailja. "The curious case of posts on Stack Overflow." Thesis, Uppsala universitet, Institutionen för informatik och media, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-441577.
Full textAbstract:
Community website for programming related Q&A (Question and Answer), Stack Overflow serves as a popular platform to ask questions and respond from other community members. Over the period, user posts on Stack Overflow have turned into a source of valuable information for programmers and the programming industry. By understanding the essential topic of discussions among developers, new insights found about developers' changing trends and needs. This thesis proposes an analysis of user posts on Stack Overflow to find topics of user posts. Distributed topics in the text content of user posts extracted by using the topic modelling technique. Latent Dirichlet allocation (LDA) is applied for topic discovery and extracted the optimal number of topics. The trend of developer interest derived by combining the view count of questions and discovered topics. Based on the analysis within the thesis's scope, developers discuss topics ranging from programming languages, language runtimes, storage, cloud to networking. Scripting programming languages are more discussed compared to non-scripting languages. Discovered topics consist of several recurring categories, i.e., Web Development, Data management and UI development. According to our findings, Machine Learning is gaining popularity as well as data processing and analytics solutions. Mobile development is another favoured subject among developers. The analysis of research findings has inferred that one technology's popularity also reflects in related technology's popularity trend.
37
Olars, Sebastian. "Analysis of Diameter Log Files with Elastic Stack." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-80770.
Full textAbstract:
There is a growing need for more efficient tools and services for log analysis. A need that comes from the ever-growing use of digital services and applications, each one generating thousands of lines of log event message for the sake of auditing and troubleshooting. This thesis was initiated on behalf of one of the departments of the IT consulting company TietoEvry in Karlstad. The purpose of this thesis project was to investigate whether the log analysis service Elastic Stack would be a suitable solution for TietoEvry’s need for a more efficient method of log event analysis. As part of this investigation, a small-scale deployment of Elastic Stack was created, used as proof of concept. The investigation showed that Elastic Stack would be a suitable tool for the monitoring and analysis needs of TietoEvry. The final version of deployment was, however, not able to fulfill all of the requirements that were initially set out by TietoEvry, however, this was mainly due to a lack of time and rather than limitations of Elastic Stack.
38
Murphy, Maximilian M. "Restricted permutations, antichains, atomic classes and stack sorting." Thesis, University of St Andrews, 2003. http://hdl.handle.net/10023/11023.
Full textAbstract:
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets isomorphic to every countable partial order with finite descending chains. It has attracted the attention of some celebrated mathematicians including Paul Erdős and, due to its close links with sorting devices, Donald Knuth. We compare and contrast two presentations of closed classes that depend on the partial order of involvement: Basis or Avoidance Set, and Union of Atomic Classes. We examine how the basis is affected by a comprehensive list of closed class constructions and decompositions. The partial order of involvement contains infinite antichains. We develop the concept of a fundamental antichain. We compare the concept of 'fundamental' with other definitions of minimality for antichains, and compare fundamental permutation antichains with fundamental antichains in graph theory. The justification for investigating fundamental antichains is the nice patterns they produce. We forward the case for classifying the fundamental permutation antichains. Sorting devices have close links with closed classes. We consider two sorting devices, constructed from stacks in series, in detail. We give a comment on an enumerative conjecture by Ira Gessel. We demonstrate, with a remarkable example, that there exist two closed classes, equinumerous, one of which has a single basis element, the other infinitely many basis elements. We present this paper as a comprehensive analysis of the partial order of permutation involvement. We regard the main research contributions offered here to be the examples that demonstrate what is, and what is not, possible; although there are numerous structure results that do not fall under this category. We propose the classification of fundamental permutation antichains as one of the principal problems for closed classes today, and consider this as a problem whose solution will have wide significance for the study of partial orders, and mathematics as a whole.
39
DeLashmutt, Timothy E. "Modeling a proton exchange membrane fuel cell stack." Ohio : Ohio University, 2008. http://www.ohiolink.edu/etd/view.cgi?ohiou1227224687.
Full text
40
Awai, Herman Tokuo Kealaula. "Double-stack containers changing the image of intermodalism /." Thesis, Monterey, Calif. : Naval Postgraduate School, 1992. http://handle.dtic.mil/100.2/ADA252879.
Full textAbstract:
Thesis (M.S. in Management)--Naval Postgraduate School, March 1992.<br>Thesis Advisors: Brown, David G. ; McMasters, Alan W. "March 1992." Includes bibliographical references (p. 107-110). Also available in print.
41
Chowdhury, Mohammad Ataur Rahman. "Rethinking the I/O Stack for Persistent Memory." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3572.
Full textAbstract:
Modern operating systems have been designed around the hypotheses that (a) memory is both byte-addressable and volatile and (b) storage is block addressable and persistent. The arrival of new Persistent Memory (PM) technologies, has made these assumptions obsolete. Despite much of the recent work in this space, the need for consistently sharing PM data across multiple applications remains an urgent, unsolved problem. Furthermore, the availability of simple yet powerful operating system support remains elusive.
In this dissertation, we propose and build The Region System – a high-performance operating system stack for PM that implements usable consistency and persistence for application data. The region system provides support for consistently mapping and sharing data resident in PM across user application address spaces. The region system creates a novel IPI based PMSYNC operation, which ensures atomic persistence of mapped pages across multiple address spaces. This allows applications to consume PM using the well understood and much desired memory like model with an easy-to-use interface. Next, we propose a metadata structure without any redundant metadata to reduce CPU cache flushes. The high-performance design minimizes the expensive PM ordering and durability operations by embracing a minimalistic approach to metadata construction and management.
To strengthen the case for the region system, in this dissertation, we analyze different types of applications to identify their dependence on memory mapped data usage, and propose user level libraries LIBPM-R and LIBPMEMOBJ-R to support shared persistent containers. The user level libraries along with the region system demonstrate a comprehensive end-to-end software stack for consuming the PM devices.
42
Coogle, John J. "Applying Hierarchical Tag-Topic Models to Stack Overflow." VCU Scholars Compass, 2019. https://scholarscompass.vcu.edu/etd/5713.
Full textAbstract:
Stack Overflow is a question and answer site for programming questions. It has become one of the most widely used resources for programmers, with many programmers accessing the site multiple times per day. A threat to the continued success of Stack Overflow is the ability to efficiently search the site. Existing research suggests that the inability to find certain questions results inunanswered questions, long delays in answering questions, or questions which are unable to be found by future visitors to the site. Further research suggests that questions with poor tag quality are particularly vulnerable to these issues.In this thesis, two approaches are considered for improving tag quality and search efficiency: automatic tag recommendations for question authors, and organizing the existing set of tags in a hierarchy from general to specific for Stack Overflow readers. A hierarchical organization is proposed for it's ability to assist exploratory searches of the site.L2H, a hierarchical tag topic model, is a particularly interesting solution to these approaches because it can address both approaches with the same model. L2H is evaluated in detail on several proposed evaluation criteria to gauge it's fitness for addressing these search challenges on Stack Overflow.
43
Haskins, Michael Sean. "A hypercard stack on exploring single variable equations." CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/1194.
Full text
44
Muhlrad, Katy G. "Model-based design for full-stack robot manipulation." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/123045.
Full textAbstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 60-65).<br>As robotic manipulation research becomes more prevalent, it is crucial to develop clean, modular, and testable systems for researchers to make advances in their fields of expertise without sacrificing usability for others. It is also important to introduce those methods to beginners as they are entering the field, so they can build upon them in novel research. This thesis introduces a framework, informally called the Manipulation System, built using Drake Systems based on work done for the Fall 2018 MIT class Intelligent Robot Manipulation. This thesis also presents the groundwork for performing full-stack robot manipulation tasks and proposes extensions to make the system more usable and accessible to all.<br>by Katy G. Muhlrad.<br>M. Eng.<br>M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
45
Stagge, Hanno. "Steigerung der Verfügbarkeit zellengestützter elektrischer Energiequellen durch Konzepte mit paralleler Schaltungsstruktur am Beispiel der festoxidkeramischen Brennstoffzelle." Clausthal-Zellerfeld Papierflieger-Verl, 2009. http://d-nb.info/1000026655/04.
Full text
46
Mann, Jürgen [Verfasser]. "Extensions and applications of the common-reflection-surface stack method = Erweiterungen und Anwendungen der Common-Reflection-Surface-Stack-Methode / Jürgen Mann." Karlsruhe : KIT-Bibliothek, 2002. http://d-nb.info/1013933168/34.
Full text
47
Bergh, Daniel. "Destackification and Motivic Classes of Stacks." Doctoral thesis, Stockholms universitet, Matematiska institutionen, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-107526.
Full textAbstract:
This thesis consists of three articles treating topics in the theory of algebraic stacks. The first two papers deal with motivic invariants. In the first, we show that the class of the classifying stack BPGLn is the inverse of the class of PGLn in the Grothendieck ring of stacks for n ≤ 3. This shows that the multiplicativity relation holds for the universal torsors, although it is known not to hold for torsors ingeneral for the groups PGL2 and PGL3. In the second paper, we introduce an exponential function which can be viewed as a generalisation of Kapranov's motivic zeta function. We use this to derive a binomial theorem for a power operation defined on the Grothendieck ring of varieties. As an application, we give an explicit expression for the motivic class of a universal quasi-split torus, which generalises a result by Rökaeus. The last paper treats destackification. We give an algorithm for removing stackiness from smooth, tame stacks with abelian stabilisers by repeatedly applying stacky blow-ups. As applications, we indicate how the result can be used for destackifying general Deligne–Mumford stacks in characteristic zero, and to obtain a weak factorisation theorem for such stacks.<br><p>At the time of the doctoral defense, the following papers were unpublished and had a status as follows: Paper 1: Manuscript. Paper 2: Manuscript. Paper 3: Manuscript.</p>
48
Lindberg, Joel. "Utvärdera och dokumentera tekniker för frontend-utveckling vid B3." Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-36304.
Full textAbstract:
This essay describes the work to document and evaluate tools for front-end development at the company B3 Consulting Group. The methods that are evaluated is AMP-stack and JAM-stack. AMP-stack uses Apache, MySQL and PHP, Wordpress is used to build with that method. JAM-stack uses JavaScript, API and Markup, for that method GatsbyJS and Contentful is used. The evaluation is done both through user tests and how the methods are percived from a developer perspective. The project also includes work with customers at the company the project is done, Wordpress is used for those web pages.<br>Denna rapport beskriver arbetet med att dokumentera och utvärdera verktyg för frontend-utveckling vid företaget B3 Consulting Group. Metoderna som utvärderas är AMP-stack och JAM-stack. AMP-stack bygger på Apache, MySQL och PHP, för att bygga med den metoden har Wordpress använts. JAMstack bygger på JavaScript, API samt Markup, för den metoden har GatsbyJS samt Contentful använts. Utvärdering sker både genom användartester och hur metoderna upplevs ur ett utvecklarperspektiv. I arbetet ingår även arbete med kunder till företaget projektet utförts hos, för deras webbplatser har Wordpress använts.
49
Fusté, Vilella David. "Mstack: a communications stack for mobile ad-hoc networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/80380.
Full textAbstract:
Les xarxes mòbils ad-hoc, també conegues com a MANETs, han estat des de fa ja molt temps objectiu d'estudi per part de
la comunitat científica. No obstant això, la seva importància dins el món de la indústria és encara molt baix. Aquests tipus de
xarxes, formades per dispositius mòbils tals com smartphones o portàtils, poden ser usades per exemple en entorns
mòbils com els campus universitaris, els centres de conferència, o en les indústries militars, de seguretat ciutadana, etc.
Per poder establir comunicacions fiables entre els diferents dispositius d'una MANET fa falta un stack de comunicacions.
Des de sempre, la comunitat científica ha basat els seus esforços en optimitzar l'stack de comunicacions TCP/IP, l'stack per
excel·lència en la majoria de les xarxes actuals. Enlloc de dissenyar un nou stack de comunicacions, els científics han
intentat adaptar i millorar les solucions ja existents provinents del món de les xarxes cablejades. Nosaltres, en canvi, creiem
que un nou stack de comunicacions específicament dissenyat per a les MANETs és indispensable si el que volem és
aconseguir comunicacions fiables en aquest tipus de xarxes, les quals tenen propietats molt diferents a les de les xarxes
cablejades. En aquesta tesi presentem el que avui en dia encara no existeix: un nou stack de comunicacions
específicament dissenyat per MANETs. Aquest stack és un exemple de com molts dels mecanismes usats en el món de les
xarxes cablejades han de ser redissenyats des de la seva base si del que es tracta és de dissenyar protocols per a xarxes
mòbils ad-hoc. En definitiva, nosaltres creiem que els resultats presentats en aquesta tesi demostren el potencial d'aquest
nou stack de comunicacions per a les MANETs.<br>Mobile ad-hoc networks have received considerable attention in the wireless communications research community.
Nevertheless, its importance in industry is still low. Self-organized MANETs of smartphones or laptops can be used, for
example, in military, public safety and disaster relief, conference, or campus environments. In order to enable
communications between nodes inside a MANET, a communications stack is needed in each node of the network. Research
in this area was always focused on optimizing the TCP/IP stack, the stack par excellence in the majority of our current
networks. Instead of designing a complete new communications stack, researchers focused their work mainly on improving
already existing solutions coming from the wired networks. However, we think that a complete and new communications
stack specifically designed for MANETs is needed if we want to achieve robust communications in this type of networks,
which have properties very different from what wired networks have. In this thesis we present what nowadays is still missing:
a novel communications stack specifically designed for mobile ad-hoc networks. The MStack is an example of how some of
the basic assumptions and mechanisms used in wired or wireless infrastructure networks must be fundamentally modified
when dealing with MANETs. All in all, we believe that the results presented in this thesis provide interesting insights into the
potential of the MStack in MANETs.
50
Chen, Yuening. "Web Call SDK : SIP Stack in Web Container Component." Thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-98266.
Full textAbstract:
<p>The Internet and the Web are the dominant communication methods nowadays. There is also a trend in using web technology to replace or supplant the more traditional communication methods, for example using the internet to make Voice over IP telephone calls.</p><p>This thesis proposes an efficient solution to integrate VoIP/SIP call controlfunctionality into Web containers. It presents the communication convergence of Web technology, VoIP networks, and PSTN circuit switched (CS) networks.</p><p>The Web Call Software Development Kit (SDK) is the implementation of thissolution. It consists of three sub-projects: a SIP Call Control Component, a web application, and a Java ME Client Application. Using the SDK it is possible to easily implement SIP call functionality in Java EE web containers and other Java applications.</p>