Greetings Colleagues,
We are happy to announce that our paper, Finite Automata Theory Based Optimization of Conditional Variable Binding,
has been accepted to the 2019 European Lisp Symposium, to be held in Genova Italy in April.
Authors Jim Newton and Didier Verna
The paper can be found here https://www.lrde.epita.fr/dload/papers/newton.19.els.pdf <https://www.lrde.epita.fr/dload/papers/newton.19.els.pdf>
And the abstract is as follows:
We present an efficient and highly optimized
implementation of destructuring-case in Common Lisp. This
macro allows the selection of the most appropriate
destructuring lambda list of several given based on
structure and types of data at run-time and thereafter
dispatches to the corresponding code branch. We examine an
optimization technique, based on finite automata theory
applied to conditional variable binding and execution, and
type-based pattern matching on Common Lisp sequences. A
risk of inefficiency associated with a naive implementation
of destructuring-case is that the candidate expression
being examined may be traversed multiple times, once for
each clause whose format fails to match, and finally once
for the successful match. We have implemented
destructuring-case in such a way to avoid multiple
traversals of the candidate expression. This article
explains how this optimization has been implemented.
Happy reading
Jim
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 6 mars 2019 (11h -- 12h), Amphi 401.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2019-03-06
[4] http://www.lrde.epita.fr/wiki/Contact
Au programme du Mercredi 6 mars 2019 :
* 11h -- 12h:
Restauration de la vision grâce aux implants rétiniens
-- Vincent Bismuth (GEHC)
Rendre la vue à ceux qui l’ont perdue a longtemps été considéré comme un
sujet réservé à la science-fiction. Cependant, sur les vingt dernières
années les efforts intensifiés dans le domaine des prothèses visuelles
ont abouti à des avancées significatives, et plusieurs centaines de
patients dans le monde ont reçu de tels dispositifs. Ce séminaire
présentera brièvement le domaine des prothèses rétiniennes avec une
focalisation particulière sur les aspects de traitement d’image. Nous
exposerons les principales approches, les limitations connues et les
résultats.
-- Vincent Bismuth mène une carrière dans le domaine du traitement
d’images pour les dispositifs médicaux. Il a contribué pendant plus de
dix ans aux développement d’algorithmes de traitement d’images et de
vidéos pour les procédures chirurgicales interventionnelles chez GE
Healthcare. Il s’est ensuite consacré pendant quatre ans à la conception
de systèmes de restauration visuelle pour les malvoyants dans start-up
Pixium Vision. Fin 2018, il a rejoint la division mammographie de GE
Healthcare où il mène des développements en traitement d’images.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d'orateurs.
--
Edwin Carlinet
Laboratoire R&D de l'EPITA (LRDE)
Greetings,
We are pleased to announce that the following paper has been accepted in
the 25th International Conference on Tools and Algorithms for the
Construction and Analysis of Systems (TACAS'19). Please find the title
and abstract below.
Title and authors:
"Modular and Efficient Divide-and-Conquer SAT Solver on Top of the
Painless Framework"
Ludovic Le Frioux (1,2)
Souheib Baarir (1,2,3)
Julien Sopena (2,4)
Fabrice Kordon (2)
(1) LRDE, EPITA, F-94043, Le Kremlin-Bicêtre
(2) Sorbonne Université, CNRS, LIP6, UMR 7606, F-75005, Paris
(3) Université Paris Lumières, Université Paris Nanterre, F-92000,
Nanterre
(4) Inria, DELYS Team, F-75005, Paris
Abstract:
Over the last decade, parallel SATisfiability solving has been widely
studied from both theoretical and practical aspects. There are two main
approaches. First divide-and-conquer (D&C) splits the search space, each
solver being in charge of a particular subspace. The second one
portfolio launches multiple solvers in parallel, and the first to find a
solution ends the computation. However although D&C based approaches
seem to be the natural way to work in parallel, portfolio ones
experimentally provide better performances. An explanation resides on
the difficulties to use the native formulation of the SAT problem (i.e.,
the CNF form) to compute an a priori good search space partitioning
(i.e., all parallel solvers process their subspaces in comparable
computational time). To avoid this, dynamic load balancing of the search
subspaces is implemented. Unfortunately, this is difficult to compare
load balancing strategies since state-of-the-art SAT solvers
appropriately dealing with these aspects are hardly adaptable to various
strategies than the ones they have been designed for. This paper aims at
providing a way to overcome this problem by proposing an implementation
and evaluation of different types of divide-and-conquer inspired from
the literature. These are relying on the Painless framework, which
provides concurrent facilities to elaborate such parallel SAT solvers.
Comparison of the various strategies are then discussed.
More information at:
https://www.lrde.epita.fr/wiki/Publications/le-frioux.19.tacas
ELS'19 - 12th European Lisp Symposium
Hotel Bristol Palace
Genova, Italy
April 1-2 2019
In cooperation with: ACM SIGPLAN
In co-location with <Programming> 2019
Sponsored by EPITA and Franz Inc.
http://www.european-lisp-symposium.org/
Recent news:
- Submission deadline extended to Friday February 8.
- Keynote abstracts now available.
- <Programming> registration now open:
https://2019.programming-conference.org/attending/Registration
- Student refund program after the conference.
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp and Lisp-inspired
dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP,
Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We
encourage everyone interested in Lisp to participate.
The 12th European Lisp Symposium invites high quality papers about
novel research results, insights and lessons learned from practical
applications and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- Context-, aspect-, domain-oriented and generative programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Language design and implementation
- Language integration, inter-operation and deployment
- Development methodologies, support and environments
- Educational approaches and perspectives
- Experience reports and case studies
We invite submissions in the following forms:
Papers: Technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
Demonstrations: Abstracts of up to 2 pages for demonstrations of
tools, libraries, and applications.
Tutorials: Abstracts of up to 4 pages for in-depth presentations
about topics of special interest for at least 90 minutes and up to
180 minutes.
The symposium will also provide slots for lightning talks, to be
registered on-site every day.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
address: https://www.easychair.org/conferences/?conf=els2019
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Important dates:
- 08 Feb 2019 Submission deadline (*** extended! ***)
- 01 Mar 2019 Notification of acceptance
- 18 Mar 2019 Final papers due
- 01-02 Apr 2019 Symposium
Programme chair:
Nicolas Neuss, FAU Erlangen-Nürnberg, Germany
Programme committee:
Marco Antoniotti, Universita Milano Bicocca, Italy
Marc Battyani, FractalConcept, France
Pascal Costanza, IMEC, ExaScience Life Lab, Leuven, Belgium
Leonie Dreschler-Fischer, University of Hamburg, Germany
R. Matthew Emerson, thoughtstuff LLC, USA
Marco Heisig, FAU, Erlangen-Nuremberg, Germany
Charlotte Herzeel, IMEC, ExaScience Life Lab, Leuven, Belgium
Pierre R. Mai, PMSF IT Consulting, Germany
Breanndán Ó Nualláin, University of Amsterdam, Netherlands
François-René Rideau, Google, USA
Alberto Riva, Unversity of Florida, USA
Alessio Stalla, ManyDesigns Srl, Italy
Patrick Krusenotto, Deutsche Welle, Germany
Philipp Marek, Austria
Sacha Chua, Living an Awesome Life, Canada
Search Keywords:
#els2019, ELS 2019, ELS '19, European Lisp Symposium 2019,
European Lisp Symposium '19, 12th ELS, 12th European Lisp Symposium,
European Lisp Conference 2019, European Lisp Conference '19
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
