Remarks on the normal bordism forgetful homomorphism

Assume that X is an oriented smooth (n+k)-manifold. Then the kernel of the forgetful map F considered in this work consists of immersions f: Mn → X nullbordant as a continuous map. Using an exact sequence of normal bordism groups previously given, we present a homological characterization of the kernel of the forgetful map F. Also, we prove that Ωi(X, εs - ηs and Hi(X,Z) are -isomorphic for i≤3 and C2-isomorphic for i≤2, where C2,3 (resp. C2 is the class of abelian groups whose elements have order 2p. 3q (resp. 2p), and ηs is an orientable stable vector bundle over X. © 2009 Pushpa Publishing House.

Canonical solution groups of a homomorphism : manipulator kinematics, nonparametric regression and distributed object systems

The kinematic mapping of a rigid open-link manipulator is a homomorphism between Lie groups. The homomorphisrn has solution groups that act on an inverse kinematic solution element. A canonical representation of solution group operators that act on a solution element of three and seven degree-of-freedom (do!) dextrous manipulators is determined by geometric analysis. Seven canonical solution groups are determined for the seven do! Robotics Research K-1207 and Hollerbach arms. The solution element of a dextrous manipulator is a collection of trivial fibre bundles with solution fibres homotopic to the Torus. If fibre solutions are parameterised by a scalar, a direct inverse funct.ion that maps the scalar and Cartesian base space coordinates to solution element fibre coordinates may be defined. A direct inverse pararneterisation of a solution element may be approximated by a local linear map generated by an inverse augmented Jacobian correction of a linear interpolation. The action of canonical solution group operators on a local linear approximation of the solution element of inverse kinematics of dextrous manipulators generates cyclical solutions. The solution representation is proposed as a model of inverse kinematic transformations in primate nervous systems. Simultaneous calibration of a composition of stereo-camera and manipulator kinematic models is under-determined by equi-output parameter groups in the composition of stereo-camera and Denavit Hartenberg (DH) rnodels. An error measure for simultaneous calibration of a composition of models is derived and parameter subsets with no equi-output groups are determined by numerical experiments to simultaneously calibrate the composition of homogeneous or pan-tilt stereo-camera with DH models. For acceleration of exact Newton second-order re-calibration of DH parameters after a sequential calibration of stereo-camera and DH parameters, an optimal numerical evaluation of DH matrix first order and second order error derivatives with respect to a re-calibration error function is derived, implemented and tested. A distributed object environment for point and click image-based tele-command of manipulators and stereo-cameras is specified and implemented that supports rapid prototyping of numerical experiments in distributed system control. The environment is validated by a hierarchical k-fold cross validated calibration to Cartesian space of a radial basis function regression correction of an affine stereo model. Basic design and performance requirements are defined for scalable virtual micro-kernels that broker inter-Java-virtual-machine remote method invocations between components of secure manageable fault-tolerant open distributed agile Total Quality Managed ISO 9000+ conformant Just in Time manufacturing systems.

On super-RS algebra and Drinfeld realization of quantum affine superalgebras

We describe the realization of the super-Reshetikhin-Semenov-Tian-Shansky (RS) algebra in quantum affine superalgebras, thus generalizing the approach of Frenkel and Reshetikhin to the supersymmetric (and twisted) case. The algebraic homomorphism between the super-RS algebra and the Drinfeld current realization of quantum affine superalgebras is established by using the Gauss decomposition technique of Ding and Frenkel. As an application, we obtain Drinfeld realization of quantum affine superalgebra U-q [osp(1/2)((1))] and its degeneration - central extended super-Yangian double DY(h over bar) [osp(1/2)((1))].

The idempotent-separating degree of a block-group

Semigroup Forum, nº76 (2008), pg.579-583

Cryptic recombination in the ever-young sex chromosomes of Hylid frogs.

Sex chromosomes are expected to evolve suppressed recombination, which leads to degeneration of the Y and heteromorphism between the X and Y. Some sex chromosomes remain homomorphic, however, and the factors that prevent degeneration of the Y in these cases are not well understood. The homomorphic sex chromosomes of the European tree frogs (Hyla spp.) present an interesting paradox. Recombination in males has never been observed in crossing experiments, but molecular data are suggestive of occasional recombination between the X and Y. The hypothesis that these sex chromosomes recombine has not been tested statistically, however, nor has the X-Y recombination rate been estimated. Here, we use approximate Bayesian computation coupled with coalescent simulations of sex chromosomes to quantify X-Y recombination rate from existent data. We find that microsatellite data from H. arborea, H. intermedia and H. molleri support a recombination rate between X and Y that is significantly different from zero. We estimate that rate to be approximately 10(5) times smaller than that between X chromosomes. Our findings support the notion that very low recombination rate may be sufficient to maintain homomorphism in sex chromosomes.

Models, truth and realism: assessing Bas van Fraassen's views on scientific representation

This paper is devoted to an analysis of some aspects of Bas van Fraassen's views on representation. While I agree with most of his claims, I disagree on the following three issues. Firstly, I contend that some isomorphism (or at least homomorphism) between the representor and what is represented is a universal necessary condition for the success of any representation, even in the case of misrepresentation. Secondly, I argue that the so-called "semantic" or "model-theoretic" construal of theories does not give proper due to the role played by true propositions in successful representing practices. Thirdly, I attempt to show that the force of van Fraassen's pragmatic - and antirealist - "dissolution" of the "loss of reality objection" loses its bite when we realize that our cognitive contact with real phenomena is achieved not by representing but by expressing true propositions about them.

Complexité des homomorphismes de graphes avec listes

Les problèmes de satisfaction de contraintes, qui consistent à attribuer des valeurs à des variables en respectant un ensemble de contraintes, constituent une large classe de problèmes naturels. Pour étudier la complexité de ces problèmes, il est commode de les voir comme des problèmes d'homomorphismes vers des structures relationnelles. Un axe de recherche actuel est la caractérisation des classes de complexité auxquelles appartient le problème d'homomorphisme, ceci dans la perspective de confirmer des conjectures reliant les propriétés algébriques des structures relationelles à la complexité du problème d'homomorphisme. Cette thèse propose dans un premier temps la caractérisation des digraphes pour lesquels le problème d'homomorphisme avec listes appartient à FO. On montre également que dans le cas du problèmes d'homomorphisme avec listes sur les digraphes télescopiques, les conjectures reliant algèbre et complexité sont confirmées. Dans un deuxième temps, on caractérise les graphes pour lesquels le problème d'homomorphisme avec listes est résoluble par cohérence d'arc. On introduit la notion de polymorphisme monochromatique et on propose un algorithme simple qui résoud le problème d'homomorphisme avec listes si le graphe cible admet un polymorphisme monochromatique TSI d'arité k pour tout k ≥ 2.

Amplification de l'amplitude : analyse et applications

Ce mémoire étudie l'algorithme d'amplification de l'amplitude et ses applications dans le domaine de test de propriété. On utilise l'amplification de l'amplitude pour proposer le plus efficace algorithme quantique à ce jour qui teste la linéarité de fonctions booléennes et on généralise notre nouvel algorithme pour tester si une fonction entre deux groupes abéliens finis est un homomorphisme. Le meilleur algorithme quantique connu qui teste la symétrie de fonctions booléennes est aussi amélioré et l'on utilise ce nouvel algorithme pour tester la quasi-symétrie de fonctions booléennes. Par la suite, on approfondit l'étude du nombre de requêtes à la boîte noire que fait l'algorithme d'amplification de l'amplitude pour amplitude initiale inconnue. Une description rigoureuse de la variable aléatoire représentant ce nombre est présentée, suivie du résultat précédemment connue de la borne supérieure sur l'espérance. Suivent de nouveaux résultats sur la variance de cette variable. Il est notamment montré que, dans le cas général, la variance est infinie, mais nous montrons aussi que, pour un choix approprié de paramètres, elle devient bornée supérieurement.

Exam 1999 pdf

Exam questions and solutions in PDF

Exam 1999

Exam questions and solutions in LaTex

Exam 2000 pdf

Exam questions and solutions in PDF

Exam 2000

Exam questions and solutions in LaTex

Exam 2001 pdf

Exam questions and solutions in PDF

Exam 1998

Exam questions and solutions in LaTex

Exam 2001

Exam questions and solutions in LaTex