999 resultados para moment problem
Resumo:
The formal charge distribution and hence the electric moments of a number of halosilanes and their methyl derivatives have been calculated by the method of Image and Image . The difference between the observed and the calculated values in simple halosilanes is attributed to a change in the hybridization of the terminal halogen atom and in methyl halosilanes to the enhanced electron release of the methyl group towards silicon compared with carbon.
Resumo:
According to certain arguments, computation is observer-relative either in the sense that many physical systems implement many computations (Hilary Putnam), or in the sense that almost all physical systems implement all computations (John Searle). If sound, these arguments have a potentially devastating consequence for the computational theory of mind: if arbitrary physical systems can be seen to implement arbitrary computations, the notion of computation seems to lose all explanatory power as far as brains and minds are concerned. David Chalmers and B. Jack Copeland have attempted to counter these relativist arguments by placing certain constraints on the definition of implementation. In this thesis, I examine their proposals and find both wanting in some respects. During the course of this examination, I give a formal definition of the class of combinatorial-state automata , upon which Chalmers s account of implementation is based. I show that this definition implies two theorems (one an observation due to Curtis Brown) concerning the computational power of combinatorial-state automata, theorems which speak against founding the theory of implementation upon this formalism. Toward the end of the thesis, I sketch a definition of the implementation of Turing machines in dynamical systems, and offer this as an alternative to Chalmers s and Copeland s accounts of implementation. I demonstrate that the definition does not imply Searle s claim for the universal implementation of computations. However, the definition may support claims that are weaker than Searle s, yet still troubling to the computationalist. There remains a kernel of relativity in implementation at any rate, since the interpretation of physical systems seems itself to be an observer-relative matter, to some degree at least. This observation helps clarify the role the notion of computation can play in cognitive science. Specifically, I will argue that the notion should be conceived as an instrumental rather than as a fundamental or foundational one.
Resumo:
Abstract (Mig or mej, själ or sjel? Problems and solutions in the transcription of Swedish song texts): In this article I am pointing out and discussing problems and solutions concerning phonetic transcription of Swedish song texts. My material consists of 66 Swedish songs phonetically transcribed. The transcriptions were published by The Academy of Finnish Art Song in 2009. The first issue was which level of accuracy should be chosen. The transcriptions were created to be clear at a glance and suitable for the needs of interpretation of non Swedish speaking singers. The principle was to use as few signs and symbols as possible without sacrificing accuracy. Certain songs were provided with additional information whenever there was a chance of misinterpretation. The second issue was which geographic variety of the language should be visible in the transcription, Standard Swedish or Finland-Swedish? The songs in the volume are a selection of well-known works that are also of international interest. Most were composed by Jean Sibelius (1865–1957), a substantial number of whose songs were based on poems written by Finland’s national poet, Johan Ludvig Runeberg (1804–1877). Thus I chose to use the variety of Swedish language spoken in Finland, in order to reflect the cultural origin of the songs. This variety differs slightly from the variety spoken in Sweden both on prosodic and phonetic level. In singing, the note-text gives the interpretor enough information about prosody. The differences concern mostly the phonemes. A fully consequent transcript was, however, difficult to make, due to vocal requirement. So, for example, in an unstressed final syllable the vowel was often indicated as a central vowel, which in singing is given a more direct emphasis than in a literal pronunciation, even if this central vowel does not occur in spoken Finland-Swedish.
Resumo:
In this paper, we have first given a numerical procedure for the solution of second order non-linear ordinary differential equations of the type y″ = f (x;y, y′) with given initial conditions. The method is based on geometrical interpretation of the equation, which suggests a simple geometrical construction of the integral curve. We then translate this geometrical method to the numerical procedure adaptable to desk calculators and digital computers. We have studied the efficacy of this method with the help of an illustrative example with known exact solution. We have also compared it with Runge-Kutta method. We have then applied this method to a physical problem, namely, the study of the temperature distribution in a semi-infinite solid homogeneous medium for temperature-dependent conductivity coefficient.
Resumo:
Following Weisskopf, the kinematics of quantum mechanics is shown to lead to a modified charge distribution for a test electron embedded in the Fermi-Dirac vacuum with interesting consequences.
Resumo:
In recent years a large number of investigators have devoted their efforts to the study of flow and heat transfer in rarefied gases, using the BGK [1] model or the Boltzmann kinetic equation. The velocity moment method which is based on an expansion of the distribution function as a series of orthogonal polynomials in velocity space, has been applied to the linearized problem of shear flow and heat transfer by Mott-Smith [2] and Wang Chang and Uhlenbeck [3]. Gross, Jackson and Ziering [4] have improved greatly upon this technique by expressing the distribution function in terms of half-range functions and it is this feature which leads to the rapid convergence of the method. The full-range moments method [4] has been modified by Bhatnagar [5] and then applied to plane Couette flow using the B-G-K model. Bhatnagar and Srivastava [6] have also studied the heat transfer in plane Couette flow using the linearized B-G-K equation. On the other hand, the half-range moments method has been applied by Gross and Ziering [7] to heat transfer between parallel plates using Boltzmann equation for hard sphere molecules and by Ziering [83 to shear and heat flow using Maxwell molecular model. Along different lines, a moment method has been applied by Lees and Liu [9] to heat transfer in Couette flow using Maxwell's transfer equation rather than the Boltzmann equation for distribution function. An iteration method has been developed by Willis [10] to apply it to non-linear heat transfer problems using the B-G-K model, with the zeroth iteration being taken as the solution of the collisionless kinetic equation. Krook [11] has also used the moment method to formulate the equivalent continuum equations and has pointed out that if the effects of molecular collisions are described by the B-G-K model, exact numerical solutions of many rarefied gas-dynamic problems can be obtained. Recently, these numerical solutions have been obtained by Anderson [12] for the non-linear heat transfer in Couette flow,
Resumo:
Ingarden (1962, 1964) postulates that artworks exist in an “Objective purely intentional” way. According to this view, objectivity and subjectivity are opposed forms of existence, parallel to the opposition between realism and idealism. Using arguments of cognitive science, experimental psychology, and semiotics, this lecture proposes that, particularly in the aesthetic phenomena, realism and idealism are not pure oppositions; rather they are aspects of a single process of cognition in different strata. Furthermore, the concept of realism can be conceived as an empirical extreme of idealism, and the concept of idealism can be conceived as a pre-operative extreme of realism. Both kind of systems of knowledge are mutually associated by a synecdoche, performing major tasks of mental order and categorisation. This contribution suggests that the supposed opposition between objectivity and subjectivity, raises, first of all, a problem of translatability, more than a problem of existential categories. Synecdoche seems to be a very basic transaction of the mind, establishing ontologies (in the more Ingardean way of the term). Wegrzecki (1994, 220) defines ontology as “the central domain of philosophy to which other its parts directly or indirectly refer”. Thus, ontology operates within philosophy as the synecdoche does within language, pointing the sense of the general into the particular and/or viceversa. The many affinities and similarities between different sign systems, like those found across the interrelationships of the arts, are embedded into a transversal, synecdochic intersemiosis. An important question, from this view, is whether Ingardean’s pure objectivities lie basically on the impossibility of translation, therefore being absolute self-referential constructions. In such a case, it would be impossible to translate pure intentionality into something else, like acts or products.
Resumo:
We still know little of why strategy processes often involve participation problems. In this paper, we argue that this crucial issue is linked to fundamental assumptions about the nature of strategy work. Hence, we need to examine how strategy processes are typically made sense of and what roles are assigned to specific organizational members. For this purpose, we adopt a critical discursive perspective that allows us to discover how specific conceptions of strategy work are reproduced and legitimized in organizational strategizing. Our empirical analysis is based on an extensive research project on strategy work in 12 organizations. As a result of our analysis, we identify three central discourses that seem to be systematically associated with nonparticipatory approaches to strategy work: “mystification,” “disciplining,” and “technologization.” However, we also distinguish three strategy discourses that promote participation: “self-actualization,” “dialogization,” and “concretization.” Our analysis shows that strategy as practice involves alternative and even competing discourses that have fundamentally different kinds of implications for participation in strategy work. We argue from a critical perspective that it is important to be aware of the inherent problems associated with dominant discourses as well as to actively advance the use of alternative ones.
Resumo:
We develop an alternate characterization of the statistical distribution of the inter-cell interference power observed in the uplink of CDMA systems. We show that the lognormal distribution better matches the cumulative distribution and complementary cumulative distribution functions of the uplink interference than the conventionally assumed Gaussian distribution and variants based on it. This is in spite of the fact that many users together contribute to uplink interference, with the number of users and their locations both being random. Our observations hold even in the presence of power control and cell selection, which have hitherto been used to justify the Gaussian distribution approximation. The parameters of the lognormal are obtained by matching moments, for which detailed analytical expressions that incorporate wireless propagation, cellular layout, power control, and cell selection parameters are developed. The moment-matched lognormal model, while not perfect, is an order of magnitude better in modeling the interference power distribution.
Resumo:
Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms.
Resumo:
Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).