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 ligand 2-[1-(1H-indol-3-yl)ethylimino) methyl]naphthalene-1-ol, derived from 1-hydroxy-2-naphthaldehyde and 2-(1H-indol-3-yl)ethylamine, was used to produce a new sequence of metal ions complexes. Thus ligand reactions with NiCl₂.6H₂O, PdCl₂, FeCl_3.6H₂O and H₂PtCl₆.6H₂O were sequentially made to collect mono-nuclear Ni(II), Pd(II), Fe (III), and Pt(IV). (IR or FTIR), Ultraviolet Reflective (UV–visible), Mass Spectra analysis, Bohr-magnetic (B.M.), metal content, chloride content and molar conductivity have been the defining features of the composites. The Fe(III) and Pt(IV) complexes have octahedral geometries, while the Ni(II) complex has tetra

Background: Oral Lichen Planus (OLP) is a chronic inflammatory mucosal disease, presenting in various clinical forms WHO had regarded OLP as a precancerous conditions in 1978 because of its potential with cancer. Both antigen-specific and nonspecific mechanisms involved in the pathogenesis of OLP. Oral Squamous Cell Carcinoma (OSCC) is the most common malignant neoplasm of the oral cavity representing more than 94% of oral cancer. It occurs in different sites and has many etiological factors. Cyclin Dl is a proto-oncogene which consider as the key protein in the regulation of cell proliferation and its overexpression led to the occurrence and progression of malignant tumors.NF-KB p65 is a member ofNF-kB family of transcription factors that

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

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.