[en] Precipitation is very important to humankind, as it represents a pure source of water beside the earth. Therefore, many researchers are interested in rain. In this study, the monthly data for the amount of rainfall for fourteen stations (Baghdad, Basra, Diwania, Kirkuk, Smaw, Tikirit, Rutb, Mousl, Alialgarbi, talafer, Kut, samara, Hali, and Nasiriya) in Iraq was collected from the General Authority for Meteorology and Seismic Monitoring, the maximum understanding of precipitation behavior, was tested the data according to tests Kolmogorov-Smirnov. Anderson, Chi-Squared, The 20 probability distributions were applied to find the appropriate distribution of this data. Was found that the Mosul station has the largest amount of rain from other stations and that this data follows the distribution Log-Gamma Which is considered the best distribution according to the tests, while Basra station takes to distribute Burr (4p), while, Rutba Station takes logistical distribution while Baghdad Log-Pearson 3 Station, despite the maximum monthly precipitation, Baghdad has more statistics than Rutba. (paper)

[en] A simple, rapid, precise and accurate spectrophotometric method has been developed for quantitative analysis of Dolutegravir sodium in tablet formulations. The initial stock solution of Dolutegravir sodium was prepared in methanol solvent and subsequent dilution was done in water. The standard solution of Dolutegravir sodium in water showed maximum absorption at wavelength 259.80 nm. The drug obeyed Beer-Lamberts law in the concentration range of 5-40 μg/ mL with coefficient of correlation (R"2) was 0.9992. The method was validated as per the ICH guidelines. The developed method can be adopted in routine analysis of Dolutegravir sodium in bulk or tablet dosage form and it involves relatively low cost solvents and no complex extraction techniques. (author)

[en] Two deterministic schemes using the χ state as the entangled channel are put forward to realize the remote preparation of arbitrary two- and three-qubit states. To design the schemes, we construct sets of ingenious measurement bases, which have no restrictions on the coefficients of the prepared state. At variance with the existing schemes via the χ state, the success probabilities of the proposed schemes are greatly improved. (paper)

[en] Quantum contextuality is one of the fundamental notions in quantum mechanics. Proofs of the Kochen–Specker theorem and noncontextuality inequalities are two means for revealing the contextuality phenomenon in quantum mechanics. It has been found that some proofs of the Kochen-Specker theorem, such as those based on rays, can be converted to a state-independent noncontextuality inequality, but it remains open whether this is true in general, i.e., whether any proof of the Kochen-Specker theorem can always be converted to a noncontextuality inequality. In this paper, we address this issue. We prove that all kinds of proofs of the Kochen-Specker theorem, based on rays or any other observables, can always be converted to state-independent noncontextuality inequalities. Besides, our constructive proof also provides a general approach for deriving a state-independent noncontextuality inequality from a proof of the KS theorem. (paper)

No abstract available

[en] In this paper, two novel schemes for deterministic joint remote state preparation (JRSP) of arbitrary single- and two-qubit states are proposed. A set of ingenious four-particle partially entangled states are constructed to serve as the quantum channels. In our schemes, two senders and one receiver are involved. Participants collaborate with each other and perform projective measurements on their own particles under an elaborate measurement basis. Based on their measurement results, the receiver can reestablish the target state by means of appropriate local unitary operations deterministically. Unit success probability can be achieved independent of the channel’s entanglement degree. (paper)

[en] Pathwise predictability of continuous-time processes is studied in a deterministic setting. We discuss uniform prediction in some weak sense with respect to certain classes of inputs. More precisely, we study the possibility of approximation of convolution integrals over future time by integrals over past time. We found that all band-limited processes are predictable in this sense as well as high-frequency processes with zero energy at low frequencies. It follows that a process of mixed type can still be predicted if an ideal low-pass filter exists for this process. (fast track communication)

[en] In this paper, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs

[en] The so-called EURO data set is the largest set ever assembled, consisting of fracture toughness results obtained in the ductile-to-brittle transition region. It was the outcome of a large EU sponsored project which involved ten European laboratories in the second half of the 90ies. Several post-project investigations have identified one of the blocks from which specimens were extracted (block SX9) as macroscopically inhomogeneous and significantly tougher than the remaining blocks. In this study, the variability of block SX9 has been investigated using the conventional Master Curve (MC) methodology and some recent MC extensions, namely the SINTAP lower tail, the single point estimation, the bi-modal Master Curve and the multi-modal Master Curve. The basic MC method is intended for macroscopically homogeneous ferritic steels only, and the alternative approaches have been developed for the investigation of inhomogeneous materials. Therefore, these methods can be used to study the behaviour of block SX9 within the EURO data set. It has been found that the bi-modal and multi-modal MC approaches are quite effective in detecting the anomaly represented by block SX9, but only when analyses are performed on data sets of comparable size.

[en] We investigate a stochastic search process in one, two, and three dimensions in which N diffusing searchers that all start at x ₀ seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate r, or deterministically, with a reset time T. In one dimension and for a small number of searchers, the search time and the search cost are minimized at a non-zero optimal reset rate (or time), while for sufficiently large N, resetting always hinders the search. In general, a single searcher leads to the minimum search cost in one, two, and three dimensions. When the resetting is deterministic, several unexpected feature arise for N searchers, including the search time being independent of T for $1/T\to <!--\; ???\; -->0$ and the search cost being independent of N over a suitable range of N. Moreover, deterministic resetting typically leads to a lower search cost than in Poisson resetting. (paper: interdisciplinary statistical mechanics)