720 research outputs found
Hajime Kono and Takashi Hironaka of Tokyo, contestants of the Van Cliburn piano competition
Hajime Kono (left) and Takashi Hironaka from Tokyo, contestants of the Van Cliburn. The boys are photographed with a piano music book, not wasting any time setting up their keyboards for a practice session. Fort Worth Star-Telegram Morning edition September 18, 1962.https://mavmatrix.uta.edu/specialcollections_startelegram1960s/1863/thumbnail.jp
Hajime Kono, Semifinals, 1st Van Cliburn Competition (1962)
Piano Trio no. 1 in B major, Op. 8. Allegro con brio / Brahms -- Piano Trio no. 1 in B major, Op. 8. Adagio / Brahms -- Keyboard Sonata in G major, K. 259 / Scarlatti -- Keyboard Sonata in G minor, K. 450 / Scarlatti -- Piano Sonata No. 2, Op. 50. Slow, with nobility / MacDowell -- Piano Sonata no. 3, Op. 5. Scherzo / Brahms
Hajime Kono, Semi-finals, 1st Van Cliburn Competition (1962)
Piano trio no. 1 in B major, op. 8. Allegro con brio - Tranquillo - In tempo ma sempre sostenuto / Brahms -- Piano trio no. 1 in B major, op. 8. Adagio / Brahms -- Keyboard sonata in G major, K. 259 / Scarlatti -- Keyboard sonata in G minor, K. 450 / Scarlatti -- Piano sonata no. 2 in G minor, op. 50. Slow, with nobility / MacDowell -- Piano sonata no. 3 in F minor, op. 5. Scherzo. Allegro energico avec trio / Brahms
Identification of a key pathway required for the sterile inflammatory response triggered by dying cells
Radiation dose reduction to the eye lens in head CT using tungsten functional paper and organ-based tube current modulation
近畿大学Kindai University博士(医学)主査: 石井,一成教授 学内授与番号:医第1326号 Hiroyuki Kosaka, Hajime Monzen, Morikazu Amano, Mikoto Tamura, Shota Hattori, Yuki Kono, Yasumasa Nishimura. European Journal of Radiology Volume 124, March 2020, 108814 https://doi.org/10.1016/j.ejrad.2020.108814 掲載application/pdfdoctoral thesi
Letter from [Minna A. Newman], Carson Estate Company to Mr. A. [Al] G. Hemming, February 1, 1946
Refers to two enclosed leases: #3-B for "G. V. Voight" and #1 for John Hajime Masuzumi
Search-based optimal motion planning for automated driving
This paper presents a framework for fast and robust motion planning designed to facilitate automated driving. The framework allows for real-time computation even for horizons of several hundred meters and thus enabling automated driving in urban conditions. This is achieved through several features. Firstly, a convenient geometrical representation of both the search space and driving constraints enables the use of classical path planning approach. Thus, a wide variety of constraints can be tackled simultaneously (other vehicles, traffic lights, etc.). Secondly, an exact cost-to-go map, obtained by solving a relaxed problem, is then used by A∗-based algorithm with model predictive flavour in order to compute the optimal motion trajectory. The algorithm takes into account both distance and time horizons. The approach is validated within a simulation study with realistic traffic scenarios. We demonstrate the capability of the algorithm to devise plans both in fast and slow driving conditions, even when full stop is required.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Intelligent Vehicle
Human-robot cooperative object manipulation with contact changes
This paper presents a system for cooperatively manipulating large objects between a human and a robot. This physical interaction system is designed to handle, transport, or manipulate large objects of different shapes in cooperation with a human. Unique points are the bi-manual physical cooperation, the sequential characteristic of the cooperation including contact changes, and a novel architecture combining force interaction cues, interactive search-based planning, and online trajectory and motion generation. The resulting system implements a mixed initiative collaboration strategy, deferring to the human when his intentions are unclear, and driving the task once understood. This results in an easy and intuitive human-robot interaction. It is evaluated in simulations and on a bi-manual mobile robot with 32 degrees of freedom.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Learning & Autonomous Contro
Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice
Consistency with the formal Church’s thesis, for short CT, and the axiom of choice, for short AC, was one of the requirements asked to be satisfied by the intensional level of a two-level foundation for constructive mathematics as proposed by Maietti and Sambin (in Crosilla, Schuster (eds) From sets and types to topology and analysis: practicable foundations for constructive mathematics, Oxford University Press, Oxford, 2005). Here we show that this is the case for the intensional level of the two-level Minimalist Foundation, for short MF, completed in 2009 by the second author. The intensional level of MF consists of an intensional type theory à la Martin-Löf, called mTT. The consistency of mTT with CT and AC is obtained by showing the consistency with the formal Church’s thesis of a fragment of intensional Martin-Löf’s type theory, called MLtt1, where mTT can be easily interpreted. Then to show the consistency of MLtt1 with CT we interpret it within Feferman’s predicative theory of non-iterative fixpoints ID1ˆ by extending the well known Kleene’s realizability semantics of intuitionistic arithmetics so that CT is trivially validated. More in detail the fragment MLtt1 we interpret consists of first order intensional Martin-Löf’s type theory with one universe and with explicit substitution rules in place of usual equality rules preserving type constructors (hence without the so called ξ-rule which is not valid in our realizability semantics). A key difficulty encountered in our interpretation was to use the right interpretation of lambda abstraction in the applicative structure of natural numbers in order to model all the equality rules of MLtt1 correctly. In particular the universe of MLtt1 is modelled by means of ID1ˆ-fixpoints following a technique due first to Aczel and used by Feferman and Beeson
- …
