Low Power and Less Area Architecture for Integer Motion Estimation

Full search block matching algorithm is widely used for hardware implementation of motion estimators in video compression algorithms. In this paper we are proposing a new architecture, which consists of a 2D parallel processing unit and a 1D unit both working in parallel. The proposed architecture reduces both data access power and computational power which are the main causes of power consumption in integer motion estimation. It also completes the operations with nearly the same number of clock cycles as compared to a 2D systolic array architecture. In this work sum of absolute difference (SAD)-the most repeated operation in block matching, is calculated in two steps. The first step is to calculate the SAD for alternate rows by a 2D parallel unit. If the SAD calculated by the parallel unit is less than the stored minimum SAD, the SAD of the remaining rows is calculated by the 1D unit. Early termination, which stops avoidable computations has been achieved with the help of alternate rows method proposed in this paper and by finding a low initial SAD value based on motion vector prediction. Data reuse has been applied to the reference blocks in the same search area which significantly reduced the memory access.

Metaheuristic Algorithms for Decoding Binary Linear Codes

This paper introduces two decoders for binary linear codes based on Metaheuristics. The first one uses a genetic algorithm and the second is based on a combination genetic algorithm with a feed forward neural network. The decoder based on the genetic algorithms (DAG) applied to BCH and convolutional codes give good performances compared to Chase-2 and Viterbi algorithm respectively and reach the performances of the OSD-3 for some Residue Quadratic (RQ) codes. This algorithm is less complex for linear block codes of large block length; furthermore their performances can be improved by tuning the decoder-s parameters, in particular the number of individuals by population and the number of generations. In the second algorithm, the search space, in contrast to DAG which was limited to the code word space, now covers the whole binary vector space. It tries to elude a great number of coding operations by using a neural network. This reduces greatly the complexity of the decoder while maintaining comparable performances.

Investigation of Plant Density and Weed Competition in Different Cultivars of Wheat In Khoramabad Region

In order to study the effect of plant density and competition of wheat with field bindweed (Convolvulus arvensis) on yield and agronomical properties of wheat(Triticum Sativum) in irrigated conditions, a factorial experiment as the base of complete randomize block design in three replication was conducted at the field of Kamalvand in khoramabad (Lorestan) region of Iran during 2008-2009. Three plant density (Factor A=200, 230 and 260kg/ha) three cultivar (Factor B=Bahar,Pishtaz and Alvand) and weed control (Factor C= control and no control of weeds)were assigned in experiment. Results show that: Plant density had significant effect (statistically) on seed yield, 1000 seed weight, weed density and dry weight of weeds, seed yield and harvest index had been meaningful effect for cultivars. The interaction between plant density and cultivars for weed density, seed yield, thousand seed weight and harvest index were significant. 260 kg/ha (plant density) of wheat had more effect on increasing of seed yield in Bahar cultivar wheat in khoramabad region of Iran.

Effects of Winter and Spring Sowing on Yield Components of Safflower Genotypes

The research was conducted with three replications as “Randomized Block Design” in Konya-Turkey ecological conditions. In the study, 16 of promising safflower lines (A8, E1, F4, F6, G16, H14, I1), and 1 cultivar (Dinçer) were evaluated in 2008-09 growing season. Some of the yield components such as plant height (cm), first branch height (cm), number of branches per plant, 1000 seed weight (g), seed yield (kg ha-1), oil content (%), oil yield (kg ha-1) were determined. Winter sowing showed higher values than spring sowing. The highest values were taken from Dinçer for plant height (86.7 cm), E1 (37.5 cm) for first branch height, F6 for number of branch (11.6 per plant), I1 for number of head (24.9 per plant), A8 for 1000 seed weight (51.75 g), Dinçer for seed yield (2927.1 kg ha-1), oil content (28.79 %) and also for oil yield (87.44 kg ha-1) respectively.

Effect of Azespirilium Bacteria in Reducing Nitrogen Fertilizers (Urea) and the Interaction of it with Stereptomyces Sp due the Biological Control on the Wheat (Triticum Asstivum) Sustinibelation Culture

An experiment was conducted in October 2008 due the ability replacement plant associate biofertilizers by chemical fertilizers and the qualifying rate of chemical N fertilizers at the moment of using this biofertilizers and the interaction of this biofertilizer on each other. This field experiment has been done in Persepolis (Throne of Jamshid) and arrange by using factorial with the basis of randomized complete block design, in three replication Azespirilium SP bacteria has been admixed with consistence 108 cfu/g and inoculated with seeds of wheat, The streptomyces SP has been used in amount of 550 gr/ha and concatenated on clay and for the qualifying range of chemical fertilizer 4 level of N chemical fertilizer from the source of urea (N0=0, N1=60, N2=120, N3=180) has been used in this experiment. The results indicated there were Significant differences between levels of Nitrogen fertilizer in the entire characteristic which has been measured in this experiment. The admixed Azespirilium SP showed significant differences between their levels in the characteristics such as No. of fertile ear, No. of grain per ear, grain yield, grain protein percentage, leaf area index and the agronomic fertilizer use efficiency. Due the interaction streptomyses with Azespirilium SP bacteria this actinomycet didn-t show any statistically significant differences between it levels.

The Effect of Interlamellar Distance in Pearlite on CGI Machining

Swedish truck industry is investigating the possibility for implementing the use of Compacted Graphite Iron (CGI) in their heavy duty diesel engines. Compared to the alloyed gray iron used today, CGI has superior mechanical properties but not as good machinability. Another issue that needs to be addressed when implementing CGI is the inhomogeneous microstructure when the cast component has different section thicknesses, as in cylinder blocks. Thinner sections results in finer pearlite, in the material, with higher strength. Therefore an investigation on its influence on machinability was needed. This paper focuses on the effect that interlamellar distance in pearlite has on CGI machinability and material physical properties. The effect of pearlite content and nodularity is also examined. The results showed that interlamellar distance in pearlite did not have as large effect on the material physical properties or machinability as pearlite content. The paper also shows the difficulties of obtaining a homogeneous microstructure in inhomogeneous workpieces.

A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem

This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small. By doing intensive search in each block, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed algorithm, computational experiments are carried out based on benchmark problem instances. The computational results show that algorithm proposed in this paper is efficient for solving the TSPs.

Design and Manufacturing of a Propeller for Axial-Flow Fan

This work presents a methodology for the design and manufacture of propellers oriented to the experimental verification of theoretical results based on the combined model. The design process begins by using algorithms in Matlab which output data contain the coordinates of the points that define the blade airfoils, in this case the NACA 6512 airfoil was used. The modeling for the propeller blade was made in NX7, through the imported files in Matlab and with the help of surfaces. Later, the hub and the clamps were also modeled. Finally, NX 7 also made possible to create post-processed files to the required machine. It is possible to find the block of numbers with G & M codes about the type of driver on the machine. The file extension is .ptp. These files made possible to manufacture the blade, and the hub of the propeller.

Processing, Morphological, Thermal and Absorption Behavior of PLA/Thermoplastic Starch/Montmorillonite Nanocomposites

Thermoplastic starch, polylactic acid glycerol and maleic anhydride (MA) were compounded with natural montmorillonite (MMT) through a twin screw extruder to investigate the effects of different loading of MMT on structure, thermal and absorption behavior of the nanocomposites. X-ray diffraction analysis (XRD) showed that sample with MMT loading 4phr exhibited exfoliated structure while sample that contained MMT 8 phr exhibited intercalated structure. FESEM images showed big lump when MMT loading was at 8 phr. The thermal properties were characterized by using differential scanning calorimeter (DSC). The results showed that MMT increased melting temperature and crystallization temperature of matrix but reduction in glass transition temperature was observed Meanwhile the addition of MMT has improved the water barrier property. The nanosize MMT particle is also able to block a tortuous pathway for water to enter the starch chain, thus reducing the water uptake and improved the physical barrier of nanocomposite.

Study The Effects of Conventional and Low Input Production System on Energy Efficiency of Silybum marianum L.

Medicinal plants are most suitable crops for ecological production systems because of their role in human health and the aim of sustainable agriculture to improve ecosystem efficiency and its products quality. Calculations include energy output (contents of energy in seed) and energy inputs (consumption of fertilizers, pesticides, labor, machines, fuel and electricity). The ratio of output of the production to inputs is called the energy outputs / inputs ratio or energy efficiency. One way to quantify essential parts of agricultural development is the energy flow method. The output / input energy ratio is proposed as the most comprehensive single factor in pursuing the objective of sustainability. Sylibum marianum L. is one of the most important medicinal plants in Iran and has effective role on health of growing population in Iran. The objective of this investigation was to find out energy efficiency in conventional and low input production system of Milk thistle. This investigation was carried out in the spring of 2005 – 2007 in the Research Station of Rangelands in Hamand - Damavand region of IRAN. This experiment was done in split-split plot based on randomized complete block design with 3 replications. Treatments were 2 production systems (Conventional and Low input system) in the main plots, 3 planting time (25 of March, 4 and 14 of April) in the sub plots and 2 seed types (Improved and Native of Khoozestan) in the sub-sub plots. Results showed that in conventional production system energy efficiency, because of higher inputs and less seed yield, was less than low input production system. Seed yield was 1199.5 and 1888 kg/ha in conventional and low input systems, respectively. Total energy inputs and out puts for conventional system was 10068544.5 and 7060515.9 kcal. These amounts for low input system were 9533885.6 and 11113191.8 kcal. Results showed that energy efficiency for seed production in conventional and low input system was 0.7 and 1.16, respectively. So, milk thistle seed production in low input system has 39.6 percent higher energy efficiency than conventional production system. Also, higher energy efficiency were found in sooner planting time (25 of March) and native seed of Khoozestan.

Enhanced GA-Fuzzy OPF under both Normal and Contingent Operation States

The genetic algorithm (GA) based solution techniques are found suitable for optimization because of their ability of simultaneous multidimensional search. Many GA-variants have been tried in the past to solve optimal power flow (OPF), one of the nonlinear problems of electric power system. The issues like convergence speed and accuracy of the optimal solution obtained after number of generations using GA techniques and handling system constraints in OPF are subjects of discussion. The results obtained for GA-Fuzzy OPF on various power systems have shown faster convergence and lesser generation costs as compared to other approaches. This paper presents an enhanced GA-Fuzzy OPF (EGAOPF) using penalty factors to handle line flow constraints and load bus voltage limits for both normal network and contingency case with congestion. In addition to crossover and mutation rate adaptation scheme that adapts crossover and mutation probabilities for each generation based on fitness values of previous generations, a block swap operator is also incorporated in proposed EGA-OPF. The line flow limits and load bus voltage magnitude limits are handled by incorporating line overflow and load voltage penalty factors respectively in each chromosome fitness function. The effects of different penalty factors settings are also analyzed under contingent state.

A Content Based Image Watermarking Scheme Resilient to Geometric Attacks

Multimedia security is an incredibly significant area of concern. The paper aims to discuss a robust image watermarking scheme, which can withstand geometric attacks. The source image is initially moment normalized in order to make it withstand geometric attacks. The moment normalized image is wavelet transformed. The first level wavelet transformed image is segmented into blocks if size 8x8. The product of mean and standard and standard deviation of each block is computed. The second level wavelet transformed image is divided into 8x8 blocks. The product of block mean and the standard deviation are computed. The difference between products in the two levels forms the watermark. The watermark is inserted by modulating the coefficients of the mid frequencies. The modulated image is inverse wavelet transformed and inverse moment normalized to generate the watermarked image. The watermarked image is now ready for transmission. The proposed scheme can be used to validate identification cards and financial instruments. The performance of this scheme has been evaluated using a set of parameters. Experimental results show the effectiveness of this scheme.

On Mobile Checkpointing using Index and Time Together

Checkpointing is one of the commonly used techniques to provide fault-tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence, checkpointing protocols having lesser number of synchronization messages and fewer checkpoints are preferred in mobile environment. There are two different approaches, although not orthogonal, to checkpoint mobile computing systems namely, time-based and index-based. Our protocol is a fusion of these two approaches, though not first of its kind. In the present exposition, an index-based checkpointing protocol has been developed, which uses time to indirectly coordinate the creation of consistent global checkpoints for mobile computing systems. The proposed algorithm is non-blocking, adaptive, and does not use any control message. Compared to other contemporary checkpointing algorithms, it is computationally more efficient because it takes lesser number of checkpoints and does not need to compute dependency relationships. A brief account of important and relevant works in both the fields, time-based and index-based, has also been included in the presentation.

Hardware Description Language Design of Σ-Δ Fractional-N Phase-Locked Loop for Wireless Applications

This paper discusses a systematic design of a Σ-Δ fractional-N Phase-Locked Loop based on HDL behavioral modeling. The proposed design consists in describing the mixed behavior of this PLL architecture starting from the specifications of each building block. The HDL models of critical PLL blocks have been described in VHDL-AMS to predict the different specifications of the PLL. The effect of different noise sources has been efficiently introduced to study the PLL system performances. The obtained results are compared with transistor-level simulations to validate the effectiveness of the proposed models for wireless applications in the frequency range around 2.45 GHz.

Connected Vertex Cover in 2-Connected Planar Graph with Maximum Degree 4 is NP-complete

This paper proves that the problem of finding connected vertex cover in a 2-connected planar graph ( CVC-2 ) with maximum degree 4 is NP-complete. The motivation for proving this result is to give a shorter and simpler proof of NP-Completeness of TRA-MLC (the Top Right Access point Minimum-Length Corridor) problem [1], by finding the reduction from CVC-2. TRA-MLC has many applications in laying optical fibre cables for data communication and electrical wiring in floor plans.The problem of finding connected vertex cover in any planar graph ( CVC ) with maximum degree 4 is NP-complete [2]. We first show that CVC-2 belongs to NP and then we find a polynomial reduction from CVC to CVC-2. Let a graph G0 and an integer K form an instance of CVC, where G0 is a planar graph and K is an upper bound on the size of the connected vertex cover in G0. We construct a 2-connected planar graph, say G, by identifying the blocks and cut vertices of G0, and then finding the planar representation of all the blocks of G0, leading to a plane graph G1. We replace the cut vertices with cycles in such a way that the resultant graph G is a 2-connected planar graph with maximum degree 4. We consider L = K -2t+3 t i=1 di where t is the number of cut vertices in G1 and di is the number of blocks for which ith cut vertex is common. We prove that G will have a connected vertex cover with size less than or equal to L if and only if G0 has a connected vertex cover of size less than or equal to K.

Effectiveness of Contourlet vs Wavelet Transform on Medical Image Compression: a Comparative Study

Discrete Wavelet Transform (DWT) has demonstrated far superior to previous Discrete Cosine Transform (DCT) and standard JPEG in natural as well as medical image compression. Due to its localization properties both in special and transform domain, the quantization error introduced in DWT does not propagate globally as in DCT. Moreover, DWT is a global approach that avoids block artifacts as in the JPEG. However, recent reports on natural image compression have shown the superior performance of contourlet transform, a new extension to the wavelet transform in two dimensions using nonseparable and directional filter banks, compared to DWT. It is mostly due to the optimality of contourlet in representing the edges when they are smooth curves. In this work, we investigate this fact for medical images, especially for CT images, which has not been reported yet. To do that, we propose a compression scheme in transform domain and compare the performance of both DWT and contourlet transform in PSNR for different compression ratios (CR) using this scheme. The results obtained using different type of computed tomography images show that the DWT has still good performance at lower CR but contourlet transform performs better at higher CR.

Modelling Sudoku Puzzles as Block-world Problems

Sudoku is a kind of logic puzzles. Each puzzle consists of a board, which is a 9×9 cells, divided into nine 3×3 subblocks and a set of numbers from 1 to 9. The aim of this puzzle is to fill in every cell of the board with a number from 1 to 9 such that in every row, every column, and every subblock contains each number exactly one. Sudoku puzzles belong to combinatorial problem (NP complete). Sudoku puzzles can be solved by using a variety of techniques/algorithms such as genetic algorithms, heuristics, integer programming, and so on. In this paper, we propose a new approach for solving Sudoku which is by modelling them as block-world problems. In block-world problems, there are a number of boxes on the table with a particular order or arrangement. The objective of this problem is to change this arrangement into the targeted arrangement with the help of two types of robots. In this paper, we present three models for Sudoku. We modellized Sudoku as parameterized multi-agent systems. A parameterized multi-agent system is a multi-agent system which consists of several uniform/similar agents and the number of the agents in the system is stated as the parameter of this system. We use Temporal Logic of Actions (TLA) for formalizing our models.

A Novel Reversible Watermarking Method based on Adaptive Thresholding and Companding Technique

Embedding and extraction of a secret information as well as the restoration of the original un-watermarked image is highly desirable in sensitive applications like military, medical, and law enforcement imaging. This paper presents a novel reversible data-hiding method for digital images using integer to integer wavelet transform and companding technique which can embed and recover the secret information as well as can restore the image to its pristine state. The novel method takes advantage of block based watermarking and iterative optimization of threshold for companding which avoids histogram pre and post-processing. Consequently, it reduces the associated overhead usually required in most of the reversible watermarking techniques. As a result, it keeps the distortion small between the marked and the original images. Experimental results show that the proposed method outperforms the existing reversible data hiding schemes reported in the literature.

Hybrid Function Method for Solving Nonlinear Fredholm Integral Equations of the Second Kind

A numerical method for solving nonlinear Fredholm integral equations of second kind is proposed. The Fredholm type equations which have many applications in mathematical physics are then considered. The method is based on hybrid function  approximations. The properties of hybrid of block-pulse functions and Chebyshev polynomials are presented and are utilized to reduce the computation of nonlinear Fredholm integral equations to a system of nonlinear. Some numerical examples are selected to illustrate the effectiveness and simplicity of the method.

Effect of Phosphate Solubilization Microorganisms (PSM) and Plant Growth Promoting Rhizobacteria (PGPR) on Yield and Yield Components of Corn (Zea mays L.)

In order to study the effect of phosphate solubilization microorganisms (PSM) and plant growth promoting rhizobacteria (PGPR) on yield and yield components of corn Zea mays (L. cv. SC604) an experiment was conducted at research farm of Sari Agricultural Sciences and Natural Resources University, Iran during 2007. Experiment laid out as split plot based on randomized complete block design with three replications. Three levels of manures (consisted of 20 Mg.ha-1 farmyard manure, 15 Mg.ha-1 green manure and check or without any manures) as main plots and eight levels of biofertilizers (consisted of 1-NPK or conventional fertilizer application; 2-NPK+PSM+PGPR; 3 NP50%K+PSM+PGPR; 4- N50%PK+PSM +PGPR; 5-N50%P50%K+PSM+ PGPR; 6-PK+PGPR; 7- NK+PSM and 8-PSM+PGPR) as sub plots were treatments. Results showed that farmyard manure application increased row number, ear weight, grain number per ear, grain yield, biological yield and harvest index compared to check. Furthermore, using of PSM and PGPR in addition to conventional fertilizer applications (NPK) could improve ear weight, row number and grain number per row and ultimately increased grain yield in green manure and check plots. According to results in all fertilizer treatments application of PSM and PGPR together could reduce P application by 50% without any significant reduction of grain yield. However, this treatment could not compensate 50% reduction of N application.