DOCSLIB.ORG

ALGORITHMS of INFORMATICS Volume 3 Antoncom Budapest, 2011

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ALGORITHMS of INFORMATICS Volume 3 Antoncom Budapest, 2011 ALGORITHMS OF INFORMATICS Volume 3 AnTonCom Budapest, 2011 This electronic book was prepared in the framework of project Eastern Hungarian Informatics Books Repository no. TÁMOP-4.1.2-08/1/A-2009-0046. This electronic book appeared with the support of European Union and with the co-financing of European Social Fund. Editor: Antal Iványi Authors of Volume 3: Béla Vizvári (Chapter 24), Antal Iványi and Shariefuddin Pirzada (Chapter 25), Zoltán Kása, and Mira-Cristiana Anisiu (Chapter 26), Ferenc Szidarovszky and László Domoszlai, (Chapter 27), László Szirmay-Kalos and László Szécsi (Chapter 28), Antal Iványi (Chapter 29), Shariefuddin Pirzada, Antal Iványi and Muhammad Ali Khan (Chapter 30) Validators of Volume 3: Gergely Kovács (Chapter 24), Zoltán Kása (Chapter 25), Antal Iványi (Chapter 26), Sándor Molnár (Chapter 27), György Antal (Chapter 28), Zoltán Kása (Chapter 29), Zoltán Kása (Chapter 30), Anna Iványi (Bibliography) c 2011 AnTonCom Infokommunikációs Kft. Homepage: http://www.antoncom.hu/ Contents Introduction to Volume 3 ........................... 1207 24.The Branch and Bound Method ..................... 1208 24.1. An example: the Knapsack Problem ................. 1208 24.1.1. The Knapsack Problem .................... 1209 24.1.2. A numerical example ...................... 1211 24.1.3. Properties in the calculation of the numerical example . 1214 24.1.4. How to accelerate the method ................. 1216 24.2. The general frame of the B&B method ................ 1217 24.2.1. Relaxation ............................ 1217 24.2.2. The general frame of the B&B method ............ 1224 24.3. Mixed integer programming with bounded variables ......... 1229 24.3.1. The geometric analysis of a numerical example . 1230 24.3.2. The linear programming background of the method . 1232 24.3.3. Fast bounds on lower and upper branches .......... 1240 24.3.4. Branching strategies ...................... 1244 24.3.5. The selection of the branching variable ............ 1247 24.3.6. The numerical example is revisited .............. 1248 24.4. On the enumeration tree ........................ 1252 24.5. The use of information obtained from other sources ......... 1254 24.5.1. Application of heuristic methods ............... 1254 24.5.2. Preprocessing .......................... 1255 24.6. Branch and Cut ............................. 1255 24.7. Branch and Price ............................ 1260 25. Comparison Based Ranking ....................... 1262 25.1. Introduction to supertournaments ................... 1262 25.2. Introduction to (a, b)-tournaments .................. 1264 25.3. Existence of (1, 1)-tournaments with prescribed score sequence . 1265 25.4. Existence of an (a, a)-tournament with prescribed score sequence . 1267 25.5. Existence of an (a, b)-tournament with prescribed score sequence . 1269 25.5.1. Existence of a tournament with arbitrary degree sequence . 1269 25.5.2. Description of a naive reconstructing algorithm . 1269 25.5.3. Computation of e ........................ 1270 25.5.4. Description of a construction algorithm ........... 1271 1204 Contents 25.5.5. Computation of f and g .................... 1271 25.5.6. Description of a testing algorithm ............... 1273 25.5.7. Description of an algorithm computing f and g . 1273 25.5.8. Computing of f and g in linear time ............. 1275 25.5.9. Tournament with f and g ................... 1276 25.5.10. Description of the score slicing algorithm ........... 1276 25.5.11. Analysis of the minimax reconstruction algorithm . 1280 25.6. Imbalances in (0, b)-tournaments ................... 1280 25.6.1. Imbalances in (0, 1)-tournaments. ............... 1281 25.6.2. Imbalances in (0, 2)-tournaments ............... 1281 25.7. Supertournaments ........................... 1286 25.7.1. Hypertournaments ....................... 1286 25.7.2. Supertournaments ....................... 1293 25.8. Football tournaments .......................... 1294 25.8.1. Testing algorithms ....................... 1294 25.8.2. Polynomial testing algorithms of the draw sequences . 1303 25.9. Reconstruction of the tested sequences ................ 1309 26.Complexity of Words ............................ 1312 26.1. Simple complexity measures ...................... 1312 26.1.1. Finite words ........................... 1312 26.1.2. Infinite words .......................... 1314 26.1.3. Word graphs .......................... 1316 26.1.4. Complexity of words ...................... 1321 26.2. Generalized complexity measures ................... 1332 26.2.1. Rainbow words ......................... 1332 26.2.2. General words .......................... 1343 26.3. Palindrome complexity ......................... 1343 26.3.1. Palindromes in finite words .................. 1343 26.3.2. Palindromes in infinite words ................. 1346 27. Conflict Situations ............................. 1351 27.1. The basics of multi-objective programming .............. 1351 27.1.1. Applications of utility functions ................ 1355 27.1.2. Weighting method ....................... 1357 27.1.3. Distance-dependent methods ................. 1358 27.1.4. Direction-dependent methods ................. 1361 27.2. Method of equilibrium ......................... 1364 27.3. Methods of cooperative games ..................... 1369 27.4. Collective decision-making ....................... 1372 27.5. Applications of Pareto games ..................... 1379 27.6. Axiomatic methods ........................... 1382 28. General Purpose Computing on Graphics Processing Units . 1388 28.1. The graphics pipeline model ...................... 1390 28.1.1. GPU as the implementation of incremental image synthesis 1392 28.2. GPGPU with the graphics pipeline model .............. 1395 28.2.1. Output ............................. 1395 Contents 1205 28.2.2. Input ............................... 1396 28.2.3. Functions and parameters ................... 1397 28.3. GPU as a vector processor ....................... 1398 28.3.1. Implementing the SAXPY BLAS function .......... 1400 28.3.2. Image filtering ......................... 1401 28.4. Beyond vector processing ........................ 1402 28.4.1. SIMD or MIMD ........................ 1402 28.4.2. Reduction ............................ 1404 28.4.3. Implementing scatter ...................... 1405 28.4.4. Parallelism versus reuse .................... 1407 28.5. GPGPU programming model: CUDA and OpenCL ......... 1409 28.6. Matrix-vector multiplication ...................... 1409 28.6.1. Making matrix-vector multiplication more parallel . 1411 28.7. Case study: computational fluid dynamics .............. 1414 28.7.1. Eulerian solver for fluid dynamics ............... 1416 28.7.2. Lagrangian solver for differential equations .......... 1421 29. Perfect Arrays ................................ 1428 29.1. Basic concepts .............................. 1428 29.2. Necessary condition and earlier results ................ 1431 29.3. One-dimensional perfect arrays .................... 1431 29.3.1. Pseudocode of the algorithm Quick-Martin . 1431 29.3.2. Pseudocode of the algorithm Optimal-Martin . 1432 29.3.3. Pseudocode of the algorithm Shift .............. 1432 29.3.4. Pseudocode of the algorithm Even .............. 1433 29.4. Two-dimensional perfect arrays .................... 1433 29.4.1. Pseudocode of the algorithm Mesh .............. 1434 29.4.2. Pseudocode of the algorithm Cellular ........... 1434 29.5. Three-dimensional perfect arrays ................... 1435 29.5.1. Pseudocode of the algorithm Colour ............ 1435 29.5.2. Pseudocode of the algorithm Growing ........... 1436 29.6. Construction of growing arrays using colouring ........... 1437 29.6.1. Construction of growing sequences .............. 1437 29.6.2. Construction of growing squares ................ 1438 29.6.3. Construction of growing cubes ................. 1439 29.6.4. Construction of a four-dimensional double hypercube . 1439 29.7. The existence theorem of perfect arrays ............... 1441 29.8. Superperfect arrays ........................... 1443 29.9. d-complexity of one-dimensional arrays ................ 1443 29.9.1. Definitions ............................ 1444 29.9.2. Bounds of complexity measures ................ 1446 29.9.3. Recurrence relations ...................... 1448 29.9.4. Pseudocode of the algorithm Quick-Martin . 1450 29.9.5. Pseudocode of algorithm d-Complexity ........... 1450 29.9.6. Pseudocode of algorithm Super ............... 1451 29.9.7. Pseudocode of algorithm MaxSub .............. 1451 29.9.8. Construction and complexity of extremal words . 1452 1206 Contents 29.10.Finite two-dimensional arrays with maximal complexity . 1456 29.10.1. Definitions ............................ 1456 29.10.2. Bounds of complexity functions ................ 1458 29.10.3. Properties of the maximal complexity function . 1459 29.10.4. On the existence of maximal arrays .............. 1460 30. Score Sets and Kings ........................... 1463 30.1. Score sets in 1-tournaments ...................... 1464 30.1.1. Determining the score set ................... 1464 30.1.2. Tournaments with prescribed score set ............ 1466 30.2. Score sets in oriented graphs ...................... 1473 30.2.1. Oriented graphs with prescribed scoresets .......... 1475 30.3. Unicity of score sets .......................... 1480 30.3.1. 1-unique score sets ....................... 1481 30.3.2. 2-unique score sets ....................... 1482 30.4. Kings and serfs in tournaments .................... 1484 30.5. Weak kings in oriented graphs ..................... 1492
Load more

Recommended publications
  • Artificial Intelligence in Health Care: the Hope, the Hype, the Promise, the Peril
    Artificial Intelligence in Health Care: The Hope, the Hype, the Promise, the Peril Michael Matheny, Sonoo Thadaney Israni, Mahnoor Ahmed, and Danielle Whicher, Editors WASHINGTON, DC NAM.EDU PREPUBLICATION COPY - Uncorrected Proofs NATIONAL ACADEMY OF MEDICINE • 500 Fifth Street, NW • WASHINGTON, DC 20001 NOTICE: This publication has undergone peer review according to procedures established by the National Academy of Medicine (NAM). Publication by the NAM worthy of public attention, but does not constitute endorsement of conclusions and recommendationssignifies that it is the by productthe NAM. of The a carefully views presented considered in processthis publication and is a contributionare those of individual contributors and do not represent formal consensus positions of the authors’ organizations; the NAM; or the National Academies of Sciences, Engineering, and Medicine. Library of Congress Cataloging-in-Publication Data to Come Copyright 2019 by the National Academy of Sciences. All rights reserved. Printed in the United States of America. Suggested citation: Matheny, M., S. Thadaney Israni, M. Ahmed, and D. Whicher, Editors. 2019. Artificial Intelligence in Health Care: The Hope, the Hype, the Promise, the Peril. NAM Special Publication. Washington, DC: National Academy of Medicine. PREPUBLICATION COPY - Uncorrected Proofs “Knowing is not enough; we must apply. Willing is not enough; we must do.” --GOETHE PREPUBLICATION COPY - Uncorrected Proofs ABOUT THE NATIONAL ACADEMY OF MEDICINE The National Academy of Medicine is one of three Academies constituting the Nation- al Academies of Sciences, Engineering, and Medicine (the National Academies). The Na- tional Academies provide independent, objective analysis and advice to the nation and conduct other activities to solve complex problems and inform public policy decisions.
    [Show full text]
  • Annual Report 2018–2019 Our Vision
    ANNUAL REPORT 2018–2019 OUR VISION We shape tomorrow. We confront problems and create solutions. We expand information’s impact and technology’s potential. Together, our faculty, staff, students, and alumni make the world a better place—day by day, project by project, leap by leap. LEADERSHIP Raj Acharya Since its establishment in 2000, the Luddy School of Informatics, Computing, and Dean Engineering has built a reputation as one of the broadest of its kind. Our more than 3,000 students come from Indiana and around the world, and our unique blend Mathew Palakal of programs in informatics, computer science, intelligent systems engineering, Senior Executive Associate information and library science, data science, and more create an interdisciplinary, Dean collaborative environment where ideas thrive. Erik Stolterman Bergqvist Our forward-looking school is a mélange, a salad bowl of disparate but related Senior Executive Associate disciplines. That salad bowl provides us with a holistic taste of creativity and Dean innovation while preserving and enhancing the taste of the individual components. Esfandiar Haghverdi As we have grown exponentially through our first two decades, we have maintained Executive Associate Dean for our core values with an open-minded view of tomorrow, one that has allowed us to Undergraduate Education stay on the cutting edge of technology while anticipating what the future holds. David Leake We accomplished much during the 2018-19 school year. Our information and library Executive Associate Dean science program was ranked second in the world behind only Harvard by the 2018 Academic Ranking of World Universities. Researchers at our school garnered Kay Connelly $16.1 million in grants from the National Science Foundation, the National Institute Associate Dean for Research of Health, the National Cancer Institute, the Department of Defense, and other prestigious organizations, and our school ranks 12th in computer and information Karl F.
    [Show full text]
  • 14 School Subject Informatics (Computer Science) in Russia: Educational Relevant Areas
    i i i i School Subject Informatics (Computer Science) in Russia: Educational Relevant Areas EVGENIY KHENNER and IGOR SEMAKIN, Perm State National Research University, Russia This article deals with some aspects of studying Informatics in Russian schools. Those aspects are part of the ‘third dimension’ of the Darmstadt model (they are also projected on the other two dimensions of this model) and include evolution of the subject, regulatory norms conforming to the Federal Educational Standards, the learning objectives, the required learning outcomes, and the Unified National Examination in Informatics, which is required for admission to a number of university programs. It is interesting to note that correspondence between requirements for the outcomes of learning Informatics in Russian school and the requirements of K-12 Computer Science Standards (USA) is quite satisfactory. It is noteworthy that the relatively high level of school education in Informatics in Russia is determined by the well-established methodological system with a 30-year history, the subject’s being on the list of core disciplines at school, as well as the existence of a state-sponsored system of education teachers of Informatics. Categories and Subject Descriptors: K.3.2 [Computers and Education]: Computer and Information Science Education—Computer science education General Terms: Algorithms, Languages, Security Additional Key Words and Phrases: History of Informatics in school, education policies, educational standards, qualification and professional experience of teachers, learning objectives and outcomes, structural components of Informatics, curriculum issues, Unified National Exam, extracurricular activities, textbooks, didactic software ACM Reference Format: Khenner, E. and Semakin, I. 2014. School subject informatics (computer science) in Russia: Educational relevant areas.
    [Show full text]
  • B.A. in Computing and Informatics 856-256-4805
    College of Science and Mathematics Contact Department of Computer Science Robinson Hall B.A. in Computing and Informatics 856-256-4805 www.rowan.edu/computerscience Curriculum About this program The curriculum for the major is divided into The Bachelor of Arts in Computing and Informatics is a new degree designed for three major areas: Foundation courses, Basic students who are interested in pursuing careers in information technology which requires Core Areas, and Computing and Informatics a solid understanding of the principles of computing – but not the underpinnings of Electives. computer science theory and mathematics. Such careers include, but are not limited to: The Foundation courses represent a sequence of courses primarily focused on programming Programmers Software QA / Testing Engineers skills across a variety of infrastructure Infrastructure Administrators Computer Service Coordinators platforms. Introductory courses will expose Support Technicians Deployment Technicians students to programming concepts in two different languages (e.g.,, Java, C++ or (e.g., Help Desk support) (e.g., end-user support for system releases) Python). Students will then master more Technical Application Trainers Technical Documentation Specialists complex programming via the completion of two Advanced Programming Workshops. How does this program differ from the B.S. in Computer Students will also be required to complete the Science? Basic Core Areas which cover data structures, In comparison to the existing B.S. in Computer Science, this
    [Show full text]
  • Integrated Biomedical and Clinical Research Informatics for Translational Medicine and Therapeutics”
    “Integrated Biomedical and Clinical Research Informatics for Translational Medicine and Therapeutics” J. Richard Landis, PhD Robert M. Curley, MS Gregg Fromell, MD Center for Clinical Epidemiology and Biostatistics (CCEB) Office of Human Research (OHR) University of Pennsylvania School of Medicine CCEB Philadelphia, PA 19104-6021 http://cceb.med.upenn.edu/main/index.html CCEB 2 http://www.med.upenn.edu/ohr The Office of Human Research (OHR) seeks to promote human research for the advancement of healthcare while ensuring the highest level of research participant safety and facilitating the highest quality research by: • Realizing the best research standards through adherence to University and government research policies and regulations • Supporting investigators and research teams through process improvement, innovative technologies, and education and training initiatives • Propagating best operational practices to maximize the efficiencies of research activities CCEB • Collaborating with University organizations involved with human 3 research Introduction • NIH increasingly promotes translational collaborations among basic science and clinical research programs • SCCORs, PPGs, U01s illustrate interplay of translational science, requiring data integration across the entire research enterprise (basic, translational, clinical) • Biostatistics -- fundamental challenge at the data analytic stage, incorporating data elements from all sources into comprehensive risk and/or efficacy models • Data management systems -- typically isolated, not
    [Show full text]
  • Technical Standards for Bioinformatics and Medical Informatics
    SJ Quinney College of Law, University of Utah Utah Law Digital Commons Utah Law Faculty Scholarship Utah Law Scholarship 8-2020 Technical Standards For Bioinformatics and Medical Informatics Jorge L. Contreras Adrian Thorogood Follow this and additional works at: https://dc.law.utah.edu/scholarship Part of the Health Information Technology Commons Forthcoming in Bioinformatics, Medical Informatics and the Law (Jorge L. Contreras, A. James Cuticchia & Gregory Kirsch, eds., Edward Elgar: 2021) TECHNICAL STANDARDS FOR BIOINFORMATICS AND MEDICAL INFORMATICS Jorge L. Contreras* and Adrian Thorogood† Contents INTRODUCTION I. STANDARDS AND STANDARD SETTING: A BRIEF OVERVIEW A. Types of Standards B. Standards Development Organizations II. COMPETITION AND ANTITRUST ISSUES IN STANDARDS DEVELOPMENT A. Improper Exclusion B. Improper Exchange of Information C. Compliance Certification D. Abuse of Process E. Policies and Precautions III. INTELLECTUAL PROPERTY AND STANDARDS DEVELOPMENT A. Copyright in Standards B. Patenting and Standards C. SDO Patent Policies IV. THE INFORMATICS STANDARDS LANDSCAPE A. Terminological Artifacts B. Reporting Requirements C. Exchange Formats D. Other V. INFORMATICS STANDARDS POLICIES TODAY: ASSESSMENT AND RECOMMENDATIONS A. Summary of Informatics SDO Policies B. Policy Recommendations C. Making Policies Binding CONCLUSIONS APPENDIX 1 - Selected Bioinformatics and Health Informatics Standards Development Organizations and Standards APPENDIX 2 - Sample Informatics “Open” Standards Development Policy * Presidential Scholar and Professor of Law, University of Utah S.J. Quinney College of Law; Adjunct Professor, Department of Human Genetics, University of Utah School of Medicine. † Academic Associate, Centre of Genomics and Policy (CGP), McGill University; Regulatory and Ethics Manager, Global Alliance for Genomics and Health (GA4GH). Thorogood acknowledges funding support from the Canadian Institutes of Health Research, Genome Canada, and Genome Quebec.
    [Show full text]
  • The Discipline and the Tool
    Ontology: The Discipline and the Tool Doug Mayhew1,2, Dirk Siebert1 1 Institute for Formal Ontology and Medical Information Science, University of Leipzig, 04107 Leipzig, Härtelstraße 16-18, Germany doug.mayhew, [email protected] 2 Department of Philosophy, University at Buffalo, New York, USA Abstract. The fields of philosophy and informatics entertain two somewhat dif- ferent conceptions of ontology. Philosophical ontology is a branch of metaphys- ics dating back at least to the time of Plato and Aristotle. Ontology in informat- ics has its origins in the artificial intelligence research of the eighties and nineties. This means that the fields of philosophy and informatics entertain two somewhat different conceptions of ontology and the present paper discusses the relationship between these two conceptions. Differences and similarities are pointed out and variations in methodological approaches are also discussed. Ef- forts to combine the ontological methodologies and resources of the two fields are surveyed, and actual and potential benefits and drawbacks of such collabo- rations are examined. Different Concepts The fields of philosophy and informatics entertain two somewhat different concep- tions of ontology, with correspondingly different notions of what ontology is for. First, we have the age-old conception of ontology as a philosophical discipline. Se- cond, we have the relatively new conception of ontology as an information organiza- tion tool, a notion of ontology adapted from the philosophical conception by artificial intelligence researchers and then adopted by the applications-oriented field of infor- matics. (The philosophical conception was recognized in informatics as early as the late sixties in data modeling research [1].) The two conceptions have their characteris- tic differences, which show up primarily in what each field thinks ontology is for.
    [Show full text]
  • Multi-Sensory Informatics Education
    Informatics in Education, 2014, Vol. 13, No. 2, 225–240 225 © 2014 Vilnius University DOI: http://dx.doi.org/10.15388/infedu.2014.04 Multi-Sensory Informatics Education Zoltan KATAI1, Laszlo TOTH2, Alpar Karoly ADORJANI3 1 Sapientia University, Department of Mathematics and Informatics 540485, Tirgu Mures, Op. 9, Cp. 4, Romania 2 S.C. Neogen S.A. Tirgu Mures, Str. Mihai Eminescu 48, Romania 3 S.C. INTER SOFT S.R.L. Tirgu Mures, Str. Cutezantei 57, Romania e-mail: [email protected], [email protected], [email protected] Received: November 2013 Abstract. A recent report by the joint Informatics Europe & ACM Europe Working Group on Informatics Education emphasizes that: (1) computational thinking is an important ability that all people should possess; (2) informatics-based concepts, abilities and skills are teachable, and must be included in the primary and particularly in the secondary school curriculum. Accordingly, the “2013 Best Practices in Education Award” (organized by Informatics Europe) was devoted to initiatives promoting Informatics Education in Primary and Secondary Schools. In this paper we present one of the winning projects: “Multi-Sensory Informatics Education”. We have developed effective multi-sensory methods and software-tools to improve the teaching-learning process of elementary, sorting and recursive algorithms. The technologically and artistically enhanced learn- ing environment we present has also the potential to promote intercultural computer science edu- cation and the algorithmic thinking of both science- and humanities-oriented learners. Keywords: multisensory education, informatics education, intercultural education, algorithmic thinking. 1. Introduction According to a recent report of the joint Informatics Europe & ACM Europe Working Group on Informatics Education (IE & ACM, 2013), for a nation or group of nations to compete in the race for technological innovation, the general population must under- stand the basics of informatics: the science behind Information Technology.
    [Show full text]
  • Artificial Intelligence Technology in Health Informatics
    Integrative Journal of Global Health 2020 ISSN 2576-3911 Vol.4 No.4 Artificial Intelligence Technology in Health Informatics Abdel-Badeeh M. Salem Ain Shams University, Egypt Abstract: Artificial Intelligence (AI) is devoted to create session organizer, Session Chair and Tutorials. In computer software and hardware that imitates the addition, he was a member of many international human mind. The main goal of AI technology is to societies. In addition, he is a member of the Editorial make computers smarter by creating software that Board of 50 international and national Journals Also, will allow a computer to mimic some of the He is member of many Int. Scientific Societies and functions of the human brain in selected applications. associations elected member of Euro Mediterranean Applications of AI technology include; general Academy of Arts and Sciences, Greece. Member of problem solving, expert systems, natural language Alma Mater European of the European Academy of processing, computer vision, robotics, and Sciences and Arts, Belgrade and European Academy knowledge discovery. All of these applications of Sciences and Arts, Austria. employ knowledge base and inference techniques to solve problems or help make decisions in specific Research Interest: Intelligent computing, domains. Biomedical informatics, Big data analytics, This talk discusses the potential role of AI for Intelligent education an e-learning, Information developing the intelligent healthcare and medical mining, Knowledge engineering and Biometrics. systems. Three most popular computational intelligence techniques are discussed namely; case- Epidemiology Public Health | Gynecology | based reasoning, ontological engineering, and data Women’s Health; Amsterdam, Netherlands- March mining. Moreover, the talk addresses the challenges 16-17, 2020.
    [Show full text]
  • Social Informatics: Natural Tools for Students' Information Training in the Conditions of Embodied and Mental Approaches Being Employed
    Journal of Social Studies Education Research Sosyal Bilgiler Eğitimi Araştırmaları Dergisi 2017:8 (2),100-116 www.jsser.org Social Informatics: Natural Tools for Students' Information Training in The Conditions of Embodied and Mental Approaches Being Employed Daria Barkhatova1, Elmira Nigmatulina2, Tatyana Stepanova3 Abstract The relevance of the problem under study is due to the society's requirements for the quality information training of a personality which is oriented to forming the solid fundamental knowledge as well as to developing the cognitive capacities that are needed for solving mental tasks. With regard to this, the paper is aimed at finding out the opportunities of applying the natural tools in information training of students from the standpoints of embodied and mental approaches. The main idea of these is integrated studying of an object, beginning with learning it in an "embodied" way and finishing with abstract models formed in the human memory. The leading approach to the research is the integrated one taking into account the psychological and pedagogical, didactic and methodological constituents. It allows identifying the psychological and pedagogical conditions of application of natural tools as well as the possible ways of their use. The authors describe models of natural tools of computer science training in individual sections of the school course as the main results. The materials of the paper are of practical value in methods of teaching computer science to students at various stages of education. Keywords: embodied approach, mental approach, information training, natural training tool, tool use in education. Introduction The modern world is currently characterized by a quick tempo of life, a global, rapid and continuous nature of processes occurring in it.
    [Show full text]
  • Ontology and Information Systems
    Ontology and Information Systems 1 Barry Smith Philosophical Ontology Ontology as a branch of philosophy is the science of what is, of the kinds and structures of objects, properties, events, processes and relations in every area of reality. ‘Ontology’ is often used by philosophers as a synonym for ‘metaphysics’ (literally: ‘what comes after the Physics’), a term which was used by early students of Aristotle to refer to what Aristotle himself called ‘first philosophy’.2 The term ‘ontology’ (or ontologia) was itself coined in 1613, independently, by two philosophers, Rudolf Göckel (Goclenius), in his Lexicon philosophicum and Jacob Lorhard (Lorhardus), in his Theatrum philosophicum. The first occurrence in English recorded by the OED appears in Bailey’s dictionary of 1721, which defines ontology as ‘an Account of being in the Abstract’. Methods and Goals of Philosophical Ontology The methods of philosophical ontology are the methods of philosophy in general. They include the development of theories of wider or narrower scope and the testing and refinement of such theories by measuring them up, either against difficult 1 This paper is based upon work supported by the National Science Foundation under Grant No. BCS-9975557 (“Ontology and Geographic Categories”) and by the Alexander von Humboldt Foundation under the auspices of its Wolfgang Paul Program. Thanks go to Thomas Bittner, Olivier Bodenreider, Anita Burgun, Charles Dement, Andrew Frank, Angelika Franzke, Wolfgang Grassl, Pierre Grenon, Nicola Guarino, Patrick Hayes, Kathleen Hornsby, Ingvar Johansson, Fritz Lehmann, Chris Menzel, Kevin Mulligan, Chris Partridge, David W. Smith, William Rapaport, Daniel von Wachter, Chris Welty and Graham White for helpful comments.
    [Show full text]
  • What Are Computational Neuroscience and Neuroinformatics? Computational Neuroscience
    Department of Mathematical Sciences B12412: Computational Neuroscience and Neuroinformatics What are Computational Neuroscience and Neuroinformatics? Computational Neuroscience Computational Neuroscience1 is an interdisciplinary science that links the diverse fields of neu- roscience, computer science, physics and applied mathematics together. It serves as the primary theoretical method for investigating the function and mechanism of the nervous system. Com- putational neuroscience traces its historical roots to the the work of people such as Andrew Huxley, Alan Hodgkin, and David Marr. Hodgkin and Huxley's developed the voltage clamp and created the first mathematical model of the action potential. David Marr's work focused on the interactions between neurons, suggesting computational approaches to the study of how functional groups of neurons within the hippocampus and neocortex interact, store, process, and transmit information. Computational modeling of biophysically realistic neurons and dendrites began with the work of Wilfrid Rall, with the first multicompartmental model using cable theory. Computational neuroscience is distinct from psychological connectionism and theories of learning from disciplines such as machine learning,neural networks and statistical learning theory in that it emphasizes descriptions of functional and biologically realistic neurons and their physiology and dynamics. These models capture the essential features of the biological system at multiple spatial-temporal scales, from membrane currents, protein and chemical coupling to network os- cillations and learning and memory. These computational models are used to test hypotheses that can be directly verified by current or future biological experiments. Currently, the field is undergoing a rapid expansion. There are many software packages, such as NEURON, that allow rapid and systematic in silico modeling of realistic neurons.
    [Show full text]