5 resultados para 446
em Greenwich Academic Literature Archive - UK
Resumo:
This paper describes the application of computational fluid dynamics (CFD) to simulate the macroscopic bulk motion of solder paste ahead of a moving squeegee blade in the stencil printing process during the manufacture of electronic components. The successful outcome of the stencil printing process is dependent on the interaction of numerous process parameters. A better understanding of these parameters is required to determine their relation to print quality and improve guidelines for process optimization. Various modelling techniques have arisen to analyse the flow behaviour of solder paste, including macroscopic studies of the whole mass of paste as well as microstructural analyses of the motion of individual solder particles suspended in the carrier fluid. This work builds on the knowledge gained to date from earlier analytical models and CFD investigations by considering the important non-Newtonian rheological properties of solder pastes which have been neglected in previous macroscopic studies. Pressure and velocity distributions are obtained from both Newtonian and non-Newtonian CFD simulations and evaluated against each other as well as existing established analytical models. Significant differences between the results are observed, which demonstrate the importance of modelling non-Newtonian properties for realistic representation of the flow behaviour of solder paste.
Resumo:
This paper presents a genetic algorithm for finding a constrained minimum spanning tree. The problem is of relevance in the design of minimum cost communication networks, where there is a need to connect all the terminals at a user site to a terminal concentrator in a multipoint (tree) configuration, while ensuring that link capacity constraints are not violated. The approach used maintains a distinction between genotype and phenotype, which produces superior results to those found using a direct representation in a previous study.
Resumo:
We extend the Harris regularity condition for ordinary Markov branching process to a more general case of non-linear Markov branching process. A regularity criterion which is very easy to check is obtained. In particular, we prove that a super-linear Markov branching process is regular if and only if the per capita offspring mean is less than or equal to I while a sub-linear Markov branching process is regular if the per capita offspring mean is finite. The Harris regularity condition then becomes a special case of our criterion.
Resumo:
This paper reports a study investigating the relationship between Internet identification, Internet anxiety and Internet use. The participants were 446 students (319 females and 127 males) from two universities in the UK and one university in Australia. Measures of Internet identification and Internet anxiety were developed. The majority of participants were NOT anxious about using the Internet, although there were approximately 8% who showed evidence of Internet anxiety. There was a significant and negative relationship between Internet anxiety and Internet use. Those who were more anxious about using the Internet used the Internet less, although the magnitude of effect was small. There was a positive and significant relationship between Internet use and Internet identification. Those who scored high on the measure of Internet identification used the Internet more than those who did not. There was also a significant and negative relationship between Internet anxiety and Internet identification. Finally, males had a significantly higher Internet identification score than females. Implications of these findings are discussed.