|
|
Computer Identification Using JavaScript Timestamps
Jireš, Michal ; Večeřa, Vojtěch (referee) ; Polčák, Libor (advisor)
This thesis deals with remote computer identification based on its internal clock skew. This clock skew will be determined using JavaScript timestamps. The goal of this thesis is to create web page, that will use clock skew to identify computer. This web page will also be used to test time distortion capabilities of browser extension JavaScript Restrictor. Web page will try to identify computer using different security presents thus testing their efficiency.
|
|
|
Simulation of rings surrounding the progenitor of SN1987A
Jireš, Michal ; Pejcha, Ondřej (advisor) ; Calderón Espinoza, Diego Nicolas (referee)
SN1987A, the first supernova visible by the naked eye since 1600s, is anomalous by existence of preexisting triple ring nebula around it. One candidate explanation of the nebula is a binary merger of SN1987A's progenitors. This was already modelled in previous work with smoothed-particle hydrodynamics code GADGET. This thesis aims to replicate this model using mesh-based hydrodynamics code Athena++ and compare it. We focus on ejected mass per latitude distribution and total ejected mass. 1
|
|
|
Incremental link-time optimization in GNU Compiler Collection
Jireš, Michal ; Hubička, Jan (advisor) ; Jambor, Martin (referee)
Modern compilers attempt to optimize programs as much as possible. One such significant effort is Link-Time Optimization (LTO). LTO takes the whole program as accessible to a linker, and performs global optimizations that are impossible in previously local compilations. Because of the global nature, LTO must be performed in full in each compilation, which results in long compile times even in edit-compile cycles. Incremental compilation can reduce compile times of edit-compile cycles by reusing unchanged objects. This thesis aims to implement incremental compilation for Link-Time Optimizations of GNU Compiler Collection, specifically of local transformation phase. We implement incremental compilation by caching files of compilation units of local transformation. For best success of incremental compilation we also aim to minimize number of changed compilation units after small edit. We achieve this in two ways. First, we create better partitioning strategy, that concentrates the changes into fewer compilation units. Second, we analyzed sources of divergence and, if easily possible, removed them. That includes stabilizing values and fixing streaming and inter-procedural optimizations to increase their robustness against small edits. Both without influencing quality of the final binary. 1
|
|
|
Finding Attack Pattern from NetFlow Data
Jireš, Michal ; Podermański, Tomáš (referee) ; Grégr, Matěj (advisor)
This thesis deals with detection of possible attacks in computer networks and subsequent generation of the most specific rules used for filtration. The goal of this thesis is to create tool, that will analyze incoming NetFlow data and will try to detect ongoing attacks. If there is ongoing attack detected, the tool will generate the most specific rules, based on recent NetFlow history, that can be used to filter packets associated with the attack.
|
|
|
Computer Identification Using JavaScript Timestamps
Jireš, Michal ; Večeřa, Vojtěch (referee) ; Polčák, Libor (advisor)
This thesis deals with remote computer identification based on its internal clock skew. This clock skew will be determined using JavaScript timestamps. The goal of this thesis is to create web page, that will use clock skew to identify computer. This web page will also be used to test time distortion capabilities of browser extension JavaScript Restrictor. Web page will try to identify computer using different security presents thus testing their efficiency.
|
guest ::
RSS feed.