822 resultados para Projective duality
Resumo:
By applying narrative theory to the party political texts emerging within the UK Labour Party after 2010, which make up the corpus of One Nation discourse, we can grasp the underlying significance of this ideational revision of Labour Party and leftist thought. Through an identification and analysis of the sequence of texts and their constitution as a "story" that interpolates an underlying "plot," we can see how a revision of Labour's "tale" offers to leadership a new party discourse appropriate to it, mediating-if not reconciling-the problematic duality of narrative authorship by both party and leader. © The Political Quarterly Publishing Co. Ltd. 2013.
Resumo:
Recent changes in the regulatory environment of the London Stock Exchange are aimed at prohibiting selective disclosure and enhancing the credibility of reporting. Using an innovative 143-item disclosure checklist, we examine corporate Internet reporting (CIR) comprehensiveness and its determinants within this new regulatory environment. We also extend the literature linking corporate governance measures to CIR. Our findings indicate that despite this new regulatory environment, there is considerable room for improvement in CIR by London-listed companies. For example, our sample companies provide only 58 percent and 70 percent, respectively, of the credibility and usability items assessed by our comprehensiveness index. After controlling for size, profitability, industry, and high growth/ intangibles, we find the CIR comprehensiveness of London-listed companies is associated with analyst following, director holding, director independence, and CEO duality. Because prior research indicates the U.K. leads Europe in Internet reporting, our results may shed light on how CIR will evolve throughout Europe.
Resumo:
This study is an examination of the timeliness of corporate internet reporting by U.K. companies listed on the London Stock Exchange (LSE). The research examines the significance of several corporate governance and firm-specific characteristics as potential determinants of the timeliness of corporate internet reporting. Our primary analysis provides evidence of a significant association between timely corporate internet reporting and the corporate governance characteristics of board experience and board independence. Our findings provide evidence that boards with less cross directorships, more experience in terms of the average age of directors, and lower length in service for executive directors provide more timely corporate internet reporting. We find that board independence is negatively associated with timely corporate internet reporting. Follow-up analysis provides additional evidence of a significant association between the timeliness of corporate internet reporting and board experience. The evidence indicates that role duality and block ownership are associated with less timely corporate internet reporting. Our findings also reveal strengths and weaknesses in the Internet reporting of U.K. listed companies. Companies need to voluntarily focus on improving the timeliness dimension of their corporate internet reporting so that the EU and U.K. accounting regulators do not replace recommendations with regulations. © 2007 Elsevier Inc. All rights reserved.
Resumo:
In this paper, we prove the nonexistence of arcs with parameters (232, 48) and (233, 48) in PG(4,5). This rules out the existence of linear codes with parameters [232,5,184] and [233,5,185] over the field with five elements and improves two instances in the recent tables by Maruta, Shinohara and Kikui of optimal codes of dimension 5 over F5.
Resumo:
We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.
Resumo:
Here we study the integers (d, g, r) such that on a smooth projective curve of genus g there exists a rank r stable vector bundle with degree d and spanned by its global sections.
Resumo:
We define Picard cycles on each smooth three-sheeted Galois cover C of the Riemann sphere. The moduli space of all these algebraic curves is a nice Shimura surface, namely a symmetric quotient of the projective plane uniformized by the complex two-dimensional unit ball. We show that all Picard cycles on C form a simple orbit of the Picard modular group of Eisenstein numbers. The proof uses a special surface classification in connection with the uniformization of a classical Picard-Fuchs system. It yields an explicit symplectic representation of the braid groups (coloured or not) of four strings.
Resumo:
∗The author supported by Contract NSFR MM 402/1994.
Resumo:
We consider the problem of minimizing the max of two convex functions from both approximation and sensitivity point of view.This lead up to study the epiconvergence of a sequence of level sums of convex functions and the related dual problems.
Resumo:
The paper develops a set of ideas and techniques supporting analogical reasoning throughout the life-cycle of terrorist acts. Implementation of these ideas and techniques can enhance the intellectual level of computer-based systems for a wide range of personnel dealing with various aspects of the problem of terrorism and its effects. The method combines techniques of structure-sensitive distributed representations in the framework of Associative-Projective Neural Networks, and knowledge obtained through the progress in analogical reasoning, in particular the Structure Mapping Theory. The impact of these analogical reasoning tools on the efforts to minimize the effects of terrorist acts on civilian population is expected by facilitating knowledge acquisition and formation of terrorism-related knowledge bases, as well as supporting the processes of analysis, decision making, and reasoning with those knowledge bases for users at various levels of expertise before, during, and after terrorist acts.
Resumo:
In an equiaffine space q N E using the connection define with projective tensors na and ma the connections 1 , 2 and 3 . For the spaces N N 1A ,2A and N 3A , with coefficient of connection 1 , 2 and 3 respectively, we proved that the affinor of composition and the projective affinors have equal covariant derivatives. It follows that the connection 3 is equaffine as well, and the connections and 3 are projective to each other. In the case where q N E and N 3A have equal Ricci tensors, we find the fundamental nvector . In [4] compositions with structural affinor a are studied. Space containing compositions with symmetric connection and Weyl connection are studied in [6] and [7] respectively.
Resumo:
In an equiaffine space q N E using the connection define with projective tensors na and ma the connections 1 , 2 and 3 . For the spaces N N 1A ,2A and N 3A , with coefficient of connection 1 , 2 and 3 respectively, we proved that the affinor of composition and the projective affinors have equal covariant derivatives. It follows that the connection 3 is equaffine as well, and the connections and 3 are projective to each other. In the case where q N E and N 3A have equal Ricci tensors, we find the fundamental nvector . In [4] compositions with structural affinor a are studied. Space containing compositions with symmetric connection and Weyl connection are studied in [6] and [7] respectively.
Resumo:
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper is to determine nq(k, d) for d = dk as nq(k, d) = gq(k, d) + 1 for q ≥ k with 3 ≤ k ≤ 8 except for (k, q) = (7, 7), (8, 8), (8, 9).
Resumo:
We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.
Resumo:
2000 Mathematics Subject Classification: 14D20, 14J60.