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

Rowan Davies - One of the best experts on this subject based on the ideXlab platform.

  • A Temporal-Logic Approach to Binding-Time Analysis
    BRICS Report Series, 1995
    Co-Authors: Rowan Davies
    Abstract:

    The Curry-Howard isomorphism identifies proofs with typed lambda- calculus terms, and correspondingly identifies propositions with types. We show how this isomorphism can be extended to relate constructive temporal logic with binding-Time Analysis. In particular, we show how to extend the Curry-Howard isomorphism to include the   ("next") operator from linear-Time temporal logic. This yields the simply typed lambda-calculus which we prove to be equivalent to a multi-level binding-Time Analysis like those used in partial evaluation. Keywords: Curry-Howard isomorphism, partial evaluation, binding-Time Analysis, temporal logic.

  • LICS - A temporal-logic approach to binding-Time Analysis
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1
    Co-Authors: Rowan Davies
    Abstract:

    The Curry-Howard isomorphism identifies proofs with typed /spl lambda/-calculus terms, and correspondingly identifies propositions with types. We show how this isomorphism can be extended to relate constructive temporal logic with binding-Time Analysis. In particular we show how to extend the Curry-Howard isomorphism to include the O ("next") operator from linear-Time temporal logic. This yields the simply typed /spl lambda//sup O/-calculus which we prove to be equivalent to a multi-level binding-Time Analysis like those used in partial evaluation for functional programming languages. Further, we prove that normalization in /spl lambda//sup O/ can be done in an order corresponding to the Times in the logic, which explains why /spl lambda//sup O/ is relevant to partial evaluation. We then extend /spl lambda//sup O/ to a small functional language, Mini-ML/sup O/, and give an operational semantics for it. Finally, we prove that this operational semantics correctly reflects the binding-Times in the language, a theorem which is the functional programming analog of Time-ordered normalization.

W. Winiecki - One of the best experts on this subject based on the ideXlab platform.

  • Time Analysis OF VIRTUAL SPECTRUM ANALYZER
    International Journal of Computing, 2014
    Co-Authors: W. Winiecki, Piotr Bilski
    Abstract:

    The problem of the Real-Time virtual instrument is presented. The requirements for the Real-Time conditions are explained. The method of the instrument Time Analysis is proposed. The virtual spectrum analyser is examined in order to reveal properties of the software functions. The optimisation procedure is described and its results are presented. The conclusions for the future developers have been articulated.

  • Methodology of virtual instrument Time Analysis
    IEEE Transactions on Instrumentation and Measurement, 2006
    Co-Authors: W. Winiecki
    Abstract:

    This paper proposes a new approach to the virtual instrument (VI) Time Analysis. The main assumptions and issues are presented. A methodology of the VI Time parameter assessment and measurement is proposed. The verification of the methodology is discussed. The premises for future research are outlined.

  • Methodology of virtual instruments' Time Analysis
    Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications 2003. Proceedings, 1
    Co-Authors: W. Winiecki
    Abstract:

    We propose a new approach to the virtual instrument Time Analysis. Main assumptions and problems and are explained. The mathematical method and algorithm are presented and the course of action during the VI development is proposed. The method's verification is briefly discussed and its advantages and problems appearing during the experiments are presented. The promises for the future research are enclosed

Zhang Jianpei - One of the best experts on this subject based on the ideXlab platform.

  • Improved Response Time Analysis Method for Scheduling Tasks with Preemption Threshold
    Computer Engineering, 2007
    Co-Authors: Zhang Jianpei
    Abstract:

    The existing response Time Analysis method for scheduling tasks with preemption threshold is lower in task response Time,resulting in the tasks missing deadline.For the flaws above,this paper presents an improved response Time Analysis method for scheduling tasks with preemption threshold.Taking into account of the effect and Time demand of release jitter and tick scheduling by using the modified task parameters in the computation of the Time-demand function of task,simulation result shows that the improved method can obtain more exact Analysis result using preemption threshold scheduling.

Michael C. Carroll - One of the best experts on this subject based on the ideXlab platform.

  • Exploratory space-Time Analysis of local economic development
    Applied Geography, 2011
    Co-Authors: Michael C. Carroll
    Abstract:

    Many questions regarding local economic growth lay at the intersection of the disciplines of geography and economics, that is, the space-Time interface. This paper attempts to show how space-Time Analysis can help identify communities that are at risk from economic contractions. Exploratory data Analysis is illustrated to provide insights on the temporal and spatial patterns of economic growth. Then this paper offers a space-Time Analysis of employment rates in Ohio counties over the Time period of 1969–2007.

Zhihua Zhou - One of the best experts on this subject based on the ideXlab platform.

  • switch Analysis for running Time Analysis of evolutionary algorithms
    IEEE Transactions on Evolutionary Computation, 2015
    Co-Authors: Chao Qian, Zhihua Zhou
    Abstract:

    Evolutionary algorithms (EAs) are a large family of heuristic optimization algorithms. They are problem independent and have been applied in various optimization problems. Thus, general Analysis tools are especially appealing for guiding the Analysis of EAs in various situations. This paper develops the switch Analysis approach for running Time Analysis of EAs, revealing their average computational complexity. Unlike previous Analysis approaches that analyze an algorithm from scratch, the switch Analysis makes use of another well-analyzed algorithm and, by contrasting them, can lead to better results. We investigate the power of switch Analysis by comparing it with two commonly used Analysis approaches, the fitness level method and the drift Analysis. We define the reducibility between two Analysis approaches for comparing their power. By the reducibility relationship, it is revealed that both the fitness level method and the drift Analysis are reducible to the switch Analysis, as they are equivalent to specific configurations of the switch Analysis. We further show that the switch Analysis is not reducible to the fitness level method, and compare it with the drift Analysis on a concrete Analysis case (the discrete linear problem). The reducibility study might shed some light on the unified view of different running Time Analysis approaches.