Effect of sliding speed on friction and wear of uni-directional aramid fibre-phenolic resin composite

A previous study on the tribological performance of a compression-moulded aramid fibre-phenolic resin composite, containing 30% continuous fibre, showed that this composite provides a reasonable combination of the friction coefficient and wear rate to be used as a friction component, such as a brake shoe. In the present work, the effect of sliding speed on the friction and wear behaviour of this composite has been investigated. The sliding experiments were conducted in a speed range of 0.1-6 m s(-1) at two normal pressure levels of 1.0 and 4.9 MPa. The coefficient of friction was found to be stable over a wide range of sliding speeds and normal pressures. The wear of the composite was found to be insensitive to changes in the speed in the higher speed range. The results have been supplemented with scanning electron micrographs to help understand possible friction and wear mechanisms.

Effect of Speed and Pressure on Dry Sliding Interactions of Alumina against Steel

Sliding of alumina (87%) pins against a hardened steel disk over a range of pressures (3.3-30.0 MPa) and speeds (0.1-12.0 ms(-1)) has been studied. Four different regions (R1, R2, R3, and R4) of friction as a function of speed have been identified. R1 and RS exhibit single-valued friction while in R2 and R4 the friction exhibits dual behavior. The speed range over which these regions prevail is sensitive to the pressure. R1 and R2 are low-speed and low-temperature regions, and in both, metal transfer and formation and compaction of gamma-Fe2O3 occur. R3 and R4 are associated with high speeds and high interface temperatures. Formation of FeO, FeAl2O4, and FeAlO3 has been observed. The implications of the tribochemical interactions on friction and wear characteristics are discussed.

Three- and Seven-Point Optimally Weighted Recursive Median Filters for Gas Turbine Diagnostics

Measured health signals incorporate significant details about any malfunction in a gas turbine. The attenuation of noise and removal of outliers from these health signals while preserving important features is an important problem in gas turbine diagnostics. The measured health signals are a time series of sensor measurements such as the low rotor speed, high rotor speed, fuel flow, and exhaust gas temperature in a gas turbine. In this article, a comparative study is done by varying the window length of acausal and unsymmetrical weighted recursive median filters and numerical results for error minimization are obtained. It is found that optimal filters exist, which can be used for engines where data are available slowly (three-point filter) and rapidly (seven-point filter). These smoothing filters are proposed as preprocessors of measurement delta signals before subjecting them to fault detection and isolation algorithms.

Optimal control of arrivals to queues with delayed queue length information

We consider discrete-time versions of two classical problems in the optimal control of admission to a queueing system: i) optimal routing of arrivals to two parallel queues and ii) optimal acceptance/rejection of arrivals to a single queue. We extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric inter-arrival times and geometric service times the problems are formulated as controlled Markov chains with expected total discounted cost as the minimization objective. For problem i) we show that when k = 1, the optimal policy is to allocate an arrival to the queue with the smaller expected queue length (JSEQ: Join the Shortest Expected Queue). We also show that for this problem, for k greater than or equal to 2, JSEQ is not optimal. For problem ii) we show that when k = 1, the optimal policy is a threshold policy. There are, however, two thresholds m(0) greater than or equal to m(1) > 0, such that mo is used when the previous action was to reject, and mi is used when the previous action was to accept.

Queuing strategies for qos management of traffic between lans interconnected by low-speed wan links

We provide a comparative performance evaluation of packet queuing and link admission strategies for low-speed wide area network Links (e.g. 9600 bps, 64 kbps) that interconnect relatively highspeed, connectionless local area networks (e.g. 10 Mbps). In particular, we are concerned with the problem of providing differential quality of service to interLAN remote terminal and file transfer sessions, and throughput fairness between interLAN file transfer sessions. We use analytical and simulation models to study a variety of strategies. Our work also serves to address the performance comparison of connectionless vs. connection-oriented interconnection of CLNS LANS. When provision of priority at the physical transmission level is not feasible, we show, for low-speed WAN links (e.g. 9600 bps), the superiority of connection-oriented interconnection of connectionless LANs, with segregation of traffic streams with different QoS requirements into different window flow controlled connections. Such an implementation can easily be obtained by transporting IP packets over an X.25 WAN. For 64 kbps WAN links, there is a drop in file transfer throughputs, owing to connection overheads, but the other advantages are retained, The same solution also helps to provide throughput fairness between interLAN file transfer sessions. We also provide a corroboration of some of our modelling results with results from an experimental test-bed.

Mean first passage time approach to the problem of optimal barrier subdivision for Kramer's escape rate

We consider the effect of subdividing the potential barrier along the reaction coordinate on Kramer's escape rate for a model potential, Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate, We cast the problem as a mean first passage time problem of a biased random walker and obtain equivalent results, We briefly summarize the results of our investigation on the increase in the escape rate by placing a blow-torch in the unstable part of one of the potential wells. (C) 1999 Elsevier Science B.V. All rights reserved.

Optimal control of a stochastic hybrid system with discounted cost

We address the optimal control problem of a very general stochastic hybrid system with both autonomous and impulsive jumps. The planning horizon is infinite and we use the discounted-cost criterion for performance evaluation. Under certain assumptions, we show the existence of an optimal control. We then derive the quasivariational inequalities satisfied by the value function and establish well-posedness. Finally, we prove the usual verification theorem of dynamic programming.

Prediction of reaeration rates in square, stirred tanks

Experiments were conducted on the oxygen transfer coefficient, k(L)a(20), through surface aeration in geometrically similar square tanks, with a rotor of diameter D fitted with six flat blades. An optimal geometric similarity of various linear dimensions, which produced maximum k(L)a(20) for any rotational speed of rotor N by an earlier study, was maintained. A simulation equation uniquely correlating k = k(L)a(20)(nu/g(2))(1/3) (nu and g are kinematic viscosity of water and gravitational constant, respectively), and a parameter governing the theoretical power per unit volume, X = (ND2)-D-3/(g(4/3)nu(1/3)), is developed. Such a simulation equation can be used to predict maximum k for any N in any size of such geometrically similar square tanks. An example illustrating the application of results is presented. Also, it has been established that neither the Reynolds criterion nor the Froude criterion is singularly valid to simulate either k or K = k(L)a(20)/N, simultaneously in all the sizes of tanks, even through they are geometrically similar. Occurrence of "scale effects" due to the Reynolds and the Froude laws of similitude on both k and K are also evaluated.

The influence of temperature gradient and lowering speed on the melt-solid interface shape of GaxIn1-xSb alloy crystals grown by vertical Bridgman technique

Radially homogeneous bulk alloys of GaxIn1-xSb in the range 0.7 < x < 0.8, have been grown by vertical Bridgman technique. The factors affecting the interface shape during the growth were optimised to achieve zero convexity. From a series of experiments, a critical ratio of the temperature gradient (G) of the furnace at the melting point of the melt composition to the ampoule lowering speed (v) was deduced for attaining the planarity of the melt-solid interface. The studies carried out on directional solidification of Ga0.77In0.23Sb mixed crystals employing planar melt-solid interface exhibited superior quality than those with nonplanar interfaces. The solutions to certain problems encountered during the synthesis and growth of the compound were discussed. (C) 1999 Elsevier Science B.V. All rights reserved.

Physics based basis function for vibration analysis of high speed rotating beams

The natural frequencies of continuous systems depend on the governing partial differential equation and can be numerically estimated using the finite element method. The accuracy and convergence of the finite element method depends on the choice of basis functions. A basis function will generally perform better if it is closely linked to the problem physics. The stiffness matrix is the same for either static or dynamic loading, hence the basis function can be chosen such that it satisfies the static part of the governing differential equation. However, in the case of a rotating beam, an exact closed form solution for the static part of the governing differential equation is not known. In this paper, we try to find an approximate solution for the static part of the governing differential equation for an uniform rotating beam. The error resulting from the approximation is minimized to generate relations between the constants assumed in the solution. This new function is used as a basis function which gives rise to shape functions which depend on position of the element in the beam, material, geometric properties and rotational speed of the beam. The results of finite element analysis with the new basis functions are verified with published literature for uniform and tapered rotating beams under different boundary conditions. Numerical results clearly show the advantage of the current approach at high rotation speeds with a reduction of 10 to 33% in the degrees of freedom required for convergence of the first five modes to four decimal places for an uniform rotating cantilever beam.

Jointly Optimal MMSE design for non-redundant FIR precoding and equalization

We provide a filterbank precoding framework (FBP) for frequency selective channels using the minimum mean squared error (MMSE) criterion. The design obviates the need for introducing a guard interval between successive blocks, and hence can achieve the maximum possible bandwidth efficiency. This is especially useful in cases where the channel is of a high order. We treat both the presence and the absence of channel knowledge at the transmitter. In the former case, we obtain the jointly optimal precoder-equalizer pair of the specified order. In the latter case, we use a zero padding precoder, and obtain the MMSE equalizer. No restriction on the dimension or nature of the channel matrix is imposed. Simulation results indicate that the filterbank approach outperforms block based methods like OFDM and eigenmode precoding.

Delay constrained optimal relay placement for planned wireless sensor networks

In this paper, we study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network design cost) at a subset of given potential relay locationsin order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station within a certain specified mean delay bound. We formulate this problem in two different ways, and show that the problem is NP-Hard. For a problem in which the number of existing sensor nodes and potential relay locations is n, we propose an O(n) approximation algorithm of polynomial time complexity. Results show that the algorithm performs efficiently (in over 90% of the tested scenarios, it gave solutions that were either optimal or exceeding optimal just by one relay) in various randomly generated network scenarios.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.

Damped Belief Propagation Based Near-Optimal Equalization of Severely Delay-Spread UWB MIMO-ISI Channels

In this paper, we present a belief propagation (BP) based equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) inter-symbol interference (ISI) channels characterized by severe delay spreads. We employ a Markov random field (MRF) graphical model of the system on which we carry out message passing. The proposed BP equalizer is shown to perform increasingly closer to optimal performance for increasing number of multipath components (MPC) at a much lesser complexity than that of the optimum equalizer. The proposed equalizer performs close to within 0.25 dB of SISO AWGN performance at 10-3 bit error rate on a severely delay-spread MIMO-ISI channel with 20 equal-energy MPCs. We point out that, although MIMO/UWB systems are characterized by fully/densely connected graphical models, the following two proposed features are instrumental in achieving near-optimal performance for large number of MPCs at low complexities: i) use of pairwise compatibility functions in densely connected MRFs, and ii) use of damping of messages.