DOCSLIB.ORG

A Web Based Software System for Bone and Joint Infections in Children

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Web Based Software System for Bone and Joint Infections in Children 44 International Journal of User-Driven Healthcare, 2(4), 44-56, October-December 2012 A Web Based Software System for Bone and Joint Infections in Children Vaia Tsioutsiou, Laboratory for Graphics, Multimedia & GIS, Computer & Informatics Engineering Department, University of Patras, 26500, Hellas, Greece Vasileios Syrimpeis, Laboratory for Graphics, Multimedia & GIS, Computer & Informatics Engineering Department, University of Patras, 26500, Hellas, Greece Giannis Tzimas, Laboratory for Graphics, Multimedia & GIS, Computer & Informatics Engineering Department, University of Patras, 26500, Hellas, Greece George Sdougkos, “Karamandaneio” Children Hospital of Patras, Orthopaedic Department, 26225, Hellas, Greece Athanasios Tsakalidis, Laboratory for Graphics, Multimedia & GIS, Computer & Informatics Engineering Department, University of Patras, 26500, Hellas, Greece Elias Panagiotopoulos, University Hospital of Patras, Orthopaedic Department, 26501, Hellas, Greece ABSTRACT This paper presents a web based system for recording, monitoring, and studying pediatric patients with bone and joint infections. A rapid prototyping method was followed based on Adobe Fireworks CS3. The database is developed in MySQL. The application is based on PHP and JavaScript. The system’s architecture and design are based on three principles; “to follow the way Medical Doctors think and work,” “to make Medical Doctors work easier and faster,” and “to record scientifically validated data elements for research.” The developed system is “doctor-friendly” because it is based on classifications and knowledge grouping specialized on children infections on bones and joints, using the experience of Medical experts on the field. The benefits of the system expand to Patients, Medical Doctors, HealthCare Systems, Research & Science and every day clinical practice. Keywords: Children Infections, Clinical Informatics, Clinical Software, Medical Informatics, Osteomyelitis in Children, Septic Arthritis, Web-Based Software DOI: 10.4018/ijudh.2012100108 Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. International Journal of User-Driven Healthcare, 2(4), 44-56, October-December 2012 45 INTRODUCTION is isolated and antibiotic susceptibilities are determined, is also a domain for research. Bones’ and joints’ infections among children are For example, there is little information on the usually caused by bacteria, leading to prolonged use of trimethoprim-sulfamethoxazole in the antibiotic administration and hospitalization. treatment of invasive MRSA infections (Adra The management of children with diagnosed or & Lawrence, 2004) moreover the role of dapto- suspected infections in bones and joints remains mycin in the treatment of MRSA osteomyelitis a challenge. However, over the past 15 years, in children is unclear (Bradley, 2005). increasing microbial virulence combined with Starting from pathogenesis to microbiol- antibiotic resistance as well as advances in ogy, clinical manifestations, diagnosis and imaging techniques and diagnostic molecular treatment, a variety of issues still remains un- microbiology has led to an increased quantity clear requiring a systematic and more detailed and variety of new medical data (Kaplan, 2005). medical data collection for further research. The Infections of bones and joints in children amount of information required or worthy for occur haematogenously in most of the cases, medical research is increasing and as a result, es- although injury to the site of the bone infection sential elements are often not recorded and lost. is usually referred in the history. Therefore, the In addition, there is significant variation in role of injury in the pathogenesis of bones and terminology and data reporting among differ- joints infections in children remains unclear ent medical specialties that treat bone and joint (Stott, 2001). infections in children, such as Paediatrics and By far, the most common bacterial pathogen Children Orthopaedics, or even among medical causing osteomyelitis in children is Staphy- doctors of the same specialty. lococcus aureus in all age groups (Krogstad, This paper presents a web based system 2004). Group A Streptococcus (Ibia, Imoisili, for recording, monitoring and studying children & Pikas, 2003), Streptococcus pneumonia with infections of bones and joints that requires (Bradley, 2005), and the emerging pathogen almost no text entry and editing and could be Kingella kingae (Yagupsky & Dagan, 1997) accessed through any electronic device with are the next most common organisms in infants an internet connection and a web browser. and children. The list of pathogens continues, Furthermore, our goal was to create a system in parallel with a variety of predisposing risk containing most of the scientifically validated factors leading to an area for further research. data elements, reducing omissions and improv- Infections of bones and joints tend to be ing consistency by standardising the reporting more diffuse in infants because of low anatomic language among medical doctors. One of the barriers to limit the spread of infection (Kaplan, benefits lays in the output of the system that con- 2005). In addition, new manifestations of acute tains all of the entered scientifically validated osteomyelitis are associated with clones of elements that are easily exploited for medical community-associated methicillin-resistant S. research issues using standard SQL commands. aureus (CA-MRSA) carrying the genes encod- In addition, the system’s interface architecture ing Panton-Valentine leukocidin (pvl) (Kaplan, is based on the traditional medical way of 2005; Sdougkos, Chini, & Papanastasiou, 2008). thinking and acting, (starting from History to In almost half of children with acute Physical Examination, then to Laboratory Tests osteomyelitis, a bacterial etiology is never es- and Imaging Examinations, etc.) providing a tablished (Floyed & Steele, 2003). Therefore, “doctor-friendly” system. Therefore, it requires polymerase chain reaction (PCR) may become almost no training, helping Medical Doctors to an important diagnostic tool (Moumile, Merckx, work easier and in a faster way. & Glorion, 2003). The remainder of the paper is organized The empiric regimens and the modifica- as follows. First, the methods used for the tion of antibiotic treatment once an organism design, development, testing and validation Copyright © 2012, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. 11 more pages are available in the full version of this document, which may be purchased using the "Add to Cart" button on the publisher's webpage: www.igi- global.com/article/web-based-software-system-bone/75181 Related Content Choosing Technologies for Handheld and Ubiquitous Decision Support Darren Woollatt, Paul Koop, Sara Jones and Jim Warren (2007). International Journal of Healthcare Information Systems and Informatics (pp. 1-11). www.irma-international.org/article/choosing-technologies-handheld-ubiquitous-decision/2207 Registry for Medical Devices: An e-Health Infrastructure for Needs Assessment, Procurement and Management of Medical Devices George Pappous, Tarsi Giannouli and Evi Saratsioti (2014). International Journal of Reliable and Quality E-Healthcare (pp. 19-31). www.irma-international.org/article/registry-for-medical-devices/111463 Automated Glucose Control: A Review Owais Bhat, Dawood A. Khan and Rameez Yousuf (2021). International Journal of E- Health and Medical Communications (pp. 1-18). www.irma-international.org/article/automated-glucose-control/284585 Radio Frequency Identification Technology as an Analytical Lens and Solution in Hospitals: A Novel Approach in BPR/BPM Chandana Unnithan and Bardo Fraunholz (2015). Healthcare Informatics and Analytics: Emerging Issues and Trends (pp. 194-211). www.irma-international.org/chapter/radio-frequency-identification-technology-as-an-analytical- lens-and-solution-in-hospitals/115115 Case Study: Glaucoma and Epidemic Dropsy - A Past Possible Association Revisited Swarna Biseria Gupta, Divya Verma and D. P. Singh (2014). International Journal of User-Driven Healthcare (pp. 31-37). www.irma-international.org/article/case-study/124093.
Load more

Recommended publications
  • Efficient Algorithms for Handling Molecular Weighted Sequences
    EFFICIENT ALGORITHMS FOR HANDLING MOLECULAR WEIGHTED SEQUENCES Costas S. Iliopoulos‚1 Christos Makris‚2‚3 Yannis Panagis‚2‚3 Katerina Perdikuri‚2‚3 Evangelos Theodoridis‚2‚3 and Athanasios Tsakalidis‚2‚3 1 Department of Computer Science King’s College London‚ Strand‚ London WC2R2LS England [email protected] 2 Department of Computer Engineering and Informatics University of Patras‚ 26500 Patras Greece {makri‚ panagis‚ perdikur‚ theodori}@ceid.upatras.gr 3Research Academic Computer Technology Institute 61 Riga Feraiou Str.‚ 26221 Patras Greece [email protected] Abstract In this paper we introduce the Weighted Suffix Tree‚ an efficient data struc- ture for computing string regularities in weighted sequences of molecular data. Molecular Weighted Sequences can model important biological processes such as the DNA Assembly Process or the DNA-Protein Binding Process. Thus pattern matching or identification of repeated patterns‚ in biological weighted sequences is a very important procedure in the translation of gene expression and regulation. We present time and space efficient algorithms for constructing the weighted suffix tree and some applications of the proposed data structure to problems taken from the Molecular Biology area such as pattern matching‚ re- peats discovery‚ discovery of the longest common subsequence of two weighted sequences and computation of covers. Keywords: Molecular Weighted Sequences‚ Suffix Tree‚ Pattern Matching‚ Identifications of repetitions‚ Covers. 1 Introduction Molecular Weighted Sequences appear in various applications of Computational Molecular Biology. A molecular weighted sequence is a molecular sequence (either a sequence of nucleotides or aminoacids)‚ where each character in every position is as- 266 signed a certain weight. This weight could model either the probability of appearance of a character or the stability that the character contributes in a molecular complex.
    [Show full text]
  • Lecture Notes in Computer Science 7451 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan Van Leeuwen
    Lecture Notes in Computer Science 7451 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany Christian Böhm Sami Khuri Lenka Lhotská M. Elena Renda (Eds.) InformationTechnology in Bio- and Medical Informatics Third International Conference, ITBAM 2012 Vienna, Austria, September 4-5, 2012 Proceedings 13 Volume Editors Christian Böhm Ludwig-Maximilians-University, Department of Computer Science Oettingenstraße 67, 80538 München, Germany E-mail: [email protected]fi.lmu.de Sami Khuri San José State University, Department of Computer Science One Washington Square, San José, CA 95192-0249, USA E-mail: [email protected] Lenka Lhotská Czech Technical University, Faculty of
    [Show full text]
  • CCIS Springer Series
    Communications in Computer and Information Science 384 Editorial Board Simone Diniz Junqueira Barbosa Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Rio de Janeiro, Brazil Phoebe Chen La Trobe University, Melbourne, Australia Alfredo Cuzzocrea ICAR-CNR and University of Calabria, Italy Xiaoyong Du Renmin University of China, Beijing, China Joaquim Filipe Polytechnic Institute of Setúbal, Portugal Orhun Kara TÜBITAK˙ BILGEM˙ and Middle East Technical University, Turkey Igor Kotenko St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences, Russia Krishna M. Sivalingam Indian Institute of Technology Madras, India Dominik Sle´ ˛zak University of Warsaw and Infobright, Poland Takashi Washio Osaka University, Japan Xiaokang Yang Shanghai Jiao Tong University, China Lazaros Iliadis Harris Papadopoulos Chrisina Jayne (Eds.) Engineering Applications of Neural Networks 14th International Conference, EANN 2013 Halkidiki, Greece, September 13-16, 2013 Proceedings, Part II 13 Volume Editors Lazaros Iliadis Democritus University of Thrace, Orestiada, Greece E-mail: [email protected] Harris Papadopoulos Frederick University of Cyprus, Nicosia, Cyprus E-mail: [email protected] Chrisina Jayne Coventry University, UK E-mail: [email protected] ISSN 1865-0929 e-ISSN 1865-0937 ISBN 978-3-642-41015-4 e-ISBN 978-3-642-41016-1 DOI 10.1007/978-3-642-41016-1 Springer Heidelberg New York Dordrecht London Library of Congress Control Number: Applied for CR Subject Classification (1998): I.2.6, I.5.1, H.2.8, J.2, J.1, J.3, F.1.1, I.5, I.2, C.2 © Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright.
    [Show full text]
  • Editorial Alexander B. Sideridis Athanasios Tsakalidis Constantina
    Int. J. Electronic Democracy, Vol. 1, No. 2, 2009 119 Editorial Alexander B. Sideridis Informatics Laboratory, Agricultural University of Athens, 75 Iera Odos, 118 55 Athens, Greece E-mail: [email protected] Athanasios Tsakalidis Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, Greece E-mail: [email protected] Constantina Costopoulou Informatics Laboratory, Agricultural University of Athens, 75 Iera Odos, 118 55 Athens, Greece E-mail: [email protected] Andreja Pucihar Faculty of Organizational Sciences, University of Maribor, Kidriceva cesta 55a, 4000 Kranj, Slovenia E-mail: [email protected] Vasilis Zorkadis Hellenic Data Protection Authority, Kifissias 1-3, 115 23 Athens, Greece E-mail: [email protected] Biographical notes: Alexander B. Sideridis is Professor and Head of the Informatics Laboratory of the Agricultural University of Athens. He earned his first degree at the University of Athens and his MSc and PhD from Brunel University. He has been the project leader of more than 30 successful national and international projects and has published more than 180 scientific papers in management and decision support systems, computer networking related to local and central administration activities, advanced computational numerical modelling, informatics and impact of computers in society and agricultural informatics. Copyright © 2009 Inderscience Enterprises Ltd. 120 A.B. Sideridis et al. Athanasios Tsakalidis is a Professor in the Department of Computer Engineering and Informatics of the University of Patras since 1993. He completed his Diploma in Mathematics in 1973 (University of Thessaloniki), his studies and his PhD in Informatics in 1980 and 1983 respectively (University of Saarland, Germany). From 1983 to 1989, he worked as a researcher at the University of Saarland.
    [Show full text]
  • Graph Community Discovery Algorithms in Neo4j with a Regularization-Based Evaluation Metric
    Graph Community Discovery Algorithms in Neo4j with a Regularization-based Evaluation Metric Andreas Kanavos, Georgios Drakopoulos and Athanasios Tsakalidis Computer Engineering and Informatics Department, University of Patras, Achaia 26504, Greece Keywords: CNM Algorithm, Community Discovery, Graph Databases, Graph Mining, Graph Signal Processing, Louvain Algorithm, Newman-Girvan Algorithm, Neo4j, Regularization, Walktrap Algorithm. Abstract: Community discovery is central to social network analysis as it provides a natural way for decomposing a social graph to smaller ones based on the interactions among individuals. Communities do not need to be disjoint and often exhibit recursive structure. The latter has been established as a distinctive characteristic of large social graphs, indicating a modularity in the way humans build societies. This paper presents the im- plementation of four established community discovery algorithms in the form of Neo4j higher order analytics with the Twitter4j Java API and their application to two real Twitter graphs with diverse structural properties. In order to evaluate the results obtained from each algorithm a regularization-like metric, balancing the global and local graph self-similarity akin to the way it is done in signal processing, is proposed. 1 INTRODUCTION los et al., 2015b) (Drakopoulos et al., 2016). To this end, a coherence metric balancing global and local Twitter is currently the most popular microblogging self-similarity properties with a rationale similar to platform and the stage for ongoing political, finan- the signal processing regularization criterion 2 2 cial, and cultural conversations with a vast amount K = x As + µ0 Bs , µ0 > 0 (1) of tweets being posted on a daily basis. Decom- k − k k k posing a Twitter social graph to communities yields which given a data vector x, possibly with noise and a deeper insight to these seemingly chaotic interac- outliers, computes a smoother version s thereof by tions.
    [Show full text]
  • Detecting Perturbed Subpathways Towards Mouse Lung Regeneration Following H1N1 Influenza Infection
    computation Article Detecting Perturbed Subpathways towards Mouse Lung Regeneration Following H1N1 Influenza Infection Aristidis G. Vrahatis 1,*, Konstantina Dimitrakopoulou 2, Andreas Kanavos 1, Spyros Sioutas 3 and Athanasios Tsakalidis 1 1 Department of Computer Engineering and Informatics, University of Patras, Patras 26500, Greece; [email protected] (A.K.); [email protected] (A.T.) 2 Centre for Cancer Biomarkers CCBIO and Computational Biology Unit, Department of Informatics, University of Bergen, Bergen 5020, Norway; [email protected] 3 Department of Informatics, Ionian University Corfu, Corfu 49100, Greece; [email protected] * Correspondence: [email protected]; Tel.: +30-694-767-7069 Academic Editor: Demos T. Tsahalis Received: 31 December 2016; Accepted: 29 March 2017; Published: 3 April 2017 Abstract: It has already been established by the systems-level approaches that the future of predictive disease biomarkers will not be sketched by plain lists of genes or proteins or other biological entities but rather integrated entities that consider all underlying component relationships. Towards this orientation, early pathway-based approaches coupled expression data with whole pathway interaction topologies but it was the recent approaches that zoomed into subpathways (local areas of the entire biological pathway) that provided more targeted and context-specific candidate disease biomarkers. Here, we explore the application potential of PerSubs, a graph-based algorithm which identifies differentially activated disease-specific subpathways. PerSubs is applicable both for microarray and RNA-Seq data and utilizes the Kyoto Encyclopedia of Genes and Genomes (KEGG) database as reference for biological pathways. PerSubs operates in two stages: first, identifies differentially expressed genes (or uses any list of disease-related genes) and in second stage, treating each gene of the list as start point, it scans the pathway topology around to build meaningful subpathway topologies.
    [Show full text]
  • Storage Efficient Trajectory Clustering and K-NN for Robust Privacy
    algorithms Article Storage Efficient Trajectory Clustering and k-NN for Robust Privacy Preserving Spatio-Temporal Databases Elias Dritsas *, Andreas Kanavos, Maria Trigka, Spyros Sioutas and Athanasios Tsakalidis Computer Engineering and Informatics Department, University of Patras, 26504 Patras, Greece; [email protected] (A.K.); [email protected] (M.T.); [email protected] (S.S.); [email protected] (A.T.) * Correspondence: [email protected]; Tel.: +30-2610-996959 Received: 30 October 2019; Accepted: 7 December 2019; Published: 11 December 2019 Abstract: The need to store massive volumes of spatio-temporal data has become a difficult task as GPS capabilities and wireless communication technologies have become prevalent to modern mobile devices. As a result, massive trajectory data are produced, incurring expensive costs for storage, transmission, as well as query processing. A number of algorithms for compressing trajectory data have been proposed in order to overcome these difficulties. These algorithms try to reduce the size of trajectory data, while preserving the quality of the information. In the context of this research work, we focus on both the privacy preservation and storage problem of spatio-temporal databases. To alleviate this issue, we propose an efficient framework for trajectories representation, entitled DUST (DUal-based Spatio-temporal Trajectory), by which a raw trajectory is split into a number of linear sub-trajectories which are subjected to dual transformation that formulates the representatives of each linear component of initial trajectory; thus, the compressed trajectory achieves compression ratio equal to M : 1. To our knowledge, we are the first to study and address k-NN queries on nonlinear moving object trajectories that are represented in dual dimensional space.
    [Show full text]
  • Agli Tk Tm Hlh a Glimpse at Kurt Mehlhorn
    Honorary Doctorate Ceremony 8 November 2017, University of Patras, Greece A Glimpse at KKturt MhlhMehlhorn by Christos Zaroliagis Education & Career Date/Period Education & employment 29.08 .1949 Born in Ingolstadt (Bavaria, Germany) 1968 – 1971 Studies in Computer Science & Math at TU Munich 1971 – 1974 PhD studies in Computer Science, Cornell University, USA PhD Thesis: “Polynomial and Abstract Subrecursive Classes” Advisor Prof. Bob Constable 1971 – 1974 Studienstiftung des Deutschen Volkes 1973 – 1974 Cornell University Fellowship 1974 – 1975 Research Associate at the Department of Computer Science, Universität des Saarlandes, Germany 1975 –today Professor of Computer Science, Universität des Saarlandes, Germany 1990 – today Director of the Max‐Planck‐Institute for Informatics, Saarbruecken, D 1995 –today Co‐founder of Algorithmic Solutions GmbH Patras 08.11.2017 2 Numbers Publications 400 Citations ≥ 18.870 Books 10 h‐index 69 Chapters in Books/Volumes 4 g‐index 228 Volume Editor 12 Journals ≥ 153 PhDs awarded 86 Conferences ≥ 187 Archived repositories ≥ 30 Top 12 world‐nurtures in CS research (2004) Awards/Distinctions 23 Editor in Journals 13 Patras 08.11.2017 3 Major Awards & Distinctions 1986: Leibniz‐Award, Deutsche Forschungsgemeinschaft 1989: Humboldt‐Award 1994: Karl‐Heinz‐Beckurts‐Award 1995: Konrad‐Zuse‐Award 1999: ACM Fellow 2004: Member of Leopoldina, Nationale Akademie der Wissenschaften 2010: EATCS Award 2016: EATCS Fellow 2011: ACM Paris Kanellakis Theory and Practice Award 2014: Erasmus Medal, Academia Europaea 2014:
    [Show full text]
  • Dynamic Planar Orthogonal Point Location in Sublogarithmic Time
    Dynamic Planar Orthogonal Point Location in Sublogarithmic Time Timothy M. Chan Department of Computer Science, University of Illinois at Urbana-Champaign, USA [email protected] Konstantinos Tsakalidis1 Tandon School of Engineering, New York University, USA [email protected] Abstract We study a longstanding problem in computational geometry: dynamic 2-d orthogonal point location, i.e., vertical ray shooting among n horizontal line segments. We present a data structure log n 1/2+ε achieving O log log n optimal expected query time and O log n update time (amortized) in the word-RAM model for any constant ε > 0, under the assumption that the x-coordinates are integers bounded polynomially in n. This substantially improves previous results of Giyora and Kaplan [SODA 2007] and Blelloch [SODA 2008] with O (log n) query and update time, log n 1+ε and of Nekrich (2010) with O log log n query time and O log n update time. Our result matches the best known upper bound for simpler problems such as dynamic 2-d dominance range searching. We also obtain similar bounds for orthogonal line segment intersection reporting queries, vertical ray stabbing, and vertical stabbing-max, improving previous bounds, respectively, of Blelloch [SODA 2008] and Mortensen [SODA 2003], of Tao (2014), and of Agarwal, Arge, and Yi [SODA 2005] and Nekrich [ISAAC 2011]. 2012 ACM Subject Classification Theory of computation → Randomness, geometry and dis- crete structures → Computational geometry; Theory of computation → Design and analysis of algorithms → Data structures design and analysis Keywords and phrases dynamic data structures, point location, word RAM Digital Object Identifier 10.4230/LIPIcs.SoCG.2018.25 Acknowledgements We would like to thank Athanasios Tsakalidis for helpful discussions.
    [Show full text]
  • Curriculum Vitae Konstantinos Tsichlas
    Curriculum Vitae Konstantinos Tsichlas Curriculum Vitae Name : Konstantinos Tsichlas Born : 19th of May, 1976, Greece Marital Status : Married with two children Address : Ethnikis Antistasevs 16, Kalamaria, Thessaloniki Post Code 55133 Tel. : +30 2310991934 email : [email protected] Webpage : http://delab.csd.auth.gr/~tsichlas/ Brief Biography I am a lecturer in the Informatics Department of Aristotle University of Thessaloniki since 2008. Since 2005 I am an adjunct Professor in Greek Open University as well. From 1/5/2011-31/10/2011 I was on sabbatical in the MADALGO (center for MAssive Data ALGOrithmics) institute of the Computer Science Department of the University of Aarhus in Denmark. From 4/1/2004 until 4/6/2005 I was a research assistant in the Computer Science Department of Kings College London in the Algorithm Design Group. I was awarded a Ph.D. diploma in 2004. I have completed my military service in the Greek army in 2003. My research interests focus on the design and analysis of algorithms and data structures. In particular, I am working on fundamental data structures, like dictionaries and priority queues in various models of computations (PM, RAM, I/O model, distributed etc.), computational geometry problems, strings matching algorithms with applications to bioinformatics and music analysis, indexing problems of databases and combinatorial optimization problems in large-scale networks and with respect to query optimization. In addition, since 2011 I have initiated work on on lower bounds using various existing tools, on Natural Algorithms which I feel is an exciting new field and analysis of complex networks. Although these three areas seem different, my feel is there is a lot of common ground.
    [Show full text]
  • Dynamic Data Structures: Orthogonal Range Queries and Update Efficiency Konstantinos Athanasiou Tsakalidis
    Dynamic Data Structures: Orthogonal Range Queries and Update Efficiency Konstantinos Athanasiou Tsakalidis PhD Dissertation Department of Computer Science Aarhus University Denmark Dynamic Data Structures: Orthogonal Range Queries and Update Efficiency A Dissertation Presented to the Faculty of Science of Aarhus University in Partial Fulfilment of the Requirements for the PhD Degree by Konstantinos A. Tsakalidis August 11, 2011 Abstract (English) We study dynamic data structures for different variants of orthogonal range reporting query problems. In particular, we consider (1) the planar orthogonal 3-sided range reporting problem: given a set of points in the plane, report the points that lie within a given 3-sided rectangle with one unbounded side, (2) the planar orthogonal range maxima reporting problem: given a set of points in the plane, report the points that lie within a given orthogonal range and are not dominated by any other point in the range, and (3) the problem of designing fully persistent B-trees for external memory. Dynamic problems like the above arise in various applications of network optimization, VLSI layout design, computer graphics and distributed computing. For the first problem, we present dynamic data structures for internal and external memory that support planar orthogonal 3-sided range reporting queries, and insertions and deletions of points efficiently over an average case sequence of update operations. The external memory data structures find applications in constraint and temporal databases. In particular, we assume that the coor- dinates of the points are drawn from different probabilistic distributions that arise in real-world applications, and we modify existing techniques for updating dynamic data structures, in order to support the queries and the updates more efficiently than the worst-case efficient counterparts for this problem.
    [Show full text]
  • Editorial Miltiadis D. Lytras* Lakshmi S. Iyer Athanasios Tsakalidis
    Electronic Government, Vol. 3, No. 1, 2006 1 Editorial Miltiadis D. Lytras* Department of Computer Engineering and Informatics, Research Academic Computer Technology Institute, University of Patras, Greece E-mail: [email protected] *Corresponding author Lakshmi S. Iyer Information Systems and Operations Management, Bryan School of Business and Economics, The University of North Carolina at Greensboro, USA E-mail: [email protected] Athanasios Tsakalidis Department of Computer Engineering and Informatics, Research Academic Computer Technology Institute, University of Patras, Greece E-mail: [email protected] Biographical notes: Dr. Miltiadis D. Lytras is a Faculty Member in the Computer Engineering and Informatics Department (CEID) in the University of Patras, Greece. His research focuses on Semantic Web, Knowledge Management and e-learning, with more than 70 publications in these areas. He has co-edited 13 special issues in international journals and has authored/edited six books. He is the Founder of the Semantic Web and Information SIG in the Association for Information Systems (http://www.sigsemis.org). He serves as the Editor-in-Chief for three international journals, while acting as an Associate Editor or Editorial Board Member in seven other journals. Lakshmi Iyer is an Associate Professor in the Information Systems and Operations Management Department at the University of North Carolina at Greensboro. She obtained her PhD from the University of Georgia, Athens. Her research interests are in the area of e-business processes, e-commerce issues, global issues in IS, intelligent agents, decision support systems and Knowledge Management. Her research work has been published or accepted for publication in CACM, eService Journal, Annals of OR, DSS, International Journal of Semantic Web and Information Systems, Journal of Global Information Technology Management, Journal of Scientific and Industrial Research, Encyclopedia of ORMS, Journal of Information Technology Management, Journal of Data Warehousing and Industrial Management and Data Systems.
    [Show full text]