5 resultados para complexity in spatiotemporal evolution
em Greenwich Academic Literature Archive - UK
Resumo:
This study examines the roll-out of a collaborative information repository or 'knowledge-base' in a medium-sized UK professional services firm over a six year period. Data from usage logs provides the basis for analysis of the dynamic evolution of social networks around the depository during this time. The adoption pattern follows an 's-curve' and usage exhibits something of a power law distribution, both attributable to network effects and network opposition is associated with organisational performance on a number of indicators. But periodicity in usage is evident and the usage distribution displays an exponential cut-off. Fourier analysis provides some evidence of mathematical complexity in the periodicity. Some implications of complex patterns in social network data for research and management are discussed.
Resumo:
From the model geometry creation to the model analysis, the stages in between such as mesh generation are the most manpower intensive phase in a mesh-based computational mechanics simulation process. On the other hand the model analysis is the most computing intensive phase. Advanced computational hardware and software have significantly reduced the computing time - and more importantly the trend is downward. With the kind of models envisaged coming, which are larger, more complex in geometry and modelling, and multiphysics, there is no clear trend that the manpower intensive phase is to decrease significantly in time - in the present way of operation it is more likely to increase with model complexity. In this paper we address this dilemma in collaborating components for models in electronic packaging application.
Resumo:
Existing election algorithms suffer limited scalability. This limit stems from the communication design which in turn stems from their fundamentally two-state behaviour. This paper presents a new election algorithm specifically designed to be highly scalable in broadcast networks whilst allowing any processing node to become coordinator with initially equal probability. To achieve this, careful attention has been paid to the communication design, and an additional state has been introduced. The design of the tri-state election algorithm has been motivated by the requirements analysis of a major research project to deliver robust scalable distributed applications, including load sharing, in hostile computing environments in which it is common for processing nodes to be rebooted frequently without notice. The new election algorithm is based in-part on a simple 'emergent' design. The science of emergence is of great relevance to developers of distributed applications because it describes how higher-level self-regulatory behaviour can arise from many participants following a small set of simple rules. The tri-state election algorithm is shown to have very low communication complexity in which the number of messages generated remains loosely-bounded regardless of scale for large systems; is highly scalable because nodes in the idle state do not transmit any messages; and because of its self-organising characteristics, is very stable.
Resumo:
The presented numerical modelling for the magnetic levitation involves coupling of the electromagnetic field, liquid shape change, fluid velocities and the temperature field at every time step during the simulation in time evolution. Combination of the AC and DC magnetic fields can be used to achieve high temperature, stable levitation conditions. The oscillation frequency spectra are analysed for droplets levitated in AC and DC magnetic fields at various combinations. An electrically poorly conducting, diamagnetic droplet (e.g. water) can be stably levitated using the dia- and para-magnetic properties of the sample material in a high intensity, gradient DC field.
Resumo:
Bulk and interdendritic flow during solidification alters the microstructure development, potentially leading to the formation of defects. In this paper, a 3D numerical model is presented for the simulation of dendritic growth in the presence of fluid flow in both liquid and semi-solid zones during solidification. The dendritic growth was solved by the combination of a stochastic nucleation approach with a finite difference solution of the solute diffusion equation and. a projection method solution of the Navier-Stokes equations. The technique was applied first to simulate the growth of a single dendrite in 2D and 3D in an isothermal environment with forced fluid flow. Significant differences were found in the evolution of dendritic morphology when comparing the 2D and 3D results. In 3D the upstream arm has a faster growth velocity due to easier flow around the perpendicular arms. This also promotes secondary arm formation on the upstream arm. The effect of fluid flow on columnar dendritic growth and micro-segregation in constrained solidification conditions is then simulated. For constrained growth, 2D simulations lead to even greater inaccuracies as compared to 3D.