Search results for "Applied Mathematics"
showing 10 items of 4379 documents
Kinetic models for nucleocytoplasmic transport of messenger RNA
1995
Abstract Much is known about the mechanism by which mRNAs cross the nuclear envelope (the translocation stage of nucleocytoplasmic transport), but far less is known about the preceding (intranuclear migration/release) and succeeding (cytoplasmic binding) stages. Therefore, existing information suffices for articulating detailed kinetic models of translocation, but not models for the overall mRNA transport process. In this paper, we show that simple kinetic models of translocation can (i) accommodate date about nucleocytoplasmic distributions of endogenous transcripts; (ii) predict the overall effects on these distributions of effectors such as insulin and epidermal growth factor; (iii) thro…
(H, ρ)-induced dynamics and the quantum game of life
2017
Abstract We propose an extended version of quantum dynamics for a certain system S , whose evolution is ruled by a Hamiltonian H, its initial conditions, and a suitable set ρ of rules, acting repeatedly on S . The resulting dynamics is not necessarily periodic or quasi-periodic, as one could imagine for conservative systems with a finite number of degrees of freedom. In fact, it may have quite different behaviors depending on the explicit forms of H, ρ as well as on the initial conditions. After a general discussion on this (H, ρ)-induced dynamics, we apply our general ideas to extend the classical game of life, and we analyze several aspects of this extension.
Generalized centro-invertible matrices with applications
2014
Centro-invertible matrices are introduced by R.S. Wikramaratna in 2008. For an involutory matrix R, we define the generalized centro-invertible matrices with respect to R to be those matrices A such that RAR = A^−1. We apply these matrices to a problem in modular arithmetic. Specifically, algorithms for image blurring/deblurring are designed by means of generalized centro-invertible matrices. In addition, if R1 and R2 are n × n involutory matrices, then there is a simple bijection between the set of all centro-invertible matrices with respect to R1 and the set with respect to R2.
Further monotonicity and convexity properties of the zeros of cylinder functions
1992
AbstractLet cvk be the kth positive zero of the cylinder function Cv(x,α)=Jv(x) cos α−Yv sin α, 0⩽α<π, where Jv(x) and Yv(x) are the Bessel functions of the first and the second kind, respectively. We prove that the function v(d2cvkddv2+δ)cvk increases with v⩾0 for suitable values of δ and k−απ⩾ 0.7070… . From this result under the same conditions we deduce, among other things, that cvk+12δv2 is convex as a function of v⩾0. Moreover, we show some monotonicity properties of the function c2vkv. Our results improve known results.
Infinite lie groups of point transformations leaving invariant the linear equation which describes in the hodograph plane the isentropic one-dimensio…
1991
Abstract The group analysis of the hodograph equation which is equivalent to the non-linear system of one-dimensional isentropic gas dynamics reveals the existence of infinite groups of symmetry in correspondence with particular pressure laws. These turn out to be polytropes with selected indices, as is expected, as well as a new type of pressure. In all these cases the hodograph equation can be transformed, by a suitable change of variables, into the wave equationψ ζ = 0.
A remark on differentiable functions with partial derivatives in Lp
2004
AbstractWe consider a definition of p,δ-variation for real functions of several variables which gives information on the differentiability almost everywhere and the absolute integrability of its partial derivatives on a measurable set. This definition of p,δ-variation extends the definition of n-variation of Malý and the definition of p-variation of Bongiorno. We conclude with a result of change of variables based on coarea formula.
Anomaly detection in dynamic systems using weak estimators
2011
Accepted version of an article from the journal: ACM transactions on internet technology. Published version available from the ACM: http://dx.doi.org/10.1145/1993083.1993086 Anomaly detection involves identifying observations that deviate from the normal behavior of a system. One of the ways to achieve this is by identifying the phenomena that characterize “normal” observations. Subsequently, based on the characteristics of data learned from the “normal” observations, new observations are classified as being either “normal” or not. Most state-of-the-art approaches, especially those which belong to the family of parameterized statistical schemes, work under the assumption that the underlying…
On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks
2014
[EN] Flexible channel allocation may be applied to multi-channel cognitive radio networks (CRNs) through either channel assembling (CA) or channel fragmentation (CF). While CA allows one secondary user (SU) occupy multiple channels when primary users (PUs) are absent, CF provides finer granularity for channel occupancy by allocating a portion of one channel to an SU flow. In this paper, we investigate the impact of CF together with CA for SU flows by proposing a channel access strategy which activates both CF and CA and correspondingly evaluating its performance. In addition, we also consider a novel scenario where CA is enabled for PU flows. The performance evaluation is conducted based on…
On groups having a p-constant character
2020
Let G G be a finite group, and p p a prime number; a character of G G is called p p -constant if it takes a constant value on all the elements of G G whose order is divisible by p p . This is a generalization of the very important concept of characters of p p -defect zero. In this paper, we characterize the finite p p -solvable groups having a faithful irreducible character that is p p -constant and not of p p -defect zero, and we will show that a non- p p -solvable group with this property is an almost-simple group.
Degrees of irreducible characters of the symmetric group and exponential growth
2015
We consider sequences of degrees of ordinary irreducible S n S_n - characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of n n with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound.