An improved algorithm for disaggregating microwave-derived soil moisture based on red, near-infrared and thermal-infrared data

Accurate high-resolution soil moisture data are needed for a range of agricultural and hydrologic activities. To improve the spatial resolution of ∼ 40 km resolution passive microwave-derived soil moisture, a methodology based on 1 km resolution MODIS (MODerate resolution Imaging Spectroradiometer) red, near-infrared and thermal-infrared data has been implemented at 4 km resolution. The three components of that method are (i) fractional vegetation cover, (ii) soil evaporative efficiency (defined as the ratio of actual to potential evaporation) and (iii) a downscaling relationship. In this paper, 36 different disaggregation algorithms are built from 3 fractional vegetation cover formulations, 3 soil evaporative efficiency models, and 4 downscaling relationships. All algorithms differ with regard to the representation of the nonlinear relationship between microwave-derived soil moisture and optical-derived soil evaporative efficiency. Airborne L-band data collected over an Australian agricultural area are used to both generate ∼ 40 km resolution microwave pixels and verify disaggregation results at 4 km resolution. Among the 36 disaggregation algorithms, one is identified as being more robust (insensitive to soil, vegetation and atmospheric variables) than the others with a mean slope between MODIS-disaggregated and L-band derived soil moisture of 0.94. The robustness of that algorithm is notably assessed by comparing the disaggregation results obtained using composited (averaged) Terra and Aqua MODIS data, and using data from Terra and Aqua separately. The error on disaggregated soil moisture is systematically reduced by compositing daily Terra and Aqua data with an error of 0.012 vol./vol.     

Adaptive predistortion using threshold decomposition‐based piecewise linear modeling

A new adaptive predistortion approach for nonlinear power amplifiers based on the piecewise linear (PWL) approximation of nonlinear functions is presented. The PWL model is obtained using threshold decomposition (TD) of the input‐output characteristics. The TD based PWL model is used to develop a baseband predistorter using both the direct and the indirect learning architectures. The proposed predistorter is proved to provide a better performance in suppressing nonlinear distortion than conventional polynomial predistorters and a reduced hardware complexity as compared to lookup table (LUT) approach. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Scalability of MANET routing protocols for heterogeneous and homogenous networks

In Mobile Ad hoc Network (MANET), mobility, traffic and node density are main network conditions that significantly affect performance of routing protocols. Much of the previous research in MANET routing have focused on developing strategies, which suit one specific networking scenario. Therefore, there is no existing protocol that can work well in all different networking scenarios. This paper reviews characteristics of several different classes of routing protocols. Moreover, most of current routing protocols assume homogeneous networking conditions where all nodes have the same capabilities and resources. This paper presents extensive studies simulations for DSR, AODV, LAR1, FSR and WRP in homogenous and heterogeneous networks that consist of different nodes with different resources. The results showed that while all protocols perform reasonably well in homogenous networking conditions, their performance suffer significantly over heterogonous networks.     

A sequential model for disaggregating near-surface soil moisture observations using multi-resolution thermal sensors

A sequential model is developed to disaggregate microwave-derived soil moisture from 40 km to 4 km resolution using MODIS (Moderate Imaging Spectroradiometer) data and subsequently from 4 km to 500 m resolution using ASTER (Advanced Scanning Thermal Emission and Reflection Radiometer) data. The 1 km resolution airborne data collected during the three-week National Airborne Field Experiment 2006 (NAFE'06) are used to simulate the 40 km pixels, and a thermal-based disaggregation algorithm is applied using 1 km resolution MODIS and 100 m resolution ASTER data. The downscaled soil moisture data are subsequently evaluated using a combination of airborne and in situ soil moisture measurements. A key step in the procedure is to identify an optimal downscaling resolution in terms of disaggregation accuracy and sub-pixel soil moisture variability. Very consistent optimal downscaling resolutions are obtained for MODIS aboard Terra, MODIS aboard Aqua and ASTER, which are 4 to 5 times the thermal sensor resolution. The root mean square error between the 500 m resolution sequentially disaggregated and ground-measured soil moisture is 0.062 vol./vol. with a bias of − 0.045 vol./vol. and values ranging from 0.08 to 0.40 vol./vol.     

Monitoring HABs in the shallow Arabian Gulf using a qualitative satellite-based index

In this study, a harmful algal bloom (HAB) index, commonly known as a red tide index (RI), was developed and tested using in situ measurements in the shallow Arabian Gulf where periodical occurrence of red tide has been reported. The index is based on a combination of ratio and difference of bands centred at 443, 531, and 547 nm. The index was applied to Moderate Resolution Imaging Spectroradiometer (MODIS)/Aqua imagery and compared with other proxies of HABs such as chlorophyll-a (chl-a) concentrations and fluorescence line height (FLH). Validation of the proposed index produced a positive correlation between the index and chlorophyll-a concentration with a determination coefficient (R²) of 0.61. Seasonality analysis of RI indicated that HABs in the Gulf region occur mainly in fall and winter. The inter-annual variations of RI showed similar patterns with the conventional chl-a product. This new index can provide insights into the dynamics of red tides and guidance for mitigation efforts, and assist in establishing an effective and timely forecasting and warning system for red tide.     

Development of active matrix LCD for use in high‐resolution adaptive headlights

Conventional adaptive driving beam headlamps are limited in achieving still higher quantities of switchable pixels by the number of LEDs and movable elements needed. In this paper, it is shown that by integrating an active matrix liquid crystal display module, it is possible to realize fully adaptive high‐resolution headlights without mechanical elements and a finite number of LED with 30 k switchable pixels.     

A semantic based Web page classification strategy using multi-layered domain ontology

World Wide Web is a continuously growing giant, and within the next few years, Web contents will surely increase tremendously. Hence, there is a great requirement to have algorithms that could accurately classify Web pages. Automatic Web page classification is significantly different from traditional text classification because of the presence of additional information, provided by the HTML structure. Recently, several techniques have been arisen from combinations of artificial intelligence and statistical approaches. However, it is not a simple matter to find an optimal classification technique for Web pages. This paper introduces a novel strategy for vertical Web page classification, which is called Classification using Multi-layered Domain Ontology (CMDO). It employs several Web mining techniques, and depends mainly on proposed multi-layered domain ontology. In order to promote the classification accuracy, CMDO implies a distiller to reject pages related to other domains. CMDO also employs a novel classification technique, which is called Graph Based Classification (GBC). The proposed GBC has pioneering features that other techniques do not have, such as outlier rejection and pruning. Experimental results have shown that CMDO outperforms recent techniques as it introduces better precision, recall, and classification accuracy.     

Emulation of complex open quantum systems using superconducting qubits

With quantum computers being out of reach for now, quantum simulators are alternative devices for efficient and accurate simulation of problems that are challenging to tackle using conventional computers. Quantum simulators are classified into analog and digital, with the possibility of constructing “hybrid” simulators by combining both techniques. Here we focus on analog quantum simulators of open quantum systems and address the limit that they can beat classical computers. In particular, as an example, we discuss simulation of the chlorosome light-harvesting antenna from green sulfur bacteria with over 250 phonon modes coupled to each electronic state. Furthermore, we propose physical setups that can be used to reproduce the quantum dynamics of a standard and multiple-mode Holstein model. The proposed scheme is based on currently available technology of superconducting circuits consist of flux qubits and quantum oscillators.     

SimClus: an effective algorithm for clustering with a lower bound on similarity

Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization, social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects, yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively used in an on-line setting.