Translation of polarity cues into asymmetric spindle positioning in "Caenorhabditis elegans"

Abstract: Asymmetric cell division is important to generate tissue diversity. The Caenorhabditis elegans embryo is well suited to study the mechanisms of asymmetric cell division. In wild type one-cell stage embryos, the spindle sets up along the anterior-posterior axis (AP). During anaphase, the spindle elongates. While the anterior spindle pole is relatively immobile, the posterior spindle pole moves towards the posterior cortex during anaphase leading to an asymmetric spindle position. As a result, the first cleavage gives rise to a large anterior blastomere and a smaller posterior one, which differs also in cell fate determinants. This posterior spindle displacement occurs in response to polarity cues set up along the AP axis by the PAR proteins and is due to imbalanced pulling forces acting on the two spindle poles, with net forces acting on the posterior spindle pole being more extensive than those at the anterior one. The project of my thesis was to characterize the involvement of two new components, gpr-1 and gpr-2, in spindle positioning. These genes encode essentially identical proteins containing a GoLoco motif characteristic of proteins interacting with α subunits of heterotrimeric G protein (Gα). In gpr-1/2(RNAi) embryos and in embryos lacking simultaneously two α subunits, goa-1 and gpa-16, (Ga(RNAi) embryos), there is a minimal posterior displacement of the spindle during anaphase, and the first division is equal. I found that the pulling forces acting on the two spindle poles is weak and equal in gpr-1/2(RNAi) and Gα (RNAi) embryos. I found that GPR-1/2 acts downstream of polarity cues for generation of pulling forces. Furthermore, I showed that GPR-1/2 distribution was enriched at the posterior cortex during metaphase whereas GOA-1 and GPA-16 were uniformly distributed at the cell cortex throughout the cell cycle. Gα subunits oscillate between GDP- and GTP-bound forms. Gα signaling is turned on by GDP/GTP exchange catalyzed by guanine nucleotide exchange factors (GEFs) and turned off by hydrolysis of GTP catalyzed by GTPase activating proteins (GAPs). A third class of proteins, the guanine dissociation inhibitors (GDIs), binds the GDP-bound form of Gα subunits and inhibits nucleotide exchange. I found that GPR-1/2 acts as a GDI for GOA-1. Taken together, my findings suggest a model in which differential activation of Gα subunits along the AP axis may translate into generation of differential pulling forces on the anterior and posterior spindle poles, and, thus, asymmetric cell division. Résumé L'embryon du nématode Caenorhabditis elegans est un modèle approprié pour étudier les mécanismes de la division asymétrique. Chez l'embryon précoce, le fuseau mitotique se forme le long de l'axe antéro-postérieur (A/P) et au centre de l'embryon, le pôle antérieur restant relativement immobile alors que le pôle postérieur du fuseau se déplace vers le cortex postérieur au cours de l'anaphase conduisant à une position excentrée du fuseau. 11 en résulte une première division qui génère un blastomère antérieur et postérieur de grande et petite taille respectivement et qui diffèrent en facteurs développementaux. Ce déplacement postérieur se produit en réponse de la polarité établie par la distribution polarisée des protéines PAR et est le résultat de la génération de forces inégales tirant sur les deux pôles du fuseau, les forces agissant sur le pôle postérieur du fuseau étant plus grandes. Le projet de ma thèse était d'identifier la fonction de deux nouveaux constituants, gpr-1 et gpr-2 dans le positionnement asymétrique du fuseau. Ces gènes codent essentiellement pour la même protéine qui contient un motif GoLoco, caractéristique des protéines interagissant avec la sous-unité alpha des protéines G hétérotrimériques. Chez l'embryon gpr-1/2(RNAi) et chez les embryons dépourvus d'activité de deux sous-unités alpha, goa-1 et gpa-16, (Gα(RNAi)), j'ai montré qu'il y avait un déplacement minimal du fuseau vers le pôle postérieur au cours de l'anaphase et la première division est symétrique en raison de forces faibles et égales agissant sur les deux pôles du fuseau. J'ai également montré que gpr-1/2 était requis en aval des signaux établissant la polarité pour générer les forces responsables du positionnement asymétrique du fuseau. De plus, j'ai montré que GPR-1/2 était enrichi au pôle postérieur lors de la métaphase alors que GOA-1 et GPA-16 étaient localisés de façon uniforme au cortex de l'embryon précoce. Gas oscillent entre une forme liée au GDP et une forme liée au GTP. La signalisation des Gas est activée par l'échange GDP/GTP qui est catalysé par des protéines GEFs. La signalisation des Gas est désactivée par l'hydrolyse du GTP qui est catalysée par des protéines GAPs. Une troisième classe de protéines, GDIs lie la forme GDP et inhibe l'échange de nucléotides. J'ai montré que GPR-1/2 agissait comme un GDI pour GOA-1. Mes résultats suggèrent un modèle dans lequel une activation différentielle des Gα le long de l'axe A/P pourrait générer des forces différentielles sur le pôle antérieur et postérieur du fuseau.

Modules d'endo-permutation

Dans la th´eorie des repr´esentations modulaires des groupes finis, les modules d?endo-permutation occupent une place importante. En e_et, c?est le r?ole jou´e par ces modules dans l?analyse de la structure de certains modules simples pour des groupes finis p-nilpotents, qui a amen´e E. Dade `a en introduire le concept, en 1978. Quelques ann´ees plus tard, L. Puig a d´emontr´e que la source de n?importe quel module simple pour un groupe fini p-r´esoluble quelconque est un module d?endo-permutation. Plus r´ecemment, on s?est rendu compte que ces modules interviennent aussi dans l?analyse locale des cat´egories d´eriv´ees et dans l?´etude des syst`emes de fusion. La situation que l?on consid`ere est la suivante. On se donne un nombre premier p, un p-groupe fini P, un corps alg´ebriquement clos k de caract´eristique p et on veut d´eterminer tous les kP-modules d?endo-permutation couverts ind´ecomposables de type fini, c?est-`a-dire tous les kP-modules ind´ecomposables de type fini, tels que leur alg`ebre d?endomorphismes est un kP-module de permutation ayant un facteur direct trivial. On d´efinit une relation d?´equivalence sur l?ensemble de ces kP-modules et le produit tensoriel des modules induit une structure de groupe ab´elien sur l?ensemble des classes d?´equivalence. On appelle ce groupe, le groupe de Dade de P. Ainsi, classifier les modules d?endo-permutation couverts revient `a d´eterminer le groupe de Dade de P. Le groupe de Dade d?un p-groupe fini arbitraire est encore inconnu, bien qu?E. Dade, en 1978, ´etait d´ej`a parvenu `a la classification dans le cas o`u P est ab´elien. La premi`ere partie de ce travail de th`ese est consacr´ee au probl`eme de la classification dans le cas g´en´eral et r´esoud la question dans le cas de deux familles de p-groupes finis, `a savoir celle des p-groupes m´etacycliques, pour un nombre premier p impair, et celle des 2-groupes extrasp´eciaux, de la forme D8 _ · · · _ D8. Ces deux choix ont ´et´e motiv´es par le fait que ces groupes sont "presque" ab´eliens. De plus, certains r´esultats sur la structure du groupe de Dade d?un p-groupe fini quelconque rendent le groupe de Dade des groupes de ces deux familles plus simple `a ´etudier. Dans un deuxi`eme temps, nous nous sommes int´eress´es `a deux occurrences de ces modules dans la th´eorie de la repr´esentation des groupes finis, c?est-`a-dire `a deux raisons qui motivent leur ´etude. Ainsi, nous avons r´ealis´e des modules d?endo-permutation comme sources de modules simples. En particulier, il s?av`ere que, dans le cas d?un nombre premier p impair, tout module d?endo-permutation ind´ecomposable dont la classe est un ´el´ement de torsion dans le groupe de Dade est la source d?un module simple. Finalement, nous avons d´etermin´e, parmi tous les modules d?endo-permutation connus actuellement, lesquels poss`edent une r´esolution de permutation endo-scind´ee. Nous sommes arriv´es `a la conclusion que les seuls modules d?endo-permutation qui n?ont pas de r´esolution de permutation endo-scind´ee sont les modules "exceptionnels" apparaissant pour un 2-groupe de quaternions g´en´eralis´es.<br/><br/>In modular representation theory, endo-permutation modules occupy an important position. Indeed, the role that these modules play, in the analysis of the structure of some particular simple modules for finite p-nilpotent groups, induced E. Dade, in 1978, to give them their current name. A few years later, L. Puig proved that the source of any simple module for any finite psolvable group is an endo-permutation module. More recently, the occurrence of endo-permutation modules has also been noticed in the local analysis of splendid equivalences between derived categories and in the study of fusion systems. We consider the following situation. Given a prime number p, a finite pgroup P and an algebraically closed field k of characteristic p, we are looking for all finitely generated indecomposable capped endo-permutation kP-modules. That is, all finitely generated indecomposable kP-modules such that their endomorphism algebra is a permutation kP-module having a trivial direct summand. Then, we define an equivalence relation on the set of all isomorphism classes of such modules, and it turns out that the tensor product (over k) induces a structure of abelian group on this set. We call this group the Dade group of P. Hence, classifying all indecomposable finitely generated capped endo-permutation kPmodules is equivalent to determining the Dade group of P. At present, the Dade group of an arbitrary finite p-group is still unknown. However, E. Dade computed the Dade group of all finite abelian p-groups, in 1978 already. The first part of this doctoral thesis is concerned with the problem of the classification in the general case and solve it in the case of two families of finite p-groups, namely the metacyclic p-groups, for an odd prime number p, and the extraspecial 2-groups of the shape D8 _· · ·_D8. These two choices have been motivated by the fact that these groups are not far from being abelian. Moreover, some general results concerning the Dade group of arbitrary finite p-groups suggest that the Dade group of the groups belonging to these two families is easier to study. In the second part of this thesis, we have been looking at two particular occurrences of these modules in representation theory of finite groups which motivate the interest of their classification. Thus, we realised endo-permutation modules as sources of simple modules. In particular, it turns out that, in case p is an odd prime, any indecomposable module whose class in the Dade group is a torsion element is the source of some simple module. Finally, we considered all the modules we know at present and determined which ones have an endo-split permutation resolution. We could then conclude that all but the "exceptionnal" modules occurring in the generalized quaternion case have an endo-split permutation resolution.<br/><br/>"Module d?endo-permutation" n?est pas le nom d?une maladie exotique contagieuse (du moins pas `a ma connaissance), comme vous pourriez peut-?etre l?imaginer si vous faites partie des personnes qui croient que le titre de docteur n?est destin´e qu?aux m´edecins. Dans ce cas, il se peut que le sujet dont il est question ici vous cause quelques naus´ees et r´eveille de douloureux souvenirs d?´ecole, car un module d?endo-permutation est un objet math´ematique, alg´ebrique, plus pr´ecis´ement. Ce concept a ´et´e introduit il y a un quart de si`ecle, de l?autre c?ot´e de l?Atlantique, et il s?est r´ev´el´e su_samment int´eressant pour qu?aujourd?hui il ait franchi bien des fronti`eres, celles de l?alg`ebre y compris. Mais de quoi s?agit-il ? Si vous entendez le terme "endo-permutation" probablement pour la premi`ere fois, ce n?est certainement pas le cas pour celui de "module". Cependant, sa d´efinition dans le pr´esent contexte ne co¨ýncide avec aucune de celles figurant dans les dictionnaires ordinaires. Les personnes qui ont d´ej`a entendu parler de Frobenius, Burnside, Schur, ou encore Brauer, pourront vous dire qu?un module est une repr´esentation. "De quoi ?" vous demanderezvous. "Un spectacle de marionnettes, peut-?etre ?" Bien s?ur que non ! Un module d?endo-permutation est une repr´esentation particuli`ere de certains groupes finis, o`u un groupe n?est pas un groupe de rock, comme vous pouvez vous en douter, mais d´esigne un objet math´ematique connu par tous les ´etudiants en sciences au terme de leur premi`ere ann´ee universitaire (en th´eorie, du moins). La "popularit´e" de la notion de groupe, fini ou non, est due au fait que les groupes sont fr´equemment utilis´es, aussi bien dans le domaine abstrait des math´ematiques, que dans le monde r´eel des physiciens, chimistes et autres biologistes (pour ne citer qu?eux). "Mais comment peut-on utiliser concr`etement ces objets invisibles ?" vous demanderez-vous alors. Et bien, justement, en les consid´erant par l?interm´ediaire de leurs repr´esentations, c?est-`a-dire en leur associant des matrices, de fa¸con plus ou moins naturelle. Or, comme il y a "beaucoup trop" de matrices pour un groupe donn´e, elles sont classifi´ees selon certaines de leurs propri´et´es, ce qui permet de les r´epertorier dans diverses familles (celle des modules d?endo-permutation, par exemple). Un groupe est ainsi rendu "concret", car les donn´ees matricielles sont manipulables par tous les scienti- fiques (et leurs ordinateurs), qui peuvent alors les utiliser dans leurs recherches, afin de contribuer au progr`es de la science. En toute franchise, c?est bien loin de ces soucis terre-`a-terre que ce travail de th`ese sur la classification des modules d?endo-permutation a ´et´e accompli. En fait, quitte `a choquer certaines ?ames sensibles, sa r´ealisation est surtout due au caract`ere ´epicure de son auteur, qui, avouons-le, en a ´et´e pleinement satisfait !

Selecting Wavelet Filter for Compression of Spectra from Multispectral Images

The problem of selecting anappropriate wavelet filter is always present in signal compression based on thewavelet transform. In this report, we propose a method to select a wavelet filter from a predefined set of filters for the compression of spectra from a multispectral image. The wavelet filter selection is based on the Learning Vector Quantization (LVQ). In the training phase for the test images, the best wavelet filter for each spectrum has been found by a careful compression-decompression evaluation. Certain spectral features are used in characterizing the pixel spectra. The LVQ is used to form the best wavelet filter class for different types of spectra from multispectral images. When a new image is to be compressed, a set of spectra from that image is selected, the spectra are classified by the trained LVQand the filter associated to the largest class is selected for the compression of every spectrum from the multispectral image. The results show, that almost inevery case our method finds the most suitable wavelet filter from the pre-defined set for the compression.

Supervised localimage feature detection

This thesis is about detection of local image features. The research topic belongs to the wider area of object detection, which is a machine vision and pattern recognition problem where an object must be detected (located) in an image. State-of-the-art object detection methods often divide the problem into separate interest point detection and local image description steps, but in this thesis a different technique is used, leading to higher quality image features which enable more precise localization. Instead of using interest point detection the landmark positions are marked manually. Therefore, the quality of the image features is not limited by the interest point detection phase and the learning of image features is simplified. The approach combines both interest point detection and local description into one phase for detection. Computational efficiency of the descriptor is therefore important, leaving out many of the commonly used descriptors as unsuitably heavy. Multiresolution Gabor features has been the main descriptor in this thesis and improving their efficiency is a significant part. Actual image features are formed from descriptors by using a classifierwhich can then recognize similar looking patches in new images. The main classifier is based on Gaussian mixture models. Classifiers are used in one-class classifier configuration where there are only positive training samples without explicit background class. The local image feature detection method has been tested with two freely available face detection databases and a proprietary license plate database. The localization performance was very good in these experiments. Other applications applying the same under-lying techniques are also presented, including object categorization and fault detection.

Patents in the Information and Communications Technology Sector - Development Trends, Problem Areas and Pressures for Change

The patent system was created for the purpose of promoting innovation by granting the inventors a legally defined right to exclude others in return for public disclosure. Today, patents are being applied and granted in greater numbers than ever, particularly in new areas such as biotechnology and information andcommunications technology (ICT), in which research and development (R&D) investments are also high. At the same time, the patent system has been heavily criticized. It has been claimed that it discourages rather than encourages the introduction of new products and processes, particularly in areas that develop quickly, lack one-product-one-patent correlation, and in which theemergence of patent thickets is characteristic. A further concern, which is particularly acute in the U.S., is the granting of so-called 'bad patents', i.e. patents that do not factually fulfil the patentability criteria. From the perspective of technology-intensive companies, patents could,irrespective of the above, be described as the most significant intellectual property right (IPR), having the potential of being used to protect products and processes from imitation, to limit competitors' freedom-to-operate, to provide such freedom to the company in question, and to exchange ideas with others. In fact, patents define the boundaries of ownership in relation to certain technologies. They may be sold or licensed on their ownor they may be components of all sorts of technology acquisition and licensing arrangements. Moreover, with the possibility of patenting business-method inventions in the U.S., patents are becoming increasingly important for companies basing their businesses on services. The value of patents is dependent on the value of the invention it claims, and how it is commercialized. Thus, most of them are worth very little, and most inventions are not worth patenting: it may be possible to protect them in other ways, and the costs of protection may exceed the benefits. Moreover, instead of making all inventions proprietary and seeking to appropriate as highreturns on investments as possible through patent enforcement, it is sometimes better to allow some of them to be disseminated freely in order to maximize market penetration. In fact, the ideology of openness is well established in the software sector, which has been the breeding ground for the open-source movement, for instance. Furthermore, industries, such as ICT, that benefit from network effects do not shun the idea of setting open standards or opening up their proprietary interfaces to allow everyone todesign products and services that are interoperable with theirs. The problem is that even though patents do not, strictly speaking, prevent access to protected technologies, they have the potential of doing so, and conflicts of interest are not rare. The primary aim of this dissertation is to increase understanding of the dynamics and controversies of the U.S. and European patent systems, with the focus on the ICT sector. The study consists of three parts. The first part introduces the research topic and the overall results of the dissertation. The second part comprises a publication in which academic, political, legal and business developments that concern software and business-method patents are investigated, and contentiousareas are identified. The third part examines the problems with patents and open standards both of which carry significant economic weight inthe ICT sector. Here, the focus is on so-called submarine patents, i.e. patentsthat remain unnoticed during the standardization process and then emerge after the standard has been set. The factors that contribute to the problems are documented and the practical and juridical options for alleviating them are assessed. In total, the dissertation provides a good overview of the challenges and pressures for change the patent system is facing,and of how these challenges are reflected in standard setting.

A Sequential Allocation Problem: The Asymptotic Distribution of Resources

In this paper we consider a sequential allocation problem with n individuals. The first individual can consume any amount of some endowment leaving the remaining for the second individual, and so on. Motivated by the limitations associated with the cooperative or non-cooperative solutions we propose a new approach. We establish some axioms that should be satisfied, representativeness, impartiality, etc. The result is a unique asymptotic allocation rule. It is shown for n = 2; 3; 4; and a claim is made for general n. We show that it satisfies a set of desirable properties. Key words: Sequential allocation rule, River sharing problem, Cooperative and non-cooperative games, Dictator and ultimatum games. JEL classification: C79, D63, D74.

The global carbon budget:a conflicting claims problem

Despite global environmental governance has traditionally couched global warming in terms of annual CO2 emissions (a flow), global mean temperature is actually determined by cumulative CO2 emissions in the atmosphere (a stock). Thanks to advances of scientific community, nowadays it is possible to quantify the \global carbon budget", that is, the amount of available cumulative CO2 emissions before crossing the 2oC threshold (Meinshausen et al., 2009). The current approach proposes to analyze the allocation of such global carbon budget among countries as a classical conflicting claims problem (O'Neill, 1982). Based on some appealing principles, it is proposed an efficient and sustainable allocation of the available carbon budget from 2000 to 2050 taking into account different environmental risk scenarios. Keywords: Carbon budget, Conflicting claims problem, Distribution, Climate change. JEL classification: C79, D71, D74, H41, H87, Q50, Q54, Q58.

Weierstrass integrability of differential equations

The integrability problem consists in finding the class of functions a first integral of a given planar polynomial differential system must belong to. We recall the characterization of systems which admit an elementary or Liouvillian first integral. We define {\it Weierstrass integrability} and we determine which Weierstrass integrable systems are Liouvillian integrable. Inside this new class of integrable systems there are non--Liouvillian integrable systems.

Cyclicity versus center problem

We prove that there are one-parameter families of planar differential equations for which the center problem has a trivial solution and on the other hand the cyclicity of the weak focus is arbitrarily high. We illustrate this phenomenon in several examples for which this cyclicity is computed.

Steady-state global optimization of metabolic non-linear dynamic models through recasting into power-law canonical models

Background: Design of newly engineered microbial strains for biotechnological purposes would greatly benefit from the development of realistic mathematical models for the processes to be optimized. Such models can then be analyzed and, with the development and application of appropriate optimization techniques, one could identify the modifications that need to be made to the organism in order to achieve the desired biotechnological goal. As appropriate models to perform such an analysis are necessarily non-linear and typically non-convex, finding their global optimum is a challenging task. Canonical modeling techniques, such as Generalized Mass Action (GMA) models based on the power-law formalism, offer a possible solution to this problem because they have a mathematical structure that enables the development of specific algorithms for global optimization. Results: Based on the GMA canonical representation, we have developed in previous works a highly efficient optimization algorithm and a set of related strategies for understanding the evolution of adaptive responses in cellular metabolism. Here, we explore the possibility of recasting kinetic non-linear models into an equivalent GMA model, so that global optimization on the recast GMA model can be performed. With this technique, optimization is greatly facilitated and the results are transposable to the original non-linear problem. This procedure is straightforward for a particular class of non-linear models known as Saturable and Cooperative (SC) models that extend the power-law formalism to deal with saturation and cooperativity. Conclusions: Our results show that recasting non-linear kinetic models into GMA models is indeed an appropriate strategy that helps overcoming some of the numerical difficulties that arise during the global optimization task.

Improving Information Problem Solving skills in Secondary Education through embedded instruction

This empirical study consists in an investigation of the effects, on the development of Information Problem Solving (IPS) skills, of a long-term embedded, structured and supported instruction in Secondary Education. Forty secondary students of 7th and 8th grades (13–15 years old) participated in the 2-year IPS instruction designed in this study. Twenty of them participated in the IPS instruction, and the remaining twenty were the control group. All the students were pre- and post-tested in their regular classrooms, and their IPS process and performance were logged by means of screen capture software, to warrant their ecological validity. The IPS constituent skills, the web search sub-skills and the answers given by each participant were analyzed. The main findings of our study suggested that experimental students showed a more expert pattern than the control students regarding the constituent skill ‘defining the problem’ and the following two web search sub-skills: ‘search terms’ typed in a search engine, and ‘selected results’ from a SERP. In addition, scores of task performance were statistically better in experimental students than in control group students. The paper contributes to the discussion of how well-designed and well-embedded scaffolds could be designed in instructional programs in order to guarantee the development and efficiency of the students’ IPS skills by using net information better and participating fully in the global knowledge society.

The impact of balancing on problem hardness in a highly structured domain

Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in ourunderstanding of problem hardness, beyond standard worst-case complexity. We consider random problem distributions from a highly structured problem domain that generalizes the Quasigroup Completion problem (QCP) and Quasigroup with Holes (QWH), a widely used domain that captures the structure underlying a range of real-world applications. Our problem domain is also a generalization of the well-known Sudoku puz- zle: we consider Sudoku instances of arbitrary order, with the additional generalization that the block regions can have rectangular shape, in addition to the standard square shape. We evaluate the computational hardness of Generalized Sudoku instances, for different parameter settings. Our experimental hardness results show that we can generate instances that are considerably harder than QCP/QWH instances of the same size. More interestingly, we show the impact of different balancing strategies on problem hardness. We also provide insights into backbone variables in Generalized Sudoku instances and how they correlate to problem hardness.