Juutalaisvaltion kansallinen historiankirjoitus : Israelin itsenäisyyssodan ja Kuuden päivän sodan israelilainen historiantutkimus kansakunnan rakentamisen välineenä vuosina 1988-2018

Juutalaisten historia Palestiinan brittiläisen mandaatin ja myöhemmin Israelin valtion alueella on ollut täynnä sotilaallisia konflikteja. Juutalaisten vuosisatoja eri yhteiskunnissa kokema vaino ja sorto antoivat Palestiinassa asuville ja sinne muuttaville juutalaisille oikeutuksen tunteen tarttua tarvittaessa aseisiin kansansa hyvinvoinnin ja turvallisuuden puolesta. Tutkielmassa selvitetään Israelin itsenäisyyssodan 1947–1949 ja Kuuden päivän sodan 1967 israelilaisen akateemisen historiantutkimuksen päälinjat, koulukunnat ja suurimmat historiantulkinnan kiistat. Tähänastisessa tutkimuksessa näitä asioita on selvitetty vain itsenäisyyssodan osalta. Tutkielmassa käsitellään englanninkielistä israelilaista akateemista historiantutkimusta vuodesta 1988 vuoteen 2018 asti. Tutkielmassa käytetään historiografista metodia, jossa ei tutkita suoraan menneitä tapahtumia, vaan niiden muuttuvia tulkintoja yksittäisten historioitsijoiden toimesta. On tarkasteltu, että millä tavoin kansallinen historiankirjoitus ilmenee kyseisten sotien israelilaisessa historiantutkimuksessa. Keskeisiä lähdeteoksia ovat The Birth of the Palestinian Refugee Problem 1947–1949 (1988), The Politics of Partition (1990), Fabricating Israeli History (1997), Six Days of War (2002), The Ethnic Cleansing of Palestine (2006), 1967 (2006), 1948: A History of the First Arab–Israeli War (2008), Palestine Betrayed (2010) ja The Six-Day War: The Breaking of the Middle-East (2017). Tärkeä osa tutkielmaa on sen osoittaminen, että millaista on israelilainen kansallinen historiankirjoitus kansakunnan rakentamisen välineenä. Asiaa on todisteltu historiapolitiikan käsitteen avulla. Tutkielmassa päätellään, että Israelin historiakamppailun ytimessä on kaksi vakiintunutta koulukuntaa: klassinen sionistinen ja jälkisionistinen tulkinta. Koulukuntien välinen raja on häilyvämpi kuin voisi odottaa. Tämä tutkimus esittää, että sionistista teesiä seurasi uushistorioitsijoiden antiteesi, jonka jälkeen voi tulla uuden sukupolven synteesi

Pancreatic cancer cachexia: a review of mechanisms and therapeutics.

Over the last decade, we have gained new insight into the pathophysiology of cachexia associated with pancreatic cancer. Unfortunately, its treatment is complex and remains a challenge. Pancreatic cancer cachexia is a multifactorial syndrome characterized by uncompensated adipose tissue and skeletal muscle loss in the setting of anorexia that leads to progressive functional impairment. This paper will review the current concepts of pancreatic cancer cachexia, its assessment and pathophysiology as well as current and future treatments. The successful management of pancreatic cancer cachexia will likely require a multimodal approach that includes nutritional support and combination pharmaceutical interventions

Intensive care bereavement practices across New Zealand and Australian intensive care units: a qualitative content analysis.

BACKGROUND: End-of-life and bereavement care is an important consideration in intensive care. This study describes the type of bereavement care provided in intensive care units across Australia and New Zealand. DESIGN: Inductive qualitative content analysis was conducted on free-text responses to a web-based survey exploring unit-based bereavement practice distributed to nurse managers in 229 intensive care units in New Zealand and Australia. RESULTS: A total of 153 (67%) surveys were returned with 68 respondents making free-text responses. Respondents were mainly Australian (n = 54, 85·3%), from the public sector (n = 51, 75%) and holding Nurse Unit Managers/Charge Nurse roles (n = 39, 52·9%). From the 124 free-text responses, a total of 187 individual codes were identified focussing on bereavement care practices (n = 145, 77·5%), educational provision to support staff (n = 15, 8%) and organisational challenges (n = 27, 14·4%). Bereavement care practices described use of memory boxes, cultural specificity, annual memorial services and use of community support services. Educational provision identified local in-service programmes, and national bereavement courses for specialist bereavement nurse coordinators. Organisational challenges focussed on lack of funding, especially for provision of bereavement follow-up. CONCLUSIONS: This is the first Australasian-wide survey, and one of the few international studies, describing bereavement practices within intensive care, an important aspect of nursing practice. However, with funding for new bereavement services and education for staff lacking, there are continued challenges in developing bereavement care. Given knowledge about the impact of these areas of care on bereaved family members, this requires review. RELEVANCE TO CLINICAL PRACTICE: Nurses remain committed to supporting bereaved families during and following death in intensive care. With limited resource to support bereavement care, intensive care nurses undertake a range of bereavement care practices at time of death, and after death through family bereavement follow-up

Boltzmann and Fokker-Planck equations modelling the Elo rating system with learning effects

In this paper we propose and study a new kinetic rating model for a large number of players, which is motivated by the well-known Elo rating system. Each player is characterised by an intrinsic strength and a rating, which are both updated after each game. We state and analyse the respective Boltzmann type equation and derive the corresponding nonlinear, nonlocal Fokker-Planck equation. We investigate the existence of solutions to the Fokker-Planck equation and discuss their behaviour in the long time limit. Furthermore, we illustrate the dynamics of the Boltzmann and Fokker-Planck equation with various numerical experiments

On environment difficulty and discriminating power

The final publication is available at Springer via http://dx.doi.org/10.1007/s10458-014-9257-1This paper presents a way to estimate the difficulty and discriminating power of any task instance. We focus on a very general setting for tasks: interactive (possibly multiagent) environments where an agent acts upon observations and rewards. Instead of analysing the complexity of the environment, the state space or the actions that are performed by the agent, we analyse the performance of a population of agent policies against the task, leading to a distribution that is examined in terms of policy complexity. This distribution is then sliced by the algorithmic complexity of the policy and analysed through several diagrams and indicators. The notion of environment response curve is also introduced, by inverting the performance results into an ability scale. We apply all these concepts, diagrams and indicators to two illustrative problems: a class of agent-populated elementary cellular automata, showing how the difficulty and discriminating power may vary for several environments, and a multiagent system, where agents can become predators or preys, and may need to coordinate. Finally, we discuss how these tools can be applied to characterise (interactive) tasks and (multi-agent) environments. These characterisations can then be used to get more insight about agent performance and to facilitate the development of adaptive tests for the evaluation of agent abilities.I thank the reviewers for their comments, especially those aiming at a clearer connection with the field of multi-agent systems and the suggestion of better approximations for the calculation of the response curves. The implementation of the elementary cellular automata used in the environments is based on the library 'CellularAutomaton' by John Hughes for R [58]. I am grateful to Fernando Soler-Toscano for letting me know about their work [65] on the complexity of 2D objects generated by elementary cellular automata. I would also like to thank David L. Dowe for his comments on a previous version of this paper. This work was supported by the MEC/MINECO projects CONSOLIDER-INGENIO CSD2007-00022 and TIN 2010-21062-C02-02, GVA project PROMETEO/2008/051, the COST - European Cooperation in the field of Scientific and Technical Research IC0801 AT, and the REFRAME project, granted by the European Coordinated Research on Long-term Challenges in Information and Communication Sciences & Technologies ERA-Net (CHIST-ERA), and funded by the Ministerio de Economia y Competitividad in Spain (PCIN-2013-037).José Hernández-Orallo (2015). On environment difficulty and discriminating power. Autonomous Agents and Multi-Agent Systems. 29(3):402-454. https://doi.org/10.1007/s10458-014-9257-1S402454293Anderson, J., Baltes, J., & Cheng, C. T. (2011). Robotics competitions as benchmarks for ai research. The Knowledge Engineering Review, 26(01), 11–17.Andre, D., & Russell, S. J. (2002). State abstraction for programmable reinforcement learning agents. In Proceedings of the National Conference on Artificial Intelligence (pp. 119–125). Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.Antunes, L., Fortnow, L., van Melkebeek, D., & Vinodchandran, N. V. (2006). Computational depth: Concept and applications. Theoretical Computer Science, 354(3), 391–404. Foundations of Computation Theory (FCT 2003), 14th Symposium on Fundamentals of Computation Theory 2003.Arai, K., Kaminka, G. A., Frank, I., & Tanaka-Ishii, K. (2003). Performance competitions as research infrastructure: Large scale comparative studies of multi-agent teams. Autonomous Agents and Multi-Agent Systems, 7(1–2), 121–144.Ashcraft, M. H., Donley, R. D., Halas, M. A., & Vakali, M. (1992). Chapter 8 working memory, automaticity, and problem difficulty. In Jamie I.D. Campbell (Ed.), The nature and origins of mathematical skills, volume 91 of advances in psychology (pp. 301–329). North-Holland.Ay, N., Müller, M., & Szkola, A. (2010). Effective complexity and its relation to logical depth. IEEE Transactions on Information Theory, 56(9), 4593–4607.Barch, D. M., Braver, T. S., Nystrom, L. E., Forman, S. D., Noll, D. C., & Cohen, J. D. (1997). Dissociating working memory from task difficulty in human prefrontal cortex. Neuropsychologia, 35(10), 1373–1380.Bordini, R. H., Hübner, J. F., & Wooldridge, M. (2007). Programming multi-agent systems in AgentSpeak using Jason. London: Wiley. com.Boutilier, C., Reiter, R., Soutchanski, M., Thrun, S. et al. (2000). Decision-theoretic, high-level agent programming in the situation calculus. In Proceedings of the National Conference on Artificial Intelligence (pp. 355–362). Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.Busoniu, L., Babuska, R., & De Schutter, B. (2008). A comprehensive survey of multiagent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 38(2), 156–172.Chaitin, G. J. (1977). Algorithmic information theory. IBM Journal of Research and Development, 21, 350–359.Chedid, F. B. (2010). Sophistication and logical depth revisited. In 2010 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) (pp. 1–4). IEEE.Cheeseman, P., Kanefsky, B. & Taylor, W. M. (1991). Where the really hard problems are. In Proceedings of IJCAI-1991 (pp. 331–337).Dastani, M. (2008). 2APL: A practical agent programming language. Autonomous Agents and Multi-agent Systems, 16(3), 214–248.Delahaye, J. P. & Zenil, H. (2011). Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness. Applied Mathematics and Computation, 219(1), 63–77Dowe, D. L. (2008). Foreword re C. S. Wallace. Computer Journal, 51(5), 523–560. Christopher Stewart WALLACE (1933–2004) memorial special issue.Dowe, D. L., & Hernández-Orallo, J. (2012). IQ tests are not for machines, yet. Intelligence, 40(2), 77–81.Du, D. Z., & Ko, K. I. (2011). Theory of computational complexity (Vol. 58). London: Wiley-Interscience.Elo, A. E. (1978). The rating of chessplayers, past and present (Vol. 3). London: Batsford.Embretson, S. E., & Reise, S. P. (2000). Item response theory for psychologists. London: Lawrence Erlbaum.Fatès, N. & Chevrier, V. (2010). How important are updating schemes in multi-agent systems? an illustration on a multi-turmite model. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1-Volume 1 (pp. 533–540). International Foundation for Autonomous Agents and Multiagent Systems.Ferber, J. & Müller, J. P. (1996). Influences and reaction: A model of situated multiagent systems. In Proceedings of Second International Conference on Multi-Agent Systems (ICMAS-96) (pp. 72–79).Ferrando, P. J. (2009). Difficulty, discrimination, and information indices in the linear factor analysis model for continuous item responses. Applied Psychological Measurement, 33(1), 9–24.Ferrando, P. J. (2012). Assessing the discriminating power of item and test scores in the linear factor-analysis model. Psicológica, 33, 111–139.Gent, I. P., & Walsh, T. (1994). Easy problems are sometimes hard. Artificial Intelligence, 70(1), 335–345.Gershenson, C. & Fernandez, N. (2012). Complexity and information: Measuring emergence, self-organization, and homeostasis at multiple scales. Complexity, 18(2), 29–44.Gruner, S. (2010). Mobile agent systems and cellular automata. Autonomous Agents and Multi-agent Systems, 20(2), 198–233.Hardman, D. K., & Payne, S. J. (1995). Problem difficulty and response format in syllogistic reasoning. The Quarterly Journal of Experimental Psychology, 48(4), 945–975.He, J., Reeves, C., Witt, C., & Yao, X. (2007). A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability. Evolutionary Computation, 15(4), 435–443.Hernández-Orallo, J. (2000). Beyond the turing test. Journal of Logic Language & Information, 9(4), 447–466.Hernández-Orallo, J. (2000). On the computational measurement of intelligence factors. In A. Meystel (Ed.), Performance metrics for intelligent systems workshop (pp. 1–8). Gaithersburg, MD: National Institute of Standards and Technology.Hernández-Orallo, J. (2000). Thesis: Computational measures of information gain and reinforcement in inference processes. AI Communications, 13(1), 49–50.Hernández-Orallo, J. (2010). A (hopefully) non-biased universal environment class for measuring intelligence of biological and artificial systems. In M. Hutter et al. (Ed.), 3rd International Conference on Artificial General Intelligence (pp. 182–183). Atlantis Press Extended report at http://users.dsic.upv.es/proy/anynt/unbiased.pdf .Hernández-Orallo, J., & Dowe, D. L. (2010). Measuring universal intelligence: Towards an anytime intelligence test. Artificial Intelligence, 174(18), 1508–1539.Hernández-Orallo, J., Dowe, D. L., España-Cubillo, S., Hernández-Lloreda, M. V., & Insa-Cabrera, J. (2011). On more realistic environment distributions for defining, evaluating and developing intelligence. In J. Schmidhuber, K. R. Thórisson, & M. Looks (Eds.), LNAI series on artificial general intelligence 2011 (Vol. 6830, pp. 82–91). Berlin: Springer.Hernández-Orallo, J., Dowe, D. L., & Hernández-Lloreda, M. V. (2014). Universal psychometrics: Measuring cognitive abilities in the machine kingdom. Cognitive Systems Research, 27, 50–74.Hernández-Orallo, J., Insa, J., Dowe, D. L. & Hibbard, B. (2012). Turing tests with turing machines. In A. Voronkov (Ed.), The Alan Turing Centenary Conference, Turing-100, Manchester, 2012, volume 10 of EPiC Series (pp. 140–156).Hernández-Orallo, J. & Minaya-Collado, N. (1998). A formal definition of intelligence based on an intensional variant of Kolmogorov complexity. In Proceedings of International Symposium of Engineering of Intelligent Systems (EIS’98) (pp. 146–163). ICSC Press.Hibbard, B. (2009). Bias and no free lunch in formal measures of intelligence. Journal of Artificial General Intelligence, 1(1), 54–61.Hoos, H. H. (1999). Sat-encodings, search space structure, and local search performance. In 1999 International Joint Conference on Artificial Intelligence (Vol. 16, pp. 296–303).Insa-Cabrera, J., Benacloch-Ayuso, J. L., & Hernández-Orallo, J. (2012). On measuring social intelligence: Experiments on competition and cooperation. In J. Bach, B. Goertzel, & M. Iklé (Eds.), AGI, volume 7716 of lecture notes in computer science (pp. 126–135). Berlin: Springer.Insa-Cabrera, J., Dowe, D. L., España-Cubillo, S., Hernández-Lloreda, M. V., & Hernández-Orallo, J. (2011). Comparing humans and AI agents. In J. Schmidhuber, K. R. Thórisson, & M. Looks (Eds.), LNAI series on artificial general intelligence 2011 (Vol. 6830, pp. 122–132). Berlin: Springer.Knuth, D. E. (1973). Sorting and searching, volume 3 of the art of computer programming. Reading, MA: Addison-Wesley.Kotovsky, K., & Simon, H. A. (1990). What makes some problems really hard: Explorations in the problem space of difficulty. Cognitive Psychology, 22(2), 143–183.Legg, S. (2008). Machine super intelligence. PhD thesis, Department of Informatics, University of Lugano, June 2008.Legg, S., & Hutter, M. (2007). Universal intelligence: A definition of machine intelligence. Minds and Machines, 17(4), 391–444.Leonetti, M. & Iocchi, L. (2010). Improving the performance of complex agent plans through reinforcement learning. In Proceedings of the 2010 International Conference on Autonomous Agents and Multiagent Systems (Vol. 1, pp. 723–730). International Foundation for Autonomous Agents and Multiagent Systems.Levin, L. A. (1973). Universal sequential search problems. Problems of Information Transmission, 9(3), 265–266.Levin, L. A. (1986). Average case complete problems. SIAM Journal on Computing, 15, 285.Li, M., & Vitányi, P. (2008). An introduction to Kolmogorov complexity and its applications (3rd ed.). Berlin: Springer.Low, C. K., Chen, T. Y., & Rónnquist, R. (1999). Automated test case generation for bdi agents. Autonomous Agents and Multi-agent Systems, 2(4), 311–332.Madden, M. G., & Howley, T. (2004). Transfer of experience between reinforcement learning environments with progressive difficulty. Artificial Intelligence Review, 21(3), 375–398.Mellenbergh, G. J. (1994). Generalized linear item response theory. Psychological Bulletin, 115(2), 300.Michel, F. (2004). Formalisme, outils et éléments méthodologiques pour la modélisation et la simulation multi-agents. PhD thesis, Université des sciences et techniques du Languedoc, Montpellier.Miller, G. A. (1956). The magical number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review, 63(2), 81.Orponen, P., Ko, K. I., Schöning, U., & Watanabe, O. (1994). Instance complexity. Journal of the ACM (JACM), 41(1), 96–121.Simon, H. A., & Kotovsky, K. (1963). Human acquisition of concepts for sequential patterns. Psychological Review, 70(6), 534.Team, R., et al. (2013). R: A language and environment for statistical computing. Vienna, Austria: R Foundation for Statistical Computing.Whiteson, S., Tanner, B., & White, A. (2010). The reinforcement learning competitions. The AI Magazine, 31(2), 81–94.Wiering, M., & van Otterlo, M. (Eds.). (2012). Reinforcement learning: State-of-the-art. Berlin: Springer.Wolfram, S. (2002). A new kind of science. Champaign, IL: Wolfram Media.Zatuchna, Z., & Bagnall, A. (2009). Learning mazes with aliasing states: An LCS algorithm with associative perception. Adaptive Behavior, 17(1), 28–57.Zenil, H. (2010). Compression-based investigation of the dynamical properties of cellular automata and other systems. Complex Systems, 19(1), 1–28.Zenil, H. (2011). Une approche expérimentale à la théorie algorithmique de la complexité. PhD thesis, Dissertation in fulfilment of the degree of Doctor in Computer Science, Université de Lille.Zenil, H., Soler-Toscano, F., Delahaye, J. P. & Gauvrit, N. (2012). Two-dimensional kolmogorov complexity and validation of the coding theorem method by compressibility. arXiv, preprint arXiv:1212.6745

The role of tRNA synthetases in neurological and neuromuscular disorders.

Aminoacyl-tRNA synthetases (ARSs) are ubiquitously expressed enzymes responsible for charging tRNAs with their cognate amino acids, therefore essential for the first step in protein synthesis. Although the majority of protein synthesis happens in the cytosol, an additional translation apparatus is required to translate the 13 mitochondrial DNA-encoded proteins important for oxidative phosphorylation. Most ARS genes in these cellular compartments are distinct, but two genes are common, encoding aminoacyl-tRNA synthetases of glycine (GARS) and lysine (KARS) in both mitochondria and the cytosol. Mutations in the majority of the 37 nuclear-encoded human ARS genes have been linked to a variety of recessive and dominant tissue-specific disorders. Current data indicate that impaired enzyme function could explain the pathogenicity, however not all pathogenic ARSs mutations result in deficient catalytic function; thus, the consequences of mutations may arise from other molecular mechanisms. The peripheral nerves are frequently affected, as illustrated by the high number of mutations in cytosolic and bifunctional tRNA synthetases causing Charcot-Marie-Tooth disease (CMT). Here we provide insights on the pathomechanisms of CMT-causing tRNA synthetases with specific focus on the two bifunctional tRNA synthetases (GARS, KARS)

Chess databases as a research vehicle in psychology : modeling large data

The game of chess has often been used for psychological investigations, particularly in cognitive science. The clear-cut rules and well-defined environment of chess provide a model for investigations of basic cognitive processes, such as perception, memory, and problem solving, while the precise rating system for the measurement of skill has enabled investigations of individual differences and expertise-related effects. In the present study, we focus on another appealing feature of chess—namely, the large archive databases associated with the game. The German national chess database presented in this study represents a fruitful ground for the investigation of multiple longitudinal research questions, since it collects the data of over 130,000 players and spans over 25 years. The German chess database collects the data of all players, including hobby players, and all tournaments played. This results in a rich and complete collection of the skill, age, and activity of the whole population of chess players in Germany. The database therefore complements the commonly used expertise approach in cognitive science by opening up new possibilities for the investigation of multiple factors that underlie expertise and skill acquisition. Since large datasets are not common in psychology, their introduction also raises the question of optimal and efficient statistical analysis. We offer the database for download and illustrate how it can be used by providing concrete examples and a step-by-step tutorial using different statistical analyses on a range of topics, including skill development over the lifetime, birth cohort effects, effects of activity and inactivity on skill, and gender differences