A workable nonstandard definition of the Kurzweil-Henstock integral is given via a Daniell integral approach. This allows us to study the HL class of functions from . The theory is recovered together with a few new results.
A special case of a combinatorial theorem of De Bruijn and Erdős asserts that every noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chvátal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces where each nonzero distance equals $1$ or $2$.
A version of Dieudonné theorem is proved for lattice group-valued modular measures on lattice ordered effect algebras. In this way we generalize some results proved in the real-valued case.
This paper presented a new image encryption algorithm. The algorithm includes two steps: first, by using Cubic map and wavelet function to produce the 2D chaotic sequences to scramble the location of pixel points from the image, then using DNA sequence and chaotic sequence produced by Logistic chaotic map to disturb the gray of the pixel points from image. The experimental results and security analysis show that our algorithm can get good encryption effect, has widest secret key's space, strong sensitivity to secret key, and has the ability of resisting exhaustive attack and statistic attack.
We give a new proof of the Weiss conjecture for analytic semigroups. Our approach does not make any recourse to the bounded
$H^{\infty }$-calculus and is based on elementary analysis.
BL-algebras, introduced by P. Hájek, form an algebraic counterpart of the basic fuzzy logic. In the paper it is shown that BL-algebras are the duals of bounded representable DRl-monoids. This duality enables us to describe some structure properties of BL-algebras.
Stacie Friend’s theory of fiction departs from those approaches that seek to identify the necessary and sufficient conditions for a work to count as fiction. She argues that this goal cannot really be achieved; instead, she appeals to the notion of genre to distinguish between fiction and nonfiction. This notion is significantly more flexible, since it invites us to identify standard—but not necessary—and counter-standard features of works of fiction in light of our classificatory practices. More specifically, Friend argues that the genre of fiction has the genre of nonfiction—and only that genre—as its contrast class. I will refer to the particular way in which Friend elaborates this claim as the contrast view. I have, nevertheless, the impression that this view unnecessarily narrows down the array of perspectives and attitudes from which we can approach works of fiction. I will thus develop a line of reasoning to the effect that the contrast view should rather be construed as picking out a particular way of relating to works of fiction that lies at the end of a continuum defined by different degrees of reflectivity and estrangement. This implies that the contrast view is false as a general claim about how we experience works of fiction, even though this view may appropriately depict a specific way of approaching such works.
This paper deals with the global position control problem of robot manipulators in joint space, a new family of control schemes consisting of a suitable combination of hyperbolic functions is presented. The proposed control family includes a large class of bounded hyperbolic-type control schemes to drive both position error and derivative action terms plus gravity compensation. To ensure global asymptotic stability of closed-loop system equilibrium point, we propose an energy-shaping based strict Lyapunov function. To verify the efficiency of the proposed control algorithm, an experimental comparative analysis between the well known unbounded linear PD control and three hyperbolic-type control schemes of the proposed family on a three degrees of freedom direct-drive robot manipulator is analysed.
We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\Lambda =A\otimes _k\Sigma $, where $\Sigma $ is a V-ring, i.e. a ring for which every simple module is injective, $k$ a subfield of its centre and $A$ an elementary $k$-algebra. Each simple module $E_j$ gives rise to a quasiprogenerator $P_j=A\otimes E_j$. By a result of K. Fuller, $P_j$ induces a category equivalence from which we deduce that $\text{mod}\Lambda \simeq \coprod _jbad hbox P_j$. As a consequence we can (1) construct for each elementary $k$-algebra $A$ over a finite field $k$ a nonartinian noetherian ring $\Lambda $ such that $\text{mod}A\simeq \text{mod}\Lambda $, (2) find twisted versions $\Lambda $ of algebras of wild representation type such that $\Lambda $ itself is of finite or tame representation type (in mod), (3) describe for certain rings $\Lambda $ the minimal almost split morphisms in $\text{mod} \Lambda $ and observe that almost all of these maps are not almost split in $\text{Mod}\Lambda $.
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not guarantee optimality, but our results indicate surprisingly narrow gaps for such large-scale cases - in most cases significantly outperforming CPLEX. We also demonstrate that general CLSP's can benefit greatly from applying our proposed heuristic.