On the linear combination, product and ratio of normal and Laplace random variables

The distributions of linear combinations, products and ratios of random variables arise in many areas of engineering. In this note, the exact distributions of αX+βY, |XY| and |X/Y| are derived when X and Y are independent normal and Laplace random variables.     

Processing truncated terms in document retrieval systems

In a typical inverted-file full-text document retrieval system, the user submits queries consisting of strings of characters combined by various operators. The strings are looked up in a text-dictionary which lists, for each string, all the places in the database at which it occurs. It is desirable to allow the user to include in his query truncated terms such as X¹, ¹X, ¹X¹, or X¹Y, where X and X are specified strings and ¹ is a variable-length-don't-care character, that is, ¹ represents an arbitrary, possibly empty, string. Processing these terms involves finding the set of all words in the dictionary that match these patterns. How to do this efficiently is a long-standing open problem in this domain.In this paper we present a uniform and efficient approach for processing all such query terms. The approach, based on a “permuted dictionary” and a corresponding set of access routines, requires essentially one disk access to obtain from the dictionary all the strings represented by a truncated term, with negligible computing time. It is thus well suited for on-line applications. Implementation is simple, and storage overhead is low: it can be made almost negligible by using some specially adapted compression techniques described in the paper.The basic approach is easily adaptable for slight variants, such as fixed (or bounded) length don't-care characters, or more complex pattern matching templates.     

A general equation of state: Equations for ammonia and steam

This paper is a continuation of a previous paper published in this JOURNAL. The basic idea in the two papers is to enlarge the assemblage of thermodynamic states by including the so-called “metastable” states. Considering a system, in one or two phases, which has a single type of transformation, the writer develops an equation of state of the form η = a + by + cp + dpv + (e + fv + gp + hpv) In T, where p, v, T are three independent variables, and a, b, c, etc. are constants.The latent heat at p, T = constant is λ_P,T = I (v₂ -v₁) [b+db+(f+hp) InT), which is derived from the equation of state.The available thermodynamic data on ammonia and steam are used to check these equations. It is found that within the saturated region the agreement is quite satis factory, whereas for the superheated region the agreement is not so good.     

Some properties of a class of biased regression estimators

For the linear statistical model y = Xb + e, X of full column rank estimates of b of the form (C + X′X)⁺X′y are studied, where C commutes with X′X and Q⁺ is the Moore-Penrose inverse of Q. Such estimators may have smaller mean square error, component by component than does the least squares estimator. It is shown that this class of estimators is equivalent to two apparently different classes considered by other authors. It is also shown that there is no C such that (C + X′X)⁺X′Y = My, in which My has the smallest mean square error, component by component. Two criteria, other than tmse, are suggested for selecting C. Each leads to an estimator independent of the unknown b and σ². Subsequently, comparisons are made between estimators in which the C matrices are functions of a parameter k. Finally, it is shown for the no intercept model that standardizing, using a biased estimate for the transformed parameter vector, and retransforming to the original units yields an estimator with larger tmse than the least squares estimator.     

TUT and TABU transitional filters

Transitional XY filters (TXY) are considered with characteristics that vary smoothly from those of filter X to those of filter Y as a parameter is varied continuously. Emphasis is placed on transitional ultraspherical—Thomson (TUT) filters and transitional ultraspherical “a”-ultraspherical “b” (TABU) filters.     

An equation of state for a system with a single type of transformation

Based on theory of a previous paper, the writer has developed an equation of state for a system with a single type of transformation. This equation is of the form

$\text{h=A+Bv+Cp+Dpv?T(E+Fv+Gp+Hpv)}$

where h = ε + pv is the total heat, p the pressure, v the specific volume, T the temperature, and p, v, T are considered independent variables. A, B, C, etc., are constants for the system. The latent eat at constant (p, T) is given by

$\text{λp,T=(v}{}_2\text{?v}{}_1\text{)(}\text{?h}\text{?v}\text{)P,T= (v}{}_2\text{?v}{}_1\text{)[(B?TF)+p(D?TH)]}$

. These equations are checked with data on saturated and superheated ammonia, and the agreement is good to within a few tenths of a per cent. Also, checks with data on saturated and superheated steam show agreement within several per cent.     

Stability criteria for certain classes of nonlinear difference equations

The general mth order difference equation X(n+m)+a₁X(n+m?1)+…+a_mX(n) = F[n,X(n),…,X(n+m?1)] is considered. The stability properties of its solutions are studied using the discrete form of Liapunov's direct method. A quadratic form is selected as a possible Liapunov function V(n,X) and a scheme is developed for determining appropriate conditions on this function to insure that its total difference ΔV(n,X) is negative semi-definite or negative definite with respect to the difference equation. The approach is applied to the fourth-order difference equation in full detail to illustrate the method for determining the conditions which imply either uniform stability or uniform asymptotic stability and specific results are obtained. Several comments on, and extensions of, the work done by Puri and Drake for the cases m = 2 and m = 3 are presented.The results of the present approach in the homogeneous case where F[n,X(n),…,X(n+m?1)] = 0 are compared with the usual Schur-Cohn criteria and are shown to be at least as good.     

On recursive averaging processes and Hilbert space extensions of the contraction mapping principle

If T maps a convex domain D_T into itself, and if {ω_n} is a real sequence with range in (0, 1] then the recursive averaging process,

$\text{X}{}_{\mathrm{n+1}}\text{=(1?omega;}{}_{\mathrm{n}}\text{)}\text{X}{}_{\mathrm{n}}\text{+ω}{}_{\mathrm{n}}\text{+ω}{}_{\mathrm{n}}\text{T}\text{x}{}_{\mathrm{n}}\text{,}\text{x}{}_0\text{=ξ?D}{}_{\mathrm{T}}$

generates a sequence {x?_n}; with range in D_T. Under suitable conditions on D_T, T and {ω_n} the sequence {x?_n} will converge in some sense to a fixed point of T. We prove that if D_T is a closed convex subset of a complex Hilbert space H, if Tω = (1 ? ω) I + ωT is a strict contraction for some ω ? (0, 1], and if {ω_n} satisfies the conditions,

$\text{ω}{}_{\mathrm{n}}\text{→ 0}$

and

$\text{∑}\text{n=0}\text{∞}\text{ω}{}_{\mathrm{n}}\text{=∞}$

then, for arbitrary ξ ? D_T, {x?_n} converges strongly to (the unique) fixed point of T. We also prove that if D_T and {ω_n} satisfy the foregoing conditions, if T has at least one fixed point, and if Tω is non-expansive for some ω ? (0, 1], then for all ξ ? D_T, {x?_n} converges at least weakly to some fixed point of T. Finally, we apply these results to linear equations involving bounded normal operators and obtain an extension of the classical Neumann operator series.     

A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations

The present work proposes a relaxed gradient based iterative (RGI) algorithm to find the solutions of coupled Sylvester matrix equations $AX+YB=C,DX+YE=F$. It is proved that the proposed iterative method can obtain the solutions of the coupled Sylvester matrix equations for any initial matrices X₀ and Y₀. Next the RGI algorithm is extended to the generalized coupled Sylvester matrix equations of the form $A_{i1}{X}_1{B}_{i1}+A_{i2}{X}_2{B}_{i2}+?+A_{ip}{X}_p{B}_{ip}=C_i,(i=1,2,\dots ,p)$. Then, we compare their convergence rate and find RGI is faster than GI, which has maximum convergence rate, under an appropriative positive number ω and the same convergence factor µ₁ and µ₂. Finally, a numerical example is included to demonstrate that the introduced iterative algorithm is more efficient than the gradient based iterative (GI) algorithm of (Ding and Chen 2006) in speed, elapsed time and iterative steps.     

The solution to matrix equation AX+XC=B

In this note, the problem of solution to the matrix equation AX+X^TC=B is considered by the Moore-Penrose generalized inverse matrix. A general solution to this equation is obtained. At the same time, some useful conclusions are made, which play important roles in the linear system theories and applications.     

Temperature distribution in toroidal electrical coils of rectangular cross section

The essential content of a recent paper by the present writer comprises a comprehensive discussion of the physical bases underlying derivation of formulas for calculating the temperature distribution T, maximum temperature T_m and average temperature T_a in a toroidal electrical coil of rectangular cross section, internally generated heat and change of wire resistance with temperature being taken into account. Illustratively, the solution for the boundary value condition of constant surface temperature and uniform equivalent thermal conductivity was obtained.For the most part, however, problems that arise in practice are not encompassed in the comparatively simple boundary conditions of constant temperature. Experiment shows that in general the boundary condition is $\text{T ? T′ = ?}\text{K?}\text{?n}$; whereof n denotes the outward drawn normal to the coil surface, $\text{K = (}\text{k}{}_{\mathrm{n}}\text{h}\text{)}$ the ratio of the equivalent thermal conductivity in the direction of n to the emissivity of the boundary surface, and T and T′ are the corresponding temperatures in the coil surface and the immediately adjacent ambient medium. Again, it frequently ensues in practice that the thermal conductivity is substantially different in the directions of the two principal axes of the cross section.In the present paper formulas for T, T_m, and T_a are obtained for electrical coils of ratio of external to internal radius greater than (roughly) two whereof (i) the thermal conductivity is different in the directions of the two principal axes of the cross section, (ii) K is different on but constant over each of the four faces of the coil, and (iii) no restriction is made as to T′ except that over each face it be expressible in a generalized Fourier series. Determination of T is posed as a boundary-value problem in the mathematical theory of heat; the formal solution of T effected by expansions in orthogonal functions; and T_m and T_a then determined through use of their known relationships with T. The resulting formulas are in the form of rapidly-converging singly-infinite trigonometric-hyperbolic series. Illustrative of application of these general formulas, the maximum temperatures in a coil of given dimensions subject to two different sets of surface conditions are calculated and found to be in excellent agreement with the known measured values.The just-mentioned formulas encompass practically all cases encountered in practice except those coils which do not satisfy the restriction as to ratio of radii. For these latter formulas for T, T_m, and T_a are obtained pursuant to conditions of (i) equivalent thermal conductivity different in the directions of the two principal axes of the cross section, (ii) K, and likewise T′, different on but constant over each of the four faces of the coil. These formulas are in the form of rapidly-converging singly-infinite trigonometric- Bessel function (of zero order) series: Illustratively, the maximum temperature in a coil of given dimensions is calculated and found to be in excellent agreement with the known measured value.     

On some n-normed linear space valued difference sequences

The main aim of this article is to extend the notion of strongly Cesàro summable and strongly lacunary summable real sequences to n-normed linear space valued (n-nls valued) difference sequences. Consequently we introduce the spaces |σ₁|(X,?) and N_θ(X,?), respectively, where X is an n-normed space and ? is a difference operator. We investigate these spaces for completeness as well as for the relationship between these spaces.     

Charmonium and charmoniumlike states at the BESIII experiment

Charmonium is a bound state of a charmed quark and a charmed antiquark, and a charmoniumlike state is a resonant structure that contains a charmed quark and antiquark pair but has properties that are incompatible with a conventional charmonium state. While operating at center-of-mass energies from 2 to 5 GeV, the BESIII experiment can access a wide mass range of charmonium and charmoniumlike states, and has contributed significantly in this field. We review BESIII results involving conventional charmonium states, including the first observation of the M1 transition ψ(2S) → γη_c(2S) and the discovery of the ψ₂(3823) state; and report on studies of charmoniumlike states, including the discoveries of the Z_c(3900) and Z_c(4020) tetraquark candidates, the resolution of the fine structure of the Y(4260) state, the discovery of the new production process e⁺e⁻ → γX(3872) and the uncovering of strong evidence for the commonality among the X(3872), Y(4260) and Z_c(3900) states. The prospects for further research at BESIII and proposed future facilities are also presented.     

Binary matrices with specified properties

The binary matrices A which are circulant with one or more of the following properties: (1) A is symmetric, i.e. A = A^T, (2) A is orthogonal, i.e. AA^T = I (mod 2), (3) A has low multiplicative order, i.e. A^m = I, occur often in communication, control and network theory problems. In this paper we construct a number of such matrices. The results are based on the theory of power-residues modulo an odd prime p, and the fact that the algebra of all p × p circulant matrices is isomorphic to the algebra of polynomials modulo (x^p?1).     

Optimal tensegrity structures in bending: The discrete Michell truss

This paper provides the closed form analytical solution to the problem of minimizing the material volume required to support a given set of bending loads with a given number of discrete structural members, subject to material yield constraints. The solution is expressed in terms of two variables, the aspect ratio, ρ^-1, and complexity of the structure, q (the total number of members of the structure is equal to q(q+1)). The minimal material volume (normalized) is also given in closed form by a simple function of ρ and q, namely, V=q(ρ^-1/q-ρ^1/q). The forces for this nonlinear problem are shown to satisfy a linear recursive equation, from node-to-node of the structure. All member lengths are specified by a linear recursive equation, dependent only on the initial conditions involving a user specified length of the structure. The final optimal design is a class 2 tensegrity structure. Our results generate the 1904 results of Michell in the special case when the selected complexity q approaches infinity. Providing the optimum in terms of a given complexity has the obvious advantage of relating complexity q to other criteria, such as costs, fabrication issues, and control. If the structure is manufactured with perfect joints (no glue, welding material, etc.), the minimal mass complexity is infinite. But in the presence of any joint mass, the optimal structural complexity is finite, and indeed quite small. Hence, only simple structures (low complexity q) are needed for practical design.     

Adaptive iterative learning control for MIMO nonlinear systems performing iteration-varying tasks

The present work aims to develop a novel adaptive iterative learning control(AILC) method for nonlinear multiple input multiple output (MIMO) systems that execute various control missions with iteration-varying magnitude-time scales. In order to reduce the variations of the systems, this work proposes a series of time scaling transformations to normalize the iteration-varying trial lengths. An AILC scheme is then developed for the transformed control systems on a uniform trial length, which is shown to be capable of ensuring the asymptotic convergence of the tracking error. In other words, the proposed AILC algorithm is able to relax the constraint in conventional ILC where the control task must remain the same in the iteration domain. Additionally, the basic assumption in classic ILC that the control system must repeat on a fixed finite period is also removed. The convergence analysis of the AILC is derived rigorously according to the composite energy function (CEF) methodology. It is shown that the newly developed learning control strategy works well for control plants with either time-invariant or time-varying parametric uncertainties. To show the effectiveness of the AILC, three examples are illustrated in the end. Meanwhile, the proposed learning method is also implemented to a traditional X–Y table system.     

An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs

This paper investigates a distributed optimization problem over multi-agent networks subject to both local and coupled constraints in a non-stationary environment, where a set of agents aim to cooperatively minimize the sum of locally time-varying cost functions when the communication graphs are time-changing connected and unbalanced. Based on dual decomposition, we propose a distributed online dual push-sum learning algorithm by incorporating the push-sum protocol into dual gradient method. We then show that the regret bound has a sublinear growth of O(T^p) and the constraint violation is also sublinear with order of $O\left(T^{1?p/2}\right),$ where T is the time horizon and 0 < p ≤ 1/2. Finally, simulation experiments on a plug-in electric vehicle charging problem are utilized to verify the performance of the proposed algorithm. The proposed algorithm is adaptive without knowing the total number of iterations T in advance. The convergence results are established on more general unbalanced graphs without the boundedness assumption on dual variables. In addition, more privacy concerns are guaranteed since only dual variables related with coupled constraints are exchanged among agents.     

Bidirectional delta files

A bidirectional delta file is a novel concept, introduced in this paper, for a two way delta file. Previous work focuses on single way differential compression called forwards and backwards delta files. Here we suggest to efficiently combine them into a single file so that the combined file is smaller than the combination of the two individual ones. Given the bidirectional delta file of two files S and T and the original file S, one can decode it in order to produce T. The same bidirectional delta file is used together with the file T in order to reconstruct S. This paper presents two main strategies for producing an efficient bidirectional delta file in terms of the memory storage it requires; a quadratic time, optimal, dynamic programming algorithm, and a linear time, greedy algorithm. Although the dynamic programming algorithm often produces better results than the greedy algorithm, it is impractical for large files, and it is only used for theoretical comparisons. Experiments between the implemented algorithms and the traditional way of using both forwards and backwards delta files are presented, comparing their processing time and their compression performance. These experiments show memory storage savings of about 25% using this bidirectional delta approach as compared to the compressed delta file constructed using the traditional way, while preserving approximately the same processing time for decoding.