Report about the D4D datathon challenge
by Serge Stinckwich
Dear all,
this is a small report about the RESILIENCE team using Pharo&Roassal
for the D4D datathon challenge: http://www.d4d.orange.com/en/home
The idea was to use mobile network data from Senegal provided by
Orange company in order to solve some development problems.
The amount of data provided by Orange was really huge, something like
66 Gb: we have the number and the durations of calls between each pairs of GSM
antennas in Senegal (1666 different antennas) and also some
information about the mobility of people. You can find more
information about the data here:
http://arxiv.org/abs/1407.4885
We try to extract some data from August 2013, because we know that
some floods occurs at that time in Dakar. Our main objective was to to
be able to visualise mobility and communications patterns with ROASSAL
to see if there is any differences before and after the floods.
We had a lot of problems to solve in a short period of time :-)
At the beginning, we couldn't open huge files with Pharo. Only open a
file that is around 3.4Go is impossible. Pharo says that the file does
not exist.
Thierry tells us that us that one must compile the VM with
-D_FILE_OFFSET_BITS=64. (the Cog VMs are also built with
-D_GNU_SOURCE).
Why this is not done by default ?
After that we decide to split the files in many smaller files and we
try to use a mySQL database and various other tools but still have
many troubles because of the size of the data ... At the end, we have
done some visualisations but only on a tiny portion of the data on one
day (one day is around 100Mb of data). You could find some
visualisations done by our team here:
https://twitter.com/sergestinckwich/status/586178094215606273
Managing huge amount in Pharo and also ROASSAL is still a challenge
and we definitively need more tools in this area.
We had some problems with ROASSAL: bugs with RTEdgesBuilder (Alvaro
can you send a report to Alex about that ?), to much time to process
some viz, ...
At the end, our team receive the honorary price:
https://twitter.com/sergestinckwich/status/585866625745887232
This is a brief description of our project.
=========================================================
Project name: RESILIENCE
Team members: Clémence Douard (ENSCI), Onil Goubier (CIRELA), Alvaro
Peralta (LabU / Chile University), Aurélie Thouron (ENSCI), Serge Stinckwich
(IRD / UMMISCO)
The main concern of this project is to improve resilience after an
environmental crisis in a southern city. During the preparedness phase
before crisis, records of inhabitants habits (like patterns of
mobility or communications) are done in order to characterize the
situation before the crisis. Assessments of the improvements will then
be done by providing suitable visualizations of the resilience
dynamic. The goal is to help citizens to represent these improvements
and to take advantage of them in their daily lives.
We took as an example the city of Dakar during the flooding that
occurred in August 2013.
The data used are those of the dataset 1 (communication between
antennas) and 2 (user mobility) provided Orange. We use this
information, coupled to OSM, and other data related to floods of
August in Dakar to construct maps and indicators to show resilience.
Visualizations are made with agile visualization platform Roassal:
http://agilevisualization.com/
=========================================================
I would like to thank all the team members and also the people who
help us remotely: Alexandre Bergel (ObjectProfile/Chile University)
and Thierry Goubier (CEA)
I would like to thank also the SIMPLON team and ORANGE for organizing
such a nice event.
Regards,
--
Serge Stinckwich
UCBN & UMI UMMISCO 209 (IRD/UPMC)
Every DSL ends up being Smalltalk
http://www.doesnotunderstand.org/
8 years, 7 months
new graph algorithms
by Christophe Demarey
Hi,
A few days ago, I added new graph algorithms into MooseAlgos but I did not communicate about that.
I added 2 complementary algorithms:
- MalGraphReducer : it takes as input a graph and ouputs a graph without circuits. Nodes forming a circuit (or cycle if you prefer) are merged into a single node. A merge node has a reference to merged nodes. It uses the MalTarjan algorithm.
- MalTopologicalSorting : the well known graph sorting algorithm that can only be applied on graphs without circuits (cycles).
the latter could be useful for some layouting strategies of graphs for example.
Regards,
Christophe.
8 years, 7 months
text highlighting and selection?
by Alexandre Bergel
Hi!
Apparently something has change recently with selection and text highlight. When I select a portion of text, the highlight goes away in the selected portion. This is a regression apparently.
No idea whether this is on moose or on pharo.
Cheers,
Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
8 years, 7 months
animated scaling
by Alexandre Bergel
Hi!
Here is a small animated scale I did for the datathlon team. Some may find it interesting.
-=-=-=-=-=-=-=-=-=-=-=-=
v := RTView new.
v @ RTDraggableView.
"Linear per default"
scale := [ :x | x ].
width := 200.
doLayout := [
RTHorizontalLineLayout new gapSize: 0; on: dots.
RTMetricNormalizer new
elements: dots;
fastSmoothTranslation;
normalizeY: #numberOfMethods min: 0 max: width negated using: scale.
v signalUpdate ].
v addMenu: 'linear' callback: [ scale := [ :x | x ]. doLayout value ].
v addMenu: 'log' callback: [ scale := [ :x | (x + 1) log ] . doLayout value ].
v addMenu: 'square root' callback: [ scale := [ :x | x sqrt ] . doLayout value ].
values := RTObject withAllSubclasses.
dots := (RTEllipse new color: (Color blue alpha: 0.5)) elementsOn: values.
v addAll: dots.
doLayout value.
v
-=-=-=-=-=-=-=-=-=-=-=-=
Cheers,
Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
8 years, 7 months
CFP IWST 2015 - Deadline extension - 17th April
by jannik laval
Please note that the deadline has been extended to the 17th April 2015 .
[Please accept our apologies if you receive multiple copies of this call]
[Please send to interested colleagues / mailing-lists]
************************************************************************************************************
CALL FOR PAPERS
IWST15 — International Workshop on Smalltalk Technologies
Brescia, Italy; July 15, 2015
http://www.esug.org/wiki/pier/Conferences/2015/International-Workshop-IWS...
************************************************************************************************************
-------------------
Goals and scopes
-------------------
The goals of the workshop is to create a forum around advances or
experience in Smalltalk and to trigger discussions and exchanges of ideas.
The topics of your paper can be on all aspect of Smalltalk, theoretical as
well as practical. Participants are invited to submit research articles or
industrial papers. This year we want to open two different tracks: one
research track and one industrial track with less scientific constraints.
We expect papers of three kinds:
Short position papers describing emerging ideas
Long research papers with deeper description of experiments and of research
results.
Industrial papers with presentation of real and innovative Smalltalk
applications; this kind of paper should enlighten why Smalltalk is really
appropriate for your application.
We will not enforce any length restriction.
--------------------
Important Dates
--------------------
*Submission deadline: April 17th, 2015*
Notification deadline: May 20th, 2015
Workshop : July 15th, 2015
All accepted papers will be published in ACM DL
-------------------
Topics
-------------------
We welcome contributions on all aspects, theoretical as well as practical,
of Smalltalk related topics such as:
-Aspect-oriented programming,
-Design patterns,
-Experience reports,
-Frameworks,
-Implementation, new dialects or languages implemented in Smalltalk,
-Interaction with other languages,
-Meta-programming and Meta-modeling,
-Tools
-------------------
Best Paper Award
-------------------
To encourage the submission of high-quality papers, the IWST organizing
committee is very proud to announce a Best Paper Award for this edition of
IWST.
We thank the Lam Research Corporation for its financial contribution which
makes it possible for prizes for the three best papers: 1000 USD for first
place, 600 USD for second place and 400 USD for third place.
The ranking will be decided by the program committee during the review
process. The awards will be given during the ESUG conference social event.
The Best Paper Award will take place only with a minimum of six
submissions. Notice also that to be eligible, a paper must be presented at
the workshop by one of the author and that the presenting author must be
registered at the ESUG conference.
-------------------
Publication
-------------------
Both submissions and final papers must be prepared using the ACM SIGPLAN 10
point format. Templates for Word and LaTeX are available at
http://www.acm.org/sigs/sigplan/authorInformation.htm. This site also
contains links to useful informations on how to write effective submissions.
-------------------
Submission
-------------------
All submissions must be sent via easychair:
https://easychair.org/conferences/?conf=iwst2015
-------------------
Program chairs
-------------------
Anne Etien (Université de Lille 1, France)
Jannik Laval (Ecole des Mines de Douai, France)
--
~~Jannik Laval~~
École des Mines de Douai
Enseignant-chercheur
http://www.jannik-laval.eu
http://www.phratch.com
http://www.approchealpes.info
http://car.mines-douai.fr/
8 years, 7 months
MNU: GTPlayBook class>>customDirectory
by Alexandre Bergel
Hi!
I have just downloaded the last moose and I got an error when I open it. With the “load startup preferences” progress bar interrupted.
This may be related to the Spotter tracker?
Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
8 years, 7 months
Dynamic grapher
by Alexandre Bergel
Hi!
Several times we heard about the need to modify graphs on the fly. Johan is pushing in that direction. It would be good to hear about the community requirements.
Here is a starting point:
RTDynamicGrapher new example02
Cheers,
Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
8 years, 7 months
Force based layout progress bar
by Natalia Tymchuk
Hello.
As we all know Force based layout is quite slow. For example if I use it for more that 200 points it takes ages and during that time I’m not even sure if it works or no.
So I wonder maybe it will be better to draw progress bar during the time it works?
Thanks.
Best regards,
Natalia
8 years, 8 months
Composing graphs
by Alexandre Bergel
Hi!
Here is a small script I have written for a robotic application. You can use RTComposer to put several graphs next to each other. There is nothing new in that respect, but it is worth illustrating it once in a while...
Here is an example:
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
force := { {'x' . 3 }. { 'y' . 4 } . { 'z' . 5 } }.
torque := { {'x' . 5 }. { 'y' . -10 } . { 'z' . 8 } }.
composer := RTComposer new.
"-------------"
"Force"
b := RTGrapher new.
b view: composer view.
ds := RTStackedDataSet new.
ds points: force.
ds y: #second.
ds barShape width: 30.
ds histogramWithBarTitle: #first rotation: 0.
b add: ds.
b axisX noLabel; noTick.
b build.
composer group: #force.
"-------------"
"Torque"
b := RTGrapher new.
b view: composer view.
ds := RTStackedDataSet new.
ds points: torque.
ds y: #second.
ds barShape width: 30.
ds histogramWithBarTitle: #first rotation: 0.
b add: ds.
b axisX noLabel; noTick.
b build.
composer group: #torque.
"-------------"
"Doing the layout of the graphs"
composer move: #force onTheLeftOf: #torque.
composer nameGroup: #force as: 'Force'.
composer nameGroup: #torque as: 'Torque'.
composer setGeneralTitle: 'Wrench'.
composer view.
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
You obtain:
You need to update Roassal for this last example (I have added #setGeneralTitle:).
Cheers,
Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
8 years, 8 months
