Managing HSE risks in the Barents Sea offshore projects: approaches of Norwegian regulators and Eni Norge in Goliat operations

Masteroppgave i Energy management - Nord universitet, 201

Sketched Answer Set Programming

Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Answer Set Programming (SkASP), aiming at supporting the user in resolving this issue. The user writes an ASP program while marking uncertain parts open with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. The sketched model is rewritten into another ASP program, which is solved by traditional methods. As a result, the user obtains a functional and reusable ASP program modelling her problem. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karp's 21 NP-complete problems and demonstrate a use-case for a database application based on ASP.Comment: 15 pages, 11 figures; to appear in ICTAI 201

Hybrid ASP-based Approach to Pattern Mining

Detecting small sets of relevant patterns from a given dataset is a central challenge in data mining. The relevance of a pattern is based on user-provided criteria; typically, all patterns that satisfy certain criteria are considered relevant. Rule-based languages like Answer Set Programming (ASP) seem well-suited for specifying such criteria in a form of constraints. Although progress has been made, on the one hand, on solving individual mining problems and, on the other hand, developing generic mining systems, the existing methods either focus on scalability or on generality. In this paper we make steps towards combining local (frequency, size, cost) and global (various condensed representations like maximal, closed, skyline) constraints in a generic and efficient way. We present a hybrid approach for itemset, sequence and graph mining which exploits dedicated highly optimized mining systems to detect frequent patterns and then filters the results using declarative ASP. To further demonstrate the generic nature of our hybrid framework we apply it to a problem of approximately tiling a database. Experiments on real-world datasets show the effectiveness of the proposed method and computational gains for itemset, sequence and graph mining, as well as approximate tiling. Under consideration in Theory and Practice of Logic Programming (TPLP).Comment: 29 pages, 7 figures, 5 table

Method and tools for automated end-to-end testing of applications for sailfish OS

The automated end-to-end testing of applications allows to detect regressions early during the development and provide solid foundation for future modifications. However, implementation of such tests for mobile applications on Sailfish OS platform is related to some issues, especially when the application contain custom QML components written in C++. In the paper the authors present a method to resolve these issues, including two approaches to provide custom QML types in the testing environment and corresponding architectural considerations that make the code testable. The authors also describe an open source tool for running end-to-end tests on the integration server that supports the described method and supplements tooling of the Sailfish OS SDK

Mechanism for robust dataflow operation on smart spaces

Smart Space applications could use different architectures during their operations. The dataflow network pattern allows to modularize the system and provide seamless support for replaceable components. One of information sources for ubiquitous environments are the sensors, whose readings are processed by a number of computational units. The sensors and processing nodes together form the dataflow network. In this paper we describe the implementation of asynchronous dataflow network on top of RDF store. Possible causes of dataflow disruption are discussed. The mechanism for maintaining network operation when data processing unit looses connection with RDF store is proposed. The corresponding modification of node operation is provided

Возрастная динамика нормальных древостоев ольхи серой в таежной зоне северо-востока европейской части России

Для организации, планирования и ведения лесного хозяйства на научной основе в насаждениях с преобладанием и участием ольхи серой (Alnus incana (L.) Moench), сформировавшихся в условиях таежной зоны, необходимы достоверные данные о строении, росте и продуктивности древостоев. В настоящее время ощущается острая необходимость в разработке таблиц хода роста для насаждений ольхи серой, так как площади, занятые этой породой, значительно увеличились в результате зарастания заброшенных сельскохозяйственных угодий. Разработка единой системы нормативных и справочных материалов для учета количества, оценки состояния и объема использования насаждений ольхи серой на Европейском Севере России является важной и актуальной задачей. Таблицы хода роста для нормальных древостоев ольхи серой в таежной зоне северо-востока европейской части России ранее не разрабатывались. Цель данного исследования – изучение возрастной динамики нормальных древостоев ольхи серой и составление таблиц хода роста. Использованы 193 модельных дерева ольхи серой, а также данные 175 пробных площадей. Полнота – 1,0. Получены уравнения для определения средней высоты, диаметра и запаса насаждений по классам бонитета. На основе уравнений разработаны таблицы хода роста нормальных древостоев по классам бонитета. Предложенные таблицы будут способствовать повышению точности таксации лесов, дадут возможность объективно оценить лесосырьевые ресурсы наиболее представленных древостоев, прогнозировать их рост при выполнении комплекса работ по охране, защите и воспроизводству лесных ресурсов, повышению экологических функций леса, а также контролировать ведение хозяйства в древостоях. Для цитирования: Третьяков С.В., Коптев С.В., Карабан А.А., Парамонов А.А., Давыдов А.В. Возрастная динамика нормальных древостоев ольхи серой в таежной зоне северо-востока европейской части России // Изв. вузов. Лесн. журн. 2023. № 6. С. 70–80. https://doi.org/10.37482/0536-1036-2023-6-70-8

Search for dark matter produced in association with bottom or top quarks in √s = 13 TeV pp collisions with the ATLAS detector

A search for weakly interacting massive particle dark matter produced in association with bottom or top quarks is presented. Final states containing third-generation quarks and miss- ing transverse momentum are considered. The analysis uses 36.1 fb−1 of proton–proton collision data recorded by the ATLAS experiment at √s = 13 TeV in 2015 and 2016. No significant excess of events above the estimated backgrounds is observed. The results are in- terpreted in the framework of simplified models of spin-0 dark-matter mediators. For colour- neutral spin-0 mediators produced in association with top quarks and decaying into a pair of dark-matter particles, mediator masses below 50 GeV are excluded assuming a dark-matter candidate mass of 1 GeV and unitary couplings. For scalar and pseudoscalar mediators produced in association with bottom quarks, the search sets limits on the production cross- section of 300 times the predicted rate for mediators with masses between 10 and 50 GeV and assuming a dark-matter mass of 1 GeV and unitary coupling. Constraints on colour- charged scalar simplified models are also presented. Assuming a dark-matter particle mass of 35 GeV, mediator particles with mass below 1.1 TeV are excluded for couplings yielding a dark-matter relic density consistent with measurements