Integration of beam functions

The beam functions satisfying d⁴φ/dξ⁴ = β⁴φ with the associated boundary conditions are convenient admissible comparison functions for the approximated solutions of complex structural problems by the well known Rayleigh-Ritz method. Reliable integration formulae for products of various beam functions φ and ψ with an arbitrary function θ are essential. Felgar's recurrence formula for ∫ θφψ dξ is found to be in error and is corrected here. The condition when the characteristic values of θ and ψ are identical is also considered. A simple subroutine is given to evaluate ∫ θ(ξ)(dⁿφ/dξⁿ)(d^mψ/dξ^mdξ for all possible sets of boundary conditions. Applications to the free vibration of nonuniform beams and plate systems are demonstrated.     

A new routing algorithm for multirate rearrangeable Clos networks

In this paper, we study the problem of finding routing algorithms on the multirate rearrangeable Clos networks which use as few number of middle-stage switches as possible. We propose a new routing algorithm called the “grouping algorithm”. This is a simple algorithm which uses fewer middle-stage switches than all known strategies, given that the number of input-stage switches and output-stage switches are relatively small compared to the size of input and output switches. In particular, the grouping algorithm implies that m = 2n+(n−1)/2^k is a sufficient number of middle-stage switches for the symmetric three-stage Clos network C(n,m,r) to be multirate rearrangeable, where k is any positive integer and rn/(2^k−1).     

Piecewise hierarchical p-version axisymmetric solid element for laminated composites

This paper presents a piecewise hierarchical p-version finite element formulation for laminated composites axisymmetric solids for linear static analysis. The element formulation incorporates higher order deformation theories and is in total agreement with the physics of deformation in laminated composites. The element geometry is defined by eight nodes located on the boundaries of the element. The lamina thicknesses are used to create a nine-node p-version configuration for each lamina of the element. The displacement approximation for the element is piecewise hierarchical and is developed by first establishing a hierarchical displacement approximation for the nine-node configuration of each lamina of the laminate and then imposing interlamina continuity condition of displacements at the interfaces between laminas. The hierarchical approximation functions and the corresponding nodal variables for each lamina are derived from the Lagrange family of interpolation functions and can be of arbitrary polynomial order p_c and ^kp_η in the ε and ^kη directions for a typical lamina k. The formulation ensures C⁰ continuity, i.e., continuity of displacement across interelement as well as interlamina boundaries.

The element properties are constructed by assembling individual lamina properties which are derived using the principle of virtual work and the hierarchical displacement approximation for the laminas. Transformation matrices, formed based on interlamina continuity conditions, are used to transform each lamina's degrees of freedom into the degrees of freedom for the laminate. Thus, each individual lamina stiffness matrix and equivalent load vector are transformed and then summed to establish the laminate stiffness matrix and equivalent load vector. There is no restriction on either the number of laminas or their lay-up pattern. Each lamina can be generally orthotropic and the material directions and the layer thickness may vary from point to point within each lamina.

Numerical examples are presented to demonstrate the effectiveness, modeling convenience, accuracy, and overall superiority of the present formulation for laminated composite axisymmetric solids and shells.     

Approximating algebraic functions by means of rational ones

In this paper, we use ECO method and the concept of succession rule to enumerate restricted classes of combinatorial objects. Let Ω be the succession rule describing a construction of a combinatorial objects class, then the construction of the restricted class is described by means of an approximating succession rule Ω^k obtained from Ω in a natural way. We give sufficient conditions for the rule Ω^k to be finite; finally we determine finite approximating rules for various classes of paths, and the approximation of the corresponding algebraic language with a regular one.     

Intersection of finitely generated congruences over term algebra

We show that it is decidable for any given ground term rewrite systems R and S if there is a ground term rewrite system U such that ↔_U^*=↔_R^*∩↔_S^*. If the answer is yes, then we can effectively construct such a ground term rewrite system U. In other words, for any given finitely generated congruences ρ and τ over the term algebra, it is decidable if ρ∩τ is a finitely generated congruence. If the answer is yes, then we can effectively construct a ground term rewrite system U such that ↔_U^*=ρ∩τ.     

Fast evaluation of radial basis functions: I

This paper describes some new techniques for the rapid evaluation and fitting of radial basic functions. The techniques are based on the hierarchical and multipole expansions recently introduced by several authors for the calculation of many-body potentials. Consider in particular the N term thin-plate spline, s(x) = Σ_j=1^N d_jφ(x−x_j), where φ(u) = |u|²log|u|, in 2-dimensions. The direct evaluation of s at a single extra point requires an extra O(N) operations. This paper shows that, with judicious use of series expansions, the incremental cost of evaluating s(x) to within precision ε, can be cut to O(1+|log ε|) operations. In particular, if A is the interpolation matrix, a_i,j = φ(x_i−x_j, the technique allows computation of the matrix-vector product Ad in O(N), rather than the previously required O(N²) operations, and using only O(N) storage. Fast, storage-efficient, computation of this matrix-vector product makes pre-conditioned conjugate-gradient methods very attractive as solvers of the interpolation equations, Ad = y, when N is large.     

Applying systolic multiplication–inversion architectures based on modified extended Euclidean algorithm for GF(2) in elliptic curve cryptography

Elliptic curve cryptography is a very promising cryptographic method offering the same security level as traditional public key cryptosystems (RSA, El Gamal) but with considerably smaller key lengths. However, the computational complexity and hardware resources of an elliptic curve cryptosystem are very high and depend on the efficient design of EC point operations and especially point multiplication. Those operations, using the elliptic curve group law, can be analyzed in operations of the underlined GF(2^k) Field. Three basic GF(2^k) Field operations exist, addition–subtraction, multiplication and inversion–division. In this paper, we propose an optimized inversion algorithm that can be applied very well in hardware avoiding well known inversion problems. Additionally, we propose a modified version of this algorithm that apart from inversion can perform multiplication using the architectural structure of inversion. We design two architectures that use those algorithms, a two-dimensional multiplication/inversion systolic architecture and an one-dimensional multiplication/inversion systolic architecture. Based on either one of those proposed architectures a GF(2^k) arithmetic unit is also designed and used in a EC arithmetic unit that can perform all EC point operations required for EC cryptography. The EC arithmetic unit’s design methodology is proposed and analyzed and the effects of utilizing the one or two-dimensional multiplication/inversion systolic architecture are considered. The performance of the system in all its design steps is analyzed and comparisons are made with other known designs. We manage to design a GF(2^k) arithmetic unit that has the space and time complexity of an inverter but can perform all GF(2^k) operations and we show that this architecture can apply very well to an EC arithmetic unit required in elliptic curve cryptography.     

Confluent general-factorial difference and derivative operators and polynomial-exponential interpolation

A previous application of the Newton divided difference series of the displacement function E^z = (1 + Δ)^z = e ^Dz, where the operators Δ and D are the variables, to purely exponential interpolation employing general-factorial differences and derivatives, {Pi;^m_i=0 (Δ - S_i)}f(0) and {Pi;^m_i=0 (D - t_i)}f(0), in which the s_i's and t_i's are distinct[1], is here extended to mixed polynomial-exponential interpolation where the s_i's and t_i's are no longer distinct.     

Uniform and optimal schemes for stiff initial-value problems

We formulate a class of difference schemes for stiff initial-value problems, with a small parameter ε multiplying the first derivative. We derive necessary conditions for uniform convergence with respect to the small parameter ε, that is the solution of the difference scheme u_i^h satisfies |u_i^h−u(x_i)| Ch, where C is independent of h and ε. We also derive sufficient conditions for uniform convergence and show that a subclass of schemes is also optimal in the sense that |u_i^h−u(x_i)| C min (h, ε). Finally, we show that this class contains higher-order schemes.     

1-Inverses for polynomial matrices of non-constant rank

Let p₁, … p_t be polynomials in ⁿ with a variety V of common zeros contained in a suitable open set U. Explicit formulas are provided to construct rational functions λ₁, … λ_s such that Σ_i=1^sp_iλ_i 1, and such that the singularities of the λ_i are contained in U. This result is applied to compute rational functions-valued 1-inverses of matrices with polynomial coefficients, which do not have constant rank, while retaining control over the location of the singularities of the rational functions themselves.     

Minimizing the distance to one evader while chasing another

To approach a simple game Δ² of P and E = {E₁, E₂} with no a priori evaders' role assignment and the payoff equal to the distance to one evader at an instant of catching another, we introduce a concept of casting and study the games Δ_1,2 and Δ_2,1 for preassigned and Δ_p² for open-loop casting procedures. Since Δ_p² is reduced to Δ_1,2 or Δ_2,1 which, in turn, are distinguished only by their notations, we focus attention mainly on Δ_1,2. According to the tenet of transition, Δ_1,2 is divided into a concatenation of Δ_1,2^b (basic) and Δ_1,2^a (auxiliary) games that model the problem before and after the first instant of E₁ capture. The games Δ_1,2^a, Δ_1,2^b, Δ_1,2 are studied one after another with use of the Isaacs' approach extended by Berkowitz, Breakwell, Bernhard et al.     

Accuracy estimation in the finite element analysis of transverse bending of thin flat plates

As a basic study for the establishment of an accuracy estimation method in the finite element method, this paper deals with the problems of transverse bending of thin, flat plates. From the numerical experiments for uniform mesh division, the following relation was deduced, ε ∝ (h/a)^k, k 1, where ε is the error of the computed value by the finite element method relative to the exact solution and h/a is the dimensionless mesh size. Using this relation, an accuracy estimation method, which was based on the adaptive determination of local mesh sizes from two preceding analyses by uniform mesh division, was presented.

A computer program using this accuracy estimation method was developed and applied to 28 problems with various shapes and loading conditions. The usefulness of this accuracy estimation method was illustrated by these application results.     

Cardinal and scattered-cardinal interpolation by functions having non-compact support

In this paper, we introduce the notion “scattered-cardinal interpolation” and obtain a necessary and sufficient condition for the solvability of this interpolation scheme. We also generalize some results of de Boor, Höllig and Riemenschneider, Chui, Jetter and Ward, and Jetter and Riemenschneider on the correctness of l^p-cardinal interpolation on Z^d or its submoduls.     

Interpolation by periodic radial functions

Let d be the natural (geodesic) metric on the circle S¹. We study the interpolation of arbitrary data on a set of equally-spaced nodes Y_i ε S¹ by means of functions having the form

Full-size image

, in which φ is a function at our disposal. A cardinal function is found, and convergence questions can be answered with the aid of it.     

Bivariate hermite subdivision

A subdivision scheme for constructing smooth surfaces interpolating scattered data in R³ is proposed. It is also possible to impose derivative constraints in these points. In the case of functional data, i.e., data are given in a properly triangulated set of points {(x_i, y_i)}_i=1^N from which none of the pairs (x_i,y_i) and (x_j,y_j) with i≠j coincide, it is proved that the resulting surface (function) is C¹. The method is based on the construction of a sequence of continuous splines of degree 3. Another subdivision method, based on constructing a sequence of splines of degree 5 which are once differentiable, yields a function which is C² if the data are not ‘too irregular’. Finally the approximation properties of the methods are investigated.     

Trace detection of nitroaromatic compounds with layer-by-layer assembled {SBA/PSS}n/PDDA modified electrode

The {SBA/PSS}_n/PDDA films modified electrode was prepared by layer-by-layer (LBL) assembly with mesoporous SiO₂ (SBA), poly(sodium 4-styrene-sulfonate) (PSS) and poly(diallyldimethylammonium chloride) (PDDA) in this paper. SBA is a large pore-size mesoporous material with highly ordered hexagonally arranged mesochannels and high thermal stability etc. The electrochemical characteristics of the {SBA/PSS}_n/PDDA films have been studied by electrochemical impedance spectroscopy in 0.1 M KCl solution containing 5.0 mM Fe(CN)₆³⁻/Fe(CN)₆⁴⁻ at the formal potential of 0.230 V. The ultratrace nitroaromatic compounds (NACs) such as TNT, TNB, DNT and DNB were determined by differential pulse voltammetry (DPV) measurement. The sensitivities for NACs determination with {SBA/PSS}_n/PDDA modified electrode were dependent on the number of layers, pH and ionic strength of electrolyte, based on which a set of optimized conditions for film fabrication was inferred. The current responses were linear with NACs ranging from 10⁻⁹ to 10⁻⁷ mol/l. The results showed that the {SBA/PSS}_n/PDDA modified electrode established a new way for fast, simple and sensitive analysis of NACs.     

Efficient enumeration of all minimal separators in a graph

This paper presents an efficient algorithm for enumerating all minimal a-b separators separating given non-adjacent vertices a and b in an undirected connected simple graph G = (V, E), Our algorithm requires O(n³R_ab) time, which improves the known result of O(n⁴R_ab) time for solving this problem, where ¦V¦= n and R_ab is the number of minimal a-b separators. The algorithm can be generalized for enumerating all minimal A-B separators that separate non-adjacent vertex sets A, B < V, and it requires O(n²(n − n_A − n_b)R_AB) time in this case, where n_a = ¦A¦, n_B = ¦B¦ and r_AB is the number of all minimal A−B separators. Using the algorithm above as a routine, an efficient algorithm for enumerating all minimal separators of G separating G into at least two connected components is constructed. The algorithm runs in time O(n³R⁺_Σ + n⁴R_Σ), which improves the known result of O(n⁶R_Σ) time, where R_σ is the number of all minimal separators of G and R_ΣR⁺_Σ = ∑_1i, v_j) ER_vivj n − 1)/2 − m)R_Σ. Efficient parallelization of these algorithms is also discussed. It is shown that the first algorithm requires at most O((n/log n)R_ab) time and the second one runs in time O((n/log n)R⁺_Σ+n log nR_Σ) on a CREW PRAM with O(n³) processors.     

A simple solution to the l optimization problem

It is pointed out in this brief paper that the l¹ optimization problem min_{Q ε lqp¹} | H − U * Q * V |₁, H ε l_mn¹, U ε l_mq¹, V ε l_pn¹ can be solved in one step rather than two. The solution of the dual problem is obviated by the direct solution of the primal problem via linear programming. The method here is applicable to finite-dimensional problems or approximating finite-dimensional problems, in the general case.     

Hydrolyzed colloid reaction (HCR) technique for phosphor powder preparation

Undoped and Eu³⁺, Ce³⁺ and Tb³⁺-doped YVO₄ YPO₄, LaPO₄ and YV_xP_1−xO₄ were prepared in H₂O by the recently introduced hydrolyzed colloid reaction (HCR) technique working at low temperature (<100°C) and atmospheric pressure. Two intermediate — partially hydrophobic — complex colloidal mixtures with metastable characteristics can transform into the stable orthovanadate–orthophosphate phase due to intensive hydrolysis. In contrast with the other low temperature reacting processes — like the sol-gel technique, which makes an amorphous structure — the HCR method can produce crystalline structures in nanometer size ranges. The reaction, morphology, incorporation of activators and different luminescent characteristics are surveyed in this letter-type paper selected from our previous results.