Diss. (sammanfattning) Uppsala : Uppsala universitet, 2007. / Härtill 4 uppsatser.

abstract: Node proximity measures are commonly used for quantifying how nearby or otherwise related to two or more nodes in a graph are. Node significance measures are mainly used to find how much nodes are important in a graph. The measures of node proximity/significance have been highly effective in many predictions and applications. Despite their effectiveness, however, there are various shortcomings. One such shortcoming is a scalability problem due to their high computation costs on large size graphs and another problem on the measures is low accuracy when the significance of node and its degree in the graph are not related. The other problem is that their effectiveness is less when information for a graph is uncertain. For an uncertain graph, they require exponential computation costs to calculate ranking scores with considering all possible worlds. In this thesis, I first introduce Locality-sensitive, Re-use promoting, approximate Personalized PageRank (LR-PPR) which is an approximate personalized PageRank calculating node rankings for the locality information for seeds without calculating the entire graph and reusing the precomputed locality information for different locality combinations. For the identification of locality information, I present Impact Neighborhood Indexing (INI) to find impact neighborhoods with nodes' fingerprints propagation on the network. For the accuracy challenge, I introduce Degree Decoupled PageRank (D2PR) technique to improve the effectiveness of PageRank based knowledge discovery, especially considering the significance of neighbors and degree of a given node. To tackle the uncertain challenge, I introduce Uncertain Personalized PageRank (UPPR) to approximately compute personalized PageRank values on uncertainties of edge existence and Interval Personalized PageRank with Integration (IPPR-I) and Interval Personalized PageRank with Mean (IPPR-M) to compute ranking scores for the case when uncertainty exists on edge weights as interval values. / Dissertation/Thesis / Doctoral Dissertation Computer Science 2017

The sinus node (SN) is the natural pacemaker of the heart. In the human, the SN is surrounded by the paranodal area (PNA), the function of which is currently unknown. The PNA may act as subsidiary atrial pacemakers (SAP) and become the dominant pacemaker during sinus node dysfunction (SND). Creation of an animal model of SND allows characterisation of SAP, which can be a target for novel treatment strategies other than the currently available electronic pacemakers. I developed a large animal model of SND by ablating the SN in the goat and validated it by mapping the location of the newly emergent SAP. Functional characterisation of the SAP revealed reduced atrioventricular (AV) conduction time consistent with a location of the SAP close to the AV junction. SAP recovery time showed an initially significant prolongation compared to the SN recovery time, followed by a gradual decrease over 4 weeks. SAP pauses, and temporary reliance on electronic pacemaker activity have also been demonstrated then disappeared over time, suggesting possible modulation, maturation of the SAP. Structural characterisation of the SN revealed an extensive pacemaking complex within the right atrium (RA); the SN was surrounded by the PNA, extending down to the inferior vena cava (IVC) and into the interatrial groove. The PNA had a histological appearance that is intermediate to the SN and the RA. 3D reconstruction demonstrated, for the first time in a large animal model, an extensive and almost complete circle of pacemaking tissue at the junction of the embryologically different sinus venosus and the muscular right atrium. The SAP emerged in a location close to the IVC along the crista terminalis. Expression of key ion channel proteins in the SAP showed abundance of the pacemaker channel (HCN4) and the sodium/calcium exchanger (NCX1) compared to RA, similar to the expression pattern of the SN. The expression of the main high conductance connexin (Cx43) was not significantly different between SAP and RA, and both expressed Cx43 more abundantly than the SN.Conclusion: Destruction of the sinus node in this experimental model resulted in the generation of chronic SAP activity in the majority of the animals. The SAP displayed maturation over time and located in the inferior part of the RA, in the same area where the PNA was found in controls, suggesting the role of PNA as the dominant pacemaker in sinus node dysfunction. The SAP in the goat constitutes a promising stable target for electrophysiological modification to construct a fully functioning biological pacemaker.

Syftet med det här arbetet är att undersöka hur överföringstid skiljer sig i förhållande tillskalbarhet mellan två back-endlösningar i LoRaWAN. Lösningarna är Node-RED ochChirpstack. Studien genomförs med hjälp av metoderna experiment och fallstudie. Iexperimentet utfördes ett t-test för att svara på om nollhypotesen kan förkastas eller inte.Resultatet visar att nollhypotesen inte kunde förkastas, och att det inte är någon skillnadi skalbarhet. Bortsett från t-testet visar resultaten att Chirpstack skalar sämre änNode-RED vid fyra eller fler tillagda enheter. Slutsatsen är däremot att skillnaden ärtillräckligt liten för att bedömas obetydlig för val av back-endlösning. Studien ärbegränsad till sju uppkopplade LoRa-enheter. / The purpose of this study is to investigate how transfer time differs in relation toscalability between two back-end solutions in LoRaWAN. The solutions are Node-REDand Chirpstack. The study is carried out using the methods experiment and case study.In the experiment, a t-test was performed to answer whether the null hypothesis can berejected or not. The results show that the null hypothesis could not be rejected, and thatthere is no difference in scalability. Apart from the t-test, the results show that Chirpstackscales worse than Node-RED at four or more added LoRa-units. The conclusion,however, is that the difference is small enough to be considered insignificant for thechoice of back-end solution. The study is limited to seven connected LoRa units.

In a large computer system or in a single personal computer, there are both internal and external threats to the system. For a seasoned user who knows what is important to monitor and which files are sensitive, it is possible to have control over the system. If, on the other hand, it is an inexperienced user or a larger system of several computers, networks, routers, switches and maybe services that are wholly or partly located on the Internet, it is very difficult to monitor the whole system. Where do infringement attempts occur? Did it just happen, or was it a couple of weeks ago? Are repeated login attempts by a specific user to be considered an intrusion? What has happened to the firewall and to the network? Who has queried the database? To monitor the whole system and get answers to these questions, you can use a SIEM system. It is designed to collect data, process and analyze it and present it in a way that is clear to the user. Today, there are SIEM systems on the market with parts of or complete solutions. Depending on what is needed or requested, the cost of these also varies. The report describes how the project is planned and goes through how a SIEM system is constructed and what parts are included. In the project, a SIEM system has been built up with some of the parts found in ready-made solutions today. The focus has been on retrieving data and systematically storing them in a PostgreSQL database. With so many different modules that will interact and work together, most of the time and energy has been spent on the design part of the SIEM system. The programming code is made in Python and Node JS. / I ett stort datorsystem eller i en enskild persondator så finns det både in- terna och externa hot mot systemet. För en van användare som vet vad som är viktigt att övervaka och vilka filer som är känsliga är det möjligt att ha kontroll över systemet. Är det däremot en ovan användare eller ett större system av flera datorer, nätverk, routrar, switchar och kanske tjänster som helt eller delvis ligger ute på Internet så är det väldigt svårt att övervaka hela systemet. Var sker intrångsförsök? Hände det nyss, el- ler var det för ett par veckor sedan? Är upprepade inloggningsförsök från en specifik användare att betrakta som ett intrång? Vad har skett mot brandväggen och mot nätverket? Vem har ställt förfrågningar mot databasen? För att övervaka hela systemet och få svar på dessa frågor går det att använda ett SIEM-system. Ett sådant är uppbyggt för att in- hämta data, behandla och analyser den samt presentera den på ett för användaren överskådligt sätt. Det finns idag SIEM-system på markna- den med delar av eller helt färdiga lösningar. Beroende på vad som be- hövs eller efterfrågas så varierar också kostnaden för dessa. Rapporten beskriver hur projektet är planerat och går igenom hur ett SIEM-system är uppbyggt och vilka delar som ingår. I projektet har ett SIEM-system byggts upp med några av de delar som återfinns i färdiga lösningar idag. Fokus har lagts på inhämtning av data och att på ett systematiskt sätt lagra dessa i en PostgreSQL-databas. Med så många olika moduler som ska samspela och fungera tillsammans har den mesta tiden och energin lagts på konstruktionsdelen av SIEM-systemet. Programmering- en har skett i Python och Node JS.

No description available.

京都大学 / 新制・課程博士 / 博士(医学) / 甲第24281号 / 医博第4897号 / 新制||医||1061(附属図書館) / 京都大学大学院医学研究科医学専攻 / (主査)教授 森田 智視, 教授 妹尾 浩, 教授 波多野 悦朗 / 学位規則第4条第1項該当 / Doctor of Medical Science / Kyoto University / DFAM

No description available.

Einteilung:Das Lungenkarzinom ist eine der häufigsten Krebstodesursachen der Welt. Die chirurgische Therapie mit onkologischer Resektion des Tumors bietet bessere Chancen für einen dauerhaften Therapieerfolg. Die Bedeutung der systematischen Lymphadenektomie im Sinne eines akkuraten Stagings und einer besseren Lokalkontrolle des Tumors ist unumstritten. In der Literatur wurden verschiedene LK-Befallsmuster bei den operierten NSCLC anhand verschiedener histomorphologischer Parameter beschrieben, um letztendlich eine passende Technik der Lymphadenektomie zu entwickeln. Patienten und Methoden: In unserer retrospektiven Studie wurde ein Kollektiv von 111 Patienten mit operierten nicht kleinzelligen Lungenkarzinome zwischen 2008 und 2013 untersucht. Das LK-Metastasierungsmuster wurde anhand verschiedener histomorphologischer Parameter untersucht. Ergebnisse: Eine zentrale Tumorlage, L1-Kategorie, sowie die zunehmende Tumorgröße zeigten eine signifikante Neigung zur LK-Metastasierung. Anhand der Tumorlokalisation im Lungenlappen ließ sich jedoch kein bestimmtes LK- Befallmuster sichern. Schlussfolgerung: Diese Daten unterstützen die Angaben der Literatur, in der eine systematische Lymphadenektomie unabhängig von den anderen Parametern weiter gefordert wird, um ein akkurates Staging zur erreichen und so eine optimale Therapie durchzuführen.fi

Wireless sensor networks are widely applied to many fields such as animal habitat monitoring, air traffic control, and health monitoring. One of the current problems with wireless sensor networks is the ability to overcome communication failures due to hardware failure, distributing sensors in an uneven geographic area, or unexpected obstacles between sensors. One common solution to overcome this problem is to place a minimum number of relay nodes among sensors so that the communication among sensors is guaranteed. This is called Relay Node Placement Problem (RNP). This problem has been proved as NP-hard for a simple connected graph. Therefore, many algorithms have been developed based on Steiner graphs. Since RNP for a connected graph is NP-hard, the RNP for a survivable network has been conjectured as NP-hard and the algorithms for a survivable network have also been developed based on Steiner graphs. In this study, we show the new approximation bound for the survivable wireless sensor networks using the Steiner graphs based algorithm. We prove that the approximation bound is guaranteed in an environment where some obstacles are laid, and also propose the newly developed algorithm which places fewer relay nodes than the existing algorithms. Consequently, the main purpose of this study is to find the minimum number of relay nodes in order to meet the survivability requirements of wireless sensor networks.