On diagonal resolvable spheres

In this paper we give the complete answer to a question posed by A. Arhangel?skii and prove that the sphere Sⁿ$S^n$ is diagonal resolvable if and only if Sⁿ$S^n$ is an H  -space if and only if n∈{0,1,3,7}$n\in \{0,1,3,7\}$. Moreover, we prove that any upper half even dimensional Q$\mathbb{Q}$-sphere cannot be diagonal resolvable.     

Immersions of spheres and algebraically constructible functions

Let Λ be an algebraic set and let (n is even) be a polynomial mapping such that for each there is r(λ) > 0 such that the mapping g _λ  =  g(· , λ) restricted to the sphere S ⁿ (r) is an immersion for every 0  <  r  <  r (λ), so that the intersection number I(g _λ|S ⁿ (r)) is defined. Then is an algebraically constructible function. I. Karolkiewicz and A. Nowel supported by the grant BW/5100-5-0286-7.     

Graph algorithms for DNA sequencing – origins,current models and the future

With the ubiquitous presence of next-generation sequencing in modern biological, genetic, pharmaceutical and medical research, not everyone pays attention to the underlying computational methods. Even fewer researchers know what were the origins of the current models for DNA assembly. We present original graph models used in DNA sequencing by hybridization, discuss their properties and connections between them. We also explain how these graph models evolved to adapt to the characteristics of next-generation sequencing. Moreover, we present a practical comparison of state-of-the-art DNA de novo assembly tools representing these transformed models, i.e. overlap and decomposition-based graphs. Even though the competition is tough, some assemblers perform better and certainly large differences may be observed in hardware resources utilization. Finally, we outline the most important trends in the sequencing field, and try to predict their impact on the computational models in the future.     

On the Generalized Strongly Nil-Clean Property of Matrix Rings

Let R be an associative unital ring and not necessarily commutative.We analyze conditions under which every n × n matrix A over R is expressible as a sum A =E1 +…+ Es + N of (commuting) idempotent matrices Ei and a nilpotent matrix N.     

Multi-dimensional scalar balance laws with discontinuous flux

We consider scalar balance laws with a dissipative source term. The flux function may be discontinuous with respect to both the space variable x and the unknown quantity u. We formulate the definition of entropy weak solutions and provide existence and uniqueness to the considered problem. The problem is formulated in the framework of multi-valued mappings. The notion of entropy measure-valued solutions is used to prove the so-called contraction principle and comparison principle.     

Convergence of a finite difference method for the time-fractional diffusion equation with concentrated capacity

We investigate the convergence of difference scheme for the time-fractional differential equation with fractional derivative of an order with the coefficient at the time derivative containing Dirac delta distribution. Convergence order of is proved. A numerical example demonstrates the theoretical results. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Unified encoding for hyper-heuristics with application to bioinformatics

This paper introduces a new approach to applying hyper-heuristic algorithms to solve combinatorial problems with less effort, taking into account the modelling and algorithm construction process. We propose a unified encoding of a solution and a set of low level heuristics which are domain-independent and which change the solution itself. This approach enables us to address NP-hard problems and generate good approximate solutions in a reasonable time without a large amount of additional work required to tailor search methodologies for the problem in hand. In particular, we focused on solving DNA sequencing by hybrydization with errors, which is known to be strongly NP-hard. The approach was extensively tested by solving multiple instances of well-known combinatorial problems and compared with results generated by meta heuristics that have been tailored for specific problem domains.     

Temperature-sensitive behaviour of poly(glycidol)-b-poly(N-isopropylacrylamide) block copolymers

Temperature-sensitive poly(glycidol)-b-poly(N-isopropylacrylamide) block copolymers (PGl₅₅PNIPAAm_y) were synthesised and their aqueous solutions investigated by different methods including differential scanning calorimetry (DSC), UV-VIS spectroscopy as well as dynamic and static light scattering. The cloud point temperature (T _c) depended on the composition of the investigated block copolymers and increased with decreasing length of the PNIPAAm block in PGl₅₅PNIPAAm_y copolymers. In contrast, the enthalpy of phase separation of PNIPAAm segments measured by DSC decreased with decreasing length of the PNIPAAm block in the polymer. These findings can be correlated with the behaviour of homo-PNIPAAm with similar molecular weights indicating that the influence of PGl on the local environment and phase separation of PNIPAAm chains is similar to the influence observed for PNIPAAm chains bearing different low molecular weight end group. Using DLS measurement, it was shown that the aggregation process depended on the PGl/PNIPAAm block ratio. If the PGl/PNIPAAm ratio was low, stable core-shell aggregates were formed. In contrast, the tendency to formation of large unstable, loose aggregates was observed for copolymers with high PGl/PNIPAAm ratio.