Behovet av att lagra stora mängder data för applikationer växer mer och mer. I samband med detta ökar även utvecklingen av olika sorters databaser, speciellt så kallade ”NoSQL”-databaser. Det kan vara svårt att navigera i denna uppsjö av databaslösningar för att hitta den databaslösning som passar bäst för ett specifikt projekt. Denna rapport försöker utreda vilken av databaserna OrientDB, ArangoDB samt HypergraphDB som passar bäst för ett specifikt användningsfall där data ska sparas för att representera en byggnadsstruktur. Kriterierna för undersökningen är hur organisationen bakom databasen ser ut, hur deras datamodeller ser ut, vilka prismodeller de erbjuder samt en empirisk undersökning av databasernas prestanda för det specifika användningsfallet. Denna undersökning är inte designad för att vara en generell jämförelse utan görs på uppdrag av ett företag för att se vilken databas som skulle passa deras specifika projekt bäst. Utredningen visar att det är en komplex uppgift att utföra rättvisa prestandajämförelser för olika ”NoSQL”-databaser men baserat på kriterierna i denna rapport skulle OrientDB passa bäst för det specifika användningsfallet. / The need to store large quantities of data is increasing more and more. In correlation to this the development of various kinds of databases, especially so-called ”NoSQL”-databases, is also increasing. It can be difficult to navigate in this plethora of database solutions to find the the database that best suits a specific project. This report attempts to investigate which of the databases OrientDB, ArangoDB and HypergraphDB is best suited for a specific use case where data is to be saved to represent a building structure. The criteria for the investigation are how the organization behind the database looks, how their datamodels looks, which price models they offer as well as an emperical study of the databases’ performance in the specific use case. This survey is not designed to be a general comparison, but is commissioned by a company to see which database would suit their specific project best. The investigation shows that it’s a complex task to do fair comparisons on performance between NoSQL databases but based on the criteria in this report OrientDB would be best suited for the specific use case.

In this thesis a subject mapping data mining method has been developed. The method maps the 8 political parties in the Swedish parliament to 25 subjects based on their participation in the subjects on Twitter. The method is based on tweets written by the commissioners in the Swedish parliament and the ministers in the Swedish government between 2018-04-01 and 2019-04-01. The method shows what subjects each party participate in on Twitter and how the participation changes over time. Further, it shows the similarity and dynamics between the parties according to their subject participation. The purpose of the method is to offer a quantitative analysis tool, useful to social scientist, that provides new information about political parties.It can not be concluded how the resulting findings from the method should be interpreted. However, I present three questions to investigate in future work. The questions regard correlation between the subject map and party cooperation, political spectra and public statements.The result indicate that there is a significance issue, due to low participation in certain subjects by specific parties. This issue can be resolved by decreasing the number of subjects or expand the data set on which the subject mapping is based.

Sentiment analysis is a field within the area of natural language processing that studies the sentiment of human written text. Within sentiment analysis, sentiment classification is a research area that has been of growing interest since the advent of digital social-media platforms, concerned with the classification of the subjective information in text data. Many studies have been conducted on sentiment classification, producing numerous of openly available tools and resources that further advance research, though almost exclusively for the English language. There are very few openly available Swedish resources that aid research, and sentiment classification research in non-English languages most often use English resources one way or another. The lack of non-English resources impedes research in other languages and there is very little research on sentiment classification using Swedish resources. This thesis addresses the lack of knowledge in this area by designing and implementing a sentiment classifier using Swedish resources, in order to evaluate how methods and best practices commonly used in English research transfer to Swedish. The results in this thesis indicate that Swedish resources can be used in the construction of internationally competitive sentiment classifiers and that methods commonly used in English research for pre- processing text data may not be optimal for the Swedish language.

No description available.

The following bachelor thesis is written by a student at New Media Design within Informatics at the School of Engineering, Jönköping University. The background of this study is based on the emergence of web design trends brutalism and antidesign, which have been argued to originate from styles used during early periods of the web’s history. Furthermore, a lack of cultural analysis within web design has been identified. The visual evolution of the world wide web is not sorted into distinct and widely acknowledged periods or categories such as is the case with most other cultural areas like music and art. The emergence and popularity of brutalism and antidesign were identified as potential cases of visual styles returning from the past. They were therefore considered opportunities to examine visual periods in web design and predict where the field is heading in the future. The study was conducted using the qualitative method of semi-structured interviews. The empirical data was analysed using a thematic analysis and was later compared with theories derived from literature studies. The study found three reasons behind the rise of brutalism and antidesign in web design; the world wide web’s coming of age, reactions towards the mainstream web and the interest in retro trends. The study also aimed to find the possible implications of their emergence on the aesthetic evolution of web design.  It was found that brutalism and antidesign are part of a large number of experimental and retro trends that will continue to emerge. Though they are unlikely to directly affect mainstream web design in its current state, they may be seen as design movements. This may be viewed as a step in the direction of visual categories within web design.

This study addresses load balancing algorithms for networked systems with microservices architecture. In microservices applications, functionality and logic have been split into small pieces referred to as services. Such divisions allow for higher levels of scalability and distributivity than obtainable for more classical architectures where functionality and logic is packaged into large non-separable applications. As a first step, we investigate existing load balancing algorithms in the literature. A conclusion reached from this literature survey is that there is a lack of proposed load balancing algorithms for microservices, and it is not obvious how to adapt such algorithms to the architecture under consideration. In particular, many existing algorithms incorporate queues, which should be avoided for microservices, where the small services should be provided in fast manner. Hence, we provide modified and new candidates for load balancing, where one such is a probabilistic approach including a distribution that is a function of service providers' load. The algorithms are implemented in microservices simulation environment developed in Erlang by Ericsson AB. We consider a range of scenarios for evaluation, where amongst other things, we vary the number of service consumers and providers. To evaluate the load balancing algorithms, we perform statistical analysis, where first and second order moments are computed for relevant metrics under the different scenarios considered. A conclusion drawn from the results is that the algorithm referred to as "Round Robin" performed best according to the results from various simulation scenarios. This study serves as a stepping stone for further investigations. We outline several possible extensions such as more in-depth statistical analysis accounting for the time-varying aspects of the systems (currently omitted), as well other classes of algorithms.

Modeling light scattering is important in diverse reasearch fields such as paper and print, optical tomography, remote sensing and also in computer rendering of im­ages. Particularly in paper and printing industry light scattering simulations play a significant role in understanding the optical response of paper in relation to its properties. Light scattering models are used in paper and print for improving the paper making process, designing new paper qualities, and evaluating printing tech­niques. The models most widely used for light scattering calculations in the paper and printing industry are based on the Kubelka-Munk theory. The theory proposed by Kubelka and Munk, a special case of radiative transfer theory, has several limi­tations and it can only be applied to homogeneous media with isotropic scattering and diffuse illumination. Real paper and print in particular do not satisfy these as­sumptions. These limitations of the Kubelka-Munk model encouraged scientists to develop models based on angle-resolved geometry to account for anisotropic scat­tering of light in paper and print, but in a single spatial dimension. To correctly represent spatial inhomogeneities like ink dots which spread as a function of depth, length and width of the paper, one-dimensional (lD) models are insufficient. In addi­tion to angle-resolved geometry, multi-dimensional models are necessary to analyze light scattering effects in a printed paper. The method used in this thesis, unlike the Kubelka-Munk method employs gen­eral radiative transfer formulation to obtain the reflectances of paper with inhomo­geneities like ink dots. These ink dots printed on plain sheet of paper are consid­ered to spread not only as a function of depth but also as a function of length or width of the paper. First, a numerical solution method comprising of a combination of discrete ordinates and finite differences is developed to solve the general two­dimensional (2D) radiative transfer equation (RTE) with the two dimensions repre­senting the depth and length of the paper. The solver is validated by comparing the results obtained with Monte Carlo simulations adapted to suit paper optics and DORT2002. For isotropic scattering, and for angles close to the normal direction, good agreement is observed among all the three solvers. As the anisotropy factor increases, the present solver needs higher number of radiation streams for conver­gence. The 2D radiative transfer (RT) solver is then applied to printed paper and re­flectances obtained are analyzed. The ink distribution is considered to be non-uniform such that the density of ink decreases linearly with depth. The dots are separated by a distance to study the interference pattern of the intensity distribution which is use­ful in understanding defects like print mottle, print density and optical dot gain. The reflectances obtained are analyzed based on medium parameters such as thickness of the paper sample, its optical parameters and assymetry factor. The illuminating and viewing angles and the depth of ink penetration also influence the optical response and appearance of print. It is observed that the reflectance of dots largely depends on the illuminating and viewing angles with an apparent increase in the size of the dots seen more prominently when viewed across the line. A 2D RT solver is superior in understanding the interference pattern of radiation as observed in the results presented in this thesis, when compared to a lD RT solver. A lD RT solver uses independent columns to approximate the radiation in the lateral direction. It also assumes that the layers in the lateral direction are homogeneous and the radiation from the columns do not interfere with each other. The independent column approximation pays little attention to the lateral variations in intensity. / <p>Vid tidpunkten för framläggningen av avhandlingen var följande delarbete opublicerat: delarbete 1 (manuskript).</p><p>At the time of the defence the following paper was unpublished: paper 1 (manuscript).</p>

No description available.

The phenomenal growth of the Internet of Things (IoT) and popularity of the mobile stations have rapidly increased the demand of WLAN network (known as IEEE 802.11 and WiFi). WLAN is a low-cost alternative of the cellular network and being an unlicensed spectrum to build the master plan of embedding the Internet in everything -&amp;-anywhere. At the same time, monitoring the number of IoT and WiFi-enabled devices across residential and enterprises is not trivial. Therefore, future WiFi network architecture requires an agile management paradigm to provide internal support and security for WiFi networks.The operation of IoT and mobile device applications relies on scalability and high-performance computing of clouds. Cloud computing has completely centralized the current data center networking architecture and it provides computation-intensive, high-speed network, and realtime responses to the requests of IoT. The IoT-to-cloud communication is the essence of network security concerns and it is in grievous need of constant security improvement along the inter-networking. Based on the number of researches and analysis on generated traffic by IoT, it has been observed there are the significant number of massive spoofing-oriented attacks targeting cloud services are launched from compromised IoT.On the basis of reviewing prior researches on mostly-conducted network attacks by IoT, there is a challenging and common characteristic which has been frequently utilized in the numerous massive Internet attacks, known as spoofing. This work will survey the existing proposed solutions which have been deployed to protect both traditional and softwarized network paradigms. Then, it proposes the approach of this work that enables IoT-hosting networks protected by employing Software-defined Wireless Networking (SDWN) within the proposed model to mitigate spoofing -oriented network attacks. In addition, the proposed solution provides the environmental sustainability feature by saving power consumption in networking devices during network operation. The practical improvement in the proposed model is measured and evaluated within the emulated environment of Mininet-WiFi. / Den fenomenala tillväxten av IoT och populariteten hos mobilstationerna har snabbt ökat efterfrågan på WLAN-nätverk (känd som IEEE 802.11 och WiFi). WLAN är ett billigt alternativ för mobilnätet och är ett olicensierat spektrum för att bygga huvudplanen för att bädda in Internet i allt-och-var som helst. Samtidigt är det inte trivialt att övervaka antalet IoT och WiFi-aktiverade enheter över bostäder och företag. Därför kräver framtida WiFi nätverksarkitektur ett smidigt hantering paradigm för att tillhandahålla internt stöd och säkerhet för WiFi-nätverk.Användningen av IoT och mobilanvändningsapplikationer är beroende av skalbarhet och högpresterande beräkningar av moln. Cloud computing har helt centraliserat den nuvarande datacenters nätverksarkitektur och det ger beräkningsintensiva, höghastighetsnätverk och realtidssvar påbegäran från IoT. IoT-till-moln kommunikationen är kärnan i nätverkssäkerhetshänsyn och de har ett allvarligt behov av ständig förbättring och säkerhetshärdning inom deras internätverk. Baserat på antalet undersökningar och analyser av genererad trafik av IoT har det observerats. Det finns det betydande antalet massiva spoofing-orienterade attacker som riktar sig mot molntjänster, lanseras från komprometterad IoT.På grundval av att granska tidigare undersökningar om IoTs mest genomförda nätverksattacker finns det en utmanande och gemensam egenskap som ofta utnyttjats i de många massiva internetattackerna. Detta arbete kommer att undersöka de befintliga lösningarna som har implementerats för att skydda både traditionella och mjukvariga nätverksparadigmer. Därefter föreslår det tillvägagångssättet för detta arbete som möjliggör IoT-värdnät skyddade genom att använda SDWN inom den föreslagna modellen för att mildra poofing-orienterade nätverksattacker. Dessutom erbjuder den föreslagna lösningen miljöhållbarhet genom att spara strömförbrukning i nätverksenheter under nätverksdrift. Den praktiska förbättringen av den föreslagna modellen mäts och utvärderas inom den omgivande miljön av Mininet-WiFi.

According to CAP theorem, strong consistency is usually compromised in the design of NoSQL databases. Poor performance is often observed when strong data consistency level is required, especially when a system is deployed in a geographical environment. In such an environment, servers need to communicate through cross-datacenter messages, whose latency is much higher than message within a data center. However, maintaining strong consistency usually involves extensive usage of cross-datacenter messages. Thus, the large cross-data center communication delay is one of the most dominant reasons, which leads to poor performance of most algorithms achieving strong consistency in a geographical environment. This thesis work proposes a novel data consistency algorithm – I-Write-One-Read-One based on Write-One-Read- All. The novel approach allows a read request to be responded by performing a local read. Besides, it reduces the cross-datacenter-consistency-synchronization message delay from a round trip to a single trip. Moreover, the consistency model achieved in I-Write-One-Read-One is higher than sequential consistency, however, looser than linearizability. In order to verify the correctness and effectiveness of IWrite- One-Read-One, a prototype, MeteoerShower, is implemented on Cassandra. Furthermore, in order to reduce time skews among nodes, NTP servers are deployed. Compared to Cassandra with Write-One-Read-All consistency setup, MeteoerShower has almost the same write performance but much lower read latency in a real geographical deployment. The higher cross-datacenter network delay, the more evident of the read performance improvement. Same as Cassandra, MeteorShower also has excellent horizontal scalability, where its performance grows linearly with the increasing number of nodes per data center.