Welcome to TiddlyWiki created by Jeremy Ruston; Copyright © 2004-2007 Jeremy Ruston, Copyright © 2007-2011 UnaMesa Association
* P. Carpentier, J.-P. Chancelier, G. Cohen, M. De Lara and P. Girardeau. Dynamic consistency for stochastic optimal control problems. Annals of Operations Research DOI: [[10.1007/s10479-011-1027-8|http://dx.doi.org/10.1007/s10479-011-1027-8]]
* P. Carpentier, J.-P Chancelier, M. De Lara, and SOWG. Approximations of stochastic optimization problems subject to measurability constraints. SIAM J. Optim. Volume 19, Issue 4, pp. 1719-1734 (2009) [[10.1137/070692376|http://dx.doi.org/10.1137/070692376]].
* J.-P. Chancelier, M. De Lara, and A. De Palma. Risk aversion in expected intertemporal discounted utilities bandit problems. Theory and Decision 2008. Theory and Decision, Springer US, 21.04.2008, vol. 67, no. 4, pp. 433-440 [[doi:10.1007/s11238-008-9105-3|http://springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s11238-008-9105-3]].
* J.-P. Chancelier. T-class algorithms for pseudocontractions and k-strict pseudocontractions in Hilbert spaces. Nonlinear Analysis: Theory, Methods & Applications. [[doi:10.1016/j.na.2009.04.049|http://dx.doi.org/10.1016/j.na.2009.04.049]].
* J.-P. Chancelier. Iterative schemes for computing fixed points of nonexpansive mappings in banach spaces. Journal of Mathematical Analysis and Applications Volume 353, Issue 1, 1 May 2009, Pages 141-153 [[10.1016/j.jmaa.2008.11.041|http://dx.doi.org/10.1016/j.jmaa.2008.11.041]].
* J.-P. Chancelier, M. Messaoud and A. Sulem. A policy iteration algorithm for fixed point problems with nonexpansive operators. Math. Meth. Oper. Res. 65:239-259, 2007. [[10.1007/s00186-006-0103-3|http://dx.doi.org/10.1007/s00186-006-0103-3]]
* J.-P. Chancelier and M De Lara and A. De Palma. Risk aversion and optimal strategies in a one-armed bandit problem: an application to road choice, Transportation Science 41(1): 1-14, 2007. [[10.1287/trsc.1060.0179|http://dx.doi.org/10.1287/trsc.1060.0179]]
* K. Barty, P. Carpentier, J.-P. Chancelier, G. Cohen, M. De Lara and T. Guilbaud. Dual effect free stochastic controls. Annals of Operation Research 142:41-62, 2006. [[10.1007/s10479-006-6160-4|http://dx.doi.org/10.1007/s10479-006-6160-4].
* Tomasz R. Bielecki, ~Jean-Philippe Chancelier, Stanley R. Pliska, and Agnès Sulem. Risk sensitive portfolio optimization with transaction costs. Journal of computational Finance, 8(1):39-65, 2004.
* J.-P. Chancelier, B.Oksendal, and A.Sulem. Combined stochastic control and optimal stopping, and application to numerical approximation of combined stochastic and impulse control. In Stochastic Financial Mathematics. Proc. Steklov Math. Inst., Vol. 237, pp 149 -173, editeur A.N. Shiryaev, Moscou, 2002.
* J.-P. Chancelier, G. Chebbo, and E. ~Lucas-Aiguier. Estimation of settling velocities. Water Research, 32(11):3461-3471, 1998.
* J.-P. Chancelier, M. Cohen de Lara, and F. Pacard. New insights in dynamical modeling of a secondary settler- I.flux theory and steady states analysis. Water Research, 31(8):1847-1856, 1997.
* J.-P. Chancelier, M. Cohen de Lara, and F. Pacard. A stochastic approach to model bottom boundary conditions in a settling tank. Stochastic Hydrology and Hydraulics, 11(6):449-457, 1997.
* J.-P. Chancelier, M.Cohen de Lara, and F.Pacard. New insights in dynamical modeling of a secondary settler- II.dynamical analysis. Water Research, 31(8):1857-1866, 1997.
* J.-P. Chancelier, M. Cohen de Lara, and F. Pacard. Existence of a solution in an age-dependent transport-diffusion pde: a model of settler. Mathematical Models and Methods in Applied Sciences, 5(3):267-278, 1995.
* J.-P. Chancelier, M. Cohen de Lara, and F. Pacard. Equation de ~Fokker-Planck pour la densité d'un processus de diffusion dans un ouvert régulier. C.R. Acad. Sci. Paris, Série I Math., 321:1251-1256, 1995.
* J.-P. Chancelier, M. Cohen de Lara, and F.Pacard. Analysis of a conservation pde with discontinuous flux: a model of settler. SIAM J. of Applied Math., 54(4):954-995, 1994.
* J.-P. Chancelier and A.Renaud. Daily generation scheduling: decomposition methods to solve the hydraulic problems. International Journal of Electrical Power and Energy Systems, 16(3):175-181, 1994.
[img[images/img-book-new.png][http://www.springer.com/math/cse/book/978-1-4419-5526-5]] [img[images/img-book-chinese.png]] [img[images/img-book-init.png][http://www.springer.com/west/home/computer/mathematics?SGWID=4-151-22-44240839-0&detailsPage=ppmmedia%7CotherBooks&seqNo=1&CIPageCounter=CI_MORE_BOOKS_BY_AUTHOR1]] [img[images/img-book-scicos.png][http://www.springer.com/east/home/generic/search/results?SGWID=5-40109-22-65671832-0&SHORTCUT=www.springer.com/sgw/cda/frontpage/0,11855,5-40109-22-65671832-0,00.html]] [img[images/img-book-birk.png][http://www.lavoisier.fr/notice/gbJLO6OOKNXLSRSO.html]] [img[images/img-book-delara-doyen.png][http://www.springer.com/978-3-540-79073-0]]
/***
|''Name:''|CryptoFunctionsPlugin|
|''Description:''|Support for cryptographic functions|
***/
//{{{
if(!version.extensions.CryptoFunctionsPlugin) {
version.extensions.CryptoFunctionsPlugin = {installed:true};
//--
//-- Crypto functions and associated conversion routines
//--
// Crypto "namespace"
function Crypto() {}
// Convert a string to an array of big-endian 32-bit words
Crypto.strToBe32s = function(str)
{
var be = Array();
var len = Math.floor(str.length/4);
var i, j;
for(i=0, j=0; i<len; i++, j+=4) {
be[i] = ((str.charCodeAt(j)&0xff) << 24)|((str.charCodeAt(j+1)&0xff) << 16)|((str.charCodeAt(j+2)&0xff) << 8)|(str.charCodeAt(j+3)&0xff);
}
while (j<str.length) {
be[j>>2] |= (str.charCodeAt(j)&0xff)<<(24-(j*8)%32);
j++;
}
return be;
};
// Convert an array of big-endian 32-bit words to a string
Crypto.be32sToStr = function(be)
{
var str = "";
for(var i=0;i<be.length*32;i+=8)
str += String.fromCharCode((be[i>>5]>>>(24-i%32)) & 0xff);
return str;
};
// Convert an array of big-endian 32-bit words to a hex string
Crypto.be32sToHex = function(be)
{
var hex = "0123456789ABCDEF";
var str = "";
for(var i=0;i<be.length*4;i++)
str += hex.charAt((be[i>>2]>>((3-i%4)*8+4))&0xF) + hex.charAt((be[i>>2]>>((3-i%4)*8))&0xF);
return str;
};
// Return, in hex, the SHA-1 hash of a string
Crypto.hexSha1Str = function(str)
{
return Crypto.be32sToHex(Crypto.sha1Str(str));
};
// Return the SHA-1 hash of a string
Crypto.sha1Str = function(str)
{
return Crypto.sha1(Crypto.strToBe32s(str),str.length);
};
// Calculate the SHA-1 hash of an array of blen bytes of big-endian 32-bit words
Crypto.sha1 = function(x,blen)
{
// Add 32-bit integers, wrapping at 32 bits
add32 = function(a,b)
{
var lsw = (a&0xFFFF)+(b&0xFFFF);
var msw = (a>>16)+(b>>16)+(lsw>>16);
return (msw<<16)|(lsw&0xFFFF);
};
// Add five 32-bit integers, wrapping at 32 bits
add32x5 = function(a,b,c,d,e)
{
var lsw = (a&0xFFFF)+(b&0xFFFF)+(c&0xFFFF)+(d&0xFFFF)+(e&0xFFFF);
var msw = (a>>16)+(b>>16)+(c>>16)+(d>>16)+(e>>16)+(lsw>>16);
return (msw<<16)|(lsw&0xFFFF);
};
// Bitwise rotate left a 32-bit integer by 1 bit
rol32 = function(n)
{
return (n>>>31)|(n<<1);
};
var len = blen*8;
// Append padding so length in bits is 448 mod 512
x[len>>5] |= 0x80 << (24-len%32);
// Append length
x[((len+64>>9)<<4)+15] = len;
var w = Array(80);
var k1 = 0x5A827999;
var k2 = 0x6ED9EBA1;
var k3 = 0x8F1BBCDC;
var k4 = 0xCA62C1D6;
var h0 = 0x67452301;
var h1 = 0xEFCDAB89;
var h2 = 0x98BADCFE;
var h3 = 0x10325476;
var h4 = 0xC3D2E1F0;
for(var i=0;i<x.length;i+=16) {
var j,t;
var a = h0;
var b = h1;
var c = h2;
var d = h3;
var e = h4;
for(j = 0;j<16;j++) {
w[j] = x[i+j];
t = add32x5(e,(a>>>27)|(a<<5),d^(b&(c^d)),w[j],k1);
e=d; d=c; c=(b>>>2)|(b<<30); b=a; a = t;
}
for(j=16;j<20;j++) {
w[j] = rol32(w[j-3]^w[j-8]^w[j-14]^w[j-16]);
t = add32x5(e,(a>>>27)|(a<<5),d^(b&(c^d)),w[j],k1);
e=d; d=c; c=(b>>>2)|(b<<30); b=a; a = t;
}
for(j=20;j<40;j++) {
w[j] = rol32(w[j-3]^w[j-8]^w[j-14]^w[j-16]);
t = add32x5(e,(a>>>27)|(a<<5),b^c^d,w[j],k2);
e=d; d=c; c=(b>>>2)|(b<<30); b=a; a = t;
}
for(j=40;j<60;j++) {
w[j] = rol32(w[j-3]^w[j-8]^w[j-14]^w[j-16]);
t = add32x5(e,(a>>>27)|(a<<5),(b&c)|(d&(b|c)),w[j],k3);
e=d; d=c; c=(b>>>2)|(b<<30); b=a; a = t;
}
for(j=60;j<80;j++) {
w[j] = rol32(w[j-3]^w[j-8]^w[j-14]^w[j-16]);
t = add32x5(e,(a>>>27)|(a<<5),b^c^d,w[j],k4);
e=d; d=c; c=(b>>>2)|(b<<30); b=a; a = t;
}
h0 = add32(h0,a);
h1 = add32(h1,b);
h2 = add32(h2,c);
h3 = add32(h3,d);
h4 = add32(h4,e);
}
return Array(h0,h1,h2,h3,h4);
};
}
//}}}
You can compile and run {{{nsp}}} from source on Linux. It should also work on cygwin/mingwin and a native win32 version will be soon available (with opengl support thru gtkglext).
You can access the cvs repository of Nsp using Anonymous CVS access via ssh.
This method follows the notes of [[http://www.kitenet.net/~joey/sshcvs|http://www.kitenet.net/~joey/sshcvs]] which are reproduced here.
There are two methods you can use; for either method, you will need [[this file|sshanoncvs.txt]] and you will have to use one of the two following methods.
* Download [[the file|sshanoncvs.txt]], make it executable, put it somewhere, say, {{{~/bin/sshanoncvs}}}. Then set the {{{CVS_RSH}}} environment variable to point to it and use {{{cvs}}} as you normally would. For example, just run this command to check out nsp:
{{{
CVS_RSH=~/bin/sshanoncvs cvs -d :ext:nsp@titan.enpc.fr:/u/cermics/q/nsp/cvsroot checkout nsp2
}}}
* Just use [[the file|sshanoncvs.txt]] as a {{{ssh}}} key file without making it executable. Download the file, set its permissions to 600, and put it in {{{~/.ssh/sshanoncvs}}}. Then add the following to your {{{~/.ssh/config}}}:
{{{
Host titan.enpc.fr
User nsp
IdentityFile ~/.ssh/sshanoncvs
ForwardAgent no
ForwardX11 no
Compression yes
}}}
Then just set {{{CVS_RSH=ssh}}} and checkout as normal:
{{{
SSH_AUTH_SOCK= CVS_RSH=ssh cvs -d :ext:nsp@titan.enpc.fr:/u/cermics/q/nsp/cvsroot checkout nsp2
}}}
Note that either of the two methods above require you be able to use {{{ssh}}} 2.
/***
|''Name:''|DeprecatedFunctionsPlugin|
|''Description:''|Support for deprecated functions removed from core|
***/
//{{{
if(!version.extensions.DeprecatedFunctionsPlugin) {
version.extensions.DeprecatedFunctionsPlugin = {installed:true};
//--
//-- Deprecated code
//--
// @Deprecated: Use createElementAndWikify and this.termRegExp instead
config.formatterHelpers.charFormatHelper = function(w)
{
w.subWikify(createTiddlyElement(w.output,this.element),this.terminator);
};
// @Deprecated: Use enclosedTextHelper and this.lookaheadRegExp instead
config.formatterHelpers.monospacedByLineHelper = function(w)
{
var lookaheadRegExp = new RegExp(this.lookahead,"mg");
lookaheadRegExp.lastIndex = w.matchStart;
var lookaheadMatch = lookaheadRegExp.exec(w.source);
if(lookaheadMatch && lookaheadMatch.index == w.matchStart) {
var text = lookaheadMatch[1];
if(config.browser.isIE)
text = text.replace(/\n/g,"\r");
createTiddlyElement(w.output,"pre",null,null,text);
w.nextMatch = lookaheadRegExp.lastIndex;
}
};
// @Deprecated: Use <br> or <br /> instead of <<br>>
config.macros.br = {};
config.macros.br.handler = function(place)
{
createTiddlyElement(place,"br");
};
// Find an entry in an array. Returns the array index or null
// @Deprecated: Use indexOf instead
Array.prototype.find = function(item)
{
var i = this.indexOf(item);
return i == -1 ? null : i;
};
// Load a tiddler from an HTML DIV. The caller should make sure to later call Tiddler.changed()
// @Deprecated: Use store.getLoader().internalizeTiddler instead
Tiddler.prototype.loadFromDiv = function(divRef,title)
{
return store.getLoader().internalizeTiddler(store,this,title,divRef);
};
// Format the text for storage in an HTML DIV
// @Deprecated Use store.getSaver().externalizeTiddler instead.
Tiddler.prototype.saveToDiv = function()
{
return store.getSaver().externalizeTiddler(store,this);
};
// @Deprecated: Use store.allTiddlersAsHtml() instead
function allTiddlersAsHtml()
{
return store.allTiddlersAsHtml();
}
// @Deprecated: Use refreshPageTemplate instead
function applyPageTemplate(title)
{
refreshPageTemplate(title);
}
// @Deprecated: Use story.displayTiddlers instead
function displayTiddlers(srcElement,titles,template,unused1,unused2,animate,unused3)
{
story.displayTiddlers(srcElement,titles,template,animate);
}
// @Deprecated: Use story.displayTiddler instead
function displayTiddler(srcElement,title,template,unused1,unused2,animate,unused3)
{
story.displayTiddler(srcElement,title,template,animate);
}
// @Deprecated: Use functions on right hand side directly instead
var createTiddlerPopup = Popup.create;
var scrollToTiddlerPopup = Popup.show;
var hideTiddlerPopup = Popup.remove;
// @Deprecated: Use right hand side directly instead
var regexpBackSlashEn = new RegExp("\\\\n","mg");
var regexpBackSlash = new RegExp("\\\\","mg");
var regexpBackSlashEss = new RegExp("\\\\s","mg");
var regexpNewLine = new RegExp("\n","mg");
var regexpCarriageReturn = new RegExp("\r","mg");
}
//}}}
* HelloThere
** [[Current|HelloThere]]
** [[Notes|NoteHelloThere]]
** [[Proposed|ProHelloThere]]
* Features
** [[Current|Features]]
** [[Notes|NoteFeatures]]
** [[Proposed|ProFeatures]]
* Downloads
** [[Current|Downloads]]
** [[Notes|NoteDownloads]]
** [[Proposed|ProDownloads]]
* Forum
** [[Current|Forum]]
** [[Notes|NoteForum]]
** [[Proposed|ProForum]]
* Get Involved
** [[Current|Get Involved]]
** [[Notes|NoteGet Involved]]
** [[Proposed|Get Involved]]
* Ideas
** [[Current|Ideas]]
** [[Notes|NoteIdeas]]
** [[Proposed|ProIdeas]]
* Add-ons
** [[Current|Add-ons]]
** [[Notes|NoteAdd-ons]]
** [[Proposed|ProAdd-ons]]
* Wiki
** [[Current|Wiki]]
** [[Notes|NoteWiki]]
** [[Proposed|ProWiki]]
* Blog
** [[Current|Blog]]
** [[Notes|NoteBlog]]
** [[Proposed|ProBlog]]
<<dropMenu>>
/% %/
/***
|''Name:''|DropDownMenuPlugin|
|''Description:''|Create dropdown menus from unordered lists|
|''Author:''|Saq Imtiaz ( lewcid@gmail.com )|
|''Source:''|http://tw.lewcid.org/#DropDownMenuPlugin|
|''Code Repository:''|http://tw.lewcid.org/svn/plugins|
|''Version:''|2.1 (much simplified for TiddlyWorld)|
|''Date:''|11/04/2007|
|''License:''|[[Creative Commons Attribution-ShareAlike 3.0 License|http://creativecommons.org/licenses/by-sa/3.0/]]|
|''~CoreVersion:''|2.2.5|
***/
/*{{{*/
config.macros.dropMenu={
handler : function(place,macroName,params,wikifier,paramString,tiddler){
list = findRelated(place.lastChild,"UL","tagName","previousSibling");
if (!list)return;
addClass(list,"suckerfish");
if (params.length){addClass(list,paramString);}
this.fixLinks(list);
},
fixLinks : function(el){
var els = el.getElementsByTagName("li");
for(var i = 0; i < els.length; i++) {
if(els[i].getElementsByTagName("ul").length>0){
var link = findRelated(els[i].firstChild,"A","tagName","nextSibling");
if(!link){
var ih = els[i].firstChild.data;
els[i].removeChild(els[i].firstChild);
var d = createTiddlyElement(null,"a",null,null,ih,{href:"javascript:;"});
els[i].insertBefore(d,els[i].firstChild);
}
else{
link.firstChild.data = link.firstChild.data;
removeClass(link,"tiddlyLinkNonExisting");
}
}
els[i].onmouseover = function() {addClass(this, "sfhover");};
els[i].onmouseout = function() {removeClass(this, "sfhover");};
}
}
};
config.shadowTiddlers["StyleSheetDropDownMenuPlugin"] = "";
store.addNotification("StyleSheetDropDownMenuPlugin",refreshStyles);
/*}}}*/
A Nsp graphic window embeded in a Gtk window with different widgets
[img[graphics-demo-small.png][graphics-demo.png]]
Build a Gtk widget in Nsp
[img[demogtk-small.png][demogtk.png]]
Nsp matrix edition in a Gtk Widget.
[img[gtk-widgets-small.png][gtk-widgets.png]]
Nsp main window.
[img[main-window-small.png][main-window.png]]
Nsp help window.
[img[help-window-small.png][help-window.png]]
A screen snapshot on Windows.
[img[nsp-tiddly/images/nsp.png][nsp-tiddly/images/nsp-big.png]]
A screen snapshot on Linux.
[img[nsp-tiddly/images/nsp-unix-small.png][nsp-tiddly/images/nsp-unix.png]]
To get started with this blank TiddlyWiki, you'll need to modify the following tiddlers:
* SiteTitle & SiteSubtitle: The title and subtitle of the site, as shown above (after saving, they will also appear in the browser title bar)
* MainMenu: The menu (usually on the left)
* DefaultTiddlers: Contains the names of the tiddlers that you want to appear when the TiddlyWiki is opened
You'll also need to enter your username for signing your edits: <<option txtUserName>>
Test
Next Figure gives the screen shot of a gtk window which is
built and activated from Nsp.
[img[demogtk.png]]
The graphic window is composed of a main window, a standard nsp
graphic window (which is itself a set of widgets) an adjustment
widget, three radio buttons and a close button.
When the adjustment button is moved the graph has to be recomputed and
redisplayed which a new grid size. When a radio button is changed
then the graph has to be redrawn with a changed colormap.
Gtk widget can be created and assembled in nsp in a similar way as if
the code was written in C. i.e the sequence of function call (or method
call is very similar). Note that at nsp level we use an object oriented way
to call Gtk functions. For example, a call to
{{{void gtk_window_set_title(GtkWindow *window,const gchar *title)}}}
is replaced in Nsp by calling the method {{{set_title}}} on a {{{GtkWindow}}}
object. All the Gtk widgets can be used at nsp level.
For example a {{{GtkWindow}}} widgets is created by calling
{{{gtkwindow_new()}}}.
The best way to rapidly write nsp gtk application is to start by
running the gtk demos and use their associated code as a guide and
use a gtk on line help manual to get real precise informations
on each function. For example to get more information on
a method call like {{{scale.set_size_request[150,-1]}}} you can
search the string {{{set_size_request}}} in Gtk help pages (through devhelp)
to obtain a reference to {{{gtk_widget_set_size_request ()}}}.
{{{set_size_request}}} is a method of the class {{{GtkWidget}}} and
since a {{{Gtkhscale}}} inherits from {{{GtkWidget}}} this method
can be used on the argument {{{scale}}}
Note also that a set of predefined gtk constants are accessible at
nsp level through predefined hash tables. Thus prefixing a predefined name by {{{GTK.}}}
will give its value.
The last important point is that handlers associated to signals can be given by nsp functions.
If the adjustment is moved on the described application, then a call to
{{{demo_dyn_graph_value_changed}}}
is performed. And when the handler is called, it is
called with appropriate arguments. The handler was connected with the command
{{{
adjustment.connect[ "value_changed",
demo_dyn_graph_value_changed, list(id_win,scale,win)];
}}}
Thus, when called the argument {{{widget}}} will be set to the GTkAdjustement widget which was
changed and {{{args}}} will be set to the list {{{list(id_win,scale,win)}}}.
Thus when called, handlers receive specific informations through arguments (here a
widget and a list, the list being composed of an integer, a GtkHscale widget and a GtkWindow widget).
More than one instance of the same application can coexists, since handlers when called
knows though their arguments which widgets and data they own.
Gtk objects for example a GtkWindow are objects with a by reference semantic and it is possible
to store data in each Gtk object through the use of methods {{{get_data}}} and {{{set_data}}}.
It is therefore possible to share data between widgets using this mechanism. For example
the grid size is store in the main GtkWindow of the application with key {{{hscale}}}.
When it is changed by calling {{{demo_dyn_graph_value_changed}}} the field {{{hscale}}} of
the GtkWindow is updated (See {{{args(3).set_data[hscale=args(2).get_value[]]}}}) and this
values will also be accessible in other handlers since the GtkWindow is added as argument
to all handlers and the GtkWindow arguments are all references to the same real GtkWindow object.
It is then possible to share data between independent functions without using global variables.
Note also that when handlers are connected to a signal, in fact the handler function is
copied. Thus, it is possible to use local functions as handlers.
* The main function
{{{
function demo_dyn_graph()
win = gtkwindow_new()
win.connect["delete_event", demo_delete];
win.set_title["range_controls"];
box1 = gtkvbox_new(homogeneous=%f,spacing=0)
win.add[box1]
box1.show[]
id_win=nsp_graphic_new(win,box1,dim=[300,200]);
//adjustment = GtkAdjustment(0,expand= 0,fill= 101,padding= 0.1, 1, 1)
initial_v=10;
adjustment =gtkadjustment_new(value=initial_v,lower=5,upper=21,step_incr=1,...
page_incr=1,page_size=1)
win.set_data[hscale=initial_v];
scale = gtkhscale_new(adjustment=adjustment)
scale.set_size_request[150,-1]
scale.set_update_policy[GTK.UPDATE_DELAYED];
scale.set_digits[1];
scale.set_draw_value[%t];
box1.pack_start[scale,expand=%f,fill=%f,padding=0]
scale.show[]
adjustment.connect[ "value_changed", demo_dyn_graph_value_changed,...
list(id_win,scale,win)];
box2=gtkvbox_new(homogeneous=%f,spacing=0);
box1.pack_start[box2,expand=%f,fill=%t,padding=0];
box1=box2;
// hbox for radio buttons
// ----------------------
box2 = gtkhbox_new(homogeneous=%f,spacing=0)
box2.set_border_width[10]
box1.pack_start[box2,expand=%f,fill=%f,padding=0];
box2.show[];
// radio buttons
// ----------------------
// The "toggled" signal
button1=gtkradiobutton_new(label="hot")
box2.pack_start[button1]
button1.show[]
// button1 i sthe default selection.
button1.set_active[%t];
win.set_data[colormap_id = 1];
//
button1.connect["toggled",demo_dyn_graph_toggled, list(id_win,button1,1,win)];
//
button=gtkradiobutton_new(group=button1,label= "gray");
box2.pack_start[button];
button.show[];
button.connect[ "toggled",demo_dyn_graph_toggled,
list(id_win,button,2,win)];
//
button=gtkradiobutton_new(group=button1,label= "jet");
box2.pack_start[button];
button.show[];
button.connect[ "toggled",demo_dyn_graph_toggled,
list(id_win,button,3,win)];
separator = gtkhseparator_new ();
box1.pack_start[separator];
separator.show[];
//
button = gtkbutton_new(label="Close")
button.connect["clicked", button_destroy_win,list(win)];
box1.pack_start[button,expand=%f,fill=%f,padding=0]
button.set_flags[GTK.CAN_DEFAULT]
button.grab_default[]
button.show[]
win.show_all[]
demo_dyn_graph_draw(id_win,10,1);
//gtk_main()
endfunction
}}}
* Handler activated when adjustment is moved
{{{
function demo_dyn_graph_value_changed(widget,args)
// args=list(win_id, gtkhscale,win);
args(3).set_data[hscale=args(2).get_value[]];
demo_dyn_graph_draw(args(1),args(2).get_value[],args(3).get_data['colormap_id']);
endfunction
}}}
* Handler activated when a radio button is pressed
{{{
function demo_dyn_graph_toggled(widget,args)
// args(2) is the gtkhscale
if args(2).get_active[]==%t then
args(4).set_data[colormap_id = args(3)];
end
value=args(4).get_data['hscale'];
demo_dyn_graph_draw(args(1),value,args(3));
endfunction
}}}
* Update graphics with new parameters
{{{
function demo_dyn_graph_draw(id,value,colormap_id)
id1=xget('window');
if id1<>id then xset('window',id);end
xclear();
select colormap_id
case 1 then xset('colormap',hotcolormap(64));
case 2 then xset('colormap',graycolormap(64));
case 3 then xset('colormap',jetcolormap(64));
end
t=linspace(-%pi,%pi,value);plot3d1(t,t,sin(t)'*cos(t));
if id1<>id then xset('window',id1);end
endfunction
}}}
* Optimisation, grand systèmes, dynamique, incertitudes
En juillet 2000 fut créée l'équipe Optimisation et Systèmes, sous l'impulsion de Guy Cohen, et rassemblant Pierre Carpentier (ENSTA), ~Jean-Philippe Chancelier et Michel De Lara.
Suite à une longue collaboration avec des entreprises de l'énergie (EDF, GDF) et de l'environnement (VEOLIA, etc.), l'équipe a décidé de se positionner sur une thématique ouverte du point de vue théorique et aux larges possibilités d'application : la gestion des incertitudes dans l'optimisation dynamique de grand systèmes interconnectés.
* Un partenariat scientifique dans la durée avec Electricité de France (EDF D&R)
En dix ans, l'équipe Optimisation et Systèmes a développé un partenariat scientifique approfondi avec EDF, formant des cadres de la direction Etudes et Recherches et élaborant avec eux des méthodes adaptés au management des énergies : coordination d'unités de production sous contrainte de satisfaction d'une demande incertaine, élargissement de la minimisation des coûts de production en moyenne pour inclure les contraintes de risques financiers et physiques, etc. Ces travaux sont valorisés à la fois au sein de l'entreprise et académiquement, par des thèses et des publications.
* Thématiques
Ce travail de dix années -- avec EDF et d'autres (~CNES-Thalès, etc.) -- a fait de l'équipe Optimisation et Systèmes une référence dans les domaines suivants :
**l'optimisation de systèmes, aussi bien l'optimisation statique que la commande optimale de systèmes dynamiques, dans un contexte déterministe comme dans un contexte stochastique,
**la mise au point de méthodes numériques de traitement de ces problèmes, et plus particulièrement les méthodes susceptibles de traiter de grands systèmes,
**l'application de ces techniques
*** à la gestion de grands ensembles industriels et de services (par exemple, les grands réseaux de production, de stockage et de transport d'énergie, les réseaux de transport, etc.),
*** à la modélisation des processus de décision et d'évolution en matière d'environnement, d'écologie, etc.
**la prise en compte et la gestion des contraintes et du risque en environnement incertain (contraintes en probabilité en particulier).
Fin 2010, Guy Cohen a pris sa retraite. Depuis 2011, la palette de compétences s'est élargie en accueillant Frédéric Meunier, spécialiste en optimisation combinatoire.
Les travaux en optimisation combinatoire se situent tant sur le plan appliqué que sur le plan plus théorique. Sur le plan appliqué, les travaux s'inscrivent en recherche opérationnelle, et plus particulièrement dans les transports et la logistique. Les méthodes mises en oeuvre peuvent être des méthodes exactes ou heuristiques selon les contraintes du problème. Des projets communs sont actuellement menés avec des partenaires industriels comme l'hôpital Henri Mondor du ~Val-de-Marne sur des questions de déploiement optimisé des ambulances, ou avec la Société du Taxi Electrique Parisien sur les questions de gestion temps réel de flottes électriques. Sur le plan théorique, les travaux portent sur les objets qui sous-tendent les modélisations des problèmes concrets, comme les graphes, les hypergraphes, ou les algorithmes eux-mêmes.
* Répondre aux nouveaux besoins en optimisation continue et combinatoire
Dans sa nouvelle configuration, l'équipe Optimisation et Systèmes continuera à aborder les problèmes nouveaux et difficiles d'optimisation soulevés par la complexité des systèmes rencontrés dans la gestion de l'énergie, des transports, de l'environnement : la grande taille, les aspects dynamiques, et les incertitudes. L'enjeu est de répondre aux nouveaux besoins en optimisation continue et combinatoire, afin de permettre d'économiser des ressources (financières et matérielles) dans la fourniture de services et de garantir une gestion plus sure et plus efficace, en faisant appel à des outils éprouvés et en développant de nouvelles méthodes.
* Electricité de France R&D [img[t1_logo_edf.png]]
** Département OSIRIS
* Thales Alenia Space -- CNES
** Trajectoires interplanétaires robustes (2007-2010)
* Peugeot (PSA)
* ~GDF-Suez (2002-2003)
** [[Optimisation des grands systèmes|optimisation/ParisIcours-A4-NB.pdf]] (Guy Cohen)
** [[Convexité et optimisation|optimisation/Ponts-cours-A4-NB.pdf]] (Guy Cohen)
** [[Introduction aux techniques d'optimisation|optimisation/Transp-Optimisation-CCETT.pdf]]. Cours au CCETT (Cesson Sévigné). 3-7 avril 1995 (Guy Cohen, ~Jean-Christophe Culioli)
** [[Optimisation et commande optimale déterministes et stochastiques|optimisation/Transp-Optimisation-EDF-93.pdf]]. Grands systèmes et décomposition/coordination. Cours à EDF Clamart. ~Mai-Juin 1993 (Pierre Carpentier, Guy Cohen, ~Jean-Christophe Culioli)
/***
|''Name:''|LegacyStrikeThroughPlugin|
|''Description:''|Support for legacy (pre 2.1) strike through formatting|
|''Version:''|1.0.2|
|''Date:''|Jul 21, 2006|
|''Source:''|http://www.tiddlywiki.com/#LegacyStrikeThroughPlugin|
|''Author:''|MartinBudden (mjbudden (at) gmail (dot) com)|
|''License:''|[[BSD open source license]]|
|''CoreVersion:''|2.1.0|
***/
//{{{
// Ensure that the LegacyStrikeThrough Plugin is only installed once.
if(!version.extensions.LegacyStrikeThroughPlugin) {
version.extensions.LegacyStrikeThroughPlugin = {installed:true};
config.formatters.push(
{
name: "legacyStrikeByChar",
match: "==",
termRegExp: /(==)/mg,
element: "strike",
handler: config.formatterHelpers.createElementAndWikify
});
} //# end of "install only once"
//}}}
[img[images/img-book-new.png][http://www.springer.com/math/cse/book/978-1-4419-5526-5]] [img[images/img-book-chinese.png]] [img[images/img-book-init.png][http://www.springer.com/west/home/computer/mathematics?SGWID=4-151-22-44240839-0&detailsPage=ppmmedia%7CotherBooks&seqNo=1&CIPageCounter=CI_MORE_BOOKS_BY_AUTHOR1]] [img[images/img-book-scicos.png][http://www.springer.com/east/home/generic/search/results?SGWID=5-40109-22-65671832-0&SHORTCUT=www.springer.com/sgw/cda/frontpage/0,11855,5-40109-22-65671832-0,00.html]] [img[images/img-book-birk.png][http://www.lavoisier.fr/notice/gbJLO6OOKNXLSRSO.html]]
* People
** [[Present|Present]]
** [[Students|Students]]
** [[Past members|PastMembers]]
** [[History|History]]
* [[Research|ResearchAreas]]
* Teaching
** [[Master level courses|MasterLevel]]
** [[Lecture notes|LectureNotes]]
* Publications
** [[Books|Books]]
** [[Hal|Hal]]
* [[Collaborations|IC]]
** [[Industrial|IndustriaL]]
** [[Public|PubliC]]
* Site Map
<<dropMenu>>
/% %/
* Ecole des Ponts ~ParisTech
** Optimisation et contrôle
** Modéliser l'aléa
** [[Modélisation pour la gestion durable des ressources naturelles|http://cermics.enpc.fr/~delara/ENSEIGNEMENT/MGDRN_ENPC/MGDRN_ENPC.html]]
** [[Économie du risque, effet de serre et biodiversité|http://cermics.enpc.fr/~delara/ENSEIGNEMENT/EREB_ENPC/EREB_ENPC.html]]
* ENSTA ~ParisTech
** [[Optimisation des grands systèmes|http://wwwdfr.ensta.fr/Module/?usebdd=Mod3A&sigle=A08]]
* MMMEF, Master Mathématiques, Informatique et Applications, mention Mathématiques Appliquées à l'Economie et à la Finance
** [[Méthodes numériques en optimisation stochastique|http://www.ensta-paristech.fr/~pcarpent/MNOS]]
** Contrôle stochastique
** [[Modèles mathématiques pour la gestion durable des ressources naturelles|http://cermics.enpc.fr/~delara/ENSEIGNEMENT/Master_EDDEE/Master_EDDEE.html]]
* Master OJME
* Master MPRO
* Master EDDEE, Economie du Développement Durable, de l'Environnement et de l'Energie
**[[Modélisation pour la gestion durable des ressources naturelles|http://cermics.enpc.fr/~delara/ENSEIGNEMENT/MGDRN_MMMEF/MGDRN_MMMEF.html]]
* Master REST, Renewable Energy Science and Technology Master ~ParisTech
** [[Network Optimization|http://cermics.enpc.fr/~delara/ENSEIGNEMENT/M2REST/M2REST.html]]
and also Ecole des Mines, ENSTA, Polytechnique
[[Nsp Home Page|nsp-tiddly/mine.html]]
<<tabs txtPluginsTa
'Linux' "Linux snapshot" GalleryImg7
'Windows' "Windows snapshot" GalleryImg6
>>
[[Vallée d'Ossau|http://fr.wikipedia.org/wiki/Ossau]]
*[[Laetitia ANDRIEU (EDF)|/home/homes/Andrieu.html]] former ~PhD student, researcher EDF
*[[Kengy BARTY (EDF)|http://cermics.enpc.fr/~barty]] former ~PhD student, researcher EDF
*[[Guy COHEN|/home/homes/Cohen.html]] retired
*[[Anes DALLAGI (EDF)|/home/homes/Dallagi.html]] former ~PhD student, researcher EDF
*[[Laurent GILOTTE (EDF)|http://www.centre-cired.fr/perso/gilotte/]] former ~PhD student, researcher EDF
*[[Pierre GIRARDEAU|/Home/homes/Girardeau.html]] former ~PhD student, Post doctoral position
* Thérèse GUILBAUD former post doctarate student,
*[[Eugénie LIORIS|/home/homes/Lioris.html]] former ~PhD student
*[[Jean Francois POMMARET|/home/homes/Pommaret.html]] retired
*[[Babacar SECK|/home/homes/Seck.html]] former ~PhD student,
*[[Cyrille STRUGAREK|/home/homes/Strugare.html]] former ~PhD student, ~Munich-Ré
Quelques photos sur Flickr. Cliquer sur mon Flickr badge !
<html>
<a href="http://www.flickr.com" style="text-align:center;">www.<strong style="color:#3993ff">flick<span style="color:#ff1c92">r</span></strong>.com</a><br>
<iframe style="background-color:#ffffff; border-color:#ffffff; border:none;" width="113" height="151" frameborder="0" scrolling="no" src="http://www.flickr.com/apps/badge/badge_iframe.gne?zg_bg_color=ffffff&zg_person_id=29694351@N00" title="Flickr Badge"></iframe>
</html>
* P. Carpentier, J.-P. Chancelier, G. Cohen, M. De Lara, P. Girardeau. Dynamic consistency for Stochastic Optimal Control problems. [[Preprint Cermic 13 pages, may 2010 (439)|http://cermics.enpc.fr/reports]].
* J.-P. Chancelier, J. Lelong and B. Lapeyre. Using Premia and Nsp for Constructing a Risk Management Benchmark for Testing Parallel Architecture. [[Preprint Cermics 16 pages, 2010 (434)|http://cermics.enpc.fr/reports]].
* J.-P. Chancelier. A note on strong convergence to common fixed points of nonexpansive mappings in Hilbert spaces, [[Preprint Cermics 11 pages, 2007 (426)|http://cermics.enpc.fr/reports]].
* J.-P. Chancelier. T-class algorithms for pseudocontractions and k-strict pseudocontractions in Hilbert spaces, [[Preprint Cermics 11 pages, 2007 (369)|http://cermics.enpc.fr/reports]].
** Accepted in Nonlinear Analysis: Theory, Methods & Applications, [[doi:10.1016/j.na.2009.04.049|http://dx.doi.org/10.1016/j.na.2009.04.049]].
* J.-P. Chancelier. Iterative schemes for computing fixed points of nonexpansive mappings in banach spaces, [[Preprint Cermics 18 pages, 2007 (367)|http://cermics.enpc.fr/reports]].
** Accepted in Journal of Mathematical Analysis and Applications Volume 353, Issue 1, 1 May 2009, Pages 141-153 [[10.1016/j.jmaa.2008.11.041|http://dx.doi.org/10.1016/j.jmaa.2008.11.041]].
* P. Carpentier, J.-P Chancelier, M. De Lara, and SOWG. Approximations of stochastic optimization problems subject to measurability constraints. [[Preprint Cermics 2006|http://cermics.enpc.fr/reports]].
** Accepted in SIAM J. Optim. Volume 19, Issue 4, pp. 1719-1734 (2009) [[10.1137/070692376|http://dx.doi.org/10.1137/070692376]].
* J.-P. Chancelier and SOWG. Mosco-convergence of stochastic optimization problems involving both random variables and measurability constraints approximations. [[Preprint Cermics 2006|http://cermics.enpc.fr/reports]]
* J.-P. Chancelier, M. De Lara, and A. De Palma. Risk aversion and optimal strategies in a one-armed bandit problem: an application to road choice. [[Preprints Cermics 30 pages 2005|http://cermics.enpc.fr/reports/CERMICS-2005/CERMICS-2005-280.pdf]].
** Published in Transportation Science [[10.1287/trsc.1060.0179|http://dx.doi.org/10.1287/trsc.1060.0179]].
* J.P. Chancelier, M. Messaoud, and A. Sulem. A policy iteration algorithm for fixed point problems with nonexpansive operators. [[Preprints Cermics 2004|http://cermics.enpc.fr/reports/CERMICS-2004/CERMICS-2004-264.pdf]].
** Published in Math. Meth. Oper. Res. 2007. [[10.1007/s00186-006-0103-3|http://dx.doi.org/10.1007/s00186-006-0103-3]].
* K. Barty, P. Carpentier, J.-P. Chancelier, G. Cohen, M. De Lara, and T. Guilbaud. Dual effect free stochastic controls. http://www.speps.info/ and [[Preprints Cermics 26 pages, Mars 2003|http://cermics.enpc.fr/reports/CERMICS-2003/CERMICS-2003-242.pdf]].
** Published in Annals of Operation Research, 2004, [[10.1007/s10479-006-6160-4|http://dx.doi.org/10.1007/s10479-006-6160-4].
*[[Pierre CARPENTIER (ENSTA)|http://www.ensta.fr/~pcarpent]] Part time external researcher
*[[Jean Philippe CHANCELIER|/home/homes/Chancelier.html]] Researcher
*[[Michel DE LARA|/home/homes/De_Lara.html]] Researcher
*[[Frédéric MEUNIER|/home/homes/Meunier.html]] Researcher
* Pôle de compétitivité System@tic
** Projet P (projet FUI, 2010-2013)
* Pôle de compétitivité Advancity
* Pôle de compétitivité Moveo
* ACI CNRS
* Région ~Île-de-France
** ~R2DS
** international
<<tabs txtPluginsTa
'Livres' "Livres" Livres
'Preprints' "Preprints" Preprints
'Articles' "Articles" Articles
'Communications' "Communications" Communications
>>
* Methods
** Stochatic optimal control (discrete-time)
*** Large-scale systems
*** Discretization and numerical methods
*** Probability constraints
** Discrete mathematics; combinatorial optimization
** System control theory with state constraints
*** Viability and stochastic viability
** Numerical methods for fixed points computation
** Uncertainty and learning in economics
* Applications
** Energy management under uncertainty
*** Production scheduling
*** Power grid operations
*** Risk management
** Transport modelling and management
** Natural resources management (fisheries, mining, epidemiology)
* Softwares
** Scicoslab, NSP
** Oadlibsim
Rpms that can be used in conjunction with associated scilab or nsp contribs.
* [[Glpk 4.10 |rpms/glpk-4.10-2.src.rpm]]. A src rpm based on {{{glpk-4.10}}} patched with configure,libtool, ... in order to build shared libraries
* [[Glpk 4.9|rpms/glpk-4.9-0.src.rpm]]. A src rpm based on {{{glpk-4.8}}} patched with configure,libtool, ... in order to build shared libraries
* [[Lpsolve 5.5|rpms/lp_solve-5.5-0.src.rpm]]. A src rpm based on {{{lp_solve 5.5}} patched to add Makefiles,configure,libtool in order to
build shared libraries and configure.
* [[ScicosLab Home Page|scilab-gtk-tiddly/mine.html]]. ~ScicosLab is the new name of ~ScilabGtk.
* [[http://www.scilabgtk.org|http://www.scilabgtk.org]]
* [[Code examples|code-book/index.html]] from the book: [[Modeling and Simulation in Scilab/Scicos|http://www.scicos.org/book.html]]
* [[Scilab cvs and toolboxes binaries|scilab/scilab.htm]]
* [[Scilab at Enpc|http://cermics.enpc.fr/scilab]]
* [[Journée Scilab 15 Octobre 2003|http://cermics.enpc.fr/scilab/journee-scilab]]
/***
|Name|SinglePageModePlugin|
|Source|http://www.TiddlyTools.com/#SinglePageModePlugin|
|Documentation|http://www.TiddlyTools.com/#SinglePageModePluginInfo|
|Version|2.9.7|
|Author|Eric Shulman|
|License|http://www.TiddlyTools.com/#LegalStatements|
|~CoreVersion|2.1|
|Type|plugin|
|Description|Show tiddlers one at a time with automatic permalink, or always open tiddlers at top/bottom of page.|
This plugin allows you to configure TiddlyWiki to navigate more like a traditional multipage web site with only one tiddler displayed at a time.
!!!!!Documentation
>see [[SinglePageModePluginInfo]]
!!!!!Configuration
<<<
<<option chkSinglePageMode>> Display one tiddler at a time
><<option chkSinglePagePermalink>> Automatically permalink current tiddler
><<option chkSinglePageKeepFoldedTiddlers>> Don't close tiddlers that are folded
><<option chkSinglePageKeepEditedTiddlers>> Don't close tiddlers that are being edited
<<option chkTopOfPageMode>> Open tiddlers at the top of the page
<<option chkBottomOfPageMode>> Open tiddlers at the bottom of the page
<<option chkSinglePageAutoScroll>> Automatically scroll tiddler into view (if needed)
Notes:
* The "display one tiddler at a time" option can also be //temporarily// set/reset by including a 'paramifier' in the document URL: {{{#SPM:true}}} or {{{#SPM:false}}}.
* If more than one display mode is selected, 'one at a time' display takes precedence over both 'top' and 'bottom' settings, and if 'one at a time' setting is not used, 'top of page' takes precedence over 'bottom of page'.
* When using Apple's Safari browser, automatically setting the permalink causes an error and is disabled.
<<<
!!!!!Revisions
<<<
2010.11.30 2.9.7 use story.getTiddler()
2008.10.17 2.9.6 changed chkSinglePageAutoScroll default to false
| Please see [[SinglePageModePluginInfo]] for previous revision details |
2005.08.15 1.0.0 Initial Release. Support for BACK/FORWARD buttons adapted from code developed by Clint Checketts.
<<<
!!!!!Code
***/
//{{{
version.extensions.SinglePageModePlugin= {major: 2, minor: 9, revision: 7, date: new Date(2010,11,30)};
//}}}
//{{{
config.paramifiers.SPM = { onstart: function(v) {
config.options.chkSinglePageMode=eval(v);
if (config.options.chkSinglePageMode && config.options.chkSinglePagePermalink && !config.browser.isSafari) {
config.lastURL = window.location.hash;
if (!config.SPMTimer) config.SPMTimer=window.setInterval(function() {checkLastURL();},1000);
}
} };
//}}}
//{{{
if (config.options.chkSinglePageMode==undefined)
config.options.chkSinglePageMode=false;
if (config.options.chkSinglePagePermalink==undefined)
config.options.chkSinglePagePermalink=true;
if (config.options.chkSinglePageKeepFoldedTiddlers==undefined)
config.options.chkSinglePageKeepFoldedTiddlers=false;
if (config.options.chkSinglePageKeepEditedTiddlers==undefined)
config.options.chkSinglePageKeepEditedTiddlers=false;
if (config.options.chkTopOfPageMode==undefined)
config.options.chkTopOfPageMode=false;
if (config.options.chkBottomOfPageMode==undefined)
config.options.chkBottomOfPageMode=false;
if (config.options.chkSinglePageAutoScroll==undefined)
config.options.chkSinglePageAutoScroll=false;
//}}}
//{{{
config.SPMTimer = 0;
config.lastURL = window.location.hash;
function checkLastURL()
{
if (!config.options.chkSinglePageMode)
{ window.clearInterval(config.SPMTimer); config.SPMTimer=0; return; }
if (config.lastURL == window.location.hash) return; // no change in hash
var tids=decodeURIComponent(window.location.hash.substr(1)).readBracketedList();
if (tids.length==1) // permalink (single tiddler in URL)
story.displayTiddler(null,tids[0]);
else { // restore permaview or default view
config.lastURL = window.location.hash;
if (!tids.length) tids=store.getTiddlerText("DefaultTiddlers").readBracketedList();
story.closeAllTiddlers();
story.displayTiddlers(null,tids);
}
}
if (Story.prototype.SPM_coreDisplayTiddler==undefined)
Story.prototype.SPM_coreDisplayTiddler=Story.prototype.displayTiddler;
Story.prototype.displayTiddler = function(srcElement,tiddler,template,animate,slowly)
{
var title=(tiddler instanceof Tiddler)?tiddler.title:tiddler;
var tiddlerElem=story.getTiddler(title); // ==null unless tiddler is already displayed
var opt=config.options;
var single=opt.chkSinglePageMode && !startingUp;
var top=opt.chkTopOfPageMode && !startingUp;
var bottom=opt.chkBottomOfPageMode && !startingUp;
if (single) {
story.forEachTiddler(function(tid,elem) {
// skip current tiddler and, optionally, tiddlers that are folded.
if ( tid==title
|| (opt.chkSinglePageKeepFoldedTiddlers && elem.getAttribute("folded")=="true"))
return;
// if a tiddler is being edited, ask before closing
if (elem.getAttribute("dirty")=="true") {
if (opt.chkSinglePageKeepEditedTiddlers) return;
// if tiddler to be displayed is already shown, then leave active tiddler editor as is
// (occurs when switching between view and edit modes)
if (tiddlerElem) return;
// otherwise, ask for permission
var msg="'"+tid+"' is currently being edited.\n\n";
msg+="Press OK to save and close this tiddler\nor press Cancel to leave it opened";
if (!confirm(msg)) return; else story.saveTiddler(tid);
}
story.closeTiddler(tid);
});
}
else if (top)
arguments[0]=null;
else if (bottom)
arguments[0]="bottom";
if (single && opt.chkSinglePagePermalink && !config.browser.isSafari) {
window.location.hash = encodeURIComponent(String.encodeTiddlyLink(title));
config.lastURL = window.location.hash;
document.title = wikifyPlain("SiteTitle") + " - " + title;
if (!config.SPMTimer) config.SPMTimer=window.setInterval(function() {checkLastURL();},1000);
}
if (tiddlerElem && tiddlerElem.getAttribute("dirty")=="true") { // editing... move tiddler without re-rendering
var isTopTiddler=(tiddlerElem.previousSibling==null);
if (!isTopTiddler && (single || top))
tiddlerElem.parentNode.insertBefore(tiddlerElem,tiddlerElem.parentNode.firstChild);
else if (bottom)
tiddlerElem.parentNode.insertBefore(tiddlerElem,null);
else this.SPM_coreDisplayTiddler.apply(this,arguments); // let CORE render tiddler
} else
this.SPM_coreDisplayTiddler.apply(this,arguments); // let CORE render tiddler
var tiddlerElem=story.getTiddler(title);
if (tiddlerElem&&opt.chkSinglePageAutoScroll) {
// scroll to top of page or top of tiddler
var isTopTiddler=(tiddlerElem.previousSibling==null);
var yPos=isTopTiddler?0:ensureVisible(tiddlerElem);
// if animating, defer scroll until after animation completes
var delay=opt.chkAnimate?config.animDuration+10:0;
setTimeout("window.scrollTo(0,"+yPos+")",delay);
}
}
if (Story.prototype.SPM_coreDisplayTiddlers==undefined)
Story.prototype.SPM_coreDisplayTiddlers=Story.prototype.displayTiddlers;
Story.prototype.displayTiddlers = function() {
// suspend single/top/bottom modes when showing multiple tiddlers
var opt=config.options;
var saveSPM=opt.chkSinglePageMode; opt.chkSinglePageMode=false;
var saveTPM=opt.chkTopOfPageMode; opt.chkTopOfPageMode=false;
var saveBPM=opt.chkBottomOfPageMode; opt.chkBottomOfPageMode=false;
this.SPM_coreDisplayTiddlers.apply(this,arguments);
opt.chkBottomOfPageMode=saveBPM;
opt.chkTopOfPageMode=saveTPM;
opt.chkSinglePageMode=saveSPM;
}
//}}}
* Beaufortin (2008)
** Roche Parsite 2106, départ de boudin 1306 par le col du pré (1703).
** Roche pourrie 1750, départ de Molliessoulaz 1026.
** Col de la roche plane (2094) départ de la frasse (1027).
* Belledone (2009)
** Belle étoile (2718), départ du pleyner 1558.
** Col du Mouchillon (2516), par les 7 laux, départ de la martinette 1074
** Col du Gleyzin (2565), départ le plan (1221).
* Oisan (2009)
** col perdu
** crête de la Seyte par le vallon du fournel.
* Les clefs (2010)
** [[Pointe de la Québlette par le Sapey|http://www.skitour.fr/sorties/pointe-de-la-queblette,24680.html#sortie]].
** [[Dôme de Pouilly|http://www.skitour.fr/sorties/dome-de-pouilly,24687.html#sortie]]
* Beaufortin (2010)
** Roche Parsite 2106, départ après boudin 1500 par le col du pré (1703). Arrêt à 100 m sous le sommet les conditions étant trop mauvaise, avalanche visible etc...
** Cote 2000 sur la legete du Mirantin. Conditions avanlancheuse, nous ne prenons pas le risque d'aller au dela. Le lendemain nous faisons du ski de piste ... ski de rando fortement déconseillé !
* Les clefs (2011)
** Pointe de Mandallaz (1100 m de d.). J'ai perdu un ski à la descente, après une heure de recherche on est rentré et revenu le lendemain .... le ski était planté dans la neige à 30 mètres en deça de la zone que nous avions retournée (pelle sonde etc...). Bref tout content de retrouver mon Movement shaman, cela fini par un pot au champagne !
/***
|''Name:''|SparklinePlugin|
|''Description:''|Sparklines macro|
***/
//{{{
if(!version.extensions.SparklinePlugin) {
version.extensions.SparklinePlugin = {installed:true};
//--
//-- Sparklines
//--
config.macros.sparkline = {};
config.macros.sparkline.handler = function(place,macroName,params)
{
var data = [];
var min = 0;
var max = 0;
var v;
for(var t=0; t<params.length; t++) {
v = parseInt(params[t]);
if(v < min)
min = v;
if(v > max)
max = v;
data.push(v);
}
if(data.length < 1)
return;
var box = createTiddlyElement(place,"span",null,"sparkline",String.fromCharCode(160));
box.title = data.join(",");
var w = box.offsetWidth;
var h = box.offsetHeight;
box.style.paddingRight = (data.length * 2 - w) + "px";
box.style.position = "relative";
for(var d=0; d<data.length; d++) {
var tick = document.createElement("img");
tick.border = 0;
tick.className = "sparktick";
tick.style.position = "absolute";
tick.src = "data:image/gif,GIF89a%01%00%01%00%91%FF%00%FF%FF%FF%00%00%00%C0%C0%C0%00%00%00!%F9%04%01%00%00%02%00%2C%00%00%00%00%01%00%01%00%40%02%02T%01%00%3B";
tick.style.left = d*2 + "px";
tick.style.width = "2px";
v = Math.floor(((data[d] - min)/(max-min)) * h);
tick.style.top = (h-v) + "px";
tick.style.height = v + "px";
box.appendChild(tick);
}
};
}
//}}}
*[[Vincent LECLERE|/home/homes/Leclere.html]]
*[[Jean-Christophe ALAIS|/home/homes/Alais.html]]
*[[Daniel CHEMLA|/home/homes/Chemla.html]]
*[[Djamal MOHIA|/home/homes/Mohia.html]]
/*{{{*/
/* LAYOUT STYLES */
ul.suckerfish, ul.suckerfish ul {margin: 0;padding: 0;list-style: none;line-height:1.4em;z-index:100;}
ul.suckerfish li {display: inline-block;display: block;float: left;background:none;padding:0;}
ul.suckerfish li ul {position: absolute;left: -999em;border:1px solid [[ColorPalette::TertiaryLight]];min-width:10em;background:[[ColorPalette::TertiaryPale]];}
ul.suckerfish li:hover ul {left: auto;}
ul.suckerfish ul li {float:none;line-height:1em;}
ul.suckerfish a, ul.suckerfish a:hover {display: block;}
ul.suckerfish li a {font-weight:bold;padding:0.3em;}
/* COLORS AND APPEARANCE */
ul.suckerfish li a {border-bottom: 0;font-weight:bold;}
ul.suckerfish li:hover a {}
ul.suckerfish li:hover ul a {font-weight:normal;padding:0.3em;}
ul.suckerfish li ul li:hover a{}
ul.suckerfish ul li a:hover {}
ul.suckerfish ul li a, ul.suckerfish ul li a:hover{display:inline-block;width:10em;}
ul.suckerfish li {}
ul.suckerfish {}
/*}}}*/
Type the text for 'New Tiddler'
Out of the box, TiddlyWiki offers:
* Works with all major desktop [[browsers]] on Windows, Macintosh and Linux and many mobile browsers such as the Apple iPhone and the Nokia 770/N800
** You can SaveChanges with FireFox, [[Opera]], InternetExplorer for Windows, [[Safari]], and [[Camino]]
* The BackstageArea for handy access to authoring tools including [[importing|ImportTiddlers]] and [[synchronisation|http://www.tiddlywiki.org/wiki/Dev:Server_Adaptor_Mechanism]] of tiddlers with external files and servers
* Full text formatting including MonospacedText, ExtendedFormatting, NonWikiWordLinks, WikiWordEscape, PrettyLinks, SubHeadings, BulletPoints, NumberedBulletPoints, [[Tables]], BlockQuotes, HorizontalRules and the ability to use a CustomCssClass and InlineHTML
* [img[tumbi.png][EmbeddedImages]]...EmbeddedImages
* [[Macros]] providing rich interactive features, including [[Sparklines]] and [[Gradients|GradientMacro]]
* InterfaceOptions and AdvancedOptions, including the ability to GenerateAnRssFeed, SaveBackups and AutoSave
* KeyboardShortcuts so you can finish editing a tiddler with Control-Enter or abandon it with Escape
* Extensive StartupParameters to control the behaviour of TiddlyWiki through specially crafted URLs
* There are [[translations]] of TiddlyWiki available in many languages, including [[Chinese]], [[French]], [[German]], [[Spanish]], [[Portuguese]]
The [[Community]] around TiddlyWiki has extended this basic functionality with a wide range of [[Plugins]] and TiddlyWikiAdaptations.
Tumbi is the name for [[bee|http://en.wikipedia.org/wiki/Bee]] in [[Kannada|http://en.wikipedia.org/wiki/Kannada_language]]. A nice [[tumbi picture|http://www.flickr.com/photos/14516334@N00/345009210]] can be found on [[Flickr|http://www.flickr.com]].
Created in July 2000, the Optimization and Systems Group is a component of CERMICS, the research laboratory in applied mathematics at Ecole des Ponts ~ParisTech. The main research topics of OSG is optimization, mainly discrete and stochastic. The focus is both on theory and on numerical methods. The main applications are in the energy field, and also in transport and natural resources management. The OSG is involved in education at the master level.
This cross-compiler was build on Lucid Lynx 32 bits. In order to use it it should
be untared in /usr/local and a link from /usr/local/mingw32 to /usr/local/mingw32-gcc4.4.3 added.
The script withmingw can be used to set up pathes and env vars to use the cross-compiler.
* [[mingw32-gcc4.4.3.tgz|mingw32-gcc4.4.3.tgz]]
* [[withmingw|withmingw.bash]]