Shakedown analysis of circular plates using a yield criterion of the mean

Structural optimization based on the shakedown theory is a powerful and promising technique. However, due to the nonlinearities of physical materials and the number of variable loads in real structures, it is computationally complex and time-consuming. To simplify the occurring non-linear, non-convex optimization problems, the paper suggests reducing the number of yield conditions. The so-called a yield criterion of the mean (integral yield condition) is analysed and explained in detail, which allows taking into account one yield condition for the entire finite element instead of multiple point-wise conditions. This approach shows promising results in numerical application to the optimization of a circular plate, considering a possibility of employing the yield criteria of the mean or pointwise yield conditions in different areas of the plate in particular. The methods applied are based on the assumptions of perfect plasticity and small deformations.     

Convergence with a fixed regulator in lattice ordered groups and applications to MV-algebras

A convergence with a fixed regulator v in lattice ordered groups is applied to MV-algebras. For each Archimedean MV-algebra A there exists a v-Cauchy completion A ^* and it is uniquely determined up to isomorphisms over A. The relation between the Dedekind completion A ^∧ of A and A ^* is established. There is solved a question of the existence of the greatest v-Cauchy complete ideal of A.     

Estimation and setting starting values in ARMA algorithms

For the given observations set of the ARMA (autoregressive moving average) process, the likelihood function depends, not only on model parameters, but on the starting values of the input and output. Therefore, it is called theconditional likelihood function. Theunconditional likelihood function can be obtained in two ways. The first is to set the starting values to zero, as is often done, and the second is to set them to the properly estimated values. The difference between these two types of likelihood functions is significant when the given data sequence is short, and any of the zeros of the moving average part is close to the boundary of the unit circle.In this paper the direct method of starting value estimation and its application to two off-line ARMA estimation algorithms, the maximum likelihood (ML) algorithm and the iterative inverse filtering (ITIF) algorithm, is proposed. Experimental results prove both increased efficiency and stability of these algorithms.The importance of setting the starting values properly is also significant when the recursive algorithm, with previously estimated parameters, has to be restarted. The advantage of the proposed reinitialization method is shown on the recursive lattice algorithm working in the block mode.     

Conversion electron Mössbauer spectroscopy of the surface crystallization of the Fe75Co9B16 amorphous alloy

Using a new design of helium-methane gas-flow detector of conversion electrons for Mössbauer spectroscopy, non-uniform nucleation of the primary -Fe-Co phase on both contact and free surfaces of the Ar(+H₂) annealed amorphous Fe₇₅Co₉B₁₆ alloy was observed in its early crystallization stage. In this state the amount of crystalline phase on the contact ribbon side surpasses that on the free one by a factor of three, whereas no traces of volume crystallization were observed in the transmission spectra. By applying ion implantation to both ribbon surfaces, a slight reduction of the crystalline phase contribution was found. Magnetic domain structure observations were performed in order to evaluate the influence of surface crystallization on magnetic properties.     

Influence of Particle Size Distribution,Moisture Content,and Particle Shape on the Flow Properties of Bulk Solids

Abstract

There has been a great deal of research on characterising bulk solids. However, some of the characteristics, particularly the time‐dependent and random changes of properties, still remain insufficiently understood. The focus of this article is to study the influence of particle size, size distribution, moisture content, and particle shape on the unconfined yield strength of bulk solids. We present some interesting results about the influence of the particle size distribution on the unconfined yield strength of a bulk solid and a new method for determining the influence of particle shape on the unconfined yield strength of a bulk solid, which was made possible by the design and use of a novel attritor.     

Impact of computer training courses on reduction of loneliness of older people in Finland and Slovenia

Previous research has shown loneliness as a threat for the quality of life of older people; therefore the goal of the intervention in a quasi-experimental study was to evaluate and discuss the self-reported level of loneliness of older people in Finland and Slovenia before and after a computer intervention. Intervention in a quasi-experimental study was conducted among 58 older participants at the baseline (M = 72.4 years) and 45 older participants at the follow-up research study (M = 72.9 years). Inferential statistics showed a significant difference in the reduction of loneliness between the countries, and a decreased level of loneliness of older people after completing the computer training course. Although older people experience many age-related problems which may reduce their interest in learning information and communication technology (ICT) skills, it is important that they are computer-proficient, because computer engagement can reduce the level of loneliness of older people and in this way has a positive effect on their quality of life.     

Brooksʼ Theorem for generalized dart graphs

The well-known Brooks? Theorem says that each graph G of maximum degree $k?3$ is k-colorable unless $G=K_{k+1}$. We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood.     

On using planning poker for estimating user stories

While most studies in psychology and forecasting stress the possible hazards of group processes when predicting effort and schedule, agile software development methods recommend the use of a group estimation technique called planning poker for estimating the size of user stories and developing release and iteration plans. It is assumed that the group discussion through planning poker helps in identifying activities that individual estimators could overlook, thus providing more accurate estimates and reducing the over-optimism that is typical for expert judgment-based methods. In spite of the widespread use of agile methods, there is little empirical evidence regarding the accuracy of planning poker estimates. In order to fill this gap a study was conducted requiring 13 student teams to develop a Web-based student records information system. All teams were given the same set of user stories which had to be implemented in three Sprints. Each team estimated the stories using planning poker and the estimates provided by each team member during the first round were averaged to obtain the statistical combination for further comparison. In the same way the stories were estimated by a group of experts. The study revealed that students’ estimates were over-optimistic and that planning poker additionally increased the over-optimism. On the other hand, the experts’ estimates obtained through planning poker were much closer to actual effort spent and tended to be more accurate than the statistical combination of their individual estimates. The results indicate that the optimism bias caused by group discussion diminishes or even disappears as the expertise of the people involved in the group estimation process increases.