Relevant bibliographies by topics / Cascade algorithm

Academic literature on the topic 'Cascade algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cascade algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Cascade algorithm"

1

Segal, M., and E. Weinstein. "The cascade EM algorithm." Proceedings of the IEEE 76, no. 10 (1988): 1388–90. http://dx.doi.org/10.1109/5.16341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Shuyi, Bo Yang, Hong Xie, and Moru Song. "Applications of an Improved Aerodynamic Optimization Method on a Low Reynolds Number Cascade." Processes 8, no. 9 (September 14, 2020): 1150. http://dx.doi.org/10.3390/pr8091150.

Full text
Abstract:
The effect of cascade aerodynamic optimization on turbomachinery design is very significant. However, for most traditional cascade optimization methods, aerodynamic parameters are considered as boundary conditions and rarely directly used as the optimization variables to realize optimization. Given this problem, this paper proposes an improved cascade aerodynamic optimization method in which an incidence angle and nine geometric parameters are used to parameterize the cascade and one modified optimization algorithm is adopted to find the cascade with the optimal aerodynamic performance. The improved parameterization approach is based on the Non-Uniform Rational B-Splines (NURBS) method, the camber line superposing thickness distribution molding (CLSTDM) method, and the plane cascade design method. To rapidly and effectively find the cascade with the largest average lift-drag ratio within a certain range of incidence angles, modified particle swarm optimization combined with the modified very fast simulated annealing algorithm (PSO-MVFSA) is adopted. To verify the feasibility of the method, a cascade with NACA4412 and a practical cascade are optimized. It is found that the average lift-drag ratios of two optimal performance cascades are respectively increased by 13.38% and 15.21% in comparison to those of two original cascades. Meanwhile, through optimizing the practical cascade of the Blade D500, under different volume flow rates, the pressure coefficient of the optimized cascade is increased by an average of more than 6.12% compared to that of the prototype, and the average efficiency is increased by 11.15%. Therefore, this improved aerodynamic optimization method is reliable and feasible for the performance improvement of cascades with a low Reynolds number.
APA, Harvard, Vancouver, ISO, and other styles
3

Bakir, F., S. Kouidri, T. Belamri, and R. Rey. "On a General Method of Unsteady Potential Calculation Applied to the Compression Stages of a Turbomachine—Part I: Theoretical Approach." Journal of Fluids Engineering 123, no. 4 (June 6, 2001): 780–86. http://dx.doi.org/10.1115/1.1399286.

Full text
Abstract:
An algorithm using the singularity method was developed. It allows taking into account the interaction between fixed and mobile cascades. Its principle is based on the summation of discrete vortices distributed periodically on the rotor and stator profiles. The overall matrix, obtained by applying the boundary conditions, takes into account the complexity of the studied cascade geometry (presence or not of splitter blades, possibly variable pitch of the profiles, etc…) To illustrate the interest and the impact of the algorithm, two parametric studies on turbomachines cascade are presented: Planes cascade made up of a rotor and a stator (at the mean radius of an axial fan). Circular cascade made up of impeller and a volute (peripheral cascade of a centrifugal pump).
APA, Harvard, Vancouver, ISO, and other styles
4

Karlos, Stamatis, Nikos Fazakis, Sotiris Kotsiantis, and Kyriakos Sgarbas. "A Semisupervised Cascade Classification Algorithm." Applied Computational Intelligence and Soft Computing 2016 (2016): 1–14. http://dx.doi.org/10.1155/2016/5919717.

Full text
Abstract:
Classification is one of the most important tasks of data mining techniques, which have been adopted by several modern applications. The shortage of enough labeled data in the majority of these applications has shifted the interest towards using semisupervised methods. Under such schemes, the use of collected unlabeled data combined with a clearly smaller set of labeled examples leads to similar or even better classification accuracy against supervised algorithms, which use labeled examples exclusively during the training phase. A novel approach for increasing semisupervised classification using Cascade Classifier technique is presented in this paper. The main characteristic of Cascade Classifier strategy is the use of a base classifier for increasing the feature space by adding either the predicted class or the probability class distribution of the initial data. The classifier of the second level is supplied with the new dataset and extracts the decision for each instance. In this work, a self-trained NB∇C4.5 classifier algorithm is presented, which combines the characteristics of Naive Bayes as a base classifier and the speed of C4.5 for final classification. We performed an in-depth comparison with other well-known semisupervised classification methods on standard benchmark datasets and we finally reached to the point that the presented technique has better accuracy in most cases.
APA, Harvard, Vancouver, ISO, and other styles
5

Lawton, W., S. L. Lee, and Zuowei Shen. "Convergence of multidimensional cascade algorithm." Numerische Mathematik 78, no. 3 (January 1, 1998): 427–38. http://dx.doi.org/10.1007/s002110050319.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fu, Yun Zhun, and Xu Zhang. "Research on Room Temperature Control of High Accuracy Constant Temperature Room Based on Cascade Control." Applied Mechanics and Materials 48-49 (February 2011): 976–79. http://dx.doi.org/10.4028/www.scientific.net/amm.48-49.976.

Full text
Abstract:
DMC-PID cascade control strategy was adopted to apply on high accuracy constant temperature air conditioning system because constant temperature room had large inertia, delaying, a few interference factors characteristics. The construction type of DMC-PID cascade control system was designed and the prediction model of inner loop and outer loop was determined, and then MATLAB software was applied to simulate and compare robust stability, tracking performance, anti-jamming capability characteristics of DMC-PID cascade control algorithms with other algorithms. Through studies, the overshoot of DMC-PID cascade control of room temperature reduced 2% in comparison with the PID algorithm, but was much larger than that of DMC algorithm. Its regulation time was nearly the same to that DMC algorithm, but cut down 25% in comparison with the PID algorithm. At last, the simulation result showed DMC-PID cascade control strategy application on temperature control of high accuracy constant temperature room had feasibility and effectiveness, and the control strategy had strong robust stability, tracking performance, anti- disturbance ability characteristics.
APA, Harvard, Vancouver, ISO, and other styles
7

Ye, Wenbin. "Multiplierless Multiple-Stage Cascaded FIR Filter Design." Journal of Circuits, Systems and Computers 24, no. 01 (November 10, 2014): 1550011. http://dx.doi.org/10.1142/s0218126615500115.

Full text
Abstract:
It is well known that multiplierless finite impulse response (FIR) filters in multiple-stage cascade form can achieve lower hardware cost and lower coefficient sensitivity than that of single stage design. In this work, a novel algorithm is proposed for the design of multiplierless multiple-stage cascaded FIR filters. Unlike to the conventional algorithms in which the number of stages is fixed and usually is fixed to two, the number of stage in the proposed algorithm is automatically determined. The design examples show that the proposed algorithm significantly outperforms the best existing algorithm in terms of hardware cost and the design time is also saved.
APA, Harvard, Vancouver, ISO, and other styles
8

Zha, Feng, Jiang Ning Xu, and Bai Qing Hu. "Cascade Compensation Algorithm for Strapdown Inertial Navigation System." Advanced Materials Research 179-180 (January 2011): 989–99. http://dx.doi.org/10.4028/www.scientific.net/amr.179-180.989.

Full text
Abstract:
The cascade compensation algorithm for no damp strapdown inertial navigation system (SINS) is designed based on control model and error characteristic of SINS level-loop. According to stability and frequency characteristic analysis for SINS level-loop, a compensation network, which is chosen to alter either the roots location or the frequency response of the system, is cascaded with the SINS level-loop to damp the oscillatory or accumulated errors. The network parameters are attained by designing the frequency characteristic using frequency domain performance indexes, which are transformed from the expected time domain indexes. The algorithm implementation of the compensator is competed by solving the first-order differential equations set, which is derived from Laplace transform of the compensation network using intermediate variables. Results of digital simulation and test on sea proved that the system attitude accuracy improved 1 order and the system position accuracy improved 1 time when the compensation network was cascaded into SINS.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Yu, Maksim Tsikhanovich, and Georgi Smilyanov. "History Sensitive Cascade Model." International Journal of Agent Technologies and Systems 3, no. 2 (April 2011): 53–66. http://dx.doi.org/10.4018/jats.2011040104.

Full text
Abstract:
Diffusion is a process by which information, viruses, ideas, or new behavior spread over social networks. Traditional diffusion models are history insensitive, i.e. only giving activated nodes a one-time chance to activate each of its neighboring nodes with some probability. But history dependent interactions between people are often observed in the real world. This paper proposes the History Sensitive Cascade Model (HSCM), a model of information cascade through a network over time. The authors consider the “activation” problem of finding the probability of that a particular node receives information given that some nodes are initially informed. In this paper it is also proven that selecting a set of k nodes with greatest expected influence is NP-hard, and results from submodular functions are used to provide a greedy approximation algorithm with a 1–1/e–e lower bound, where e depends polynomially on the precision of the solution to the “activation” problem. Finally, experiments are performed comparing the greedy algorithm to three other approximation algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhao, Wei Guo, and Li Ying Wang. "Application of Cascade-Correlation Algorithm in Cavitation Characteristics of Hydro Turbine." Advanced Materials Research 113-116 (June 2010): 250–53. http://dx.doi.org/10.4028/www.scientific.net/amr.113-116.250.

Full text
Abstract:
The cascade correlation algorithm that is cascade-correlation(CC) algorithms, CC network structure and CC network weights learning algorithm are introduced, based on the real data in hydropower station, considering the cavitation characteristics, the network model is established based on CC algorithm, and the applications of CC and BP algorithm of turbine are compared. The results show that the CC algorithm is better than BP neural network, the results can be used in the optimal operation of hydropower, and it has a practical significance.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Cascade algorithm"

1

Dongmo, Guy Blaise. "Rank matrix cascade algorithm, hermite interpolation." Thesis, Stellenbosch : University of Stellenbosch, 2007. http://hdl.handle.net/10019.1/853.

Full text
Abstract:
Thesis (DSc (Mathematical Sciences))--University of Stellenbosch, 2007.
ENGLISH ABSTRACT: (Math symbols have changed) Wavelet and subdivision techniques have developed, over the last two decades, into powerful mathematical tools, for example in signal analysis and geometric modelling. Both wavelet and subdivision analysis are based on the concept of a matrix–refinable function, i.e. a finitely supported matrix function which is self-replicating in the sense that it can be expressed as a linear combination of the integer shifts of its own dilation with factor 2: F = TAF = å k∈Z F(2 ・ −k)Ak. The coefficients Ak, k ∈ Z of d × d matrices, of this linear combination constitute the so-called matrix- mask sequence. Wavelets are in fact constructed as a specific linear combination of the integer shifts of the 2-dilation of a matrix- refinable function cf. [2; 9], whereas the convergence of the associated matrix- subdivision scheme c0 = c, cr+1 = SAcr, r ∈ Z+, SA : c = (ck : k ∈ Z) 7→ SAc = å ℓ∈Z Ak−2ℓ cℓ : k ∈ Z ! , subject to the necessary condition that rank := dim   \ ǫ∈{0,1} n y ∈ Rd : Qǫy = y o   > 0, Qǫ := å j∈Z Aǫ+2j, ǫ ∈ {0, 1}, ( cf. [26]) , implies the existence of a finitely supported matrix- function which is refinable with respect to the mask coefficients defining the refinement equation and the subdivision scheme. Throughout this thesis, we investigate in time–domain for a given matrix mask sequence, the related issues of the existence of a matrix–refinable function and the convergence of the corresponding matrix– cascade algorithm, and finally we apply some results to the particular research area of Hermite interpolatory subdivision schemes. The dissertation is organized as follows: In order to provide a certain flexibility or freedom over the project, we established in Chapter 1 the equivalence relation between the matrix cascade algorithm and the matrix subdivision scheme, subject to a well defined class of initial iterates. Despite the general noncommutativity of matrices, we make use in the full rank case Qǫ = I, ǫ ∈ {0, 1}, of a symbol factorization, to develop in Chapter 2 some useful tools, yielding a convergence result which comes as close to the scalar case as possible: we obtained a concrete sufficient condition on the mask sequence based on the matrix version of the generating function introduced in [3, page 22] for existence and convergence. Whilst the conjecture on nonnegative masks was confirmed in 2005 by Zhou [29], our result on scalar case provided a progress for general mask sequences. We then applied to obtain a new one-parameter family of refinable functions which includes the cardinal splines as a special case, as well as corresponding convergent subdivision schemes. With the view to broaden the class of convergent matrix-masks, we replaced in chapter 3 the full rank condition by the rank one condition Qǫu = u, ǫ ∈ {0, 1}, u := (1, . . . , 1)T, then improved the paper by Dubuc and Merrien [13] by using the theory of rank subdivision schemes by Micchelli and Sauer [25; 26], and end up this improvement with a generalization of [13, Theorem 13, p.8] in to the context of rank subdivision schemes. In Chapter 4, we translated the concrete convergence criteria of the general theory from Theorem 3.2, based on the r-norming factor introduced in [13, Definition 6, p.6], into the context of rank, factorization and spectral radius (cf. [26]), and presented a careful analysis of the relationship between the two concepts. We then proceed with generalizations and improvements: we classified the matrix cascade algorithms in term of rank = 1, 2, . . . , d, and provided a complete characterization of each class with the use of a more general r−norming factor namely τ(r)-norming factor. On the other hand, we presented numerical methods to determine, if possible, the convergence of each class of matrix cascade algorithms. In both the scalar and matrix cases above, we also obtained explicitly the geometric constant appearing in the estimate for the geometric convergence of thematrix-cascade algorithm iterates to the matrix- refinable function. This same geometric convergence rate therefore also holds true for the corresponding matrix–cascade algorithm. Finally, in Chapter 5, we apply the theory and algorithms developed in Chapter 4 to the particular research area of Hermite interpolatory subdivision schemes: we provided a new convergence criterium, and end up with new convergence ranges of the parameters’ values of the famous Hermite interpolatory subdivision scheme with two parameters, due to Merrien [23].
AFRIKAANSE OPSOMMING :(Wiskundige simbole het verander) Golfie en subdivisietegnieke het oor die afgelope twee dekades ontwikkel in kragtige wiskundige gereedskap, byvoorbeeld in seinanalise en geometriesemodellering. Beide golfie en subdivisie analise is gebaseer op die konsep van ’n matriks-verfynbare funksie; oftewel ’n eindig-ondersteunde matriksfunksie F wat selfreproduserend is in die sin dat dit uitgedruk kan word as ’n lineêre kombinasie van die heelgetalskuiwe van F se eie dilasie met faktor 2: F = Σ F(2 · −α)A(α), met A(α), α ∈ Z, wat aandui die sogenaamde matriks-masker ry. Golfies kan dan gekonstrueer word as ’n spesifieke lineêre kombinasie van die funksie ry {F(2 · −α) : α ∈ Z} (sien [2; 9]), terwyl die konvergensie van die ooreenstemmende matriks-subdivisie skema cº = c, cr+1 =(Σ β∈Z A(α − 2β) cr(β) : α ∈ Z ! , r ∈ Z+, onderhewig aan die nodige voorwaarde dat rank := dim   \ ǫ∈{0,1} n y ∈ Rd : Qǫy = y o   > 0, Qǫ := å α∈Z A(ǫ + 2α), ǫ ∈ {0, 1}, (sien [27]) die bestaan impliseer van ’n eindig-ondersteunde matriksfunksie F wat verfynbaar ismet betrekking tot diemaskerko¨effisi¨entewat die subdivisieskema definieer, en in terme waarvan die limietfunksie F van die subdivisieskema uitgedruk kan word as F = å α∈Z F(· − α)c(α). Ons hoofdoel hier is om , in die tydgebied, en vir ’n gegewematriks-masker ry, die verwante kwessies van die bestaan van ’nmatriks-verfynbare funksie en die konvergensie van die ooreenstemmende matriks-kaskade algoritme, en matriks-subdivisieskema, te ondersoek, en om uiteindelik sommige van ons resultate toe te pas op die spesifieke kwessie van die konvergensie van Hermite interpolerende subdivisieskemas. Summary v Eerstens, in Hoofstuk 1, ondersoek ons die verwantskap tussen matriks-kaskade algoritmes en matriks-subdivisie skemas, met verwysing na ’n goedgedefinieerde klas van begin-iterate. Vervolgens beskou ons die volle rang geval Qǫ = I, ǫ ∈ {0, 1}, om, in Hoofstuk 2, nuttige gereedskap te ontwikkel, en wat daarby ’n konvergensie resultaat met ’n sterk konneksie ten opsigte van die skalaar-geval oplewer. Met die doelstelling om ons klas van konvergente matriks-maskers te verbreed, vervang ons, in Hoofstuk 3, die volle rang voorwaarde met die rang een voorwaarde Qǫu = u, ǫ ∈ {0, 1}, u := (1, . . . , 1)T, en verkry ons dan ’n verbetering op ’n konvergensieresultaat in die artikel [14] deur Dubuc en Merrien, deur gebruik te maak van die teorie van rang subdivisieskemas van Micchelli en Sauer [26; 27], waarna ons die resultaat [14, Stelling 13, page 8] na die konteks van rang subdivisieskemas veralgemeen. InHoofstuk 4 herlei ons die konkrete konvergensie kriteria van Stelling 3.2, soos gebaseer op die r-normerende faktor gedefinieer in [14, Definisie 6, page 6] , na die konteks van rang, faktorisering en spektraalradius (sien [27]), en gee ons ’n streng analise van die verwantskap tussen die twee konsepte. Verder stel ons dan bekend ’n nuwe klassifikasie van matriks-kaskade algoritmes ten opsigte van rang, en verskaf ons ’n volledige karakterisering van elke klasmet behulp van ’nmeer algemene r-normerende faktor, nl. die τ(r)-normerende faktor. Daarby gee ons doeltreffende numeriesemetodes vir die implementering van ons teoretiese resultate. Ons verkry ook eksplisiet die geometriese konstante wat voorkom in die afskatting van die geometriese konvergensie van die matriks-kaskade algoritme iterate na die matriks-verfynbare funksie. Ten slotte, in Hoofstuk 5, pas ons die teorie en algoritmes ontwikkel in Hoofstuk 4 toe om die konvergensie van Hermite-interpolerende subdivisieskemas te analiseer. Spesifiek lei ons ’n nuwe konvergensie kriterium af, wat ons dan toepas om nuwe konvergensie gebiede vir die parameter waardes te verkry vir die beroemde Hermite interpolerende subdivisieskema met twee parameters, soos toegeskryf aan Merrien [24].
APA, Harvard, Vancouver, ISO, and other styles
2

Lohiya, Paranjith Singh. "Detection of Nano Particles in TEM Images Using an Ensemble Learning Algorithm." Youngstown State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1432915612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhou, Hao, and 周浩. "An efficient algorithm for face sketch synthesis using Markov weight fields and cascade decomposition method." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49618052.

Full text
Abstract:
Great progress has been made in face sketch synthesis in recent years. State-of-the-art methods commonly apply a Markov Random Fields (MRF) model to select local sketch patches from a set of training data. Such methods, however, have two major drawbacks. Firstly, the MRF model used cannot synthesize new sketch patches. Secondly, the optimization problem in solving the MRF is NP-hard. In this thesis, a novel Markov Weight Fields (MWF) model is proposed. By applying linear combination of candidate patches, MWF is capable of synthesizing new sketch patches. The MWF model can be formulated into a convex quadratic programming (QP) problem to which the optimal solution is guaranteed. Based on the Markov property of MWF model, a cascade decomposition method (CDM) is further proposed for solving such a large scale QP problem efficiently. Experiments show that the proposed CDM is very efficient, and only takes about 2:4 seconds. To deal with illumination changes of input photos, five special shading patches are included as candidate patches in addition to the patches selected from the training data. These patches help keeping structure of the face under different illumination conditions as well as synthesize shadows similar to the input photos. Extensive experiments on the CUHK face sketch database, AR database and Chinese celebrity photos show that the proposed model outperforms the common MRF model used in other state-of-the-art methods and is robust to illumination changes.
published_or_final_version
Computer Science
Master
Master of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
4

Wood, Peter John, and drwoood@gmail com. "Wavelets and C*-algebras." Flinders University. Informatics and Engineering, 2003. http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20070619.120926.

Full text
Abstract:
A wavelet is a function which is used to construct a specific type of orthonormal basis. We are interested in using C*-algebras and Hilbert C*-modules to study wavelets. A Hilbert C*-module is a generalisation of a Hilbert space for which the inner product takes its values in a C*-algebra instead of the complex numbers. We study wavelets in an arbitrary Hilbert space and construct some Hilbert C*-modules over a group C*-algebra which will be used to study the properties of wavelets. We study wavelets by constructing Hilbert C*-modules over C*-algebras generated by groups of translations. We shall examine how this construction works in both the Fourier and non-Fourier domains. We also make use of Hilbert C*-modules over the space of essentially bounded functions on tori. We shall use the Hilbert C*-modules mentioned above to study wavelet and scaling filters, the fast wavelet transform, and the cascade algorithm. We shall furthermore use Hilbert C*-modules over matrix C*-algebras to study multiwavelets.
APA, Harvard, Vancouver, ISO, and other styles
5

Bernardo, Nariane Marselhe Ribeiro. "A semianalytical algorithm to retrieve the suspended particulate matter in a cascade reservoir system with widely differing optical properties /." Presidente Prudente, 2019. http://hdl.handle.net/11449/190950.

Full text
Abstract:
Orientador: Enner Herenio de Alcântara
Resumo: O Material Particulado em Suspensão (MPS) é o principal componente em sistemas aquáticos. Elevadas concentrações de MPS implicam na atenuação da luz, e ocasionam alterações das taxas fotossintéticas. Além disso, a presença de MPS no sistema aquático pode aumentar os níveis de turbidez, absorver poluentes e podem ser considerados como um indicativo de descargas de escoamento superficial. Portanto, monitorar as concentrações de MPS é essencial para a gerar informações técnicas que subsidiem o correto manejo dos recursos aquáticos, prevenindo colapsos hidrológicos. O sensoriamento remoto se mostra como uma eficiente ferramenta para monitorar e mapear MPS quando comparada às técnicas tradicionais de monitoramento, como as medidas in situ. Entretanto, diante de uma grande e complexa variabilidade de componentes óticos, desenvolver modelos de MPS por meio do sinal registrado em sensores remotos é um desafio. Diversos modelos foram desenvolvidos para reservatórios, lagos e lagoas específicos. Atualmente, não há um único modelo capaz de estimar MPS em reservatórios brasileiros em cascata. Com o objetivo de estimar as concentrações de MPS de forma acurada, o objetivo desta tese foi desenvolver um modelo semi-analítico capaz de estimar valores de coeficiente de atenuação, Kd, por meio do uso dos coeficientes de absorção e espalhamento e, consequentemente, utilizar os valores de Kd para estimar as concentrações de MPS. A adoção desta estratégica se baseou na atenuação da luz ao longo da... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: Suspended particulate matter (SPM) is the main component presented within aquatic system. High levels of SPM concentration attenuate the light affecting the photosynthesis rates. Besides, can increase turbidity levels, absorb pollutions and is an indicative of runoff discharges. Therefore, monitoring SPM concentrations is essential to provide reliable information for a correct water management to prevent hydrological collapse. Remote sensing emerges as an efficient tool to map and monitor SPM when compared to traditional techniques, such as in situ measurements. Nevertheless, considering a widely range of optical components, modeling the remote sensing signal in terms of SPM is a challenge. Several models were developed for specific reservoirs, lakes or ponds. Up to our knowledge, there is not a single model capable to retrieve SPM in Brazilian linked reservoirs in a cascade system. In order to accurately estimate SPM, the aim of the thesis was developed a semianalytical model capable to estimate Kd via absorption and backscattering coefficients, and then, use Kd to derive SPM. This approach was adopted because SPM directly contributes to the light attenuation within the water column. Firstly, optical features were investigated. It was found that each reservoir presented a specific optical active component (OAC) dominance, such as Barra Bonita, the first reservoir in cascade is dominated by organic SPM, while Nova Avanhandava, the last reservoir in cascade is dominated by ino... (Complete abstract click electronic access below)
Doutor
APA, Harvard, Vancouver, ISO, and other styles
6

Age, Amber E. "A Survey of the Development of Daubechies Scaling Functions." Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1557.

Full text
Abstract:
Wavelets are functions used to approximate data and can be traced back to several different areas, including seismic geology and quantum mechanics. Wavelets are applicable in many areas, including fingerprint and data compression, earthquake prediction, speech discrimination, and human vision. In this paper, we first give a brief history on the origins of wavelet theory. We will then discuss the work of Daubechies, whose construction of continuous, compactly supported scaling functions resulted in an explosion in the study of wavelets in the 1990's. These scaling functions allow for the construction of Daubechies' wavelets. Next, we shall use the algorithm to construct the Daubechies D4 scaling filters associated with the D4 scaling function. We then explore the Cascade Algorithm, which is a process that uses approximations to get possible representations for the D2N scaling function of Daubechies. Lastly, we will use the Cascade Algorithm to get a visual representation of the D4 scaling function.
APA, Harvard, Vancouver, ISO, and other styles
7

Paduru, Anirudh. "Fast Algorithm for Modeling of Rain Events in Weather Radar Imagery." ScholarWorks@UNO, 2009. http://scholarworks.uno.edu/td/1097.

Full text
Abstract:
Weather radar imagery is important for several remote sensing applications including tracking of storm fronts and radar echo classification. In particular, tracking of precipitation events is useful for both forecasting and classification of rain/non-rain events since non-rain events usually appear to be static compared to rain events. Recent weather radar imaging-based forecasting approaches [3] consider that precipitation events can be modeled as a combination of localized functions using Radial Basis Function Neural Networks (RBFNNs). Tracking of rain events can be performed by tracking the parameters of these localized functions. The RBFNN-based techniques used in forecasting are not only computationally expensive, but also moderately effective in modeling small size precipitation events. In this thesis, an existing RBFNN technique [3] was implemented to verify its computational efficiency and forecasting effectiveness. The feasibility of modeling precipitation events using RBFNN effectively was evaluated, and several modifications to the existing technique have been proposed.
APA, Harvard, Vancouver, ISO, and other styles
8

Oloungha, Stephane B. "Convergence analysis of symmetric interpolatory subdivision schemes." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/5268.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nagavelli, Sai Krishnanand. "Improve Nano-Cube Detection Performance Using A Method of Separate Training of Sample Subsets." Youngstown State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1485267005121308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Durand, Sylvain. "Étude de la vitesse de convergence de l'algorithme en cascade intervenant dans la construction des ondelettes." Paris 9, 1993. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=1993PA090058.

Full text
Abstract:
L'objet de cette thèse est l'étude de la vitesse de convergence des algorithmes de résolution d'une équation à deux échelles. Il s'agit d'algorithmes de point fixe, souvent appelés algorithme en cascade, qui sont utilisés dans la construction des ondelettes. Nous étudions leur vitesse de convergence dans les espaces de Lebesgue et de Besov, et montrons que la qualité de la convergence dépend de deux facteurs indépendants. Le premier, qui va de soi, est la régularité de la fonction d'échelle qui est la solution de l'équation. Le second facteur (qui est la découverte essentielle de cette thèse) concerne des propriétés algébriques spécifiques de la fonction servant à initialiser l'algorithme. Celle-ci doit satisfaire des conditions analogues à celles de fix et strang
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Cascade algorithm"

1

Optimization of a Quantum Cascade Laser Operating in the Terahertz Frequency Range Using a Multiobjective Evolutionary Algorithm. Storming Media, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Prescott, Tony J., and Leah Krubitzer. Evo-devo. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199674923.003.0008.

Full text
Abstract:
This chapter explores how principles underlying natural evo-devo (evolution and development) continue to inspire the design of artificial systems from models of cell growth through to simulated three-dimensional evolved creatures. Research on biological evolvability shows that phenotypic outcomes depend on multiple interactions across different organizational levels—the adult organism is the outcome of a series of genetic cascades modulated in time and space by the wider embryological, bodily, and environmental context. This chapter reviews evo-devo principles discovered in biology and explores their potential for improving the evolvability of artificial systems. Biological topics covered include adaptive, selective, and generative mechanisms, and the role of epigenetic processes in creating phenotypic diversity. Modeling approaches include L-systems, Boolean networks, reaction-diffusion processes, genetic algorithms, and artificial embryogeny. A particular focus is on the evolution and development of the mammalian brain and the possibility of designing, using synthetic evo-devo approaches, brain-like control architectures for biomimetic robots.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Cascade algorithm"

1

Treadgold, N. K., and T. D. Gedeon. "A cascade network algorithm employing Progressive RPROP." In Biological and Artificial Computation: From Neuroscience to Technology, 733–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0032532.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kazikova, Anezka, Krystian Łapa, Michal Pluhacek, and Roman Senkerik. "Cascade PID Controller Optimization Using Bison Algorithm." In Artificial Intelligence and Soft Computing, 406–16. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61401-0_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Drago, Gian Paolo, and Sandro Ridella. "Convergence Properties of the Circular Cascade Correlation algorithm." In Perspectives in Neural Computing, 319–24. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-0811-5_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Xing, Pawel Rozycki, Janusz Kolbusz, and Bogdan M. Wilamowski. "Constructive Cascade Learning Algorithm for Fully Connected Networks." In Artificial Intelligence and Soft Computing, 236–47. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20912-4_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Doering, A., M. Galicki, and H. Witte. "Admissibility and optimality of the cascade-correlation algorithm." In Lecture Notes in Computer Science, 505–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0020205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Duong, Tuan A., and Taher Daud. "Cascade error projection: A learning algorithm for hardware implementation." In Lecture Notes in Computer Science, 450–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/bfb0098202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chudova, D. I., S. A. Dolenko, Yu V. Orlov, D. Yu Pavlov, and I. G. Persiantsev. "Benchmarking of Different Modifications of the Cascade Correlation Algorithm." In Adaptive Computing in Design and Manufacture, 339–44. London: Springer London, 1998. http://dx.doi.org/10.1007/978-1-4471-1589-2_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yen, Sung-Ming, and Chi-Sung Laih. "The fast cascade exponentiation algorithm and its applications on cryptography." In Advances in Cryptology — AUSCRYPT '92, 447–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57220-1_82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Qiao, Xueming, Mingli Yin, Liang Kong, Bin Wang, Xiuli Chang, Qi Ma, Dongjie Zhu, and Ning Cao. "CCTL: Cascade Classifier Text Localization Algorithm in Natural Scene Image." In Advances in Artificial Intelligence and Security, 200–210. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78618-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gangopadhyay, Indrasom, Anulekha Chatterjee, and Indrajit Das. "Face Detection and Expression Recognition Using Haar Cascade Classifier and Fisherface Algorithm." In Recent Trends in Signal and Image Processing, 1–11. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6783-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cascade algorithm"

1

Yang, J., and V. Honavar. "Experiments with the cascade-correlation algorithm." In 1991 IEEE International Joint Conference on Neural Networks. IEEE, 1991. http://dx.doi.org/10.1109/ijcnn.1991.170752.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vega, Nino, Pablo Parra, Luis Cordova, Joselyne Andramuno, and Johnny Alvarez. "Cascade Control Algorithm developed with Embedded Systems." In 2018 IEEE International Conference on Automation/XXIII Congress of the Chilean Association of Automatic Control (ICA-ACCA). IEEE, 2018. http://dx.doi.org/10.1109/ica-acca.2018.8609825.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

HAN, BIN. "THE INITIAL FUNCTIONS IN A CASCADE ALGORITHM." In Proceedings of the International Conference of Computational Harmonic Analysis. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812776679_0009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Châtel, Arnaud, Tom Verstraete, and Grégory Coussement. "Multipoint Optimization of an Axial Turbine Cascade Using a Hybrid Algorithm." In ASME Turbo Expo 2019: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/gt2019-91471.

Full text
Abstract:
Abstract This paper presents a constrained multipoint optimization of the LS89 turbine cascade. The objective of the optimization consists in minimizing the entropy losses generated inside the cascade over a predefined operating range. The operating range is bounded by two operating points respectively characterized by a downstream isentropic Mach number of 0.9 and 1.01. During the optimization, two aerodynamic constraints are imposed in order to conserve the same performance as the original cascade. The first constraint is established on the outlet flow angle in order to achieve at least the same flow turning as the LS89 turbine. The second constraint limits the mass-flow passing through the optimized cascade. The optimization is performed using a hybrid algorithm which combines efficiently a classical evolutionary algorithm with a gradient-based method. The hybridization process between both methods is based on the Lamarckian approach which consists in incorporating directly the gradient method inside the loop of the evolutionary algorithm. In this methodology, the evolutionary method allows to globally explore the overall design space while the gradient-based method locally improves certain designs located in the most promising regions of the search space. First, the better performance of the proposed hybrid method compared to the performance of a classical evolutionary algorithm is demonstrated on two benchmark problems. Then, the methodology is applied on a turbomachinery application in order to minimize the losses in the linear LS89 cascade. The optimization process allows to find a new blade profile which reduces the entropy losses over the entire operating range by at least 9.5 %. Finally, the comparison of the flows computed in the baseline and in the optimized cascades demonstrates that the reduction of the losses is due to a decrease of the entropy generated downstream the trailing edges and within the passages between the optimized blades.
APA, Harvard, Vancouver, ISO, and other styles
5

Ruchay, Alexey, Vitaly Kober, and Evgeniya Evtushenko. "Fast perceptual image hash based on cascade algorithm." In Applications of Digital Image Processing XL, edited by Andrew G. Tescher. SPIE, 2017. http://dx.doi.org/10.1117/12.2272716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wen, Jia, Pengfei Liu, Chu Jia, and Hongjun Wang. "Pedestrian Detection Algorithm Based on Multi-Feature Cascade." In 2018 27th International Conference on Computer Communication and Networks (ICCCN). IEEE, 2018. http://dx.doi.org/10.1109/icccn.2018.8487468.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Flores, Guilherme, Luciano Coelho, Julio Santos, and Bruno Borba. "An algorithm for optimized cascade operation of reservoirs." In 2018 Simposio Brasileiro de Sistemas Eletricos (SBSE) [VII Brazilian Electrical Systems Symposium (SBSE)]. IEEE, 2018. http://dx.doi.org/10.1109/sbse.2018.8395646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Shuiying, Xuebo Jin, and Guang Li. "Face detecting algorithm of the Cascade Adaboost on DSP." In 2010 IEEE International Conference on Mechatronics and Automation (ICMA). IEEE, 2010. http://dx.doi.org/10.1109/icma.2010.5588225.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yu, Wenxiang, Jiapeng Xiu, Chen Liu, and Zhengqiu Yang. "A depth cascade face detection algorithm based on adaboost." In 2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC). IEEE, 2016. http://dx.doi.org/10.1109/icnidc.2016.7974544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Karthik, N., and R. Arul. "Harmonic elimination in cascade multilevel inverters using Firefly algorithm." In 2014 International Conference on Circuit, Power and Computing Technologies (ICCPCT). IEEE, 2014. http://dx.doi.org/10.1109/iccpct.2014.7054758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cascade algorithm' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography