差分

このページの2つのバージョン間の差分を表示します。

この比較画面へのリンク

両方とも前のリビジョン 前のリビジョン
次のリビジョン
前のリビジョン
次のリビジョン両方とも次のリビジョン
en:default [2018/06/01 19:15] – [Welcome to Mathematical Optimization Laboratory!] kazen:default [2022/01/24 13:59] Hideaki IIDUKA
行 1: 行 1:
-====== Welcome to Mathematical Optimization Laboratory======+====== Mathematical Optimization Laboratory ======
 ~~NOTOC~~ ~~NOTOC~~
  
行 6: 行 6:
  
 <WRAP rightalign> <WRAP rightalign>
-[[https://kaken.nii.ac.jp/d/p/15K04763.en.html|{{:kakenhi.jpg|}}]]+[[https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-21K11773/|{{:kakenhi.jpg|}}]]
 </WRAP> </WRAP>
  
-{{ ::renewalogoen.png?nolink |}}+/* 
 +{{ :en:yukobayashi.jpg?640&nolink |}} 
 +<WRAP rightalign>The photo is taken at the celebration party of Prof Iiduka's promotion (Aug. 17th, 2019).</WRAP> 
 +*/
  
-<WRAP round info><WRAP box> +[[|{{ :iiduka:20210906.jpg?480 |}}]]
-==== What's New ====+
  
-  * 2018/06/01URL of our website has been moved to [[https://iiduka.net]]Your browser will be automatically forwarded to new URLs when you access old ones. +/* vvvvv Facebook 埋め込むやつ vvvvv */ 
-  * 2017/11/02: Please use [[https://authors.elsevier.com/c/1V~dr3INuk2mRE|this link]] which will provide free access to our article  "[[http://www.sciencedirect.com/science/article/pii/S0925231217313486|Optimality and convergence for convex ensemble learning with sparsity and diversity based on fixed point optimization]]", and is valid for 50 days, until December 22, 2017. +<html><div style="text-align:center"><iframe src="https://www.facebook.com/plugins/page.php?href=https%3A%2F%2Fwww.facebook.com%2Fiidukanet&tabs=timeline&width=500&height=500&small_header=true&adapt_container_width=true&hide_cover=true&show_facepile=false&appId=772928636127053width="500" height="500" style="border:none;overflow:hidden" scrolling="no" frameborder="0" allowTransparency="true" allow="encrypted-media"></iframe></div></html> 
-  2017/11/01: Our article "[[http://www.sciencedirect.com/science/article/pii/S0925231217313486|Optimality and convergence for convex ensemble learning with sparsity and diversity based on fixed point optimization]]" ({{:iiduka:h_i_neucom2017.pdf|PDF}}) has been accepted for publication in the [[https://www.journals.elsevier.com/neurocomputing/|Neurocomputing]]It proposes sparsity and diversity learning methods with fixed point optimization algorithmsPlease see {{:iiduka:h_i_neucom2017.pdf|PDF}}.   +/* ^^^^^ Facebook 埋め込むやつ ^^^^^ *
-<WRAP rightalign>[[:en:news|more...]]</WRAP></WRAP></WRAP>+ 
 + 
 +/* 
 +[[https://twitter.com/Meiji_Univ_PR/status/1176731063621578753|{{ :iiduka:87214898_639572380209072_1144529439158173696_o.jpg?480 |}}]] 
 +*/ 
 + 
 +/* Temporarily Disabled 
 +<html><div style="text-align:center"><iframe src="https://www.facebook.com/plugins/page.php?href=https%3A%2F%2Fwww.facebook.com%2Fiidukanet&tabs=timeline&width=500&height=300&small_header=true&adapt_container_width=true&hide_cover=true&show_facepile=false&appId=772928636127053" width="500" height="300" style="border:none;overflow:hidden" scrolling="no" frameborder="0" allowTransparency="true" allow="encrypted-media"></iframe></div></html> 
 +*/
 ===== Postal Address ===== ===== Postal Address =====
 Department of Computer Science\\ Department of Computer Science\\
  • en/default.txt
  • 最終更新: 2023/03/01 11:26
  • by Hideaki IIDUKA