We consider the problem of calibrating range measurements of a Light Detection and Ranging (lidar) sensor that is dealing with the sensor nonlinearity and heteroskedastic, range-dependent, measurement error. We solved the calibration problem without using additional hardware, but rather exploiting assumptions on the environment surrounding the sensor during the calibration procedure. More specifically we consider the assumption of calibrating the sensor by placing it in an environment so that its measurements lie in a 2D plane that is parallel to the ground. Then, its measurements come from fixed objects that develop orthogonally w.r.t. the ground, so that they may be considered as fixed points in an inertial reference frame. Moreov

Nigella sativa has various pharmacological properties and has been used throughout history for a variety of reasons. However, there is limited data about the effects of N. sativa (NS) on human cancer cells. This study aimed at observing the roles of methanolic extract of N. sativa on apoptosis and autophagy pathway in the Human PC3 (prostate cancer) cell line. The cell viability was checked by MTT assay. Clonogenic assay was performed to demonstrate clonogenicity and Western blot was used to check caspase-3, TIGAR, p53, and LC3 protein expression. The results demonstrated that PC3 cell proliferation was inhibited, caspase-3 and p53 protein expression was induced, and LC3 protein expression was modulated. The clonogenic assay showed that PC3

R. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.

<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem

This research aimed to develop a simulation traffic model for an urban street with heterogeneous traffic capable of analyzing different types of vehicles of static and dynamic characteristics based on trajectory analysis that demonstrated psychophysical driver behavior. The base developed model for urban traffic was performed based on the collected field data for the major urban street in Baghdad city. The parameter; CC1 minimum headway (represented the speed-dependent of the safety distance from stop line that the driver desired) justified in the range from (2.86sec) to (2.17 sec) indicated a good match to reflect the actual traffic behavior for urban traffic streets. A good indication of the convergence between simulat

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.