343,950 research outputs found

    On potential cognitive abilities in the machine kingdom

    Full text link
    The final publication is available at Springer via http://dx.doi.org/10.1007/s11023-012-9299-6Animals, including humans, are usually judged on what they could become, rather than what they are. Many physical and cognitive abilities in the ‘animal kingdom’ are only acquired (to a given degree) when the subject reaches a certain stage of development, which can be accelerated or spoilt depending on how the environment, training or education is. The term ‘potential ability’ usually refers to how quick and likely the process of attaining the ability is. In principle, things should not be different for the ‘machine kingdom’. While machines can be characterised by a set of cognitive abilities, and measuring them is already a big challenge, known as ‘universal psychometrics’, a more informative, and yet more challenging, goal would be to also determine the potential cognitive abilities of a machine. In this paper we investigate the notion of potential cognitive ability for machines, focussing especially on universality and intelligence. We consider several machine characterisations (non-interactive and interactive) and give definitions for each case, considering permanent and temporal potentials. From these definitions, we analyse the relation between some potential abilities, we bring out the dependency on the environment distribution and we suggest some ideas about how potential abilities can be measured. Finally, we also analyse the potential of environments at different levels and briefly discuss whether machines should be designed to be intelligent or potentially intelligent.We thank the anonymous reviewers for their comments, which have helped to significantly improve 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. Finally, we thank three pioneers ahead of their time(s). We thank Ray Solomonoff (1926-2009) and Chris Wallace (1933-2004) for all that they taught us, directly and indirectly. And, in his centenary year, we thank Alan Turing (1912-1954), with whom it perhaps all began.Hernández-Orallo, J.; Dowe, DL. (2013). On potential cognitive abilities in the machine kingdom. Minds and Machines. 23(2):179-210. https://doi.org/10.1007/s11023-012-9299-6S179210232Amari, S., Fujita, N., Shinomoto, S. (1992). Four types of learning curves. Neural Computation 4(4), 605–618.Aristotle (Translation, Introduction, and Commentary by Ross, W.D.) (1924). Aristotle’s Metaphysics. Oxford: Clarendon Press.Barmpalias, G. & Dowe, D. L. (2012). Universality probability of a prefix-free machine. Philosophical transactions of the Royal Society A [Mathematical, Physical and Engineering Sciences] (Phil Trans A), Theme Issue ‘The foundations of computation, physics and mentality: The Turing legacy’ compiled and edited by Barry Cooper and Samson Abramsky, 370, pp 3488–3511.Chaitin, G. J. (1966). On the length of programs for computing finite sequences. Journal of the Association for Computing Machinery, 13, 547–569.Chaitin, G. J. (1975). A theory of program size formally identical to information theory. Journal of the ACM (JACM), 22(3), 329–340.Dowe, D. L. (2008, September). Foreword re C. S. Wallace. Computer Journal, 51(5):523–560, Christopher Stewart WALLACE (1933–2004) memorial special issue.Dowe, D. L. (2011). MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: P. S. Bandyopadhyay, M. R. Forster (Eds), Handbook of the philosophy of science—Volume 7: Philosophy of statistics (pp. 901–982). Amsterdam: Elsevier.Dowe, D. L. & Hajek, A. R. (1997a). A computational extension to the turing test. Technical report #97/322, Dept Computer Science, Monash University, Melbourne, Australia, 9 pp, http://www.csse.monash.edu.au/publications/1997/tr-cs97-322-abs.html .Dowe, D. L. & Hajek, A. R. (1997b, September). A computational extension to the Turing Test. in Proceedings of the 4th conference of the Australasian Cognitive Science Society, University of Newcastle, NSW, Australia, 9 pp.Dowe, D. L. & Hajek, A. R. (1998, February). A non-behavioural, computational extension to the Turing Test. In: International conference on computational intelligence and multimedia applications (ICCIMA’98), Gippsland, Australia, pp 101–106.Dowe, D. L., Hernández-Orallo, J. (2012). IQ tests are not for machines, yet. Intelligence, 40(2), 77–81.Gallistel, C. R., Fairhurst, S., & Balsam, P. (2004). The learning curve: Implications of a quantitative analysis. In Proceedings of the National Academy of Sciences of the United States of America, 101(36), 13124–13131.Gardner, M. (1970). Mathematical games: The fantastic combinations of John Conway’s new solitaire game “life”. Scientific American, 223(4), 120–123.Goertzel, B. & Bugaj, S. V. (2009). AGI preschool: A framework for evaluating early-stage human-like AGIs. In Proceedings of the second international conference on artificial general intelligence (AGI-09), pp 31–36.Hernández-Orallo, J. (2000a). Beyond the Turing Test. Journal of Logic, Language & Information, 9(4), 447–466.Hernández-Orallo, J. (2000b). 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. (2010). On evaluating agent performance in a fixed period of time. In M. Hutter et al. (Eds.), Proceedings of 3rd international conference on artificial general intelligence (pp. 25–30). New York: Atlantis Press.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. (2011, April). Mammals, machines and mind games. Who’s the smartest?. The conversation, http://theconversation.edu.au/mammals-machines-and-mind-games-whos-the-smartest-566 .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.), Artificial general intelligence 2011, volume 6830, LNAI series, pp. 82–91. New York: Springer.Hernández-Orallo, J., Dowe, D. L., & Hernández-Lloreda, M. V. (2012a, March). Measuring cognitive abilities of machines, humans and non-human animals in a unified way: towards universal psychometrics. Technical report 2012/267, Faculty of Information Technology, Clayton School of I.T., Monash University, Australia.Hernández-Orallo, J., Insa, J., Dowe, D. L., & Hibbard, B. (2012b). Turing tests with Turing machines. In A. Voronkov (Ed.), The Alan Turing centenary conference, Turing-100, Manchester, 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 the international symposium of engineering of intelligent systems (EIS’98) (pp 146–163). Switzerland: ICSC Press.Herrmann, E., Call, J., Hernández-Lloreda, M. V., Hare, B., & Tomasello, M. (2007). Humans have evolved specialized skills of social cognition: The cultural intelligence hypothesis. Science, 317(5843), 1360–1366.Herrmann, E., Hernández-Lloreda, M. V., Call, J., Hare, B., & Tomasello, M. (2010). The structure of individual differences in the cognitive abilities of children and chimpanzees. Psychological Science, 21(1), 102–110.Horn, J. L., & Cattell, R. B. (1966). Refinement and test of the theory of fluid and crystallized general intelligences. Journal of educational psychology, 57(5), 253.Hutter, M. (2005). Universal artificial intelligence: Sequential decisions based on algorithmic probability. New York: Springer.Insa-Cabrera, J., Dowe, D. L., España, S., Hernández-Lloreda, M. V., & Hernández-Orallo, J. (2011a). Comparing humans and AI agents. In AGI: 4th conference on artificial general intelligence—Lecture Notes in Artificial Intelligence (LNAI), volume 6830, pp 122–132. Springer, New York.Insa-Cabrera, J., Dowe, D. L., & Hernández-Orallo, J. (2011b). Evaluating a reinforcement learning algorithm with a general intelligence test. In CAEPIA—Lecture Notes in Artificial Intelligence (LNAI), volume 7023, pages 1–11. Springer, New York.Kearns, M. & Singh, S. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49(2), 209–232.Kolmogorov, A. N. (1965). Three approaches to the quantitative definition of information. Problems of Information Transmission, 1, 4–7.Legg, S. (2008, June). Machine super intelligence. Department of Informatics, University of Lugano.Legg, S. & Hutter, M. (2007). Universal intelligence: A definition of machine intelligence. Minds and Machines, 17(4), 391–444.Legg, S., & Veness, J. (2012). An approximation of the universal intelligence measure. In Proceedings of Solomonoff 85th memorial conference. New York: Springer.Levin, L. A. (1973). Universal sequential search problems. Problems of Information Transmission, 9(3), 265–266.Li, M., Vitányi, P. (2008). An introduction to Kolmogorov complexity and its applications (3rd ed). New York: Springer.Little, V. L., & Bailey, K. G. (1972). Potential intelligence or intelligence test potential? A question of empirical validity. Journal of Consulting and Clinical Psychology, 39(1), 168.Mahoney, M. V. (1999). Text compression as a test for artificial intelligence. In Proceedings of the national conference on artificial intelligence, AAAI (pp. 486–502). New Jersey: Wiley.Mahrer, A. R. (1958). Potential intelligence: A learning theory approach to description and clinical implication. The Journal of General Psychology, 59(1), 59–71.Oppy, G., & Dowe, D. L. (2011). The Turing Test. In E. N. Zalta (Ed.), Stanford encyclopedia of philosophy. Stanford University. http://plato.stanford.edu/entries/turing-test/ .Orseau, L. & Ring, M. (2011). Self-modification and mortality in artificial agents. In AGI: 4th conference on artificial general intelligence—Lecture Notes in Artificial Intelligence (LNAI), volume 6830, pages 1–10. Springer, New York.Ring, M. & Orseau, L. (2011). Delusion, survival, and intelligent agents. In AGI: 4th conference on artificial general intelligence—Lecture Notes in Artificial Intelligence (LNAI), volume 6830, pp. 11–20. Springer, New York.Schaeffer, J., Burch, N., Bjornsson, Y., Kishimoto, A., Muller, M., Lake, R., et al. (2007). Checkers is solved. Science, 317(5844), 1518.Solomonoff, R. J. (1962). Training sequences for mechanized induction. In M. Yovits, G. Jacobi, & G. Goldsteins (Eds.), Self-Organizing Systems, 7, 425–434.Solomonoff, R. J. (1964). A formal theory of inductive inference. Information and Control, 7(1–22), 224–254.Solomonoff, R. J. (1967). Inductive inference research: Status, Spring 1967. RTB 154, Rockford Research, Inc., 140 1/2 Mt. Auburn St., Cambridge, Mass. 02138, July 1967.Solomonoff, R. J. (1978). Complexity-based induction systems: comparisons and convergence theorems. IEEE Transactions on Information Theory, 24(4), 422–432.Solomonoff, R. J. (1984). Perfect training sequences and the costs of corruption—A progress report on induction inference research. Oxbridge research.Solomonoff, R. J. (1985). The time scale of artificial intelligence: Reflections on social effects. Human Systems Management, 5, 149–153.Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge: The MIT press.Thorp, T. R., & Mahrer, A. R. (1959). Predicting potential intelligence. Journal of Clinical Psychology, 15(3), 286–288.Turing, A. M. (1950). Computing machinery and intelligence. Mind, 59, 433–460.Veness, J., Ng, K. S., Hutter, M., & Silver, D. (2011). A Monte Carlo AIXI approximation. Journal of Artificial Intelligence Research, JAIR, 40, 95–142.Wallace, C. S. (2005). Statistical and inductive inference by minimum message length. New York: Springer.Wallace, C. S., & Boulton, D. M. (1968). An information measure for classification. Computer Journal, 11, 185–194.Wallace, C. S., & Dowe, D. L. (1999a). Minimum message length and Kolmogorov complexity. Computer Journal 42(4), 270–283.Wallace, C. S., & Dowe, D. L. (1999b). Refinements of MDL and MML coding. Computer Journal, 42(4), 330–337.Woergoetter, F., & Porr, B. (2008). Reinforcement learning. Scholarpedia, 3(3), 1448.Zvonkin, A. K., & Levin, L. A. (1970). The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys, 25, 83–124

    Structure of symmetry group of some composite links and some applications

    Full text link
    [EN] In this paper, we study the symmetry group of a type of composite topological links, such as 22m#22 . We have done a complete analysis on the elements of the symmetric group of this link and show the structure of the group. The results can be generalized to the study of the symmetry group of any composite topological link, and therefore it can be used for the classification of composite topological links, which can also be potentially used to identify synthetics molecules. Liu, Y. (2020). Structure of symmetry group of some composite links and some applications. Applied General Topology. 21(2):171-176. https://doi.org/10.4995/agt.2020.10129OJS171176212S. Akbulut and H. King, All knots are algebraic, Commentarii Mathematici Helvetici 56, no. 1 (1981), 339-351. https://doi.org/10.1007/BF02566217J. C. Álvarez Paiva and A. C. Thompson, Volumes on normed and Finsler spaces, Riemann-Finsler Geometry, MSRI Publications 49 (2004), 1-46.M. F. Atiyah, The geometry and physics of knots, Cambridge University Press, 1990. https://doi.org/10.1017/CBO9780511623868A. Bernig, Valuations with crofton formula and finsler geometry, Advances in Mathematics 210, no. 2 (2007), 733-753. https://doi.org/10.1016/j.aim.2006.07.009J. H. Conway, An enumeration of knots and links, and some of their algebraic properties, in: Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), pages 329-358, 1970. https://doi.org/10.1016/B978-0-08-012975-4.50034-5P. R. Cromwel, Knots and links, Cambridge University Press, 2004. https://doi.org/10.1017/CBO9780511809767I. K. Darcy, Biological distances on dna knots and links: applications to xer recombination, Journal of Knot Theory and its Ramifications 10, no. 2 (2001), 269-294. https://doi.org/10.1142/S0218216501000846D. S. Dummit and R. M. Foote, Abstract algebra, volume 1999, Prentice Hall Englewood Cliffs, NJ, 1991.M. H. Freedman, R. E. Gompf, S. Morrison and K. Walker, Man and machine thinking about the smooth 4-dimensional Poincaré conjecture, Quantum Topology 1, no. 2 (2010), 171-208. https://doi.org/10.4171/QT/5M.-L. Ge and Ch. N. Yang, Braid group, knot theory and statistical mechanics, World Scientific, 1989.D. Gorenstein, R. Lyons and R. Solomon, The classification of finite simple groups, volume 1, Plenum Press New York, 1983. https://doi.org/10.1007/978-1-4613-3685-3_1L. H. Kauffman, Knots and physics, volume 53, World scientific, 2013. https://doi.org/10.1142/8338X.-S. Lin, Z. Wang, et al., Integral geometry of plane curves and knot invariants, J. Differential Geom. 44, no. 1 (1996), 74-95. https://doi.org/10.4310/jdg/1214458740Y. Liu, Ropelength under linking operation and enzyme action, General Mathematics 16, no. 1 (2008), 55-58.Y. Liu, On the range of cosine transform of distributions for torus-invariant complex Minkowski spaces, Far East Journal of Mathematical Sciences 39, no. 2 (2010), 733-753.Y. Liu, On the explicit formula of Holmes-Thompson areas in integral geometry, preprint.M. W. Scheeler, D. Kleckner, D. Proment, G. L Kindlmann and W. T. M. Irvine, Helicity conservation by flow across scales in reconnecting vortex links and knots, Proceedings of the National Academy of Sciences 111, no. 43 (2014), 15350-15355. https://doi.org/10.1073/pnas.1407232111A. Stasiak, V. Katritch and L. H. Kauffman, Ideal Knots, Series on Knots and Everything, Vol. 19, World Scientific, Singapore, 1998. https://doi.org/10.1142/3843D. W. Sumners, Untangling Dna, The Mathematical Intelligencer 12, no. 3 (1990), 71-80. https://doi.org/10.1007/BF03024022D. W. Sumners, The knot theory of molecules, Journal of mathematical chemistry 1, no. 1 (1987), 1-14. https://doi.org/10.1007/BF01205335S. A. Wasserman, J. M. Dungan and N. R. Cozzarelli, Discovery of a predicted DNA knot substantiates a model for site-specific recombination, Science 229, no. 4709 (1985), 171-174. https://doi.org/10.1126/science.299004

    Summarization of Spanish Talk Shows with Siamese Hierarchical Attention Networks

    Full text link
    [EN] In this paper, we present an approach to Spanish talk shows summarization. Our approach is based on the use of Siamese Neural Networks on the transcription of the show audios. Specifically, we propose to use Hierarchical Attention Networks to select the most relevant sentences for each speaker about a given topic in the show, in order to summarize his opinion about the topic. We train these networks in a siamese way to determine whether a summary is appropriate or not. Previous evaluation of this approach on summarization task of English newspapers achieved performances similar to other state-of-the-art systems. In the absence of enough transcribed or recognized speech data to train our system for talk show summarization in Spanish, we acquire a large corpus of document-summary pairs from Spanish newspapers and we use it to train our system. We choose this newspapers domain due to its high similarity with the topics addressed in talk shows. A preliminary evaluation of our summarization system on Spanish TV programs shows the adequacy of the proposal.This work has been partially supported by the Spanish MINECO and FEDER founds under project AMIC (TIN2017-85854-C4-2-R). Work of Jose-Angel Gonzalez is financed by Universitat Politecnica de Valencia under grant PAID-01-17.González-Barba, JÁ.; Hurtado Oliver, LF.; Segarra Soriano, E.; García-Granada, F.; Sanchís Arnal, E. (2019). Summarization of Spanish Talk Shows with Siamese Hierarchical Attention Networks. Applied Sciences. 9(18):1-13. https://doi.org/10.3390/app9183836S113918Carbonell, J., & Goldstein, J. (1998). The use of MMR, diversity-based reranking for reordering documents and producing summaries. Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR ’98. doi:10.1145/290941.291025Erkan, G., & Radev, D. R. (2004). LexRank: Graph-based Lexical Centrality as Salience in Text Summarization. Journal of Artificial Intelligence Research, 22, 457-479. doi:10.1613/jair.1523Lloret, E., & Palomar, M. (2011). Text summarisation in progress: a literature review. Artificial Intelligence Review, 37(1), 1-41. doi:10.1007/s10462-011-9216-zSee, A., Liu, P. J., & Manning, C. D. (2017). Get To The Point: Summarization with Pointer-Generator Networks. Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). doi:10.18653/v1/p17-1099Narayan, S., Cohen, S. B., & Lapata, M. (2018). Ranking Sentences for Extractive Summarization with Reinforcement Learning. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). doi:10.18653/v1/n18-1158González, J.-Á., Segarra, E., García-Granada, F., Sanchis, E., & Hurtado, L.-F. (2019). Siamese hierarchical attention networks for extractive summarization. Journal of Intelligent & Fuzzy Systems, 36(5), 4599-4607. doi:10.3233/jifs-179011Furui, S., Kikuchi, T., Shinnaka, Y., & Hori, C. (2004). Speech-to-Text and Speech-to-Speech Summarization of Spontaneous Speech. IEEE Transactions on Speech and Audio Processing, 12(4), 401-408. doi:10.1109/tsa.2004.828699Shih-Hung Liu, Kuan-Yu Chen, Chen, B., Hsin-Min Wang, Hsu-Chun Yen, & Wen-Lian Hsu. (2015). Combining Relevance Language Modeling and Clarity Measure for Extractive Speech Summarization. IEEE/ACM Transactions on Audio, Speech, and Language Processing, 23(6), 957-969. doi:10.1109/taslp.2015.2414820Yang, Z., Yang, D., Dyer, C., He, X., Smola, A., & Hovy, E. (2016). Hierarchical Attention Networks for Document Classification. Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. doi:10.18653/v1/n16-1174Conneau, A., Kiela, D., Schwenk, H., Barrault, L., & Bordes, A. (2017). Supervised Learning of Universal Sentence Representations from Natural Language Inference Data. Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing. doi:10.18653/v1/d17-1070Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990). Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41(6), 391-407. doi:10.1002/(sici)1097-4571(199009)41:63.0.co;2-

    Evaluation of different heat transfer conditions on an automotive turbocharger

    Full text link
    This paper presents a combination of theoretical and experimental investigations for determining the main heat fluxes within a turbocharger. These investigations consider several engine speeds and loads as well as different methods of conduction, convection, and radiation heat transfer on the turbocharger. A one-dimensional heat transfer model of the turbocharger has been developed in combination with simulation of a turbocharged engine that includes the heat transfer of the turbocharger. Both the heat transfer model and the simulation were validated against experimental measurements. Various methods were compared for calculating heat transfer from the external surfaces of the turbocharger, and one new method was suggested. The effects of different heat transfer conditions were studied on the heat fluxes of the turbocharger using experimental techniques. The different heat transfer conditions on the turbocharger created dissimilar temperature gradients across the turbocharger. The results show that changing the convection heat transfer condition around the turbocharger affects the heat fluxes more noticeably than changing the radiation and conduction heat transfer conditions. Moreover, the internal heat transfers from the turbine to the bearing housing and from the bearing housing to the compressor are significant, but there is an order of magnitude difference between these heat transfer rates.The Swedish Energy Agency and KTH Royal Institute of Technology sponsored this work within the Competence Centre for Gas Exchange (CCGEx).Aghaali, H.; Angström, H.; Serrano Cruz, JR. (2015). Evaluation of different heat transfer conditions on an automotive turbocharger. International Journal of Engine Research. 16(2):137-151. doi:10.1177/1468087414524755S137151162Romagnoli, A., & Martinez-Botas, R. (2012). Heat transfer analysis in a turbocharger turbine: An experimental and computational evaluation. Applied Thermal Engineering, 38, 58-77. doi:10.1016/j.applthermaleng.2011.12.022Romagnoli, A., & Martinez-Botas, R. (2009). Heat Transfer on a Turbocharger Under Constant Load Points. Volume 5: Microturbines and Small Turbomachinery; Oil and Gas Applications. doi:10.1115/gt2009-59618Baines, N., Wygant, K. D., & Dris, A. (2010). The Analysis of Heat Transfer in Automotive Turbochargers. Journal of Engineering for Gas Turbines and Power, 132(4). doi:10.1115/1.3204586Serrano, J. R., Olmeda, P., Páez, A., & Vidal, F. (2010). An experimental procedure to determine heat transfer properties of turbochargers. Measurement Science and Technology, 21(3), 035109. doi:10.1088/0957-0233/21/3/035109Bohn, D., Heuer, T., & Kusterer, K. (2005). Conjugate Flow and Heat Transfer Investigation of a Turbo Charger. Journal of Engineering for Gas Turbines and Power, 127(3), 663-669. doi:10.1115/1.1839919Galindo, J., Luján, J. M., Serrano, J. R., Dolz, V., & Guilain, S. (2006). Description of a heat transfer model suitable to calculate transient processes of turbocharged diesel engines with one-dimensional gas-dynamic codes. Applied Thermal Engineering, 26(1), 66-76. doi:10.1016/j.applthermaleng.2005.04.010Sirakov, B., & Casey, M. (2012). Evaluation of Heat Transfer Effects on Turbocharger Performance. Journal of Turbomachinery, 135(2). doi:10.1115/1.4006608Serrano, J., Olmeda, P., Arnau, F., Reyes-Belmonte, M., & Lefebvre, A. (2013). Importance of Heat Transfer Phenomena in Small Turbochargers for Passenger Car Applications. SAE International Journal of Engines, 6(2), 716-728. doi:10.4271/2013-01-0576Larsson, P.-I., Westin, F., Andersen, J., Vetter, J., & Zumeta, A. (2009). Efficient turbo charger testing. MTZ worldwide, 70(7-8), 16-21. doi:10.1007/bf03226965Aghaali, H., & Ångström, H.-E. (2012). Turbocharged SI-Engine Simulation With Cold and Hot-Measured Turbocharger Performance Maps. Volume 5: Manufacturing Materials and Metallurgy; Marine; Microturbines and Small Turbomachinery; Supercritical CO2 Power Cycles. doi:10.1115/gt2012-68758Leufven, O., & Eriksson, L. (2012). Investigation of compressor correction quantities for automotive applications. International Journal of Engine Research, 13(6), 588-606. doi:10.1177/146808741243901

    Direct simulation of liquid-gas-solid flow with a free surface lattice Boltzmann method

    Get PDF
    Direct numerical simulation of liquid-gas-solid flows is uncommon due to the considerable computational cost. As the grid spacing is determined by the smallest involved length scale, large grid sizes become necessary -- in particular if the bubble-particle aspect ratio is on the order of 10 or larger. Hence, it arises the question of both feasibility and reasonability. In this paper, we present a fully parallel, scalable method for direct numerical simulation of bubble-particle interaction at a size ratio of 1-2 orders of magnitude that makes simulations feasible on currently available super-computing resources. With the presented approach, simulations of bubbles in suspension columns consisting of more than 100000100\,000 fully resolved particles become possible. Furthermore, we demonstrate the significance of particle-resolved simulations by comparison to previous unresolved solutions. The results indicate that fully-resolved direct numerical simulation is indeed necessary to predict the flow structure of bubble-particle interaction problems correctly.Comment: submitted to International Journal of Computational Fluid Dynamic
    corecore