In this paper, the Monte Carlo N-Particle extended  computer code (MCNP) were used to design a model of the European Sodium-cooled Fast Reactor. The multiplication factor, conversion factor, delayed neutrons fraction, doppler constant, control rod worth, sodium void worth, masses for major heavy nuclei, radial and axial power distribution at high burnup are studied. The results show that the reactor breeds fissile isotopes with a conversion ratio of 0.994 at fuel burnup 70 (GWd/T), and minor actinides are buildup inside the reactor core. The study aims to check the efficiency of the model on the calculation of the neutronic parameters of the core at high burnup.

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

Traffic classification is referred to as the task of categorizing traffic flows into application-aware classes such as chats, streaming, VoIP, etc. Most systems of network traffic identification are based on features. These features may be static signatures, port numbers, statistical characteristics, and so on. Current methods of data flow classification are effective, they still lack new inventive approaches to meet the needs of vital points such as real-time traffic classification, low power consumption, ), Central Processing Unit (CPU) utilization, etc. Our novel Fast Deep Packet Header Inspection (FDPHI) traffic classification proposal employs 1 Dimension Convolution Neural Network (1D-CNN) to automatically learn more representational c

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

The software-defined network (SDN) is a new technology that separates the control plane from data ‎plane for the network devices. One of the most significant issues in the video ‎surveillance system is the link failure. When the path failure occurs, the monitoring center cannot receive the ‎video from the cameras. In this paper, two methods are proposed to solve this problem.  The first ‎method uses the Dijkstra algorithm to re-find the path at the source node switch. The second method ‎uses the Dijkstra algorithm to re-find the path at the ingress node switch (or failed link).

FR Almoswai, BN Rashid, PEOPLE: International Journal of Social Sciences, 2017 - Cited by 22