The present work determines the particle size based only on the number of tracks detected in a cluster created by a hot particle on the CR-39 solid state nuclear track detector and depending on the exposure time. The mathematical model of the cross section developed here gives the relationship between alpha particle emitting from the (n, α) reaction and the number of tracks created and distribution of tracks created on the surface of the track detector. In an experiment performed during this work, disc of boron compound (boric acid or sodium tetraborate) of different weights were prepared and exposed to thermal neutron from the source. Chemical etching is processes of path formation in the detector, during which a suitable etching solut

In this work, an estimation of the key rate of measurement-device-independent quantum key distribution (MDI-QKD) protocol in free space was performed. The examined free space links included satellite-earth downlink, uplink and intersatellite link. Various attenuation effects were considered such as diffraction, atmosphere, turbulence and the efficiency of the detection system. Two cases were tested: asymptotic case with infinite number of decoy states and one-decoy state case. The estimated key rate showed the possibility of applying MDI-QKD in earth-satellite and intersatellite links, offering longer single link distance to be covered.

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Accurate and correct price prediction of gold is significant to maintain the stability and fair operation of gold markets as well as the efficiency and proper functioning of financial markets related to gold trading. Gold prices have a long history of non-linear and non-stationary behavior that generates highly complex datasets which are very difficult to forecast with high accuracy and reliability. At the same time Support Vector Regression (SVR) has been utilized as a robust information for prediction not only gold prices but also overall metal price movements. First, the predictive capability of SVR is highly sensitive to hyperparameter selection which needs to be thoroughly tuned and optimized for potentially optimal performance. Theref

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit