The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...

A Howell design of side s and order 2n+2, or more briefly an H(s, 2n+2) isan s× s array in which each cell is either empty or contains an unordered pairof elements from some 2n+2 set V such that (1) every element of V occurs inprecisely one cell of each row and each column, and (2) every unordered pairof elements from V is in at most one cell of the array. It follows immediately...

Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...

The respiratory muscles may fatigue during prolonged exercises and thereby become a factor that limits extreme physical activity. The aim of the current study was to determine whether respiratory muscle fatigue imposes a limitation on extreme physical activity of well-trained young men. Electromyography (EMG) signals of respiratory (external intercostal and sternomastoid) and calf muscles (gast...

Robot navigation in unknown environments requires an efficient exploration method. Exploration involves not only to determine towards the robot must to move but also motion planning, and simultaneous localization and mapping processes. The final goal of the exploration task is to build a map of the environment that previously the robot didn’t know. This work proposes the Voronoi Fast Marching m...

We present a fast algorithm for solving the eikonal equation in three dimensions, based on the fast marching method. The algorithm is of the order O(N log N), where N is the total number of grid points in the computational domain. The algorithm can be used in any orthogonal coordinate system and globally constructs the solution to the eikonal equation for each point in the coordinate domain. Th...

This paper presents the application of the Voronoi Fast Marching method to Path Planning of Mobile Formation Robots. The Voronoi Fast Marching method uses the propagation of a wave (Fast Marching) operating on the world model to determine a motion plan over a viscosity map (similar to the refraction index in optics) extracted from the updated map model. The computational efficiency of the metho...

We analyze the role of the regularization parameter λ in the total variation (TV) denoising model. There are several contributions in this paper. (1) We realize that, beyond controlling the smoothness of the solution, λ exhibits another significant behavior — causality. This property allows us to solve the problem by incrementally increasing λ so that each solution at a given regularization par...