Chatbot (and voicebot) applications are increasingly adopted in various domains such as e-commerce or customer services as a direct communication channel between companies and end-users. Multiple frameworks have been developed to ease their definition and deployment. While these frameworks are efficient to design simple chatbot applications, they still require advanced technical knowledge to define complex interactions and are difficult to evolve along with the company needs (e.g. it is typically impossible to change the NL engine provider). In addition, the deployment of a chatbot application usually requires a deep understanding of the targeted platforms, especially back-end connections, increasing the development and maintenance costs. In this paper, we introduce the Xatkit framework. Xatkit tackles these issues by providing a set of Domain Specific Languages to define chatbots (and voicebots and bots in general) in a platform-independent way. Xatkit also comes with a runtime engine that automatically deploys the chatbot application and manages the defined conversation logic over the platforms of choice. Xatkit's modular architecture facilitates the separate evolution of any of its components. Xatkit is open source and fully available online. INDEX TERMS Modeling, DSL, chatbot design, chatbot deployment.

During the evolution of an application, it happens that developers must change the programming language. In the context of a collaboration with Berger-Levrault, a major IT company, we are working on the migration of a GWT application to Angular. We focus on the GUI aspect of this migration which, even if both frameworks are web Graphical User Interface (GUI) frameworks, is made difficult because they use different programming languages and different organization schema. Such migration is complicated by the fact that the new application must be able to mimic closely the visual aspect of the old one so that the users of the application are not disrupted. We propose an approach in four steps that uses a meta-model to represent the GUI at a high abstraction level. We evaluated this approach on an application comprising 470 Java (GWT) classes representing 56 pages. We are able to model all the web pages of the application and 93% of the widgets they contain, and we successfully migrated 26 out of 39 pages (66%). We give examples of the migrated pages, both successful and not.

No abstract

10Accurate maps of wastewater networks in cities are mandatory for an integrated management of water resources. However, in many countries around the world this information is unavailable or inaccurate. A new mapping method is put forward to create wastewater network maps using manhole cover locations as a prime information source. These locations could be available via ground surveys, remote sensing techniques or stakeholder's databases. A new algorithm is developed which considers manhole covers as the nodes of the network and connects them automatically. It minimizes cost functions defined by industry rules thus generating an optimized network. The various input data and the rules used to build the deterministic tree-shaped graph being uncertain, a stochastic version of the algorithm is also put forward to generate a set of probable networks in addition to the optimized one. The method is tested on the wastewater networks of Prades-le-Lez and validated on the town of Ramonville Saint Agne.Both towns are located in Southern France, are part of the two most dynamic metropolitan areas of France and are under constant urban pressure due to their proximity with the cities of Montpellier and Toulouse. The shape and topology of the mapped networks are compared to the actual ones. The results indicate an overall good agreement between the layouts of the real and generated networks. The proposed algorithm may thus be used to map wastewater networks from sampled georeferenced manhole covers, elevation and street network databases. Additional sources of information are however necessary to recreate the networks full geometry and insure proper conveyance. The low error values and high scores for completeness, correctness and quality indicate that the method is robust and may be adapted and tested on other study zones.Attempts have been made to find the optimal design configuration for wastew-32 ater and stormwater networks based on topographic and hydraulic constraints 33 or economic costs [40, 2, 21, 27, 31]. Network layout optimisation problems have 34 been thoroughly investigated in operational research since the 1950s [16, 7]. In 35 combinartorial optimisation this equates to finding the minimum spanning tree 36 of an undirected, connected graph and is known as such as put forward by 37 Borvka in 1926 [32] and later by Kruskal and Prim [23, 36] (see a review in 38 [17, 7]) or finding the shortest path to connect N-points commonly known as 39 the Steiner tree problem [19, 13]. 40 Some authors have generated virtual urban networks [26, 39]. However, in ap-41 plications where the actual network has to be mapped, exogenous factors such 42 as existing network branches may render these solutions quite inefficient. Fewer 43 attempts have been made in the literature to reproduce the layout of actual 44 drainage networks, on urban or farmed catchments [6]. In [4], [8] and [11] the 45 node to link information was provided by urban databases or local operators. In 46 the case of [10], who have developed a Bayesian Mapping model ...

No abstract