An economic investigation of the wind-hydrogen projects: A case study

Hydrogen as an energy carrier can play a significant role in reducing environmental emissions if it is produced from renewable energy resources. This research aims to assess hydrogen production from wind energy considering environmental, economic, and technical aspect for the East Azerbaijan province of Iran. The economic assessment is performed by calculation of payback period, levelized cost of hydrogen, and levelized cost of electricity. Since uncertainty in the power output of wind turbines may affect the payback period, all calculations are performed for four different turbine degradation rates. While it is common in the literature to choose the wind turbine based on a single criterion, this study implements Multi-Criteria Decision-Making (MCDM) techniques for this purpose. The results of Step-wise Weight Assessment Ratio Analysis illustrates that economic issue is the most important criterion for this research. The results of Weighted Aggregated Sum Product Assessment shows that Vestas V52 is the most suitable wind turbine for Ahar and Sarab cities, while Eovent EVA120 H-Darrieus is a better choice for other stations. The most suitable location for wind power generation is found to be Ahar, where it is estimated to annually generate 2914.8 kWh of electricity at the price of 0.045 $/kWh, and 47.2 tons of hydrogen at the price of 1.38 $/kg, which result in 583 tons of CO₂ emission reduction.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

Bayesian Inference for ARFIMA Models

This article develops practical methods for Bayesian inference in the autoregressive fractionally integrated moving average (ARFIMA) model using the exact likelihood function, any proper prior distribution, and time series that may have thousands of observations. These methods utilize sequentially adaptive Bayesian learning, a sequential Monte Carlo algorithm that can exploit massively parallel desktop computing with graphics processing units (GPUs). The article identifies and solves several problems in the computation of the likelihood function that apparently have not been addressed in the literature. Four applications illustrate the utility of the approach. The most ambitious is an ARFIMA(2,d,2) model for the Campito tree ring time series (length 5405), for which the methods developed in the article provide an essentially uncorrelated sample of size 16,384 from the exact posterior distribution in under four hours. Less ambitious applications take as little as 4 minutes without exploiting GPUs.     

Multicriteria decision-making using Archimedean aggregation operators in Pythagorean hesitant fuzzy environment

In multicriteria decision-making (MCDM), the existing aggregation operators are mostly based on algebraic t-conorm and t-norm. But, Archimedean t-conorms and t-norms are the generalized forms of t-conorms and t-norms which include algebraic, Einstein, Hamacher, Frank, and other types of t-conorms and t-norms. From that view point, in this paper the concepts of Archimedean t-conorm and t-norm are introduced to aggregate Pythagorean hesitant fuzzy information. Some new operational laws for Pythagorean hesitant fuzzy numbers based on Archimedean t-conorm and t-norm have been proposed. Using those operational laws, Archimedean t-conorm and t-norm-based Pythagorean hesitant fuzzy weighted averaging operator and weighted geometric operator are developed. Some of their desirable properties have also been investigated. Afterwards, these operators are applied to solve MCDM problems in Pythagorean hesitant fuzzy environment. The developed Archimedean aggregation operators are also applicable in Pythagorean fuzzy contexts also. To demonstrate the validity, practicality, and effectiveness of the proposed method, a practical problem is considered, solved, and compared with other existing method.     

Transport Map sampling with PGD model reduction for fast dynamical Bayesian data assimilation

The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. First, the proper generalized decomposition (PGD) is used to reduce the computational evaluation of the posterior density in the online phase. Second, Transport Map sampling is used to build a deterministic coupling between a reference measure and the posterior measure. The determination of the transport maps involves the solution of a minimization problem. As the PGD model is quasi-analytical and under a variable separation form, the use of gradient and Hessian information speeds up the minimization algorithm. Eventually, uncertainty quantification on outputs of interest of the model can be easily performed due to the global feature of the PGD solution over all coordinate domains. Numerical examples highlight the performance of the method.     

Nonuniform linear array DOA estimation using EM criterion

In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources.     

基于分段加权的反向稀疏跟踪算法研究

为提高稀疏表示跟踪模型性能，提出一种分段加权的反向稀疏跟踪算法，将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题，构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰，选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明，在光照变化、遮挡、快速运动、运动模糊情况下，所提出的算法可以确保跟踪结果的准确性和鲁棒性。