Research :

Other :

Dorine Tabary

About

Some useful information

Presentation

Curious about the advances in Artificial Intelligence, the Bachelor in Computer Science offered me the programming skills necessary for the implementation of algorithms. Afterwards, the Master in Theoretical Computer Science gave me a higher level understanding of problem solving methods. This academic knowledge is enriched by multiple self-taught projects.

I am currently pursuing a PhD thesis on routing protocols in vehicular networks. I have integrated the IRIMAS where I use my theoretical knowledge to improve vehicular communications while assimilating new skills concerning dynamic modeling and computer programming aspects.

  • Running, reading, films, games
  • MultiMakers (President), Portail Ludique (Member)
  • Colmar
  • dorine.tabary{at}uha.fr
  • Git

Computer skills

In the course of the various projects I have worked on, I have approached several programming tools. My PhD thesis allowed me to integrate simulation programs when modeling communicating vehicles and implementing new network protocols.

Web - PHP / noSQL /JSON / HTML / CSS
Programming - C++ / Java
Mathematical software- R / Matlab / SCIP / Coq
Others- JBotSim / Ns-3 / Blender

Teachings

Some teaching missions

Dynamic web

During this course, students were led to create a dynamic website from the design of the mock-up to the enhancement of the final rendering. The students were able to understand the mechanisms inherent to web pages, with a direct application of acquired notions such as java programming, or database management. This course was carried out in a completely virtual way.

Calculability

What is calculable? This famous question lays the foundations of our current computers. Calculability identifies functions that can be computed using algorithms. Students were able to apply these concepts to fundamental questions in mathematics. Differentiating between what is calculable and what is not allowed them to integrate the limits of problems that computers can solve.

Creation of a game in Artificial Intelligence

One of the projects proposed to the students was the creation of a playful application allowing the user to approach game theory. The dilemma of the iterated prisoner is modeled in order to make it accessible to the greatest number.

Rechearch

Papers accepted in international conferences
  • A new strategy for the selection of communication technologies in VANETs with fully controllable vehicles ,WiOpt 2020 (video, article )
    • Abstract : In-vehicle systems enable information to be managed in motion situations. The objective is to maximise the flow provided by these vehicles in a centralised manner. The study area is a map that is gridded. In the scenario studied, the vehicle trajectories and their communication technologies are defined according to this environment. The problem is first formulated as an optimization problem. The complexity of this problem is then proven as NP-difficult without the possibility of a constant factor approximation algorithm in general. By adding constraints, the problem remains NP-difficult, but with the possibility of an approximation algorithm.
  • New results about the linearization of scaffolds sharing repeated contigs, COCOA 2018 (article)
    • Abstract : Solutions to genome scaffolding problems can be represented as trajectories and cycles in a "solution graph". However, when working with repetitions, these solution graphs may contain branching and, as a result, there are many conversions to sequences. After presenting various ways of extracting the various sequences from these solutions, we extend the previously known NP-difficulty results to the case where the solution graph is planar, bipartite and subcubic, and show that there is no PTAS in this case.