Modification of Polylactide Nonwovens with Carbon Nanotubes and Ladder Poly(silsesquioxane)

Electrospun nonwovens of poly(L-lactide) (PLLA) modified with multiwall carbon nanotubes (MWCNT) and linear ladder-like poly(silsesquioxane) with methoxycarbonyl side groups (LPSQ-COOMe) were obtained. MWCNT and LPSQ-COOMe were added to the polymer solution before the electrospinning. In addition, nonwovens of PLLA grafted to modified MWCNT were electrospun. All modified nonwovens exhibited higher tensile strength than the neat PLA nonwoven. The addition of 10 wt.% of LPSQ-COOMe and 0.1 wt.% of MWCNT to PLLA increased the tensile strength of the nonwovens 2.4 times, improving also the elongation at the maximum stress.     

The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

Nonlinear frequency response analysis: a recent review and perspectives

The nonlinear frequency response analysis (NFRA) can be seen as an extension of electrochemical impedance spectroscopy. NFRA gives a full and detailed representation of the system response and can establish a connection between model parameters and the experimentally observed phenomena. In this article, different theoretical NFRA approaches and the most recent application examples are discussed. A simple electrochemical example is used to showcase the benefits and disadvantages of analyzing the system response by using different approaches. In addition, it was shown how to extract experimental harmonic values and analyze them.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Stability of vertices in random boolean cellular automata

Based on computer simulations, Kauffman (Physica D, 10, 145-156, 1984) made several generalizations about a random Boolean cellular automaton which he invented as a model of cellular metabolism. Here we give the first rigorous proofs of two of Kauffman's generalizations: a large fraction of vertices stabilize quickly, consequently the length of cycles in the automaton's behavior is small compared to that of a random mapping with the same number of states; and reversal of the states of a large fraction of the vertices does not affect the cycle to which the automaton moves.