We show a general method to estimate with optimum precision, i.e., the best precision determined by the light-matter interaction process, a set of parameters that characterize a phase object. The method derives from i...
详细信息
Chess is a very demanding sport as it requires advanced planning and strategic thinking skills. The degree of difficulty of the game also depends on the time allotted for a game, which can range from a few minutes to ...
详细信息
Chess is a very demanding sport as it requires advanced planning and strategic thinking skills. The degree of difficulty of the game also depends on the time allotted for a game, which can range from a few minutes to several tens of minutes. For this reason, the games are divided into several categories: standard, blitz, and bullet. However, as many chess players specialize in only some of the categories, it is difficult to determine the best chess player. It is very important to keep a proper ranking of the players. One way to recognize their achievements is the FIDE (Fédération Internationale des Échecs) titles awarded to the best players. However, there is still the problem of how to determine the best among the Grandmasters. There are many very talented players competing in chess. Creating a single ranking for all types of chess, regardless of the time allotted for the game, is a difficult challenge, as many undeniably outstanding chess players do not specialize in all types. Creating a ranking for only one type would not accurately describe the level of players. Therefore, a ranking was created based on all of them using the COMET method, which belongs to the multi-criteria decision-making methods (MCDA). It is based on fuzzy logic and uses characteristic objects for the assessment of alternatives, which guarantees immunity to the paradox of reversal rankings. Expert opinion was used for correct evaluation. This article presents the ranking of chess players regardless of the type of game they specialize in, to prove that it should be possible to identify the single best chess player.
In this paper, the modified technology of nanoporous aluminum oxide (Al2O3) matrices filling with the KDP, ADP, and TGS crystals is proposed. The transmission spectra of the grown structures were studied at 300-3000 n...
详细信息
Plug-and-Play (PnP) is a non-convex optimization framework that combines proximal algorithms, for example, the alternating direction method of multipliers (ADMM), with advanced denoising priors. Over the past few year...
详细信息
Plug-and-Play (PnP) is a non-convex optimization framework that combines proximal algorithms, for example, the alternating direction method of multipliers (ADMM), with advanced denoising priors. Over the past few years, great empirical success has been obtained by PnP algorithms, especially for the ones that integrate deep learning-based denoisers. However, a key problem of PnP approaches is the need for manual parameter tweaking which is essential to obtain high-quality results across the high discrepancy in imaging conditions and varying scene content. In this work, we present a class of tuning-free PnP proximal algorithms that can determine parameters such as denoising strength, termination time, and other optimization-specific parameters automatically. A core part of our approach is a policy network for automated parameter search which can be effectively learned via a mixture of model-free and model-based deep reinforcement learning strategies. We demonstrate, through rigorous numerical and visual experiments, that the learned policy can customize parameters to different settings, and is often more efficient and effective than existing handcrafted criteria. Moreover, we discuss several practical considerations of PnP denoisers, which together with our learned policy yield state-of-the-art results. This advanced performance is prevalent on both linear and nonlinear exemplar inverse imaging problems, and in particular shows promising results on compressed sensing MRI, sparse-view CT, single-photon imaging, and phase retrieval.
We perform simulations of structural balance evolution on a triangular lattice using the heat-bath algorithm. In contrast to similar approaches — but applied to analysis of complete graphs — the triangular lattice t...
详细信息
Background and objective: With the rapid development of data science methods like deep learning, these methods have already been used into the field of healthcare and medicine. However, due to regulations and ethical ...
详细信息
The calculation of interaction integrals is a bottleneck for the treatment of many-body quantum systems due to its high numerical cost. We conduct configuration interaction calculations of the few-electron states conf...
详细信息
Primordial black holes (PBHs) and the violation of the null energy condition (NEC) have significant implications for our understanding of the very early universe. We present a novel approach to generate PBHs via the N...
详细信息
作者:
Andrii ShekhovtsovResearch Team on Intelligent Decision Support Systems
Department of Artificial Intelligence and Applied Mathematics Faculty of Computer Science and Information Technology West Pomeranian University of Technology in Szczecin ul. Żołnierska 49 71-210 Szczecin Poland
It is common practice in the MCDA to use several multi-criteria decision methods and then compares obtained rankings with one or two different rank correlation coefficients. The problem is that different rank correlat...
详细信息
It is common practice in the MCDA to use several multi-criteria decision methods and then compares obtained rankings with one or two different rank correlation coefficients. The problem is that different rank correlation coefficient gives different values for the same pair of rankings, and the number of studies which tries to investigate it is small. Studying the similarity of rankings is a very important challenge in multi-criteria decision support, and the coefficients themselves seem to be the most practical ways of evaluating rankings. This paper compares chosen rank correlation coefficients to show how much different they are. Spearman’s, Weighted Spearman’s, Kendall Tau and Rank similarity correlation coefficient are compared statistically. The paper confirms that the coefficients are closely related, and their dependence is graphically represented, which initiates research towards allows for their better selection in the future. In conclusions, directions of further development are indicated.
The present work looks for the possible existence of static and spherically symmetric wormhole geometries in Rastall-Rainbow gravity. Since, the Rastall-Rainbow gravity model has been constructed with the combination ...
详细信息
暂无评论