Constructing efficient algorithms is difficult and often considered to be a privilege of a few specialists. Program calculation is a methodology for easy construction of efficient algorithms, where efficient algorithms are systematically derived from naive but obviously correct algorithms by calculational laws. This paper shows an ongoing effort to give a clear and effective methodology to deal...

Hypergeometric representations of classical constants and efficient algorithms for their calculation are discussed. Particular attention is devoted to algorithms for computing pi.

Multi resolution, high temporal fire monitoring and intensity mapping using Himawari-8 Advanced Himawari Imager data [3] This study is focused on utilising the multi-resolution and high frequency data from Advanced Himawari Imager to develop new algorithms for fire line mapping and fire intensity calculation. Two algorithms are proposed for fire line mapping and fire radiant energy: calculation...

Multi resolution, high temporal fire monitoring and intensity mapping using Himawari-8 Advanced Himawari Imager data [3] This study is focused on utilising the multi-resolution and high frequency data from Advanced Himawari Imager to develop new algorithms for fire line mapping and fire intensity calculation. Two algorithms are proposed for fire line mapping and fire radiant energy: calculation...

This paper considers the application of the skewed structured singular value to the robust stability of systems subject to strictly real parametric uncertainty. Three statespace formulations that counteract the discontinuous nature of this problem are detailed. It is shown that the calculation of the supremum of the structured singular value over a frequency range using these formulations trans...

background and purpose: sample size and its determination is one of the most important problems in health researches. calculating sample size for prevalence studies is one of the common questions of sample size topics. minimum sample size with least complexity is desirable in order to achieve the basic goal of these studies. this study aims to compare two formulas of sample size calculation for...

In this paper, we develop algorithms for calculation of fractal measures and characteristic exponents for modeling of chaotic systems evolution. Using temporal localization along phase trajectories of a chaotic attractor reconstructed from nonlinear time series, we achieve the essential reduction of required computer resources that allows the nonlinear analysis algorithms to be realized even fo...

A Molecular Dynamic (MD) system is defined by the position and momentum of particles and their interactions. The dynamics of a system can be evaluated by an N-body problem and the simulation is continued until the energy reaches equilibrium. Thus, solving the dynamics numerically and evaluating the interaction is computationally expensive even for a small number of particles in the system. The ...

This paper summarizes our experience on the design of network bandwidth allocation policies and distributed rate calculation algorithms for packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max±min (GMM) and the weight-proportional max±min (WPMM) policies, both of which generalize the classical max±min rate allocation policy. For the design of dis...

This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies of distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max-min (GMM) and the weight-proportional max-min (WPMM) policies, both of which generalize the classical max-min rate allocation policy. Fo...