Parking fines is one of the most common reasons for people being subjected to official testing today and in many cases this happens because the driver has difficulty detecting the parking sign. Roads are changing aswell as traffic signs are renewed or removed, and on previous parking where its been free to park a fee is now charged. Which results in misunderstandings and ambiguities in traffic. Today, there is still no easy-to-access information site where you can find such information about parking spaces or the rules that apply to the particular location on which you are located. Therefore, this application and associated database has been developed, named OK2PARK. The purpose of the application is to facilitate and streamline parking with drivers in whatever city they are. The application contains aids that counteract parking fines and, through a map view, the user can easily see where there are parking spaces in the area and where they are located. With a simple click the user gets the rules and a visual image of the parking sign belonging to the selected parking lot. The user can also choose to have a note on theirs phone about when the parking lot expires. The benefit of the project is to reduce parking fines and increase understanding of parking and parking spaces for drivers.

There has been little published about the characteristics of computer jobs running on modern time-sharing computer systems, due largely to the lack of appropriate programs and equipment necessary to measure the parameters involved. In this thesis, measures are presented for some of the important characteristics of jobs. The Data Collection Facility, which is part of the Michigan Terminal System, was used to this end. The Michigan Terminal System is a time-sharing operating system for the IBM 360/67 computer, and supports batch and terminal users simultaneously. Chapter 1 gives an outline of the problem, and other work which has been done in this line. It also contains a reasonably detailed description of the Michigan Terminal System. In Chapter 2, measurements of requested CPU service, CPU service obtained, system and user response times, I/O delays, and page waiting times are given. Chapter 3 outlines the storage requirements of jobs, and gives a model which will generate profiles of storage required by jobs over their running times, which are very similar to profiles observed for actual jobs. Some discussion of the results is given in chapter 4, and also a simple model of the system is shown which might be used in a simulation study employing measurements taken in this study. / Science, Faculty of / Computer Science, Department of / Graduate

Denna rapports syfte är att med stöd i teori och praktisk kunskap utveckla en webbapplikation för att besvara den aktuella frågeställningen, ”Hur kan en e-butik för annonsplatser designas för att den ska anses trovärdig hos besökarna och vara användbar med avseende på navigerbarhet, innehållets relevans och läsbarhet?”. En litteraturstudie genomfördes och teori sammanställdes för att utgöra en grund för utvecklingen. Arbetsgången följde relevanta teorier och webbapplikationen byggdes med moderna tekniska lösningar. Den slutgiltiga produkten tillhandahåller relevanta funktioner och tillämpningar som sedan testades av ett antal externa testare varpå en enkätundersökning fick besvaras. Utifrån denna data kunde sedan slutsatsen dras att webbapplikationen uppfyllde de krav som ställts för att med grund i teori anses vara en användbar, navigerbar och trovärdig webbapplikation. Den ursprungliga frågeställningen kan således besvaras med denna rapports teori, metod och implementation. / The purpose of this report is to develop a web application to support the current issue, with the aid of theory and practical knowledge, "How should an e-store for ad slots be designed to gain confidence in the visitors and be useful with regard to navigability, relevance of content And readability?". A literature study was conducted and theory compiled to provide a basis for development. The process followed relevant theories and the web application was built with modern technological solutions. The final product provides relevant features and applications, which were then tested by a number of external testers, after which a survey could be answered. Based on this data, it could then be concluded that the web application complied with the requirements that are fundamentally considered to be a useful, navigable and credible web application. The original question can thus be answered with this report's theory, method and implementation.

Spread-spectrum multiple access (SSMA) is conceptually attractive for interactive data communications over broadcast channel shared by a large number of potential users. The present thesis Involves a study of asynchronous direct sequence SSMA interactive data communication systems. The study includes a unified analysis and assessment of system delay-throughput performance. Two important message delay components which are affected by the design of the transmitter/receiver pair result from code acquisition and bit-errors. A new code synchronizer design featuring a number of parallel correlators is developed, and an analysis of synchronizer performance as it relates to SSMA applications is provided. It is shown that average acquisition delay decreases in proportion to Increase In the number of correlators when this number is small. Receiver bit-error probability for any given channel occupancy is derived. Three protocols suitable for SSMA transmissions under different operating conditions are proposed. Using one of these protocols, the expected number of transmissions before a message is received error-free is estimated by averaging bit-error probabilities over a postulated channel occupancy probability distribution. This distribution is verified using data obtained from channel simulations. Delay-throughput characteristics of the SSMA system are thus obtained by evaluating the above delays and other exogenous delays at various traffic levels. Results relevant to the given system and traffic models, transmission protocol, and transmitter/receiver structure are obtained assuming that users' codes are uncorrelated. Subsequently, it is shown that the results are easily modified to account for code cross-correlations. Assessment of SSMA delay-throughput performance Is accomplished by comparisons with pure ALOHA, slotted ALOHA and queueing channels. These comparisons necessitate extension of existing analysis of slotted ALOHA channels to include the effects of Gaussian channel noise, as well as development of an analysis procedure for noisy pure ALOHA channels. It is shown that in power-limited situations, the capacities of ALOHA and queueing channels can be maximized with respect to the transmission bit rate. Delay-throughput comparisons show that at throughput levels much lower than the capacities of these channels, average delays for SSMA are higher than those of the other channels. However, capacities of SSMA channels are generally higher than those of the other channels, which occupy only a fraction of the available bandwidth at power levels favourable to SSMA. In such cases, the throughput which results for a given delay clearly favours SSMA. Comparisons are also performed with respect to m-parallel ALOHA or queueing channels, where ra is the number of channels accommodated by the available bandwidth. In this case the capacities of SSMA channels are generally less than those of m-parallel slotted ALOHA or queueing channels, but approximately equal to those of m-parallel pure ALOHA channels. Therefore, SSMA presents a viable alternative to m-parallel pure ALOHA multiple access for interactive data communications. SSMA is especially favourable for transmissions of long messages In a wide-band broadcast channel with limited power. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

In this thesis, the author pursued two objectives. The first objective was to present a working example of a convenient, "idiot-proof", interactive computer program (designed with the user - not the programmer - in mind). The second objective was to investigate how various types of users interact with the computer, with the intention of reaching some conclusions about which program interfaces were most appropriate and convenient for various user types. In addition, some theories about the effects of various behavioural variables were investigated. The experimental tool used for this research was a simple interactive computer game in which the participants searched for the optimum profit in a three-dimensional space, given a fixed time limit. , Frequent periodic measurements were automatically collected on user performance, attitude, requests for reports, utilization of special features, and other variables; also, the solution protocol of each participant was recorded. The users were cateqorized by coqnitive style (heuristic/analytic), risk attitude, and previous computer experience as determined by a battery of pre-tests and questionnaires. In analyzinq the results, it was found that experience level was the dcminatinq factor on all dimensions: novices were slower, finished less frequently, and were siqnificantly less confident than experienced players. A hiqhly structured proqram interface was found to be more appropriate for these new users., Experience was also the dominating factor in the use of reports, although novices did show a marked learning effect over time - as did all users on most dimensions of performance and behaviour. As previously hypothesized, analytic-types and risk-takers played significantly faster and were more confident than heuristic-types and risk-averters, respectively. Concerning utilization of special program features, it was found that input response defaults influenced users in unfamiliar situations (ones which were new or did not have clear-cut responses), and didn't affect them at all in familiar circumstances. Analytic-types made least use of defaults. Bisk-averters were least likely to abbreviate commands. Also, the extent to which commands were abbreviated depended much upon their length, Finally, in the area of solution protocols, it was indeed found that heuristic-types were much less structured in their approach to solving the problem than analytic-types. . / Business, Sauder School of / Graduate

With the emerging trend of smart IoT devices, providing and ensuring the privacy of the users'-devices interaction relationship is a must; risks such as identifying users' activities and detecting user behavior while at home or in the office. We present a new machine learning attack that exploits network patterns to detect the presence of smart IoT devices, and services generated by these devices in the Wi-Fi radio spectrum. This is considered a major problem when it comes to users' privacy since it allows malicious users to infer on the other users' activities. We perform an extensive measurement campaign for data collection. We build up a model describing the traffic patterns characterizing three popular IoT smart home devices, i.e., Google Nest, Google Chromecast, Amazon Echo, and Amazon Echo Dot. We prove that detecting and identifying with overwhelming probability the presence of the aforementioned devices in a crowded Wi-Fi scenario is possible. Finally, we introduce a mitigation technique to preserve the users' privacy in the network. This work proves that standard encryption techniques alone are not sufficient to protect the privacy of the end-user. In contrast, more work is required to prevent non-trusted third parties to detect and identify the users' devices.

Data Distribution Service (DDS) is a flexible, decentralized, peer-to-peer communication middle-ware. This thesis presents a performance analysis of using DDS in the Toyota Smartness platform that is used inside Toyota’s Autonomous Guided Vehicles (AGVs). The purpose of this thesis is to investigate if DDS is suitable for internal communication between the modules that reside within the Smartness platform.  Several different approaches of how to integrate DDS into the Smartness platform are explored, tests are carried out in regards to how increasing the number of interfaces affect the execution time and system utilization of these implementations. The results of these tests are presented in a multitude of ways to show the effects of DDS, this includes, results of how the performance scales, measurements of how the performance changes over time, and analytical results using linear regression.  Results show that DDS can be utilized in the future development of Smartness, but adds additional overhead to the system which negatively affects Smartness’ ability to keep up with the desired cycle time.

No description available.

Idag är det vanligt att automatisera mer och mer av människors arbete för att spara in tid på repetitiva och tidskrävande arbetsuppgifter. Ett sätt att göra detta på är att utveckla ett användargränssnitt för att samla flera handlingar i t.ex. en knapp. I detta arbete skapas ett verktyg i form av ett användargränssnitt för att automatisera och effektivisera konfigureringen av plattformar i taktiska simuleringar för arbetarna på FOI. Egenskaper och funktionalitet i verktyget specificeras i en kravspecifikation skriven av FOI. Detta verktyg strävar efter en hög användbarhet och bra möjligheter till utbyggbarhet för att möjliggöraframtida tillägg till verktyget av arbetarna på FOI. Arbetet resulterade i ett verktyg som både är användarvänligt och utbyggbart som visade sig vara en förbättring av FOI:s tidigare arbetssätt

With the ever-expanding internet, finding new ways to increase the user experience are vital in order to keeping concurrent users on your web application. One way to achieve this could be to implement a Service Worker to unlock more capabilities of a web application. The purpose of this paper is to evaluate what new security vulnerabilities can arise when implementing a Service Worker. This could then be used to evaluate if the technology has evolved far enough to be used by a wider audience of programmers and users. The analysis in this paper will be presented in a security matrix that is based on four experiments and a complementary literature study on web-based attacks. This paper found that some new vulnerabilities must be considered when implementing a Service Worker in a web application. The worst of these is the Living Outside of Scope, which can be used by an attacker to secretly hijack a victim's computer even when the application is shut down. This paper concludes that the technology has evolved far enough so that a secure web application with the use of the Service Worker is possible, but there are still some new vulnerabilities that can become a problem if not considered.