924 resultados para Modular reasoning
Resumo:
La complexitat de disseny d’agents mòbils creix a mesura que s’incrementen les seves funcionalitats. Aquest projecte proposa enfocar el problema des d’un punt de vista modular. S’ha realitzat un estudi tant dels propis agents com de les parts que ho integren. De la mateixa forma, s’han establert i s'han implementat els mecanismes necessaris per habilitar les comunicacions segures entre agents. Finalment, s’han desenvolupat dos components que ofereixen les funcionalitats de seguiment de l’agent mòbil i la recuperació dels resultats generats. El desenvolupament d’agents basats en components tracta d’aplicar la vella estratègia "divideix i venceràs" a la fase de disseny, reduint, així,la seva gran complexitat.
Resumo:
Three exceptional modular invariants of SU(4) exist at levels 4, 6 and 8. They can be obtained from appropriate conformal embeddings and the corresponding graphs have self-fusion. From these embeddings, or from their associated modular invariants, we determine the algebras of quantum symmetries, obtain their generators,and, as a by-product, recover the known graphs E4, E6 and E8 describing exceptional quantum subgroups of type SU(4). We also obtain characteristic numbers (quantum cardinalities, dimensions) for each of them and for their associated quantum groupoïds.
Resumo:
Projecte de recerca elaborat a partir d’una estada a la University of Nottingham, Gran Bretanya, entre març i abril del 2007. Aquest treball s’ha centrat en l’aplicació de compostos derivats de la D-(+)-glucosa, de la D-(+)-fructosa i la D-galactosa com a lligands de catalitzadors homogenis quirals en dos reaccions asimètriques: addició 1,2 a aldehids catalitzada per níquel i addició 1,4 conjugada catalitzada per coure.(veure figura adjunta al final del document). En primer lloc, s’ha estudiat l’aplicació dels compostos L1-L6 a les reaccions d’addició 1,2 a aldehids catalitzades per níquel. S’ha observat que la selectivitat del procés depèn principalment del grup funcional unit a l’esquelet del lligand, de les propietats estèriques del substituent en la funció oxazolina i de l’estructura del substrat. S’ha obtingut fins a un 59% d’excés enantiomèric utilitzant el precursor de catalitzador que conté el lligand L3a. En segon lloc, aquest treball descriu l’aplicació de les tres famílies de compostos (L1-L11) com a lligands en la reacció d’addició 1,4 catalitzada per coure de compostos organometàl•lics a diferents enones amb diferents propietats estèriques. L’ús de les llibreries de compostos fosfit-oxazolina (L1-L5) i fosfit-fosforamidit (L6) han proporcionat bones enantioselectivitats (fins a 80%) en l’addició de reactius de trialquilalumini a diferents enones. En canvi, la llibreria de compostos monofosfit (L7-L11) ha mostrat bones activitats però enantioselectivitats fins a 57%.
Resumo:
Game theory describes and analyzes strategic interaction. It is usually distinguished between static games, which are strategic situations in which the players choose only once as well as simultaneously, and dynamic games, which are strategic situations involving sequential choices. In addition, dynamic games can be further classified according to perfect and imperfect information. Indeed, a dynamic game is said to exhibit perfect information, whenever at any point of the game every player has full informational access to all choices that have been conducted so far. However, in the case of imperfect information some players are not fully informed about some choices. Game-theoretic analysis proceeds in two steps. Firstly, games are modelled by so-called form structures which extract and formalize the significant parts of the underlying strategic interaction. The basic and most commonly used models of games are the normal form, which rather sparsely describes a game merely in terms of the players' strategy sets and utilities, and the extensive form, which models a game in a more detailed way as a tree. In fact, it is standard to formalize static games with the normal form and dynamic games with the extensive form. Secondly, solution concepts are developed to solve models of games in the sense of identifying the choices that should be taken by rational players. Indeed, the ultimate objective of the classical approach to game theory, which is of normative character, is the development of a solution concept that is capable of identifying a unique choice for every player in an arbitrary game. However, given the large variety of games, it is not at all certain whether it is possible to device a solution concept with such universal capability. Alternatively, interactive epistemology provides an epistemic approach to game theory of descriptive character. This rather recent discipline analyzes the relation between knowledge, belief and choice of game-playing agents in an epistemic framework. The description of the players' choices in a given game relative to various epistemic assumptions constitutes the fundamental problem addressed by an epistemic approach to game theory. In a general sense, the objective of interactive epistemology consists in characterizing existing game-theoretic solution concepts in terms of epistemic assumptions as well as in proposing novel solution concepts by studying the game-theoretic implications of refined or new epistemic hypotheses. Intuitively, an epistemic model of a game can be interpreted as representing the reasoning of the players. Indeed, before making a decision in a game, the players reason about the game and their respective opponents, given their knowledge and beliefs. Precisely these epistemic mental states on which players base their decisions are explicitly expressible in an epistemic framework. In this PhD thesis, we consider an epistemic approach to game theory from a foundational point of view. In Chapter 1, basic game-theoretic notions as well as Aumann's epistemic framework for games are expounded and illustrated. Also, Aumann's sufficient conditions for backward induction are presented and his conceptual views discussed. In Chapter 2, Aumann's interactive epistemology is conceptually analyzed. In Chapter 3, which is based on joint work with Conrad Heilmann, a three-stage account for dynamic games is introduced and a type-based epistemic model is extended with a notion of agent connectedness. Then, sufficient conditions for backward induction are derived. In Chapter 4, which is based on joint work with Jérémie Cabessa, a topological approach to interactive epistemology is initiated. In particular, the epistemic-topological operator limit knowledge is defined and some implications for games considered. In Chapter 5, which is based on joint work with Jérémie Cabessa and Andrés Perea, Aumann's impossibility theorem on agreeing to disagree is revisited and weakened in the sense that possible contexts are provided in which agents can indeed agree to disagree.
Resumo:
Nou sistema modular basat en materials metàl·lics i compostos, dissenyats específicament per a alt grau d'accessibilitat física, temporal o permanent, a llocs d'accés limitat i per a facilitar la visita durant restauracions, així com les visites quotidianes a través de plataformes de sustentació de paviments
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
Desenvolupament d'innovacions en elements vinculats amb l'accessibilitat física, en concret de sistemes de paviments. Es tracta de sistemes de paviments que permetin el desplaçament segur i accessible en el patrimoni arquitectònic, on és habitual que les irregularitats del sòl impedeixin la mobilitat de persones amb discapacitat.
Resumo:
Nou sistema modular basat en materials metàl·lics i compostos, dissenyats específicament per a alt grau d'accessibilitat física, temporal o permanent, a llocs d'accés limitat i per a facilitar la visita durant restauracions, així com les visites quotidianes a través de plataformes de sustentació de paviments
Resumo:
A review article of the The New England Journal of Medicine refers that almost a century ago, Abraham Flexner, a research scholar at the Carnegie Foundation for the Advancement of Teaching, undertook an assessment of medical education in 155 medical schools in operation in the United States and Canada. Flexner’s report emphasized the nonscientific approach of American medical schools to preparation for the profession, which contrasted with the university-based system of medical education in Germany. At the core of Flexner’s view was the notion that formal analytic reasoning, the kind of thinking integral to the natural sciences, should hold pride of place in the intellectual training of physicians. This idea was pioneered at Harvard University, the University of Michigan, and the University of Pennsylvania in the 1880s, but was most fully expressed in the educational program at Johns Hopkins University, which Flexner regarded as the ideal for medical education. (...)
Resumo:
En aquest projecte s’han unificat les dades de l’empresa Solmania i s’han generat estadístiques i informes a diferents formats mitjançant una aplicació RIA implementada amb Adobe Flex. D’aquesta manera es pot fer un control dels paràmetres clau del negoci per ajudar a la companyia a aconseguir els objectius marcats d’una manera eficient. L’aplicatiu permet analitzar des de diversos punts de vista qualsevol tipus d’informació que genera el negoci i fer-ne comparatives de rendiment.
Resumo:
We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.
Resumo:
High-throughput technologies are now used to generate more than one type of data from the same biological samples. To properly integrate such data, we propose using co-modules, which describe coherent patterns across paired data sets, and conceive several modular methods for their identification. We first test these methods using in silico data, demonstrating that the integrative scheme of our Ping-Pong Algorithm uncovers drug-gene associations more accurately when considering noisy or complex data. Second, we provide an extensive comparative study using the gene-expression and drug-response data from the NCI-60 cell lines. Using information from the DrugBank and the Connectivity Map databases we show that the Ping-Pong Algorithm predicts drug-gene associations significantly better than other methods. Co-modules provide insights into possible mechanisms of action for a wide range of drugs and suggest new targets for therapy
Resumo:
SUMMARY: Large sets of data, such as expression profiles from many samples, require analytic tools to reduce their complexity. The Iterative Signature Algorithm (ISA) is a biclustering algorithm. It was designed to decompose a large set of data into so-called 'modules'. In the context of gene expression data, these modules consist of subsets of genes that exhibit a coherent expression profile only over a subset of microarray experiments. Genes and arrays may be attributed to multiple modules and the level of required coherence can be varied resulting in different 'resolutions' of the modular mapping. In this short note, we introduce two BioConductor software packages written in GNU R: The isa2 package includes an optimized implementation of the ISA and the eisa package provides a convenient interface to run the ISA, visualize its output and put the biclusters into biological context. Potential users of these packages are all R and BioConductor users dealing with tabular (e.g. gene expression) data. AVAILABILITY: http://www.unil.ch/cbg/ISA CONTACT: sven.bergmann@unil.ch