970 resultados para Holomorphic Extension
Resumo:
2010 Mathematics Subject Classification: 35B65, 35S05, 35A20.
Resumo:
AMS Subject Classification 2010: 11M26, 33C45, 42A38.
Resumo:
We present two extension theorems for holomorphic generalized functions. The first one is a version of the classic Hartogs extension theorem. In this, we start from a holomorphic generalized function on an open neighbourhood of the bounded open boundary, extending it, holomorphically, to a full open. In the second theorem a generalized version of a classic result is obtained, done independently, in 1943, by Bochner and Severi. For this theorem, we start from a function that is holomorphic generalized and has a holomorphic representative on the bounded domain boundary, we extend it holomorphically the function, for the whole domain.
Resumo:
An extension theorem for holomorphic mappings between two domains in C-2 is proved under purely local hypotheses.
Resumo:
International audience
Using the Hofstede-Gray Framework to Argue Normatively for an Extension of Islamic Corporate Reports
Resumo:
Oberon-2 is an object-oriented language with a class structure based on type extension. The runtime structure of Oberon-2 is described and the low-level mechanism for dynamic type checking explained. It is shown that the superior type-safety of the language, when used for programming styles based on heterogeneous, pointer-linked data structures, has an entirely negligible cost in runtime performance.
Resumo:
The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexity of the operations that occur in the lower degree subfields. Consequently, full extension field operations have the greatest effect on the runtime of Miller’s algorithm. Many recent optimizations in the literature have focussed on improving the overall operation count by presenting new explicit formulas that reduce the number of subfield operations encountered throughout an iteration of Miller’s algorithm. Unfortunately, almost all of these improvements tend to suffer for larger embedding degrees where the expensive extension field operations far outweigh the operations in the smaller subfields. In this paper, we propose a new way of carrying out Miller’s algorithm that involves new explicit formulas which reduce the number of full extension field operations that occur in an iteration of the Miller loop, resulting in significant speed ups in most practical situations of between 5 and 30 percent.
Resumo:
Historically, the development philosophy for the two Territories of Papua and New Guinea (known as TPNG, formerly two territories, Papua and New Guinea) was equated with economic development, with a focus on agricultural development. To achieve the modification or complete change in indigenous farming systems the Australian Government’s Department of External Territories adopted and utilised a programme based on agricultural extension. Prior to World War II, under Australian administration, the economic development of these two territories, as in many colonies of the time, was based on the institution of the plantation. Little was initiated in agriculture development for indigenous people. This changed after World War II to a rationale based on the promotion and advancement of primary industry, but also came to include indigenous farmers. To develop agriculture within a colony it was thought that a modification to, or in some cases the complete transformation of, existing farming systems was necessary to improve the material welfare of the population. It was also seen to be a guarantee for the future national interest of the sovereign state after independence was granted. The Didiman and Didimisis became the frontline, field operatives of this theoretical model of development. This thesis examines the Didiman’s field operations, the structural organisation of agricultural administration and the application of policy in the two territories.