Probabilistic diagnostics with P-graphs

This paper presents a novel approach for solving the probabilistic diagnosis problem in multiprocessor systems. The main idea of the algorithm is based on the reformulation of the diagnostic procedure as a P-graph model. The same, well-elaborated mathematical paradigm - originally used to model material flow - can be applied in our approach to model information flow. This idea is illustrated by deriving a maximum likelihood diagnostic decision procedure. The diagnostic accuracy of the solution is considered on the basis of simulation measurements, and a method of constructing a general framework for different aspects of a complex problem is demonstrated with the use of P-graph models

Gradient based system-level diagnosis

Traditional approaches in system-level diagnosis in multiprocessor systems are usually based on the oversimplified PMC test invalidation model, however Blount introduced a more general model containing conditional probabilities as parameters for different test invalidation situations. He suggested a lookup table based approach, but no algorithmic solution has been elaborated until our P-graph based solution introduced in previous publications. In this approach the diagnostic process is formulated as an optimization problem and the optimal solution is determined. Although the average behavior of the algorithm is quite good, the worst case complexity is exponential. In this paper we introduce a novel group of fast diagnostic algorithms that we named gradient based algorithms. This approach only approximates the optimal maximum likelihood or maximum a posteriori solution, but it has a polynomial complexity of the magnitude of O\left (N \cdot NbCount + N^2\right ), where N is the size of the system and NbCount is number of neighbors of a single unit. The idea of the base algorithm is that it takes an initial fault pattern and iterates till the likelihood of the actual fault pattern can be increased with a single state-change in the pattern. Improvements of this base algorithm, complexity analysis and simulation results are also presented. The main, although not exclusive application field of the algorithms is wafer-scale diagnosis, since the accuracy and the performance is still good even if relative large number of faults are present

Interaction of Intraluminal Tissue and Coronary Sinus Lead Stabilized with Stent Placement

Intraluminal Interaction of Tissue and Stented CS Lead. Introduction: The aim of our investigation was to examine the intraluminal interaction of the vascular tissue and the implanted coronary sinus lead stabilized with stent on two human hearts removed before transplantation. Methods and results: The coronary sinus lumen was sectioned under operational microscope and opened carefully. The leads and stents were found separately positioned beside each other completely covered by an intact intimal tissue layer. No sign of occluding proliferative tissue was observed. Conclusion: Stent fixation technique and extraction of the CS lead in our cases did not have any particular damaging effect on the vascular system

Fejezetek a magyarországi csillagászat történetéből = Selected topics on the history of astronomy in Hungary

Az 1572. évi szupernóva: Kimutattuk, hogy az új csillag komoly politikai mondandót hordozott a kortársak számára. Jacob Schnitzler nagyszebeni csillagász tevékenysége: Megvizsgáltuk a vele kapcsolatos nyomtatványok szerzőségét: tizenhatot maga írt, hetet az adott elnök, egy pedig a barátai és professzorai által hozzá írt üdvözlő verseket tartalmazza. A nagyszombati jezsuiták csillagokról való ismereteinek vizsgálata: Megmutattuk, hogy Mária Terézia 1753-as rendelete után a megjelent könyvek és tézisek színvonala nagyot nőtt, a csillagokat most már a kornak megfelelően definiálták. John Herschel, a Hold és Magyarország: Foglalkoztunk John Herschel 1835-ben tett délafrikai útja kapcsán felröppent hírlapi kacsa magyarországi hatásával. Szathmári Ákos életének és munkásságának tanulmányozása: az első volt, aki Magyar-országon könyvet adott ki a spektroszkópiáról Kövesligethy Radó elméleti asztrofizikai munkássága: Levéltári kutatásokkal gyűjtött újabb adatok felhasználásával elkészítettük Kövesligethy Radó életrajzát. Megmutattuk, hogy Kövesligethy Radó levezetett egy spektrál-egyenletet, amelyben a sugárzás spektrális eloszlása csak a hőmérséklettől függ, a teljes hullámhossz tartományban a kisugárzott energia véges (ezzel 15 évvel megelőzte Max Planckot). Wilhelm Wien előtt 8 évvel felfedezte az eltolódási törvényt. Elsőként adott elméleti magyarázatot a hidrogén színképét leíró Balmer formulára. | The Supernova of 1572: we showed that the new star made an important political message for the contemporaries. Activity of Jacob Schitzler, astronomer of Nagyszeben: we studied the authorship of the printed documents related to him: we found that 16 was written by him 7 by the actual presidents and one contains the poems written to him by his friends and professors. Study the knowledge of the Jesuits of Nagyszombat on the stars: we showed that after the decree of Maria Theresia the standard of the books and theses increased significantly, the definition of the stars was already in accordance with the era. John Herschel, the Moon and Hungary: we studied the effect of the well-known 'Great Moon Hoax' in Hungary published in connection with the trip of John Herschel in South Africa in 1835. Study of Ákos Szathmári's life and work: he was the first in Hungary who published a book on spectroscopy. Radó Kövesligethy's work on theoretical astrophysics: based on new data collected by researches in archives we completed Kövesigethy's biography. We showed that Radó Kövesligethy derived a spectral equation where the spectral distribution depends only on the temperature and the irradiated energy is finite in the whole wavelength range (he preceded Max Planck with 15 years). He discovered the displacement law 8 years before Wilhelm Wien. He was the first who gave a theoretical explanation for Balmers' law of the Hydrogen spectrum

Extreme environment effects on cognitive functions: a longitudinal study in high altitude in Antarctica

K

Invariant Gaussian processes and independent sets on regular graphs of large Girth

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method provides is about 0.438n. Our method uses invariant Gaussian processes on the d-regular tree that satisfy the eigenvector equation at each vertex for a certain eigenvalue λ. We show that such processes can be approximated by i.i.d. factors provided that |λ|≤2d-1. We then use these approximations for λ=-2d-1 to produce factor of i.i.d. independent sets on regular trees. © 2014 Wiley Periodicals, Inc