Essays about: "Jonas Höglund"
Showing result 1 - 5 of 6 essays containing the words Jonas Höglund.
-
1. Implementation and Evaluation of Uncertainty Estimation for Advanced Pharmacokinetic Models in DCE-MRI
University essay from Umeå universitet/Institutionen för fysikAbstract : The goal of this report is to develop code in Python that implements and evaluates a multivariate linear error propagation for commonly used DCE-MRI models. Two pharmoacokinetic models (PK-models) were tested; modified Kety model and two-compartment exchange model. READ MORE
-
2. AN ANALYSIS OF A DISTRIBUTED TRACING SYSTEMS EFFECT ON PERFORMANCE Jaeger and OpenTracing API
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : With micro-services and other service oriented architectures gaining more popularity every day, debugging tools specically made for service oriented architectures are also becoming more common. Distributed tracing systems are tools that can be used to debug latency and provide a better understanding about how a systems services communicates with each other among other helpful things. READ MORE
-
3. Optimization combined with process mapping for maximizing product utilization : Investigating the utilization of products in sawmills, a case study
University essay from Mittuniversitetet/Avdelningen för informationssystem och -teknologiAbstract : The handling and utilization of products is an important factor in organization that strive towards and optimal operation, where different methods in the handling of products have a direct effect on the organizations results. This is a case study where a sawmill with a process that is repeated for each new order in the sorting- and packaging of timber. READ MORE
-
4. A comparison of reductions from FACT to CNF-SAT
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNF-SAT), a well-known NP-complete problem. READ MORE
-
5. A comparison of reductions from FACT to CNF-SAT
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNFSAT),a well-known NP-complete problem. READ MORE