The Experts below are selected from a list of 198 Experts worldwide ranked by ideXlab platform

Toru Ishida - One of the best experts on this subject based on the ideXlab platform.

  • SCC - Higher-Order Functions for Modeling Hierarchical Service Bindings
    2016 IEEE International Conference on Services Computing (SCC), 2016
    Co-Authors: Takao Nakaguchi, Yohei Murakami, Toru Ishida
    Abstract:

    Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a Higher-Order Function that can take Functions as parameters to allow Function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing Higher-Order Functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.

  • Higher-Order Functions for Modeling Hierarchical Service Bindings
    2016 IEEE International Conference on Services Computing (SCC), 2016
    Co-Authors: Takao Nakaguchi, Yohei Murakami, Toru Ishida
    Abstract:

    Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a Higher-Order Function that can take Functions as parameters to allow Function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing Higher-Order Functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.

Takao Nakaguchi - One of the best experts on this subject based on the ideXlab platform.

  • SCC - Higher-Order Functions for Modeling Hierarchical Service Bindings
    2016 IEEE International Conference on Services Computing (SCC), 2016
    Co-Authors: Takao Nakaguchi, Yohei Murakami, Toru Ishida
    Abstract:

    Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a Higher-Order Function that can take Functions as parameters to allow Function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing Higher-Order Functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.

  • Higher-Order Functions for Modeling Hierarchical Service Bindings
    2016 IEEE International Conference on Services Computing (SCC), 2016
    Co-Authors: Takao Nakaguchi, Yohei Murakami, Toru Ishida
    Abstract:

    Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a Higher-Order Function that can take Functions as parameters to allow Function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing Higher-Order Functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.

Satoshi Suzuki - One of the best experts on this subject based on the ideXlab platform.

  • NIRS-SPM Analysis of Body Schema Modification and Performance of Body Motion
    2018 11th International Conference on Human System Interaction (HSI), 2018
    Co-Authors: Takumi Watanabe, Toshiki Fujiwara, Satoshi Suzuki
    Abstract:

    On manipulation of objects for a person, body schema modification plays an important role to grasp the spatial relation between he/she and the object. In order to investigate the relation between body schema modification and performance of the spatial manipulation in this study, participants performed a task of tracing Japanese characters using sticks having different lengths, and their cerebral blood flow were measured during the task. Since body schema is a Higher-Order Function of the brain, statistical parametric mapping (SPM) was used to elucidate the Function. More over an improvement of the task performance by interference to the body schema by applying transcutaneous electrical nerve stimulation (TENS) with different intensities was tried, where the task performance means accuracy of the manipulation of object. Applying SPM analysis, a significant difference at Brodmann area 7 (BA7) and BA40 was confirmed when length of stick was the longest, which induced strongest body schema modification in our experimental condition. There was a significant difference in BA21 and BA39 when accuracy of the manipulation of object was different according to the length of the stick. Applying TENS to enhance the body schema modification, a significant different activation in BA19 and BA37 was confirmed. In conclusion, the brain part which related to accuracy of the hand manipulation were clarified. Moreover, we suggested TENS enable to change accuracy of the hand manipulation.

  • HSI - NIRS-SPM Analysis of Body Schema Modification and Performance of Body Motion
    2018 11th International Conference on Human System Interaction (HSI), 2018
    Co-Authors: Takumi Watanabe, Toshiki Fujiwara, Satoshi Suzuki
    Abstract:

    On manipulation of objects for a person, body schema modification plays an important role to grasp the spatial relation between he/she and the object. In order to investigate the relation between body schema modification and performance of the spatial manipulation in this study, participants performed a task of tracing Japanese characters using sticks having different lengths, and their cerebral blood flow were measured during the task. Since body schema is a Higher-Order Function of the brain, statistical parametric mapping (SPM) was used to elucidate the Function. More over an improvement of the task performance by interference to the body schema by applying transcutaneous electrical nerve stimulation (TENS) with different intensities was tried, where the task performance means accuracy of the manipulation of object. Applying SPM analysis, a significant difference at Brodmann area 7 (BA7) and BA40 was confirmed when length of stick was the longest, which induced strongest body schema modification in our experimental condition. There was a significant difference in BA21 and BA39 when accuracy of the manipulation of object was different according to the length of the stick. Applying TENS to enhance the body schema modification, a significant different activation in BA19 and BA37 was confirmed. In conclusion, the brain part which related to accuracy of the hand manipulation were clarified. Moreover, we suggested TENS enable to change accuracy of the hand manipulation.

Yohei Murakami - One of the best experts on this subject based on the ideXlab platform.

  • SCC - Higher-Order Functions for Modeling Hierarchical Service Bindings
    2016 IEEE International Conference on Services Computing (SCC), 2016
    Co-Authors: Takao Nakaguchi, Yohei Murakami, Toru Ishida
    Abstract:

    Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a Higher-Order Function that can take Functions as parameters to allow Function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing Higher-Order Functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.

  • Higher-Order Functions for Modeling Hierarchical Service Bindings
    2016 IEEE International Conference on Services Computing (SCC), 2016
    Co-Authors: Takao Nakaguchi, Yohei Murakami, Toru Ishida
    Abstract:

    Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a Higher-Order Function that can take Functions as parameters to allow Function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing Higher-Order Functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.

G. Michaelson - One of the best experts on this subject based on the ideXlab platform.

  • NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FunctionS
    Parallel Algorithms and Applications, 2020
    Co-Authors: G. Michaelson, Norman Scaife, Paul Bristow, Peter J. B. King
    Abstract:

    Algorithmic skeletons provide a promising basis for the automatic utilisation of parallelism at sites of higher order Function use through static program analysis. However, decisions about whether or not to realise particular higher order Function instances as skeletons must be based on information about processing resources available at runtime In principle, nested higher order Functions may be realised as nested skeletons. However, where higher order Function arguments result from partially applied Functions, free-variable bindings must be identified and communicated through the corresponding skeleton hierarchy to where those arguments are actually applied Here, a skeleton based parallelising compiler for Standard ML is presented. Hybrid skeletons, which can change from parallel to serial evaluation at runtime, are considered and mechanisms for their nesting are discussed. The main compilation stages are illustrated for simple examples. A nested higher order Function based algorithm for multiplying matr...

  • ASE - Higher order Function synthesis through proof planning
    Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), 2001
    Co-Authors: A. Cook, A. Ireland, G. Michaelson
    Abstract:

    The close association between higher order Functions and algorithmic skeletons is a promising source of automatic parallelisation of programs. An approach to automatically synthesizing higher order Functions from Functional programs through proof planning is presented Our work has been conducted within the context of a parallelising compiler for SML, with the objective of exploiting parallelism latent in potential higher order Function use in programs.

  • Higher order Function synthesis through proof planning
    Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), 2001
    Co-Authors: A. Cook, A. Ireland, G. Michaelson
    Abstract:

    The close association between higher order Functions and algorithmic skeletons is a promising source of automatic parallelisation of programs. An approach to automatically synthesizing higher order Functions from Functional programs through proof planning is presented Our work has been conducted within the context of a parallelising compiler for SML, with the objective of exploiting parallelism latent in potential higher order Function use in programs.