371 resultados para Mathematics Library
Resumo:
The present investigation assessed the reliability and validity of the scores of a subjective measure of desired aspirations and a behavioral measure of enacted aspirations. A sample of 5,655 employees was randomly split into two halves. Principal components analysis on Sample 1, followed by confirmatory factor analysis on Sample 2, confirmed the desired and enacted scales as distinct but related measures of managerial aspirations. The desired and enacted scales had satisfactory levels of internal consistency and temporal stability over a 1-year period. Relationships between the measures of desired and enacted managerial aspirations and both attitudinal and behavioral criteria, measured concurrently and 1 year later, provided preliminary support for convergent and discriminant validity for our sample. Desired aspirations demonstrated stronger validity than enacted aspirations. Although further examination of the psychometric properties of the scales is warranted, the present findings provide promising support for their validity and reliability for our sample.
Resumo:
In this paper I give details of new constructions for critical sets in latin squares. These latin squares, of order n, are such that they can be partitioned into four subsquares each of which is based on the addition table of the integers module n/2, an isotopism of this or a conjugate.
Resumo:
A novel screening strategy has been developed for the identification of alpha-chymotrypsin inhibitors from a phage peptide library. In this strategy, the standard affinity selection protocol was modified by adding a proteolytic cleavage period to avoid recovery of alpha-chymotrypsin substrates. After four cycles of selection and further activity assay, a group of related peptides were identified by DNA sequencing. These peptides share a consensus sequence motif as (S/T)RVPR(R/H). Then, a corresponding short peptide (Ac-ASRVPRRG-NH2) was synthesized chemically and proved to be an inhibitor of alpha-chymotrypsin. The present work provides a useful way for searching proteinase inhibitors without detailed knowledge of the molecular structure.
Resumo:
Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.
Resumo:
Subcycling algorithms which employ multiple timesteps have been previously proposed for explicit direct integration of first- and second-order systems of equations arising in finite element analysis, as well as for integration using explicit/implicit partitions of a model. The author has recently extended this work to implicit/implicit multi-timestep partitions of both first- and second-order systems. In this paper, improved algorithms for multi-timestep implicit integration are introduced, that overcome some weaknesses of those proposed previously. In particular, in the second-order case, improved stability is obtained. Some of the energy conservation properties of the Newmark family of algorithms are shown to be preserved in the new multi-timestep extensions of the Newmark method. In the first-order case, the generalized trapezoidal rule is extended to multiple timesteps, in a simple way that permits an implicit/implicit partition. Explicit special cases of the present algorithms exist. These are compared to algorithms proposed previously. (C) 1998 John Wiley & Sons, Ltd.
Resumo:
Matheron (1971) proposed an approximation of the extension variance in IR. We propose in this note an extension of this formula in IR2, based on a MacLaurin formula. Its application is shown in an example, the estimation of the maximum depressional storage of a soil surface.
Resumo:
Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.
Resumo:
In an experimental investigation of the response of a chaotic system to a chaotic driving force, we have observed synchronization of chaos of the response system in the forms of generalized synchronization, phase synchronization, and lag synchronization to the driving signal. In this paper we compare the features of these forms of synchronized chaos and study their relations and physical origins. We found that different forms of chaotic synchronization could be interpreted as different stages of nonlinear interaction between the coupled chaotic systems. (C) 1998 American Institute of Physics.
Resumo:
Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.
Resumo:
In response to methodological concerns associated with previous research into the educational characteristics of students with high or low self-concept, the topic was re-examined using a significantly more representative sample and a contemporary self-concept measure. From an initial screening of 515 preadolescent, coeducational students in 18 schools, students significantly high or low in self-concept were compared using standardized tests in reading, spelling, and mathematics, and teacher interviews to determine students' academic and nonacademic characteristics. The teachers were not informed of the self-concept status of the students. Compared to students with low self-concept, students with high self-concept were rated by teachers as being more popular, cooperative, and persistent in class, showed greater leadership, were lower in anxiety, had more supportive families, and had higher teacher expectations for their future success. Teachers observed that students with low self-concept were quiet and withdrawn, while peers with high self-concept were talkative and more dominating with peers. Students with lower self-concepts were also lower than their peers in reading, spelling, and mathematical abilities. The findings support the notion that there is an interactive relationship between self-concept and achievement. (C) 1998 John Wiley & Sons, Inc.
Resumo:
A generalization of the classical problem of optimal lattice covering of R-n is considered. Solutions to this generalized problem are found in two specific classes of lattices. The global optimal solution of the generalization is found for R-2. (C) 1998 Elsevier Science Inc. All rights reserved.
Resumo:
In the author's joint paper [HJS] with Jest and Struwe, we discuss asymtotic limits of a self-dual Ginzburg-Landau functional involving a section of a line bundle over a closed Riemann surface and a connection on this bundle. In this paper, the author generalizes the above results [HJS] to the case of bounded domains.
Resumo:
Recently the problem of the existence of a 5-cycle system of K-v with a hole of size u was completely solved. In this paper we prove necessary and sufficient conditions on v and u for the existence of a 5-cycle system of K-v - F, with a hole of size u.
Resumo:
We present finite element simulations of temperature gradient driven rock alteration and mineralization in fluid saturated porous rock masses. In particular, we explore the significance of production/annihilation terms in the mass balance equations and the dependence of the spatial patterns of rock alteration upon the ratio of the roll over time of large scale convection cells to the relaxation time of the chemical reactions. Special concepts such as the gradient reaction criterion or rock alteration index (RAI) are discussed in light of the present, more general theory. In order to validate the finite element simulation, we derive an analytical solution for the rock alteration index of a benchmark problem on a two-dimensional rectangular domain. Since the geometry and boundary conditions of the benchmark problem can be easily and exactly modelled, the analytical solution is also useful for validating other numerical methods, such as the finite difference method and the boundary element method, when they are used to dear with this kind of problem. Finally, the potential of the theory is illustrated by means of finite element studies related to coupled flow problems in materially homogeneous and inhomogeneous porous rock masses. (C) 1998 Elsevier Science S.A. All rights reserved.
Resumo:
The study investigated the behaviors and interactions of children in structured and unstructured groups as they worked together on a 6-week social studies activity each term for 3 school terms. Two hundred and twelve children in Grade 1 and 184 children in Grade 3 participated in the study. Stratified random assignment occurred so that each gender-balanced group consisted of 1 high-, 2 medium-, and 1 low-ability student. The results show that the children in the structured groups were consistently more cooperative and they provided more elaborated and nonelaborated help than did their peers in the unstructured groups. The children in the structured groups in Grade 3 obtained higher reading and learning outcome scores than their peers in the unstructured groups.