5789 research outputs found
Sort by
Operations on M-convex Functions on Jump Systems
「離散凸解析」における「(従来の)M凸関数」は、関数同士のいくつかの演算に関して閉じているという性質を持つ。例えば、連続変数の関数においてはよく表れる「畳み込み」の演算に関しても、「(従来の)M凸関数」f1,f2の畳み込みf1□ f2はやはり「(従来の)M凸関数」になる。このような結果は、現実の最適化問題に現れる関数が「(従来の)M凸関数」かどうかを判定す場合に有効となる。本論文では、前述の「ジャンプシステム」上に拡張された「M凸関数」に対しても、同様の結果が成立することを示した
Discrete approximations of continuous distributions by maximum entropy
In numerically implementing the optimization of an expected value in many economic models, it is often necessary to approximate a given continuous probability distribution by a discrete distribution. We propose an approximation method based on the principle of maximum entropy and minimum Kullback–Leibler information, which is computationally very simple. Our method is not intended to replace existing methods but to complement them by “fine-tuning” probabilities so as to match prescribed (not necessarily polynomial) moments exactly
A corpus-based computational model of metaphor understanding consisting of two processes
For a fistful of dollars: using crowd-sourcing to evaluate a spoken language CALL application.
Available online <https://doi.org/10.21437/SLaTE.2011-20
Computers and Games, Second International Conference, CG 2000, Hamamatsu, Japan, October 26-28, 2000, Revised Papers
Available online <https://doi.org/10.1007/3-540-45579-5
And the Fans Are Going Wild! SIG plus MIKE.
Available online <https://doi.org/10.1007/3-540-45324-5_12