This paper discusses two problems from important areas of process modelling, namely injection moulding and resin film infusion. The first comes from the food-processing sector, and involves the filling of tubs with liquid foodstuffs. The approach taken here is computational, with the foodstuffs modelled as incompressible viscous (Newtonian or non-Newtonian) fluids. In practice, the liquids have multiple free surfaces; the correct treatment of these surfaces is a crucial element of the modelling herein. Resin film infusion is one of the preferred processes for the manufacture of composite materials. In essence it involves squeezing a viscous incompressible fluid into a woven carbon-fibre matrix. With the matrix treated as a porous medium, and with exothermic reactions (and consequent thermal effects) neglected, simple analytical results are obtainable which can be verified by straightforward engineering experiments.
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Computer operations involving complex numbers, essential in such applications as Fourier transforms or image processing, are normally performed in a 'divide-and-conquer' approach dealing separately with real and imaginary parts. A number of proposals have treated complex numbers as a single unit but all have foundered on the problem of the division process without which it is impossible to carry out all but the most basic arithmetic. This paper resurrects an early proposal to express complex numbers in a single 'binary' representation, reviews basic complex arithmetic and is able to provide a fail-safe procedure for obtaining the quotient of two complex numbers expressed in the representation. Thus, while an outstanding problem is solved, recourse is made only to readily accessible methods. A variety of extensions to the work requiring similar basic techniques are also identified. An interesting side-line is the occurrence of fractal structures, and the power of the 'binary' representation in analysing the structure is briefly discussed.
For years complex numbers have been treated as distant relatives of real numbers despite their widespread applications in the fields of electrical and computer engineering. These days computer operations involving complex numbers are most commonly performed by applying divide-and-conquer technique whereby each complex number is separated into its real and imaginary parts, operations are carried out on each group of real and imaginary components, and then the final result of the operation is obtained by accumulating the individual results of the real and imaginary components. This technique forsakes the advantages of using complex numbers in computer arithmetic and there exists a need, at least for some problems, to treat a complex number as one unit and to carry out all operations in this form. In this paper, we have analyzed and proposed a (–1–j)-base binary number system for complex numbers. We have discussed the arithmetic operations of two such binary numbers and outlined work which is currently underway in this area of computer arithmetic.
This paper analyses a set of world records in athletic running events to extract long-term bounds for those events. The approach adopted is to identify a single parameter to represent the achieved standard of athletic performance at a series of fixed intervals. The long-term behaviour of this single parameter is then investigated by fitting a variety of non-linear models and restrictions on the accuracy of the fits are discussed. The paper concludes with a range of estimates for each of the events considered in the original data set.
Within the bounds of a general theory of rank correlation two particular measures have been adopted widely: Spearman7apos;s rank correlation coefficient, ρ in which ranks replace variates in Pearson's product‐moment correlation calculation; and Kendall's τ in which the disarray of x ‐ordered data due to a y ‐ordering is measured by counting the minimum number, s ; of transpositions (interchanges between adjacent ranks) of the y ‐ordering sufficient to recover the x‐ordering. Based on insights from the calculation of Kendall's coefficient, this paper develops a graphical approach which leads to a new rank correlation coefficient akin to that of Spearman. This measure appears to stand outside general theorybut has greater power of discrimination amongst differing reorderings of the data whilst simultaneously being strongly correlated with both ρ and τ. The development is focused on situations where agreement over ordering is more important for top place getters than for those lower down the order as, for example, in subjectively judged Olympic events such as ice skating. The basic properties of the proposed coefficient are identified.
Computer operations involving complex numbers, essential in such applications as digital signal processing and image processing, are usually performed in a "divide-and-conquer" approach dealing separately with the real and imaginary parts and then accumulating the results. There have been several proposals to treat complex numbers as a single unit but all seem to have floundered on the basic problem of the division process without which, of course, it is impossible to carry out all but the most basic arithmetic. This paper resurrects an early proposal to express complex numbers in a single "binary" representation and provides a fail-safe procedure for obtaining the quotient of two complex numbers expressed in this representation.
Abstract Studies of kurtosis often concentrate on only symmetric distributions. This paper identifies a process through which the standardized measure of kurtosis based on the fourth moment about the mean can be written in terms of two parts: (i) an irreducible component, about L 4 , which can be seen to occur naturally in the analysis of fourth moments; (ii) terms that depend only on moments of lower order, in particular including the effects of asymmetry attached to the third moment about the mean. This separation of the effect of skewness allows definition of an improved measure of kurtosis. This paper calculates and discusses examples of the new measure of kurtosis for a range of standard distributions.
This paper shows that the method of ‘reduction of order’ is both a simpler way of teaching and of obtaining solutions for inhomogeneous linear ordinary differential equations than is the normally espoused method of ‘variation of parameters’. Details are given of the results of the method for the general nth order equation and the two methods are compared for n = 2, 3. It will be noted that the proposed method takes a particularly simple form when the right‐hand side of the equation is a multiple of one of the solutions to the related homogeneous equation.