Validation of GOES and MODIS active fire detection products using ASTER and ETM+ data

In this study we implemented a comprehensive analysis to validate the MODIS and GOES satellite active fire detection products (MOD14 and WFABBA, respectively) and characterize their major sources of omission and commission errors which have important implications for a large community of fire data users. Our analyses were primarily based on the use of 30 m resolution ASTER and ETM+ imagery as our validation data. We found that at the 50% true positive detection probability mark, WFABBA requires four times more active fire area than is necessary for MOD14 to achieve the same probability of detection, despite the 16× factor separating the nominal spatial resolutions of the two products. Approximately 75% and 95% of all fires sampled were omitted by the MOD14 and WFABBA instantaneous products, respectively; whereas an omission error of 38% was obtained for WFABBA when considering the 30-minute interval of the GOES data. Commission errors for MOD14 and WFABBA were found to be similar and highly dependent on the vegetation conditions of the areas imaged, with the larger commission errors (approximately 35%) estimated over regions of active deforestation. Nonetheless, the vast majority (> 80%) of the commission errors were indeed associated with recent burning activity where scars could be visually confirmed in the higher resolution data. Differences in thermal dynamics of vegetated and non-vegetated areas were found to produce a reduction of approximately 50% in the commission errors estimated towards the hours of maximum fire activity (i.e., early-afternoon hours) which coincided with the MODIS/Aqua overpass. Lastly, we demonstrate the potential use of temporal metrics applied to the mid-infrared bands of MODIS and GOES data to reduce the commission errors found with the validation analyses.     

Capacity and decoding rules for classes of arbitrarily varyingchannels

The capacity of an arbitrarily varying channel (AVC) is considered for deterministic codes with the average probability of error criterion and, typically, subject to at state constraint. First, sufficient conditions are provided that enable relatively simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former the capacity is explicitly determined and shown to be attainable by minimum-distance decoding. Next, for a large class of addictive AVCs, in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, it is proven that capacity can be attained by a universal decoding rule. Finally, the effect of random state selections on capacity is studied. The merits and limitations of a previous mutual information game approach are also discussed     

Common randomness in information theory and cryptography. II. CRcapacity

For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback     

Secrecy Capacities for Multiterminal Channel Models

Shannon-theoretic secret key generation by several parties is considered for models in which a secure noisy channel with one input terminal and multiple output terminals and a public noiseless channel of unlimited capacity are available for accomplishing this goal. The secret key is generated for a set A of terminals of the noisy channel, with the remaining terminals (if any) cooperating in this task through their public communication. Single-letter characterizations of secrecy capacities are obtained for models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A. These capacities are shown to be achievable with noninteractive public communication, the channel input terminal sending no public message and each output terminal sending at most one public message, not using randomization. Moreover, when the input terminal belongs to the set A, it can generate the secret key at the outset and transmit it over the noisy channel, suitably encoded, whereupon the output terminals in A securely recover this key using public communication as above. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given.     

Computation and analysis of the workspace of a reconfigurable parallel robotic system

A reconfigurable robotic system permits multiple configurations having different characteristics, using mostly modularized building blocks. The goal of this paper is to investigate how the shape, dimensions and the distribution of singularities in the workspace for different configurations, with different degrees of freedom, of a reconfigurable robotic system, are changed. The computation of the workspace is based on the modularity property of the system. The presented results are also experimentally validated.     

Quantifying the impact of cloud obscuration on remote sensing of active fires in the Brazilian Amazon

Vegetation fires remain as one of the most important processes governing land use and land cover change in tropical areas. The large area extent of fire prone areas associated with human activities makes satellite remote sensing of active fires a valuable tool to help monitor biomass burning in those regions. However, identification of active fire fronts under optically thick clouds is not possible through passive remote sensing, often resulting in omission errors. Previous analyses of fire activity either ignored the cloud obscuration problem or applied corrections based on the assumption that fire occurrence is not impacted by the presence of clouds. In this study we addressed the cloud obscuration problem in the Brazilian Amazon region using a pixel based probabilistic approach, using information on previous fire occurrence, precipitation and land use. We implemented the methodology using data from the geostationary GOES imager, covering the entire diurnal cycle of fire activity and cloud occurrence. Our assessment of the method indicated that the cloud adjustment reproduced the number of potential fires missed within 1.5% and 5% of the true fire counts on annual and monthly bases respectively. Spatially explicit comparison with high resolution burn scar maps in Acre state showed a reduction of omission error (from 58.3% to 43.7%) and only slight increase of commission error (from 6.4% to 8.8%) compared to uncorrected fire counts. A basin-wide analysis of corrected GOES fire counts during 2005 showed a mean cloud adjustment factor of approximately 11%, ranging from negligible adjustment in the central and western part of the Brazilian Amazon to as high as 50% in parts of Roraima, Para and Mato Grosso.     

Properties of differently printed and easy‐care finished linen fabrics

Linen fabrics were printed with reactive dyes, vat dyes and pigments. The prints were cured and after‐treated using conventional processes. Printed and unprinted fabrics were finished with low‐formaldehyde resin in a pad–dry–cure process. The mechanical properties (i.e. mass per unit area, flexural rigidity, tenacity at maximum load, wrinkle recovery angles and air permeability) with characteristics of printed and easy‐care finished fabrics were measured and the mutual influence of printing and finishing on these properties was discussed. Moreover, the colour difference between the finished and unfinished printed samples was measured, and the colour fastness to washing, appearance of fabrics after domestic washing, colour fastness to rubbing and light was compared.     

The human lysyl oxidase-related gene (LOXL2) maps between markers D8S280 and D8S278 on chromosome 8p21.2-p21.3

OBJECTIVE: bcl-2 is a protein which prohibits programmed cell death. The purpose of this study was to determine whether bcl-2 staining was related to traditional prognostic factors and/or recurrence in patients with endometrial carcinoma. METHODS: One hundred twenty consecutively surgically treated patients with endometrial carcinoma had their tumors studied immunohistochemically for bcl-2 staining. RESULTS: The mean follow-up of the patients was 53 months with a median of 56 months (range 30 to 68 months). bcl-2 staining was positive in 44.0% of patients with endometrioid carcinomas and in 23. 1% of patients with nonendometrioid carcinomas (P < 0.001). Increasing depth of invasion (P = 0.014), grade (P = 0.011), and FIGO stage (P = 0.018) were each correlated with decreasing bcl-2 staining. bcl-2 staining was positive in 44.1% of patients whose tumors showed no lymphovascular space invasion and in 11.1% of patients with lymphovascular space invasion (P < 0.001). Only 1 of 26 patients with recurrent disease had persistence of bcl-2 staining. Multivariate analysis revealed FIGO stage (P = 0.0051), histologic grade (P = 0.050), and lack of staining for bcl-2 (P = 0.012) to be independent predictors of recurrence. CONCLUSION: bcl-2 persistence is more common in endometrioid than in nonendometrioid adenocarcinomas of the endometrium. It appears to be inversely correlated with the universally recognized prognostic factors of depth of invasion, histologic grade, and FIGO stage. Lack of bcl-2 persistence was an independent predictor of recurrence of disease. This group of patients continues to be followed to determine the role of bcl-2 persistence or lack of persistence as a predictor of 5-year survival of patients with endometrial carcinoma.     

Common randomness in information theory and cryptography. I. Secretsharing

As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered. The concept of key-capacity is defined. Single-letter formulas of key-capacity are obtained for several models, and bounds to key-capacity are derived for other models