Free in-plane vibration analysis of a curved beam (arch) with arbitrary various concentrated elements

In the existing literature, the information regarding the exact solutions for free in-plane vibrations of the curved beams (or arches) carrying various concentrated elements is rare, particularly for the case with multiple attachments including eccentricities and mass moments of inertias. For this reason, this paper aims at presenting an effective approach to tackle the title problem. First of all, the un-coupled equation of motion for the circumferential displacement of an arch segment is derived. Next, based on the value of the discriminate parameter for a cubic equation, the exact solutions for the three types of roots of the un-coupled equation are determined and, corresponding to each type of roots, all displacement functions for the arch segment in terms of the real numbers (instead of the complex ones) are obtained. Finally, use of the compatible equations for the displacements and slopes together with the equilibrium equations for the forces and moments at each intermediate node and two ends of the entire curved beam, a frequency equation of the form ∣H(ω)∣ = 0 is obtained. It is found that the conventional approach by using the condition “∣H(ω^t)∣ ? ε” to search for the approximate value of ω^t is difficult even if the convergence tolerance ε is greater than 10⁺³ (i.e., ε > 10⁺³) instead of less than 10^?3 (i.e., ε < 10^?3), however, the half-interval method is one of the effective tools for solving the problem if all coefficients of the determinant ∣H(ω)∣ are the real numbers. In addition to comparing with the existing literature, most of the numerical results obtained from the presented method are compared with those obtained from the conventional finite element method (FEM) and good agreement is achieved.     

Quantum Complexity of Integration

It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F^k, α_d on [0, 1]^d and define γ by γ=(k+α)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are comp(F^k, α_d, ε)≍ε^−1/γ and comp^random(F^k, α_d, ε)≍ε^−2/(1+2γ). For a quantum computer we prove comp^quant_query(F^k, α_d, ε)≍ε^−1/(1+γ) and comp^quant(F^k, α_d, ε)⩽Cε^−1/(1+γ)(log ε⁻¹)^1/(1+γ). For restricted Monte Carlo (only coin tossing instead of general random numbers) we prove comp^coin(F^k, α_d, ε)⩽Cε^−2/(1+2γ)(log ε⁻¹)^1/(1+2γ). To summarize the results one can say that   • there is an exponential speed-up of quantum algorithms over deterministic (classical) algorithms, if γ is small;   • there is a (roughly) quadratic speed-up of quantum algorithms over randomized classical methods, if γ is small.     

The asymptotic expansions of the solution for the boundary value problem to a convective diffusion equation with volume chemical reaction near a spherical drop

The paper deals with a boundary value problem for a quasilinear partial elliptical equation. The equation describes a stationary process of convective diffusion near a spherical drop and takes into account the value of a chemical reaction for large Peclet numbers (Pe). For the problem considered, an asymptotic expansions (AE) of solution on the small parameter (ε = Pe^−1/2) is obtained near a spherical drop.     

The Exponent of Discrepancy Is at Least 1.0669

LetP⊂[0, 1]^dbe ann-point set and letw: P→[0, ∞) be a weight function withw(P)=∑_z∈P w(z)=1. TheL₂-discrepancy of the weighted set (P, w) is defined as theL₂-average ofD(x)=vol(B_x)−w(P∩B_x) overx∈[0, 1]^d, where vol(B_x) is the volume of thed-dimensional intervalB_x=∏^d_k=1 [0, x_k). The exponent of discrepancyp* is defined as the infimum of numberspsuch that for all dimensionsd⩾1 and allε>0 there exists a weighted set of at mostKε^−ppoints in [0, 1]^dwithL₂-discrepancy at mostε, whereK=K(p) is a suitable number independent ofεandd. Wasilkowski and Woźniakowski proved thatp*⩽1.4779, by combining known bounds for the error of numerical integration and using their relation toL₂-discrepancy. In this note we observe that a careful treatment of a classical lower- bound proof of Roth yieldsp*⩾1.04882, and by a slight modification of the proof we getp*⩾1.0669. Determiningp* exactly seems to be quite a difficult problem.     

Bifurcation of limit cycles in a quintic Hamiltonian system under a sixth-order perturbation

This paper intends to explore the bifurcation of limit cycles for planar polynomial systems with even number of degrees. To obtain the maximum number of limit cycles, a sixth-order polynomial perturbation is added to a quintic Hamiltonian system, and both local and global bifurcations are considered. By employing the detection function method for global bifurcations of limit cycles and the normal form theory for local degenerate Hopf bifurcations, 31 and 35 limit cycles and their configurations are obtained for different sets of controlled parameters. It is shown that: H(6) ⩾ 35 = 6² − 1, where H(6) is the Hilbert number for sixth-degree polynomial systems.     

Statistical properties of nucleotides in human chromosomes 21 and 22

In this paper the statistical properties of nucleotides in human chromosomes 21 and 22 are investigated. The n-tuple Zipf analysis with n = 3, 4, 5, 6, and 7 is used in our investigation. It is found that the most common n-tuples are those which consist only of adenine (A) and thymine (T), and the rarest n-tuples are those in which GC or CG pattern appears twice. With the n-tuples become more and more frequent, the double GC or CG pattern becomes a single GC or CG pattern. The percentage of four nucleotides in the rarest ten and the most common ten n-tuples are also considered in human chromosomes 21 and 22, and different behaviors are found in the percentage of four nucleotides. Frequency of appearance of n-tuple f(r) as a function of rank r is also examined. We find the n-tuple Zipf plot shows a power-law behavior for r < 4ⁿ⁻¹ and a rapid decrease for r > 4ⁿ⁻¹. In order to explore the interior statistical properties of human chromosomes 21 and 22 in detail, we divide the chromosome sequence into some moving windows and we discuss the percentage of ξη (ξ, η = A, C, G, T) pair in those moving windows. In some particular regions, there are some obvious changes in the percentage of ξη pair, and there maybe exist functional differences. The normalized number of repeats N₀(l) can be described by a power law: N₀(l) ∼ l^−μ. The distance distributions P₀(S) between two nucleotides in human chromosomes 21 and 22 are also discussed. A two-order polynomial fit exists in those distance distributions: log P₀(S) = a + bS + cS², and it is quite different from the random sequence.     

New exact solitary-wave special solutions for the nonlinear dispersive K(m, n) equations

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

Solution of the Burgers equation using an implicit linearizing transformation

The initial-boundary-value problem on the semi-infinite interval and on a finite interval for the Burgers equation u_t = u_xx + 2u_xu is solved using a stream function ? and a linearizing transformation w = e^?. The transformation reduces the equation to a heat equation with appropriate initial and homogeneous time-dependent linear boundary conditions. One advantage of this method is that we never need to find an explicit expression for ? in our computations.     

Hyperchaos in fractional order nonlinear systems

We numerically investigate hyperchaotic behavior in an autonomous nonlinear system of fractional order. It is demonstrated that hyperchaotic behavior of the integer order nonlinear system is preserved when the order becomes fractional. The system under study has been reported in the literature [Murali K, Tamasevicius A, Mykolaitis G, Namajunas A, Lindberg E. Hyperchaotic system with unstable oscillators. Nonlinear Phenom Complex Syst 3(1);2000:7–10], and consists of two nonlinearly coupled unstable oscillators, each consisting of an amplifier and an LC resonance loop. The fractional order model of this system is obtained by replacing one or both of its capacitors by fractional order capacitors. Hyperchaos is then assessed by studying the Lyapunov spectrum. The presence of multiple positive Lyapunov exponents in the spectrum is indicative of hyperchaos. Using the appropriate system control parameters, it is demonstrated that hyperchaotic attractors are obtained for a system order less than 4. Consequently, we present a conjecture that fourth-order hyperchaotic nonlinear systems can still produce hyperchaotic behavior with a total system order of 3 + ε, where 1 > ε > 0.     

On “P” property and the column-W property

P-matrices play an important role in the well-posedness of a linear complementarity problem (LCP). Similarly, the well-posedness of a horizontal linear complementarity problem (HLCP) is closely related to the column-W property of a matrix k-tuple.In this paper we first consider the problem of generating P-matrices from a given pair of matrices. Given a matrix pair (D, F) where D is a square matrix of order m and matrix F has m rows, “what are the conditions under which there exists a matrix G such that (D + FG) is a P-matrix?”. We obtain necessary and sufficient conditions for the special case when the column rank of F is m ? 1. A decision algorithm of complexity O(m²) to check whether the given pair of matrices (D, F) is P-matrisable is obtained. We also obtain a necessary and an independent sufficient condition for the general case when rank(F) is less than m ? 1.We then generalise the P-matrix generating problem to the generation of matrix k-tuples satisfying the column-W property from a given matrix (k + 1)-tuple. That is, given a matrix (k + 1)-tuple (D₁, … ,D_k, F), where D_js are square matrices of order m and F is a matrix having m rows, we determine the conditions under which the matrix k-tuple (D₁ + FG₁, … ,D_k + FG_k) satisfies the column-W property. As in the case of P-matrices we obtain necessary and sufficient conditions for the case when rank(F) = m ? 1. Using these conditions a decision algorithm of complexity O(km²) to check whether the given matrix (k + 1)-tuple is column-W matrisable is obtained. Then for the case when rank(F) is less than m ? 1, we obtain a necessary and an independent sufficient condition.For a special sub-class of P-matrices we give a polynomial time decision algorithm for P-matrisability. Finally, we obtain a geometric characterisation of column-W property by generalising the well known separation theorem for P-matrices.     

Tractability of Multivariate Integration for Periodic Functions

We study multivariate integration in the worst case setting for weighted Korobov spaces of smooth periodic functions of d variables. We wish to reduce the initial error by a factor ε for functions from the unit ball of the weighted Korobov space. Tractability means that the minimal number of function samples needed to solve the problem is polynomial in ε⁻¹ and d. Strong tractability means that we have only a polynomial dependence in ε⁻¹. This problem has been recently studied for quasi-Monte Carlo quadrature rules and for quadrature rules with non-negative coefficients. In this paper we study arbitrary quadrature rules. We show that tractability and strong tractability in the worst case setting hold under the same assumptions on the weights of the Korobov space as for the restricted classes of quadrature rules. More precisely, let γ_j moderate the behavior of functions with respect to the jth variable in the weighted Korobov space. Then strong tractability holds iff ∑^∞_j=1 γ_j<∞, whereas tractability holds iff lim sup_d→∞ ∑^d_j=1 γ_j/ln d<∞. We obtain necessary conditions on tractability and strong tractability by showing that multivariate integration for the weighted Korobov space is no easier than multivariate integration for the corresponding weighted Sobolev space of smooth functions with boundary conditions. For the weighted Sobolev space we apply general results from E. Novak and H. Woźniakowski (J. Complexity17 (2001), 388–441) concerning decomposable kernels.     

Free convection heat and mass transfer in a power law fluid past an inclined surface with thermophoresis

The problem of heat and mass transfer in a power law, two-dimensional, laminar, boundary layer flow of a viscous incompressible fluid over an inclined plate with heat generation and thermophoresis is investigated by the characteristic function method. The governing non-linear partial differential equations describing the flow and heat transfer problem are transformed into a set of coupled non-linear ordinary differential equation which was solved using Runge–Kutta shooting method. Exact solutions for the dimensionless temperature and concentration profiles, are presented graphically for different physical parameters and for the different power law exponents 0 < n < 0.5 and for n > 0.5.     

Vacuum polarization in light two-electron atoms and ions

A general theory of the vacuum polarization in light atomic and muon-atomic systems is considered. We derive the closed analytical expression for the Uehling potential and evaluate corrections on vacuum polarization for the 1¹S-state of the two-electron ³He and ⁴He atoms and for some two-electron ions, including the Li⁺, Be²⁺, B³⁺ and C⁴⁺ ions. The correction for vacuum polarization in two-electron He atoms has been evaluated as ΔE_ueh ≈ 7.253 ± 0.0025 × 10⁻⁷ a.u. The analogous corrections in the two-electron He-like ions rapidly increase with the nuclear charge Q (ΔE_ueh ≈ 2.7061 × 10⁻⁶ a.u. for the Li⁺ ion and ΔE_ueh ≈ 2.3495 × 10⁻⁵ a.u. for the C⁴⁺ ion). The corresponding corrections have also been evaluated for the electron–nucleus and electron–electron interactions.     

Filter matrix based on interpolation wavelets for solving Fredholm integral equations

The interpolation wavelet is used to solve the Fredholm integral equation of the second kind in this study. Hence, by the extension of interpolation wavelets that [−1, 1] is divided to 2^N+1 (N ⩾  − 1) subinterval, we have polynomials with a degree less than M + 1 in each new interval. Therefore, by considering the two-scale relation the filter coefficients and filter matrix are used as the proof of theorems. The important point is interpolation wavelets lead to more sparse matrix when we try to solve integral equation by an approximate kernel decomposed to a lower and upper resolution. Using n-time, where (n ⩾ 2), two-scale relation in this method errors of approximate solution as O((2^−(N+1))ⁿ⁺¹). Also, the filter coefficient simplifies the proof of some theorems and the order of convergence is estimated by numerical errors.     

Global chaos synchronization of new chaotic systems via nonlinear control

Nonlinear control is an effective method for making two identical chaotic systems or two different chaotic systems be synchronized. However, this method assumes that the Lyapunov function of error dynamic (e) of synchronization is always formed as V (e) = 1/2e^Te. In this paper, modification based on Lyapunov stability theory to design a controller is proposed in order to overcome this limitation. The method has been applied successfully to make two identical new systems and two different chaotic systems (new system and Lorenz system) globally asymptotically synchronized. Since the Lyapunov exponents are not required for the calculation, this method is effective and convenient to synchronize two identical systems and two different chaotic systems. Numerical simulations are also given to validate the proposed synchronization approach.     

Core instances for testing: A case study

Data generation for computational testing of optimization algorithms is a key topic in experimental algorithmics. Recently, concern has arisen that many published computational experiments are inadequate with respect to the way test instances are generated. In this paper we suggest a new research direction that might be useful to cope with the possible limitations of data generation. The basic idea is to select a finite set of instances which ‘represent’ the whole set of instances. We propose a measure of the representativeness of an instance, which we call ε-representativeness: for a minimization problem, an instance x_ε is ε-representative of another instance x if a (1 + ε)-approximate solution to x can be obtained by solving x_ε. Focusing on a strongly NP-hard single machine scheduling problem, we show how to map the infinite set of all instances into a finite set of ε-representative core instances. We propose to use this finite set of ε-representative core instances to test heuristics.     

Space–time symmetry violation,configuration mixing model and E-infinity theory

We have studied the time reversal symmetry violation on the bases of the configuration mixing model and E-infinity theory. With the use of the Cabibbo angle approximation, we have presented the transformation matrix in terms of the golden ratio (?), and shown that the time reversal symmetry violation is described by the configuration mixing of the unstable and stable manifolds (W^u, W^s). The magnitude of the mixing for the weak interaction field is given by the expression sin² θ_T(theor) ≈ sin⁴ θ_C(theor) ≈ (?)¹² = 3.105 × 10^?3, which is compared to the Kaon decay experiment ～2.3 × 10^?3. We have also discussed the space–time symmetry violation by using the CPT theorem.     

Neural networks analysis of free laminar convection heat transfer in a partitioned enclosure

The feasibility of using neural networks (NNs) to predict the complete thermal and flow variables throughout a complicated domain, due to free convection, is demonstrated. Attention is focused on steady, laminar, two-dimensional, natural convective flow within a partitioned cavity. The objective is to use NN (trained on a database generated by a CFD analysis of the problem of a partitioned enclosure) to predict new cases; thus saving effort and computation time. Three types of NN are evaluated, namely General Regression NNs, Polynomial NNs, and a versatile design of Backpropagation neural networks. An important aspect of the study was optimizing network architecture in order to achieve best performance. For each of the three different NN architectures evaluated, parametric studies were performed to determine network parameters that best predict the flow variables.A CFD simulation software was used to generate a database that covered the range of Rayleigh number Ra = 10⁴–5 × 10⁶. The software was used to calculate the temperature, the pressure, and the horizontal and vertical components of flow speed. The results of the CFD were used for training and testing the neural networks (NN). The robustness of the trained NNs was tested by applying them to a “production” data set (1500 patterns for Ra = 8 × 10⁴ and 1500 patterns for Ra = 3 × 10⁶), which the networks have never been “seen” before. The results of applying the technique on the “production” data set show excellent prediction when the NNs are properly designed. The success of the NN in accurately predicting free convection in partitioned enclosures should help reduce analysis-time and effort. Neural networks could potentially help solve some cases in which CFD fails to solve because of numerical instability.     

Calculation of a static potential created by plane fractal cluster

In this paper we demonstrate new approach that can help in calculation of electrostatic potential of a fractal (self-similar) cluster that is created by a system of charged particles. For this purpose we used the simplified model of a plane dendrite cluster [1] that is generated by a system of the concentric charged rings located in some horizontal plane (see Fig. 2). The radiuses and charges of the system of concentric rings satisfy correspondingly to relationships: r_n = r₀ξⁿ and e_n = e₀bⁿ, where n determines the number of a current ring. The self-similar structure of the system considered allows to reduce the problem to consideration of the functional equation that similar to the conventional scaling equation. Its solution represents itself the sum of power-low terms of integer order and non-integer power-law term multiplied to a log-periodic function [5], [6]. The appearance of this term was confirmed numerically for internal region of the self-similar cluster (r₀ ≪ r ≪ r_N−1), where r₀, r_N−1 determine the smallest and the largest radiuses of the limiting rings correspondingly. The results were obtained for homogeneously (b > 0) and heterogeneously (b < 0) charged rings. We expect that this approach allows to consider more complex self-similar structures with different geometries of charge distributions.     

On generalized Jordan 1-derivation in rings

Let n ⩾ 1 be a fixed integer and let R be an (n + 1)!-torsion free 1-ring with identity element e. If F, d:R → R are two additive mappings satisfying F(xⁿ⁺¹) = F(x)(x¹)ⁿ + xd(x)(x¹)ⁿ⁻¹ + x²d(x)(x¹)ⁿ⁻²+ ⋯ +xⁿd(x) for all x ∈ R, then d is a Jordan 1-derivation and F is a generalized Jordan 1-derivation on R.