Telecommunication systems are today among the largest and most heterogeneous computer systems that exist. The functionality offered by them is rapidly increasing, by numerous features: call waiting, credit-card billing and call-forwarding to name a few. The realisation of extra services poses a challenge to implementors, in particular since different services are developed at different times and places, by different people. Not only is the number and complexity of services increasing but some vendors want to enable users to tailor their own services and ultimately design them entirely. This of course calls for rigorous control of the services so that they do not come into conflict with the interest of the vendors, other users or surprise the users with their behaviours. One way of aiding the service designers is to provide a service creation environment containing a set of well defined building blocks that would be uniform for all features, irrespective of vendor or service. Such an environment also needs tool support for writing, checking, validating and analysing for possible conflicts. We have constructed a formalism for compactly specifying the interface behaviour of the switching and service logic system underlying a service creation environment, and for specifying the behaviour of components of an environment for service creation. For this formalism we supply tool support in the form of a simulator. We have further made a formalisation, in our framework, of the ITU-T Intelligent Network model, Capability Set-1. The formalisation concerns both the underlying service architecture, in which service logic is perform by a dedicated Service Control Function, and the component language, in which Service Independent Building Blocks are composed to yield new services.

Nowadays, hardware designers want to get a powerful and friendly tool to speedup the design flow and design quality. The new development suit NoGap is pro-posed to meet those requirements. NoGap is a design automation tool for ASIP,it helps users to focus on the design stage, free them from module connection andsignal assignment, or integration. Different from the normal ADL tools which limitusers’ design ideas to some template frameworks, NoGap allow designers to im-plement what they want with NoGap Common Language (NoGapCL). However,NoGap is still not perfect, some important functionalities are lacking, but withthe flexible generator component structure, NoGap and NoGapCL can easily beextended.This thesis will firstly investigate the structure of Novel Generator of Acceler-ators and Processors (NoGap) from software prospective view, and then present anew NoGap generator, OpCode Assignment Generator (OpAssignGen), which al-lows users to assign operation code values, exclude operation codes and customizethe operation code size or instruction size.A simple example based on the Microprocessor without Interlocked PipelineStages (MIPS) instructions sets will be mentioned to give users a brief view ofhow to use OpAssignGen. After that, the implementation of the new generatorwill be explained in detail.What’s more, some of NoGap’s flaws will be exposed, but more suggestionsand improvements for NoGap will be given.At last, a successful synthesis result based on the simple MIPS hardware im-plementation will be shown to prove the new generator is well implemented. Moreresults and the final conclusion will be given at the end of the thesis.

No description available.

When you are creating new software today, more often than not you will use API’s. Users choosing between different API’s would probably look at functionality but also accessibility and ease of use. It would therefore seem motivated for API providers to create usable and accessible API’s.This thesis is about the things that make an API more usable, and then those things are used in practice to increase the usability of CloudMe’s API. CloudMe’s core API is documented to increase usability and a wrapper for the API is developed to allow people more ways to use CloudMe’s service. The APIwrapper is created in Java and was developed thoroughly with regards to usability.

This thesis presents the design, implementation, and evaluation of Flow Java, a programming language for the implementation of concurrent programs. Flow Java adds powerful programming abstractions for automatic synchronization of concurrent programs to Java. The abstractions added are single assignment variables (logic variables) and futures (read-only views of logic variables). The added abstractions conservatively extend Java with respect to types, parameter passing, and concurrency. Futures support secure concurrent abstractions and are essential for seamless integration of single assignment variables into Java. These abstractions allow for simple and concise implementation of high-level concurrent programming abstractions. Flow Java is implemented as a moderate extension to the GNU GCJ/libjava Java compiler and runtime environment. The extension is not speci c to a particular implementation, it could easily be incorporated into other Java implementations. The thesis presents three implementation strategies for single assignment variables. One strategy uses forwarding and dereferencing while the two others are variants of Taylor's scheme. Taylor's scheme represents logic variables as a circular list. The thesis presents a new adaptation of Taylor's scheme to a concurrent language using operating system threads. The Flow Java system is evaluated using standard Java benchmarks. Evaluation shows that in most cases the overhead incurred by the extensions is between 10% and 50%. For some pathological cases the runtime increases by up to 150%. Concurrent programs making use of Flow Java's automatic synchronization, generally perform as good as corresponding Java programs. In some cases Flow Java programs outperform Java programs by as much as 33%. / <p>QCR 20161026</p>

QC 20101201

Processor performance has increased far faster than memories have been able to keep up with, forcing processor designers to use caches in order to bridge the speed difference. This can increase performance significantly for programs that utilize the caches efficiently but results in significant performance penalties when data is not in cache. One way to mitigate this problem is to to make sure that data is cached before it is needed using memory prefetching. This thesis focuses on different ways to perform prefetching in systems with strict area and energy requirements by evaluating a number of prefetch techniques based on performance in two programs as well as metrics such as coverage and accuracy. Both data and instruction prefetching are investigated. The studied techniques include a number of versions of next line prefetching, prefetching based on stride identification and history as well as post-increment based prefetching. While the best increase in program performance is achieved using next 2 lines prefetching it comes at a significant energy cost as well as drastically increased memory traffic making it unsuitable for use in energy-constrained applications. RPT-based prefetching on the other hand gives a good balance between performance and cost managing to improve performance by 4% and 7% for two programs while keeping the impact on both area and energy minimal.

Det har aldrig varit lika viktigt som idag att ta hänsyn till internetanvändarens flyktiga uppmärksamhet. Konsten att bevara denna uppmärksamhet är lika komplex som den är ung, och varje dag formuleras nya verktyg för just detta ändamål. Denna rapport ämnar undersöka hur man som webbdesigner kan utforma en webbapplikation som uppnår bra navigerbarhet och därmed god användbarhet, i syfte att inte förlora användares uppmärksamhet. Författarna av denna text utvecklade en webbapplikation i syfte att skaffa sig ett verktyg att kunna nyttja i experiment som ämnar svara på frågan. Efter en serie experiment med användare som testar webbapplikationen har författarna lyckats påvisa och mäta värdet hos webbapplikationselement såsom navigeringsfält, tilläggslänkar och sökfunktioner och deras effekt på webbapplikationen.

Creating an artificial intelligence that can play games such as chess against humans has become a popular subject of research with it’s roots in the 1950’s. Over the following 70 years, strategies and algorithms evolved to the point where the average computer using the state of the art chess AI easily beats the best humans players. This was not always the case, as it took until 1997 for the then current reigning world champion Garry Kasparov to lose to the chess engine Deep Blue. In this thesis a survey over the different techniques developed and refined over time in chess AI along with their strengths and weaknesses are presented. Finally, an implementation of a chess engine built for the purpose of this thesis project will be presented.

I den här studien har en inventering av alla korskopplingsrum på Folktandvården Stockholm utförts. Målet var att ta reda på hur många av Folktandvårdens switchar som behövde bytas ut samt till vilken modell de skulle bytas ut. Resultatet blev att det är 49 stycken switchar som behövde bytas ut. Enligt denna studie skulle den nya modellen på switcharna vara av märket Cisco Catalyst 9300 då den visade sig vara mest lämplig samt kostnadseffektiv. I studien skulle även ett förslag på bättre organisering för de olika korskopplingsskåpen utföras så att ett mer effektivt och tidsbesparande arbetssätt kan tillämpas på klinikerna. Resultatet för detta finns beskrivet i form av en instruktion som ska publiceras på Folktandvårdens intranät så att de IT-ansvariga på klinikerna kan ta del av den.