Deformation of Gabor systems

We introduce a new notion for the deformation of Gabor systems. Such deformations are in general nonlinear and, in particular, include the standard jitter error and linear deformations of phase space. With this new notion we prove a strong deformation result for Gabor frames and Gabor Riesz sequences that covers the known perturbation and deformation results. Our proof of the deformation theorem requires a new characterization of Gabor frames and Gabor Riesz sequences. It is in the style of Beurling's characterization of sets of sampling for bandlimited functions and extends significantly the known characterization of Gabor frames 'without inequalities' from lattices to non-uniform sets.

Highly eccentric hip-hop solutions of the 2N

We show the existence of families of hip-hop solutions in the equal-mass 2N-body problem which are close to highly eccentric planar elliptic homographic motions of 2N bodies plus small perpendicular non-harmonic oscillations. By introducing a parameter ϵ, the homographic motion and the small amplitude oscillations can be uncoupled into a purely Keplerian homographic motion of fixed period and a vertical oscillation described by a Hill type equation. Small changes in the eccentricity induce large variations in the period of the perpendicular oscillation and give rise, via a Bolzano argument, to resonant periodic solutions of the uncoupled system in a rotating frame. For small ϵ ≠ 0, the topological transversality persists and Brouwer's fixed point theorem shows the existence of this kind of solutions in the full system

Phase diagram and complex patterns in the modeling of the bromate-oxalic acid-Ce-acetone oscillating reaction

Simulations have been carried out on the bromate - oxalic acid - Ce(IV) - acetone oscillating reaction, under flow conditions, using Field and Boyd's model (J. Phys. Chem. 1985, 89, 3707). Many different complex dynamic behaviors were found, including simple periodic oscillations, complex periodic oscillations, quasiperiodicity and chaos. Some of these complex oscillations can be understood as belonging to a Farey sequence. The many different behaviors were systematized in a phase diagram which shows that some regions of complex patterns were nested with one inside the other. The existence of almost all known dynamic behavior for this system allows the suggestion that it can be used as a model for some very complex phenomena that occur in biological systems.

Parametric sensitivity analysis for the helium dimers on a model potential

Potential parameters sensitivity analysis for helium unlike molecules, HeNe, HeAr, HeKr and HeXe is the subject of this work. Number of bound states these rare gas dimers can support, for different angular momentum, will be presented and discussed. The variable phase method, together with the Levinson's theorem, is used to explore the quantum scattering process at very low collision energy using the Tang and Toennies potential. These diatomic dimers can support a bound state even for relative angular momentum equal to five, as in HeXe. Vibrational excited states, with zero angular momentum, are also possible for HeKr and HeXe. Results from sensitive analysis will give acceptable order of magnitude on potentials parameters.

Tool-supported invariant-based programming

The development of correct programs is a core problem in computer science. Although formal verification methods for establishing correctness with mathematical rigor are available, programmers often find these difficult to put into practice. One hurdle is deriving the loop invariants and proving that the code maintains them. So called correct-by-construction methods aim to alleviate this issue by integrating verification into the programming workflow. Invariant-based programming is a practical correct-by-construction method in which the programmer first establishes the invariant structure, and then incrementally extends the program in steps of adding code and proving after each addition that the code is consistent with the invariants. In this way, the program is kept internally consistent throughout its development, and the construction of the correctness arguments (proofs) becomes an integral part of the programming workflow. A characteristic of the approach is that programs are described as invariant diagrams, a graphical notation similar to the state charts familiar to programmers. Invariant-based programming is a new method that has not been evaluated in large scale studies yet. The most important prerequisite for feasibility on a larger scale is a high degree of automation. The goal of the Socos project has been to build tools to assist the construction and verification of programs using the method. This thesis describes the implementation and evaluation of a prototype tool in the context of the Socos project. The tool supports the drawing of the diagrams, automatic derivation and discharging of verification conditions, and interactive proofs. It is used to develop programs that are correct by construction. The tool consists of a diagrammatic environment connected to a verification condition generator and an existing state-of-the-art theorem prover. Its core is a semantics for translating diagrams into verification conditions, which are sent to the underlying theorem prover. We describe a concrete method for 1) deriving sufficient conditions for total correctness of an invariant diagram; 2) sending the conditions to the theorem prover for simplification; and 3) reporting the results of the simplification to the programmer in a way that is consistent with the invariantbased programming workflow and that allows errors in the program specification to be efficiently detected. The tool uses an efficient automatic proof strategy to prove as many conditions as possible automatically and lets the remaining conditions be proved interactively. The tool is based on the verification system PVS and i uses the SMT (Satisfiability Modulo Theories) solver Yices as a catch-all decision procedure. Conditions that were not discharged automatically may be proved interactively using the PVS proof assistant. The programming workflow is very similar to the process by which a mathematical theory is developed inside a computer supported theorem prover environment such as PVS. The programmer reduces a large verification problem with the aid of the tool into a set of smaller problems (lemmas), and he can substantially improve the degree of proof automation by developing specialized background theories and proof strategies to support the specification and verification of a specific class of programs. We demonstrate this workflow by describing in detail the construction of a verified sorting algorithm. Tool-supported verification often has little to no presence in computer science (CS) curricula. Furthermore, program verification is frequently introduced as an advanced and purely theoretical topic that is not connected to the workflow taught in the early and practically oriented programming courses. Our hypothesis is that verification could be introduced early in the CS education, and that verification tools could be used in the classroom to support the teaching of formal methods. A prototype of Socos has been used in a course at Åbo Akademi University targeted at first and second year undergraduate students. We evaluate the use of Socos in the course as part of a case study carried out in 2007.

Expressiveness and definability in circumscription

We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P; Z-minimal models of a first-order sentence is Δ-elementary, then it is elementary. That is, whenever the circumscription of a first-order sentence is equivalent to a first-order theory, then it is equivalent to a finitely axiomatizable one. This means that classes of models of circumscribed theories are either elementary or not Δ-elementary. Finally, using the previous result, we prove that, whenever a relation Pi is defined in the class of P; Z-minimal models of a first-order sentence Φ and whenever such class of P; Z-minimal models is Δ-elementary, then there is an explicit definition ψ for Pi such that the class of P; Z-minimal models of Φ is the class of models of Φ ∧ ψ. In order words, the circumscription of P in Φ with Z varied can be replaced by Φ plus this explicit definition ψ for Pi.

Word Equations and Related Topics. Independence, Decidability and Characterizations

The three main topics of this work are independent systems and chains of word equations, parametric solutions of word equations on three unknowns, and unique decipherability in the monoid of regular languages. The most important result about independent systems is a new method giving an upper bound for their sizes in the case of three unknowns. The bound depends on the length of the shortest equation. This result has generalizations for decreasing chains and for more than three unknowns. The method also leads to shorter proofs and generalizations of some old results. Hmelevksii’s theorem states that every word equation on three unknowns has a parametric solution. We give a significantly simplified proof for this theorem. As a new result we estimate the lengths of parametric solutions and get a bound for the length of the minimal nontrivial solution and for the complexity of deciding whether such a solution exists. The unique decipherability problem asks whether given elements of some monoid form a code, that is, whether they satisfy a nontrivial equation. We give characterizations for when a collection of unary regular languages is a code. We also prove that it is undecidable whether a collection of binary regular languages is a code.

Suomen Ilmavoimien johtamisjärjestelmän evoluutio ilmasotateorian, kansallisten instituutioiden ja johtamisjärjestelmän ulkomaisen kehityksen näkökulmasta

Ilmavoimien johtamisjärjestelmä on osa Ilmavoimien järjestelmäkokonaisuutta, jonka kaksi muuta osaa ovat taistelujärjestelmä ja tukeutumisjärjestelmä. Ilmavoimien materiaalista suorituskykyä rakennetaan tämän järjestelmäajattelun pohjalta. tässä tutkimuksessa Ilmavoimien johtamisjärjestelmää tutkitaan kolmen kokonaisuuden, ilmavalvontajärjestelmän, ilmatilannekuvan muodostamisjärjestelmän ja tulenkäytön johtamisjärjestelmän, näkökulmasta. Ilmavoimien johtamisjärjestelmän laajuuden vuoksi tutkimusaluetta on jouduttu rajaamaan. Tutkimus perustuu evoluutioparadigmaan, jonka mukaisesti kaikki olevainen on evolutionaarista. Mikään tässä ajassa oleva ilmiö ei ole historiaton. Jokaisella ilmiöllä on nykyisyytensä lisäksi historia ja tulevaisuus. Evoluutioparadigman avulla laajennetaan Ilmavoimien johtamisjärjestelmän nykyisyyden ymmärtämistä kuvaamalla ja analysoimalla sen evoluutiota. Tutkimusaineistoa analysoidaan käyttäen hyväksi polkuriippuvuutta evolutionaarisena mallina. tätä mallia on käytetty uusinstitutionaalisessa ja evolutionaarisessa taloustieteessä ja taloushistoriassa tutkittaessa yritysten, toimialojen tai tuotteiden pysyvyyttä markkinoilla sekä erilaisten innovaatioiden vaikuttavuutta menestymiseen eri markkinatilanteissa. Tutkimusasetelman lähtökohtana on Ilmavoimien johtamisjärjestelmäevoluution kuvaaminen kolmen tekijän tasapainoasetelman suhteen, joita ovat instituutiot, ilmasotateoria ja kansainvälinen ilmavoimien johtamisjärjestelmän kehitys. tutkimuksen tavoitteena on löytää institutionaalinen logiikka Ilmavoimien johtamisjärjestelmän evoluutiolle sekä sen eri kehitysprosesseihin liittyvä mahdollinen polkuriippuvuuden logiikka. Tutkittavina instituutioina ovat kansallinen poliittinen päätöksenteko, joka ilmentyy erilaisina komiteamietintöjä, raportteina ja selontekoina. Sotilaallista instituutiota edustavat eri operatiiviset ohjeet, ohjesäännöt ja doktriinit, jotka ovat ohjanneet johtamisjärjestelmäkehitystä. Ilmasotateorian vaikuttavuuden analyysiä varten tutkimuskohteiksi on valittu seitsemän merkittävää ilmasotateoreetikkoa. Kenraalimajuri Giulio douhet, ilmamarsalkka Hugh Trenchard ja kenraalimajuri William Mitchell edustavat ilmasotateorian varhaista kautta. Kansallista ilmasotateorian kehitystä edustavat eversti Richard Lorentz ja kenraalimajuri Gustaf Erik Magnusson. Yhdysvaltalaiset everstit John Boyd ja John Warden III ovat uuden ajan ilmasotateoreetikkoja. Näiden henkilöiden tuottamien teorioiden avulla voidaan piirtää kuva muutoksesta, jota ilmasodankäynnin teoreetti- sessa ajattelussa on tapahtunut. Ilmavoimien johtamisjärjestelmän evoluutiolle haetaan vertailua kehityksestä, jota on tapahtunut Yhdysvalloissa, Isossa-Britanniassa ja Saksassa. Ilmavoimat on saanut vaikutteita muistakin maista, mutta näiden maiden kehityksen avulla voidaan selittää Suomessa tapahtunutta kehitystä. Tutkimuksessa osoitetaan, että kansainvälisellä johtamisjärjestelmäevoluutiolla on ollut merkittävä vaikutus suomalaiseen kehitykseen. Tämä tutkimus laajentaa prosessuaalista tutkimusteoriaa ja polkuriippuvuusmallin käyttöä sotatieteelliseen tutkimuskenttään. tutkimus yhdistää toisiinsa aivan uudella tavalla sotilasorganisaation institutionaalisia tekijöitä pitkässä evoluutioketjussa. Tutkimus luo pohjaa prosessuaaliseen, havaintoihin perustuvaan evoluutioajatteluun, jossa eri tekijöiden selitysmalleja ja kausaalisuutta eri periodien aikana voidaan kuvata. Tutkimuksen tuloksena ilmavoimien johtamisjärjestelmäevoluutiossa paljastui merkittäviä piirteitä. Teknologia on ollut voimakas katalysaattori ilmapuolustuksen evoluutiossa. Uusien teknologisten innovaatioiden ilmestyminen taistelukentälle on muuttanut oleellisesti taistelun kuvaa. Sodankäynnin revoluutiosta huolimatta sodankäynnin tai operaatiotaidon ja taktiikan perusperiaatteissa ei ole tapahtunut perustavanlaatuista muutosta. Ilmavoimien johtamisjärjestelmän kehitys on voimakkaasti linkittynyt ulkomaiseen johtamisjärjestelmäkehitykseen, jossa teknologiaimplementaatiot perustuvat usean eri ilmiön paljastumiseen ja hyväksikäyttöön. Sotilas- ja siviili-instituutiot ovat merkittävästi vaikuttaneet Ilmavoimien johtamisjärjestelmän kansalliseen kehitykseen. Ne ovat antaneet poliittisen ohjauksen, taloudellisten resurssien ja strategis-operatiivisten käskyjen ja suunnitelmien avulla perusteet, joiden pohjalta johtamisjärjestelmää on kehitetty. Tutkimus osoittaa, että Suomen taloudellisten resurssien rajallisuus on ollut merkittävin institutionaalinen rajoite Ilmavoimien johtamisjärjestelmää kehitettäessä. Useat poliittiset ohjausasiakirjat ovat korostaneet, ettei Suomella pienenä kansakuntana ole taloudellisia resursseja seurata kansainvälistä sotilasteknologiakehitystä. Lisäksi ulko- ja turvallisuuspoliittinen liikkumavapaus on vaikuttanut kehittämismahdollisuuksiin. Ilmasotateorian evoluutio on luonut johtamisjärjestelmän kehitykselle välttämättömän konseptuaalisen viitekehyksen, jotta ilmasota on voitu viedä käytännön tasolle. Teoria, doktriini ja instituutiot toimivat vuorovaikutuksessa, jossa ne interaktiivisesti vaikuttavat toinen toisiinsa. Tutkimus paljasti kuusi merkittävää sokkia, jotka saivat aikaan radikaaleja muutoksia johtamisjärjestelmän evoluutiopolulla. tutkimuksen perusteella vaikuttavimmat muutoksia aiheuttavat sokit olivat radikaalit turvallisuuspoliittiset muutokset kuten sota ja voimakkaat kansantalouden muutokset kuten lama. Sokkeja aiheuttaneet kuusi ajankohtaa olivat: 1. Puolustusvoimien rakentamisen aloittaminen vapaussodan jälkeen 1918 2. Maailmanlaajuinen lama 1929–1933 ja eurooppalainen rauhanaate 1928–1933 3. Talvi- ja jatkosota 1939–1944 4. Uusi alku Pariisin rauhansopimuksen 1947 ja YYA-sopimuksen 1948 varjossa 5. Kylmän sodan päättyminen ja Suomen lama 1990–1993 6. Maailmanlaajuinen lama 2008- Tutkimuksen perusteella voidaan todeta, että Suomen ilmavoimien johtamisjärjestelmän kehittäminen on perustunut rationaalisiin päätöksiin, jotka ovat saaneet vaikutteita ulkomaisesta ilmasotateorian ja -doktriinien kehityksestä sekä kansainvälisestä johtamisjärjestelmäkehityksestä. Johtamisjärjestelmän evoluutioon on vaikuttanut globaali konvergenssi, johon on tehty kansallisen tason ratkaisuja järjestelmien adaptaation ja implementaation yhteydessä.

Reusable formal architectures for networked systems

Today's networked systems are becoming increasingly complex and diverse. The current simulation and runtime verification techniques do not provide support for developing such systems efficiently; moreover, the reliability of the simulated/verified systems is not thoroughly ensured. To address these challenges, the use of formal techniques to reason about network system development is growing, while at the same time, the mathematical background necessary for using formal techniques is a barrier for network designers to efficiently employ them. Thus, these techniques are not vastly used for developing networked systems. The objective of this thesis is to propose formal approaches for the development of reliable networked systems, by taking efficiency into account. With respect to reliability, we propose the architectural development of correct-by-construction networked system models. With respect to efficiency, we propose reusable network architectures as well as network development. At the core of our development methodology, we employ the abstraction and refinement techniques for the development and analysis of networked systems. We evaluate our proposal by employing the proposed architectures to a pervasive class of dynamic networks, i.e., wireless sensor network architectures as well as to a pervasive class of static networks, i.e., network-on-chip architectures. The ultimate goal of our research is to put forward the idea of building libraries of pre-proved rules for the efficient modelling, development, and analysis of networked systems. We take into account both qualitative and quantitative analysis of networks via varied formal tool support, using a theorem prover the Rodin platform and a statistical model checker the SMC-Uppaal.

Euroopan puolustusneuvosto Boydilaisena tulkintana

Tutkielmassa tutkitaan Euroopan puolustusviraston toiminnallisia mahdollisuuksia boydilaisessa viitekehyksessä. Eversti John Boyd on tunnettu ja arvostettu yhdysvaltalainen strategi, jonka kehittämää OODA-mallia sovelletaan laajasti yhteiskunnan eri osa-alueilla. Päätutkimuskysymyksenä on, millaisia toiminnallisia mahdollisuuksia Euroopan puolustusvirastolla on, ja olisiko perusteltua vaihtaa Puolustusviraston nimi Turvallisuusvirastoksi. Tutkimus on metodologiselta lähtökohdaltaan kvalitatiivinen eli laadullinen kirjallisuus-analyysi. Deduktiivista sisällönanalyysiä käytetään tutkimuksessa luomaan selkeä runko asiakirjoista ja lähteistä, joita tutkimuksen tarpeisiin on kerätty. Aineistona käytetään Boydin omaa materiaalia sekä EU:n asiakirjoja turvallisuudesta, Puolustusviraston perustamisesta ja sen tehtävistä. Tarkasteltaessa Euroopan puolustusvirastoa boydilaisessa viitekehyksessä voidaan havaita viraston tämänhetkisten tehtävien mahdottomuus. Viraston resurssit, tehtävät ja roolitus eivät ole tasapainossa, jolloin tehtävien hoitaminen tuloksellisesti ei ole mahdollista. OODA-mallin soveltuminen viraston tehtävien tukemiseen on vähintäänkin kyseenalaista, koska malli sivuuttaa Euroopan unionin virastojen tärkeimmän elementin, politiikan. Lisäksi malli on liian kaavamainen ja se yksinkertaistaa liikaa monimutkaisia ilmiöitä.

Universal Quantum Cloning

After introducing the no-cloning theorem and the most common forms of approximate quantum cloning, universal quantum cloning is considered in detail. The connections it has with universal NOT-gate, quantum cryptography and state estimation are presented and briefly discussed. The state estimation connection is used to show that the amount of extractable classical information and total Bloch vector length are conserved in universal quantum cloning. The 1  2 qubit cloner is also shown to obey a complementarity relation between local and nonlocal information. These are interpreted to be a consequence of the conservation of total information in cloning. Finally, the performance of the 1  M cloning network discovered by Bužek, Hillery and Knight is studied in the presence of decoherence using the Barenco et al. approach where random phase fluctuations are attached to 2-qubit gates. The expression for average fidelity is calculated for three cases and it is found to depend on the optimal fidelity and the average of the phase fluctuations in a specific way. It is conjectured to be the form of the average fidelity in the general case. While the cloning network is found to be rather robust, it is nevertheless argued that the scalability of the quantum network implementation is poor by studying the effect of decoherence during the preparation of the initial state of the cloning machine in the 1 ! 2 case and observing that the loss in average fidelity can be large. This affirms the result by Maruyama and Knight, who reached the same conclusion in a slightly different manner.

Manifestation of the pairing symmetry in the vortex core structure in iron-based superconductors

The superconducting gap is a basic character of a superconductor. While the cuprates and conventional phonon-mediated superconductors are characterized by distinct d- and s-wave pairing symmetries with nodal and nodeless gap distributions respectively, the superconducting gap distributions in iron-based superconductors are rather diversified. While nodeless gap distributions have been directly observed in Ba1–xKxFe2As2, BaFe2–xCoxAs2, LiFeAs, KxFe2–ySe2, and FeTe1–xSex, the signatures of a nodal superconducting gap have been reported in LaOFeP, LiFeP, FeSe, KFe2As2, BaFe2–xRuxAs2, and BaFe2(As1–xPx)2. Due to the multiplicity of the Fermi surface in these compounds s± and d pairing states can be both nodeless and nodal. A nontrivial orbital structure of the order parameter, in particular the presence of the gap nodes, leads to effects in which the disorder is much richer in dx2–y2-wave superconductors than in conventional materials. In contrast to the s-wave case, the Anderson theorem does not work, and nonmagnetic impurities exhibit a strong pair-breaking influence. In addition, a finite concentration of disorder produces a nonzero density of quasiparticle states at zero energy, which results in a considerable modification of the thermodynamic and transport properties at low temperatures. The influence of order parameter symmetry on the vortex core structure in iron-based pnictide and chalcogenide superconductors has been investigated in the framework of quasiclassical Eilenberger equations. The main results of the thesis are as follows. The vortex core characteristics, such as, cutoff parameter, ξh, and core size, ξ2, determined as the distance at which density of the vortex supercurrent reaches its maximum, are calculated in wide temperature, impurity scattering rate, and magnetic field ranges. The cutoff parameter, ξh(B; T; Г), determines the form factor of the flux-line lattice, which can be obtained in _SR, NMR, and SANS experiments. A comparison among the applied pairing symmetries is done. In contrast to s-wave systems, in dx2–y2-wave superconductors, ξh/ξc2 always increases with the scattering rate Г. Field dependence of the cutoff parameter affects strongly on the second moment of the magnetic field distributions, resulting in a significant difference with nonlocal London theory. It is found that normalized ξ2/ξc2(B/Bc2) dependence is increasing with pair-breaking impurity scattering (interband scattering for s±-wave and intraband impurity scattering for d-wave superconductors). Here, ξc2 is the Ginzburg-Landau coherence length determined from the upper critical field Bc2 = Φ0/2πξ2 c2, where Φ0 is a flux quantum. Two types of ξ2/ξc2 magnetic field dependences are obtained for s± superconductors. It has a minimum at low temperatures and small impurity scattering transforming in monotonously decreasing function at strong scattering and high temperatures. The second kind of this dependence has been also found for d-wave superconductors at intermediate and high temperatures. In contrast, impurity scattering results in decreasing of ξ2/ξc2(B/Bc2) dependence in s++ superconductors. A reasonable agreement between calculated ξh/ξc2 values and those obtained experimentally in nonstoichiometric BaFe2–xCoxAs2 (μSR) and stoichiometric LiFeAs (SANS) was found. The values of ξh/ξc2 are much less than one in case of the first compound and much more than one for the other compound. This is explained by different influence of two factors: the value of impurity scattering rate and pairing symmetry.

Combinatorics on Words. New Aspects on Avoidability, Defect Effect, Equations and Palindromes

In this thesis we examine four well-known and traditional concepts of combinatorics on words. However the contexts in which these topics are treated are not the traditional ones. More precisely, the question of avoidability is asked, for example, in terms of k-abelian squares. Two words are said to be k-abelian equivalent if they have the same number of occurrences of each factor up to length k. Consequently, k-abelian equivalence can be seen as a sharpening of abelian equivalence. This fairly new concept is discussed broader than the other topics of this thesis. The second main subject concerns the defect property. The defect theorem is a well-known result for words. We will analyze the property, for example, among the sets of 2-dimensional words, i.e., polyominoes composed of labelled unit squares. From the defect effect we move to equations. We will use a special way to define a product operation for words and then solve a few basic equations over constructed partial semigroup. We will also consider the satisfiability question and the compactness property with respect to this kind of equations. The final topic of the thesis deals with palindromes. Some finite words, including all binary words, are uniquely determined up to word isomorphism by the position and length of some of its palindromic factors. The famous Thue-Morse word has the property that for each positive integer n, there exists a factor which cannot be generated by fewer than n palindromes. We prove that in general, every non ultimately periodic word contains a factor which cannot be generated by fewer than 3 palindromes, and we obtain a classification of those binary words each of whose factors are generated by at most 3 palindromes. Surprisingly these words are related to another much studied set of words, Sturmian words.

Development and validation of a genotype 3 recombinant protein-based immunoassay for hepatitis E virus serology in swine

Hepatitis E virus (HEV) is classified within the family Hepeviridae, genus Hepevirus. HEV genotype 3 (Gt3) infections are endemic in pigs in Western Europe and in North and South America and cause zoonotic infections in humans. Several serological assays to detect HEV antibodies in pigs have been developed, at first mainly based on HEV genotype 1 (Gt1) antigens. To develop a sensitive HEV Gt3 ELISA, a recombinant baculovirus expression product of HEV Gt3 open reading frame-2 was produced and coated onto polystyrene ELISA plates. After incubation of porcine sera, bound HEV antibodies were detected with anti-porcine anti-IgG and anti-IgM conjugates. For primary estimation of sensitivity and specificity of the assay, sets of sera were used from pigs experimentally infected with HEV Gt3. For further validation of the assay and to set the cutoff value, a batch of 1100 pig sera was used. All pig sera were tested using the developed HEV Gt3 assay and two other serologic assays based on HEV Gt1 antigens. Since there is no gold standard available for HEV antibody testing, further validation and a definite setting of the cutoff of the developed HEV Gt3 assay were performed using a statistical approach based on Bayes' theorem. The developed and validated HEV antibody assay showed effective detection of HEV-specific antibodies. This assay can contribute to an improved detection of HEV antibodies and enable more reliable estimates of the prevalence of HEV Gt3 in swine in different regions.