An aerosol retrievala* algorithm for the first Geostationary Ocean Color Imager (GOCI) to be launched in March 2010 onboard the Communication, Ocean, and Meteorological Satellite (COMS) is presented. Thea* algorithm retri...
详细信息
An aerosol retrievala* algorithm for the first Geostationary Ocean Color Imager (GOCI) to be launched in March 2010 onboard the Communication, Ocean, and Meteorological Satellite (COMS) is presented. Thea* algorithm retrieves aerosol optical depth (AOD), fine-mode fraction (FMIF), and aerosol type in 500 m x 500 m resolution. All the products are retrieved over clear water which is defined by surface reflectance ratio between 640 nm and 860 nm (SRR) less or equal to 2.5, while only AOD is retrieved over turbid water (SRR>2.5) due to high surface reflectance. To develop optimizeda* algorithm for the target area of GOCI, optical properties of aerosol are analyzed from extensive observation of AERONET sunphotometers to generate lookup table. Surface reflectance of turbid water is determined from 30-day composite of Rayleigh- and gas corrected reflectance. By applying the presenta* algorithm to MODIS top-of-the atmosphere reflectance, three different aerosol cases dominated by anthropogenic aerosol contains black carbon (BC), dust, and non-absorbing aerosol are analyzed to test thea* algorithm. Thea* algorithm retrieves AOD, and size information together with aerosol type which are consistent with results inferred by RGB image in a qualitative way. The comparison of the retrieved AOD with those of MODIS collection 5 and AERONET sunphotometer observations shows reliable results. Especially, the application of turbid watera* algorithm significantly increases the accuracy in retrieving AOD at Anmyon station. The sensitivity study between MODIS and GOCI instruments in terms of relative sensitivity and scattering angle shows promising applicability of the presenta* algorithm to future GOCI measurements. (C) 2010 Elsevier Inc. All rights reserved.
DNA microarrays are powerful tools for quantifying gene expression patterns. However, obtaining reliable estimates of gene expression from raw measurements on microarrays presents several problems due to background co...
详细信息
DNA microarrays are powerful tools for quantifying gene expression patterns. However, obtaining reliable estimates of gene expression from raw measurements on microarrays presents several problems due to background contributions, nonspecific probe response, possible variation in probe sensitivities, and possible nonlinear responses of the probes to transcript concentration. In an effort to address the nonspecific response of probes, Affymetrix GeneChip arrays use two probes for each measurement. One of these probes, the mismatch (MM) probe, is intended to reflect the nonspecific response of the corresponding perfect match (PM) probe. However, the reliability of this approach has not been established by published experiments. Indeed, some research has shown that at high transcript concentrations, the nonspecific component of the PM signal is a negligible part of the MM signal. Five variations of a method to model and estimate levels of gene expression on Affymetrix chips, without the use of MM cells, are presented. To test the validity of thea* algorithms, six different concentrations of human liver cRNA were prepared. Each of these solutions was then hybridized on five Affymetrix hg95A arrays using five different scanners. The expression estimates obtained using each of the fivea* algorithms bore a strong linear relationship to the cRNA concentrations, particularly at low cRNA concentrations. The five variations were applied to a Latin square data set and the results compared with those obtained using Affymetrix MAS 5.0 and using robust multichip analysis. R-2 values obtained using the new techniques were comparable, while fold changes were superior.
We describe ana* algorithm for optimizing the parameters of sandwich X-ray detectors in relation to the recognition of materials by the dual energy method. The application of thea* algorithm is illustrated by a concrete e...
详细信息
We describe ana* algorithm for optimizing the parameters of sandwich X-ray detectors in relation to the recognition of materials by the dual energy method. The application of thea* algorithm is illustrated by a concrete example in which we obtain the thicknesses of the first detector and the intermediate filter (that are part of a sandwich detector) that are optimal for detecting explosives for the given materials of the first detector (CsI) and the intermediate filter (Cu).
A novel remote sensing image change detectiona* algorithm based on game theory analysis and hierarchical fuzzy clustering is proposed in this paper. This technique integrates the Nash game theory framework and the hiera...
详细信息
A novel remote sensing image change detectiona* algorithm based on game theory analysis and hierarchical fuzzy clustering is proposed in this paper. This technique integrates the Nash game theory framework and the hierarchical structured clustering approach. Characteristics of the image restoration and segmentation are analyzed to serve as the pre-processing step with the optimal tactical balance. With the deepening of the hierarchy, distributed clusters inside tightness degree gets less, at the same level of processing conforms to close conditions in current layer with sub-manifold merge, therefore, we choose hierarchical fuzzy clustering to finalize the change detection task. Experimental result confirms the effectiveness and feasibility of the proposed methodology. It increases the overall accuracy and robustness of the change detection processes compared with other approaches.
Most clusteringa* algorithms need to preset the initial parameters which affect the performance of clustering very much. To solve this problem, a new method is proposed, which determine the center points of clustering b...
详细信息
Most clusteringa* algorithms need to preset the initial parameters which affect the performance of clustering very much. To solve this problem, a new method is proposed, which determine the center points of clustering by density-searching according to the universality of the Gaussian distribution. After the center was obtained, the cluster expands based on the correlation coefficient between clusters and the membership of the samples until the terminating condition is met. The experimental results show that this method could classify the samples of Gaussian distribution with different degree of overlap accurately. Compared with the fuzzy c-meansa* algorithm, the proposed method is more accurate and timesaving when applied to the Iris data and Fossil data.
Let G = (V, E) be a graph. A double Roman dominating function (DRDF) of G is a function f : V -> {0, 1, 2, 3} such that (i) each vertex v with f (v) = 0 is adjacent to either a vertex u with f (u) = 3 or two vertic...
详细信息
Let G = (V, E) be a graph. A double Roman dominating function (DRDF) of G is a function f : V -> {0, 1, 2, 3} such that (i) each vertex v with f (v) = 0 is adjacent to either a vertex u with f (u) = 3 or two vertices u1 and u2 with f (u1) = f (u2) = 2, and (ii) each vertex v with f (v) =1 is adjacent to a vertex u with f (u) > 1. The double Roman domination number of G is the minimum weight of a DRDF along all DRDFs on G, where the weight of a DRDF f on G is f (V ) = Ev is an element of V f (v). In this paper, we first propose ana* algorithm to compute the double Roman domination number of an interval graph G = (V, E) in O(| V | + |E|) time, answering a problem posed in Banerjee et al. (2020) [2]. Next, we show that the decision problem associated with the double Roman domination is NP-complete for split graphs. Finally, we show that the computational complexities of the Roman domination problem and the double Roman domination problem are different. (c) 2022 Elsevier B.V. All rights reserved.
The paper describes a searchinga* algorithm, based on the routh array, to determine the unknown coefficients of a Hurwitz polynomial ABAR(S) of degree n, where polynomial P(S) of degree m - 1(m - 1 < n) is given and ...
详细信息
The paper describes a searchinga* algorithm, based on the routh array, to determine the unknown coefficients of a Hurwitz polynomial ABAR(S) of degree n, where polynomial P(S) of degree m - 1(m - 1 < n) is given and determines the first m coefficients. Sufficient conditions are derived to ensure that no solution exists, and a criterion of failure of the search is also derived and is shown to be both necessary and sufficient. Some examples are given, and it is demonstrated that increasing the number of restrictions on the ranges of the search increases the speed of solution and the number of solutions found. It is also shown that increasing the number of trials (N(p)) increases the time taken and the number of solutions found. The examples illustrate how the given polynomial P(S) restricts the range of values of the unknown coefficients and how, in particular, this may lead to a need for very large or very small gains for implementation of state variable feedback.
IEEE 802.16 m is one of the 4G standards, in order to save the terminal energy consumption, the protocol introduces a sleep mode. With the rapid development of network, network traffic distribution is no longer Poisso...
详细信息
ISBN:
(纸本)9781510813465
IEEE 802.16 m is one of the 4G standards, in order to save the terminal energy consumption, the protocol introduces a sleep mode. With the rapid development of network, network traffic distribution is no longer Poisson distribution but self-similar distribution. Based on similar traffic distribution, This paper use a demonstration and test method of mathematics to analyze exponential increasea* algorithm. Theoretical and experimental results show that thea* algorithm has some limitations, more effective way should be provided so as to improve the network performance.
Voxel traversing along a line in a uniformly divided voxel space is frequently needed in different applications of computer graphics. The paper presents a new integer one-passa* algorithm for this problem. In 2D, the pr...
详细信息
Voxel traversing along a line in a uniformly divided voxel space is frequently needed in different applications of computer graphics. The paper presents a new integer one-passa* algorithm for this problem. In 2D, the proposed approach is based on a modification of the well-known Bresenhama* algorithm. Thea* algorithm is then extended in 3D where a special case may occur. It is characterized by a simple discriminator. A derivation for this discriminator given in the paper confirms that all calculations can be realized using only integer arithmetic. In this way, the accumulation of rounding errors is completely eliminated, and a robust and compact implementation can be easily achieved. One of the main advantages of the proposeda* algorithm is that it visits 1-3 voxels during each iteration thus assuring its efficiency. Thea* algorithm has been compared with othera* algorithms for voxel traversing by measuring spent CPU time. For comparison, Cleary & Wyvill's, Amanatides & Woo's, and Code-baseda* algorithm have been used. The proposeda* algorithm is faster than the referenceda* algorithms.
Cot analysis (DNA reassociation kinetics) has long been used to explore genome Structure in individual species, estimate genome similarity among organisms, and evaluate diversity in ecological samples, yet the algorit...
详细信息
Cot analysis (DNA reassociation kinetics) has long been used to explore genome Structure in individual species, estimate genome similarity among organisms, and evaluate diversity in ecological samples, yet thea* algorithms and computational tools designed for analyzing Cot data are outdated, difficult to use, and prone to error. We report a new nonlinear regression procedure For analysis of Cot data and describe oura* algorithms in detail. Our procedure is implemented as CotQuest, a suite of scripts designed for use with the statistics package SAS. Unlike previous programs, CotQuest does not require users to input guesses as to the final Values of parameters;rather, it employs a novela* algorithm to step through a sequence Of Progressively more complex models, with the results from a given analysis being used to generate starting values for the next model. Moreover, CotQuest returns a statistical comparison of potential models and provides a variety of model assessment and selection diagnostics to help users in model selection. In situations where two models possess similar goodness-of-fit assessments, visual analysis of the Cot Curves and comparison of CotQuest-generated graphs and statistics reflecting the normality and homoscedasticity of residuals can he employed to make educated choices between models. (c) 2009 Elsevier Inc. All rights reserved.
暂无评论