371 resultados para Mathematics Library


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A method is presented for computing the fields produced by radio frequency probes of the type used in magnetic resonance imaging. The effects of surrounding the probe with a shielding coil, intended to eliminate stray fields produced outside the probe, are included. An essential feature of these devices is the fact that the conducting rungs of the probe are of finite width relative to the coil radius, and it is therefore necessary to find the distribution of current within the conductors as part of the solution process. This is done here using a numerical method based on the inverse finite Hilbert transform, applied iteratively to the entire structure including its shielding coils. It is observed that the fields are influenced substantially by the width of the conducting rungs of the probe, since induced eddy currents within the rungs become more pronounced as their width is increased. The shield is also shown to have a significant effect on both the primary current density and the resultant fields. Quality factors are computed for these probes and compared with values measured experimentally.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We prove two asymptotical estimates for minimizers of a Ginzburg-Landau functional of the form integral(Omega) [1/2 \del u\(2) + 1/4 epsilon(2) (1 - \u\(2))(2) W (x)] dx.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A recent result of Bryant and Lindner shows that the quasigroups arising from 2-perfect m-cycle systems form a variety only when m = 3, 5 and 7. Here we investigate the situation in the case where the distance two cycles are required to be in the original system.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In an article in 1992, Drapal addressed the question of how far apart the multiplication tables of two groups can be? In this article we continue this investigation; in particular, we study the interaction between partial equalities in the multiplication tables of the two groups and their subgroup structure. (C) 1997 John Wiley & Sons, Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

When linear equality constraints are invariant through time they can be incorporated into estimation by restricted least squares. If, however, the constraints are time-varying, this standard methodology cannot be applied. In this paper we show how to incorporate linear time-varying constraints into the estimation of econometric models. The method involves the augmentation of the observation equation of a state-space model prior to estimation by the Kalman filter. Numerical optimisation routines are used for the estimation. A simple example drawn from demand analysis is used to illustrate the method and its application.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we completely settle the embedding problem for m-cycle systems with m less than or equal to 14. We also solve the more general problem of finding m-cycle systems of K-v - K-u when m is an element of {4,6,7,8,10,12,14}.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The dispersion model with mixed boundary conditions uses a single parameter, the dispersion number, to describe the hepatic elimination of xenobiotics and endogenous substances. An implicit a priori assumption of the model is that the transit time density of intravascular indicators is approximated by an inverse Gaussian distribution. This approximation is limited in that the model poorly describes the tail part of the hepatic outflow curves of vascular indicators. A sum of two inverse Gaussian functions is proposed as ail alternative, more flexible empirical model for transit time densities of vascular references. This model suggests that a more accurate description of the tail portion of vascular reference curves yields an elimination rate constant (or intrinsic clearance) which is 40% less than predicted by the dispersion model with mixed boundary conditions. The results emphasize the need to accurately describe outflow curves in using them as a basis for determining pharmacokinetic parameters using hepatic elimination models. (C) 1997 Society for Mathematical Biology.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study examined group and individual factors that facilitate changes in cooperation and learning outcomes in trained and untrained work groups of elementary school-age children. The study had two foci. The first was to determine if the cooperative behaviors and interactions of children in classroom groups who were trained in cooperative learning skins were different from those of children who were given no training, and the second was to investigate small group interactions and achievement in these groups over time. The results showed that there were observable differences between student interactions in the two conditions and these differences were maintained over time. Compared with children in the untrained groups, those in the trained groups were consistently more cooperative and helpful to each other; they actively tried to involve each other in the learning task by using language which was more inclusive (e.g., frequent use of ''we''), and they gave more explanations to assist each other as they worked together. It appeared that as the children worked together over time, they became more responsive to the learning needs of each other. Furthermore, the children in the trained groups performed significantly better on the learning outcomes questionnaire than those in the untrained groups. (C) 1997 Society for the Study of School Psychology. Published by Elsevier Science Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new conceptual model for soil pore-solid structure is formalized. Soil pore-solid structure is proposed to comprise spatially abutting elements each with a value which is its membership to the fuzzy set ''pore,'' termed porosity. These values have a range between zero (all solid) and unity (all pore). Images are used to represent structures in which the elements are pixels and the value of each is a porosity. Two-dimensional random fields are generated by allocating each pixel a porosity by independently sampling a statistical distribution. These random fields are reorganized into other pore-solid structural types by selecting parent points which have a specified local region of influence. Pixels of larger or smaller porosity are aggregated about the parent points and within the region of interest by controlled swapping of pixels in the image. This creates local regions of homogeneity within the random field. This is similar to the process known as simulated annealing. The resulting structures are characterized using one-and two-dimensional variograms and functions describing their connectivity. A variety of examples of structures created by the model is presented and compared. Extension to three dimensions presents no theoretical difficulties and is currently under development.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background. The formation and measurement of self-concept were the foci of this research. Aims. The study aimed to investigate the influence of achievement on academic self-concept and to compare the Perception of Ability Scale for Students (PASS, Boersma & Chapman, 1992) with the Self-Description Questionnaire-1 (SDQ-1, Marsh, 1988). Sample. The participants were 479 grade 5 (mean age 126.6 months) coeducational Australian students, located in 18 schools. Method. An intra-class research design was used to investigate the influence of frame-of-reference on self-concept development. Results. As students' academic scores rose above their class mean their self-concepts increased and as students' academic scores fell below their class mean their self-concepts decreased. Students' difference from class mean predicted their self-concept scores. This finding was consistently shown across the reading, spelling, and mathematics domains using test and teaching rating data. A comparison between the PASS and the SDQ-1 demonstrated concurrent validity across self-concept domains. Conclusion. The findings support the notions that the social environment is a significant agent that influences self-concept, and that teacher ratings and standardised tests of achievement and the PASS and the SDQ-1 are valid measures for self-concept research.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

For all m greater than or equal to 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.