A (k,n)-arc A in a finite projective plane PG(2,q) over Galois field GF(q), q=p⿠for same prime number p and some integer n≥2, is a set of k points, no n+1 of which are collinear. A (k,n)-arc is complete if it is not contained in a(k+1,n)-arc. In this paper, the maximum complete (k,n)-arcs, n=2,3 in PG(2,4) can be constructed from the equation of the conic.
Cadmium oxide (CdO) thin films were deposited using the sequencing ion layer adsorption and reaction (SILAR) method. In this study, the effect of the pH value of an aqueous solution of cadmium acetate at a concentration of 0.2 mol of the cadmium oxide film was determined. The solution source for the cadmium oxide film was cadmium ions and an aqueous ammonia solution. The CdO films were deposited on glass substrates at a temperature of 90 ℃. The cadmium oxide film thickness was determined by the weight difference method at pH values (7.2, 8.2). X-ray diffraction (XRD) and scanning electron microscopy (SEM) showed that the size of the crystals increased with the increase in the solution (pH). While the UV-visible spectra of the fil
... Show MoreThe preparation of tin metal from stannous chloride solution by wet method in the presence of aluminum powder as a reducing agent is studied. The preparation is commenced through a reduction step in the presence of reducing agent followed by smelting step at elevated temperature in a programmable electrical furnace. In the reduction step, preliminary experiments are conducted to study the effect of initial acidity, time of addition of the aluminum powder and excess amount of reducing agent on the conversion of stannous to tin metal. Three different parameters are studied through smelting step, these are : heating rate, temperature and residence time.
To characterize the product, different instrumental analyses are used:
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
A loS.sless (reversible) data hiding (embedding) method inside an image (translating medium) - presented in the present work using L_SB (least significant bit). technique which enables us to translate data using an image (host image), using a secret key, to be undetectable without losing any data or without changing the size and the external scene (visible properties) of the image, the hid-ing data is then can be extracted (without losing) by reversing &n
... Show MoreThe extracting of personal sprite from the whole image faced many problems in separating the sprite edge from the unneeded parts, some image software try to automate this process, but usually they couldn't find the edge or have false result. In this paper, the authors have made an enhancement on the use of Canny edge detection to locate the sprite from the whole image by adding some enhancement steps by using MATLAB. Moreover, remove all the non-relevant information from the image by selecting only the sprite and place it in a transparent background. The results of comparing the Canny edge detection with the proposed method shows improvement in the edge detection.
Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show MoreA coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c
... Show MoreIn :the _pr sent _paper we report ths. ynthesis ·of a new li:ga!!d..
[f4LJ [{'2 {1-'[(2-hyd•:0xy-.ben:zy1i.den·e)..,bxcJrazanci}:etby-l }benzerieÂ
J,5 t;rtiol .aad its complexes ·w-ith '('Mlif(1 J Fev 1 ), ed(J'l), and. :f.::I:g 01>-)
The ligand \VS preP..ated rin tWo steps' • fp I t}Je nrst stea -soJutiQil Qf
-saUcyla[deeyeq. ip methatt:oJ . re3ctcd lU1der reflux
... Show More