444 resultados para Modified Berlekamp-Massey algorithm
Resumo:
Modification of exfoliated graphite (EG) electrode with generation 2 poly(propylene imine) dendrimer by electrodeposition resulted in an electrochemical sensor which was used to detect lead ions in water to a limit of 1 ppb and a linear response between 2.5 and 40 ppb using square wave anodic stripping voltammetry (SW-ASV). Pb(II) was also removed from spiked water sample using a 40-mm diameter unmodified EG electrode with an applied potential of -1,000 mV for 180 min. A removal efficiency of 99% was calculated from a 150 mL sample. The results obtained in both cases using SW-ASV, correlated with atomic absorption spectroscopy.
Resumo:
This is the first successful attempt to produce simultaneously ultrafine grain size and weak texture in a single-phase magnesium alloy Mg-3Al-0.4Mn through an optimal choice of processing parameters in a modified multi-axial forging (MAF) process. An average grain size of similar to 0.4 mu m and a weak texture could be achieved. This has led to an increase in the strength as well as room-temperature ductility (55%). The plot of the yield loci shows a decrease in anisotropy after MAF. (C) 2011 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.
Resumo:
This paper presents a new algorithm for extracting Free-Form Surface Features (FFSFs) from a surface model. The extraction algorithm is based on a modified taxonomy of FFSFs from that proposed in the literature. A new classification scheme has been proposed for FFSFs to enable their representation and extraction. The paper proposes a separating curve as a signature of FFSFs in a surface model. FFSFs are classified based on the characteristics of the separating curve (number and type) and the influence region (the region enclosed by the separating curve). A method to extract these entities is presented. The algorithm has been implemented and tested for various free-form surface features on different types of free-form surfaces (base surfaces) and is found to correctly identify and represent the features irrespective of the type of underlying surface. The representation and extraction algorithm are both based on topology and geometry. The algorithm is data-driven and does not use any pre-defined templates. The definition presented for a feature is unambiguous and application independent. The proposed classification of FFSFs can be used to develop an ontology to determine semantic equivalences for the feature to be exchanged, mapped and used across PLM applications. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
A transient flame simulation tool based on unsteady Reynolds average Navier Stokes (RANS) is characterized for stationary and nonstationary flame applications with a motivation of performing computationally affordable flame stability studies. Specifically, the KIVA-3V code is utilized with incorporation of a recently proposed modified eddy dissipation concept for simulating turbulence-chemistry interaction along with a model for radiation loss. Detailed comparison of velocities, turbulent kinetic energies, temperature, and species are made with the experimental data of the turbulent, non-premixed DLR_A CH4/H-2/N-2 jet flame. The comparison shows that the model is able to predict flame structure very well. The effect of some of the modeling assumptions is assessed, and strategies to model a stationary diffusion flame are recommended. Unsteady flame simulation capabilities of the numerical model are assessed by simulating an acoustically excited, experimental, oscillatory H-2-air diffusion flame. Comparisons are made with oscillatory velocity field and OH plots, and the numerical code is observed to predict transient flame structure well.
Resumo:
We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.
Resumo:
Genetic Algorithms (GAs) are recognized as an alternative class of computational model, which mimic natural evolution to solve problems in a wide domain including machine learning, music generation, genetic synthesis etc. In the present study Genetic Algorithm has been employed to obtain damage assessment of composite structural elements. It is considered that a state of damage can be modeled as reduction in stiffness. The task is to determine the magnitude and location of damage. In a composite plate that is discretized into a set of finite elements, if a jth element is damaged, the GA based technique will predict the reduction in Ex and Ey and the location j. The fact that the natural frequency decreases with decrease in stiffness is made use of in the method. The natural frequency of any two modes of the damaged plates for the assumed damage parameters is facilitated by the use of Eigen sensitivity analysis. The Eigen value sensitivities are the derivatives of the Eigen values with respect to certain design parameters. If ωiu is the natural frequency of the ith mode of the undamaged plate and ωid is that of the damaged plate, with δωi as the difference between the two, while δωk is a similar difference in the kth mode, R is defined as the ratio of the two. For a random selection of Ex,Ey and j, a ratio Ri is obtained. A proper combination of Ex,Ey and j which makes Ri−R=0 is obtained by Genetic Algorithm.
Resumo:
This paper proposes a method of short term load forecasting with limited data, applicable even at 11 kV substation levels where total power demand is relatively low and somewhat random and weather data are usually not available as in most developing countries. Kalman filtering technique has been modified and used to forecast daily and hourly load. Planning generation and interstate energy exchange schedule at load dispatch centre and decentralized Demand Side Management at substation level are intended to be carried out with the help of this short term load forecasting technique especially to achieve peak power control without enforcing load-shedding.
Resumo:
Pin loaded lug joints fitted with different types of pins are analysed in the presence of cracks at pin-plate interface. An algorithm for finite element contact stress analysis of joints developed earlier to deal with varying partial contact/separation at the pin-plate interface using a marching solution is used in the present analysis. Stress Intensity Factors (SIF) at the crack tips are evaluated using Modified Crack Closure Integral (MCCI) method within the realm of Linear Elastic Fracture Mechanics (LEFM) assumptions. A comparison of fatigue crack growth lives between interference and push fit pin joints is carried out using these SIF's. Results from a finite element analysis on a push fit pin joint are used to fit experimental fatigue crack growth data.
Resumo:
Stirred tank bioreactors, employed in the production of a variety of biologically active chemicals, are often operated in batch, fed-batch, and continuous modes of operation. The optimal design of bioreactor is dependent on the kinetics of the biological process, as well as the performance criteria (yield, productivity, etc.) under consideration. In this paper, a general framework is proposed for addressing the two key issues related to the optimal design of a bioreactor, namely, (i) choice of the best operating mode and (ii) the corresponding flow rate trajectories. The optimal bioreactor design problem is formulated with initial conditions and inlet and outlet flow rate trajectories as decision variables to maximize more than one performance criteria (yield, productivity, etc.) as objective functions. A computational methodology based on genetic algorithm approach is developed to solve this challenging multiobjective optimization problem with multiple decision variables. The applicability of the algorithm is illustrated by solving two challenging problems from the bioreactor optimization literature.