اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThree-Dimensional Wind Profile Prediction with Trinion-Valued Adaptive Algorithms
61
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The problem of three-dimensional (3-D) wind profile prediction is addressed based a trinion wind model, which inherently reckons the coupling of the three perpendicular components of a wind field. The augmented trinion statistics are developed and employed to enhance the prediction performance due to its full exploitation of the second-order statistics. The proposed trinion domain processing can be regarded as a more compact version of the existing quaternion-valued approach, with a lower computational complexity. Simulations based on recorded wind data are provided to demonstrate the effectiveness of the proposed methods.
قيم البحث
اقرأ أيضاً
We prove existence and uniqueness of the mild solution of an infinite dimensional, operator valued, backward stochastic Riccati equation. We exploit the regularizing properties of the semigroup generated by the unbounded operator involved in the equa
tion. Then the results will be applied to characterize the value function and optimal feedback law for a infinite dimensional, linear quadratic control problem with stochastic coefficients.
We propose an approach for low-dimensional visualisation and classification of complex topological magnetic structures formed in magnetic materials. Within the approach one converts a three-dimensional magnetic configuration to a vector containing th
e only components of the spins that are parallel to the z axis. The next crucial step is to sort the vector elements in ascending or descending order. Having visualized profiles of the sorted spin vectors one can distinguish configurations belonging to different phases even with the same total magnetization. For instance, spin spiral and paramagnetic states with zero total magnetic moment can be easily identified. Being combined with a simplest neural network our profile approach provides a very accurate phase classification for three-dimensional magnets characterized by complex multispiral states even in the critical areas close to phases transitions. By the example of the skyrmionic configurations we show that profile approach can be used to separate the states belonging to the same phase.
This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of infinite dimensional Hilbert spaces. For this purpose, several inertial hybrid and shrinking projection algorithms are proposed under the
effect of self-adaptive stepsizes which does not require information of the norms of the given operators. Some strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, an experimental application is given to illustrate the performances of proposed methods by comparing existing results.
Stochastic optimization finds a wide range of applications in operations research and management science. However, existing stochastic optimization techniques usually require the information of random samples (e.g., demands in the newsvendor problem)
or the objective values at the sampled points (e.g., the lost sales cost), which might not be available in practice. In this paper, we consider a new setup for stochastic optimization, in which the decision maker has access to only comparative information between a random sample and two chosen decision points in each iteration. We propose a comparison-based algorithm (CBA) to solve such problems in one dimension with convex objective functions. Particularly, the CBA properly chooses the two points in each iteration and constructs an unbiased gradient estimate for the original problem. We show that the CBA achieves the same convergence rate as the optimal stochastic gradient methods (with the samples observed). We also consider extensions of our approach to multi-dimensional quadratic problems as well as problems with non-convex objective functions. Numerical experiments show that the CBA performs well in test problems.
Sentence specificity quantifies the level of detail in a sentence, characterizing the organization of information in discourse. While this information is useful for many downstream applications, specificity prediction systems predict very coarse labe
ls (binary or ternary) and are trained on and tailored toward specific domains (e.g., news). The goal of this work is to generalize specificity prediction to domains where no labeled data is available and output more nuanced real-valued specificity ratings. We present an unsupervised domain adaptation system for sentence specificity prediction, specifically designed to output real-valued estimates from binary training labels. To calibrate the values of these predictions appropriately, we regularize the posterior distribution of the labels towards a reference distribution. We show that our framework generalizes well to three different domains with 50%~68% mean absolute error reduction than the current state-of-the-art system trained for news sentence specificity. We also demonstrate the potential of our work in improving the quality and informativeness of dialogue generation systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
