Stress field characteristics of eccentrically loaded aircraft spliced joints

The paper details the stress characteristics in eccentrically loaded aircraft spliced joints. It is shown that the hoop stress (σ_θθ) around each rivet is characterized by two peak values located at θ = (0°, 90°). The magnitude of (σ_θθ) is then reduced to a minimum value between these two peaks. A sharp increase in the axial stress component (σ_xx) along the vertical splice lines occurs in the vicinity of the rivet centerlines followed by a rapid decrease in the areas between the rivets. It is shown that stresses along the first interior rivet row is the most critical. The axial stress (σ_xx) profile along horizontal rivet lines has a “sinusoidal” pattern. It is observed that the transverse stress profile (σ_yy), along the horizontal lines, has different peak and minimum values between the rivets. The magnitude of the peak/minimum values depends upon the line location within the splice region. It is also shown the bending stress component varies significantly and must be accounted for the analysis of the eccentric aircraft joints. Experimental comparisons are made along several lines in the splice region. The numerical model is utilized for analysis of a full frame-bay/splice of aircraft fuselage. The paper provides valuable information that can be utilized by practicing engineers for analysis and design of joints with large number of rivets.     

Numerical simulation of two-stage combustion in SI engine with prechamber

Burning lean mixture in spark ignition (SI) engine leads to decrease in temperature of combustion process and is one of the methods of limiting nitric oxide emission and increasing the engine efficiency. The two-stage combustion system of stratified mixture (engine with prechamber) can be an effective method of lean mixture combustion. The paper presents the results of three-dimensional modeling of fuel mixture preparation and combustion in SI engine with sectional combustion chamber powered by liquefied fuel. Three dimensional modeling was performed in KIVA-3V code. The modeling results were compared with results obtained from the analysis of experimental measurements of two-stage combustion test engine operating at the Institute of Internal Combustion Engines and Control Engineering (Czestochowa University of Technology). The performed simulations of the combustion process provided data concerning the spatial and temporal distributions of turbulent kinetic energy, pressure, temperature and nitric oxides concentration in the combustion chambers of the engine. The engine model with two-stage combustion system properly represents the real processes which occur in the combustion chambers of the test engine. Pressure and temperature courses in function of CA obtained from the experiment and modeling were in good qualitative and quantitative consistence. Comparison of modeled and measured nitric oxide emissions revealed relatively significant discrepancies. In case of λ = 1.4, the measured values of NO_x concentration were 1.75 times higher than the modeled values. In case of λ = 2.0, the modeled and measured values were close to each other and were within the range of measurement error.     

New types of 3-D systems of quadratic differential equations with chaotic dynamics based on Ricker discrete population model

The wide class of 3-D autonomous systems of quadratic differential equations, in each of which either there is a couple of coexisting limit cycles or there is a couple of coexisting chaotic attractors, is found. In the second case the couple consists of either Lorentz-type attractor and another attractor of a new type or two Lorentz-type attractors. It is shown that the chaotic behavior of any system of the indicated class can be described by the Ricker discrete population model: z_i+1 = z_i exp(r − z_i), r > 0, z_i > 0, i = 0, 1, … . The values of parameters, at which in the 3-D system appears either the couple of limit cycles or the couple of chaotic attractors, or only one limit cycle, or only one sphere-shaped chaotic attractor, are indicated. Examples are given.     

The impact of smooth W-grids in the numerical solution of singular perturbation two-point boundary value problems

This paper develops a semi-analytic technique for generating smooth nonuniform grids for the numerical solution of singularly perturbed two-point boundary value problems. It is based on the usual idea of mapping a uniform grid to the desired nonuniform grid. We introduce the W-grid, which depends on the perturbation parameter ? ? 1. For problems on [0, 1] with a boundary layer at one end point, the local mesh width h_i = x_i+1 − x_i, with 0 = x₀ < x₁ < ? < x_N = 1, is condensed at either 0 or 1. Two simple 2nd order finite element and finite difference methods are combined with the new mesh, and computational experiments demonstrate the advantages of the smooth W-grid compared to the well-known piecewise uniform Shishkin mesh. For small ?, neither the finite difference method nor the finite element method produces satisfactory results on the Shishkin mesh. By contrast, accuracy is vastly improved on the W-grid, which typically produces the nominal 2nd order behavior in L², for large as well as small values of N, and over a wide range of values of ?. We conclude that the smoothness of the mesh is of crucial importance to accuracy, efficiency and robustness.     

The domination numbers of cylindrical grid graphs

Let γ(P_m □ C_n) denote the domination number of the cylindrical grid graph formed by the Cartesian product of the graphs P_m, the path of length m, m ? 2 and the graph C_n, the cycle of length n, n ? 3. In this paper, methods to find the domination numbers of graphs of the form P_m □ C_n with n ? 3 and m = 2, 3 and 4 are proposed. Moreover, bounds on domination numbers of the graphs P₅ □ C_n, n ? 3 are found. The methods that are used to prove that results readily lead to algorithms for finding minimum dominating sets of the above mentioned graphs.     

A two-unit general parallel system with (n − 2) cold standbys—Analytic and simulation approach

A parallel (2, n − 2)-system is investigated here where two units start their operation simultaneously and any one of them is replaced instantaneously upon its failure by one of the (n − 2) cold standbys. We assume availability of n non-identical, non-repairable units for replacement or support. The system reliability is evaluated by recursive relations with unit-lifetimes T_i (i = 1, … , n) that have a general joint distribution function F(t). On the basis of the derived expression, simulation techniques have been developed for the evaluation of the system reliability and the mean time to failure, useful when dealing with large systems or correlated unit-lifetimes and less mathematically manageable distributions. Simulation results are presented for various lifetime distributions and comparisons are made with derived analytic results for some special distributions and moderate values of n.     

L2 − L∞ filtering for Markovian jump systems with time-varying delays and partly unknown transition probabilities

This paper considers the L₂ − L_∞ filtering problem for Markovian jump systems. The systems under consideration involve time-varying delays, disturbance signal and partly unknown transition probabilities. The aim of this paper is to design a filter, which is suitable for exactly known and partly unknown transition probabilities, such that the filtering error system is stochastically stable and a prescribed L₂ − L_∞ disturbance attenuation level is guaranteed. By using the Lyapunov-Krasovskii functional, sufficient conditions are formulated in terms of linear matrix inequalities (LMIs). A numerical example is given to illustrate the effectiveness of the proposed main results. All these results are expected to be of use in the study of filter design for Markovian jump systems with partly unknown transition probabilities.     

The analysis and application of an HBV model

A mathematical model is formulated to describe the spread of hepatitis B. The stability of equilibria and persistence of disease are analyzed. The results shows that the dynamics of the model is completely determined by the basic reproductive number ρ₀. If ρ₀ < 1, the disease-free equilibrium is globally stable. When ρ₀ > 1, the disease-free equilibrium is unstable and the disease is uniformly persistent. Furthermore, under certain conditions, it is proved that the endemic equilibrium is globally attractive. Numerical simulations are conducted to demonstrate our theoretical results. The model is applied to HBV transmission in China. The parameter values of the model are estimated based on available HBV epidemic data in China. The simulation results matches the HBV epidemic data in China approximately.     

New results on the energy of integral circulant graphs

Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. The integral circulant graph ICG_n(D) has the vertex set Z_n = {0, 1, 2, … , n − 1} and vertices a and b are adjacent if gcd(a − b, n) ∈ D, where D ⊆ {d : d∣n, 1 ? d < n}. These graphs are highly symmetric, have integral spectra and some remarkable properties connecting chemical graph theory and number theory. The energy of a graph was first defined by Gutman, as the sum of the absolute values of the eigenvalues of the adjacency matrix. Recently, there was a vast research for the pairs and families of non-cospectral graphs having equal energies. Following Bapat and Pati [R.B. Bapat, S. Pati, Energy of a graph is never an odd integer, Bull. Kerala Math. Assoc. 1 (2004) 129-132], we characterize the energy of integral circulant graph modulo 4. Furthermore, we establish some general closed form expressions for the energy of integral circulant graphs and generalize some results from Ili? [A. Ili?, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009), 1881-1889]. We close the paper by proposing some open problems and characterizing extremal graphs with minimal energy among integral circulant graphs with n vertices, provided n is even.     

Fault-tolerant edge and vertex pancyclicity in alternating group graphs

In [J.-M. Chang, J.-S. Yang. Fault-tolerant cycle-embedding in alternating group graphs, Appl. Math. Comput. 197 (2008) 760-767] the authors claim that every alternating group graph AG_n is (n − 4)-fault-tolerant edge 4-pancyclic. Which means that if the number of faults ∣F∣ ? n − 4, then every edge in AG_n − F is contained in a cycle of length ?, for every 4 ? ? ? n!/2 − ∣F∣. They also claim that AG_n is (n − 3)-fault-tolerant vertex pancyclic. Which means that if ∣F∣ ? n − 3, then every vertex in AG_n − F is contained in a cycle of length ?, for every 3 ? ? ? n!/2 − ∣F∣. Their proofs are not complete. They left a few important things unexplained. In this paper we fulfill these gaps and present another proofs that AG_n is (n − 4)-fault-tolerant edge 4-pancyclic and (n − 3)-fault-tolerant vertex pancyclic.     

Bipanconnectivity of faulty hypercubes with minimum degree

In this paper, we consider the conditionally faulty hypercube Q_n with n ? 2 where each vertex of Q_n is incident with at least m fault-free edges, 2 ? m ? n − 1. We shall generalize the limitation m ? 2 in all previous results of edge-bipancyclicity. We also propose a new edge-fault-tolerant bipanconnectivity called k-edge-fault-tolerant bipanconnectivity. A bipartite graph is k-edge-fault-tolerant bipanconnected if G − F remains bipanconnected for any F ⊂ E(G) with ∣F∣ ? k. For every integer m, under the same hypothesis, we show that Q_n is (n − 2)-edge-fault-tolerant edge-bipancyclic and bipanconnected, and the results are optimal with respect to the number of edge faults tolerated. This not only improves some known results on edge-bipancyclicity and bipanconnectivity of hypercubes, but also simplifies the proof.     

Classification of small (0, 1) matrices

Denote by A_n the set of square (0, 1) matrices of order n. The set A_n, n ? 8, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of regular (0, 1) matrices of order 8 is 10160459763342013440. Let D_n, S_n denote the set of absolute determinant values and Smith normal forms of matrices from A_n. Denote by a_n the smallest integer not in D_n. The sets D₉ and S₉ are obtained; especially, a₉ = 103. The lower bounds for a_n, 10 ? n ? 19 (exceeding the known lower bound a_n ? 2f_n − 1, where f_n is nth Fibonacci number) are obtained. Row/permutation equivalence classes of A_n correspond to bipartite graphs with n black and n white vertices, and so the other applications of the classification are possible.     

Embedding cycles of various lengths into star graphs with both edge and vertex faults

The n-dimensional star graph S_n is an attractive alternative to the hypercube graph and is a bipartite graph with two partite sets of equal size. Let F_v and F_e be the sets of faulty vertices and faulty edges of S_n, respectively. We prove that S_n − F_v − F_e contains a fault-free cycle of every even length from 6 to n! − 2∣F_v∣ with ∣F_v∣ + ∣F_e∣ ? n − 3 for every n ? 4. We also show that S_n − F_v − F_e contains a fault-free path of length n! − 2∣F_v∣ − 1 (respectively, n! − 2∣F_v∣ − 2) between two arbitrary vertices of S_n in different partite sets (respectively, the same partite set) with ∣F_v∣ + ∣F_e∣ ? n − 3 for every n ? 4.     

Graphs for small multiprocessor interconnection networks

Let D be the diameter of a graph G and let λ₁ be the largest eigenvalue of its (0, 1)-adjacency matrix. We give a proof of the fact that there are exactly 69 non-trivial connected graphs with (D + 1)λ₁ ? 9. These 69 graphs all have up to 10 vertices and were recently found to be suitable models for small multiprocessor interconnection networks. We also examine the suitability of integral graphs to model multiprocessor interconnection networks, especially with respect to the load balancing problem. In addition, we classify integral graphs with small values of (D + 1)λ₁ in connection with the load balancing problem for multiprocessor systems.     

The spectra of some trees and bounds for the largest eigenvalue of any tree

Let T be an unweighted tree of k levels such that in each level the vertices have equal degree. Let n_k−j+1 and d_k−j+1 be the number of vertices and the degree of them in the level j. We find the eigenvalues of the adjacency matrix and Laplacian matrix of T for the case of two vertices in level 1 (n_k = 2), including results concerning to their multiplicity. They are the eigenvalues of leading principal submatrices of nonnegative symmetric tridiagonal matrices of order k × k. The codiagonal entries for these matrices are , 2 ? j ? k, while the diagonal entries are 0, …, 0, ±1, in the case of the adjacency matrix, and d₁, d₂, …, d_k−1, d_k ± 1, in the case of the Laplacian matrix. Finally, we use these results to find improved upper bounds for the largest eigenvalue of the adjacency matrix and of the Laplacian matrix of any given tree.     

A study on 3-D stress distributions in the bi-adhesively bonded T-joints

In this study, the normal (σ_x, σ_y, σ_z) and shear stress (τ_xy, τ_yz, τ_zx) distributions occurring in a bi-adhesively bonded T-joint with was investigated via a non-linear three dimensional finite element analysis. For this purpose, first of all, using 2024-T3 aluminum alloy as the adherend and the support, a two-part paste (DP 460) and a film type (SBT 9244) as adhesive, two different types of T-joint samples (single-adhesively bonded T-joint and bi-adhesively bonded T-joint) were produced for experimental studies. After experimental studies on the three different T-joint types were conducted, stress analyses in the T-joints were performed with a three-dimensional finite element analysis by considering the geometrical non-linearity and the material non-linearities of the adhesive (DP460 and SBT9244) and adherend (AA2024-T3). Finally, for a given adherend, the lower the stiffness of the adhesive used in the overlap, the lower the stress concentration, leading to potentially higher joint strength. The use of relatively low stiffness adhesives at the ends of the overlap in a bi-adhesive can decrease the stress concentration and, therefore, potentially lead to higher joint strength.     

Properties of non-simultaneous blow-up in heat equations coupled via different localized sources

This paper deals with u_t = Δu + u^m(x, t)e^pv(0,t), v_t = Δv + u^q(0, t)e^nv(x,t), subject to homogeneous Dirichlet boundary conditions. The complete classification on non-simultaneous and simultaneous blow-up is obtained by four sufficient and necessary conditions. It is interesting that, in some exponent region, large initial data u₀(v₀) leads to the blow-up of u(v), and in some betweenness, simultaneous blow-up occurs. For all of the nonnegative exponents, we find that u(v) blows up only at a single point if m > 1(n > 0), while u(v) blows up everywhere for 0 ? m ? 1 (n = 0). Moreover, blow-up rates are considered for both non-simultaneous and simultaneous blow-up solutions.     

Asymptotic formulas for the triple Gamma function Γ3 by means of its integral representation

There is an abundant literature on inequalities for the Gamma function Γ and its various related functions as well as their approximations. Only very recently, several authors began to investigate various inequalities for the double Gamma function Γ₂ and its approximation. Here, in this sequel to some of these recent works, we aim at presenting an integral representation of the triple Gamma function Γ₃, which is then used to derive an asymptotic formula for Γ₃. As a by-product of the results presented here, integral representations and asymptotic formulas for the Gamma function Γ and the double Gamma function Γ₂ are also given. The methods and techniques used in this paper can easily be extended to derive the corresponding integral representations and asymptotic formulas for the multiple Gamma functions Γ_n (n ≧ 4).     

Bounding the gap between extremal Laplacian eigenvalues of graphs

Let G be a graph whose Laplacian eigenvalues are 0 = λ₁ ? λ₂ ? ? ? λ_n. We investigate the gap (expressed either as a difference or as a ratio) between the extremal non-trivial Laplacian eigenvalues of a connected graph (that is λ_n and λ₂). This gap is closely related to the average density of cuts in a graph. We focus here on the problem of bounding the gap from below.