to demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the banach-zareckitheorem is presented on the basis of the radon-nikodym theoremwhich emphasizes on measure-type properties of the lebesgueintegral. the banach-zarecki theorem says that a real-valuedfunction $f$ is absolutely continuous on a finite closed intervalif and only if it is continuo...

This letter addresses the problem of fetal electrocardiogram (FECG) extraction. A class of source extraction algorithms is proposed, which uses a combination of two different approaches: Barros’s source extraction approach and Hyvärinen’s fixedpoint approach. The proposed algorithms can rapidly extract the desired FECG with little noise, and can work well in some bad situations. The validity an...

This paper is devoted to the study of the following nonlocal p -Laplacian functional differential equation −φp(x′(t)) )′ = λ f (t,x(t),x ′ (t)) (∫ 1 0 f (s,x(s),x′ (s))ds )n , 0 < t < 1, subject to multi point boundary conditions. We obtain some results on the existence of at least one (when n ∈ Z+ ) or triple (when n = 0) pseudo-symmetric positive solutions by using fixedpoint theory in cone. ...

Within the framework of exact renormalization group flow equations, a scale-dependent transformation of the field variables provides for a continuous translation of UV to IR degrees of freedom. Using the gauged NJL model as an example, this translation results in a construction of partial bosonization at all scales. A fixedpoint structure arises which makes it possible to distinguish between fu...

SystemC is a new C-based system level design language whose ultimate objective is to enable System-on-a-Chip (SoC) design and verification. Fixed-point design based on the SystemC data types is rapidly becoming the standard for optimizing DSP systems. In this paper, we propose to create a formalization of SystemC fixed-point arithmetic in the HOL theorem proving environment. The SystemC fixedpo...

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For exampl...

Digital linear filters are used in a variety of applications (sound treatment, control/command, etc.), implemented in software, in hardware, or a combination thereof. For safety-critical applications, it is necessary to bound all variables and outputs of all filters. We give a compositional, effective abstraction for digital linear filters expressed as block diagrams, yielding sound, precise bo...

Taking Löb's Axiom in modal provability logic as a running thread, we discuss some general methods for extending modal frame correspondences, mainly by adding fixedpoint operators to modal languages as well as their correspondence languages. Our suggestions are backed up by some new results – while we also refer to relevant work by earlier authors . But our main aim is advertizing the perspecti...

this paper gives a short survey of some of the known results generalizing the theorem, credited to i. schur, that if the central factor group is finite then the derived subgroup is also finite.

in this paper, after reviewing some results in minimal space, some new results in this setting are given. we prove a generalized form of the fan-kkm typetheorem in minimal vector spaces. as some applications, the open type of matching theorem and generalized form of the classical kkm theorem in minimal vector spaces are given.