823 resultados para granular computing
Resumo:
We derive boundary conditions at a rigid wall for a granular material comprising rough, inelastic particles. Our analysis is confined to the rapid flow, or granular gas, regime in which grains interact by impulsive collisions. We use the Chapman-Enskog expansion in the kinetic theory of dense gases, extended for inelastic and rough particles, to determine the relevant fluxes to the wall. As in previous studies, we assume that the particles are spheres, and that the wall is corrugated by hemispheres rigidly attached to it. Collisions between the particles and the wall hemispheres are characterized by coefficients of restitution and roughness. We derive boundary conditions for the two limiting cases of nearly smooth and nearly perfectly rough spheres, as a hydrodynamic description of granular gases comprising rough spheres is appropriate only in these limits. The results are illustrated by applying the equations of motion and boundary conditions to the problem of plane Couette flow.
Resumo:
The slow flow of granular materials is often marked by the existence of narrow shear layers, adjacent to large regions that suffer little or no deformation. This behaviour, in the regime where shear stress is generated primarily by the frictional interactions between grains, has so far eluded theoretical description. In this paper, we present a rigid-plastic frictional Cosserat model that captures thin shear layers by incorporating a microscopic length scale. We treat the granular medium as a Cosserat continuum, which allows the existence of localised couple stresses and, therefore, the possibility of an asymmetric stress tensor. In addition, the local rotation is an independent field variable and is not necessarily equal to the vorticity. The angular momentum balance, which is implicitly satisfied for a classical continuum, must now be solved in conjunction with the linear momentum balances. We extend the critical state model, used in soil plasticity, for a Cosserat continuum and obtain predictions for flow in plane and cylindrical Couette devices. The velocity profile predicted by our model is in qualitative agreement with available experimental data. In addition, our model can predict scaling laws for the shear layer thickness as a function of the Couette gap, which must be verified in future experiments. Most significantly, our model can determine the velocity field in viscometric flows, which classical plasticity-based model cannot.
Resumo:
A continuum model based on the critical-state theory of soil mechanics is used to generate stress, density, and velocity profiles, and to compute discharge rates for the flow of granular material in a mass flow bunker. The bin–hopper transition region is idealized as a shock across which all the variables change discontinuously. Comparison with the work of Michalowski (1987) shows that his experimentally determined rupture layer lies between his prediction and that of the present theory. However, it resembles the former more closely. The conventional condition involving a traction-free surface at the hopper exit is abandoned in favour of an exit shock below which the material falls vertically with zero frictional stress. The basic equations, which are not classifiable under any of the standard types, require excessive computational time. This problem is alleviated by the introduction of the Mohr–Coulomb approximation (MCA). The stress, density, and velocity profiles obtained by integration of the MCA converge to asymptotic fields on moving down the hopper. Expressions for these fields are derived by a perturbation method. Computational difficulties are encountered for bunkers with wall angles θw [gt-or-equal, slanted] 15° these are overcome by altering the initial conditions. Predicted discharge rates lie significantly below the measured values of Nguyen et al. (1980), ranging from 38% at θw = 15° to 59% at θw = 32°. The poor prediction appears to be largely due to the exit condition used here. Paradoxically, incompressible discharge rates lie closer to the measured values. An approximate semi-analytical expression for the discharge rate is obtained, which predicts values within 9% of the exact (numerical) ones in the compressible case, and 11% in the incompressible case. The approximate analysis also suggests that inclusion of density variation decreases the discharge rate. This is borne out by the exact (numerical) results – for the parameter values investigated, the compressible discharge rate is about 10% lower than the incompressible value. A preliminary comparison of the predicted density profiles with the measurements of Fickie et al. (1989) shows that the material within the hopper dilates more strongly than predicted. Surprisingly, just below the exit slot, there is good agreement between theory and experiment.
Resumo:
The tendency of granular materials in rapid shear ow to form non-uniform structures is well documented in the literature. Through a linear stability analysis of the solution of continuum equations for rapid shear flow of a uniform granular material, performed by Savage (1992) and others subsequently, it has been shown that an infinite plane shearing motion may be unstable in the Lyapunov sense, provided the mean volume fraction of particles is above a critical value. This instability leads to the formation of alternating layers of high and low particle concentrations oriented parallel to the plane of shear. Computer simulations, on the other hand, reveal that non-uniform structures are possible even when the mean volume fraction of particles is small. In the present study, we have examined the structure of fully developed layered solutions, by making use of numerical continuation techniques and bifurcation theory. It is shown that the continuum equations do predict the existence of layered solutions of high amplitude even when the uniform state is linearly stable. An analysis of the effect of bounding walls on the bifurcation structure reveals that the nature of the wall boundary conditions plays a pivotal role in selecting that branch of non-uniform solutions which emerges as the primary branch. This demonstrates unequivocally that the results on the stability of bounded shear flow of granular materials presented previously by Wang et al. (1996) are, in general, based on erroneous base states.
Resumo:
Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.
Resumo:
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple 1-D combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously change to the immediately preceding value. We derive several properties of codes that correct this type of errors, focusing on bounds on their cardinality. We also define a probabilistic finite-state channel model of the storage medium, and derive lower and upper estimates of its capacity. A lower bound is derived by evaluating the symmetric capacity of the channel, i.e., the maximum transmission rate under the assumption of the uniform input distribution of the channel. An upper bound is found by showing that the original channel is a stochastic degradation of another, related channel model whose capacity we can compute explicitly.
Resumo:
Information forms the basis of modern technology. To meet the ever-increasing demand for information, means have to be devised for a more efficient and better-equipped technology to intelligibly process data. Advances in photonics have made their impact on each of the four key applications in information processing, i.e., acquisition, transmission, storage and processing of information. The inherent advantages of ultrahigh bandwidth, high speed and low-loss transmission has already established fiber-optics as the backbone of communication technology. However, the optics to electronics inter-conversion at the transmitter and receiver ends severely limits both the speed and bit rate of lightwave communication systems. As the trend towards still faster and higher capacity systems continues, it has become increasingly necessary to perform more and more signal-processing operations in the optical domain itself, i.e., with all-optical components and devices that possess a high bandwidth and can perform parallel processing functions to eliminate the electronic bottleneck.
Resumo:
Fragment Finder 2.0 is a web-based interactive computing server which can be used to retrieve structurally similar protein fragments from 25 and 90% nonredundant data sets. The computing server identifies structurally similar fragments using the protein backbone C alpha angles. In addition, the identified fragments can be superimposed using either of the two structural superposition programs, STAMP and PROFIT, provided in the server. The freely available Java plug-in Jmol has been interfaced with the server for the visualization of the query and superposed fragments. The server is the updated version of a previously developed search engine and employs an in-house-developed fast pattern matching algorithm. This server can be accessed freely over the World Wide Web through the URL http://cluster.physics.iisc.ernet.in/ff/.
Resumo:
The effect of base dissipation on the granular flow down an inclined plane is examined by altering the coefficient of restitution between the moving and base particles in discrete element (DE) simulations. The interaction laws between two moving particles are kept fixed, and the coefficient of restitution (damping constant in the DE simulations) between the base and moving particles are altered to reduce dissipation, and inject energy from the base. The energy injection does result in an increase in the strain rate by up to an order of magnitude, and the temperature by up to two orders of magnitude at the base. However, the volume fraction, strain rate and temperature profiles in the bulk (above about 15 particle diameters from the base) are altered very little by the energy injection at the base. We also examine the variation of h(stop), the minimum height at the cessation of flow, with energy injection from the base. It is found that at a fixed angle of inclination, h(stop) decreases as the energy dissipation at the base decreases.