Accuracy and CPU time of JE-TLM,PLRC-TLM and CRC-TLM methods for plasma medium

The current density (JE), the piecewise linear recursive convolution (PLRC) and the constant convolution recursive (CRC) techniques are developed and integrated into the transmission line matrix (TLM) algorithm. A comparison of these three schemes according to the criteria of accuracy and CPU time is presented. Numerical experiments show that JE provides the most accurate solution and requires the least CPU time; PLRC is nearly as accurate but consumes more CPU time than CRC.     

How good is CuAAC “click” chemistry for polymer coupling reactions?

¹H NMR and SEC analyses are used to investigate the overall efficiency of Copper Catalyzed Azide Alkyne Cycloaddition (CuAAC) “click” coupling reactions between alkyne‐ and azide‐terminated polymers using polystyrene as a model. Quantitative convolution modeling of the entire molecular weight distribution is applied to characterize the outcomes of the functional polymer synthesis reactions (i.e., by atom transfer radical polymerization), as well as the CuAAC coupling reaction. Incomplete functionality of the azide‐terminated polystyrene (∼92%) proves to be the largest factor compromising the efficacy of the CuAAC coupling reaction and is attributed primarily to the loss of terminal bromide functionality during its synthesis. The efficiency of the S_N2 reaction converting bromide to azide was found to be about 99%. After taking into account the influence of non‐functional polymer, we find that, under the reaction conditions used, the efficiency of the CuAAC coupling reaction determined from both techniques is about 94%. These inefficiencies compromise the fidelity and potential utility of CuAAC coupling reactions for the synthesis of hierarchically structured polymers. While CuAAC efficiency is expected to depend on the specific reaction conditions used, the framework described for determining reaction efficiency does provide a means for ultimately optimizing the reaction conditions for CuAAC coupling reactions. © 2017 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2018 , 56, 75–84     

The Construction of DNA Logic Gates Restricted to Certain Live Cells Based on the Structure Programmability and Aptamer-Cell Affinity of G-Quadruplexes

DNA computation is considered a fascinating alternative to silicon-based computers; it has evoked substantial attention and made rapid advances. Besides realizing versatile functions, implementing spatiotemporal control of logic operations, especially at the cellular level, is also of great significance to the development of DNA computation. However, developing simple and efficient methods to restrict DNA logic gates performing in live cells is still a challenge. In this work, a series of DNA logic gates was designed by taking full advantage of the diversity and programmability of the G-quadruplex (G4) structure. More importantly, by further using the high affinity and specific endocytosis of cells to aptamer G4, an INHIBIT logic gate has been realized whose operational site is precisely restricted to specific live cells. The design strategy might have great potential in the field of molecular computation and smart bio-applications.     

Finite tchebycheff transformations of generalized functions

By using Hilbert space techniques, the finite Tchebycheff transformations of the first and the second kind are defined on appropriate spaces of generalized functions. The inversion theorems are established and some operation transform formulas are obtained. These results are applied in solving certain distributional differential equations.     

Flexible composition and execution of large scale applications on distributed e-infrastructures

Computer simulation is finding a role in an increasing number of scientific disciplines, concomitant with the rise in available computing power. Marshalling this power facilitates new, more effective and different research than has been hitherto possible. Realizing this inevitably requires access to computational power beyond the desktop, making use of clusters, supercomputers, data repositories, networks and distributed aggregations of these resources. The use of diverse e-infrastructure brings with it the ability to perform distributed multiscale simulations. Accessing one such resource entails a number of usability and security problems; when multiple geographically distributed resources are involved, the difficulty is compounded. In this paper we present a solution, the Application Hosting Environment,³ which provides a Software as a Service layer on top of distributed e-infrastructure resources. We describe the performance and usability enhancements present in AHE version 3, and show how these have led to a high performance, easy to use gateway for computational scientists working in diverse application domains, from computational physics and chemistry, materials science to biology and biomedicine.     

Stable blow-up dynamics in the -critical and -supercritical generalized Hartree equation

We study stable blow-up dynamics in the generalized Hartree equation with radial symmetry, which is a Schrödinger-type equation with a nonlocal, convolution-type nonlinearity: First, we consider the -critical case in dimensions and obtain that a generic blow-up has a self-similar structure and exhibits not only the square root blowup rate , but also the log-log correction (via asymptotic analysis and functional fitting), thus, behaving similarly to the stable blow-up regime in the -critical nonlinear Schrödinger equation. In this setting, we also study blow-up profiles and show that generic blow-up solutions converge to the rescaled , a ground state solution of the elliptic equation . We also consider the -supercritical case in dimensions . We derive the profile equation for the self-similar blow-up and establish the existence and local uniqueness of its solutions. As in the NLS -supercritical regime, the profile equation exhibits branches of nonoscillating, polynomially decaying (multi-bump) solutions. A numerical scheme of putting constraints into solving the corresponding ordinary differential equation is applied during the process of finding the multi-bump solutions. Direct numerical simulation of solutions to the generalized Hartree equation by the dynamic rescaling method indicates that the is the profile for the stable blow-up. In this supercritical case, we obtain the blow-up rate without any correction. This blow-up happens at the focusing level , and thus, numerically observable (unlike the -critical case). In summary, we find that the results are similar to the behavior of stable self-similar blowup solutions in the corresponding settings for the nonlinear Schrödinger equation. Consequently, one may expect that the form of the nonlinearity in the Schrödinger-type equations is not essential in the stable formation of singularities.     

On log-normal convolutions: An analytical–numerical method with applications to economic capital determination

We put forward an efficient algorithm for approximating the sums of independent and log-normally distributed random variables. Namely, by combining tools from probability theory and numerical analysis, we are able to compute the cumulative distribution functions of the just-mentioned sums to a high precision and in a relatively short computing time. We illustrate the effectiveness of the new method in the contexts of the individual and collective risk models, aggregate economic capital determination, and economic capital allocation.     

ON CERTAIN CLASS OF MEROMORPHIC FUNCTIONS WITH POSITIVE COEFFICIENTS

In the present investigation we define a new class of meromorphic functions on the punctured unit disk △*:= {z ∈ C : 0 < |z| < 1} by making use of the generalized Dziok-Srivastava operator H l m [α1 ]. Coefficient inequalities, growth and distortion inequalities, as well as closure results are obtained. We also establish some results concerning the partial sums of meromorphic functions and neighborhood results for functions in new class.