Исследование по разработке методики определения микроконцентраций висмута в олове высокой чистоты методом амальгамной полярографии с накоплением

All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately

Профиль российской бедности: факторы и риски для работающего населения

Выявлены факторы и соответствующие им риски возникновения бедности среди работающего населения России. Доказывается, что причины возникновения бедности лежат в плоскости экономического развития страны: особенностей прохождения экономических циклов на волне спада и кризиса, качества экономического роста на волне подъема. Выработаны направления стратегии качественного экономического роста страны для преодоления бедности работающего населения

High-level Counterexamples for Probabilistic Automata

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the system's states, both of which are of limited use in manual debugging. Many probabilistic systems are described in a guarded command language like the one used by the popular model checker PRISM. In this paper we describe how a smallest possible subset of the commands can be identified which together make the system erroneous. We additionally show how the selected commands can be further simplified to obtain a well-understandable counterexample

Осуществление связи вузовской науки Сибири с производством и инновационных мероприятий в 70-80-е гг. ХХ в.

Отражаются проблемы, касающиеся интеграции вузовской науки Сибири с производством в 70-80-е гг. ХХ в. Анализируется деятельность институтов и университетов региона по развитию и укреплению основных организационных форм содружества науки с производством: хозяйственных договоров, комплексных творческих бригад, шефства ученых и инженеров над рабочими, участия научно-педагогических работников в консультациях на предприятиях и научно-технической пропаганде

Extending Neural Network Verification to a Larger Family of Piece-wise Linear Activation Functions

In this paper, we extend an available neural network verification technique to support a wider class of piece-wise linear activation functions. Furthermore, we extend the algorithms, which provide in their original form exact respectively over-approximative results for bounded input sets represented as start sets, to allow also unbounded input set. We implemented our algorithms and demonstrated their effectiveness in some case studies.Comment: In Proceedings FMAS 2023, arXiv:2311.0898

An open structural operational semantics for an object-oriented calculus with thread classes

In this report we present a multithreaded class-calculus featuring \emph{thread classes.} From an observational point of view, considering classes as part of a component makes instantiation a possible interaction between component and environment or observer. For thread classes it means that a component may create external activity, which influences what can be observed. The fact that cross-border instantiation is possible requires that the \emph{connectivity} of the objects needs to be incorporated into the semantics. We extend our prior work not only by adding thread classes, but also in that thread names may be \emph{communicated,} which means that the semantics needs explicitly account for the possible acquaintance of objects with threads. This report formalizes a calculus featuring thread classes, i.e., its syntax, type system, and operational semantics. We furthermore discuss observational aspects of thread classes

Comparing Two Approaches to Include Stochasticity in Hybrid Automata

Different stochastic extensions of hybrid automata have been proposed in the past, with unclear expressivity relations between them. To structure and relate these modeling languages, in this paper we formalize two alternative approaches to extend hybrid automata with stochastic choices of discrete events and their time points. The first approach, which we call decomposed scheduling, adds stochasticity via stochastic races, choosing random time points for the possible discrete events and executing a winner with an earliest time. In contrast, composed scheduling first samples the time point of the next event and then the event to be executed at the sampled time point. We relate the two approaches regarding their expressivity and categorize available stochastic extensions of hybrid automata from the literature.Comment: This paper is accepted for publication (without appendix) in the Proceedings of the 2023 International Conference on Quantitative Evaluation of Systems (QEST). The appendix was part of the submission and provides additional material which is not included in the QEST publicatio

Accelerating Parametric Probabilistic Verification

We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters. Our algorithm is based on two key ingredients: a graph decomposition into strongly connected subgraphs combined with a novel factorization strategy for polynomials. Experimental evaluations show that these approaches can lead to a speed-up of up to several orders of magnitude in comparison to existing approache

FMplex: A Novel Method for Solving Linear Real Arithmetic Problems

In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the worst-case complexity from doubly to singly exponential. The adaption of the procedure for SMT solving has strong correspondence to the simplex algorithm, therefore we name it FMplex. Besides the theoretical foundations, we provide an experimental evaluation in the context of SMT solving