On the existence and the stability of solutions for higher-order semilinear Dirichlet problems

We investigate the existence and stability of solutions for higher-order two-point boundary value problems in case the differential operator is not necessarily positive definite, i.e. with superlinear nonlinearities. We write an abstract realization of the Dirichlet problem and provide abstract existence and stability results which are further applied to concrete problems.     

Influence of organic modifiers on morphology and crystallization of poly(ϵ‐caprolactone)/synthetic clay intercalated nanocomposites

ε‐caprolactone was polymerized in the presence of neat montmorillonite or organomontmorillonites to obtain a variety of poly(ε‐caprolactone) (PCL)‐based systems loaded with 10 wt % of the silicates. The materials were thoroughly investigated by different X‐ray scattering techniques to determine factors affecting structure of the systems. For one of the nanocomposites it was found that varying the temperature in the range corresponding to crystallization of PCL causes reversible changes in the interlayer distance of the organoclay. Extensive experimental and literature studies on this phenomenon provided clues indicating that this effect might be a result of two‐dimensional ordering of PCL chains inside the galleries of the silicate. Small angle X‐ray scattering and wide angle X‐ray scattering investigation of filaments oriented above melting point of PCL revealed that polymer lamellae were oriented perpendicularly to particles of unmodified silicate, while in PCL/organoclay systems they were found parallel to clay tactoids. Calorimetric and microscopic studies shown that clay particles are effective nucleating agents. In the nanocomposites, PCL crystallized 20‐fold faster than in the neat polymer. The crystallization rate in nanocomposites was also significantly higher than in microcomposite. Further research provided an insight how the presence of the filler affects crystalline fraction and spherulitic structure of the polymer matrix in the investigated systems. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 2350–2367, 2007     

Tracing Possible Structural Asymmetry of Silica Gel Used for Precoating Thin-Layer Chromatography Plates

JPC – Journal of Planar Chromatography – Modern TLC - We have previously described unexpected two-dimensionality in the thin-layer chromatographic separation of pairs of enantiomers of...     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Plasmaneutrino spectrum

The spectrum of the neutrinos produced in the massive photon and longitudinal plasmon decay process has been computed with four levels of approximation for the dispersion relations. Some analytical formulae in the limit cases are derived. Interesting conclusions related to previous calculations of the energy loss in stars are presented. The high energy tail of the neutrino spectrum is shown to be proportional to exp(-E/kT), where E is the neutrino energy and kT is the temperature of the plasma. PACS 97.90.+j; 97.60.-s; 95.55.Vj; 52.27.Ep     

Dynamical dark energy models – dynamical system approach

We study the Friedmann-Robertson-Walker model with dynamical dark energy modelled in terms of the equation of state p _X = w _X (a(z)) ρ _X in which the coefficient w _X is parameterized by the scale factor a or redshift z. We use methods of qualitative analysis of differential equations to investigate the space of all admissible solutions for all initial conditions on the two-dimensional phase plane. We show advantages of representing this dynamics as a motion of a particle in the one-dimensional potential V(a). One of the features of this reduction is the possibility of investigating how typical big rip singularities are in the future evolution of the model. The properties of potential function V can serve as a tool for qualitative classification of all evolution paths. Some important features like resolution of the acceleration problem can be simply visualized as domains on the phase plane. Then one is able to see how large is the class of solutions (labelled by the inset of the initial conditions) leading to the desired property.