![]() The security of a thousand line smart-phone app depends crucially on the security of several millions of lines of operating system code and libraries.Over the past 5-10 years, researchers have been developing a novel kind of security architecture that addresses this concern. An important source of problems is the size and complexity of infrastructural software one needs to trust to securely run a software application. ![]() The construction of reliable and secure software systems is known to be challenging. In this project, we cooperate with domain experts, analyzing those movement data, in fields ranging from urban design to behavioral ecology.Įnhancing Type Error Diagnosis in Haskell This framework will be applied on spatio-temporal data and movement data. We focus on new metaphors for the presentation and the user interaction with progressive algorithms. The other aim is to design novel mechanisms for this purpose in the visual analytics. These type of algorithms are progressive algorithms. To enable exploration of the data and steer the computation, the user is able to interact with those intermediate results from the algorithm. However, these approaches are currently lacking guarantees on the qualities of the results. One aim of our research is to develop algorithms, such that results with a guaranteed quality are reported in fast responsive rounds. This gives insight into the concrete structure of the problem and the data itself. Interactive visualization helps to detect new patterns by presenting meaningful and interesting information from the data, such that the user can easily analyze the underlying problem space. Nowadays visual analytics approaches enable users to explore structures, patterns and other interesting parts of data. Full version: Ī framework for progressive, user-steered algorithms in visual analytics We also use this characterization to give a O((n + |E|) log² n log log n) expected time algorithm on uniformly distributed points that determines if E is a t-spanner, making it the first subquadratic time algorithm for this problem that does not make assumptions on E. This characterization gives a O(n log² n log² log n) expected time bound on our greedy spanner algorithm, making it the first subquadratic time algorithm for this problem on any interesting class of points. This property implies that if an edge set on these points has t-paths between pairs of points ‘close’ to each other, then it has t-paths between all pairs of points. Our bound for point sets drawn uniformly and independently at random in a square follows from a local characterization of t-spanners we give on such point sets: we give a geometric property that holds with high probability on such point sets. On the theoretical side we prove a near-linear expected time bound on uniform point sets and a near-quadratic worst-case bound. ![]() We give experimental results showing large to massive performance increases over the state-of-the-art on nearly all tests and real-life data sets. We observe that for many point sets, the greedy spanner has many ‘short’ edges that can be determined locally and usually quickly, and few or no ‘long’ edges that can usually be determined quickly using local information and the well-separated pair decomposition. ![]() Unfortunately, all known algorithms for computing it take Ω(n² ) time, limiting its applicability on large data sets. edge count and weight, both in theory and practice) known to be computable in polynomial time. The greedy spanner is the highest quality geometric spanner (in e.g. Modularity concerns at the metamodel level in DSLs: composition of DSLs For the cyber-security programme (8-11 April), please scroll down. Click on the titles of the presentations (if present) for an abstract (if present). The workshop aims to promote the interaction and cohesion with PhD students from other universities on both a social and technical level, provide a hospitable setting in which presentation skills can be demonstrated and improved through constructive feedback by peers, and be fun. Monday 7 April is reserved for the IPA PhD workshop. The programme of the CPS Spring Days is composed by Lejla Batina (RU), Pieter Hartel (UT) and Boris Skoric (TU/e). This year’s Spring Days are dedicated to Cyber-Security, fitting in the Security focus area of the research school for the period 2013-2018. The IPA Spring Days are an annual multi-day event, dedicated to a specific theme of current interest to the research community of IPA.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |