Analysis of a thick plate with a circular hole resting on a smooth rigid bed and subjected to axisymmetric normal load

A solution for the stresses and displacements in an radially infinite thick plate having a circular hole, one face of which resting on a smooth rigid bed and the other face subjected to axisymmetric normal loading is given. The solution is obtained in terms of Fourier-Bessel series and integral for the Love's stress function. Numerical results are presented for one particular ratio of thickness of plate to the hole radius and loading. It is also shown that the Poisson's ratio has a predominant effect on certain stresses and displacements. The solution would be useful in the stress analysis of bolted joints.Eine Lösung für die Spannungen und Verschiebungen in einer radial, unendlich ausgedehnten, dicken Platte mit einem kreisförmigen Loch, wobei eine Seite auf einer ebenen, starren Unterlage aufliegt, die andere Seite durch eine achsensymmetrische Vertikallast belastet ist, wird angegeben. Die Lösung wird in Form von Fourier-Bessel-Reihen und Integralen der Loveschen Spannungsfunktion angegeben. Numerische Ergebnisse werden für ein bestimmtes Verhältnis der Plattendicke zum Lochradius sowie zur Belastung angegeben. Es wird auch gezeigt, daß das Poisssonsche Verhältnis einen besonderen Einfluß auf bestimmte Spannungen und Verschiebungen hat. Die Lösung ist anwendbar für die Spannungsermittlung von Bolzenverbindungen.

Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler

A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same exponentially distributed service requirements, the probabilistic splitting of the generic stream that minimizes the average job response time is such that it balances the server idle times in a weighted least-squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times if the service speeds are all equal. This result is used to develop adaptive quasi-static algorithms for allocating jobs in the generic arrival stream when the load parameters are unknown. The algorithms utilize server idle-time measurements which are sent periodically to the central job scheduler. A model is developed for these measurements, and the result mentioned is used to cast the problem into one of finding a projection of the root of an affine function, when only noisy values of the function can be observed

Vehicle Routing Problem with Load Compatibility Constraints

The major contribution of this paper is to introduce load compatibility constraints in the mathematical model for the capacitated vehicle routing problem with pickup and deliveries. The employee transportation problem in the Indian call centers and transportation of hazardous materials provided the motivation for this variation. In this paper we develop a integer programming model for the vehicle routing problem with load compatibility constraints. Specifically two types of load compatability constraints are introduced, namely mutual exclusion and conditional exclusion. The model is demonstrated with an application from the employee transportation problem in the Indian call centers.

Prediction of load-deflection behaviour using fracture energy GF: A comparative study of two fracture models for concrete

Load-deflection curves for a notched beam under three-point load are determined using the Fictitious Crack Model (FCM) and Blunt Crack Model (BCM). Two values of fracture energy GF are used in this analysis: (i) GF obtained from the size effect law and (ii) GF obtained independently of the size effect. The predicted load-deflection diagrams are compared with the experimental ones obtained for the beams tested by Jenq and Shah. In addition, the values of maximum load (Pmax) obtained by the analyses are compared with the experimental ones for beams tested by Jenq and Shah and by Bažant and Pfeiffer. The results indicate that the descending portion of the load-deflection curve is very sensitive to the GF value used.

V-CE Sensing for IGBT Protection in NPC Three Level Converters-Causes For Spurious Trippings and Their Elimination

Neutral point clamped (NPC), three level converters with insulated gate bipolar transistor devices are very popular in medium voltage, high power applications. DC bus short circuit protection is usually done, using the sensed voltage across collector and emitter (i.e., V-CE sensing), of all the devices in a leg. This feature is accommodated with the conventional gate drive circuits used in the two level converters. The similar gate drive circuit, when adopted for NPC three level converter protection, leads to false V-CE fault signals for inner devices of the leg. The paper explains the detailed circuit behavior and reasons, which result in the occurrence of such false V-CE fault signals. This paper also illustrates that such a phenomenon shows dependence on the power factor of the supplied three-phase load. Finally, experimental results are presented to support the analysis. It is shown that the problem can be avoided by blocking out the V-CE sense fault signals of the inner devices of the leg.

Study of voltage collapse at converter bus in asynchronous MTDC-AC systems

This paper presents the analysis and study of voltage collapse at any converter bus in an AC system interconnected by multiterminal DC (MTDC) links. The analysis is based on the use of the voltage sensitivity factor (VSF) as a voltage collapse proximity indicator (VCPI). In this paper the VSF is defined as a matrix which is applicable to MTDC systems. The VSF matrix is derived from the basic steady state equations of the converter, control, DC and AC networks. The structure of the matrix enables the derivation of some of the basic properties which are generally applicable. A detailed case study of a four-terminal MTDC system is presented to illustrate the effects of control strategies at the voltage setting terminal (VST) and other terminals. The controls considered are either constant angle, DC voltage, AC voltage, reactive current and reactive power at the VST and constant power or current at the other terminals. The effect of the strength of the AC system (measured by short circuit ratio) on the VSF is investigated. Several interesting and new results are presented. An analytical expression for the self VSF at VST is also derived for some specific cases which help to explain the number of transitions in VSF around the critical values of SCR.

Load balancing algorithms for an extended hypercube

Reduction of the execution time of a job through equitable distribution of work load among the processors in a distributed system is the goal of load balancing. Performance of static and dynamic load balancing algorithms for the extended hypercube, is discussed. Threshold algorithms are very well-known algorithms for dynamic load balancing in distributed systems. An extension of the threshold algorithm, called the multilevel threshold algorithm, has been proposed. The hierarchical interconnection network of the extended hypercube is suitable for implementing the proposed algorithm. The new algorithm has been implemented on a transputer-based system and the performance of the algorithm for an extended hypercube is compared with those for mesh and binary hypercube networks

Effect of Short Duration of Load increment on the Compressibility of Soils

This study concerns the effect of duration of load increment (up to 24 h) on the consolidation properties of expansive black cotton soil (liquid limit = 81%) and nonexpansive kaolinite (liquid limit = 49%). It indicates that the amount and rate of compression are not noticeably affected by the duration of loading for a standard sample of 25 mm in height and 76.2 mm in diameter with double drainage. Hence, the compression index and coefficient of consolidation can be obtained with reasonable accuracy even if the duration of each load increment is as short as 4 h. The secondary compression coefficient (C-alpha epsilon) for kaolinite can be obtained for any pressure range with 1/2 h of loading, which, however, requires 4 h for black cotton soil. This is because primary consolidation is completed early in the case of kaolinite. The paper proves that the conventional consolidation test can be carried out with much shorter duration of loading (less than 4 h) than the standard specification of 24 h or more even for remolded fine-grained soils.

Forecasting rain for groundnut farmers�how good is good enough

: We illustrate how climatological information about adverse weather events and meteorological forecasts (when available) can be used to decide between alternative strategies so as to maximize the long-term average returns for rainfed groundnut in semi-arid parts of Karnataka, We show that until the skill of the forecast, i.e. probability of an adverse event occurring when it is forecast, is above a certain threshold, the forecast has no impact on the optimum strategy, This threshold is determined by the loss in yield due to the adverse weather event and the cost of the mitigatory measures, For the specific case of groundnut, it is found that while for combating some pests/diseases, climatological information is adequate, for others a forecast of sufficient skill would have a significant impact on the productivity.

Scheduling expression trees with reusable registers on delayed-load architectures

In this paper, we look at the problem of scheduling expression trees with reusable registers on delayed load architectures. Reusable registers come into the picture when the compiler has a data-flow analyzer which is able to estimate the extent of use of the registers. Earlier work considered the same problem without allowing for register variables. Subsequently, Venugopal considered non-reusable registers in the tree. We further extend these efforts to consider a much more general form of the tree. We describe an approximate algorithm for the problem. We formally prove that the code schedule produced by this algorithm will, in the worst case, generate one interlock and use just one more register than that used by the optimal schedule. Spilling is minimized. The approximate algorithm is simple and has linear complexity.