Quantum Tomography with Phase Space Measurements

This thesis addresses the use of covariant phase space observables in quantum tomography. Necessary and sufficient conditions for the informational completeness of covariant phase space observables are proved, and some state reconstruction formulae are derived. Different measurement schemes for measuring phase space observables are considered. Special emphasis is given to the quantum optical eight-port homodyne detection scheme and, in particular, on the effect of non-unit detector efficiencies on the measured observable. It is shown that the informational completeness of the observable does not depend on the efficiencies. As a related problem, the possibility of reconstructing the position and momentum distributions from the marginal statistics of a phase space observable is considered. It is shown that informational completeness for the phase space observable is neither necessary nor sufficient for this procedure. Two methods for determining the distributions from the marginal statistics are presented. Finally, two alternative methods for determining the state are considered. Some of their shortcomings when compared to the phase space method are discussed.

Jatkuvan äänitehojakautuman algoritmi pitkien käytävien äänikenttien mallintamiseen

JÄKÄLA-algoritmi (Jatkuvan Äänitehojakautuman algoritmi Käytävien Äänikenttien LAskentaan) ja sen NUMO- ja APPRO-laskentayhtälöt perustuvat käytävällä olevan todellisen äänilähteen kuvalähteiden symmetriaan. NUMO on algoritmin numeerisen ratkaisun ja APPRO likiarvoratkaisun laskentayhtälö. Algoritmia johdettaessa oletettiin, että absorptiomateriaali oli jakautunut tasaisesti käytävän ääntä heijastaville pinnoille. Suorakaiteen muotoisen käytävän kuvalähdetason muunto jatkuvaksi äänitehojakautumaksi sisältää kolme muokkausvaihetta. Aluksi suorakaiteen kuvalähdetaso muunnetaan neliön muotoiseksi. Seuraavaksi neliön muotoisen kuvalähdetason samanarvoiset kuvalähteet siirretään koordinaattiakselille diskreetiksi kuvalähdejonoksi. Lopuksi kuvalähdejono muunnetaan jatkuvaksi äänitehojakautumaksi, jolloin käytävän vastaanottopisteen äänenpainetaso voidaan laskea integroimalla jatkuvan äänitehojakautuman yli. JÄKÄLA-algoritmin validiteetin toteamiseksi käytettiin testattua kaupallista AKURI-ohjelmaa. AKURI-ohjelma antoi myös hyvän käsityksen siitä, miten NUMO- ja APPRO-yhtälöillä lasketut arvot mahdollisesti eroavat todellisilla käytävillä mitatuista arvoista. JÄKÄLA-algoritmin NUMO- ja APPRO-yhtälöitä testattiin myös vertaamalla niiden antamia tuloksia kolmen erityyppisen käytävän äänenpainetasomittauksiin. Tässä tutkimuksessa on osoitettu, että akustisen kuvateorian pohjalta on mahdollista johtaa laskenta-algoritmi, jota voidaan soveltaa pitkien käytävien äänikenttien pika-arvioinnissa paikan päällä. Sekä teoreettinen laskenta että käytännön äänenpainetasomittaukset todellisilla käytävillä osoittivat, että JÄKÄLA-algoritmin yhtälöiden ennustustarkkuus oli erinomainen ideaalikäytävillä ja hyvä niillä todellisilla käytävillä, joilla ei ollut ääntä heijastavia rakenteita. NUMO- ja APPRO-yhtälöt näyttäisivät toimivan hyvin käytävillä, joiden poikkileikkaus oli lähes neliön muotoinen ja joissa pintojen suurin absorptiokerroin oli korkeintaan kymmenen kertaa pienintä absorptiokerrointa suurempi. NUMO- ja APPRO-yhtälöiden suurin puute on, etteivät ne ota huomioon pintojen erilaisia absorptiokertoimia eivätkä esineistä heijastuvia ääniä. NUMO- ja APPRO- laskentayhtälöt poikkesivat mitatuista arvoista eniten käytävillä, joilla kahden vastakkaisen pinnan absorptiokerroin oli hyvin suuri ja toisen pintaparin hyvin pieni, ja käytävillä, joissa oli massiivisia, ääntä heijastavia pilareita ja palkkeja. JÄKÄLA-algoritmin NUMO- ja APPRO-yhtälöt antoivat tutkituilla käytävillä kuitenkin selvästi tarkempia arvoja kuin Kuttruffin likiarvoyhtälö ja tilastollisen huoneakustiikan perusyhtälö. JÄKÄLA-algoritmin laskentatarkkuutta on testattu vain neljällä todellisella käytävällä. Algoritmin kehittämiseksi tulisi jatkossa käytävän vastakkaisia pintoja ja niiden absorptiokertoimia käsitellä laskennassa pareittain. Algoritmin validiteetin varmistamiseksi on mittauksia tehtävä lisää käytävillä, joiden absorptiomateriaalien jakautumat poikkeavat toisistaan.

QT interval in healthy dogs: which method of correcting the QT interval in dogs is appropriate for use in small animal clinics?

The electrocardiography (ECG) QT interval is influenced by fluctuations in heart rate (HR) what may lead to misinterpretation of its length. Considering that alterations in QT interval length reflect abnormalities of the ventricular repolarisation which predispose to occurrence of arrhythmias, this variable must be properly evaluated. The aim of this work is to determine which method of correcting the QT interval is the most appropriate for dogs regarding different ranges of normal HR (different breeds). Healthy adult dogs (n=130; German Shepherd, Boxer, Pit Bull Terrier, and Poodle) were submitted to ECG examination and QT intervals were determined in triplicates from the bipolar limb II lead and corrected for the effects of HR through the application of three published formulae involving quadratic, cubic or linear regression. The mean corrected QT values (QTc) obtained using the diverse formulae were significantly different (ρ<0.05), while those derived according to the equation QTcV = QT + 0.087(1- RR) were the most consistent (linear regression). QTcV values were strongly correlated (r=0.83) with the QT interval and showed a coefficient of variation of 8.37% and a 95% confidence interval of 0.22-0.23 s. Owing to its simplicity and reliability, the QTcV was considered the most appropriate to be used for the correction of QT interval in dogs.

Stability Analysis in Multicriteria Discrete Portfolio Optimization.

Almost every problem of design, planning and management in the technical and organizational systems has several conflicting goals or interests. Nowadays, multicriteria decision models represent a rapidly developing area of operation research. While solving practical optimization problems, it is necessary to take into account various kinds of uncertainty due to lack of data, inadequacy of mathematical models to real-time processes, calculation errors, etc. In practice, this uncertainty usually leads to undesirable outcomes where the solutions are very sensitive to any changes in the input parameters. An example is the investment managing. Stability analysis of multicriteria discrete optimization problems investigates how the found solutions behave in response to changes in the initial data (input parameters). This thesis is devoted to the stability analysis in the problem of selecting investment project portfolios, which are optimized by considering different types of risk and efficiency of the investment projects. The stability analysis is carried out in two approaches: qualitative and quantitative. The qualitative approach describes the behavior of solutions in conditions with small perturbations in the initial data. The stability of solutions is defined in terms of existence a neighborhood in the initial data space. Any perturbed problem from this neighborhood has stability with respect to the set of efficient solutions of the initial problem. The other approach in the stability analysis studies quantitative measures such as stability radius. This approach gives information about the limits of perturbations in the input parameters, which do not lead to changes in the set of efficient solutions. In present thesis several results were obtained including attainable bounds for the stability radii of Pareto optimal and lexicographically optimal portfolios of the investment problem with Savage's, Wald's criteria and criteria of extreme optimism. In addition, special classes of the problem when the stability radii are expressed by the formulae were indicated. Investigations were completed using different combinations of Chebyshev's, Manhattan and Hölder's metrics, which allowed monitoring input parameters perturbations differently.

Kierkegaard : the temporality of becoming a self

Introduction In Difference and Repetition, Deleuze compares and contrasts Kierkegaard's and Nietzsche's ideas of repetition. He argues that neither of them really give a representation of repetition. Repetition for them is a sort of selective task: the way in which they determine what is ethical and eternal. With Nietzsche, it is a theater of un belie f. ..... Nietzsche's leading idea is to found the repetition in the etemal return at once on the death of God and the dissolution of the self But it is a quite different alliance in the theater of faith: Kierkegaard dreams of alliance between a God and a self rediscovered. I Repetition plays a theatrical role in their thinking. It allows them to dramatically stage the interplay of various personnae. Deleuze does give a positive account ofKierkegaard's "repetition"; however, he does not think that Kierkegaard works out a philosophical model, or a representation of what repetition is. It is true that in the book Repetition, Constantin Constantius does not clearly and fully work out the concept of repetition, but in Sickness Unto Death, Kierkegaard gives a full explanation of the self and its temporality which can be connected with repetition. When Sickness Unto Death is interpreted according to key passages from Repetition and The Concept of Anxiety, a clear philosophical concept of repetition can be established. In my opinion, Kierkegaard's philosophy is about the task of becoming a self, and I will be attempting to show that he does have a model of the temporality of self-becoming. In Sickness Unto Death, Kierkegaard explains his notions of despair with reference to sin, self, self-becoming, faith, and repetition. Despair is a sickness of the spirit, of the self, and accordingly can take three forms: in despair not to be conscious of having a self (not despair in the strict sense); in despair not to will to be oneself; in despair to will to be oneself2 In relation to this definition, he defines a self as "a relation that relates itself to itself and in relating itself to itself relates to another.''3 Thus, a person is a threefold relationship, and any break in that relationship is despair. Despair takes three forms corresponding to the three aspects of a self s relation to itself Kierkegaard says that a selfis like a house with a basement, a first floor, and a second floor.4 This model of the house, and the concept of the stages on life's way that it illustrates, is central to Kierkegaard's philosophy. This thesis will show how he unpacks this model in many of his writings with different concepts being developed in different texts. His method is to work with the same model in different ways throughout his authorship. He assigns many of the texts to different pseudonyms, but in this thesis we will treat the model and the related concepts as being Kierkegaard's and not only the pseudonyms. This is justified as our thesis will show this modelremains the same throughout Kierkegaard's work, though it is treated in different ways by different pseudonyms. According to Kierkegaard, many people live in only the basement for their entire lives, that is, as aesthetes ("in despair not to be conscious of having a self'). They live in despair of not being conscious of having a self They live in a merely horizontal relation. They want to get what they desire. When they go to the first floor, so to speak, they reflect on themselves and only then do they begin to get a self In this stage, one acquires an ideology of the required and overcomes the strict commands of the desired. The ethical is primarily an obedience to the required whereas the aesthetic is an obedience to desire. In his work Fear and Trembling (Copenhagen: 1843), Johannes de Silentio makes several observations concerning this point. In this book, the author several times allows the desired ideality of esthetics to be shipwrecked on the required ideality of ethics, in order through these collisions to bring to light the religious ideality as the ideality that precisely is the ideality of actuality, and therefore just as desirable as that of esthetics and not as impossible as the ideality of ethics. This is accomplished in such a way that the religious ideality breaks forth in the dialectical leap and in the positive mood - "Behold all things have become new" as well as in the negative mood that is the passion of the absurd to which the concept "repetition" corresponds.s Here one begins to become responsible because one seeks the required ideality; however, the required ideality and the desired ideality become inadequate to the ethical individual. Neither of them satisfy him ("in despair not to will to be oneself'). Then he moves up to the second floor: that is, the mystical region, or the sphere of religiousness (A) ("despair to will to be oneself). Kiericegaard's model of a house, which is connected with the above definition ofdespair, shows us how the self arises through these various stages, and shows the stages of despair as well. On the second floor, we become mystics, or Knights of Infinite Resignation. We are still in despair because we despair ofthe basement and the first floor, however, we can be fiill, free persons only ifwe live on all the floors at the same time. This is a sort of paradoxical fourth stage consisting of all three floors; this is the sphere of true religiousness (religiousness (B)). It is distinguished from religiousness (A) because we can go back and live on all the floors. It is not that there are four floors, but in the fourth stage, we live paradoxically on three at once. Kierkegaard uses this house analogy in order to explain how we become a self through these stages, and to show the various stages of despair. Consequently, I will be explaining self-becoming in relation to despair. It will also be necessary to explain it in relation to faith, for faith is precisely the overcoming of despair. After explaining the becoming of the self in relation to despair and faith, I will then explain its temporality and thereby its repetition. What Kierkegaard calls a formula, Deleuze calls a representation. Unfortunately, Deleuze does not acknowledge Kierkegaard's formula for repetition. As we shall see, Kierkegaard clearly gives a formula for despair, faith, and selfbecoming. When viewed properly, these formulae yield a formula for repetition because when one hasfaith, the basement, firstfloor, and secondfloor become new as one becomes oneself The self is not bound in the eternity ofthe first floor (ethical) or the temporality of the basement (aesthete). I shall now examine the two forms of conscious despair in such a way as to point out also a rise in the consciousness of the nature of despair and in the consciousness that one's state is despair, or, what amounts to the same thing and is the salient point, a rise in the consciousness of the self The opposite to being in despair is to have faith. Therefore, the formula set forth above, which describes a state in which there is not despair at all, is entirely correct, and this formula is also the formula for faMi in ^elating itself to itself and in willing to be itself, the self rests transparently in the power that established it.

Response curves of deterministic and probabilistic cellular automata in one and two dimensions

One of the most important problems in the theory of cellular automata (CA) is determining the proportion of cells in a specific state after a given number of time iterations. We approach this problem using patterns in preimage sets - that is, the set of blocks which iterate to the desired output. This allows us to construct a response curve - a relationship between the proportion of cells in state 1 after niterations as a function of the initial proportion. We derive response curve formulae for many two-dimensional deterministic CA rules with L-neighbourhood. For all remaining rules, we find experimental response curves. We also use preimage sets to classify surjective rules. In the last part of the thesis, we consider a special class of one-dimensional probabilistic CA rules. We find response surface formula for these rules and experimental response surfaces for all remaining rules.

Formules de quadrature pour les fonctions entières de type exponentiel

Ce mémoire contient quelques résultats sur l'intégration numérique. Ils sont liés à la célèbre formule de quadrature de K. F. Gauss. Une généralisation très intéressante de la formule de Gauss a été obtenue par P. Turán. Elle est contenue dans son article publié en 1948, seulement quelques années après la seconde guerre mondiale. Étant données les circonstances défavorables dans lesquelles il se trouvait à l'époque, l'auteur (Turán) a laissé beaucoup de détails à remplir par le lecteur. Par ailleurs, l'article de Turán a inspiré une multitude de recherches; sa formule a été étendue de di érentes manières et plusieurs articles ont été publiés sur ce sujet. Toutefois, il n'existe aucun livre ni article qui contiennent un compte-rendu détaillé des résultats de base, relatifs à la formule de Turán. Je voudrais donc que mon mémoire comporte su samment de détails qui puissent éclairer le lecteur tout en présentant un exposé de ce qui a été fait sur ce sujet. Voici comment nous avons organisé le contenu de ce mémoire. 1-a. La formule de Gauss originale pour les polynômes - L'énoncé ainsi qu'une preuve. 1-b. Le point de vue de Turán - Compte-rendu détaillé des résultats de son article. 2-a. Une formule pour les polynômes trigonométriques analogue à celle de Gauss. 2-b. Une formule pour les polynômes trigonométriques analogue à celle de Turán. 3-a. Deux formules pour les fonctions entières de type exponentiel, analogues à celle de Gauss pour les polynômes. 3-b. Une formule pour les fonctions entières de type exponentiel, analogue à celle de Turán. 4-a. Annexe A - Notions de base sur les polynômes de Legendre. 4-b. Annexe B - Interpolation polynomiale. 4-c. Annexe C - Notions de base sur les fonctions entières de type exponentiel. 4-d. Annexe D - L'article de P. Turán.

On Space-Time Trade-Off for Montgomery Multipliers over Finite Fields

La multiplication dans le corps de Galois à 2^m éléments (i.e. GF(2^m)) est une opérations très importante pour les applications de la théorie des correcteurs et de la cryptographie. Dans ce mémoire, nous nous intéressons aux réalisations parallèles de multiplicateurs dans GF(2^m) lorsque ce dernier est généré par des trinômes irréductibles. Notre point de départ est le multiplicateur de Montgomery qui calcule A(x)B(x)x^(-u) efficacement, étant donné A(x), B(x) in GF(2^m) pour u choisi judicieusement. Nous étudions ensuite l'algorithme diviser pour régner PCHS qui permet de partitionner les multiplicandes d'un produit dans GF(2^m) lorsque m est impair. Nous l'appliquons pour la partitionnement de A(x) et de B(x) dans la multiplication de Montgomery A(x)B(x)x^(-u) pour GF(2^m) même si m est pair. Basé sur cette nouvelle approche, nous construisons un multiplicateur dans GF(2^m) généré par des trinôme irréductibles. Une nouvelle astuce de réutilisation des résultats intermédiaires nous permet d'éliminer plusieurs portes XOR redondantes. Les complexités de temps (i.e. le délais) et d'espace (i.e. le nombre de portes logiques) du nouveau multiplicateur sont ensuite analysées: 1. Le nouveau multiplicateur demande environ 25% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito lorsque GF(2^m) est généré par des trinômes irréductible et m est suffisamment grand. Le nombre de portes du nouveau multiplicateur est presque identique à celui du multiplicateur de Karatsuba proposé par Elia. 2. Le délai de calcul du nouveau multiplicateur excède celui des meilleurs multiplicateurs d'au plus deux évaluations de portes XOR. 3. Nous determinons le délai et le nombre de portes logiques du nouveau multiplicateur sur les deux corps de Galois recommandés par le National Institute of Standards and Technology (NIST). Nous montrons que notre multiplicateurs contient 15% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito au coût d'un délai d'au plus une porte XOR supplémentaire. De plus, notre multiplicateur a un délai d'une porte XOR moindre que celui du multiplicateur d'Elia au coût d'une augmentation de moins de 1% du nombre total de portes logiques.

Analytical Equations for Compact Dual Frequency Microstrip Antenna

Design equations are presented for calculating the resonance frequencies for a compact dual frequency arrow-shaped microstrip antenna. This provides a fast and simple way to predict the resonant frequencies of the antenna. The antenna is also analyzed using the IE3D simulation package. The theoretical predictions are found to be very close to the IE3D results and thus establish the validity of the design formulae

Synthesis and Characterization of Some New Transition Metal Complexes of the Schiff Base Derived from Quinoxaline-2-Carboxaldehyde and 2- Aminophenol

Some new transition metal complexes of the Schiff base quinoxaline-2-car boxalidene-2-aminophenol (HQAP) have been synthesized and characterized by elemental analyses, conductance and magnetic measurements and IR and UV-Visible spectral studies. The complexes have the following empirical formulae: [Mn(QAP121, [Fe(QAPl2C1I, [Co(QAPl21, [Ni(QAP121 and [Cu(QAP121. A tetrahedral structure has been assigned for the manganese(=), cobalt(II1, nickel(II1 and copper(II1 complexes. For the iron(IIIl complex an octahedral dimeric structure has been suggested

An Error-Localization, Validation and Optimization Tool for Embedded Code Augmentation: an Architecture Oriented Approach

Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.Embedded systems are usually designed for a single or a specified set of tasks. This specificity means the system design as well as its hardware/software development can be highly optimized. Embedded software must meet the requirements such as high reliability operation on resource-constrained platforms, real time constraints and rapid development. This necessitates the adoption of static machine codes analysis tools running on a host machine for the validation and optimization of embedded system codes, which can help meet all of these goals. This could significantly augment the software quality and is still a challenging field.This dissertation contributes to an architecture oriented code validation, error localization and optimization technique assisting the embedded system designer in software debugging, to make it more effective at early detection of software bugs that are otherwise hard to detect, using the static analysis of machine codes. The focus of this work is to develop methods that automatically localize faults as well as optimize the code and thus improve the debugging process as well as quality of the code.Validation is done with the help of rules of inferences formulated for the target processor. The rules govern the occurrence of illegitimate/out of place instructions and code sequences for executing the computational and integrated peripheral functions. The stipulated rules are encoded in propositional logic formulae and their compliance is tested individually in all possible execution paths of the application programs. An incorrect sequence of machine code pattern is identified using slicing techniques on the control flow graph generated from the machine code.An algorithm to assist the compiler to eliminate the redundant bank switching codes and decide on optimum data allocation to banked memory resulting in minimum number of bank switching codes in embedded system software is proposed. A relation matrix and a state transition diagram formed for the active memory bank state transition corresponding to each bank selection instruction is used for the detection of redundant codes. Instances of code redundancy based on the stipulated rules for the target processor are identified.This validation and optimization tool can be integrated to the system development environment. It is a novel approach independent of compiler/assembler, applicable to a wide range of processors once appropriate rules are formulated. Program states are identified mainly with machine code pattern, which drastically reduces the state space creation contributing to an improved state-of-the-art model checking. Though the technique described is general, the implementation is architecture oriented, and hence the feasibility study is conducted on PIC16F87X microcontrollers. The proposed tool will be very useful in steering novices towards correct use of difficult microcontroller features in developing embedded systems.

Studies on biochemical genetics of the grey mullet Mugil cephalus linnaeus

The thesis deals with the results of an investigation on the "BIOCHEMICAL GENETICS OF MUGIL CEPHALUS" from Cochin, Madras and Orissa. It is presented under the following major headings: Introduction, Review of Literature, Materials and Methods, Results, Discussions, Conclusions, Recommendations, Summary and References.The introduction gives a brief account of historical and modern back ground on the stock concept in fisheries research and management, followed by the importance and potential role of biochemical genetics in the identification of natural units of fisheries management. In the review of literature published reports relevant to biochemical genetics with special reference to that of general proteins and enzyme systems of fish populations were considered. A detailed account of the source of experimental specimens, mode of collection, transportation, sample extraction, gel preparation/gel electrophoresis, buffer systems, staining procedures of proteins/enzymes, standardization of experiments, interpretation of electrophoretic data using basic formulae etc. are given in the materials and methods section. Four important conclusions were drawn on the basis of the results of the present investigation. Three recommendations were also made on the basis of evaluation of the results.

Impact of land reforms on scheduled castes in kerala - a case study

Perhaps the most characteristic feature of our timesis that economic development has become the goal and ambition of people. The needs which this desire creates are immense they are of course urgent everywhere and they cannot be postponded. Consequently there was a frantic search for formulae of rapid economic development. It was claimed that agrarian reform is the indispensable condition for the development of productive forces and industrialization of the state.A key element in the land reform policy is the provision for ownership of land .Measures taken include redistribution of large estates ,assistance to tenants or labourers to acquire holdings and settlement schemes to establish new farming units on reclaimed or developed lands.In this thesis an attempt is made to evaluate the impact of these reforms on the agrarian structure in general and the scheduled caste in particular.

Studies on Larval Nutrition in The Pearl Oyster Pinctada Pucata (Gould)

The present study has yielded a great deal of information on nutrition of pearl oyster larvae. T he formulae presented may be used effectively and with advantage in improving the larval rearing system with specific reference to nutritional aspects. It is also hoped that this is the first comprehensive study on pearl oyster larval nutrition would stimulate further detailed investigations on many of the other finer aspects of tropical bivalve larval nutrition.

A crack on the interface of piezo-electric bodies

Singularities of elastic and electric fields are investigated at the tip of a crack on the interface of two anisotropic piezo-electric media under various boundary conditions on the crack surfaces. The Griffith formulae are obtained for increments of energy functionals due to growth of the crack and the notion of the energy release matrix is introduced. Normalization conditions for bases of singular solution are proposed to adapt them to the energy, stress, and deformation fracture criteria. Connections between these bases are determined and additional properties of the deformation basis related to the notion of electric surface enthalpy are established.