Search results for "General Mathematics"
showing 10 items of 3795 documents
Attraction in n ‐dimensional differential systems from network regulation theory
2018
On finite groups with many supersoluble subgroups
2017
[EN] The solubility of a finite group with less than 6 non-supersoluble subgroups is confirmed in the paper. Moreover we prove that a finite insoluble group has exactly 6 non-supersoluble subgroups if and only if it is isomorphic to A5 or SL2 (5). Furthermore, it is shown that a finite insoluble group has exactly 22 non-nilpotent subgroups if and only if it is isomorphic to A5 or SL2 (5). This confirms a conjecture of Zarrin (Arch Math (Basel) 99:201 206, 2012).
Selection of the Optimal Algorithm for Real-Time Estimation of Beta Band Power during DBS Surgeries in Patients with Parkinson's Disease
2017
Deep Brain Stimulation (DBS) is a surgical procedure for the treatment of motor disorders in patients with Parkinson’s Disease (PD). DBS involves the application of controlled electrical stimuli to a given brain structure. The implantation of the electrodes for DBS is performed by a minimally invasive stereotactic surgery where neuroimaging and microelectrode recordings (MER) are used to locate the target brain structure. The Subthalamic Nucleus (STN) is often chosen for the implantation of stimulation electrodes in DBS therapy. During the surgery, an intraoperative validation is performed to locate the dorsolateral region of STN. Patients with PD reveal a high power in the β band (frequenc…
Design and protocol of Estrogenic Regulation of Muscle Apoptosis (ERMA) study with 47 to 55-year-old women's cohort : novel results show menopause-re…
2018
Supplemental Digital Content is available in the text
Comparison of Two Solid-Phase Extraction (SPE) Methods for the Identification and Quantification of Porcine Retinal Protein Markers by LC-MS/MS
2018
Proper sample preparation protocols represent a critical step for liquid chromatography-mass spectrometry (LC-MS)-based proteomic study designs and influence the speed, performance and automation of high-throughput data acquisition. The main objective of this study was to compare two commercial solid-phase extraction (SPE)-based sample preparation protocols (comprising SOLAµ
Stability of stationary solutions in models of the Calvin cycle
2017
Abstract In this paper results are obtained concerning the number of positive stationary solutions in simple models of the Calvin cycle of photosynthesis and the stability of these solutions. It is proved that there are open sets of parameters in the model of Zhu et al. (2009) for which there exist two positive stationary solutions. There are never more than two isolated positive stationary solutions but under certain explicit special conditions on the parameters there is a whole continuum of positive stationary solutions. It is also shown that in the set of parameter values for which two isolated positive stationary solutions exist there is an open subset where one of the solutions is asym…
Networks Describing Dynamical Systems
2018
Abstract We consider systems of ordinary differential equations that arise in the theory of gene regulatory networks. These systems can be of arbitrary size but of definite structure that depends on the choice of regulatory matrices. Attractors play the decisive role in behaviour of elements of such systems. We study the structure of simple attractors that consist of a number of critical points for several choices of regulatory matrices.
A continuous time tug-of-war game for parabolic $p(x,t)$-Laplace type equations
2019
We formulate a stochastic differential game in continuous time that represents the unique viscosity solution to a terminal value problem for a parabolic partial differential equation involving the normalized $p(x,t)$-Laplace operator. Our game is formulated in a way that covers the full range $1<p(x,t)<\infty$. Furthermore, we prove the uniqueness of viscosity solutions to our equation in the whole space under suitable assumptions.
Design aspects of rating scales in questionnaires
2018
Packing colorings of subcubic outerplanar graphs
2018
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…