检索结果-内蒙古大学图书馆

algorithms comparison for calculating downward longwave radiation by MODIS data under clear and cloudy skies 19

Algorithms comparison for calculating downward longwave radi...

Conference on Remote Sensing of Clouds and the Atmosphere XIX and Optics in Atmospheric Propagation and Adaptive Systems XVII

作者： Yu, Shanshan Xin, Xiaozhou Zhang, Hailong Chinese Acad Sci Inst Remote Sensing & Digital Earth State Key Lab Remote Sensing Sci Beijing 100101 Peoples R China

ISBN: (纸本)9781628413052

Downward longwave radiation (DLR) at the earth's surface is a major component of surface radiation budget and thus the climate, and remote sensing provides the most effective method to get surface DLR on a large scale. This paper presents a comparison of several DLR algorithms for both clear-sky and cloudy-sky conditions. These algorithms were applied to MODIS Terra data and extensively validated using one year's ground data at 13 stations around globe. For clear sky conditions, two algorithms using atmospheric parameters, two algorithms using satellite thermal radiances, and an algorithm that combined using satellite thermal data and atmospheric parameters were compared. The validation result indicated that the first type of algorithms often underestimated DLRs over high altitude regions, while the second type of algorithms performed well over these regions but had significant positive errors over arid regions. The third type of algorithm had acceptable results over all types of regions. Furthermore, the study found that using NCEP derived atmospheric parameters could effectively improve the performance of the first algorithms over high altitude regions, compared with MODIS atmospheric product. For cloudy conditions, three parametric algorithms that determined cloud radiative effect by cloud base temperature, and an empirical algorithm that employed cloud water path and cloud ice path were compared. The validation results indicated that the empirical algorithm had best results in most of the sites, while the three parametric algorithms were greatly influenced by the uncertainties of cloud parameters.

关键词： downward longwave radiation algorithms comparison MODIS NCEP clear-sky cloudy-sky

来源：评论

学校读者我要写书评

暂无评论

In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: The adaptive variants

引用

JOURNAL OF SYMBOLIC COMPUTATION 2020年 101卷 270-303页

作者： Berthomieu, Jeremy Faugere, Jean-Charles Sorbonne Univ CNRS INRIA LIP6Equipe PolSys F-75005 Paris France CryptoNext Secur Paris France

The BERLEKAMP-MASSEY-SAKATA algorithm and the SCALAR-FGLM algorithm both compute the ideal of relations of a multidimensional linear recurrent sequence. Whenever quering a single sequence element is prohibitive, the bottleneck of these algorithms becomes the computation of all the needed sequence terms. As such, having adaptive variants of these algorithms, reducing the number of sequence queries, becomes mandatory. A native adaptive variant of the SCALAR-FGLM algorithm was presented by its authors, the so-called Adaptive SCALAR-FGLM algorithm. In this paper, our first contribution is to make the BERLEKAMP MASSEY-SAKATA algorithm more efficient by making it adaptive to avoid some useless relation testings. This variant allows us to divide by four in dimension 2 and by seven in dimension 3 the number of basic operations performed on some sequence family. Then, we compare the two adaptive algorithms. We show that their behaviors differ in a way that it is not possible to tweak one of the algorithms in order to mimic exactly the behavior of the other. We detail precisely the differences and the similarities of both algorithms and conclude that in general the ADAPTIVE SCALAR-FGLM algorithm needs fewer queries and performs fewer basic operations than the Adaptive BERLEKAMP-MASSEY-SAKATA algorithm. We also show that these variants are always more efficient than the original algorithms. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： The BMS algorithm The SCALAR-FGLM algorithm Grobner basis computation Multidimensional linear recurrent sequence algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

A comparison of Community Detection algorithms on Artificial Networks

A Comparison of Community Detection Algorithms on Artificial...

引用

12th International Conference on Discovery Science

作者： Orman, Guence Keziban Labatut, Vincent Galatasaray Univ Dept Comp Sci Ortakoy Istanbul Turkey

ISBN: (纸本)9783642047466

Community detection has become a very important part in complex networks analysis. Authors traditionally test their algorithms on a few real or artificial networks. Testing on real networks is necessary, but also limited: the considered real networks are usually small, the actual underlying communities are generally not defined objectively, and it is not possible to control their properties. Generating artificial networks makes it possible to overcome these limitations. Until recently though, most works used variations of the classic Erdos-Renyi random model and consequently suffered from the same flaws, generating networks not realistic enough. In this work, we use Lancichinetti et al. model, which is able to generate networks with controlled power-law degree and community distributions, to test some community detection algorithms. We analyze the properties of the generated networks and use the normalized mutual information measure to assess the quality of the results and compare the considered algorithms.

关键词： Complex networks Community detection algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

Qualitative comparison of Community Detection algorithms

Qualitative Comparison of Community Detection Algorithms

引用

International Conference on Digital Information and Communication Technology and Its Applications

作者： Orman, Gunce Keziban Labatut, Vincent Cherifi, Hocine Galatasaray Univ Dept Comp Sci Istanbul Turkey Univ Burgundy CNRS LE2I UMR F-5158 Dijon France

ISBN: (纸本)9783642220265

Community detection is a very active field in complex networks analysis, consisting in identifying groups of nodes more densely interconnected relatively to the rest of the network. The existing algorithms are usually tested and compared on real-world and artificial networks, their performance being assessed through some partition similarity measure. However, artificial networks realism can be questioned, and the appropriateness of those measures is not obvious. In this study, we take advantage of recent advances concerning the characterization of community structures to tackle these questions. We first generate networks thanks to the most realistic model available to date. Their analysis reveals they display only some of the properties observed in real-world community structures. We then apply five community detection algorithms on these networks and find out the performance assessed quantitatively does not necessarily agree with a qualitative analysis of the identified communities. It therefore seems both approaches should be applied to perform a relevant comparison of the algorithms.

关键词： Complex Networks Community Detection Community Properties algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

comparison and Assessment of Different Image Registration algorithms Based on ITK

Comparison and Assessment of Different Image Registration Al...

引用

International Conference on Materials Engineering and Mechanical Automation (MEMA 2013)

作者： Zhou, Zhenhuan Shenzhen Polytech Sch Elect & Commun Engn Shenzhen 518055 Guangdong Peoples R China

ISBN: (纸本)9783037859018

A lot of image registration algorithms are proposed in recent year, among these algorithms, which one is better or faster than the other can be only validated by experiments. In this paper, ITK (Insight Segmentation and Registration Toolkit) is used for verifying different algorithms as a framework. ITK framework requires the following components: a fixed image, a moving image, a transform, a metric, an interpolator and an optimizer. Dozens of classical algorithms are tested under the same conditions and their experimental results are demonstrated with different metrics, interpolators or optimizers. By comparison of registration time and accuracy, those practical and useful algorithms are selected for developing software in image analysis. These kinds of experiments are very valuable for software engineering, they can shorten the cycle of software development and greatly reduce the development costs.

关键词： Image registration ITK algorithms comparison Registration framework

来源：评论

学校读者我要写书评

暂无评论

comparison of Several Stochastic and Deterministic Derivative-Free Global Optimization algorithms 18th

Comparison of Several Stochastic and Deterministic Derivativ...

引用

18th International Conference on Mathematical Optimization Theory and Operations Research (MOTOR)

作者： Sovrasov, Vladislav Lobachevsky State Univ Nizhni Novgorod Nizhnii Novgorod Russia

ISBN: (纸本)9783030226299;9783030226282

In this paper popular open-source solvers are compared against Globalizer solver, which is developed at the Lobachevsky State University. The Globalizer is designed to solve problems with black-box objective function satisfying the Lipschitz condition and shows competitive performance with other similar solvers. The comparison is done on several sets of challenging multi-extremal benchmark functions. Also this work considers a method of heuristic hyperparameters control for the Globalizer allowing to reduce amount of initial tuning before optimization. The proposed scheme allows substantially increase convergence speed of the Globalizer by switching between "local" and "global" search phases in runtime.

关键词： Deterministic global optimization Stochastic global optimization algorithms comparison Derivative-free algorithms Black-box optimization Multi-extremal problems

来源：评论

学校读者我要写书评

暂无评论

comparison of Lake Area Extraction algorithms in Qinghai Tibet Plateau Leveraging Google Earth Engine and Landsat-9 Data

引用

REMOTE SENSING 2022年第18期14卷 4612-4612页

作者： Li, Xusheng Zhang, Donghui Jiang, Chenchen Zhao, Yingjun Li, Hu Lu, Donghua Qin, Kai Chen, Donghua Liu, Yufeng Sun, Yu Liu, Saisai Beijing Res Inst Uranium Geol Natl Key Lab Remote Sensing Informat & Imagery An Beijing 100029 Peoples R China Chinese Acad Sci Aerosp Informat Res Inst Natl Engn Lab Satellite Remote Sensing Applicat N Beijing 100094 Peoples R China Peking Univ Sch Earth & Space Sci Inst Remote Sensing & Geog Informat Syst Beijing 100871 Peoples R China Anhui Normal Univ Sch Geog & Tourism Wuhu 241000 Peoples R China Chuzhou Univ Sch Comp & Informat Engn Chuzhou 239000 Peoples R China

Monitoring the lake waterbody area in the Qinghai-Tibet Plateau (QTP) is significant in dealing with global climate change. The latest released Landsat-9 data, which has higher radiation resolution and can be complemented with other Landsat data to improve imaging temporal resolution, have great potential for applications in lake area extraction. However, no study is published on identifying waterbodies and lakes in large-scale plateau scenes based on Landsat-9 data. Therefore, we relied on the Google Earth Engine (GEE) platform and selected ten waterbody extraction algorithms to evaluate the quantitative evaluation of waterbody and lake area extraction results on the QTP and explore the usability of Landsat-9 images in the relationship between the extraction accuracy and the algorithm. The results show that the random forest (RF) algorithm performs best in all models. The overall accuracy of waterbody extraction is 95.84%, and the average lake waterbody area extraction error is 1.505%. Among the traditional threshold segmentation waterbody extraction algorithms, the overall accuracy of the NDWI waterbody extraction method is 89.89%, and the average error of lake waterbody area extraction is 3.501%, which is the highest performance model in this kind of algorithm. The linear regression coefficients of NDVI and reflectance of Landsat-8 and Landsat-9 data are close to 1, and R-2 is more significant than 0.91. At the same time, the overall accuracy difference of water extraction between the two data is not better than 1.1%. This study proves that Landsat-9 and Landsat-8 data have great consistency, which can be used for collaborative analysis to identify plateau waterbodies more efficiently. With the development of cloud computing technologies, such as Gee, more complex models, such as RF, can be selected to improve the extraction accuracy of the waterbody and lake area in large-scale research.

关键词： Landsat-9 data Qinghai-Tibet Plateau lake waterbody GEE algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

comparison and Assessment of Different Image Registration algorithms Based on ITK

Comparison and Assessment of Different Image Registration Al...

引用

2013 International Conference on Materials Engineering and Mechanical Automation(MEMA 2013)

作者： Zhenhuan Zhou School of Electronics and Communication Engineering Shenzhen Polytechnic

A lot of image registration algorithms are proposed in recent year,among these algorithms,which one is better or faster than the other can be only validated by *** this paper,ITK(Insight Segmentation and Registration Toolkit)is used for verifying different algorithms as a *** framework requires the following components:a fixed image,a moving image,a transform,a metric,an interpolator and an *** of classical algorithms are tested under the same conditions and their experimental results are demonstrated with different metrics,interpolators or *** comparison of registration time and accuracy,those practical and useful algorithms are selected for developing software in image *** kinds of experiments are very valuable for software engineering,they can shorten the cycle of software development and greatly reduce the development costs.

关键词： Image registration ITK algorithms comparison Registration framework

来源：评论

学校读者我要写书评

暂无评论

Replication and comparison of computational experiments in applied evolutionary computing: Common pitfalls and guidelines to avoid them

引用

APPLIED SOFT COMPUTING 2014年 19卷 161-170页

作者： Crepinsek, Matej Liu, Shih-Hsi Mernik, Marjan Univ Maribor Fac Elect Engn & Comp Sci Maribor 2000 Slovenia Calif State Univ Fresno Dept Comp Sci Fresno CA 93740 USA

Replicating and comparing computational experiments in applied evolutionary computing may sound like a trivial task. Unfortunately, it is not so. Namely, many papers do not document experimental settings in sufficient detail, and hence replication of experiments is almost impossible. Additionally, some work fails to satisfy the thumb rules for Experimentation throughout all disciplines, such that all experiments should be conducted and compared under the same or stricter conditions. Also, because of the stochastic properties inherent in evolutionary algorithms (EAs), experimental results should always be rich enough with respect to Statistics. Moreover, the comparisons conducted should be based on suitable performance measures and show the statistical significance of one approach over others. Otherwise, the derived conclusions may fail to have scientific merits. The primary objective of this paper is to offer some preliminary guidelines and reminders for assisting researchers to conduct any replications and comparisons of computational experiments when solving practical problems, by the use of EAs in the future. The common pitfalls are explained, that solve economic load dispatch problems using EAs from concrete examples found in some papers. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Evolutionary algorithms Experiments replication algorithms comparison Economic load dispatch

来源：评论

学校读者我要写书评

暂无评论

Ranking and comparing evolutionary algorithms with Hellinger-TOPSIS

引用

APPLIED SOFT COMPUTING 2015年 37卷 217-226页

作者： Krohling, Renato A. Lourenzutti, Rodolfo Campos, Mauro Univ Fed Espirito Santo PPGI UFES Dept Prod Engn BR-29060270 Vitoria ES Brazil Univ Fed Espirito Santo PPGI UFES Grad Program Comp Sci BR-29060270 Vitoria ES Brazil

When multiple algorithms are applied to multiple benchmarks as it is common in evolutionary computation, a typical issue rises, how can we rank the algorithms? It is a common practice in evolutionary computation to execute the algorithms several times and then the mean value and the standard deviation are calculated. In order to compare the algorithms performance it is very common to use statistical hypothesis tests. In this paper, we propose a novel alternative method based on the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to support the performance comparisons. In this case, the alternatives are the algorithms and the criteria are the benchmarks. Since the standard TOPSIS is not able to handle the stochastic nature of evolutionary algorithms, we apply the Hellinger-TOPSIS, which uses the Hellinger distance, for algorithm comparisons. Case studies are used to illustrate the method for evolutionary algorithms but the approach is general. The simulation results show the feasibility of the Hellinger-TOPSIS to find out the ranking of algorithms under evaluation. (C) 2015 Elsevier B.V. All rights reserved.

关键词： algorithms comparison TOPSIS Hellinger-TOPSIS Hellinger distance

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：