NCube/papyrus huggingface dataset:
De la théorie marxiste de l’exploitation capitaliste à l’idée de justice

The principal objective of this thesis is to propose a complementary analysis on under-development. Our point of view is that: There are many causes of the extreme poverty. Therefore, capitalist exploitation is one of the causes meanwhile it has been neglected or ignored in many theories in the world. To better defend that position, we are going to examine some of those theories, especially those in which the question of under-development is developed, focusing on the philosophical discourse and based on the justification of existence. That discourse is on lack of coherence. In effect, authors like Peter Singer or John Rawls profess it and do not care about it or only care little about putting a nice etiological diagnostic of poverty.   In the contrary to other ideas defended in Marxist theory of the capitalist exploitation, we are going to make use of some central themes of that theory to show that either in local or global level, capitalism exploitation in which result poverty are two aspects of the same reality. Despite the pertinence of some Marxism critics, necessary that might be coming back to that theory, it is good because it help according to us to better understand the “underlying reality” or to better understand the «etiological cause" of poverty in other to fight against that flail. That is why at the end of the analysis; we pay attention on the question of the opportunities of development.   To end up, we have to understand that, going back to the sources of Marxist thought or especially, going back to sources of Marxist theory of capitalist exploitation imposes itself as soon as you want to give a concrete, specific and brief answer to the following questions: Why poverty and what are the causes and consequences? How can we fight against it? The fact of going back to sources of Marxist thought aims to a reappropriation of ideal communist and revolutionary that a redefine norms and roles being Henceforth controlling commercials and international relations. The effect of the normalisation of those relations will be to eliminate the various forms of exploitations identified and so to prevent that some notions should be poor until   being forced to resort or to count on the help or to count on the international help for its development.  That type of normalisation will be possible if we accept a restructuration of capitalism in other to fill the deficit of the social and economic justice that it is suffering for. Our dissidence toward Marxist orthodox has consideration but on our voluntary of rethinking from an etymological analysis of poverty, the conditions of the possibility of good economy and generally for the very righteous world, very free and very equalized, without revolutionary perspective.

Keyphrases: Exploitation, capitalism, poverty, Marxism, justice, distributive, reformism
Les limites souhaitables et légitimes au pluralisme : une perspective constructiviste

A problem that appears to be fundamental in the context of liberal democratic society in which we live is that, on the one hand, this type of society creates the conditions of pluralism and that the institutions must be neutral in terms of convictions, a priori one account as much as the other if we are truly neutral in this area. On the other hand, we have a great feeling that the organization of our common life is, for the most part, morally good and just, and that some limits must not be crossed as to what we can do or believe, not to encroach on this structuring. Some limits seem to us unavoidable for the living together and the self-determination of democratic societies. Hence this question: What is the practical point of view to which only desirable and legitimate limits apply to pluralism in a liberal democratic context? The practical point of view is taken whenever it’s judged that certain things provide practical reasons, or that they are valid, good, bad, and so on. The practical point of view is therefore likely to make claims, to decide on what we must do or value. I defend the thesis that, in the context of a liberal democratic society, norms and values are the product of a construction whose source is the practical point of view understood as the attitude of value as such. This conception of the practical point of view is one found in Humean constructivism, notably defended by Sharon Street. At the social level, if the limits which allow the definition of such a practical point of view are not likely to be translated into absolute principles of justice, they make it possible to lay down some conditions that a normative approach should satisfy if it wants to play the role that we attribute to it in a democratic and liberal context, namely the search for balance between the attribution of power to everyone and the priority given to rights and freedoms (fertile ground for the deepening of human rights), as well as the recognition of injustices and inequalities that remain in the current order of things.

Keyphrases: Constructivism, Pluralism, Coherentism, Democracy, Liberalism, Norm, Value
L'humour éthique : Deleuze, Adorno, Derrida

Gilles Deleuze, Theodor W. Adorno, and Jacques Derrida, the three principal authors discussed in the present thesis, would-whatever their differences-no doubt agree that it is a central concern of philosophical thinking to question the validity of dogmatic thinking in all its forms. However, one approach to this issue perhaps deserves more attention than it has generally received, namely, the humour, irony, and laughter that can help thought shake off its moralizing and conservative tendencies, thereby reinvigorating itself. In the present thesis, it is the concept of ethical humour (humour éthique) that will be our focus, along with its central figure, the dissident-idiot. The aim will be to put forward a philosophical concept of humour oriented towards the future, towards the possibility of a positive, even utopian, transformation of the world. The argument is laid out in three central chapters. (1) Deleuze will provide an occasion to make explicit the "idiotic" element of ethical humour, i.e., its capacity to foil and dismantle a thinking caught up in doxa, thereby helping us to see beyond our usual representations of the world. (2) Adorno will then give us the means to bring out the "exactitude" required of ethical humour, in addition to its "dissident" side, i.e., its capacity to formulate the social contradictions and emancipatory possibilities veiled by ideology. (3) Finally, Derrida will allow us to see how the irony of what he calls différance and oui-rire provides an opening for an unconditional renewal of meaning, even at those moments when such a renewal seems impossible. These points are articulated within the context of the singular and paradoxical responsibility of the ethical humourist.

Keyphrases: éthique, humour, rire, Deleuze, Adorno, Derrida, Kafka, Beckett, Joyce, philosophy, ethics, emancipation, irony, laughter
Towards a Coherent Reading of Marxian Methodology Based on the Conception of Totality

This dissertation examines the conception of totality in Marxist literature from a methodological point of view in order to offer a solution to a longstanding problem in Marxist methodology, namely, the relationship between the method of inquiry and the method of exposition, the problem that has lingered without any definitive solution in the literature since the time Marx scribbled in 1857-58 the notes now known as the Grundrisse and Introduction. To this effect, after highlighting the shortcomings of two misconceptions of totality and Hegel’s conception of totality, and demonstrating the lacunae of the existing interpretations offered by other Marxist thinkers, it advances what is proposed as a proper Marxian understanding of totality, through showing the development of this conception in Marx’s works. Finally, it relates this particular development to the problem of the relationship between the method of inquiry and the method of exposition by relating and also distinguishing them as two moments included in the method of investigation.

Keyphrases: Method of Inquiry, Method of Exposition, Method of Investigation, Methodology, Totality
Rigid and strongly rigid relations on small domains

Strongly rigid relations play an important role in the study of the complexity of Constraint Satisfaction Problems (CSPs) (Feder and Vardi [22], Schaefer [9], Jeavons [23], Bulatov, Jeavons and Krokhin [24], Larose and Tesson [34], Larose [31], Barto and Kozik [36], and Bulatov, Jeavons and Krokhin [27]) which are the subject of intense research in both artificial intelligence and operations research (Russell and Norvig [19]). An n-ary relation r on a set U is strongly rigid if it is preserved only by trivial operations. It is projective if the only idempotent operations in Polr are projections.  Rosenberg (1973) characterized all strongly rigid relations on a set with two elements and found a strongly rigid binary relation on every domain U of at least 3 elements. Larose and Tardif (2001) studied the projective and strongly rigid graphs, and constructed large families of strongly rigid graphs. Łuczak and Nešetˇril (2004) settled in the affirmative a conjecture of Larose and Tardif that most graphs on a large set are projective, and characterized all homogenous graphs that are projective. Łuczak and Nešetˇril (2006) confirmed a conjecture of Rosenberg that most relations on a big set are strongly rigid.  In this thesis we characterize all strongly rigid relations on a set with at least three elements to answer an open question by Rosenberg (1973) (Rosenberg [7], Problem 6 in Rosenberg [13]). We classify the binary relations on the 3-element domain and demonstrate that there are merely 4 pairwise nonisomorphic rigid binary relations on the same domain (among them 2 are pairwise nonisomorphic strongly rigid), and we classify the binary relations on the 4-element domain and show that there are merely 40 pairwise nonisomorphic rigid binary relations on the same domain (among them 25 are pairwise nonisomorphic strongly rigid) (Example 5.4 and Example 6.1 in Sun [41]). We extend a strongly rigid relation on a 4-element domain to any finite domain (Sun [43]). Finally, we give a strongly rigid ternary relation on any finite domain and conjecture a strongly rigid k-ary relation on any finite domain (Sun [42]).

Keyphrases: Universal algebra, clone theory, polymorphisms, rigid relations, strongly rigid relations, relations rigides
Classification of separable superintegrable systems of order four in two dimensional Euclidean space and algebras of integrals of motion in one dimension

The purpose of this thesis is to continue a systematic research on classical and quantum superintegrable systems. We present the results from two articles. In the first article, we consider a general Hamiltonian in two-dimensional Euclidean space admitting a second order and a fourth order integral of motion. The second order integral imposes the separation of variable in the potentials. We present a complete classification of all quantum potentials that are solutions of nonlinear ODEs and the corresponding integrals. New potentials expressed in terms of the third and fifth Painlevé transcendents are obtained. In the second article, we develop new constructions of two-dimensional classical and quantum superintegrable Hamiltonians with separation of variables in Cartesian coordinates. Here we construct four types of algebraic Hamiltonian systems in one dimension. We study two copies of operator algebras in one dimension and combine these two to form superintegrable systems in $E_2$. We demonstrate that all quantum and classical superintegrable systems separable in Cartesian coordinates up to order 5 are in fact reducible.

Keyphrases: superintegrability, separation of variables, quantum mechanics, Painlevé transcendent, ladder operator
Fukaya categories of Lagrangian cobordisms and duality

We introduce a new type of duality structure for A_∞-categories called a relative weak Calabi-Yau pairing which generalizes Kontsevich and Soibelman's notion of a weak (proper) Calabi-Yau structure. We prove the existence of a relative weak Calabi-Yau pairing on Biran and Cornea's Fukaya category of Lagrangian cobordisms Fuk_cob(C x M). Here M is a symplectic manifold which is closed or tame at infinity. This duality structure on Fuk_cob(C x M) extends the relative Poincaré duality satisfied by Floer complexes for pairs of Lagrangian cobordisms. Moreover, we show that the relative weak Calabi-Yau pairing on Fuk_cob(C x M) satisfies a compatibility condition with respect to the usual weak Calabi-Yau structure on the monotone Fukaya category of M. The construction of the relative weak Calabi-Yau pairing on Fuk_cob(C x M) is based on counts of curves in C x M satisfying an inhomogeneous nonlinear Cauchy-Riemann equation. In order to prove the existence of this duality structure and to verify its properties, we extend the methods of Biran and Cornea to establish regularity and compactness results for the relevant moduli spaces. We also consider the implications of the existence of the relative weak Calabi-Yau pairing on Fuk_cob(C x M) for the cone decomposition in the derived Fukaya category of M associated to a Lagrangian cobordism, and we present an example involving Lagrangian surgery.

Keyphrases: symplectic topology, Lagrangian submanifolds, Floer homology, Fukaya categories, derived Fukaya categories, Lagrangian cobordisms, Lagrangian surgery, weak Calabi- Yau structures
Sequence-to-sequence learning for machine translation and automatic differentiation for machine learning software tools

This thesis consists of a series of articles that contribute to the field of machine learning. In particular, it covers two distinct and loosely related fields.  The first three articles consider the use of neural network models for problems in natural language processing (NLP). The first article introduces the use of an encoder-decoder structure involving recurrent neural networks (RNNs) to translate from and to variable length phrases and sentences. The second article contains a quantitative and qualitative analysis of the performance of these `neural machine translation' models, laying bare the difficulties posed by long sentences and rare words. The third article deals with handling rare and out-of-vocabulary words in neural network models by using dictionary coder compression algorithms and multi-scale RNN models.  The second half of this thesis does not deal with specific neural network models, but with the software tools and frameworks that can be used to define and train them. Modern deep learning frameworks need to be able to efficiently execute programs involving linear algebra and array programming, while also being able to employ automatic differentiation (AD) in order to calculate a variety of derivatives. The first article provides an overview of the difficulties posed in reconciling these two objectives, and introduces a graph-based intermediate representation that aims to tackle these difficulties. The second article considers a different approach to the same problem, implementing a tape-based source-code transformation approach to AD on a dynamically typed array programming language (Python and NumPy).

Keyphrases: Deep learning, Machine learning, Machine translation, Automatic differentiation, Neural networks, Natural language processing
Apprendre à résoudre des analogies de forme

Analogical learning  is a mechanism that allows the transfer of input forms (eg, strings) to output forms without resorting to model training. To do this, each analogy identified in the input space involving the input form to be processed gives rise to an analogical equation in the output space whose resolution leads to candidate solutions. Since several analogies may involve the input form and the resolution of an equation generates several solutions, many candidate forms are typically produced from which to filter.  In this thesis, we study two solutions to reduce the noise generated by this process. The first is to learn how to aggregate candidate solutions. To this end, we compare classifiers trained in a supervised way to recognize the expected solution of the other solutions produced to hypothesis reclassification systems. The second solution uses structured learning to learn how to solve an analog equation by generating fewer candidate forms in order to increase the chances of predicting the expected solution.  We show that both solutions can significantly improve the performance of an analogical system on several translation tasks.

Keyphrases: Formal analogy, Analogical learning, Structured prediction, Ranking of solutions
Étude algorithmique et combinatoire de la méthode de Kemeny-Young et du consensus de classements

A permutation is a list that orders objects or candidates with a preference function or a criterion. Some examples include results from a search engine on the internet, athlete rankings, lists of genes related to a disease given by prediction methods or simply the preference of activities for the next weekend. One might be interested to aggregate a set of permutations to get a consensus permutation. This problem is well known in political science and many methods exists that can aggregate permutations, each one having its mathematical properties. Among those methods, the Kemeny-Young method, also known as the median of permutations, finds a consensus that minimise the sum of distances between that consensus and the set of permutations. This method holds many desirable properties. On the other end, this method is difficult to calculate, thus opening the way for research works. A generalization of this problem considers rankings containing ties between the ranked objects and rankings that might be incomplete by considering only a subset of objects. In this thesis, we study the Kemeny-Young method under different aspects : — Firstly, a search space reduction technique is proposed. It improves the time com- plexity of exact algorithms for the problem. — Secondly, a well parameterized heuristic is developed and is used as guidance in a branch-and-bound exact algorithm. This algorithm also uses a new search space reduction technique. — Thirdly, the special case of the problem on three permutations is investigated. A search space reduction technique based on graphs is presented for this case, followed by a very tight lower bound. Two conjectures are stated and are linking this case with the 3-Hitting Set problem. — Finally, a generalization of the problem is proposed and allows us to extend our work on search space reduction techniques to the rank aggregation problem.

Keyphrases: consensus de classements, permutations, Kemeny-Young method, median of permutations, Kemeny’s rule, Kendall-tau distance, rank aggregation, ranking’s consensus, preferential votes, voting system, rankings, permutations, optimization, algorithms
Metamodel co-evolution with related model-driven engineering artifacts : a multi-objective search framework

Successful software products are evolved by introducing continuous changes at different levels. Thus, software industry is actively recruiting software engineers, not to create new software systems, but to evolve and maintain existing ones. Such evolution and maintenance tasks are tedious and time consuming. Thus, there is an urgent need to find better ways to evolve software systems and consequently, improve developers’ productivity. Like the source code, the design is subject to evolution due to changing requirements and technological constraints. Model-Driven Software Evolution is concerned with the changes related to the design of software systems, from initial development to maintenance. In model driven development, the evolution of metamodels may break the relationships to dependent artifacts like models, transformation rules and OCL constraints. While several coevolution studies are proposed, most of them are providing either a manual or semi-automated support based on pre-defined templates of evolution scenarios. In addition to be pre-defined, these templates are specific to the artifact to co-evolve with the metamodel. The main objective of our research is to propose a generic search-based framework for the automated recommendation of coevolution strategies without using pre-defined templates for specific metamodel changes or artifact types. For an artifact to co-evolve, the goal is to produce a new version that conforms to the new version of the metamodel. To this end, we view the co-evolution as a multi-objective optimization problem, and guide the search for solutions by three objectives, which aims at minimizing the violation of the structure of the revised metamodel, the number of changes applied to the initial artifact, and the loss of information. Then, the framework is able to recommend an appropriate subset of co-evolution solutions, with the possibility of integrating the user in the loop to provide feedback and update the recommended changes. We validated our generic framework using three metamodel co-evolution cases, models, transformation rules, and OCL constraints, on sets of real-world data. The evaluation results show that our approach is effective in terms of correctness and usefulness as compared to the state-of-the-art co-evolution approaches.

Keyphrases: Search-based Software Engineering, Software Evolution, Model Driven Engineering, Multi-Objective Optimization
From examples to knowledge in model-driven engineering : a holistic and pragmatic approach

Model-Driven Engineering (MDE) is a software development approach that proposes to raise the level of abstraction of languages in order to shift the design and understanding effort from a programmer point of view to the one of decision makers. However, the manipulation of these abstract representations, or models, has become so complex that traditional techniques are not enough to automate its inherent tasks. For its part, the Search-Based Software Engineering (SBSE) proposes to reformulate the automation of MDE tasks as optimization problems. Once reformulated, the problem will be solved by metaheuristic algorithms. With a plethora of studies on the subject, the power of automation of SBSE has been well established. Based on this observation, the Example-Based MDE community (EB-MDE) started using application examples to feed the reformulation into SBSE of the MDE task learning problem. In this context, the concordance of the output of the solutions with the examples becomes an effective barometer for evaluating the ability of a solution to solve a task. This measure has proved to be a semantic goal of choice to guide the metaheuristic search for solutions. However, while it is commonly accepted that the representativeness of the examples has an impact on the generalizability of the solutions, the study of this impact suffers from a flagrant lack of consideration. In this thesis, we propose a thorough formulation of the learning process in an MDE context including a complete methodology to characterize and evaluate the relation that exists between two important properties of the examples, their size and coverage, and the generalizability of the solutions. We perform an empirical analysis, and propose a detailed plan for further investigation of the concept of representativeness, or of other representativities.

Keyphrases: Software engineering, Model-driven engineering, Search based software engineering, Learning from examples, Generalization and representativeness, Machine learning, Aritficial intelligence