Area wide management of white grub Holotrichia consanguinea Blachard through IPM modules in groundnut

Field experiments were conducted on groundnut for white grub Holotrichia consanguinea Blachard management using different IPM components in Gujarat during kharif 2018 and 2019. Two different eco-friendly modules were evaluated and compare with farmers practices. In Module I included on set of monsoon, spraying of chlorpyrifos 20 EC @ 0.04% on surrounding trees, seed treatment of chlorpyrifos 20 EC @ 20 ml/kg, Placement of aggregation pheromone on host tree (5 block/tree), Soil application of Beauveria bassiana @ 5 kg ha-1 (Min. 2 x 106 CFU/g) + castor cake (250 kg ha-1) before sowing, Application of B. bassiana @ 5 kg ha-1 in plant row with FYM (250 kg ha-1) after 30 days of germination. While Module II used Metarhizium anisopliae instead of B. bassiana. While in farmers practices included application of chlorpyriphos 10 G @ 10 kg ha-1 with urea at initiation of pest attack. Among the evaluated two ecofriendly module and farmers practices the lowest per cent plant mortality (3.03 %) and 0.56 grub/m2 was recorded in Module II. The highest pod and halum yield 2180 and 3942 kg ha-1, yield increase over control 31.00 and 39.37 %, avoidable loss 23.67 and 28.25% was recorded in module II. The maximum (32474 Rs/ha) net realization was found in the treatment of Module II. Looking to the NICBR, the highest (1:5.35) return was obtained with the treatment of Module II followed by Module I (1:2.93)

Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs

Finitely many agents have preferences on a finite set of alternatives, single-peaked with respect to a connected graph with these alternatives as vertices. A probabilistic rule assigns to each preference profile a probability distribution over the alternatives. First, all unanimous and strategy-proof probabilistic rules are characterized when the graph is a tree. These rules are uniquely determined by their outcomes at those preference profiles at which all peaks are on leaves of the tree and, thus, extend the known case of a line graph. Second, it is shown that every unanimous and strategy-proof probabilistic rule is random dictatorial if and only if the graph has no leaves. Finally, the two results are combined to obtain a general characterization for every connected graph by using its block tree representation.

3D modified wavelet block tree coding for hyperspectral images

<p><span>A novel wavelet-based efficient hyperspectral image compression scheme for low memory sensors has been proposed. The proposed scheme uses the 3D dyadic wavelet transform to exploit intersubband and intrasubband correlation among the wavelet coefficients. By doing the reconstruction of the transform image cube, taking the difference between the frames, it increases the coding efficiency, reduces the memory requirement and complexity of the hyperspectral compression schemes in comparison with other state-of-the-art compression schemes.</span></p>

Sistema de Visión Subacuático Inalámbrico Usando un Algoritmo de Compresión Progresivo con Región de Interés

<p>La creciente demanda en todo el mundo de sistemas de intervención submarina en diversos dominios de aplicación requiere sistemas más versátiles y económicos. Empleando un sistema de comunicación inalámbrica, los robots semiautónomos supervisados disponen de libertad de movimientos y, al mismo tiempo, permiten al operador obtener información visual y supervisar la intervención. Por otro lado, la velocidad de transmisión de datos típica de los canales inalámbricos submarinos es, en general, muy limitada, siendo necesaria la aplicación de técnicas de compresión avanzadas. En este artículo se presenta principalmente el algoritmo DEBT (Depth Embedded Block Tree) para la compresión progresiva de imágenes con región de interés (ROI). Los resultados demuestran ventajas con respecto a otros algoritmos de compresión, y la posibilidad de ejecución del algoritmo en tiempo real en ordenadores embebidos de bajo consumo basados en ARM.</p>

Linear layouts of weakly triangulated graphs

A graph [Formula: see text] is said to be triangulated if it has no chordless cycles of length 4 or more. Such a graph is said to be rigid if, for a valid assignment of edge lengths, it has a unique linear layout and non-rigid otherwise. Damaschke [Point placement on the line by distance data, Discrete Appl. Math. 127(1) (2003) 53–62] showed how to compute all linear layouts of a triangulated graph, for a valid assignment of lengths to the edges of [Formula: see text]. In this paper, we extend this result to weakly triangulated graphs, resolving an open problem. A weakly triangulated graph can be constructively characterized by a peripheral ordering of its edges. The main contribution of this paper is to exploit such an edge order to identify the rigid and non-rigid components of [Formula: see text]. We first show that a weakly triangulated graph without articulation points has at most [Formula: see text] different linear layouts, where [Formula: see text] is the number of quadrilaterals (4-cycles) in [Formula: see text]. When [Formula: see text] has articulation points, the number of linear layouts is at most [Formula: see text], where [Formula: see text] is the number of nodes in the block tree of [Formula: see text] and [Formula: see text] is the total number of quadrilaterals over all the blocks. Finally, we propose an algorithm for computing a peripheral edge order of [Formula: see text] by exploiting an interesting connection between this problem and the problem of identifying a two-pair in [Formula: see text]. Using an [Formula: see text] time solution for the latter problem, we propose an [Formula: see text] time algorithm for computing its peripheral edge order, where [Formula: see text] and [Formula: see text] are respectively the number of edges and vertices of [Formula: see text]. For sparse graphs, the time complexity can be improved to [Formula: see text], using the concept of handles [R. B. Hayward, J. P. Spinrad and R. Sritharan, Improved algorithms for weakly chordal graphs, ACM Trans. Algorithms 3(2) (2007) 19pp].