On Gaussian approximation of the strength of Daniels' bundle with brittle Weibull fibers

The paper deals with the classical fiber bundle model with brittle Weibull fibers and equal load sharing. This model is significant for the strength of fibrous materials and composites, and the generally random strength of quasi-brittle structures. The model is also relevant for the analysis of the reliability of various parallel systems (computer components, infrastructure etc.). An improved closed-form Gaussian approximation of the standard deviation of bundle strength is presented and compared with accurate solution calculated by recursive formula proposed by Daniels. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A heuristic approach for dividing graphs into bi-connected components with a size constraint

In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. The proposed randomized algorithm consists of growing several subgraphs in parallel. The quality of solutions generated in this way is further improved using a local search which exploits neighboring relations between the subgraphs. In order to evaluate the performance of the method, an algorithm for generating pseudo-random unit disc graphs with known optimal solutions is created. Computational experiments have also been conducted on graphs representing electrical distribution systems for the real-world problem of dividing them into a system of fault tolerant interconnected microgrids. The experiments show that the proposed method frequently manages to find optimal solutions and has an average error of only a few percent to known optimal solutions. Further, it manages to find high quality approximate solutions for graphs having up to 10,000 nodes in reasonable time.     

Global infimum of strictly convex quadratic functions with bounded perturbations

The problem of minimizing [(f)\tilde]=f+p{\tilde f=f+p} over some convex subset of a Euclidean space is investigated, where f(x) = x ^T Ax + b ^T x is strictly convex and |p| is only assumed to be bounded by some positive number s. It is shown that the function [(f)\tilde]{\tilde f} is strictly outer γ-convex for any γ > γ*, where γ* is determined by s and the smallest eigenvalue of A. As consequence, a γ*-local minimal solution of [(f)\tilde]{\tilde f} is its global minimal solution and the diameter of the set of global minimal solutions of [(f)\tilde]{\tilde f} is less than or equal to γ*. Especially, the distance between the global minimal solution of f and any global minimal solution of [(f)\tilde]{\tilde f} is less than or equal to γ*/2. This property is used to prove a roughly generalized support property of [(f)\tilde]{\tilde f} and some generalized optimality conditions.     

Novel numerical techniques for the finite moment log stable computational model for European call option

Option pricing models are often used to describe the dynamic characteristics of prices in financial markets. Unlike the classical Black–Scholes (BS) model, the finite moment log stable (FMLS) model can explain large movements of prices during small time steps. In the FMLS, the second-order spatial derivative of the BS model is replaced by a fractional operator of order α which generates an α-stable Lévy process. In this paper, we consider the finite difference method to approximate the FMLS model. We present two numerical schemes for this approximation: the implicit numerical scheme and the Crank–Nicolson scheme. We carry out convergence and stability analyses for the proposed schemes. Since the fractional operator routinely generates dense matrices which often require high computational cost and storage memory, we explore three methods for solving the approximation schemes: the Gaussian elimination method, the bi-conjugate gradient stabilized method (Bi-CGSTAB) and the fast Bi-CGSTAB (FBi-CGSTAB) in order to compare the cost of calculations. Finally, two numerical examples with exact solutions are presented where we also use extrapolation techniques to achieve higher-order convergence. The results suggest that the proposed schemes are unconditionally stable and convergent, and the FMLS model is useful for pricing options.     

A new sinusoidal shear deformation theory for bending,buckling, and vibration of functionally graded plates

A new sinusoidal shear deformation theory is developed for bending, buckling, and vibration of functionally graded plates. The theory accounts for sinusoidal distribution of transverse shear stress, and satisfies the free transverse shear stress conditions on the top and bottom surfaces of the plate without using shear correction factor. Unlike the conventional sinusoidal shear deformation theory, the proposed sinusoidal shear deformation theory contains only four unknowns and has strong similarities with classical plate theory in many aspects such as equations of motion, boundary conditions, and stress resultant expressions. The material properties of plate are assumed to vary according to power law distribution of the volume fraction of the constituents. Equations of motion are derived from the Hamilton’s principle. The closed-form solutions of simply supported plates are obtained and the results are compared with those of first-order shear deformation theory and higher-order shear deformation theory. It can be concluded that the proposed theory is accurate and efficient in predicting the bending, buckling, and vibration responses of functionally graded plates.     

Ranking and unranking planar embeddings

In this paper, we give a formula for computing the number of different planat embeddings of any planar biconnected graph. The enumeration method used in deriving the formula readily gives rise to efficient algorithms for the ranking, unranking and random generation of embeddings of the given graph. We also give linear time algorithms for checking planarity and constructing any particular embedding.     

Microwave-assisted ruthenium-catalyzed olefin metathesis under solvent-free conditions

An efficient method for ring-closing metathesis under solvent-free conditions and by microwave activation was established. Non-thermal microwave specific effects were evident.     

Enantioselective synthesis without discrete optically active additives

By an adaptation of the asymmetric autocatalysis reactions of Soai, it was found that small enantiomeric excesses may be amplified to an arbitrary extent. When this process was applied 48 times to reactions in the absence of discrete optically active additives, all ultimately afforded substantial optical activity in the product. However, observations strongly suggest that most (and likely all) of these reactions are not true examples of absolute asymmetric synthesis. Rather, the ultimate optical activity arises from optically active impurities. Trace amounts of optically active materials may dominate the outcome of reactions involving asymmetric autocatalysis, and in the presence of opposite chiral influences a single enantiomer tends to take over a reaction. The possible implications of these observations to the origin of biological homochirality are noted.