University of Maribor

About: University of Maribor is a education organization based out in Maribor, Slovenia. It is known for research contribution in the topics: Population & KEKB. The organization has 3987 authors who have published 13077 publications receiving 258339 citations. The organization is also known as: Univerza v Mariboru.

LISA: An Interactive Environment for Programming Language Development

Abstract: The LISA system is an interactive environment for programming language development. From the formal language specifications of a particular programming language LISA produces a language specific environment that includes editors (a language-knowledgable editor and a structured editor), a compiler/interpreter and other graphic tools. The LISA is a set of related tools such as scanner generators, parser generators, compiler generators, graphic tools, editors and conversion tools, which are integrated by well-designed interfaces.

Measurement of branching fractions and polarization in B → φK(*) decays

Abstract: We present the first measurement of decay amplitudes in $B\ensuremath{\rightarrow}\ensuremath{\varphi}{K}^{*}$ and measurements of branching fractions in $B\ensuremath{\rightarrow}\ensuremath{\varphi}{K}^{(*)}$ decays based on $78.1\text{ }{\mathrm{f}\mathrm{b}}^{\ensuremath{-}1}$ of data recorded at the $\ensuremath{\Upsilon}(4S)$ resonance with the Belle detector at the KEKB ${e}^{+}{e}^{\ensuremath{-}}$ storage ring. The decay amplitudes for the different $\ensuremath{\varphi}{K}^{*0}$ helicity states are measured from the angular distributions of final state particles in the transversity basis. The longitudinal and transverse complex amplitudes are $|{A}_{0}{|}^{2}=0.43\ifmmode\pm\else\textpm\fi{}0.09\ifmmode\pm\else\textpm\fi{}0.04$, $|{A}_{\ensuremath{\perp}}{|}^{2}=0.41\ifmmode\pm\else\textpm\fi{}0.10\ifmmode\pm\else\textpm\fi{}0.04$, $\mathrm{arg} ({A}_{\ensuremath{\parallel}})=\ensuremath{-}2.57\ifmmode\pm\else\textpm\fi{}0.39\ifmmode\pm\else\textpm\fi{}0.09$, and $\mathrm{arg} ({A}_{\ensuremath{\perp}})=0.48\ifmmode\pm\else\textpm\fi{}0.32\ifmmode\pm\else\textpm\fi{}0.06$. The direct $CP$-violating asymmetries are found to be consistent with zero.

Enhancement of pacemaker induced stochastic resonance by an autapse in a scale-free neuronal network

Abstract: An autapse is an unusual synapse that occurs between the axon and the soma of the same neuron. Mathematically, it can be described as a self-delayed feedback loop that is defined by a specific time-delay and the so-called autaptic coupling strength. Recently, the role and function of autapses within the nervous system has been studied extensively. Here, we extend the scope of theoretical research by investigating the effects of an autapse on the transmission of a weak localized pacemaker activity in a scale-free neuronal network. Our results reveal that by mediating the spiking activity of the pacemaker neuron, an autapse increases the propagation of its rhythm across the whole network, if only the autaptic time delay and the autaptic coupling strength are properly adjusted. We show that the autapse-induced enhancement of the transmission of pacemaker activity occurs only when the autaptic time delay is close to an integer multiple of the intrinsic oscillation time of the neurons that form the network. In particular, we demonstrate the emergence of multiple resonances involving the weak signal, the intrinsic oscillations, and the time scale that is dictated by the autapse. Interestingly, we also show that the enhancement of the pacemaker rhythm across the network is the strongest if the degree of the pacemaker neuron is lowest. This is because the dissipation of the localized rhythm is contained to the few directly linked neurons, and only afterwards, through the secondary neurons, it propagates further. If the pacemaker neuron has a high degree, then its rhythm is simply too weak to excite all the neighboring neurons, and propagation therefore fails.

Dynamic instability of cooperation due to diverse activity patterns in evolutionary social dilemmas

Abstract: Individuals might abstain from participating in an instance of an evolutionary game for various reasons, ranging from lack of interest to risk aversion. In order to understand the consequences of such diverse activity patterns on the evolution of cooperation, we study a weak prisoner's dilemma where each player's participation is probabilistic rather than certain. Players that do not participate get a null payoff and are unable to replicate. We show that inactivity introduces cascading failures of cooperation, which are particularly severe on scale-free networks with frequently inactive hubs. The drops in the fraction of cooperators are sudden, while the spatiotemporal reorganization of compact cooperative clusters, and thus the recovery, takes time. Nevertheless, if the activity of players is directly proportional to their degree, or if the interaction network is not strongly heterogeneous, the overall evolution of cooperation is not impaired. This is because inactivity negatively affects the potency of low-degree defectors, who are hence unable to utilize on their inherent evolutionary advantage. Between cascading failures, the fraction of cooperators is therefore higher than usual, which lastly balances out the asymmetric dynamic instabilities that emerge due to intermittent blackouts of cooperative hubs.

Challenges and Directions in Formalizing the Semantics of Modeling Languages

Abstract: Developing software from models is a growing practice and there exist many model-based tools (e.g., editors, interpreters, debuggers, and simulators) for supporting model-driven engineering. Even though these tools facilitate the automation of software engineering tasks and activities, such tools are typically engineered manually. However, many of these tools have a common semantic foundation centered around an underlying modeling language, which would make it possible to automate their development if the modeling language specification were formalized. Even though there has been much work in formalizing programming languages, with many successful tools constructed using such formalisms, there has been little work in formalizing modeling languages for the purpose of automation. This paper discusses possible semantics-based approaches for the formalization of modeling languages and describes how this formalism may be used to automate the construction of modeling tools.