Dissertations / Theses on the topic 'Robuck'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Robuck.'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Peel, Vincent Robert. "Robust methods for robust passive sonar." Thesis, University of Southampton, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305876.
Full textEinicke, Garry A. "Robust filtering /." Title page, contents and introduction only, 1995. http://web4.library.adelaide.edu.au/theses/09PH/09phe35.pdf.
Full textFerry, G. "Robust discrimination." Thesis, University of Newcastle Upon Tyne, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239717.
Full textSim, Melvyn 1971. "Robust optimization." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17725.
Full textIncludes bibliographical references (p. 169-171).
We propose new methodologies in robust optimization that promise greater tractability, both theoretically and practically than the classical robust framework. We cover a broad range of mathematical optimization problems, including linear optimization (LP), quadratic constrained quadratic optimization (QCQP), general conic optimization including second order cone programming (SOCP) and semidefinite optimization (SDP), mixed integer optimization (MIP), network flows and 0 - 1 discrete optimization. Our approach allows the modeler to vary the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations, while keeping the problem tractable. Specifically, for LP, MIP, SOCP, SDP, our approaches retain the same complexity class as the original model. The robust QCQP becomes a SOCP, which is computationally as attractive as the nominal problem. In network flows, we propose an algorithm for solving the robust minimum cost flow problem in polynomial number of nominal minimum cost flow problems in a modified network. For 0 - 1 discrete optimization problem with cost uncertainty, the robust counterpart of a polynomially solvable 0 - 1 discrete optimization problem remains polynomially solvable and the robust counterpart of an NP-hard o-approximable 0-1 discrete optimization problem, remains a-approximable.
(cont.) Under an ellipsoidal uncertainty set, we show that the robust problem retains the complexity of the nominal problem when the data is uncorrelated and identically distributed. For uncorrelated, but not identically distributed data, we propose an approximation method that solves the robust problem within arbitrary accuracy. We also propose a Frank-Wolfe type algorithm for this case, which we prove converges to a locally optimal solution, and in computational experiments is remarkably effective.
by Melvyn Sim.
Ph.D.
Öhrström, Albin, and Jubran Muhsin Fadhil. "Robust sköljtank." Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20078.
Full textThis paper is focusing on the development of a robust rinse tank in a dishwashing machine made for pot washing. The rinse tank plays an important role in the dishwashing process, that is to eliminate any bacteria, dish soap or left-overs, in the last step in the finishing process. Therefore demands on the product is set up, based on the required standards. The demands moststly affect the temperature of the water and the dimensions of an overflow, that will prevent the water from flowing back into the supply water pipelines. The purpose of this paper is to eliminate the problems that occur in the existing rinse tank, such as overheated heat element, unreliable level indicators and corrosion. To achieve this, a new robust rinse tank system is developted, by using an systematic product development method that includes design for manufacturing (DFM) and design for environment (DFE). The work results in a new system for the rinse tank, with a oval-shaped cross-section and contactless level sensors. This new system has a heat element that always is underwater, gives a reliable level indication and has a good resistance against corrosion. Other important improvements are a lower total cost together with a environmental design. The new rinse tank system satisfies the set demands.
Rix, Andrew Iain James. "Robust rotordynamics." Thesis, University of Nottingham, 2016. http://eprints.nottingham.ac.uk/38502/.
Full textAnderson, Cynthia 1962. "A Comparison of Five Robust Regression Methods with Ordinary Least Squares: Relative Efficiency, Bias and Test of the Null Hypothesis." Thesis, University of North Texas, 2001. https://digital.library.unt.edu/ark:/67531/metadc5808/.
Full textLin, Jong-Lick. "Control system design for robust stability and robust performance." Thesis, University of Leicester, 1992. http://hdl.handle.net/2381/34797.
Full textGupta, Pramod. "Robust clustering algorithms." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39553.
Full textCetinyurek, Aysun. "Robust Control Charts." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/3/12607987/index.pdf.
Full textetinyü
rek, Aysun M. Sc., Department of Statistics Supervisor: Dr. BariS Sü
rü
cü
Co-Supervisor: Assoc. Prof. Dr. Birdal Senoglu December 2006, 82 pages Control charts are one of the most commonly used tools in statistical process control. A prominent feature of the statistical process control is the Shewhart control chart that depends on the assumption of normality. However, violations of underlying normality assumption are common in practice. For this reason, control charts for symmetric distributions for both long- and short-tailed distributions are constructed by using least squares estimators and the robust estimators -modified maximum likelihood, trim, MAD and wave. In order to evaluate the performance of the charts under the assumed distribution and investigate robustness properties, the probability of plotting outside the control limits is calculated via Monte Carlo simulation technique.
Fu, Ye. "Robust adaptive control." Thesis, University of British Columbia, 1989. http://hdl.handle.net/2429/30574.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
Schumann, David Heinz. "Robust Variable Selection." NCSU, 2009. http://www.lib.ncsu.edu/theses/available/etd-03262009-153524/.
Full textOlver, Neil. "Robust network design." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=95085.
Full textMotivé par les applications concernantes les réseaux de communication, le dessein des réseaux robustes applique les méthodes très réusies provenant de l'optimisation robuste. La prémisse principale est que les demandes sur le réseau ne sont pas fixes, mais variables ou incertaines. Cependant, nous savons qu'elles sont tirées d'un ensemble d'incertitude prescrit. Il faut que la solution ait une capacité suffisante pour pouvoir router toute demande appartenant à cet ensemble. En outre, il faut que le routage soit oublieux, ce qui signifie qu'il peut être fixé à l'avance, et ne dépends pas du choix particulier de la demande appartenant de l'ensemble d'incertitude. Dans ce cadre, il existe un choix particulier d'ensemble d'incertitude qui mène au « modèle de tuyau ». Ce modèle a reçu une attention particulière à causede ses applications aux réseaux privés virtuels. On connaissait un 2-rapprochement utilisant une solution en forme d'arbre. La « Conjecture de VPN » énonce que cette solution en forme d'arbre est toujours optimale. L'un des résultats principaux de cette thèse démontre cette conjecture en toute généralité. En outre, nous donnons un contre-exemple à une version plus forte de la conjecture concernant les chemins multiples (le routage étant fractionnel) qui avait également été proposée. Nous initions l'étude du problème de la conception de réseaux robustes dans une plus grande généralité, en insistant sur l'approximabilité. Dans le modèle général, où l'ensemble d'incertitude est un polyèdre séparable arbitraire, nous donnons un résultat fort d'inapproximabilité. Nous considérons ensuite un nouveau modèle naturel généralisant le modèle de tuyau symétrique, qui est basé sur des demandes qui peuvent être routées sur un arbre donné, et nous fournissons un algorithme ayant un facteur de rapprochement constant. Finalement, nous comparons le routage oublieux avec le schéma beaucoup plus flexible (
Foisy, André. "Robust collision detection." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=28746.
Full textSince the computer representation of real numbers is finite, an interval projective point is used to encompass all localization errors of a modeled point. An interval point is the elementary geometrical form from which all others are constructed. The Euclidean convex set spanned by an interval point is also a polytope.
The construction of a polytope relies on a robust convex hull algorithm. The computed hull is guaranteed to contain all interval projective points.
An extrusion based collision detection algorithm builds an AND-OR decision tree. Each leaf is a univariate function that expresses the relation between a moving point and a moving plane. Interval zero finding methods are applied to find the overlap and non-overlap portions of the trajectories of moving polytopes.
The swept-volume based collision detection algorithm depends on the construction of a convex approximation that comprises the real swept volume. To obtain a convex approximation, the convex hull algorithm is applied to the bounding volumes of the vertices of a moving polytope. Each bounding volume is an interval projective point.
Finally, both collision detection algorithms are tested in the context of generate-and-test path planning.
Anderson, Ross John. "Robust computer security." Thesis, University of Cambridge, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338198.
Full textCheng, You-Chi. "Robust gesture recognition." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53492.
Full textPearce, Kim Frances. "Robust logistic discrimination." Thesis, University of Newcastle Upon Tyne, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294687.
Full textREYNA, FERNANDO ROLFI QUINECHE. "ROBUST OPTIMAL PORTFOLIO." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2001. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=1938@1.
Full textOs mercados de ações dos países emergentes tem como principal característica a presença de dias atípicos, os quais fazem impossível o uso, com sucesso, dos modelos de equilíbrio. O principal objetivo desta pesquisa é a de desenvolver uma nova teoria, baseada na estatísica robusta, que possa ser aplicada a estes mercados sem ser seriamente afetada por observações extremas, e que ao mesmo tempo, ofereça resultados eficientes e precisos.
Emergent stock markets are characterized by the presence of atypical days, which make impossible the use of equilibrium models with sucess. The main aim of this research is to define a new theory, based on the robust statistical theory, which could be applied to those markets without being affected by extreme observations and, at the same time, offer efficient and accurate results.
Los mercados de acciones de los países emergentes tienen como principal característica la presencia de días atípicos, lo que hace imposible el uso, con suceso, de los modelos de equilibrio. EL objetivo principal de esta investigación es desarrollar una nueva teoría, basada en la estadística robusta, que pueda ser aplicada a estos mercados sin ser seriamente afectada por observaciones extremas, y que al mismo tiempo, obtenga resultados eficientes y precisos.
Barr, Mohammad. "Robust logo watermarking." Thesis, De Montfort University, 2018. http://hdl.handle.net/2086/16550.
Full textZhou, Chong. "Robust Auto-encoders." Digital WPI, 2016. https://digitalcommons.wpi.edu/etd-theses/393.
Full textChua, Shui Ying. "Robust network design." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99030.
Full textThesis: S.M., Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2015. In conjunction with the Leaders for Global Operations Program at MIT.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 61-63).
As an equipment manufacturer for the mining and construction industries, Caterpillar's business is heavily impacted by the cyclicality of these two industries. To be competitive in the market while investing prudently to ensure shareholders' value, Caterpillar needs to make capacity decisions with peaks and troughs of the cycles in mind. Through the peaks and troughs of business cycles, the perceptions change from not enough capacity to under-utilization of asset constrained capacity respectively. The purpose of this thesis is to establish a framework that enhances robustness in investment decision-making within the 2-6 year capacity planning horizon. This entails the ability to balance risk and return for the company and account for the cyclical nature of business and other strategic considerations. The project also aims to enhance consistency across stakeholders and introduce an aggregate risk perspective under corporate capital constraint.
by Shui Ying Chua.
M.B.A.
S.M.
Teo, Kwong Meng. "Nonconvex robust optimization." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40303.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 133-138).
We propose a novel robust optimization technique, which is applicable to nonconvex and simulation-based problems. Robust optimization finds decisions with the best worst-case performance under uncertainty. If constraints are present, decisions should also be feasible under perturbations. In the real-world, many problems are nonconvex and involve computer-based simulations. In these applications, the relationship between decision and outcome is not defined through algebraic functions. Instead, that relationship is embedded within complex numerical models. Since current robust optimization methods are limited to explicitly given convex problems, they cannot be applied to many practical problems. Our proposed method, however, operates on arbitrary objective functions. Thus, it is generic and applicable to most real-world problems. It iteratively moves along descent directions for the robust problem, and terminates at a robust local minimum. Because the concepts of descent directions and local minima form the building blocks of powerful optimization techniques, our proposed framework shares the same potential, but for the richer, and more realistic, robust problem.
(cont.) To admit additional considerations including parameter uncertainties and nonconvex constraints, we generalized the basic robust local search. In each case, only minor modifications are required - a testimony to the generic nature of the method, and its potential to be a component of future robust optimization techniques. We demonstrated the practicability of the robust local search technique in two realworld applications: nanophotonic design and Intensity Modulated Radiation Therapy (IMRT) for cancer treatment. In both cases, the numerical models are verified by actual experiments. The method significantly improved the robustness for both designs, showcasing the relevance of robust optimization to real-world problems.
by Kwong Meng Teo.
Ph.D.
Hsiao, Kaijen. "Relatively robust grasping." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55115.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 135-138).
This thesis presents an approach for grasping objects robustly under significant positional uncertainty. In the field of robot manipulation there has been a great deal of work on how to grasp objects stably, and in the field of robot motion planning there has been a great deal of work on how to find collision-free paths to those grasp positions. However, most of this work assumes exact knowledge of the shapes and positions of both the object and the robot; little work has been done on how to grasp objects robustly in the presence of position uncertainty. To reason explicitly about uncertainty while grasping, we model the problem as a partially observable Markov decision process (POMDP). We derive a closed-loop strategy that maintains a belief state (a probability distribution over world states), and select actions with a receding horizon using forward search through the belief space. Our actions are world-relative trajectories (WRT): fixed trajectories expressed relative to the most-likely state of the world. We localize the object, ensure its reachability, and robustly grasp it at a specified position by using information-gathering, reorientation, and goal-seeking WRT actions. This framework is used to grasp objects (including a power drill and a Brita pitcher) despite significant uncertainty, using a 7-DOF Barrett Arm and attached 4-DOF Barrett Hand equipped with force and contact sensors. Our approach is generalizable to almost any sensor type, as well as wide ranges of sensor error and pose uncertainty.
by Kaijen Hsiao.
Ph.D.
Pritchard, David (David Alexander Griffith). "Robust network computation." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/37069.
Full textIncludes bibliographical references (p. 91-98).
In this thesis, we present various models of distributed computation and algorithms for these models. The underlying theme is to come up with fast algorithms that can tolerate faults in the underlying network. We begin with the classical message-passing model of computation, surveying many known results. We give a new, universally optimal, edge-biconnectivity algorithm for the classical model. We also give a near-optimal sub-linear algorithm for identifying bridges, when all nodes are activated simultaneously. After discussing some ways in which the classical model is unrealistic, we survey known techniques for adapting the classical model to the real world. We describe a new balancing model of computation. The intent is that algorithms in this model should be automatically fault-tolerant. Existing algorithms that can be expressed in this model are discussed, including ones for clustering, maximum flow, and synchronization. We discuss the use of agents in our model, and give new agent-based algorithms for census and biconnectivity. Inspired by the balancing model, we look at two problems in more depth.
(cont.) First, we give matching upper and lower bounds on the time complexity of the census algorithm, and we show how the census algorithm can be used to name nodes uniquely in a faulty network. Second, we consider using discrete harmonic functions as a computational tool. These functions are a natural exemplar of the balancing model. We prove new results concerning the stability and convergence of discrete harmonic functions, and describe a method which we call Eulerization for speeding up convergence.
by David Pritchard.
M.Eng.
Yu, Chun. "Robust mixture modeling." Diss., Kansas State University, 2014. http://hdl.handle.net/2097/18153.
Full textDepartment of Statistics
Weixin Yao and Kun Chen
Ordinary least-squares (OLS) estimators for a linear model are very sensitive to unusual values in the design space or outliers among y values. Even one single atypical value may have a large effect on the parameter estimates. In this proposal, we first review and describe some available and popular robust techniques, including some recent developed ones, and compare them in terms of breakdown point and efficiency. In addition, we also use a simulation study and a real data application to compare the performance of existing robust methods under different scenarios. Finite mixture models are widely applied in a variety of random phenomena. However, inference of mixture models is a challenging work when the outliers exist in the data. The traditional maximum likelihood estimator (MLE) is sensitive to outliers. In this proposal, we propose a Robust Mixture via Mean shift penalization (RMM) in mixture models and Robust Mixture Regression via Mean shift penalization (RMRM) in mixture regression, to achieve simultaneous outlier detection and parameter estimation. A mean shift parameter is added to the mixture models, and penalized by a nonconvex penalty function. With this model setting, we develop an iterative thresholding embedded EM algorithm to maximize the penalized objective function. Comparing with other existing robust methods, the proposed methods show outstanding performance in both identifying outliers and estimating the parameters.
Bai, Xue. "Robust linear regression." Kansas State University, 2012. http://hdl.handle.net/2097/14977.
Full textDepartment of Statistics
Weixin Yao
In practice, when applying a statistical method it often occurs that some observations deviate from the usual model assumptions. Least-squares (LS) estimators are very sensitive to outliers. Even one single atypical value may have a large effect on the regression parameter estimates. The goal of robust regression is to develop methods that are resistant to the possibility that one or several unknown outliers may occur anywhere in the data. In this paper, we review various robust regression methods including: M-estimate, LMS estimate, LTS estimate, S-estimate, [tau]-estimate, MM-estimate, GM-estimate, and REWLS estimate. Finally, we compare these robust estimates based on their robustness and efficiency through a simulation study. A real data set application is also provided to compare the robust estimates with traditional least squares estimator.
Cardoso, João Nuno Martins. "Robust mean variance." Master's thesis, Instituto Superior de Economia e Gestão, 2015. http://hdl.handle.net/10400.5/10706.
Full textEste estudo empírico tem como objectivo avaliar o impacto da estimação robusta nos portefólios de média variância. Isto foi conseguido fazendo uma simulação do comportamento de 15 acções do SP500. Esta simulação inclui dois cenários: um com amostras que seguem uma distribuição normal e outro com amostras contaminadas não normais. Cada cenário inclui 200 reamostragens. O performance dos portefólios estimados usando a máxima verosimilhança (clássicos) e dos portefólios estimados de forma robusta são comparados, resultando em algumas conclusões: Em amostras normais, portefólios robustos são marginalmente menos eficientes que os portefólios clássicos. Contudo, em amostras não normais, os portefólios robustos apresentam um performance muito superior que os portefólios clássicos. Este acréscimo de performance está positivamente correlacionado com o nível de contaminação da amostra. Em suma, assumindo que os retornos financeiros têm uma distribuição não normal, podemos afirmar que os estimadores robustos resultam em portefólios de média variância mais estáveis.
This empirical study's objective is to evaluate the impact of robust estimation on mean variance portfolios. This was accomplished by doing a simulation on the behavior of 15 SP500 stocks. This simulation includes two scenarios: One with normally distributed samples and another with contaminated non-normal samples. Each scenario includes 200 resamples. The performance of maximum likelihood (classical) estimated portfolios and robustly estimated portfolios are compared, resulting in some conclusions: On normally distributed samples, robust portfolios are marginally less efficient than classical portfolios. However, on non-normal samples, robust portfolios present a much higher performance than classical portfolios. This increase in performance is positively correlated with the level of contamination present on the sample. In summary, assuming that financial returns do not present a normal distribution, we can state that robust estimators result in more stable mean variance portfolios.
Shen, Dennis Ph D. Massachusetts Institute of Technology. "Robust synthetic control." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115743.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 63-65).
In this thesis, we present a robust generalization of the synthetic control method. A distinguishing feature of our algorithm is that of de-noising the data matrix via singular value thresholding, which renders our approach robust in multiple facets: it automatically identifies a good subset of donors, functions without extraneous covariates (vital to existing methods), and overcomes missing data (never been addressed in prior works). To our knowledge, we provide the first theoretical finite sample analysis for a broader class of models than previously considered in literature. Additionally, we relate the inference quality of our estimator to the amount of training data available and show our estimator to be asymptotically consistent. In order to move beyond point estimates, we introduce a Bayesian framework that not only provides practitioners the ability to readily develop different estimators under various loss functions, but also equips them with the tools to quantitatively measure the uncertainty of their model/estimates through posterior probabilities. Our empirical results demonstrate that our robust generalization yields a positive impact over the classical synthetic control method, underscoring the value of our key de-noising procedure.
by Dennis Shen.
S.M.
Chen, Ho-Lin. "Robust self-assembly /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Full textFischer, Jeffrey M. "Robust service composition." Diss., Restricted to subscribing institutions, 2008. http://proquest.umi.com/pqdweb?did=1779690531&sid=3&Fmt=2&clientId=1564&RQT=309&VName=PQD.
Full textKnott, Paul Alexander. "Robust quantum metrology." Thesis, University of Leeds, 2015. http://etheses.whiterose.ac.uk/8931/.
Full textLiu, Chengyuan. "Robust model predictive control : robust control invariant sets and efficient implementation." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/45529.
Full textRippel, Markus. "Improved robustness formulations and a simulation-based robust concept exploration method." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31850.
Full textCommittee Chair: Allen, Janet K.; Committee Member: Choi, Seung-Kyum; Committee Member: Mistree, Farrokh. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Al-Takrouri, Saleh Othman Saleh Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Robust state estimation and model validation techniques in computer vision." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/41002.
Full textZhao, Yong. "Nonlinear compensation and heterogeneous data modeling for robust speech recognition." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47566.
Full textSmith, Barry Craig. "Robust Airline Fleet Assignment." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4930.
Full textBalci, Salih Eren. "Robust Watermarking Of Images." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1091917/index.pdf.
Full textTshangini, Mati. "Multicell robust downlink beamforming." Thesis, King's College London (University of London), 2016. https://kclpure.kcl.ac.uk/portal/en/theses/multicell-robust-downlink-beamforming(fde2310c-98de-440c-ab32-6a4257489d8c).html.
Full textKpamegan, Neil Racheed. "Robust Principal Component Analysis." Thesis, American University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10784806.
Full textIn multivariate analysis, principal component analysis is a widely popular method which is used in many different fields. Though it has been extensively shown to work well when data follows multivariate normality, classical PCA suffers when data is heavy-tailed. Using PCA with the assumption that the data follows a stable distribution, we will show through simulations that a new method is better. We show the modified PCA can be used for heavy-tailed data and that we can more accurately estimate the correct number of components compared to classical PCA and more accurately identify the subspace spanned by the important components.
Nosratighods, Mohaddeseh Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Robust speaker verification system." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/42796.
Full textViswanathan, Murlikrishna. "Towards robust discovery systems." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/9397.
Full textWestendorp, James Computer Science & Engineering Faculty of Engineering UNSW. "Robust incremental relational learning." Awarded by:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/43513.
Full textPradhan, Sameer S. "Robust semantic role labeling." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3239377.
Full textWülfert, Florian. "Temperature-robust multivariate calibration." [S.l. : Amsterdam : s.n.] ; Universiteit van Amsterdam [Host], 2004. http://dare.uva.nl/document/76379.
Full textJaganathan, Venkata Krishnan. "Robust motion estimation techniques." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/6032.
Full textThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on April 15, 2008) Includes bibliographical references.
Jaehn, Florian. "Robust flight gate assignment." Frankfurt, M. Berlin Bern Bruxelles New York, NY Oxford Wien Lang, 2007. http://d-nb.info/987654136/04.
Full textJaehn, Florian. "Robust flight gate assignment /." Frankfurt am Main [u.a.] : Lang, 2008. http://d-nb.info/987654136/04.
Full textBatur, Aziz Umit. "Illumination-robust face recognition." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15440.
Full textWitkowski, Jens [Verfasser], and Bernhard [Akademischer Betreuer] Nebel. "Robust peer prediction mechanisms." Freiburg : Universität, 2015. http://d-nb.info/1119805538/34.
Full textYoon, Tae-Woong. "Robust adaptive predictive control." Thesis, University of Oxford, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359527.
Full text