Sökning: "joakim andersson kth"
Visar resultat 1 - 5 av 7 uppsatser innehållade orden joakim andersson kth.
1. Why Phishing Works on Smartphones
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Phishing is a form of internet fraud where an attacker attempts to acquire sensitive information from a target by posing as a trustworthy entity. One strategy to fool the target is to create a spoofed (illegitimate copy) of a legitimate website. LÄS MER
2. Lifetime estimation of lithium-ion batteries for stationary energy storage system
Master-uppsats, KTH/Skolan för kemivetenskap (CHE)Sammanfattning : With the continuing transition to renewable inherently intermittent energy sources like solar- and wind power, electrical energy storage will become progressively more important to manage energy production and demand. A key technology in this area is Li-ion batteries. LÄS MER
3. Modeling groundwater flow and PFOS transport. : A case study at the old fire drill site of Bromma Stockholm Airport.
Master-uppsats, KTH/Mark- och vattenteknikSammanfattning : At Bromma Stockholm Airport, fire drills have previously been performed at a location outside the current airport confinements. Fire drills were performed with extinguisher foams containing toxic perfluorooctanesulfonic acid (PFOS), which have polluted the site. Harmful effects of PFOS include but are not limited to damages to the endocrine system. LÄS MER
4. Enzymkatalys av oligomerer från förnyelsebara resurser
Kandidat-uppsats, KTH/Skolan för kemivetenskap (CHE)Sammanfattning : Naturen är en källa till en mängd komplexa molekyler som har potential att användas inom industrin. En del av dessa molekyler kan utvinnas från suberin som bland annat finns i träd och i särskilt hög grad i björknäver. Genom att lösa upp näver i natriumhydroxid kan suberin sönderdelas i mindre beståndsdelar vilka sedan kan extraheras. LÄS MER
5. Counting words avoiding patterns of length three with generating functions
Kandidat-uppsats, KTH/Matematik (Inst.)Sammanfattning : The set of 123-avoiding words with exactly r occurrences of each letter was recently enumerated by N. Shar and D. Zeilberger. This paper enumerates more complicated sets of pattern avoiding words, such as those allowing 1, 2, . LÄS MER