Shrewd alliances: mixed foraging associations between treeshrews,greater racket-tailed drongos and sparrowhawks on Great Nicobar Island, India

Mixed-species foraging associations may form to enhance feeding success or to avoid predators. We report the costs and consequences of an unusual foraging association between an endemic foliage gleaning tupaid (Nicobar treeshrew Tupaia nicobarica) and two species of birds; one an insectivorous commensal (greater racket-tailed drongo Dicrurus paradiseus) and the other a diurnal raptor and potential predator (Accipiter sp.). In an alliance driven, and perhaps engineered, by drongos, these species formed cohesive groups with predictable relationships. Treeshrew breeding pairs were found more frequently than solitary individuals with sparrowhawks and were more likely to tolerate sparrowhawks in the presence of drongos. Treeshrews maintained greater distances from sparrowhawks than drongos, and permitted the raptors to come closer when drongos were present. Treeshrew foraging rates declined in the presence of drongos; however, the latter may provide them predator avoidance benefits. The choice of the raptor to join the association is intriguing; particular environmental resource states may drive the evolution of such behavioural strategies. Although foraging benefits seem to be the primary driver of this association, predator avoidance also influences interactions, suggesting that strategies driving the formation of flocks may be complex and context dependent with varying benefits for different actors.

Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates

This study considers the scheduling problem observed in the burn-in operation of semiconductor final testing, where jobs are associated with release times, due dates, processing times, sizes, and non-agreeable release times and due dates. The burn-in oven is modeled as a batch-processing machine which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity and the processing time of a batch is equal to the longest time among all the jobs in the batch. Due to the importance of on-time delivery in semiconductor manufacturing, the objective measure of this problem is to minimize total weighted tardiness. We have formulated the scheduling problem into an integer linear programming model and empirically show its computational intractability. Due to the computational intractability, we propose a few simple greedy heuristic algorithms and meta-heuristic algorithm, simulated annealing (SA). A series of computational experiments are conducted to evaluate the performance of the proposed heuristic algorithms in comparison with exact solution on various small-size problem instances and in comparison with estimated optimal solution on various real-life large size problem instances. The computational results show that the SA algorithm, with initial solution obtained using our own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.

Unsteady mixed convection flow of a thermomicropolar fluid on a long thin vertical cylinder

The unsteady laminar mixed convection boundary layer flow of a thermomicropolar fluid over a long thin vertical cylinder has been studied when the free stream velocity varies with time. The coupled nonlinear partial differential equations with three independent variables governing the flow have been solved numerically using an implicit finite difference scheme in combination with the quasilinearization technique. The results show that the buoyancy, curvature and suction parameters, in general, enhance the skin friction, heat transfer and gradient of microrotation, but the effect of injection is just opposite. The skin friction and heat transfer for the micropolar fluid are considerably less than those for the Newtonian fluids. The effect of microrotation parameter is appreciable only on the microrotation gradient. The effect of the Prandtl number is appreciable on the skin friction, heat transfer and gradient of microtation.

Dynamic programming based optimum non-uniform samples for speech reconstruction and coding

Non-uniform sampling of a signal is formulated as an optimization problem which minimizes the reconstruction signal error. Dynamic programming (DP) has been used to solve this problem efficiently for a finite duration signal. Further, the optimum samples are quantized to realize a speech coder. The quantizer and the DP based optimum search for non-uniform samples (DP-NUS) can be combined in a closed-loop manner, which provides distinct advantage over the open-loop formulation. The DP-NUS formulation provides a useful control over the trade-off between bitrate and performance (reconstruction error). It is shown that 5-10 dB SNR improvement is possible using DP-NUS compared to extrema sampling approach. In addition, the close-loop DP-NUS gives a 4-5 dB improvement in reconstruction error.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

A mixed-split scheme for 2-D DPCM based LSF quantization

In this paper a mixed-split scheme is proposed in the context of 2-D DPCM based LSF quantization scheme employing split vector product VQ mechanism. Experimental evaluation shows that the new scheme is successfully being able to show better distortion performance than existing safety-net scheme for noisy channel even at considerably lower search complexity, by efficiently exploiting LSF trajectory behavior across the consecutive speech frames.

Second order cone programming approaches for handling missing and uncertain data

We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order moments. These formulations are then specialized to the case of missing values in observations for both classification and regression problems. Experiments show that the proposed formulations outperform imputation.

PROMIDS: A PROtotype multi-rIng data flow system for functional programming languages

This paper presents a detailed description of the hardware design and implementation of PROMIDS: a PROtotype Multi-rIng Data flow System for functional programming languages. The hardware constraints and the design trade-offs are discussed. The design of the functional units is described in detail. Finally, we report our experience with PROMIDS.

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

Studies on optical absorption and photoluminescenceproperties of Pr3+ and Nd3+ doped mixed alkali chloroborate glasses

This article presents the optical absorption and emission properties of Pr3+ and Nd3+ doped two different mixed alkali chloroborate glass matrices of the type 70B(2)O(3)center dot xLiCl center dot(30 - x)NaCl and 70B(2)O(3)center dot xLiCl center dot(30 - x)KCl (x = 5, 10, 15.20 and 25). The variation of Judd-Ofelt parameters (Omega(2), Omega(4) and Omega(6)), total radiative transition probabilities (A(T)), radiative lifetimes (tau(R)) and emission cross-sections (sigma(p)) with the variation of alkali contents in the glass matrix have been discussed in detail. The changes in the peak wavelengths of the hypersensitive transition and intensity parameters with x are correlated to the structural changes in the host matrix. The estimated radiative lifetimes of certain excited states of Pr3+ and Nd3+ in these two glass matrices are reported. Peak stimulated emission cross-sections (sigma(p)) are reported for the observed emission transitions of Pr3+ and Nd3+ ions. Branching ratios (beta) of the observed emission transitions obtained from the Judd-Ofelt theory are compared with the values obtained from the emission spectra. (C) 2010 Elsevier B.V. All rights reserved.

Mixed-mode stress intensity factors for arbitrarily oriented cracks in cylindrical shells under axial pull and torsion

Results of photoelastic investigations conducted on cylindrical tubes (made of Araldite material) containing cracks oriented at 0°, 30°, 45°, 60° and 90° to the axis of the tube and subjected to axial and torsional loads are reported. The stress-intensity factors (SIFs) were determined by analysing the crack-tip stress fields. Smith and Smith's method [Engng Fracture Mech.4, 357–366 (1972)] and a new method developed by the authors by modifying Rakesh et al.'s method [Proc. 26th Congress of ISTAM, India (1981)] were employed to evaluate the mixed-mode SIFs.

ESR studies of X-irradiated strontium mixed calcium tartrate crystals

The electron spin resonance spectra of X-ray irradiated single crystals of strontium doped calcium tartrate tetrahydrate (CST) with molecular formula Ca0.88Sr0.12C4H4O6.4H(2)O grown in gels has been investigated. Only one species of free radical but with two magnetically unequivalent sites was observed at room temperature. The free radical was found to be the result of the splitting of a C-II bond adjacent to both the hydroxyl and carboxyl groups. The a factor was found to be slightly anisotropic. Couplings with two H nuclei, believed to be the proton of the OH group attached directly to the unsaturated asymmetric carbon atom and the proton attached directly to the: other asymmetric carbon atom of the molecule were observed. The principal g-values were found to be 2.0030, 2.0017, 2.0027. The principal elements of the nuclear coupling are 7.45, 6.59, 4.28 and 8.56, 7.22, 18.71 G, respectively. The radical was found to be very stable. (C) 2000 Elsevier Science Ltd. All rights reserved.