The increased use of hybrid PET /CT scanners combining detailed anatomical information along withfunctional data has benefits for both diagnostic and therapeutic purposes. This presented study is to makecomparison of cross sections to produce 18F , 82Sr and68Ge via different reactions with particle incident energy up to 60 MeV as a part of systematic studies on particle-induced activations on enriched natNe, natRb, natGa 18O,85Rb, and 69Ga targets, theoretical calculation of production yield, calculation of requiredtarget and suggestion of optimum reaction to produce: Fluorine-18 , Strontium-82 andGermanium-68 touse in Hybrid Machines PET/CT Scanners.
In this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.
Objectives: Recently, there have been important advances in the clinical application of targeted hybrid near-infrared (NIR) fluorescent-radioactive tracers. ICG-99mTc-nanocolloid, for example, is already being used by some centres for sentinel lymph node biopsy in head and neck cancer. The radioactive component allows imaging at depths which would not be possible with NIR alone and, once exposed, the NIR fluorescence reporter can be imaged at very high resolution. Gamma detection is currently carried out with a separate hand-held gamma camera or with a non-imaging probe. Visualisation of NIR fluorescence during surgery requires a dedicated NIR camera, several of which are available commercially. We describe a novel hand-held hybrid NIR-gamm
... Show MoreThe paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w
... Show Moreconventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th
... Show MoreSoftware testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing
... Show More