845 resultados para 0802 Computation Theory and Mathematics
Resumo:
A szerző röviden összefoglalja a származtatott termékek árazásával kapcsolatos legfontosabb ismereteket és problémákat. A derivatív árazás elmélete a piacon levő termékek közötti redundanciát kihasználva próbálja meghatározni az egyes termékek relatív árát. Ezt azonban csak teljes piacon lehet megtenni, és így csak teljes piac esetén lehetséges a hasznossági függvények fogalmát az elméletből és a ráépülő gyakorlatból elhagyni, ezért a kockázatsemleges árazás elve félrevezető. Másképpen fogalmazva: a származtatott termékek elmélete csak azon az áron képes a hasznossági függvény fogalmától megszabadulni, ha a piac szerkezetére a valóságban nem teljesülő megkötéseket tesz. Ennek hangsúlyozása mind a piaci gyakorlatban, mind az oktatásban elengedhetetlen. / === / The author sums up briefly the main aspects and problems to do with the pricing of derived products. The theory of derivative pricing uses the redundancy among products on the market to arrive at relative product prices. But this can be done only on a complete market, so that only with a complete market does it become possible to omit from the theory and the practice built upon it the concept of utility functions, and for that reason the principle of risk-neutral pricing is misleading. To put it another way, the theory of derived products is capable of freeing itself from the concept of utility functions only at a price where in practice it places impossible restrictions on the market structure. This it is essential to emphasize in market practice and in teaching.
Resumo:
Regardless of the fact that children learn in significantly different ways, most curriculum and instruction are guided by the idea that sequential organization of the material to be learned is the best and most efficient way of presenting information to children. Children who learn and think intuitively are denied their preference, forced to conform to the sequential nature of the curriculum and instruction. Based on the theory of psychological type, this study sought to identify any relationship between a student's cognitive style of learning, either Sensing or Intuitive, and his/her academic success in elementary school. The Murphy-Meisgeier Type Indicator for Children was used to identify the cognitive style of students in grades two through eight in a small, private, parochial school. Scores on a standardized achievement test and grades were then analyzed to see if there was a relationship of cognitive style to grades and achievement test scores. Also, the researcher investigated whether or not the teacher's cognitive style had any relationship to students' cognitive style and academic achievement. Although none of the results was statistically significant, the achievement test scores indicated that Sensing students score higher in reading, mathematics concepts, and mathematics computation. However, Intuitive students had higher mean grades in reading and language arts, and virtually equal means mathematics concepts and computation. It was also found that all students, both Sensing and Intuitive, had higher mean grades in the classes of Intuitive teachers. ^
Resumo:
This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory was used to analyze strategic interaction among independent devices with conflicting interests. Packet forwarding at the routing layer of autonomous ad hoc networks was investigated. Unlike existing reputation based or payment schemes, this model is based on repeated interactions. To enforce cooperation, a community enforcement mechanism was used, whereby selfish nodes that drop packets were punished not only by the victim, but also by all nodes in the network. Then, a stochastic packet forwarding game strategy was introduced. Our solution relaxed the uniform traffic demand that was pervasive in other works. To address the concerns of imperfect private monitoring in resource aware ad hoc networks, a belief-free equilibrium scheme was developed that reduces the impact of noise in cooperation. This scheme also eliminated the need to infer the private history of other nodes. Moreover, it simplified the computation of an optimal strategy. The belief-free approach reduced the node overhead and was easily tractable. Hence it made the system operation feasible. Motivated by the versatile nature of evolutionary game theory, the assumption of a rational node is relaxed, leading to the development of a framework for mitigating routing selfishness and misbehavior in Multi hop networks. This is accomplished by setting nodes to play a fixed strategy rather than independently choosing a rational strategy. A range of simulations was carried out that showed improved cooperation between selfish nodes when compared to older results. Cooperation among ad hoc nodes can also protect a network from malicious attacks. In the absence of a central trusted entity, many security mechanisms and privacy protections require cooperation among ad hoc nodes to protect a network from malicious attacks. Therefore, using game theory and evolutionary game theory, a mathematical framework has been developed that explores trust mechanisms to achieve security in the network. This framework is one of the first steps towards the synthesis of an integrated solution that demonstrates that security solely depends on the initial trust level that nodes have for each other.^
Resumo:
Mathematics can be found all over the world, even in what could be considered an unrelated area, like fiber arts. In knitting, crochet, and counted-thread embroidery, we can find concepts of algebra, graph theory, number theory, geometry of transformations, and symmetry, as well as computer science. For example, many fiber art pieces embody notions related with groups of symmetry. In this work, we focus on two areas of Mathematics associated with knitting, crochet, and cross-stitch works – number theory and geometry of transformations.
Resumo:
Given a continuous map f : K -> M from a 2-dimensional CW complex into a closed surface, the Nielsen root number N(f) and the minimal number of roots mu(f) of f satisfy N(f) <= mu(f). But, there is a number mu(C)(f) associated to each Nielsen root class of f, and an important problem is to know when mu(f) = mu(C)(f)N(f). In addition to investigate this problem, we determine a relationship between mu(f) and mu((f) over tilde), when (f) over tilde f is a lifting of f through a covering space, and we find a connection between this problems, with which we answer several questions related to them when the range of the maps is the projective plane.
Resumo:
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for their cardinality in terms of minimum distance and the maximum center density of lattices and general spherical packings in the half dimension of the code. This bound is tight in the sense it can be arbitrarily approached in any dimension. Examples of this approach and a comparison of this bound with Union and Rankin bounds for general spherical codes is also presented.
Resumo:
A model predictive controller (MPC) is proposed, which is robustly stable for some classes of model uncertainty and to unknown disturbances. It is considered as the case of open-loop stable systems, where only the inputs and controlled outputs are measured. It is assumed that the controller will work in a scenario where target tracking is also required. Here, it is extended to the nominal infinite horizon MPC with output feedback. The method considers an extended cost function that can be made globally convergent for any finite input horizon considered for the uncertain system. The method is based on the explicit inclusion of cost contracting constraints in the control problem. The controller considers the output feedback case through a non-minimal state-space model that is built using past output measurements and past input increments. The application of the robust output feedback MPC is illustrated through the simulation of a low-order multivariable system.
Resumo:
Current debates about educational theory are concerned with the relationship between knowledge and power and thereby issues such as who possesses a truth and how have they arrived at it, what questions are important to ask, and how should they best be answered. As such, these debates revolve around questions of preferred, appropriate, and useful theoretical perspectives. This paper overviews the key theoretical perspectives that are currently used in physical education pedagogy research and considers how these inform the questions we ask and shapes the conduct of research. It also addresses what is contested with respect to these perspectives. The paper concludes with some cautions about allegiances to and use of theories in line with concerns for the applicability of educational research to pressing social issues.
A unified and complete construction of all finite dimensional irreducible representations of gl(2|2)
Resumo:
Representations of the non-semisimple superalgebra gl(2/2) in the standard basis are investigated by means of the vector coherent state method and boson-fermion realization. All finite-dimensional irreducible typical and atypical representations and lowest weight (indecomposable) Kac modules of gl(2/2) are constructed explicity through the explicit construction of all gl(2) circle plus gl(2) particle states (multiplets) in terms of boson and fermion creation operators in the super-Fock space. This gives a unified and complete treatment of finite-dimensional representations of gl(2/2) in explicit form, essential for the construction of primary fields of the corresponding current superalgebra at arbitrary level.
Resumo:
The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.
Resumo:
We investigate in detail the effects of a QND vibrational number measurement made on single ions in a recently proposed measurement scheme for the vibrational state of a register of ions in a linear rf trap [C. D'HELON and G. J. MILBURN, Phys Rev. A 54, 5141 (1996)]. The performance of a measurement shows some interesting patterns which are closely related to searching.
Resumo:
Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.
Resumo:
Uncontrolled systems (x) over dot is an element of Ax, where A is a non-empty compact set of matrices, and controlled systems (x) over dot is an element of Ax + Bu are considered. Higher-order systems 0 is an element of Px - Du, where and are sets of differential polynomials, are also studied. It is shown that, under natural conditions commonly occurring in robust control theory, with some mild additional restrictions, asymptotic stability of differential inclusions is guaranteed. The main results are variants of small-gain theorems and the principal technique used is the Krasnosel'skii-Pokrovskii principle of absence of bounded solutions.
Resumo:
The generalization of the quasi mode theory of macroscopic quantization in quantum optics and cavity QED presented in the previous paper, is applied to provide a fully quantum theoretic derivation of the laws of reflection and refraction at a boundary. The quasi mode picture of this process involves the annihilation of a photon travelling in the incident region quasi mode, and the subsequent creation of a photon in either the incident region or transmitted region quasi modes. The derivation of the laws of reflection and refraction is achieved through the dual application of the quasi mode theory and a quantum scattering theory based on the Heisenberg picture. Formal expressions from scattering theory are given for the reflection and transmission coefficients. The behaviour of the intensity for a localized one photon wave packet coming in at time minus infinity from the incident direction is examined and it is shown that at time plus infinity, the light intensity is only significant where the classical laws of reflection and refraction predict. The occurrence of both refraction and reflection is dependent upon the quasi mode theory coupling constants between incident and transmitted region quasi modes being nonzero, and it is seen that the contributions to such coupling constants come from the overlap of the mode functions in the boundary layer region, as might be expected from a microscopic theory.