601 research outputs found
Binary plane partitions with cells of bounded complexity
No full textAbstract Binary Plane Partitions with Cells of Bounded Complexity by Henrik Sarkssian A binary plane partition (BPP) for a set of disjoint line segments in Euclidean plane is a simple hierarchical decomposition of a convex cell in the plane into convex faces by partitioning along lines. Given a finite set of disjoint segments in a convex cell in R2, a BPP partitions the plane (and some of the line segments) along a line and recurses on the segments left or clipped in each of the regions created after partitioning. The generalization of BPP to higher dimensions is binary space partition (BSP) in which we are given disjoint objects in a convex cell, and we recursively partition this cell by hyper planes. The size of BSP is defined to be the number of fragments that the input objects are partitioned into.We show that to prove an asymptotic upper bound for the size of BSP, one can investigate equivalently the number of regions generated by partitioning or one can instead count the number of events where a segment is cut. Based on previous work by Dr. Csaba Toth it is known that a convex cell with n disjoint segments inside the cell admits a BSP of size O(nlnn/lnlnn), and this bound is the best possible [1,2]. In this thesis we investigate BSPs with the additional restriction that all cells have constant description complexity; typically these cells will be vertical trapezoid.Includes bibliographical references (pages 41-41)California State University, Northridge. Department of Mathematics
On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance
No full textWe revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given epsilon>0, choose a minimum size subsequence of the vertices of the input such that the Hausdorff or Fréchet distance between the input and output polylines is at most epsilon. We analyze how the well-known Douglas-Peucker and Imai-Iri simplification algorithms perform compared to the optimum possible, also in the situation where the algorithms are given a considerably larger error threshold than epsilon. Furthermore, we show that computing an optimal simplification using the undirected Hausdorff distance is NP-hard. The same holds when using the directed Hausdorff distance from the input to the output polyline, whereas the reverse can be computed in polynomial time. Finally, to compute the optimal simplification from a polygonal line consisting of n vertices under the Fréchet distance, we give an O(kn^5) time algorithm that requires O(kn^2) space, where k is the output complexity of the simplification
A kriminalisztika tendenciái — Fenyvesi Csaba monográfiája
No full textThe book review presents the unique monograph of Csaba Fenyvesi. The author presents the concept, history and future of criminalistics, furthermore, he also demonstrates the “pyramid of criminalistics” created by himself. The author’s approach is truly innovative; his point of view differs from any other works published in Hungarian. Based on nearly 800 valuable national and international references the work represents high academic standards.Jelen recenzió Fenyvesi Csaba egyedülálló monográfiáját mutatja be, amelyben a szerző feldolgozza a kriminalisztika fogalmát, történetét, jövőjét, és ismerteti az általa megalkotott „kriminalisztika piramisát”. Mindezt olyan új nézőpontból és innovatív módon teszi, ahogy eddig azt az érdeklődők magyar nyelven még nem olvashatták. A közel nyolcszáz tételes értékes hazai és nemzetközi hivatkozás pedig színvonalassá teszi a művet
Check list of the Hungarian Salticidae with biogeographical notes
No full textAn updated check list of the Hungarian jumping spider fauna is presented. 70, species are recorded from Hungary so far. Four species are new to the Hungarian fauna: Hasarius adansoni, Neon valentulus, Sitticus caricis, Synageles subcingulatus. With 12 original drawings
Summary Report Of Working Group 8: Laser Technology For Laser-Plasma Accelerators
No full textLaser Technology has long been the limiting and the enabling step for laser plasma accelerators. The work presented here addressed the current and near future laser technology relevant to particle acceleration as well as laser technology challenges for future accelerator facilities. Many laser facilities are operating or will be operating shortly at high intensity, high peak power, and with good beam parameters.Physic
On the Upward Planarity of Mixed Plane Graphs
No full textA mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed plane graph TeX . In this paper, we study the computational complexity of testing whether a given mixed plane graph G is upward planar, i.e., whether it admits an orientation resulting in a directed plane graph G such that G admits a planar drawing in which each edge is represented by a curve monotonically increasing in the y-direction according to its orientation.
Our contribution is threefold. First, we show that the upward planarity testing problem is solvable in cubic time for mixed outerplane graphs. Second, we show that the problem of testing the upward planarity of mixed plane graphs reduces in quadratic time to the problem of testing the upward planarity of mixed plane triangulations. Third, we exhibit linear-time testing algorithms for two classes of mixed plane triangulations, namely mixed plane 3-trees and mixed plane triangulations in which the undirected edges induce a forest
Bounds on the maximum multiplicity of some common geometric graphs
No full textWe obtain new lower and upper bounds for the maximum multiplicity of some weighted, and respectively non-weighted, common geometric graphs drawn on points in the plane in general position (with no three points collinear): perfect matchings, spanning trees, spanning cycles (tours), and triangulations.
(i) We present a new lower bound construction for the maximum number of triangulations a set of points in general position can have. In particular, we show that a generalized double chain formed by two almost convex chains admits Omega (8.65^n) different triangulations. This improves the bound Omega (8.48^n) achieved by the previous best construction, the double zig-zag chain studied by Aichholzer et al.
(ii) We present a new lower bound of Omega(11.97^n) for the number of non-crossing spanning trees of the double chain composed of two convex chains. The previous bound, Omega(10.42^n), stood unchanged for more than 10 years.
(iii) Using a recent upper bound of 30^n for the number of triangulations, due to Sharir and Sheffer, we show that n points in the plane in general position admit at most O(68.664^n) non-crossing spanning cycles.
(iv) We derive exponential lower bounds for the number of maximum and minimum weighted geometric graphs (matchings, spanning trees, and tours). It was known that the number of longest non-crossing spanning trees of a point set can be exponentially large, and here we show that this can be also realized with points in convex position. For points in convex position we obtain tight bounds for the number of longest and shortest tours. We give a combinatorial characterization of the longest tours, which leads to an O(n log n) time algorithm for computing them
„Add nekem a tényt, és én szolgáltatom neked a jogot” : Interjú a 80 éves Tremmel Flórián professzorral = „Give me the fact and I serve you justice” : Interview with the 80 years old Prof. Flórián Tremmel
No full textProfessor Dr. Flórián Tremmel, an acknowledged Hungarian scholar of criminal law, paints and writes maqamat in his leisure time. The above-mentioned rhymed prose excellently expresses Flórián Tremmels vocation, even affection for education and science. His adherents call him simple Master. Csaba Fenyvesi, who envisions himself as a follower of professor Tremmel, considers the quartet of knowledge, affection, humour and order as the Master’s Ars Poetica. Professor Fenyvesi means that these four key words ‘…can serve as guidelines in the activity of a law scholar, and so of the celebrated person, in his activity, mental conception, charisma, and what can be formulated - perhaps not exaggerating – also as an Ars Poetica for a law scholar, a school creating real Master.’ Flórián Tremmel was born in Szombathely in 1941. He took his A-levels in the Premonstratensian secondary School „Nagy Lajos” in Szombathely and received his diploma at the Faculty of Law of the University of Pécs with the grade ‘summa cum laude’. After his certification he became first trainee then assistant lecturer and assistant professor at the Faculty of Procedural Law. In 1982, after defence of his dissertation in the topic civil suit, he became candidate. From 1991 he was appointed as leader of the Chair for Criminal Procedural Law. In 1994 he habilitated with his lecture ‘The Legal Remedy System of Criminal Procedural Law’ and he was appointed as university professor in the same year. In 2005 he became leader of the Chair for Criminal Procedural Law and Criminalistics and from 2007 he has worked as professor emeritus. FlóriánTremmel has actively participated both in Hungarian and in international scientific public life. In 2003 he was organizer of the subsection criminal sciences at the anniversary conference ‘Law and lawyers on the edge of the 21st century’, in 2004 he organised the international conference titled ‘Physicians and lawyers in the criminal jurisdiction.’ He created the continuously expanding international legal forum, the Central European Criminal Cooperation in 2003. For his scientific and educational activities, he was priced with Officer Cross of the Merit of the Hungarian Republic in 2005, with Gold Grade of the merit Pro Facultate Iuridico-Politica Universitatis Quinqueecclesiensis in 2006 and with the Golden Professorship price in 2007. He presented more hundred publications, he has been author of numerous books, parts of book and papers. His most important works are: the textbook Hungarian Criminal Procedure, Civil Suit, the textbook and atlas Criminalistics (with co-author Csaba Fenyvesi), Evidence Theory, Rhetoric in the Judiciary, Evidences in the Criminal Procedure, New Hungarian Criminal Procedure (co-authors Csaba Fenyvesi and Csongor Herke), Basic Principles of Criminal Procedure in the Basic Law, The Theory of Criminal Procedural Law (co-authors Csaba Fenyvesi and Csongor Herke), Evidences in Criminal Procedure. Prof. Dr. FlóriánTremmel was interviewed on the occasion of his eightieth birthday by Valér Dános, editor-in-chief of Belügyi Szemle and Csaba Szabó managing editor.Dr. Tremmel Flórián professzor, a büntetőeljárási jog elismert magyarországi tudósa szabadidejében festeget és makamákat ír. A fent idézett rímes próza jól kifejezi Tremmel Flóriánnak az oktatás, a tudomány iránti mérhetetlen elhivatottságát, mi több, szeretetét. Követői egyszerűen Mesternek hívták. Fenyvesi Csaba, aki Tremmel professzor tanítványának tartja magát, a Mester ars poeticáját a tudás, a szeretet, a humor és a rend kvartettjében látja. Fenyvesi professzor szerint e négy kulcsszó „… vezérfonalul szolgálhat egy jogtanár, így az ünnepelt tevékenységében, szellemi felfogásában, kisugárzásában és amely – talán nem túlzó állítás – ars poetica-ként is megfogalmazható egy jogtanár, egy (iskolát teremtő) igazi Mester számára.” Tremmel Flórián 1941-ben Szombathelyen született. A szombathelyi premontrei Nagy Lajos gimnáziumban érettségizett, 1964-ben a Pécsi Tudományegyetem Állam- és Jogtudományi Karán szerzett summa cum laude diplomát. Az egyetem elvégzését követően az Eljárásjogi Tanszéken előbb gyakornok, tanársegéd, majd adjunktus lett. 1982-ben a magánvád körében írt disszertáció megvédésével kandidátusi címet szerzett. 1991-től a Büntető Eljárásjogi Tanszék vezetőjének nevezték ki. 1994-ben „A büntetőeljárás jogorvoslati rendszere” című előadással habilitált, és még abban az évben egyetemi tanárrá nevezték ki. 2005-től a Büntető Eljárásjogi és Kriminalisztikai Tanszék vezetője lett, 2007-től pedig professor emeritusként dolgozik. Tremmel Flórián a hazai és nemzetközi tudományos közéletben egyarán aktívan részt vett. 2003-ban a „Jog és jogászok a 21. század küszöbén” címmel rendezett jubileumi konferencián a bűnügyi tudományok alszekciójának szervezője volt, 2004-ben „Orvosok és jogászok a büntető igazságszolgáltatásban” címmel nemzetközi konferenciát szervezett. Ő hozta létre 2003-ban az egyre bővülő nemzetközi jogi fórumot, a Közép-Európai Bűnügyi Együttműködést. Tudományos és oktatói tevékenységét 2005-ben a Magyar Köztársasági Érdemrend Tisztikeresztjével, 2006-ban a Pro Facultate Iuridico- Politica Universitatis Quinqueecclesiensis érdemérem arany fokozatával, 2007-ben pedig Arany Katedra-díjjal ismerték el. Több mint száz publikációja jelent meg, számos könyv, könyvrészlet, tanulmány szerzője. Legjelentősebb munkái a Magyar Büntetőeljárás tankönyv, a Magánvád, a Kriminalisztika tankönyv és atlasz (Fenyvesi Csaba társszerzővel), a Bizonyításelmélet, az Igazságügyi retorika, a Bizonyítékok a büntetőeljárásban, az Új magyar büntetőeljárás (társszerző Fenyvesi Csaba és Herke Csongor), a Büntetőeljárási alapelvek az Alaptörvényben, A büntető eljárásjog elmélete (társszerző Fenyvesi Csaba és Herke Csongor), a Bizonyítékok a büntetőeljárásban. Prof. dr. Tremmel Flóriánnal nyolcvanadik születésnapja alkalmából Dános Valér, a Belügyi Szemle főszerkesztője és Szabó Csaba felelős szerkesztő beszélgetett
Paratenic hosts for the parasitic nematode Anguillicola crassus in Lake Balaton, Hungary
No full textA 1 yr study was conducted to determine which fish species may play a role in the life cycle of Anguillicola crassus in various habitats of Lake Balaton, Hungary. The prevalence and intensity of the larval infection of fish species acting as paratenic hosts was studied, and observations were made on the types of paratenic host reactions against larvae. With the exception of 1 species, all 20 fish species were infected by A. crassus larvae; however, the prevalence and intensity of infection varied widely. Six species (asp, white bream, Chinese rasbora, pike, river goby, European catfish), hitherto unreported as paratenic hosts, also proved to be infected by larvae in Lake Balaton. Of the 13 fish species examined in large numbers, ruffe and European catfish showed the highest prevalence of infection (100 %), followed by river goby (83 %), white bream (79 %) and bleak (68 %). Of these 13 fish species, ruffe showed the highest intensity of infection by live larvae (mean intensity: 39.3 3rd stage larvae, L3), followed by European catfish (mean number of live larvae: 26.9) and river goby (mean number of live larvae: 9.1). The mean number of live L3 in bleak, a species regarded as the principal food source for eels, was 4.1. Specimens containing only dead or both dead and live larvae were much more common in cyprinid fishes than in species belonging to other taxonomical entities. In these fish, the process of encapsulation and subsequent necrosis of live larvae could also be observed. With knowledge of the feeding habits of eels, it appears that bleak play the most important role in the transmission of anguillicolosis. Other intensively infected fish species (e.g. ruffe) may also contribute to massive infection of individual eels, even if they have a lower share in the eels' food structure
- …
