The two Eastern enlargements in 2004 and 2007 marked a new chapter in the EU’s history, since it was the first time that the Union turned to enlarge eastwards. This thesis examines the borderline problem that arose with Article 49 of the Maastricht Treaty on the European Union, which gave the right to any European country that respects the principles of: liberty, democracy, human and fundamental rights, and the rule of law, to apply for membership in the EU.   This thesis approaches the EU’s borderline problem by taking on three case studies consisting of Hungary, Lithuania, and Ukraine, for the purpose of analyzing the Eastern enlargement and Ukraine’s potentials of becoming a member of the EU. The reason for doing so is to compare Ukraine’s potentials of becoming a member in the EU with two Eastern states that, like Ukraine, have been involved with the Soviet Union, and that despite their degree of involvement, have been successfully integrated in the EU.   As the EU has turned to enlarge eastwards, it gradually pushes its borderline with every enlargement, closer to Russian territory. Hence, it is necessary to investigate how potential integration of a country like Ukraine can affect the EU’s relations with Russia. The crucial aspect of the current relations between the EU and Russia is the interdependence of energy, where Ukraine is as a strategically important country, since it currently serves as a corridor between East (Russia) and West (EU). This thesis therefore shows that the problematic of potential integration of Ukraine goes much deeper than that of a geographical matter, and therefore touches other problem areas related to domestic political instability in Ukraine, and Russian political influence through its gas supplies.   This thesis approaches the EU’s borderline problem from a foreign political perspective by investigating Ukraine’s potentials of becoming a member of the EU and suggesting, by the assistance of Westberg’s theoretical framework of integration theories, a third generation of integration theories to be needed in order to meet the problematic of the enlargement towards East. The thesis further gives recommendations to how the EU could deal with its borderline problem by answering three research questions related to the enlargement problematic. / De två östutvidgningarna 2004 och 2007 utgjorde ett nytt kapitel i EU:s historia då det var första gången som Unionen påbörjade utvidgningen mot Öst. Denna uppsats undersöker gränsproblematiken som uppkom i samband med Artikel 49 i Maastricht Fördraget om Europeiska Unionen, vilken gav rätten till varje Europeiskt land som respekterar principerna om: frihet, demokrati, mänskliga och fundamentala rättigheter, samt rättsstat, att ansöka om medlemskap i EU.   Denna uppsats närmar sig EU:s gränsproblem genom att ta sig an tre fallstudier bestående av Ungern, Litauen, och Ukraina, i syfte att analysera östutvidgningen och Ukrainas potential att bli medlem i EU ur ett utrikespolitiskt perspektiv. Anledningen till detta är att jämföra Ukrainas potential att bli medlem i EU med två öststater som, i likhet med Ukraina, har varit involverade i Sovjet Unionen, men som oberoende graden av involvering med Ryssland, framgångsrikt blivit integrerade i EU.   Eftersom EU påbörjat utvidgningen mot Öst så förskjuts EU:s gräns gradvis, med varje östutvidgning, nära ryskt territorium. Därmed är det nödvändigt att utreda hur potentiell integrering av ett land som Ukraina kan påverka EU:s relationer med Ryssland. Den avgörande aspekten när det gäller relationerna mellan EU och Ryssland, är det ömsesidiga beroendet kring energi, där Ukraina utgör ett strategiskt viktigt land, eftersom det för närvarande verkar som en korridor mellan Öst (Ryssland) och Väst (EU). Denna uppsats visar att problematiken kring potentiell integrering av Ukraina rör problemområden bortom geografisk natur, så som inhemskt politisk instabilitet i Ukraina, samt Rysslands politiska inflytande genom energiförsörjning till Europa.   Denna uppsats närmar sig EU:s gränsproblem från ett utrikespolitiskt perspektiv genom att utreda Ukrainas potentiella medlemskap i EU. Den föreslår, med hjälp av Westbergs integrationsteoretiska ramverk, att en tredje generation av integrationsteorier är nödvändig för att analysera problematiken kring utvidgningen mot Öst. Uppsatsen ger rekommendationer till hur EU kan hantera sitt gränsproblem genom att svara på tre frågeställningar gällande utvidgningsproblematiken.

The research problem that was investigated in this research study was to evaluate the implementation of sector policing in Tembisa policing precinct. Even though there are policies and directives on how to implement it, there is still some challenges because it is yet to yield the intended results. Data was collected from focus group interviews, literature studies and polices. Semi-structured interviews were conducted in the form of focus group interviews. Moreover, a literature study including material such as official SAPS documents, library sources and National Legislation regarding community policing has been presented. Data was also collected from sector managers, sector teams, CPF members and pastors who participated in four focus group interviews in Tembisa police station. The sample was chosen on the basis of what the researcher considers to be typical units. Participants were interviewed in stages. The collected data was broken into themes, patterns, trends and relationships. Data analysis followed verbatim transcription of interviews, that’s why the researcher followed Tesch’s approach of descriptive analysis. The research conducted indicated that although progress has been made in the implementation of sector policing In Tembisa, there still more which needs to be done. Specific concerns which require the attention of SAPS management were raised. It is clear that internal communication and consultation are a necessity. It is also clear that members on the ground are not well trained because they lack the actual knowledge on how to implement it. Training and development of all role players need to be prioritised to enhance their knowledge. All the role players need to be motivated during the implementation of sector policing to ensure that they are ready for the job ahead. The recommendations drawn from the conclusions made in this study may provide a proper direction on how to implement sector policing in the Republic. / Police Practice / M.Tech. (Policing)

The central issue of this research revolves around the implementation of sector policing in the province of KwaZulu-Natal. The research is based in two police stations, that is, Nongoma and Newcastle. Sector policing is a policing strategy introduced by South African Police Service in 1994. The aim of this policing strategy is the creation of structured consultation with regards to local crime problems between the police and respective communities. The objective of sector policing is to develop an organizational structure and environment that reflects community values and facilitates community involvement in addressing risk factors and solve crime-related problems. The research problem for this study is that there is little or no research conducted on the implementation of sector policing in South Africa in general and Nongoma and Newcastle in particular. Following this problem statement, the following five research questions were formulated: What is sector policing and how does its implementation differ between the USA, the UK and South Africa? What is the status of the implementation of the sector policing in South Africa, in particular the Province of KwaZulu-Natal? What are the challenges experienced in implementing sector policing in Nongoma and Newcastle police stations? What are best practices that can be observed in the implementation of sector policing in these two police stations? What is the best possible way of implementing sector policing in South Africa? The aim of the research is to assess and describe the manner in which sector policing was implemented in the two police stations in KZN. The research findings obtained through interviews are analysed and interpreted. In view of the findings, best practices, and recommendations were formulated on how to overcome challenges that may face the implementation of sector policing in the province of KwaZulu-Natal. / Public Administration & Management / M.Tech. (Public Administration & Management)

本研究將探討非等效平行機台問題中具備順序相依整備時間及不同開始工作時間（Unequal ready-time）之情況，並以最小化總延遲工件權重數為目標值，其目的在改善非等效平行機台問題應用於實際產業中製造環境裡所面對的各項挑戰，如印刷電路板的鑽孔和半導體的測試製程。因本研究欲求解之問題是屬於NP - Hard problems 性質之尋優問題，故利用啟發式方法(heuristics)求解為合適的選擇。此外，本研究計畫開發混合式巨集啟發式方法來求解非等效平行機台問題，主要以禁忌搜尋法為主，在鄰域的搜尋上，也藉由變動鄰域尋優法能夠透過鄰域轉換的機制，進而找出更多好的解。由於啟發式方法對於尋優問題常需花費許多時間來計算才能獲得更好的解，為確保增進求解效率與品質，將針對問題特性開發數種初始解產生法，並也嘗試定義幾個能夠減少尋找鄰近解之鄰域。在後續求解改善的過程中，主要整合變動鄰域(VND)及禁忌(TS)巨集啟發式演算法搜尋最佳解。此外，為了評估本文推導之演算法效能，本研究利用設定之條件隨機產生適量模擬現場狀況的測試情境，進而比較本研究所提出之混合式巨集啟發式方法及標準禁忌搜尋法在不同情境下之表現。 / The problem considered in this paper is a set of independent jobs on unrelated parallel machines with sequence-dependent setup times and with unequal ready times so as to minimize total weighted tardy jobs. These problems can be found in real-life manufacturing environments, such as PCB fabrication drilling operations and semiconductor wafer manufacturing dicing. Since the problems are NP-hard in the strong sense, heuristics are an acceptable practice to finding good solutions. A hybrid meta-heuristics are proposed to solve this scheduling problem. The proposed heuristics belong to a type of solution improvement heuristic; therefore, the heuristics start with an effective initial feasible solution then a meta-heuristic is applied to improve the solution. To enhance both the efficiency and efficacy of the heuristics, several different initial solution generators, based on the characteristics of problems, are developed. The meta-heuristic is a hybrid heuristic integrating the principles of Variable Neighborhood Descent approach (VND) and Tabu Search (TS). In order to evaluate the performance of the proposed heuristics, two sets of large number test scenarios will be designed to simulate practical shop floor problems. Computational experiments will be performed to compare the performance of the proposed heuristics, and a basic tabu search algorithm. The results show the proposed heuristic perform better than the basic tabu search algorithm.

De nombreux problèmes pratiques qui se posent dans dans le domaine de la logistique, peuvent être modélisés comme des problèmes de tournées de véhicules. De façon générale, cette famille de problèmes implique la conception de routes, débutant et se terminant à un dépôt, qui sont utilisées pour distribuer des biens à un nombre de clients géographiquement dispersé dans un contexte où les coûts associés aux routes sont minimisés. Selon le type de problème, un ou plusieurs dépôts peuvent-être présents. Les problèmes de tournées de véhicules sont parmi les problèmes combinatoires les plus difficiles à résoudre. Dans cette thèse, nous étudions un problème d’optimisation combinatoire, appartenant aux classes des problèmes de tournées de véhicules, qui est liée au contexte des réseaux de transport. Nous introduisons un nouveau problème qui est principalement inspiré des activités de collecte de lait des fermes de production, et de la redistribution du produit collecté aux usines de transformation, pour la province de Québec. Deux variantes de ce problème sont considérées. La première, vise la conception d’un plan tactique de routage pour le problème de la collecte-redistribution de lait sur un horizon donné, en supposant que le niveau de la production au cours de l’horizon est fixé. La deuxième variante, vise à fournir un plan plus précis en tenant compte de la variation potentielle de niveau de production pouvant survenir au cours de l’horizon considéré. Dans la première partie de cette thèse, nous décrivons un algorithme exact pour la première variante du problème qui se caractérise par la présence de fenêtres de temps, plusieurs dépôts, et une flotte hétérogène de véhicules, et dont l’objectif est de minimiser le coût de routage. À cette fin, le problème est modélisé comme un problème multi-attributs de tournées de véhicules. L’algorithme exact est basé sur la génération de colonnes impliquant un algorithme de plus court chemin élémentaire avec contraintes de ressources. Dans la deuxième partie, nous concevons un algorithme exact pour résoudre la deuxième variante du problème. À cette fin, le problème est modélisé comme un problème de tournées de véhicules multi-périodes prenant en compte explicitement les variations potentielles du niveau de production sur un horizon donné. De nouvelles stratégies sont proposées pour résoudre le problème de plus court chemin élémentaire avec contraintes de ressources, impliquant dans ce cas une structure particulière étant donné la caractéristique multi-périodes du problème général. Pour résoudre des instances de taille réaliste dans des temps de calcul raisonnables, une approche de résolution de nature heuristique est requise. La troisième partie propose un algorithme de recherche adaptative à grands voisinages où de nombreuses nouvelles stratégies d’exploration et d’exploitation sont proposées pour améliorer la performances de l’algorithme proposé en termes de la qualité de la solution obtenue et du temps de calcul nécessaire. / Many practical problems arising in real-world applications in the field of logistics can be modeled as vehicle routing problems (VRP). In broad terms, VRPs deal with designing optimal routes for delivering goods or services to a number of geographically scattered customers in a context in which, routing costs are minimized. Depending on the type of problem, one or several depots may be present. Routing problems are among the most difficult combinatorial optimization problems. In this dissertation we study a special combinatorial optimization problem, belonging to the class of the vehicle routing problem that is strongly linked to the context of the transportation networks. We introduce a new problem setting, which is mainly inspired by the activities of collecting milk from production farms and distributing the collected product to processing plants in Quebec. Two different variants of this problem setting are considered. The first variant seeks a tactical routing plan for the milk collection-distribution problem over a given planning horizon assuming that the production level over the considered horizon is fixed. The second variant aims to provide a more accurate plan by taking into account potential variations in terms of production level, which may occur during the course of a horizon. This thesis is cast into three main parts, as follows: In the first part, we describe an exact algorithm for the first variant of the problem, which is characterized by the presence of time windows, multiple depots, and a heterogeneous fleet of vehicles, where the objective is to minimize the routing cost. To this end, the problem is modeled as a multi-attribute vehicle routing problem. The exact algorithm proposed is based on the column generation approach, coupled with an elementary shortest path algorithm with resource constraints. In the second part, we design an exact framework to address the second variant of the problem. To this end, the problem is modeled as a multi-period vehicle routing problem, which explicitly takes into account potential production level variations over a horizon. New strategies are proposed to tackle the particular structure of the multi-period elementary shortest path algorithm with resource constraints. To solve realistic instances of the second variant of the problem in reasonable computation times, a heuristic approach is required. In the third part of this thesis, we propose an adaptive large neighborhood search, where various new exploration and exploitation strategies are proposed to improve the performance of the algorithm in terms of solution quality and computational efficiency.

The central issue of this research revolves around the implementation of sector policing in the province of KwaZulu-Natal. The research is based in two police stations, that is, Nongoma and Newcastle. Sector policing is a policing strategy introduced by South African Police Service in 1994. The aim of this policing strategy is the creation of structured consultation with regards to local crime problems between the police and respective communities. The objective of sector policing is to develop an organizational structure and environment that reflects community values and facilitates community involvement in addressing risk factors and solve crime-related problems. The research problem for this study is that there is little or no research conducted on the implementation of sector policing in South Africa in general and Nongoma and Newcastle in particular. Following this problem statement, the following five research questions were formulated: What is sector policing and how does its implementation differ between the USA, the UK and South Africa? What is the status of the implementation of the sector policing in South Africa, in particular the Province of KwaZulu-Natal? What are the challenges experienced in implementing sector policing in Nongoma and Newcastle police stations? What are best practices that can be observed in the implementation of sector policing in these two police stations? What is the best possible way of implementing sector policing in South Africa? The aim of the research is to assess and describe the manner in which sector policing was implemented in the two police stations in KZN. The research findings obtained through interviews are analysed and interpreted. In view of the findings, best practices, and recommendations were formulated on how to overcome challenges that may face the implementation of sector policing in the province of KwaZulu-Natal. / Public Administration and Management / M.Tech. (Public Administration & Management)

The North End is one of the most colourful areas in Winnipeg, Manitoba. Plagued by urban decay, the North End is a melting pot of cultures and catch basin for many marginalized people. In the face of adversity, people unite under similar ideals and principles to work towards common goals. This unity is exemplified in co-operatives, which has been in the North End for decades. Co-ops exhibited outstanding camaraderie with the goal of alleviating adverse social conditions. Today, the co-op sector, exemplified by Pollock’s Hardware and Urban Eatin’ Landscapes, continue to operate in the area like conventional business, while practicing social and environmental responsibility under a common set of principles. Due to their ideologies and principles, their impact on neighbourhood and community revitalization is more profound than expected. Through case studies, this research found that co-ops offer urban planners and government officials a complimentary method to conventional urban revitalization methods. Co-operative Urban Revitalization starts by uniting marginalized people and empowering them to devise solutions to social and economic problems. / February 2017

L’approche psycholinguistique suggère que la rétention à court terme verbale et le langage dépendent de mécanismes communs. Elle prédit que les caractéristiques linguistiques des items verbaux (e.g. phonologiques, lexicales, sémantiques) influencent le rappel immédiat (1) et que la contribution des niveaux de représentations linguistiques dépend du contexte de rappel, certaines conditions expérimentales (e.g. format des stimuli) favorisant l’utilisation de codes spécifiques (2). Ces prédictions sont évaluées par le biais de deux études empiriques réalisées auprès d’une patiente cérébrolésée qui présente une atteinte du traitement phonologique (I.R.) et de participants contrôles. Une première étude (Article 1) teste l’impact des modes de présentation et de rappel sur les effets de similarité phonologique et de catégorie sémantique de listes de mots. Une seconde étude (Article 2) évalue la contribution du code orthographique en mémoire à court terme (MCT) verbale en testant l’effet de la densité du voisinage orthographique des mots sur le rappel sériel immédiat de mots présentés visuellement. Compte tenu du rôle déterminant du code phonologique en MCT et du type d’atteinte de I.R., des effets linguistiques distincts étaient attendus chez elle et chez les contrôles. Selon le contexte de rappel, des effets sémantiques (Article 1) et orthographiques (Article 2) plus importants étaient prédits chez I.R. et des effets phonologiques plus marqués étaient attendus chez les participants contrôles. Chez I.R., le rappel est influencé par les caractéristiques sémantiques et orthographiques des mots, mais peu par leurs caractéristiques phonologiques et le contexte de rappel module l’utilisation de différents niveaux de représentations linguistiques. Chez les contrôles, une contribution relativement plus stable des représentations phonologiques est observée. Les données appuient une approche psycholinguistique qui postule que des mécanismes communs régissent la rétention à court terme verbale et le langage. Les implications théoriques et cliniques des résultats sont discutées en regard de modèles psycholinguistiques actuels. / The psycholinguistic view of verbal short-term retention suggests that verbal short-term retention and language processing rely on common mechanisms. It predicts that all linguistic characteristics of verbal items (e.g. phonological, lexical, semantic) influence their immediate recall (1). It also predicts that the relative contribution of the different linguistic representational levels is a function of the recall context (2). In this view, some experimental conditions (e.g. modes of presentation of stimuli) are thought to promote the use of specific coding. Two studies assess these predictions in a brain-damaged patient (I.R.) who shows a phonological deficit as well as in control participants. In a first article, the impact of presentation and recall modes on phonological and semantic similarity effects of words is tested. In a second article, the contribution of orthographic coding in verbal short-term memory (STM) is assessed by testing the effect of orthographic Neighborhood (N) density of words on immediate serial recall (ISR) of written words. Due to her phonological deficit and because phonological representations play a predominant role in STM, distinct linguistic effects were expected in I.R. and in controls. Overall, (and) depending on the recall context, larger semantic and orthographic effects were predicted in I.R. and larger phonological effects were predicted in controls. In I.R., the data indicate that recall is influenced by semantic and orthographic characteristics of items but less by their phonological properties. The results also indicate that the impact of representations depends of recall conditions. In controls, a different pattern of results is obtained, suggesting an overall predominant contribution of phonological representations. Results support the psycholinguistic view of verbal short-term retention and are discussed in regard to current interactive activation psycholinguistic models of verbal STM and language processing.

Cette thèse porte sur les problèmes de tournées de véhicules avec fenêtres de temps où un gain est associé à chaque client et où l'objectif est de maximiser la somme des gains recueillis moins les coûts de transport. De plus, un même véhicule peut effectuer plusieurs tournées durant l'horizon de planification. Ce problème a été relativement peu étudié en dépit de son importance en pratique. Par exemple, dans le domaine de la livraison de denrées périssables, plusieurs tournées de courte durée doivent être combinées afin de former des journées complètes de travail. Nous croyons que ce type de problème aura une importance de plus en plus grande dans le futur avec l'avènement du commerce électronique, comme les épiceries électroniques, où les clients peuvent commander des produits par internet pour la livraison à domicile. Dans le premier chapitre de cette thèse, nous présentons d'abord une revue de la littérature consacrée aux problèmes de tournées de véhicules avec gains ainsi qu'aux problèmes permettant une réutilisation des véhicules. Nous présentons les méthodologies générales adoptées pour les résoudre, soit les méthodes exactes, les méthodes heuristiques et les méta-heuristiques. Nous discutons enfin des problèmes de tournées dynamiques où certaines données sur le problème ne sont pas connues à l'avance. Dans le second chapitre, nous décrivons un algorithme exact pour résoudre un problème de tournées avec fenêtres de temps et réutilisation de véhicules où l'objectif premier est de maximiser le nombre de clients desservis. Pour ce faire, le problème est modélisé comme un problème de tournées avec gains. L'algorithme exact est basé sur une méthode de génération de colonnes couplée avec un algorithme de plus court chemin élémentaire avec contraintes de ressources. Pour résoudre des instances de taille réaliste dans des temps de calcul raisonnables, une approche de résolution de nature heuristique est requise. Le troisième chapitre propose donc une méthode de recherche adaptative à grand voisinage qui exploite les différents niveaux hiérarchiques du problème (soit les journées complètes de travail des véhicules, les routes qui composent ces journées et les clients qui composent les routes). Dans le quatrième chapitre, qui traite du cas dynamique, une stratégie d'acceptation et de refus des nouvelles requêtes de service est proposée, basée sur une anticipation des requêtes à venir. L'approche repose sur la génération de scénarios pour différentes réalisations possibles des requêtes futures. Le coût d'opportunité de servir une nouvelle requête est basé sur une évaluation des scénarios avec et sans cette nouvelle requête. Enfin, le dernier chapitre résume les contributions de cette thèse et propose quelques avenues de recherche future. / This thesis studies vehicle routing problems with time windows, where a gain is associated with each customer and where the objective is to maximize the total gain collected minus the routing costs. Furthermore. the same vehicle might be assigned to different routes during the planning horizon. This problem has received little attention in the literature in spite of its importance in practice. For example, in the home delivery of perishable goods (like food), routes of short duration must be combined to form complete workdays. We believe that this type of problem will become increasingly important in the future with the advent of electronic services, like e-groceries, where customers can order goods through the Internet and get these goods delivered at home. In the first chapter of this thesis, we present a review of vehicle routing problems with gains, as well as vehicle routing problems with multiple use of vehicles. We discuss the general classes of problem-solving approaches for these problems, namely, exact methods, heuristics and metaheuristics. We also introduce dynamic vehicle routing problems, where new information is revealed as the routes are executed. In the second chapter, we describe an exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles, where the first objective is to maximize the number of served customers. To this end, the problem is modeled as a vehicle routing problem with gains. The exact algorithm is based on column generation, coupled with an elementary shortest path algorithm with resource constraints. To solve realistic instances in reasonable computation times, a heuristic approach is required. The third chapter proposes an adaptative large neighborhood search where the various hierarchical levels of the problem are exploited (i.e., complete vehicle workdays, routes within workdays and customers within routes). The fourth chapter deals with the dynamic case. In this chapter, a strategy for accepting or rejecting new customer requests is proposed. This strategy is based on the generation of multiple scenarios for different realizations of the requests in the future. An opportunity cost for serving a new request is then computed, based on an evaluation of the scenarios with and without the new request. Finally, the last chapter summarizes the contributions of this thesis and proposes future research avenues.

Dans ce travail, nous définissons des objets composés de disques complexes marqués reliés entre eux par des segments de droite munis d’une longueur. Nous construisons deux séries d’espaces de module de ces objets appelés clus- ters, une qui sera dite non symétrique, la version ⊗, et l’autre qui est dite symétrique, la version •. Cette construction permet des choix de perturba- tions pour deux versions correspondantes des trajectoires de Floer introduites par Cornea et Lalonde ([CL]). Ces choix devraient fournir une nouvelle option pour la description géométrique des structures A∞ et L∞ obstruées étudiées par Fukaya, Oh, Ohta et Ono ([FOOO2],[FOOO]) et Cho ([Cho]). Dans le cas où L ⊂ (M, ω) est une sous-variété lagrangienne Pin± mono- tone avec nombre de Maslov ≥ 2, nous définissons une structure d’algèbre A∞ sur les points critiques d’une fonction de Morse générique sur L. Cette struc- ture est présentée comme une extension du complexe des perles de Oh ([Oh]) muni de son produit quantique, plus récemment étudié par Biran et Cornea ([BC]). Plus généralement, nous décrivons une version géométrique d’une catégorie de Fukaya avec seul objet L qui se veut alternative à la description (relative) hamiltonienne de Seidel ([Sei]). Nous vérifions la fonctorialité de notre construction en définissant des espaces de module de clusters occultés qui servent d’espaces sources pour des morphismes de comparaison. / We define objects made of marked complex disks connected by metric line seg- ments and construct two sequences of moduli spaces of these objects, referred as the ⊗ version (nonsymmetric) and the • version (symmetric). This allows choices of coherent perturbations over the corresponding versions of the Floer trajectories proposed by Cornea and Lalonde ([CL]). These perturbations are intended to lead to an alternative geometric description of the (obstructed) A∞ and L∞ structures studied by Fukaya, Oh, Ohta and Ono ([FOOO2],[FOOO]) and Cho ([Cho]). Given a Pin± monotone lagrangian submanifold L ⊂ (M, ω) with mini- mal Maslov number ≥ 2, we define an A∞ -algebra structure from the critical points of a generic Morse function on L. We express this structure as a cochain complex extending the pearl complex introduced by Oh ([Oh]) and further ex- plicited by Biran and Cornea ([BC]), equipped with its quantum product. This could also be seen as an alternative geometric description of a Fukaya cate- gory of (M, ω) with L as its only object, a hamiltonian relative version appear- ing in [Sei]. Using spaces of quilted clusters, we verify, using more general quilted cluster spaces, that this defines a functor from a homotopy category of Pin± monotone lagrangian submanifolds hL mono,± (M, ω) to the homotopy category of cochain complexes hK(Λ-mod) where Λ is an appropriate Novikov ring.