237 resultados para Scrollar Invariants
Resumo:
This article looks at the conditions under which a construction has an own interpretation. Interpreting the first proposal of the type constructions modalisante I think that P is considered. It is shown that these interpretations can be fully explained by parsing of the sequence I think than a subordinated, resulting in a set of undesirable consequences. The ability to handle this sequence as a construction in the theoretical that gives this constructionnelle grammar concept is envisaged to assess the relationships between form, meaning sense, compositionnalité and invariant. Cet article s'intéresse aux conditions suivant lesquelles une construction possède une interprétation qui lui est propre. L'interprétation modalisante de la première proposition des constructions du type Je crois que P est considérée. Il est montré que ces interprétations ne peuvent être pleinement expliquées par l'analyse syntaxique faisant de la séquence Je crois que une subordonnée, qui entraîne un ensemble de conséquences indésirables. La possibilité de traiter cette séquence comme une construction dans le sens théorique que donne à cette notion la Grammaire constructionnelle est envisagée, permettant d'apprécier les rapports entre forme, sens, compositionnalité et invariant.
Resumo:
Pseudoscalar measures of electronic chirality for molecular systems are derived using the spectral moment theory applied to the frequency-dependent rotational susceptibility. In this scheme a one-electron chirality operator κ^ naturally emerges as a quantum counterpart of the triple scalar product, involving velocity, acceleration and second acceleration. Averaging κ^ over an electronic state vector gives rise to an additive chirality invariant (κ-index), considered as a quantitative measure of chirality. A simple computational technique for quick calculation of the κ-index is developed and various structural classes (cyclic hydrocarbons, cage-shaped systems, etc.) are studied. Reasonable behaviour of the chirality index is demonstrated. The chirality changes during the β-turn formation in Leu-Enkephalin is presented as a useful example of the chirality analysis for conformational transitions.
Resumo:
2000 Mathematics Subject Classification: 16R10, 16R30.
Resumo:
2000 Mathematics Subject Classification: Primary 20F55, 13F20; Secondary 14L30.
Resumo:
Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.
Resumo:
10 pages, 5 figures, conference or other essential info Acknowledgments LK and JCS were supported by Blue Brain Project. P.D. and R.L. were supported in part by the Blue Brain Project and by the start-up grant of KH. Partial support for P.D. has been provided by the Advanced Grant of the European Research Council GUDHI (Geometric Understanding in Higher Dimensions). MS was supported by the SNF NCCR ”Synapsy”.
Resumo:
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
The main goal of this thesis is to discuss the determination of homological invariants of polynomial ideals. Thereby we consider different coordinate systems and analyze their meaning for the computation of certain invariants. In particular, we provide an algorithm that transforms any ideal into strongly stable position if char k = 0. With a slight modification, this algorithm can also be used to achieve a stable or quasi-stable position. If our field has positive characteristic, the Borel-fixed position is the maximum we can obtain with our method. Further, we present some applications of Pommaret bases, where we focus on how to directly read off invariants from this basis. In the second half of this dissertation we take a closer look at another homological invariant, namely the (absolute) reduction number. It is a known fact that one immediately receives the reduction number from the basis of the generic initial ideal. However, we show that it is not possible to formulate an algorithm – based on analyzing only the leading ideal – that transforms an ideal into a position, which allows us to directly receive this invariant from the leading ideal. So in general we can not read off the reduction number of a Pommaret basis. This result motivates a deeper investigation of which properties a coordinate system must possess so that we can determine the reduction number easily, i.e. by analyzing the leading ideal. This approach leads to the introduction of some generalized versions of the mentioned stable positions, such as the weakly D-stable or weakly D-minimal stable position. The latter represents a coordinate system that allows to determine the reduction number without any further computations. Finally, we introduce the notion of β-maximal position, which provides lots of interesting algebraic properties. In particular, this position is in combination with weakly D-stable sufficient for the weakly D-minimal stable position and so possesses a connection to the reduction number.
Resumo:
We develop some new techniques to calculate the Schur indicator for self-dual irreducible Langlands quotients of the principal series representations. Using these techniques we derive some new formulas for the Schur indicator and the real-quaternionic indicator. We make progress towards developing an algorithm to decide whether or not two root data are isomorphic. When the derived group has cyclic center, we solve the isomorphism problem completely. An immediate consequence is a clean and precise classification theorem for connected complex reductive groups whose derived groups have cyclic center.
Resumo:
An important aspect of constructing discrete velocity models (DVMs) for the Boltzmann equation is to obtain the right number of collision invariants. It is a well-known fact that DVMs can also have extra collision invariants, so called spurious collision invariants, in plus to the physical ones. A DVM with only physical collision invariants, and so without spurious ones, is called normal. For binary mixtures also the concept of supernormal DVMs was introduced, meaning that in addition to the DVM being normal, the restriction of the DVM to any single species also is normal. Here we introduce generalizations of this concept to DVMs for multicomponent mixtures. We also present some general algorithms for constructing such models and give some concrete examples of such constructions. One of our main results is that for any given number of species, and any given rational mass ratios we can construct a supernormal DVM. The DVMs are constructed in such a way that for half-space problems, as the Milne and Kramers problems, but also nonlinear ones, we obtain similar structures as for the classical discrete Boltzmann equation for one species, and therefore we can apply obtained results for the classical Boltzmann equation.
Resumo:
The theory of numerical invariants for representations can be generalized to measurable cocycles. This provides a natural notion of maximality for cocycles associated to complex hyperbolic lattices with values in groups of Hermitian type. Among maximal cocycles, the class of Zariski dense ones turns out to have a rigid behavior. An alternative implementation of numerical invariants can be given by using equivariant maps at the level of boundaries and by exploiting the Burger-Monod approach to bounded cohomology. Due to their crucial role in this theory, we prove existence results in two different contexts. Precisely, we construct boundary maps for non-elementary cocycles into the isometry group of CAT(0)-spaces of finite telescopic dimension and for Zariski dense cocycles into simple Lie groups. Then we approach numerical invariants. Our first goal is to study cocycles from complex hyperbolic lattices into the Hermitian group SU(p,q). Following the theory recently developed by Moraschini and Savini, we define the Toledo invariant by using the pullback along cocycles, also by involving boundary maps. For cocycles Γ × X → SU(p,q) with 1
Resumo:
Após um século de reflexões e investigações, como era de se esperar, a Psicologia Moral apresenta sinais de esgotamento de seus referenciais teóricos clássicos. Consequentemente, novas perspectivas se abrem, entre elas a abordagem teórica que leva o nome de 'personalidade ética', cuja tese é: para compreendermos os comportamentos morais (deveres) dos indivíduos, precisamos conhecer a perspectiva ética (vida boa) adotadas por eles. Entre os invariantes psicológicos de realização de uma 'vida boa', está a necessidade de 'expansão de si próprio'. Como tal expansão implica ter 'representações de si' de valor positivo, entre elas poderão estar aquelas relacionadas à moral. Se estiverem, o sujeito experimentará o sentimento de dever, do contrário, a motivação para a ação moral será inexistente ou fraca.
Resumo:
A full set of Casimir operators for the Lie superalgebra gl(m/infinity) is constructed and shown to be well defined in the category O-FS generated by the highest-weight irreducible representations with only a finite number of non-zero weight components. The eigenvalues of these Casimir operators are determined explicitly in terms of the highest weight. Characteristic identities satisfied by certain (infinite) matrices with entries from gl(m/infinity) are also determined.
Resumo:
The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.